MHB Understanding Proper Subsets of Ordinals in Searcoid's Theorem 1.4.4 - Peter

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Subsets Theorem
AI Thread Summary
The discussion centers on understanding the proof of Theorem 1.4.4 from Searcoid's "Elements of Abstract Analysis," specifically regarding the alternatives presented in the context of totally ordered sets. Peter questions the inclusion of the equality alternative ($\delta = \beta$) alongside the strict inequalities ($\delta \in \beta$ or $\beta \in \delta$), arguing that the definition of total ordering only allows for two distinct members. A response clarifies that the equality alternative arises when considering non-distinct members, as they would be equal. This highlights the importance of carefully interpreting definitions in set theory. The conversation emphasizes the nuances in understanding ordinals and their properties within the framework of Searcoid's theorem.
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Micheal Searcoid's book: "Elements of Abstract Analysis" ... ...

I am currently focused on understanding Chapter 1: Sets ... and in particular Section 1.4 Ordinals ...

I have another question regarding the proof of Theorem 1.4.4 ...

Theorem 1.4.4 reads as follows:
View attachment 8463
In the above proof by Searcoid we read the following:

"... ... Moreover, since $$x \subset \alpha$$, we have $$\delta \in \alpha$$. But $$\beta \in \alpha$$ and $$\alpha$$ is totally ordered, so we must have $$\delta \in \beta$$ or $$\delta = \beta$$ or $$\beta \in \delta$$ ... ... "My question is regarding the three alternatives $$\delta \in \beta$$ or $$\delta = \beta$$ or $$\beta \in \delta$$ ... ...Now ... where $$(S, <)$$ is a partially ordered set ... $$S$$ is said to be totally ordered by $$<$$ if and only if for every pair of distinct members $$x, y \in S$$, either $$x < y$$ or $$y < x$$ ... ..So if we follow the definition exactly in the quote above there are only two alternatives ... $$\delta \in \beta$$ or $$\beta \in \delta$$ ... ...My question is ... where does the $$=$$ alternative come from ... ?

How does the $$=$$ alternative follow from the definition of totally ordered ... ?Help will be appreciated ...

Peter
 

Attachments

  • Searcoid - Theorem 1.4.4 ... ....png
    Searcoid - Theorem 1.4.4 ... ....png
    18.3 KB · Views: 110
Physics news on Phys.org
Peter said:
Now ... where $$(S, <)$$ is a partially ordered set ... $$S$$ is said to be totally ordered by $$<$$ if and only if for every pair of distinct members $$x, y \in S$$, either $$x < y$$ or $$y < x$$ ... ..
Peter

Please, read this definition very very carefully, and ask yourself: what if the pair of members is/are not distinct ?
 
steenis said:
Please, read this definition very very carefully, and ask yourself: what if the pair of members is/are not distinct ?

Thanks Steenis ...

See that key term is "distinct"... if not distinct then members are equal ... enough said ...

Thanks for your help ...

Peter
 
Back
Top