Is there a general - and possibly easy! - explicit way to "create" bijective functions between countable ordinals? I mean for example a bijection between $\omega$ and $\omega+\omega$, or a bijection between $\omega k$ and $\epsilon_0$ etc. Thanks.
2026-04-04 15:17:32.1775315852
Is there a general explicit way to construct bijections between countable ordinals?
292 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in FUNCTIONS
- Functions - confusion regarding properties, as per example in wiki
- Composition of functions - properties
- Finding Range from Domain
- Why is surjectivity defined using $\exists$ rather than $\exists !$
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Lower bound of bounded functions.
- Does there exist any relationship between non-constant $N$-Exhaustible function and differentiability?
- Given a function, prove that it's injective
- Surjective function proof
- How to find image of a function
Related Questions in ELEMENTARY-SET-THEORY
- how is my proof on equinumerous sets
- Composition of functions - properties
- Existence of a denumerble partition.
- Why is surjectivity defined using $\exists$ rather than $\exists !$
- Show that $\omega^2+1$ is a prime number.
- A Convention of Set Builder Notation
- I cannot understand that $\mathfrak{O} := \{\{\}, \{1\}, \{1, 2\}, \{3\}, \{1, 3\}, \{1, 2, 3\}\}$ is a topology on the set $\{1, 2, 3\}$.
- Problem with Cartesian product and dimension for beginners
- Proof that a pair is injective and surjective
- Value of infinite product
Related Questions in ORDINALS
- Ordinals and cardinals in ETCS set axiomatic
- For each cardinal number $u$, there exists a smallest ordinal number $\alpha$ such that card$\alpha$ =$u$ .
- Intuition regarding: $\kappa^{+}=|\{\kappa\leq\alpha\lt \kappa^{+}\}|$
- Set membership as a relation on a particular set
- Goodstein's sequences and theorem.
- A proof of the simple pressing down lemma, is sup $x=x?$
- $COF(\lambda)$ is stationary in $k$, where $\lambda < k$ is regular.
- Difficulty in understanding cantor normal form
- What are $L_1$ and $L_2$ in the Gödel Constructible Hierarchy
- How many subsets are produced? (a transfinite induction argument)
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
As Chris Eagle said in the comment, we cannot do that explicitly.
The reason is that if we have a countable sequence of $(A_i,f_i)$ where $f_i$ is a bijection between $A_i$ and $\omega$ then the union of $\bigcup_{i=1}^\infty A_i$ is countable.
It is also consistent with ZF that $\omega_1$ is a countable union of countable ordinals, but it does not mean that $\omega_1$ is countable. It is never countable.
In fact even assuming that $\omega_1$ is not a countable union of countable ordinals is not enough to generate these "canonical" bijections, as Solovay's model tells us. If we could, then we could define $\aleph_1$ many real numbers, which is impossible without pretty much the assumption that $\aleph_1$ many real numbers exist.
For explicit bijection between $\omega$ and "small" countable ordinals, for example $\omega$ with $\omega^2+\omega+5$:
Take a bijection of the first part with $\omega^2$, a bijection of the second part with $\omega$ and the last part with $5$.
This can be done simply by composing the needed bijections, and if the partitions are made of sets simple enough then this can be done by a relatively simple formula.
Note that $\epsilon_0$ is a bit too large for this kind of manipulation, as it relies on a Cantor normal form being "simple". However you can probably stretch this method a bit further by considering infinite partitions, I doubt a nice formula can be expected in that case, though.
To Read More: