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
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: 109
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
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top