Intereting Posts

Infinite Product $\prod_{n=1}^\infty\left(1+\frac1{\pi^2n^2}\right)$
Component of a vector perpendicular to another vector.
Range of A and null space of the transpose of A
Group theory proof of existence of a solution to $x^2\equiv -1\pmod p$ iff $p\equiv 1 \pmod 4$
Subsequences of length $n$ always making a basis for $\mathbb{F}^n_2$?
Subgroups of finite index have finitely many conjugates
Mathematical Analysis advice
Lower semi-continuous function which is unbounded on compact set.
Show that a vector that is orthogonal to every other vector is the zero vector
Is this a valid way to show $\chi(SL_n(\mathbb{R}))=0$?
Need to prove that (S,*) defined by the binary operation a*b = a+b+ab is an abelian group on S = R \ {1}
Example of a group where $o(a)$ and $o(b)$ are finite but $o(ab)$ is infinite
Estimating line paths in vector fields.
graph theory – clique graph
Alternative method of solving $\int_0^{\pi/2} {\sin^2{x} \ln{\tan x} \,dx}$

So in the past few months when trying to learn about the properties of the fixed points in ordinals as I move from $0$ to $\epsilon_{\epsilon_0}$ I noticed when moving from $\epsilon_n$ to the next one $\epsilon_{n+1}$, the operation that does that is a left associative operation i.e.

$${\tiny⋰}^{\epsilon_n^{\epsilon_n}}={}^{\omega}(\epsilon_n)=\epsilon_{n+1}$$

Since the exact same rule holds for all epsilons to those that are indexed by successor ordinals, unwrapping the whole thing gives $\epsilon_{n},n < \omega$ in terms of $\epsilon_0$:

- Are hyperoperators primitive recursive?
- What combinatorial quantity the tetration of two natural numbers represents?
- Why are addition and multiplication commutative, but not exponentiation?
- Could someone tell me how large this number is?
- Notation for function $ + \rightarrow \times $
- Algorithm for comparing the size of extremely large numbers

$$\epsilon_n=\underbrace{{}^{\omega}(\cdots{}^{\omega}({}^{\omega}(}_{\textrm{n times}}\epsilon_0)))=\underbrace{{}^{\omega}(\cdots{}^{\omega}({}^{\omega}(}_{\textrm{n-1 times}}\epsilon_1)))=\underbrace{{}^{\omega}(\cdots{}^{\omega}({}^{\omega}(}_{\textrm{n-2 times}}\epsilon_2)))=etc.$$

That means, while $\epsilon_0$ is informally speaking the same as ${}^{\omega}\omega=\omega^{\omega^⋰}$ hence $\omega [5] 2=\omega\uparrow^3 2$, a pentation, all subsequent epsilon numbers are not tetration because the iterative operations that define them recursively is left associative but not right associative (as it would be the case for hyperoperators).

This then prompt the question: What prevent us from defining ordinal tetration, do they end up collapsing into $\epsilon_0$ or related terms thus making them unnecessary, or something else happens

To begin, since $\epsilon_0=\omega[5]2$, the next probable candidate for $\omega [5]3$ will be ${}^{{}^{\omega}}{}^{\omega}\omega=\left(\left({}^{({}^{\omega})}{}^{\omega}\right)\omega\right)$ Note the definition of $\epsilon_0$ means

$${}^{{}^{\omega}}{}^{\omega}\omega={}^{\epsilon_0}\omega$$

However, because exponentiation already lost associativity, tetration have almost no useful general identities except for finite integers $a,b,n$ (Using exponential identity $\alpha^{\beta\gamma}=(\alpha^\beta)^\gamma$ and that finite integers at the index commute)

$$(a^b)^{{}^{n-1}a}=({}^na)^b$$

Therefore, no known ordinal arithmetic can be used to simplify ${}^{\epsilon_0}\omega$. This prompt me to try a sandwiching approach as follows (where $f$ is some increasing normal function that serves as the iterative operation that climb up this sequence):

$${}^{({}^j\omega)}\omega<f({}^{({}^j\omega)}\omega)<{}^{({}^{j+1}\omega)}\omega$$

If we move through all $j < \omega$ and take the supremum, then we discover that ${}^{\epsilon_0}\omega$ is a fixed point of $f$. But nothing can be deduced further as I have no idea how to derive $f$ explicitly other than it is an operation that is similar to exponentiation, but only applied to the height i.e. $f: {}^j\omega \to \omega^{{}^j\omega}$. Either way, it had said nothing on whether ${}^{\epsilon_0}\omega$ is one of the epsilon number or where it is ordered wrt the usual ordinals.

Wikpedia also has a talk section saying that ordinal tetration is trivial, or that it will collapse into $\epsilon_0$. But as shown with ${}^{\epsilon_0}\omega$, I have so far failed to reproduce their results.

What other squeezing schemes (i.e. where should I put my $j$) I can use (or other properties of ordinals) in order to determine the value of ${}^{\epsilon_0}\omega$ ?

(NB You know my main focus is not large countable numbers since Veblen functions will eventually overshoot any hyperoperation)

- How to think about ordinal exponentiation?
- What combinatorial quantity the tetration of two natural numbers represents?
- Visualizations of ordinal numbers
- Does a $\Pi_2^0$ sentence becomes equivalent to a $\Pi_1^0$ sentence after it has been proven?
- How far do known ordinal notations span?
- Why do we classify infinities in so many symbols and ideas?
- Directed limits of topological spaces and embeddings
- what simple extensions can be naturally embedded into Conway's algebraic closure of $\mathbb{F}_2$?
- First uncountable ordinal
- “If inaccessible sets exist, their existence is not provable in ZF”

So while in the main chat room, I devised a way to define tetration, and it works quite nicely.

$$\alpha\uparrow\uparrow\beta=\begin{cases}0,&\beta=-1\\1,&\beta=0\\\alpha,&\beta=1\\\alpha^{\alpha\uparrow\uparrow\zeta},&\alpha<\omega,\beta=\zeta+1>1\\(\alpha\uparrow\uparrow\zeta)^{\alpha\uparrow\uparrow\zeta},&\alpha\ge\omega,\beta=\zeta+1>1\\\sup\{\alpha\uparrow\uparrow(\beta[\eta])|\eta<\operatorname{cf}(\beta)\},&\beta\in\mathbb{Lim}\end{cases}$$

For finite $\alpha,\beta$, $\alpha\uparrow\uparrow\beta$ is what you expect it to be. Then,

$$\alpha\uparrow\uparrow\beta=\omega\forall\alpha<\omega\land\beta\ge\omega$$

Then we have,

$$\omega\uparrow\uparrow1=\omega\\\omega\uparrow\uparrow2=\omega^\omega\\\omega\uparrow\uparrow3=(\omega^\omega)^{\omega^\omega}=\omega^{\omega^\omega}$$

And so forth. Then,

$$\omega\uparrow\uparrow\omega=\varepsilon_0\\\omega\uparrow\uparrow(\omega+1)=\varepsilon_0^{\varepsilon_0}\\\vdots\\\omega\uparrow\uparrow(\omega2)=\varepsilon_1\\\vdots\\\omega\uparrow\uparrow(\omega(1+\beta))=\varepsilon_\beta\forall\beta\le\zeta_0$$

Thus, by this definition,

$$\omega\uparrow\uparrow\varepsilon_0=\varepsilon_{\varepsilon_0}$$

The following definition may be nicer to use:

$$\alpha\uparrow^\beta\delta=\begin{cases}\alpha,&\delta=1\\\alpha^\delta,&\beta=1\\\sup\{(\alpha\uparrow^\beta\psi)\uparrow^\gamma(\alpha\uparrow^\beta\psi)|0<\gamma<\beta,0<\psi<\delta\},&\text{else}\end{cases}$$

And likewise extends to higher operations.

I believe I incidentally answered this question while working on some research recently — it is possible to extend the usual hyperoperation sequence $\mathcal{H}_\omega$ on $\mathbb{N}$ to a recursive sequence of operations $\mathcal{H}$ on $O_n$, with the following result:

$$\mathcal{H}_{_\Omega}(\alpha,\beta)=\begin{cases}

\mathcal{S}\alpha, & \text{if} \ \Omega=0. \\

\alpha, & \text{if} \ \Omega=1 \ \text{and} \ \beta=0. \\

\mathcal{S}\alpha,& \text{if} \ \Omega=1 \ \text{and} \ \beta=1. \\

0, & \text{if} \ \Omega=2 \ \text{and} \ \beta=0. \\

\alpha, & \text{if} \ \Omega=2 \ \text{and} \ \beta=1. \\

1, & \text{if} \ \Omega\geq3 \ \text{and} \ \beta=0. \\

\alpha, & \text{if} \ \Omega\geq3 \ \text{and} \ \beta=1. \\

\mathcal{H}_{_{\Omega-1}}\big(\mathcal{H}_{_\Omega}(\alpha,\beta-1),\alpha\big), & \text{if} \ \Omega=\mathcal{S}\bigcup\Omega \ \text{and} \ 1<\beta=\mathcal{S}\bigcup\beta. \\

\bigcup_{\delta<\beta}\mathcal{H}_{_\Omega}(\alpha,\delta), & \text{if} \ \Omega=\mathcal{S}\bigcup\Omega \ \text{and} \ \ 1<\beta=\bigcup\beta . \\

\bigcup_{\rho<\Omega}\mathcal{H}_{_\rho}(\alpha,\beta), & \text{if} \ 0\neq\Omega=\bigcup\Omega \ \text{and} \ 1<\beta=\mathcal{S}\bigcup\beta. \\

\bigcup_{\rho<\Omega}\bigcup_{\delta<\beta}\mathcal{H}_{_\rho}(\alpha,\delta), & \text{if} \ 0\neq\Omega=\bigcup\Omega \ \text{and} \ 1<\beta=\bigcup\beta. \\

\end{cases}$$

This ‘transfinite hyperoperation sequence’ is a very ‘large’ object in the sense that each hyperoperation in the sequence is a proper class, but it is well defined under the appropriate reflection principle or under ETR and satisfies nice relations like $\mathcal{H}_4(\omega,\omega)=^\omega\omega=\omega^{\omega^{\omega^{\dots}}}$ in your question, and $\mathcal{H}_5(\omega,\omega)=^{^{^{\dots}\omega}\omega}\omega$, so on and so forth.

We can also generalize $\gamma$, $\delta$ and $\epsilon$ numbers to the $\Omega^{th}$ hyperoperation, finding ordinals that ‘absorb’ larger and larger recursively defined binary operations. If you would like to see a proof of the above claims, feel free to check out my paper https://arxiv.org/abs/1706.08908 — the part involving this hyperoperation sequence begins on page 20.

- Proof writing: how to write a clear induction proof?
- Evaluate the definite integral $ \int_{-\infty}^{\infty} \frac{\cos(x)}{x^4 +1} \ \ dx $
- LP problem involving producing assemblies
- Finding $X_t$ of an Itô Diffusion
- Riemann Zeta function – number of zeros
- Totally ordering the power set of a well ordered set.
- Find that solution $ϕ$ which satisfies $ϕ(0) = 1, ϕ'(0) = 2$ for $y'' = 3x + 1$.
- Surjectivity of a map between a module and its double dual
- Finding the spanning subgraphs of a complete bipartite graph
- A lower bound for the ratio of $2$- and $\infty$-norms within a linear subspace
- Sum of derivatives of a polynomial
- Notation for “vectorized” function
- I am trying to show $\int^\infty_0\frac{\sin(x)}{x}dx=\frac{\pi}{2}$
- Nilpotent elements of a non-commutative ring with trivial automorphism group form an ideal
- If $f,g$ are continuous at $a$, show that $h(x)=\max\{f(x),g(x)\}$ and $k(x)=\min\{f(x),g(x)\}$ are also continuous at $a$