A totally ordered set is wellordered if and only if it contains no subset that is antiisomorphic to the set of natural numbers. The well ordering principle is a concept which is equivalent to mathematical induction. The set n of natural numbers with its usual order is well ordered. In your textbook, there is a proof for how the well ordering principle implies the validity of mathematical induction. Let s be the set of positive integers that do not have a. Wellordered language level 1a errata pdf tammy peters author and educator tammy peters earned her ba in elementary education and a minor in english from the university of wisconsin in 1982, and her ma in reading from cardinal stritch university in milwaukee in 1987. A book of set theory, first published by dover publications, inc. Initial segments, well ordering and the axiom of choice.
A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set. The wellordering theorem, which is equivalent to the axiom of choice, states that every set can be well ordered. In this chapter we will see longer well ordered sets and these will give us a new proof. Wellordered language level 3b errata pdf tammy peters author and educator tammy peters earned her ba in elementary education and a minor in english from the university of wisconsin in 1982, and her ma in reading from cardinal stritch university in milwaukee in 1987. For example, the set n of natural numbers is well ordered by its natural ordering, and so. The cartesian product of s and t, denoted by s x t, is the set of all ordered pairs s,t, where s s and t t.
Thanks for contributing an answer to mathematics stack exchange. Analogously, we say that is a reverse well order and s. Notes on ordered sets university of california, berkeley. The discussion of cardinalities in chapter 2 suggests that the most interesting thing about them is their order relation, namely that any set of cardinalities forms a well ordered set. Today we discuss indexed sets and the well ordering principle. It contains all that i know about the theory of ordered sets. The chapter presents an important theorem explaining that in every well ordered set. Two of the basic techniques of set theory are trans nite induction and trans nite recursion. The cartesian product of any finite number of well ordered sets is itself well ordered by the relation of lexicographical ordering. The calculus of ordinalities university of georgia. The most familiar example of a wellordered set is and it is the wellordering property th at lets us do mathematical induction in in this chapter we will see longer well ordered sets and these will give us a new proof method called.
As usual this is welldefined on ordinalities so leads to the ordinal product o o. A solutions manual for topology by james munkres 9beach. The set of positive integers in their natural order is a well ordered set since all. That is, among the nonnegative integers, c is the smallest counterexample to equation 2. Chapter 5 partial orders, lattices, well founded orderings. Very often instead of writing, say, x, y belongs to r we write xry. An ordered set is said to be wellordered if each and every nonempty subset has a smallest or least element. The book ponders on powers of sets, ordered sets, and linearly ordered sets. So in this section we shall embark upon a systematic study of well ordered sets. Similarly, we need to show that the lexicographically ordered product. Any subset of a wellordered set is itself wellordered. This essay focuses on the study of cartesian product, which is a mathematical operation of set theory, that returns a set or product set from two or more sets. The following important fact is called the well ordering principle.
The cartesian product of a finite number of wellordered sets is wellordered by the relation of lexicographic order. A linearly ordered set for which each subset has a first member i. In other words, either sc has a smallest element or else it is the empty set. However, because of the very way in which we constructed the set of natural numbers and its arithmetic, we deduced, in class. Asking for help, clarification, or responding to other answers. The wellordering theorem one of the greatest mathematical controversies of all time recall that the set of natural numbers with the order wellordered. A set is an ordinal number or an ordinal if it is transitive and well ordered. A nonempty subset s of r is well ordered if every nonempty subset of s has a smallest element.
Every wellordered set is uniquely order isomorphic to a unique ordinal number, called the order type of the wellordered set. The product p o q of two posets is obtained by replacing each point of. Every nonempty subset s s s of the positive integers has a least element. There are some sets we can easily see are well ordered. Assuming there are counterexamples, c is a nonempty set of nonnegative integers. If w1 and w2 are isomorphic well ordered sets, say that they have the sameorder type.
We discuss examples that are not well ordered and not totally ordered. In our paper, the set of real numbers is denoted by r while z and n denote the set of all integers and the set of positive integers, respectively. The chapter explains that every subset of a well ordered set is also well ordered. The order of the elements in a set doesnt contribute anything new. We use the well ordering principle to prove the first principle of mathematical induction. Wellordered sets, ulam matrices, and probability measures. One of the basic properties of an ordinal is that it is a well ordered set. The cartesian product of any finite number of wellordered sets is itself well ordered by the relation of lexicographical ordering. The power set of a set s is the set of all subsets of s including s itself and the empty set. This is also a set of natural numbers, to which we will apply the well ordered axiom. The resulting equivalence classes are called ordinal numbers. Use the well ordering property to prove if a is an integer and d is a positive integer, then there are unique integers q and r with 0 r well ordering. Lecture 7 1 partially ordered sets cornell university. In the following theorem, limit points provide an important characterization of closed.
The set of positive integers in their natural order. An acquaintance with various examples and properties of well ordered sets is essential to the study of ordinals. Erdos and others published a problem on well ordered sets find, read and cite all the research you need on researchgate. A binary relation r on a set x is a subset of the product x. So, by the well ordering principle, c has a minimum element, which well call c. So the wellordering principle is the following statement. Topics include isomorphism of linearly ordered sets, dense linear ordering, maximal and minimal elements, quasiordering relations, inequalities for cardinal numbers, sets of the power of the continuum, and cantors theorem. Lecture 3 1 overview 2 wellordering principle duke computer.
Is an infinite cartesian product of well ordered sets well. A well ordered set is a set in which every subset attains a minimum. A set of real numbers s is well ordered if every nonempty subset of s has a least element. Chapter viii ordered sets, ordinals and transfinite methods. Every partially ordered set has a maximal antichain. The power set of every well ordered set can be well ordered. Partial orders, lattices, well founded orderings, equivalence relations, distributive lattices, boolean algebras, heyting algebras 5. In mathematics, especially order theory, a partially ordered set also poset formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. The preceding theorem implies that there is a natural well ordering on the set of ordinal numbers. Assume also that \s\ is not the set of all positive integers. Pdf cartesian product in set theory ezurike frankduff. The structure of a wellordered set means that all of the elements of s can be listed in. In general, a set such as n with some order wellordered if any nonempty subset has a least element.
1153 698 1218 784 1565 215 222 1616 437 755 1025 857 1121 131 233 74 848 1241 203 787 501 787 435 307 22 1317 923 1293 782 555 57 553