Veblen function

[[File:Placeholder|viThe **Veblen functions** are a hierarchy of normal functions

φ
α

:
O
n
→
O
n

{\displaystyle \varphi\_\alpha: On \rightarrow On}

, proposed by american mathematician Oswald Veblen in his article "Continuous Increasing Functions of Finite and Transfinite Ordinals" in 1908. This allows to obtain ordinals beyond limit of the Cantor normal form. The modern version of the Veblen function is described below.

## The Veblen hierarchy

The hierarchy is defined as follows:

φ
0

(
γ
# )

ω
γ

{\displaystyle \varphi\_0(\gamma)=\omega^\gamma}

2) For

α
>
0

{\displaystyle \alpha>0}

,

φ
α

(
γ
# )

{\displaystyle \varphi\_\alpha(\gamma)=}

 the

1
γ

{\displaystyle 1+\gamma}

th common fixed point of the functions

φ
β

(
ξ
# )
ξ

{\displaystyle \varphi\_\beta( \xi)=\xi}

 for all

β
<
α

{\displaystyle \beta<\alpha}

.

Thus

φ
1

(
γ
# )

ε
γ

{\displaystyle \varphi\_1(\gamma)=\varepsilon\_\gamma}

,

φ
2

(
γ
# )

ζ
γ

{\displaystyle \varphi\_2(\gamma)=\zeta\_\gamma}

 and so on (

ε
γ

{\displaystyle \varepsilon\_\gamma}

 enumerates the ordinals

ξ

{\displaystyle \xi}

 such that

ξ
↦

ω

ξ

{\displaystyle \xi\mapsto\omega^{\xi}}

 and

ζ
γ

{\displaystyle \zeta\_\gamma}

 enumerates the ordinals

ξ

{\displaystyle \xi}

 such that

ξ
↦

ε
ξ

{\displaystyle \xi\mapsto \varepsilon\_\xi}

 ).

For example:

φ
2

(
2
# )

ζ
2

{\displaystyle \varphi\_2(2)=\zeta\_2}

 is common fixed point of the functions

φ
0

(
ξ
# )
ξ

{\displaystyle \varphi\_0(\xi)=\xi}

 and

φ
1

(
ξ
# )
ξ

{\displaystyle \varphi\_1(\xi)=\xi}

 so far as

ζ
2

=

ω

ζ
2

{\displaystyle \zeta\_2=\omega^{\zeta\_2}}

 as well as

ζ
2

=

ε

ζ
2

{\displaystyle \zeta\_2=\varepsilon\_{\zeta\_2}}

 and this is third common fixed point for this functions after

ζ
0

{\displaystyle \zeta\_0}

 and

ζ
1

{\displaystyle \zeta\_1}

.

Every non-zero ordinal

α
<

Γ
0

{\displaystyle \alpha<\Gamma\_0}

 can be uniquely written in normal form for the Veblen hierarchy:

# α

φ

β
1

(

γ
1

)

φ

β
2

(

γ
2

)
⋯

φ

β
k

(

γ
k

)

{\displaystyle \alpha=\varphi\_{\beta\_1}(\gamma\_1) + \varphi\_{\beta\_2}(\gamma\_2) + \cdots + \varphi\_{\beta\_k}(\gamma\_k)}

,

where

* φ

β
1

(

γ
1

)
≥

φ

β
2

(

γ
2

)
≥
⋯
≥

φ

β
k

(

γ
k

)

{\displaystyle \varphi\_{\beta\_1}(\gamma\_1) \ge \varphi\_{\beta\_2}(\gamma\_2) \ge \cdots \ge \varphi\_{\beta\_k}(\gamma\_k)}
* γ
m

<

φ

β
m

(

γ
m

)

{\displaystyle \gamma\_m < \varphi\_{\beta\_m}(\gamma\_m)}

 for

m
∈
{
1
,
.
.
.
,
k
}

{\displaystyle m \in \{1,...,k\}}

Note:

Γ

0

{\displaystyle \Gamma\_{0}}

 is the smallest ordinal

α

{\displaystyle \alpha}

 such that

φ
α

(
0
# )
α

{\displaystyle \varphi\_\alpha(0)=\alpha}

.

### Fundamental sequences for the Veblen hierarchy

Fundamental sequence for a limit ordinal

α

{\displaystyle \alpha}

 is a strictly increasing sequence which has the ordinal

α

{\displaystyle \alpha}

 as its limit. Below

α
[
n
]

{\displaystyle \alpha[n]}

 denotes the *n*-th element of the fundamental sequence assigned to the limit ordinal

α

{\displaystyle \alpha}

, where

n

{\displaystyle n}

 is a non-negative integer.

Fundamental sequences for the Veblen's hierarchy are defined as follows:
For limit ordinals

α
<

Γ
0

{\displaystyle \alpha<\Gamma\_0}

, written in normal form for the Veblen hierarchy

1.1)

(

φ

β
1

(

γ
1

)

φ

β
2

(

γ
2

)
⋯

φ

β
k

(

γ
k

)
)
[
n
# ]

φ

β
1

(

γ
1

)
⋯

φ

β

k
−
1

(

γ

k
−
1

)

φ

β
k

(

γ
k

)
[
n
]

{\displaystyle (\varphi\_{\beta\_1}(\gamma\_1) + \varphi\_{\beta\_2}(\gamma\_2) + \cdots + \varphi\_{\beta\_k}(\gamma\_k))[n]=\varphi\_{\beta\_1 }(\gamma\_1) + \cdots + \varphi\_{\beta\_{k-1}}(\gamma\_{k-1}) + \varphi\_{\beta\_k}(\gamma\_k) [n]}

,

1.2)

φ
0

(
γ
# )

ω
γ

{\displaystyle \varphi\_0(\gamma)=\omega^\gamma}

 and

φ
0

(
γ
1
)
[
n
# ]

ω

γ

⋅
n

{\displaystyle \varphi\_0(\gamma+1) [n] = \omega^{\gamma} \cdot n}

,

1.3)

φ

β
1

(
0
)
[
n
# ]

φ

β

n

(
0
)

{\displaystyle \varphi\_{\beta+1}(0)[n]=\varphi\_{\beta}^n(0)}

,

1.4)

φ

β
1

(
γ
1
)
[
n
# ]

φ

β

n

(

φ

β
1

(
γ
)
1
)

{\displaystyle \varphi\_{\beta+1}(\gamma+1)[n]=\varphi\_{\beta}^n(\varphi\_{\beta+1}(\gamma)+1)}

,

1.5)

φ

β

(
γ
)
[
n
# ]

φ

β

(
γ
[
n
]
)

{\displaystyle \varphi\_{\beta}(\gamma) [n] = \varphi\_{\beta}(\gamma [n])}

 for a limit ordinal

γ
<

φ
β

(
γ
)

{\displaystyle \gamma<\varphi\_\beta(\gamma)}

,

1.6)

φ

β

(
0
)
[
n
# ]

φ

β
[
n
]

(
0
)

{\displaystyle \varphi\_{\beta}(0) [n] = \varphi\_{\beta [n]}(0)}

 for a limit ordinal

β
<

φ
β

(
0
)

{\displaystyle \beta<\varphi\_\beta(0)}

,

1.7)

φ

β

(
γ
1
)
[
n
# ]

φ

β
[
n
]

(

φ

β

(
γ
)
1
)

{\displaystyle \varphi\_{\beta}(\gamma+1) [n] = \varphi\_{\beta [n]}(\varphi\_{\beta}(\gamma)+1)}

 for a limit ordinal

β

{\displaystyle \beta}

.

In rules 1.3 and 1.4,

φ
n

{\displaystyle \varphi^n}

 denotes function iteration:

φ

β

0

(
γ
# )
γ

{\displaystyle \varphi\_{\beta}^0(\gamma)=\gamma}

 and

φ

β

m
1

(
γ
# )

φ

β

(

φ

β

m

(
γ
)
)

{\displaystyle \varphi\_{\beta}^{m+ 1}(\gamma)=\varphi\_{\beta}(\varphi\_{\beta}^{m}(\gamma))}

.

## The extended (finitary) Veblen function

For the building of Veblen function with arbitrary amount of arguments, let's consider

φ
α

(
γ
)

{\displaystyle \varphi\_\alpha(\gamma)}

 as binary function

φ
(
α
,
γ
)

{\displaystyle \varphi(\alpha, \gamma)}

.

Let *z* be an empty string or a string with one or more zeros

0
,
0
,
.
.
.
,
0

{\displaystyle 0,0,...,0}

 and *s* be an empty string or an arbitrary string of ordinal variables

α
1

,

α
2

,
.
.
.
,

α
n

{\displaystyle \alpha\_1,\alpha\_2,...,\alpha\_n}

 with

α
1

>
0

{\displaystyle \alpha\_1>0}

. The binary function

φ
(
α
,
γ
)

{\displaystyle \varphi(\alpha, \gamma)}

 can be written as

φ
(
s
,
α
,
z
,
γ
)

{\displaystyle \varphi(s,\alpha, z,\gamma)}

 where both *s* and *z* are empty strings.

The extended Veblen functions are defined as follows:

* φ
(
γ
# )

ω
γ

{\displaystyle \varphi(\gamma)=\omega^\gamma}

,
* φ
(
z
,
s
,
γ
# )
φ
(
s
,
γ
)

{\displaystyle \varphi(z,s,\gamma)=\varphi(s,\gamma)}

,
* if

α

n
1

>
0

{\displaystyle \alpha\_{n+1}>0}

, where

n
≥
0

{\displaystyle n\geq 0}

, then

φ
(
s
,

α

n
1

,
z
,
γ
)

{\displaystyle \varphi(s,\alpha\_{n+1}, z, \gamma)}

 denotes the

γ

{\displaystyle \gamma}

th common fixed point of the functions

ξ
↦
φ
(
s
,
β
,
ξ
,
z
)

{\displaystyle \xi \mapsto \varphi(s, \beta, \xi,z)}

 for each

β
<

α

n
1

{\displaystyle \beta<\alpha\_{n+1}}

.

Every non-zero ordinal

α

{\displaystyle \alpha}

 less than the small Veblen ordinal (SVO) can be uniquely written in normal form for the finitary Veblen function:

# α
φ
(

s
1

)
φ
(

s
2

)
⋯
φ
(

s
k

)

{\displaystyle \alpha=\varphi(s\_1)+\varphi(s\_2)+\cdots+\varphi(s\_k)}

where

* φ
(

s
1

)
≥
φ
(

s
2

)
≥
⋯
≥
φ
(

s
k

)

{\displaystyle \varphi (s\_1) \geq\varphi (s\_2) \geq\cdots\geq\varphi (s\_k)}

,
* s
m

{\displaystyle s\_m}

 is an arbitrary string of ordinal variables

α

m
,
1

,

α

m
,
2

,
.
.
.
,

α

m
,

n
m

{\displaystyle \alpha\_{m,1}, \alpha\_{m,2},...,\alpha\_{m,n\_m}}

 where

m
∈
{
1
,
.
.
.
,
k
}

{\displaystyle m \in \{1,...,k\}}
* α

m
,
1

>
0

{\displaystyle \alpha\_{m,1}>0}

 and

α

m
,
i

<
φ
(

s
m

)

{\displaystyle \alpha\_{m,i}<\varphi(s\_m)}

 for

m
∈
{
1
,
.
.
.
,
k
}

{\displaystyle m \in \{1,...,k\}}

 and

i
∈
{
1
,
.
.
,

n
m

}

{\displaystyle i \in \{1,..,n\_m\}}

,
* k
,

n
1

,
.
.
.
,

n
k

{\displaystyle k, n\_1,...,n\_k}

 are positive integers.

### Fundamental sequences for limit ordinals of finitary Veblen function

For limit ordinals

α
<
S
V
O

{\displaystyle \alpha<SVO}

, written in normal form for the finitary Veblen function

2.1)

(
φ
(

s
1

)
φ
(

s
2

)
⋯
φ
(

s
k

)
)
[
n
# ]
φ
(

s
1

)
φ
(

s
2

)
⋯
φ
(

s
k

)
[
n
]

{\displaystyle (\varphi(s\_1)+\varphi(s\_2)+\cdots+\varphi(s\_k))[n]=\varphi(s\_1)+\varphi(s\_2)+\cdots+\varphi(s\_k)[n]}

,

2.2)

φ
(
γ
)
[
n
# ]

{

n

if

# γ
1

φ
(
γ
−
1
)
⋅
n

if

γ

is a successor ordinal

φ
(
γ
[
n
]
)

if

γ

is a limit ordinal

{\displaystyle \varphi(\gamma)[n]=\left\{\begin{array}{lcr}
n \quad \text{if} \quad \gamma=1\\
\varphi(\gamma-1)\cdot n \quad \text{if} \quad \gamma \quad \text{is a successor ordinal}\\
\varphi(\gamma[n]) \quad \text{if} \quad \gamma \quad \text{is a limit ordinal}\\
\end{array}\right.
}

,

2.3)

φ
(
s
,
β
,
z
,
γ
)
[
0
# ]
0

{\displaystyle \varphi(s,\beta,z,\gamma)[0]=0}

 and

φ
(
s
,
β
,
z
,
γ
)
[
n
1
# ]
φ
(
s
,
β
−
1
,
φ
(
s
,
β
,
z
,
γ
)
[
n
]
,
z
)

{\displaystyle \varphi(s,\beta,z,\gamma)[n+1]=\varphi(s,\beta-1,\varphi(s,\beta,z,\gamma)[n],z)}

 if

# γ
0

{\displaystyle \gamma=0}

 and

β

{\displaystyle \beta}

 is a successor ordinal,

2.4)

φ
(
s
,
β
,
z
,
γ
)
[
0
# ]
φ
(
s
,
β
,
z
,
γ
−
1
)
1

{\displaystyle \varphi(s,\beta,z,\gamma)[0]=\varphi(s,\beta,z,\gamma-1)+1}

 and

φ
(
s
,
β
,
z
,
γ
)
[
n
1
# ]
φ
(
s
,
β
−
1
,
φ
(
s
,
β
,
z
,
γ
)
[
n
]
,
z
)

{\displaystyle \varphi(s,\beta,z,\gamma)[n+1]=\varphi(s,\beta-1,\varphi(s,\beta,z,\gamma)[n],z)}

 if

γ

{\displaystyle \gamma}

 and

β

{\displaystyle \beta}

 are successor ordinals,

2.5)

φ
(
s
,
β
,
z
,
γ
)
[
n
# ]
φ
(
s
,
β
,
z
,
γ
[
n
]
)

{\displaystyle \varphi(s,\beta,z,\gamma)[n]=\varphi(s,\beta,z,\gamma[n])}

 if

γ

{\displaystyle \gamma}

 is a limit ordinal,

2.6)

φ
(
s
,
β
,
z
,
γ
)
[
n
# ]
φ
(
s
,
β
[
n
]
,
z
,
γ
)

{\displaystyle \varphi(s,\beta,z,\gamma)[n]=\varphi(s,\beta[n],z,\gamma)}

 if

# γ
0

{\displaystyle \gamma=0}

 and

β

{\displaystyle \beta}

 is a limit ordinal,

2.7)

φ
(
s
,
β
,
z
,
γ
)
[
n
# ]
φ
(
s
,
β
[
n
]
,
φ
(
s
,
β
,
z
,
γ
−
1
)
1
,
z
)

{\displaystyle \varphi(s,\beta,z,\gamma)[n]=\varphi(s,\beta[n],\varphi(s,\beta,z,\gamma-1)+1,z)}

 if

γ

{\displaystyle \gamma}

 is a successor ordinal and

β

{\displaystyle \beta}

 is a limit ordinal.

### Examples

φ
(
1
,
0
)
[
n
# ]

φ
(
0
,
φ
(
0
,
.
.
.
φ

⏟

n

φ
′

s

(
0
,
0
)
.
.
.
)
# )

φ
(
φ
(
.
.
.
φ

⏟

n

φ
′

s

(
0
)
.
.
.
)
# )

ε
0

{\displaystyle \varphi(1,0)[n]=\underbrace{\varphi(0, \varphi (0, ... \varphi}\_{n \quad \varphi's}(0,0)...))=\underbrace{\varphi(\varphi(...\varphi}\_{n \quad \varphi's}(0)...))=\varepsilon\_0}

,

φ
(
1
,
0
,
0
)
[
n
# ]

φ
(
0
,
φ
(
0
,
.
.
.
φ

⏟

n

φ
′

s

(
0
,
0
,
0
)
.
.
.
,
0
)
,
0
# )

φ
(
φ
(
.
.
.
φ

⏟

n

φ
′

s

(
0
,
0
)
.
.
.
,
0
)
,
0
# )

Γ
0

{\displaystyle \varphi(1,0,0)[n]=\underbrace{\varphi(0, \varphi (0, ... \varphi}\_{n \quad \varphi's}(0,0,0)...,0),0)=\underbrace{\varphi( \varphi ( ... \varphi}\_{n \quad \varphi's}(0,0)...,0),0)=\Gamma\_0}

,

φ
(
1
,
1
,
1
,
0
,
0
,
0
)
[
n
# ]

φ
(
1
,
1
,
0
,
φ
(
1
,
1
,
0
.
.
.
φ

⏟

n

φ
′

s

(
1
,
1
,
0
,
0
,
0
,
0
)
.
.
.
,
0
,
0
)
,
0
,
0
)

{\displaystyle \varphi(1,1,1,0,0,0)[n]=\underbrace{\varphi(1,1,0,\varphi(1,1,0 ... \varphi}\_{n \quad \varphi's}(1,1,0,0,0,0)...,0,0),0,0)}

.

### Gamma-function

Gamma-function is the function enumerates the ordinals

α

{\displaystyle \alpha}

 such that

φ
(
α
,
0
# )
α

{\displaystyle \varphi(\alpha,0)=\alpha}

 or in other words

Γ
β

=
φ
(
1
,
0
,
β
# )

{\displaystyle \Gamma\_\beta=\varphi(1,0,\beta)=}

the

(
1
β
)

{\displaystyle (1+\beta)}

-th ordinal in the set

{
γ

φ
(
γ
,
0
# )
γ
}

{\displaystyle \{\gamma|\varphi(\gamma,0)=\gamma\}}

. Same way we assign

Γ
β

[
n
# ]
φ
(
1
,
0
,
β
)
[
n
]

{\displaystyle \Gamma\_\beta[n]=\varphi(1,0,\beta)[n]}

.

## Transfinitary Veblen function

For definition of fundamental sequences of Veblen function with ordinal number of variables it is possible to use Schutte Klammersymbolen in form of two-row matrix where a *k*-th ordinal of second row

β
k

≥
0

{\displaystyle \beta\_k \geq 0}

 defines position of a *k*-th ordinal of the first row

α
k

>
0

{\displaystyle \alpha\_k>0}

 in string of arguments of the Veblen function.

For example:

(

α
1

α
2

α
3

8

5

0

)

=
φ
(

α
1

,
0
,
0
,

α
2

,
0
,
0
,
0
,
0
,

α
3

)

{\displaystyle \begin{pmatrix}\alpha\_1 & \alpha\_2 & \alpha\_3 \\8 & 5 & 0 \end{pmatrix}=\varphi(\alpha\_1,0,0,\alpha\_2,0,0,0,0,\alpha\_3)}

.

If a limit ordinal

α

{\displaystyle \alpha}

 is written in next normal form

(

α

1
,
1

⋯

α

1
,

n
1

β

1
,
1

⋯

β

1
,

n
1

)

(

α

2
,
1

⋯

α

2
,

n
2

β

2
,
1

⋯

β

2
,

n
2

)

⋯

(

α

k
,
1

⋯

α

k
,

n
k

β

k
,
1

⋯

β

k
,

n
k

)

{\displaystyle \begin{pmatrix} \alpha\_{1,1} & \cdots &\alpha\_{1,n\_1} \\ \beta\_{1,1} & \cdots & \beta\_{1,n\_1} \end{pmatrix}+\begin{pmatrix} \alpha\_{2,1} & \cdots &\alpha\_{2,n\_2} \\ \beta\_{2,1} & \cdots & \beta\_{2,n\_2} \end{pmatrix}+\cdots+\begin{pmatrix} \alpha\_{k,1} & \cdots &\alpha\_{k,n\_k} \\ \beta\_{k,1} & \cdots & \beta\_{k,n\_k} \end{pmatrix}}

,

where

* (

α

1
,
1

⋯

α

1
,

n
1

β

1
,
1

⋯

β

1
,

n
1

)

≥

(

α

2
,
1

⋯

α

2
,

n
2

β

2
,
1

⋯

β

2
,

n
2

)

≥
⋯
≥

(

α

k
,
1

⋯

α

k
,

n
k

β

k
,
1

⋯

β

k
,

n
k

)

{\displaystyle \begin{pmatrix} \alpha\_{1,1} & \cdots &\alpha\_{1,n\_1} \\ \beta\_{1,1} & \cdots & \beta\_{1,n\_1} \end{pmatrix} \geq \begin{pmatrix} \alpha\_{2,1} & \cdots &\alpha\_{2,n\_2} \\ \beta\_{2,1} & \cdots & \beta\_{2,n\_2} \end{pmatrix} \geq \cdots \geq \begin{pmatrix} \alpha\_{k,1} & \cdots &\alpha\_{k,n\_k} \\ \beta\_{k,1} & \cdots & \beta\_{k,n\_k} \end{pmatrix}}

,
* α

m
,
i

<

(

α

m
,
1

⋯

α

m
,

n
m

β

m
,
1

⋯

β

m
,

n
m

)

{\displaystyle \alpha\_{m,i}<\begin{pmatrix} \alpha\_{m,1} & \cdots &\alpha\_{m,n\_m} \\ \beta\_{m,1} & \cdots & \beta\_{m,n\_m} \end{pmatrix}}

 for all

i
∈
{
1
,
.
.
.
,

n
m

}

{\displaystyle i \in \{1,...,n\_m\}}

,

m
∈
{
1
,
.
.
.
,
k
}

{\displaystyle m \in \{1,...,k\}}

,
* β

m
,
i

<

(

α

m
,
1

⋯

α

m
,

n
m

β

m
,
1

⋯

β

m
,

n
m

)

{\displaystyle \beta\_{m,i}<\begin{pmatrix} \alpha\_{m,1} & \cdots &\alpha\_{m,n\_m} \\ \beta\_{m,1} & \cdots & \beta\_{m,n\_m} \end{pmatrix}}

 for all

i
∈
{
1
,
.
.
.
,

n
m

}

{\displaystyle i \in \{1,...,n\_m\}}

,

m
∈
{
1
,
.
.
.
,
k
}

{\displaystyle m \in \{1,...,k\}}

,
* (

α

k
,
1

⋯

α

k
,

n
k

β

k
,
1

⋯

β

k
,

n
k

)

{\displaystyle \begin{pmatrix} \alpha\_{k,1} & \cdots &\alpha\_{k,n\_k} \\ \beta\_{k,1} & \cdots & \beta\_{k,n\_k} \end{pmatrix}}

 is a limit ordinal,
* k
,

n
1

,
.
.
.
,

n
k

{\displaystyle k, n\_1,...,n\_k}

 are positive integers,

then

α
[
n
# ]

(

α

1
,
1

⋯

α

1
,

n
1

β

1
,
1

⋯

β

1
,

n
1

)

(

α

2
,
1

⋯

α

2
,

n
2

β

2
,
1

⋯

β

2
,

n
2

)

⋯

(

α

k
,
1

⋯

α

k
,

n
k

β

k
,
1

⋯

β

k
,

n
k

)

[
n
]

{\displaystyle \alpha[n]=\begin{pmatrix} \alpha\_{1,1} & \cdots &\alpha\_{1,n\_1} \\ \beta\_{1,1} & \cdots & \beta\_{1,n\_1} \end{pmatrix}+\begin{pmatrix} \alpha\_{2,1} & \cdots &\alpha\_{2,n\_2} \\ \beta\_{2,1} & \cdots & \beta\_{2,n\_2} \end{pmatrix}+\cdots+\begin{pmatrix} \alpha\_{k,1} & \cdots &\alpha\_{k,n\_k} \\ \beta\_{k,1} & \cdots & \beta\_{k,n\_k} \end{pmatrix}[n]}

 (2).

If

n
k

=
1

{\displaystyle n\_k=1}

 and

β

k
,

n
k

=
0

{\displaystyle \beta\_{k,n\_k}=0}

 then the last term (LT) in expression (2) is equal to

(

α

k
,
1

0

)

=
φ
(

α

k
,
1

# )

ω

α

k
,
1

{\displaystyle \begin{pmatrix}\alpha\_{k,1} \\ 0 \end{pmatrix}=\varphi(\alpha\_{k,1})=\omega^{\alpha\_{k,1}}}

 and should use rule for single-argument form to assign fundamental sequences (FS) for LT, otherwise use rules 3.1-3.9 to assign FS for LT:

3.1)

(

⋯

α
1

⋯

β
1

)

[
0
# ]
0

{\displaystyle \begin{pmatrix}\cdots & \alpha+1 \\ \cdots & \beta+1 \end{pmatrix}[0]=0}

and

(

⋯

α
1

⋯

β
1

)

[
n
1
# ]

(

⋯

α

(

⋯

α
1

⋯

β
1

)

[
n
]

⋯

β
1

β

)

{\displaystyle \begin{pmatrix}\cdots & \alpha+1 \\ \cdots & \beta+1 \end{pmatrix}[n+1]=\begin{pmatrix}\cdots & \alpha & \begin{pmatrix}\cdots & \alpha+1 \\ \cdots & \beta+1 \end{pmatrix}[n] \\ \cdots & \beta+1 & \beta \end{pmatrix}}

,

3.2)

(

⋯

α
1

γ
1

⋯

β
1

0

)

[
0
# ]

(

⋯

α
1

γ

⋯

β
1

0

)

1

{\displaystyle \begin{pmatrix}\cdots & \alpha+1 & \gamma+1 \\ \cdots & \beta+1 & 0 \end{pmatrix}[0]=\begin{pmatrix}\cdots & \alpha+1 & \gamma \\ \cdots & \beta+1 & 0 \end{pmatrix}+1}

and

(

⋯

α
1

γ
1

⋯

β
1

0

)

[
n
1
# ]

(

⋯

α

(

⋯

α
1

γ
1

⋯

β
1

0

)

[
n
]

⋯

β
1

β

)

{\displaystyle \begin{pmatrix}\cdots & \alpha+1 & \gamma+1 \\ \cdots & \beta+1 & 0 \end{pmatrix}[n+1]=\begin{pmatrix}\cdots & \alpha & \begin{pmatrix}\cdots & \alpha+1 & \gamma+1 \\ \cdots & \beta+1 & 0 \end{pmatrix}[n] \\ \cdots & \beta+1 & \beta \end{pmatrix}}

,

3.3)

(

⋯

α

γ

⋯

β

0

)

[
n
# ]

(

⋯

α

γ
[
n
]

⋯

β

0

)

{\displaystyle \begin{pmatrix}\cdots & \alpha & \gamma \\ \cdots & \beta & 0 \end{pmatrix}[n]=\begin{pmatrix}\cdots & \alpha & \gamma [n] \\ \cdots & \beta & 0 \end{pmatrix}}

 if

γ

{\displaystyle \gamma}

 is a limit ordinal,

3.4)

(

⋯

α

⋯

β
1

)

[
n
# ]

(

⋯

α
[
n
]

⋯

β
1

)

{\displaystyle \begin{pmatrix}\cdots & \alpha & \\ \cdots & \beta+1 \end{pmatrix}[n]=\begin{pmatrix}\cdots & \alpha [n] & \\ \cdots & \beta+1 \end{pmatrix}}

 if

α

{\displaystyle \alpha}

 is a limit ordinal,

3.5)

(

⋯

α

γ
1

⋯

β
1

0

)

[
n
# ]

(

⋯

α
[
n
]

(

⋯

α

γ

⋯

β
1

0

)

1

⋯

β
1

β

)

{\displaystyle \begin{pmatrix}\cdots & \alpha & \gamma+1 \\ \cdots & \beta+1 & 0 \end{pmatrix}[n]=\begin{pmatrix}\cdots & \alpha [n] & \begin{pmatrix}\cdots & \alpha & \gamma \\ \cdots & \beta+1 & 0 \end{pmatrix}+1 \\ \cdots & \beta+1 & \beta \end{pmatrix}}

 if

α

{\displaystyle \alpha}

 is a limit ordinal,

3.6)

(

⋯

α
1

⋯

β

)

[
n
# ]

(

⋯

α

1

⋯

β

β
[
n
]

)

{\displaystyle \begin{pmatrix}\cdots & \alpha+1\\ \cdots & \beta\end{pmatrix}[n]=\begin{pmatrix}\cdots & \alpha & 1 \\ \cdots & \beta& \beta [n]\end{pmatrix}}

 if

β

{\displaystyle \beta}

 is a limit ordinal,

3.7)

(

⋯

α
1

γ
1

⋯

β

0

)

[
n
# ]

(

⋯

α

(

⋯

α
1

γ

⋯

β

0

)

1

⋯

β

β
[
n
]

)

{\displaystyle \begin{pmatrix}\cdots & \alpha+1 & \gamma+1 \\ \cdots & \beta & 0 \end{pmatrix}[n]=\begin{pmatrix}\cdots & \alpha & \begin{pmatrix}\cdots & \alpha+1 & \gamma \\ \cdots & \beta & 0 \end{pmatrix}+1 \\ \cdots & \beta & \beta[n] \end{pmatrix}}

 if

β

{\displaystyle \beta}

 is a limit ordinal,

3.8)

(

⋯

α

⋯

β

)

[
n
# ]

(

⋯

α
[
n
]

⋯

β

)

{\displaystyle \begin{pmatrix}\cdots & \alpha\\ \cdots & \beta\end{pmatrix}[n]=\begin{pmatrix}\cdots & \alpha [n] \\ \cdots & \beta \end{pmatrix}}

 if

α

{\displaystyle \alpha}

 and

β

{\displaystyle \beta}

 are limit ordinals,

3.9)

(

⋯

α

γ
1

⋯

β

0

)

[
n
# ]

(

⋯

α
[
n
]

(

⋯

α

γ

⋯

β

0

)

1

⋯

β

β
[
n
]

)

{\displaystyle \begin{pmatrix}\cdots & \alpha & \gamma+1 \\ \cdots & \beta & 0 \end{pmatrix}[n]=\begin{pmatrix}\cdots & \alpha [n]& \begin{pmatrix}\cdots & \alpha & \gamma \\ \cdots & \beta & 0 \end{pmatrix}+1 \\ \cdots & \beta & \beta [n] \end{pmatrix}}

 if

α

{\displaystyle \alpha}

 and

β

{\displaystyle \beta}

 are limit ordinals.

The limit of this notation is large Veblen ordinal (LVO):

* L
V
O
[
0
# ]
0

{\displaystyle LVO[0]=0}

,
* L
V
O
[
n
1
# ]

(

1

L
V
O
[
n
]

)

{\displaystyle LVO[n+1]=\begin{pmatrix}1 \\ LVO[n] \end{pmatrix}}

.

### Comparison with theta function

The extended Veblen function and Bird/Feferman theta-functions up to SVO are connected by the next expression:

θ
(

Ω

n
−
1

α

1

⋯

Ω
2

α

n
−
2

Ω

α

n
−
1

α
n

,
γ
# )
φ
(

α

1

,
…
,

α

n
−
2

,

α

n
−
1

,

α
n

,
γ
)

{\displaystyle
\theta(\Omega^{n - 1}\alpha\_{1} + \cdots + \Omega^2\alpha\_{n-2} + \Omega \alpha\_{n-1} + \alpha\_n, \gamma) = \varphi(\alpha\_{1}, \ldots, \alpha\_{n-2}, \alpha\_{n-1}, \alpha\_n, \gamma)}

and

θ
(
α
,
0
)

{\displaystyle \theta(\alpha, 0)}

 can be abbreviated as

θ
(
α
)

{\displaystyle \theta(\alpha)}

. In this terms

S
V
# O
θ
(

Ω
ω

)

{\displaystyle SVO=\theta(\Omega^\omega)}

.

For transfinary Veblen function for example:

(

1

φ
(

α

1

,
…
,

α

n
−
2

,

α

n
−
1

,

α
n

,
γ
)

)

=
θ
(

Ω

θ
(

Ω

n
−
1

α

1

⋯

Ω
2

α

n
−
2

Ω

α

n
−
1

α
n

,
γ
)

)

{\displaystyle \begin{pmatrix} 1\\ \varphi(\alpha\_{1}, \ldots, \alpha\_{n-2}, \alpha\_{n-1}, \alpha\_n, \gamma)\end{pmatrix}=\theta(\Omega^{\theta(\Omega^{n - 1}\alpha\_{1} + \cdots + \Omega^2\alpha\_{n-2} + \Omega \alpha\_{n-1} + \alpha\_n, \gamma)})}

,

(

1

(

1

φ
(

α

1

,
…
,

α

n
−
2

,

α

n
−
1

,

α
n

,
γ
)

)

)

=
θ
(

Ω

θ
(

Ω

θ
(

Ω

n
−
1

α

1

⋯

Ω
2

α

n
−
2

Ω

α

n
−
1

α
n

,
γ
)

)

)

{\displaystyle \begin{pmatrix} 1\\\begin{pmatrix} 1\\ \varphi(\alpha\_{1}, \ldots, \alpha\_{n-2}, \alpha\_{n-1}, \alpha\_n, \gamma)\end{pmatrix}\end{pmatrix}=\theta(\Omega^{\theta(\Omega^{\theta(\Omega^{n - 1}\alpha\_{1} + \cdots + \Omega^2\alpha\_{n-2} + \Omega \alpha\_{n-1} + \alpha\_n, \gamma)})})}

and so on. In this terms

L
V
# O
θ
(

Ω
Ω

)

{\displaystyle LVO=\theta(\Omega^\Omega)}

.

According to Hyp cos' estimation, the growth rate of the function of fast-growing hierarchy

f

(

ω

ω

)

(
n
)

{\displaystyle f\_{\begin{pmatrix} \omega \\ \omega \end{pmatrix}}(n)}

 is less than or equal to the growth rate of Harvey Friedman's TREE(n) function.

The fast-growing hierarchy function indexed by the Large Veblen ordinal,

f

L
V
O

(
10
)

{\displaystyle f\_{LVO}(10)}

, is near to the lowest estimation of Bowers' meameamealokkapoowa oompa.

## Sources

1. ↑ Oswald Veblen. Continuous Increasing Functions of Finite and Transfinite Ordinals
2. ↑ Denis Maksudov. Jager's psi-functions
3. ↑ Denis Maksudov. Fundamental sequences for extended Veblen function