1
vote
0answers
21 views

Prove that ordinal multiplication is left distributive

Suppose $\alpha, \beta$ and $\gamma$ are ordinals. Prove the distributive law $\alpha \cdot ( \beta + \gamma) = \alpha \cdot \beta + \alpha \cdot \gamma$. The following is my proof: Proof: We use ...
1
vote
0answers
27 views

Ordinal arithmetic and functions

I have two function $G$ and $F$ defined on ordinals and I know that $$G(\alpha +\omega )\subseteq F(\gamma +\alpha+\omega)$$ when $G(\alpha)\subseteq F(\gamma)$ and $\alpha$ is a limit ordinal. I ...
0
votes
1answer
43 views

Definition of continuity of ordinal function

In the book Introduction to Set Theory' by Hrbacek and Jech, chapter $6$ Ordinal Numbers, section $6$ Normal Form, I don't understand the definition of continuity of ordinal numbers. Ordinal ...
0
votes
0answers
39 views

show that ordinal multiplication is associative

Prove that ordinal multiplication $\alpha \cdot (\beta \cdot \gamma) = (\alpha \cdot \beta) \cdot \gamma$ is associative by using the following facts: $$\beta \cdot 0=0$$ $$\beta \cdot (\alpha ...
1
vote
2answers
44 views

$\kappa\cdot\kappa= \kappa,$ for infinite cardinals

I am trying to understand the proof that uses a maximal-lexicographic ordering. For an infinite ordinal $\kappa,$ the canonical well-ordering of $\kappa \times \kappa,$ denoted by $<_{cw}$ is ...
1
vote
1answer
59 views

Is it possible to iterate a function transfinite times?

Let $f:A\rightarrow A$ be a function. We can simply define $f\circ f$, $f\circ f\circ f$, etc., for each given natural number inductively. $f^{(0)}=id_A$ $\forall n\in\omega \qquad f^{(n+1)}=f\circ ...
3
votes
1answer
49 views

What are $\in$-well orderable classes?

$V$ is not $\in$-well ordered but $Ord$ is. Is $Ord$ the unique proper class of the universe which is $\in$-well ordered?
3
votes
1answer
87 views

$\aleph_\omega$ and large ordinals?

Assuming the GCH, each time you take the powerset of an aleph number, the subscript increases by one. So there is $\aleph_0, \aleph_1, \aleph_2\ldots \aleph_\omega\ldots \aleph_{\epsilon_0}\ldots$ and ...
0
votes
2answers
61 views

Ordinal existence

Is there any ordinal $\alpha$ such that $\omega ^ {\omega ^ \alpha} = \alpha$? Could you please suggest me how to even try to solve this?
1
vote
1answer
56 views

why $\alpha ,\beta,\gamma$ :$(\beta + \gamma)\alpha = \beta\alpha + \beta \gamma$ doesn't hold?

this rule doesn't hold for all ordinals $\alpha ,\beta,\gamma$ :$(\beta + \gamma)\alpha = \beta\alpha + \beta \gamma$. I tested many examples but all of them holds for it ! does this hold ? $(B \cup ...
1
vote
1answer
46 views

Insistence on limit ordinal in Kunen's proof of reflection.

I'm reading for an exam on set theory using Kunen's first edition, and we've more or less been told that the reflection theorem will come up. The proof constructively yields an ordinal ...
1
vote
0answers
35 views

$\sigma$-field and Uncountable ordinal

I have been trying to get my head around this question. Any help greatly appreciated. Let $\mathscr{C}$ be any class of subsets $\Omega$ with $\emptyset,\Omega\in \mathscr{C}$. Define ...
3
votes
1answer
72 views

The order-theoretic structure of the ordinal numbers in non-standard models

I have read the following. Proposition. Let $T$ denote the first-order theory of $\mathbb{N}$ in the language of arithmetic. Then any countable non-standard model of $T$ is order isomorphic to a ...
0
votes
1answer
40 views

A set which is $\in$-transitive and well ordered by $\in$ is an ordinal

A set $x$ is said to be $\in$-transitive if $\forall y$ $\forall z$($ y \in x$ and $ z \in y \Rightarrow z \in x$). A set $x$ is said to be an ordinal if $x$ and every member of $x$ is ...
0
votes
1answer
47 views

Ordinal arithmetic question

The question is: find $\delta \le \omega_1$ and $\rho \lt \omega$ such as $\omega_1 = \omega \cdot \delta + \rho$. My guess is that $\delta = \omega_1$ and $\rho = 0$, abut I don't know how to prove ...
1
vote
2answers
96 views

What do you need to know about ordinals to understand Zorn's Lemma's proof?

I'm trying to understand the proof of Zorn's Lemma but the one which does not use ordinals (Halmos' proof) is extremely long and I really feel I get lost somewhere along the way. On the other hand, ...
4
votes
2answers
100 views

Proof that $\omega_1$ is countable (where is the flaw?)

I have discovered a "proof" of the fact, that $\omega_1$ can be countable, contradicting its definition. It mustn't assume axiom of choice, so I guess there are some parts of this construction which ...
4
votes
2answers
74 views

Proof of Hartogs' Lemma

I'm reading "Sets, Models and Proofs" by I. Moerdijk and J. van Oosten to have some basic understanding of set theory. There's one step in "Hartogs' Lemma" proof that I don't see how to it works: I ...
0
votes
1answer
70 views

Tarski's fixed point theorem

My professor stated the following "For every normal function $f \colon ON \to ON$ and for every ordinal $\beta$ there exist an ordinal $\gamma \ge \beta$ such that $f(\gamma)=\gamma$". (normal ...
-1
votes
1answer
85 views

Simplify this expression of ordinal numbers: $(ω+1) ω²$ [closed]

Let $ω$ be the ordinal of the natural numbers. Simplify $(ω+1) ω²$
2
votes
1answer
61 views

Prove $\bigcup \omega_1 = \omega_1$

This is a question regarding ordinals and probably requires some background knowledge of ordinal arithmetic. I will list what I hope is the relevant information for this question: $\omega_1$ is ...
3
votes
3answers
124 views

Why is it that $\omega + \omega_1 = \omega_1$?

I have seen some other questions about the proofs around ordinals and $\omega$ and $\omega_1$, but some of the answers have confused me. An ordinal $\alpha$ is countable if $\alpha < \omega_1$. ...
2
votes
1answer
58 views

A canonical injection $f:\alpha\to[0,1]$ for an arbitrary countable ordinal $\alpha$

Is there a canonical injection $f:\alpha\to[0,1]$ for an arbitrary countable ordinal $\alpha$? As long as $\alpha$ is of the form $m\cdot\omega + n$ for $m,n<\omega$, this is fairly simple, but if ...
3
votes
2answers
68 views

Embedding $\omega_1$ into the direct sum/product of $\Bbb R$'s and $\Bbb N$'s

I'm trying to find a way to visualize the first uncountable ordinal $\omega_1$. This is rather difficult, as the visualization tactic that I often use for countable ordinals - namely, the "matchstick" ...
3
votes
2answers
86 views

Do the ordinals exist before the universe of sets is constructed?

Should I worry about the following appeIarance of circularity in ZFC set theory? In constructing the universe of sets, you start with the empty set and then keep taking the power set over and over. ...
1
vote
1answer
139 views

If $\alpha$ and $\beta$ are ordinals, prove that $\alpha ^ \beta$ is a countable ordinal.

In this question I am supposing that both $\alpha$ and $\beta$ are ordinals. My definition of an ordinal is that: $x$ is an ordinal if $x$ is well-ordered by $\in$ and $x$ is $\in$-transitive. So ...
0
votes
2answers
61 views

Prove $\epsilon_0$ < $\omega_1$ [duplicate]

This is a question in ordinal arithmetic. (If anyone has read 'Classic Set Theory' by Derek Goldrei, this question comes from page 252.) $\epsilon_0$ = sup {$\omega$, $\omega^\omega$, ... } and ...
2
votes
1answer
71 views

Prove $\omega + \omega_1 = \omega_1$ [duplicate]

I am assuming that $\omega_1$ is the first uncountable ordinal and I'm using ordinal arithmetic. I have so far that if $\alpha$ and $\beta$ are ordinals, then $\alpha + \beta$ = sup{$\alpha + ...
7
votes
1answer
86 views

Order-preserving injections of ordinals into $[0,1]$

The usual "matchstick" representation of an ordinal number can be thought of as an order-preserving injection of that ordinal into the interval [0,1]. For example, here's a representation of ...
2
votes
1answer
68 views

Initial Segment Order Isomorphic to the Ordinal Numbers

Prove that every well-ordered proper class has an initial segment order isomorphic to the ordinal numbers, ON. I have a plan to prove this but it uses a recursive definition and induction which I do ...
0
votes
1answer
32 views

Is there a difference between the order type of Q·ω and Q·Q?

From what I understand, the expression is "a countable amount of the order type of Q", which intuitively should be equal to the second expression. Is this true? How do I explain this formally? Thanks ...
1
vote
1answer
60 views

How to prove by induction that the set of all natural numbers is an ordinal

I have seen alternative methods of this proof, with one being: let $n$ be the set of all natural numbers. Then (1) $\omega$ is an ordinal, (2) If $\alpha$ is an ordinal and $\beta \in \alpha$, then ...
1
vote
1answer
77 views

Prove that $\omega + \omega_1 = \omega \cdot \omega_1 = \omega^{\omega_1} = \omega_1$

I am assuming already that a) the union of countably many countable sets is countable and b) $\omega_1$ is the least uncountable ordinal, so $x < \omega_1$ if and only if $x$ is a countable ...
2
votes
2answers
98 views

What is the cardinality of the open ordinal space $[0,\Omega)$ if we remove it's limit ordinals?

Let $\Omega$ be the first uncountable ordinal. and for any limit ordinal $\lambda < \Omega$ Let $U_\lambda$ an open neighborhood of $\lambda$ with the order topology. what is the cardinality of the ...
1
vote
1answer
105 views

Is any subset of the open ordinal space $[0,\Omega)$ $G_\delta$?

Consider the open ordinal space $[0,\Omega)$, where $\Omega$ is the first uncountable ordinal. Can I say that every subset of $[0,\Omega)$ is $G_\delta$? If yes, does this imply that $[0,\Omega)$ is ...
2
votes
3answers
66 views

What is the cardinality of all limit ordinals $\alpha$ s.t. $\alpha < 2^\mathfrak c$

Let $\Omega$ be the first ordinal with cardinality $2^\mathfrak c$. Take now the set of all ordinals $\alpha < \Omega$ which are limit ordinals. Is the cardinality of this set countable or is it ...
3
votes
2answers
239 views

Easy visualizations of small countable ordinals

The ordinal number $\omega^2$ can be visualized as $\omega$-many copies of $\omega$. Likewise, the ordinal number $\omega^3$ can be visualized as $\omega^2$-many copies of $\omega$, arranged as ...
1
vote
0answers
59 views

Generalization of simple and transfinite induction

Definition For a set of ordinals $\boldsymbol\alpha$ and ordinals $\gamma$, $\beta$, let $$\boldsymbol\alpha \xrightarrow[\gamma]{}\beta$$ symbolize the proposition that ...
4
votes
1answer
115 views

Bijection between countable ordinals and reals

The set of all countable ordinals is $\omega_1$, which has a cardinality of $\aleph_1$. When accepting the continuum hypothesis, $2^{\aleph_0} = \aleph_1$, so a bijection between countable ordinals ...
2
votes
2answers
50 views

Noninital ordinal of a set

If $\mathbb R$ is well ordered by an order $\ll$ such that the ordinal of R and that order $\alpha$ is not initial. How can I show that there is a closed interval $[a,b]$ ($a<b$) such that the ...
3
votes
1answer
119 views

Godel's pairing function and proving c = c*c for aleph cardinals

I have a few questions about Godel's pairing function and proving that c = c * c for aleph cardinals. Mostly, though, I'm concerned that most of the proofs I've seen are erroneous, and this concerns ...
3
votes
1answer
138 views

Understanding countable ordinals (as trees, step by step)

Even though ordinal numbers – considered as transitive sets – are perfect non-trees, it is worth (and natural) to visualize them as trees, starting from the finite ones which are given as ...
3
votes
0answers
136 views

Visualizations of ordinal numbers

I find this picture of the ordinal numbers up to $\omega^\omega$ rather hard to grasp: I wonder if the following might be a more compelling way to visualize ordinal numbers up to $\omega^\omega$: ...
1
vote
1answer
50 views

Naturally definable order relations

Each and every function $f:X\rightarrow Y$ between two totally ordered sets $(X,\leq_X), (Y,\leq_Y)$ induces a relation $\preceq$ on $X$ by $$x \preceq x' :\equiv \begin{cases} x &\leq_X x' ...
0
votes
3answers
190 views

How uncountable is the set of countable ordinals?

From the answers (and comments) to this question on the uncountability of countable ordinals I don't get a lucid picture: How can I see that the uncountability of the set of countable ordinals ...
6
votes
0answers
217 views

The structure of countable ordinals

Consider the recursively defined hyperoperation sequence $\circ_i$ $$\begin{array}{rcrclclcl} x& \small{+}&(y\ {\small+}1)&:=&x& &&{\small+}&1\\ x& ...
2
votes
1answer
64 views

A representation of well-orderings?

Is there a well-ordering $P$ of the set of real numbers $\mathbb{R}$ such that there is NO function $f: \mathbb{R}->\mathbb{R}$ satisfying the property: for all $x,y \in \mathbb{R}$, $xPy$ iff ...
3
votes
1answer
199 views

Showing ordinal addition and ordinal multiplication are defined

I've been reading absoluteless results in Kunens't latest Set Theory text. After talking about $\Delta_0$ formulas and absoluteness, he mentions that certain concepts are absolute, but not $\Delta_0$. ...
2
votes
1answer
53 views

Distinguishing characteristic and spurious properties

When working in set theory with definitions of somehow primitive notions like ordered pairs (Kuratowski) or ordinal numbers (von Neumann) one is supposed to use only the characteristic properties of ...
3
votes
2answers
152 views

Two exercises on set theory about Cantor's equation and the von Neumann hierarchy

Good evening to all. I have two exercises I tried to resolve without a rigorous success: Is it true or false that if $\kappa$ is a non-numerable cardinal number then $\omega^\kappa = \kappa$, where ...