Notes on ordered sets university of california, berkeley. The order of the elements in a set doesnt contribute anything new. For example, the set n of natural numbers is well ordered by its natural ordering, and so. 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. The preceding theorem implies that there is a natural well ordering on the set of ordinal numbers.
In this chapter we will see longer well ordered sets and these will give us a new proof. Very often instead of writing, say, x, y belongs to r we write xry. A set of real numbers s is well ordered if every nonempty subset of s has a least element. So the wellordering principle is the following statement. The cartesian product of any finite number of well ordered sets is itself well ordered by the relation of lexicographical ordering. A totally ordered set is wellordered if and only if it contains no subset that is antiisomorphic to the set of natural numbers. The power set of a set s is the set of all subsets of s including s itself and the empty set. Assume also that \s\ is not the set of all positive integers. A solutions manual for topology by james munkres 9beach. Any subset of a wellordered set is itself wellordered.
The set of positive integers in their natural order is a well ordered set since all. An ordered set is said to be wellordered if each and every nonempty subset has a smallest or least element. We use the well ordering principle to prove the first principle of mathematical induction. One of the basic properties of an ordinal is that it is a well ordered set. 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. Thanks for contributing an answer to mathematics stack exchange. 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 set n of natural numbers with its usual order is well ordered. A linearly ordered set for which each subset has a first member i. The chapter explains that every subset of a well ordered set is also well ordered. Assume there exists some positive integer that cannot be written as the product of primes. We discuss examples that are not well ordered and not totally ordered.
Pdf cartesian product in set theory ezurike frankduff. 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. Lecture 3 1 overview 2 wellordering principle duke computer. Every partially ordered set has a maximal antichain. In this article, we give a counterexample to lemma 12 of the article on operations and linear extensions of well partially ordered sets by maciej malicki and aleksander rutkowski malicki and. The well ordering principle is a concept which is equivalent to mathematical induction. In other words, either sc has a smallest element or else it is the empty set. 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. The calculus of ordinalities university of georgia. 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.
So, by the well ordering principle, c has a minimum element, which well call c. Erdos and others published a problem on well ordered sets find, read and cite all the research you need on researchgate. A nonempty subset s of r is well ordered if every nonempty subset of s has a smallest element. The structure of a wellordered set means that all of the elements of s can be listed in. Similarly, we need to show that the lexicographically ordered product. Analogously, we say that is a reverse well order and s. Every nonempty subset s s s of the positive integers has a least element. It contains all that i know about the theory of ordered sets. Is an infinite cartesian product of well ordered sets well. However, because of the very way in which we constructed the set of natural numbers and its arithmetic, we deduced, in class. The cartesian product of a finite number of wellordered sets is wellordered by the relation of lexicographic order.
The following important fact is called the well ordering principle. Today we discuss indexed sets and the well ordering principle. The book ponders on powers of sets, ordered sets, and linearly ordered sets. Lecture 7 1 partially ordered sets cornell university. This is also a set of natural numbers, to which we will apply the well ordered axiom. The wellordering theorem, which is equivalent to the axiom of choice, states that every set can be well ordered. In the following theorem, limit points provide an important characterization of closed. There are some sets we can easily see are well ordered. The set of positive integers in their natural order.
At the opposite extreme we have antichains, ordered sets in which. Chapter 5 partial orders, lattices, well founded orderings. So in this section we shall embark upon a systematic study of well ordered sets. Partial orders, lattices, well founded orderings, equivalence relations, distributive lattices, boolean algebras, heyting algebras 5. The wellordering principle says that the positive integers are wellordered. The product p o q of two posets is obtained by replacing each point of. Let s be the set of positive integers that do not have a. A book of set theory, first published by dover publications, inc. 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.
The power set of every well ordered set can be well ordered. Assuming there are counterexamples, c is a nonempty set of nonnegative integers. Initial segments, well ordering and the axiom of choice. Wellordered sets, ulam matrices, and probability measures. Every wellordered set is uniquely order isomorphic to a unique ordinal number, called the order type of the wellordered set. An acquaintance with various examples and properties of well ordered sets is essential to the study of ordinals. Asking for help, clarification, or responding to other answers. 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.
If w1 and w2 are isomorphic well ordered sets, say that they have the sameorder type. Q between partially ordered sets is order preserving if x p y fx q fy. Two of the basic techniques of set theory are trans nite induction and trans nite recursion. A binary relation r on a set x is a subset of the product x. The resulting equivalence classes are called ordinal numbers. A well ordered set is a set in which every subset attains a minimum. In general, a set such as n with some order wellordered if any nonempty subset has a least element. In your textbook, there is a proof for how the well ordering principle implies the validity of mathematical induction. 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. That is, among the nonnegative integers, c is the smallest counterexample to equation 2. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set.
639 975 283 1207 78 1136 1426 933 1287 966 545 742 222 137 1026 1603 1153 953 269 188 1003 857 1171 198 1064 357 983 9 1134 973 983 237 340 346