ASK - ANSWER - COMMENT - VOTE - CREATE

MathsGee is Zero-Rated (You do not need data to access) on: Telkom |Dimension Data | Rain | MWEB

1 like 0 dislike
25 views
How do you prove that every well-ordered set is isomorphic to a unique ordinal number?
| 25 views

## 1 Answer

0 like 0 dislike
Best answer

The proof for the stament that: "Every well-ordered set is isomorphic to a unique ordinal number."

Given a well-ordered set $W$, we find an isomorphic ordinal as follows: Define $F(x) = \alpha$ if $\alpha$ is isomorphic to the initial segment of $W$ given by $x$.

If such an $\alpha$ exists, then it is unique. By the Replacement Axioms, $F(W)$ is a set. For each $x \in W$, such an $\alpha$ exists (otherwise consider the least $x$ for which such an $\alpha$ does not exist). If $\gamma$ is the least $\gamma \not\in F(W)$ then $F(W) =\gamma$ and we have an isomorphism of $W$ onto $\gamma$.

by Diamond (75,934 points)

0 like 0 dislike
1 answer
1 like 0 dislike
0 answers
0 like 0 dislike
1 answer
0 like 0 dislike
1 answer
0 like 0 dislike
0 answers