Proving Ord is Well-Ordered by ∈: A Transitive and Total Order

  • Thread starter jgens
  • Start date
In summary, we prove that Ord is a transitive and well-ordered class of ordinals by showing that it satisfies the properties of transitivity and well-ordering. We also show that the relation ∈ is a total order on Ord. Finally, we prove that Ord is well-ordered by ∈ by considering an infinite descending sequence and arriving at a contradiction. The proof is correct and can potentially be simplified by further examining the properties of transitivity and well-ordering. Feedback and suggestions are welcome.
  • #1
jgens
Gold Member
1,593
50

Homework Statement



Let Ord denote the class of ordinals. Prove that Ord is is transitive and well-ordered by ∈.

Homework Equations



  • A set X is called transitive if x ∈ X and y ∈ x imply y ∈ X.
  • A set X is called ordinal if it is transitive and well-ordered by ∈.
  • A total order (X,<) is well-ordered if and only if there does not exist an infinite descending sequence.

The Attempt at a Solution



Suppose X ∈ Ord and fix x ∈ X. If y ∈ x, then y ∈ X since X is an ordinal. If z ∈ y, then z ∈ X by the previous sentence. Since z ∈ y and y ∈ x, it follows that z ∈ x since X is well-ordered by ∈. This proves x is transitive.

If y ∈ x, we clearly have ~(y ∈ y). If y1,y2,y3 ∈ x are such that y3 ∈ y2 and y2 ∈ y1, then y3 ∈ y1 since ∈ is a well-order on X. If z1,z2 ∈ x, then since ∈ is well-order on X, one and only one of the following holds: 1) z1 ∈ z2 2) z1 = z2 3) z2 ∈ z1. Lastly, suppose there is some infinite descending sequence a0 ∋ a1 ∋ ... in x. But since x ∋ a0 ∋ a1 ∋ ... is an infinite descending sequence in X and X is well-order by ∈, this is a contradiction. This proves x is well-ordered by ∈. In particular, x ∈ Ord, proving that Ord is transitive.

If X ∈ Ord, then we clearly have ~(X ∈ X). If X,Y,Z ∈ Ord are such that X ∈ Y and Y ∈ Z, then X ∈ Z since Z is transitive. We show that ∈ is a total order with the following argument:

If X,Y ∈ Ord, then Z = X∩Y is transitive. Let x denote the least element of X-Z and let y denote the least element of Y-Z. Suppose w ∈ x but ~(w ∈ Z). Then w ∈ X since X is transitive. But then w is the least element of X-Z, which is a contradiction. This means w ∈ Z, so x is a subset of Z. Conversely, if w ∈ Z but ~(w ∈ x), then x ∈ w. But then x ∈ Z which is a contradiction. This means x = Z. Arguing similarly shows that x = Z = y. Since x = y, we should have x ∈ z, which is absurd. This means Z = X or Z = Y. In particular, we have that one and only one of the following holds: 1) X ⊂ Y 2) X = Y 3) Y ⊂ X. Now suppose X ⊂ Y = X and let y denote the least element of Y-X. Since the elements of y are precisely the elements of x, this means X ∈ Y. This proves that Ord is well-ordered by ∈.

Now suppose X0 ∋ X1 ∋ ... is an infinite descending sequence in Ord. But then X1 ∋ X2 ∋ ... is an infinite descending sequence in X0 which contradicts the fact that X is well-ordered. This completes the proof.


My primary question is whether or not my argument for why Ord is well-ordered can be simplified. If it can, I would love suggestions.
 
Physics news on Phys.org
  • #2
Also, I would love to get some feedback on the overall proof and whether it is correct. Thank you for your help!
 

1. What does "Ord well-ordered by ∈" mean?

"Ord well-ordered by ∈" refers to a set that is ordered in a specific way using the membership relation ∈. This means that every non-empty subset of the set has a least element.

2. How is "Ord well-ordered by ∈" different from a regular ordered set?

The main difference is that in a regular ordered set, there may not necessarily be a least element in every non-empty subset. In an "Ord well-ordered by ∈" set, there is always a least element in every non-empty subset.

3. What is the importance of "Ord well-ordered by ∈" in mathematics?

"Ord well-ordered by ∈" sets have important applications in various branches of mathematics, including set theory, graph theory, and topology. They provide a useful tool for proving the existence of elements and establishing the properties of other mathematical structures.

4. Can any set be "Ord well-ordered by ∈"?

No, not all sets can be "Ord well-ordered by ∈". In fact, the existence of an "Ord well-ordered by ∈" set is a fundamental principle of set theory known as the Axiom of Choice. This axiom states that given any collection of non-empty sets, it is possible to choose one element from each set to form a new set.

5. How is "Ord well-ordered by ∈" related to induction in mathematics?

"Ord well-ordered by ∈" sets are closely related to mathematical induction, which is a powerful proof technique used to establish statements for all natural numbers. This is because the least element in a non-empty subset of an "Ord well-ordered by ∈" set can be seen as the base case in an inductive proof.

Similar threads

  • Calculus and Beyond Homework Help
Replies
3
Views
466
  • Calculus and Beyond Homework Help
Replies
11
Views
1K
  • Calculus and Beyond Homework Help
Replies
20
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
5
Views
3K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
  • Calculus and Beyond Homework Help
Replies
8
Views
558
Back
Top