10-327/Classnotes for Thursday November 18: Difference between revisions

From Drorbn
Jump to navigationJump to search
No edit summary
No edit summary
Line 14: Line 14:


[http://katlas.math.toronto.edu/drorbn/index.php?title=Image:10-327_lecpt4.jpg Lecture part 4]
[http://katlas.math.toronto.edu/drorbn/index.php?title=Image:10-327_lecpt4.jpg Lecture part 4]

'''Questions by Kai [[User:Xwbdsb|Xwbdsb]] 21:26, 19 November 2010 (EST):'''

# I have concern about this "Adding T_1 thing". When we are proving the Urysohn's Lemma, we proved that if X is a T.S. and A,B are any two disjoint closed sets in X, they can be separated by two disjoint open sets in X iff they can be separated by a continuous function. So there is no T_1 axiom involved in any of these two proofs. So Urysohn's Lemma is something more general than T_4 iff T_4.5 right?
#* You are probably right and Urysohn applies even without <math>T_1</math>. Yet we want <math>T1</math> all else <math>T_{4.5}</math> does not imply <math>T_{3.5}</math> and below, and we will need <math>T_{3.5}</math> very soon. [[User:Drorbn|Drorbn]] 06:02, 20 November 2010 (EST)
# I just want to also confirm the definition of T_4 and T_4.5: T_4 is T_1 + separation by two disjoint open sets for any two disjoint closed sets and T_4.5 is T_1 + separation by a continuous function for any two disjoint closed sets?
#* Indeed so. [[User:Drorbn|Drorbn]] 06:02, 20 November 2010 (EST)
# The only purpose of this manually adding T_1 thing is that so that T_4 and T_4.5 could imply T_3 T_2 T_1 right?
#* Indeed. [[User:Drorbn|Drorbn]] 06:02, 20 November 2010 (EST)
# Dror you said before that induction can go up to finite n but why in this case induction will work for a countably infinite set of elements?
#* We are never making a statement about an infinite set of rational numbers directly through induction. We are only constructing something for the <math>n</math>'th rational, for each <math>n</math>. We then look at the totality of these constructions, but that's already ''outside'' the induction. [[User:Drorbn|Drorbn]] 06:02, 20 November 2010 (EST)

Revision as of 06:02, 20 November 2010

See some blackboard shots at BBS/10_327-101118-142430.jpg (unfortunately some blackboards from the middle of the proof or Urysohn's lemma got forgotten).

Dror's notes above / Student's notes below

Here are some lecture notes:

Lecture part 1

Lecture part 2

Lecture part 3

Lecture part 4

Questions by Kai Xwbdsb 21:26, 19 November 2010 (EST):

  1. I have concern about this "Adding T_1 thing". When we are proving the Urysohn's Lemma, we proved that if X is a T.S. and A,B are any two disjoint closed sets in X, they can be separated by two disjoint open sets in X iff they can be separated by a continuous function. So there is no T_1 axiom involved in any of these two proofs. So Urysohn's Lemma is something more general than T_4 iff T_4.5 right?
    • You are probably right and Urysohn applies even without . Yet we want all else does not imply and below, and we will need very soon. Drorbn 06:02, 20 November 2010 (EST)
  2. I just want to also confirm the definition of T_4 and T_4.5: T_4 is T_1 + separation by two disjoint open sets for any two disjoint closed sets and T_4.5 is T_1 + separation by a continuous function for any two disjoint closed sets?
    • Indeed so. Drorbn 06:02, 20 November 2010 (EST)
  3. The only purpose of this manually adding T_1 thing is that so that T_4 and T_4.5 could imply T_3 T_2 T_1 right?
    • Indeed. Drorbn 06:02, 20 November 2010 (EST)
  4. Dror you said before that induction can go up to finite n but why in this case induction will work for a countably infinite set of elements?
    • We are never making a statement about an infinite set of rational numbers directly through induction. We are only constructing something for the 'th rational, for each . We then look at the totality of these constructions, but that's already outside the induction. Drorbn 06:02, 20 November 2010 (EST)