I have tried to find an isomorphism $\phi$ in this way: Let $f \in \operatorname{Exp}(\omega, \omega)$ and let the $k$ pairs $(n_i,f(n_i))$ such that for every $0<i<k+1$, $f(n_i)\ne 0$. I'd like to close $\phi(f)$ between $n_k$ and $n_k +1$. For example, if exist an only pairs with $f(n)\not=0$, $\phi(f)=n+1- \frac{1}{f(n)}$. I think it's possible to build $ \phi $ for countable recursion but I can not figure out how.
2026-03-25 11:03:46.1774436626
Find a subset of $(\mathbb{Q}, <)$ isomorphic to $Exp(\omega, \omega)$ as well ordered set
232 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
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)
Related Questions in WELL-ORDERS
- Proof of well-ordering property
- how to prove the well-ordering principle using the principle of complete mathematical induction
- Role of Well-Ordering Principle in proving every subgroup of $\mathbb{Z}$ is of the form $n\mathbb{Z}$
- Is Induction applicable only to well-ordered sets that are not bounded above?
- Application of the Well-Ordering Principle
- Equinumerous well ordered sets are isomorphic
- How can a set be uncountable but well-ordered?
- well ordering principle and ordered field
- Can you turn a well-founded relation into a well-quasi-ordering?
- Initial segment of $\mathbb{Z}$ not determined by an element
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?
The following is the best I could find.
The idea is to construct the images $S_n:=\text{Im}\left(\phi|_{[0,\omega^n]}\right)$ recursively, so that:
This actually satisfies $\phi(f)\in [2^{n_k},2^{n_k+1}]$ (with the same notation you used), but it should have some other nice properties, like the following (I didn't prove all of them, but I strongly believe all of them to be true):