Ordinal Property of Subsets in Well-Ordered Sets

jostpuur
Messages
2,112
Reaction score
19
A set x is well-ordered by < if every subset of x has a least element. Here < is assumed a linear ordering, meaning that all members of a set can be compared, unlike with partial ordering.

A set x is transitive if it has property \forall y\;(y\in x\to y\subset x).

A set \alpha is ordinal, if it is transitive and well-ordered by \in.

The claim: If \alpha is an ordinal, and \beta\in\alpha, then \beta is ordinal too.

A book says that this claim is clear "by definition", however I see only half of the proof by definition.

We have \beta\in\alpha\to\beta\subset\alpha, and a subset of a well-ordered set is also well-ordered, so that part is clear by definition.

We should also prove a claim \forall\gamma\;(\gamma\in\beta\to\gamma\subset\beta). How is this supposed to come from the definition? I only see \gamma\in\beta\to\gamma\in\alpha\to\gamma\subset\alpha.

---

update: Oh I understood this now! No need for help. :cool: But I would like to complain that the book is playing fool on the reader. I wouldn't call that "by definition".

---

second update: We assume \gamma\in\beta and then

<br /> \neg(\gamma\subset\beta)\to \exists\delta\;(\delta\in\gamma\land\delta\notin\beta)<br />
<br /> \to\exists\delta\;\big(\delta\in\gamma\land(\beta\in\delta\lor \beta=\delta)\big)<br />
<br /> \to\exists\delta\big(\underbrace{(\delta\in\gamma\land\beta\in\delta)}_{\to 0=1}\lor\underbrace{(\delta\in\gamma\land \beta=\delta)}_{\to 0=1}\big)\to 0=1<br />

Does that look like "by definition"? :devil:
 
Last edited:
Physics news on Phys.org
I think they call it by definition for this reason. Since ##\beta\subset\alpha##, ##\beta## is well ordered by ##\in##, as you pointed out. So for ##\beta' < \beta## in ##\alpha##, ##\beta'\in\beta##, and for ##\beta' > \beta##, ##\beta\in\beta'## which precludes ##\beta## containing any of these larger elements. But ##\beta\subset\alpha##, therefore ##\beta## is exactly the union of elements of ##\alpha## less than ##\beta##. But then ##\forall\gamma\in\beta \; (\gamma\subset\beta)## and ##\beta## is transitive.

So in a sense, ##\beta## is defined in this way by those definitions.
 
Last edited:
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
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...

Similar threads

Replies
6
Views
1K
Replies
14
Views
2K
Replies
1
Views
1K
Replies
18
Views
3K
Replies
1
Views
2K
Replies
2
Views
2K
Replies
4
Views
792
Back
Top