Skip to Content

Wiki source code of Elements of Set Theory:

Last modified by Xwiki VePa on 2025/01/08 07:38
Show last authors
1 == Elements of Set Theory, Spring 2017 ==
2
3 = (% style="color: rgb(255,0,0);" %)**Levy reflection today June 26 at 12:30, 3rd floor blackboards**(%%) =
4
5 {{panel}}
6 **Teacher:**  [[Juliette Kennedy>>doc:mathstatHenkilokunta.Kennedy, Juliette]]
7
8 **Scope:** 10 cr
9
10 **Type:** Intermediate
11
12 **Teaching:**
13
14 **Topics: We will cover Dedekind's construction of the reals, moving on from there to the basic theory of ordinal and cardinal numbers, equivalents of the Axiom of Choice, and the study of other ZFC axioms.**
15
16 **Prerequisites: Some "mathematical maturity" is helpful. Basic logic is helpful too but not required.**
17 {{/panel}}
18
19 (% style="font-size: 20.0px;color: rgb(255,0,0);" %)**
20 **
21
22 (% style="font-size: 20.0px;color: rgb(255,0,0);" %)**
23 **
24
25 (% style="font-size: 20.0px;" %)Teaching schedule
26
27 Tuesdays and Thursdays 12-14, room C123.
28
29 Example class Wednesday 10-12, room DK117.
30
31 == Exams ==
32
33 (% style="color: rgb(255,0,0);" %)**Your grade for the course is your grade on the final exam.**
34
35 == Course material ==
36
37 == (% style="font-size: 14.0px;" %)We will go through the classic text of H. Enderton called "Elements of Set Theory"(%%) ==
38
39 == [[Registration>>url:https://weboodi.helsinki.fi/hy/opintjakstied.jsp?html=1&Tunniste=57088||shape="rect"]] ==
40
41 == (% style="color: rgb(96,96,96);" %)Did you forget to register? (%%)[[What to do?>>doc:mathstatOpiskelu.Etusivu.Kysymys4.WebHome]] ==
42
43 == Exercises ==
44
45 === Assignment numbers all refer to the textbook. ===
46
47 * Set 1: p. 64: problems 46, 48, 54. p. 70: 1. p. 73: 2,3,4,5,6
48 * Set 2: p. 78, problem 7. p.83: 13-17. (% style="color: rgb(255,0,0);" %)**IF THERE IS TIME:**(%%) p. 88: 18-26
49 * Set 3: p. 88: 18-26. p. 101: 4, 6,7,8,9
50 * Set 4: p. 111: 10,11,12,13,14. p. 120: 19,20. Prove: If a continuous function from [0,1] into the reals is negative for some value in [0,1] and positive for some value in [0,1],
51 then there is a value z in [0,1] such that f(z)=0. HINT: use the least upper bound property. (% style="color: rgb(255,0,0);" %)Extra Question: if we define reals as equivalence classes of Cauchy sequences, the how do you prove the least upper bound property (i.e. the completeness of the real line)? Hmmmm....maybe think abut the Axiom of Choice? (% style="font-size: 16.0px;font-weight: bold;" %)
52
53 * (% style="color: rgb(0,0,0);" %)Set 5: p. 118, prove theorems 5RH, 5RI, 5RJ. p. 120-121: 16-19. p. 133: 1-5.
54 * (% style="color: rgb(0,0,0);" %)Set 6: Prove the Cantor-Schroder-Bernstein Theorem: If f: A → B is a 1-1 mapping, and g: B→ A is a 1-1 mapping, the the sets A and B are equinumerous. Prove theorem 6I, parts 3,5,6. p. 158: 18-22; 25
55 * (% style="color: rgb(0,0,0);" %)Set 7: p. 178, 4,5,6,7
56 * (% style="color: rgb(0,0,0);" %)Set 8: p. 184, 10,11. p. 187, 12,13,14. Read ahead and do, on p. 194: 16, 18. **Prove clauses 3 and 4 on p. 181 in the transfinite recursion theorem.**
57 * (% style="color: rgb(0,0,0);" %)**Set 9: Prove theorem 7I on p. 188. Prove corollary 7N, a,b,c,d. Prove theorem 7M in detail. p. 195, exercises 15,16. p. 199, problem 22.**
58 * (% style="color: rgb(0,0,0);" %)**Set 10: p. 195, problem 18. On page 199, verify the sentence on line 4: "Then D \in C, since D...." p. 200: 23,24,25. **
59 * (% style="color: rgb(0,0,0);" %)**p. 207: 26,27,29, 31,36, 37,38,39**
60 * (% style="color: rgb(0, 0, 0); color: rgb(0, 0, 0)" %) (%%)(((
61 (% style="color: rgb(0,0,0);" %)**p. 215: 1. p. 219: 3,4,7. **(% style="color: rgb(0,0,255);" %)**Prove:** If A is a well-ordered proper class, which is "set-like", then A has a least element (with respect to the w.o on A):
62
63 (% style="color: rgb(0, 0, 0); color: rgb(0, 0, 0)" %)** **(% style="color: rgb(0, 0, 0); color: rgb(0, 0, 0); color: rgb(0, 0, 255)" %)**Hint:** Consider the formula phi(z) & [forall y ( phi(y)~-~-> W(z,y)], where phi defines the class A and W(x,y) defines the w.o on A. (A w.o. class is "set-like", if seg t is a set for all t in the class.(% style="color: rgb(0, 0, 0); color: rgb(0, 0, 0)" %)
64 (% style="color: rgb(0,0,255);" %)**Corollary:** Transfinite INDUCTION principle (see. p. 174) holds for well-ordered classes. In case the w.o. is not set-like, one can still prove the theorem, but this requires a different proof. See [[attach:Well-ordered classes.pdf]]
65
66 (% style="color: rgb(0,51,102);" %)**LAST HOMEWORK: p. 226: 12-16, 17,18; p. 22,23,24,26**
67
68 (% style="color: rgb(0,0,0);" %)**
69 **
70 )))
71
72
73
74 * (% style="font-size: 16.0px;font-weight: bold;" %)Exercise classes
75
76 (% class="wrapped" %)
77 |=(((
78 Group
79 )))|=(((
80 Day
81 )))|=(((
82 Time
83 )))|=(((
84 Room
85 )))|=(% colspan="1" %)(((
86 Instructor
87 )))
88 |(((
89 1.
90 )))|(((
91
92 )))|(((
93
94 )))|(((
95
96 )))|(% colspan="1" %)(((
97
98 )))
99 |(((
100 2.
101 )))|(((
102
103 )))|(((
104
105 )))|(((
106
107 )))|(% colspan="1" %)(((
108
109 )))
110 |(((
111 3.
112 )))|(((
113
114 )))|(((
115
116 )))|(((
117
118 )))|(% colspan="1" %)(((
119
120 )))
121 |(% colspan="1" %)(((
122 4.
123 )))|(% colspan="1" %)(((
124
125 )))|(% colspan="1" %)(((
126
127 )))|(% colspan="1" %)(((
128
129 )))|(% colspan="1" %)(((
130
131 )))
132 |(% colspan="1" %)(((
133 5.
134 )))|(% colspan="1" %)(((
135
136 )))|(% colspan="1" %)(((
137
138 )))|(% colspan="1" %)(((
139
140 )))|(% colspan="1" %)(((
141
142 )))
143 |(% colspan="1" %)(((
144 6.
145 )))|(% colspan="1" %)(((
146
147 )))|(% colspan="1" %)(((
148
149 )))|(% colspan="1" %)(((
150
151 )))|(% colspan="1" %)(((
152
153 )))
154 |(% colspan="1" %)(((
155 7.
156 )))|(% colspan="1" %)(((
157
158 )))|(% colspan="1" %)(((
159
160 )))|(% colspan="1" %)(((
161
162 )))|(% colspan="1" %)(((
163
164 )))
165
166 == Course feedback ==
167
168 Course feedback can be given at any point during the course. Click [[here>>url:https://elomake.helsinki.fi/lomakkeet/11954/lomake.html||style="line-height: 1.4285;" shape="rect"]].