This sheet introduces the continuum CC through a series of axioms.

Axiom 1. The continuum is a nonempty set CC.

We often refer to elements of CC as points.

Definition 2.1. Let XX be a set. An ordering on the set XX is a subset << of X×XX \times X, with elements (x,y)∈<(x,y) \in < written as x<yx < y, satisfying the following properties:

(a) For all x,y∈Xx, y \in X such that x≠yx \neq y, either x<yx < y or y<xy < x.
(b) For all x,y∈Xx, y \in X, if x<yx < y then x≠yx \neq y.
(c) For all x,y,z∈Xx, y, z \in X, if x<yx < y and y<zy < z then x<zx < z.

Axiom 2. There exists an ordering << on CC.

Theorem 2.2. If xx and yy are points of CC, then x<yx < y and y<xy < x are not both true.

Definition 2.3. If A⊂CA \subset C is a subset of CC, then a point a∈Aa \in A is a first point of AA if, for every element x∈Ax \in A, either a<xa < x or a=xa = x. Similarly, a point b∈Ab \in A is called a last point of AA if, for every x∈Ax \in A, either x<bx < b or x=bx = b.

Lemma 2.4. If AA is a nonempty, finite subset of CC, then AA has a first and last point.

Theorem 2.5. Suppose that AA is a set of nn distinct points in CC, or, in other words, A⊂CA \subset C has cardinality nn. Then symbols a1,…,ana_1, \ldots, a_n may be assigned to each point of AA so that a1<a2<⋯<ana_1 < a_2 < \dots < a_n, i.e. ai<ai+1a_i < a_{i+1} for 1≤i≤n−11 \leq i \leq n-1.

proof 1: use lemma 2.4, choose frist point p1p_{1} and last point p2p_{2}, and form a set A1=A/{p1,p2}A_{1}=A/\{p_{1},p_{2} \}. A1A_{1} is a nonempty, finite subset of C, so A1A_{1} also has a frist and last point. Again, choose p3,p4p_{3},p_{4} and form A2A_{2}. Repeat the process.∎

proof 2: use definitioon 2.1 design an algorithm∎

Definition 2.6. If x,y,z∈Cx, y, z \in C and both x<yx < y and y<zy < z, then we say that yy is between xx and zz.

Corollary 2.7. Of three distinct points, one must be between the other two.

Axiom 3. CC has no first or last point.

Definition 2.8. If a,b∈Ca, b \in C and a<ba < b, then the set of points between aa and bb is called a region, denoted by abab.

Warning 2.9. One often sees the notation (a,b)(a, b) for regions. We will reserve the notation (a,b)(a, b) for ordered pairs in a product A×BA \times B. These are very different things.

Theorem 2.10. If xx is a point of CC, then there exists a region abab such that x∈abx \in ab.

Proof: By Axiom 3. There exists a point a<xa<x and b>xb>x.∎

We now come to one of the most important definitions of this course:

Definition 2.11. Let AA be a nonempty subset of CC. A point pp of CC is called a limit point of AA if every region RR containing pp has nonempty intersection with A∖{p}A \setminus \{p\}. Explicitly, this means:

for every region RR with p∈Rp \in R, we have R∩(A∖{p})≠∅R \cap (A \setminus \{p\}) \neq \emptyset.

Notice that we do not require that a limit point pp of AA be an element of AA.

Which actually means: p is the limit first/ last point, when pp is not an element of AA. For elements ∈A\in A, when AA is a connected interval, every element can be limit point.

Theorem 2.12. If pp is a limit point of AA and A⊂BA \subset B, then pp is a limit point of BB.

Lemma 2.13. If abab is a region in CC, then:

C={x∈C∣x<a}∪{a}∪ab∪{b}∪{x∈C∣b<x}.C = \{x \in C \mid x < a\} \cup \{a\} \cup ab \cup \{b\} \cup \{x \in C \mid b < x\}.

Definition 2.14. If abab is a region in CC, then C∖({a}∪ab∪{b})C \setminus (\{a\} \cup ab \cup \{b\}) is called the exterior of abab and is denoted by ext⁡ab\operatorname{ext} ab.

Lemma 2.15. If abab is a region in CC, then:

C=ext⁡ab∪{a}∪{b}∪ab.C = \operatorname{ext}ab \cup \{a\} \cup \{b\} \cup ab.

Lemma 2.16. No point in the exterior of a region is a limit point of that region. No point of a region is a limit point of the exterior of that region.

Theorem 2.17. If two regions have a point xx in common, their intersection is a region containing xx.

Corollary 2.18. If nn regions R1,…,RnR_1, \ldots, R_n have a point xx in common, then their intersection R1∩⋯∩RnR_1 \cap \dots \cap R_n is a region containing xx.

Theorem 2.19. Let A,B⊂CA, B \subset C. If pp is a limit point of A∪BA \cup B, then pp is a limit point of AA or BB.

Corollary 2.20. Let A1,…,AnA_1, \ldots, A_n be nn subsets of CC. If pp is a limit point of A1∪⋯∪AnA_1 \cup \dots \cup A_n, then pp is a limit point of at least one of the sets AkA_k.

The converse is also true, so we have both directions:

Corollary 2.21. Let A1,…,AnA_1, \ldots, A_n be nn subsets of CC. Then pp is a limit point of A1∪⋯∪AnA_1 \cup \dots \cup A_n if and only if pp is a limit point of at least one of the sets AkA_k.

Definition 2.22. Two sets AA and BB are disjoint if A∩B=∅A \cap B = \emptyset.

Theorem 2.23. If pp and qq are distinct points of CC, then there exist disjoint regions RR and SS containing pp and qq, respectively.

Corollary 2.24. A subset of CC consisting of one point has no limit points.

Theorem 2.25. A finite subset A⊂CA \subset C has no limit points.

2.26. If A⊂CA \subset C is finite and x∈Ax \in A, then there exists a region RR such that A∩R={x}A \cap R = \{x\}.

Definition 2.27. A set is infinite if it is not finite.

Theorem 2.28. If pp is a limit point of AA and RR is a region containing pp, then the set R∩AR \cap A is infinite.

Exercise 2.29. Find realizations of the continuum (C,<)(C, <). That is, find concrete sets CC endowed with a relation << satisfying all of the axioms (so far). Are they the same? What does "the same" mean here?