Bulletin Board for the full semester course on Ordered Sets (Spring 2006) by Tero Harju My Homepage

Lectures: Exercises: Thursday 10 - 12 in XXI Friday 12 - 14 in XXIV Wednesday 12 - 16 in MS3 (3rd floor) Problem set 1 Problem set 2 Problem set 3 Problem set 4 Problem set 5 Problem set 6 Problem set 7 Problem set 8 Problem set 9 Problem set 10 Problem set 11 Problem set 12 Notes Misprints and additions Download lecture notes: Ordered Sets These notes are in pdf. Page 6: C is a maximal chain if each z not in C is incomparable with an element of C. A neat drawing of a partition poset (pdf). The proof of Theorem 1.38 is corrected again (pdf). Add in Lemma 1.43: Let P be well-founded. Theorem 1.46: Let P be partially well-ordered. (Not just well-founded) 1st line of the proof of Lemma 1.48: up-set of y, not down-set. Clarified Examples 1.59 and 1.61 In the latter part of the proof of Theorem 2.48: change in all places a to j Theorem 2.49: ... Then A is a convex sublattice At the end of page 51: b=(y Ùv) Úu c=(z Ùv) Úu Proof of Thm 3.18, line 10: z = a Ú x¢ for some x¢ Î (x], and so also a Úx Î F. Proof of Thm 3.22, 1st claim: The mapping j Updated: Spring 2006.