Veblen function

Veblen function. The Veblen function is a hierarchy of ordinal-valued functions introduced by the American mathematician Oswald Veblen in his 1908 paper, providing a systematic method for generating large countable ordinals. It extends the idea of the Cantor normal form and the epsilon numbers, forming a fundamental tool in the study of proof theory and ordinal analysis. The function's recursive definition allows it to surpass the large countable ordinals reachable by simpler operations like ordinal addition and multiplication.

Definition and basic properties

The Veblen function is defined via a transfinite recursion on a two-variable function, often denoted \(\varphi_\alpha(\beta)\). For the base case, \(\varphi_0(\beta) = \omega^\beta\), which corresponds directly to the Cantor normal form for ordinals. The recursive step for successor ordinals defines \(\varphi_{\alpha+1}(\beta)\) as the \((1+\beta)\)-th common fixed point of the function \(\varphi_\alpha\). This construction generalizes how the epsilon number \(\varepsilon_0\) is defined as the first fixed point of \(\alpha \mapsto \omega^\alpha\). A critical property is that for a fixed \(\alpha\), the function \(\xi \mapsto \varphi_\alpha(\xi)\) is normal, meaning it is strictly increasing and continuous. The function was historically developed to provide a notation system for ordinals beyond those accessible via the Veblen hierarchy of critical functions.

Transfinite extension

To define the Veblen function for limit ordinal arguments \(\alpha\), one considers the function as an enumeration of the common fixed points of all preceding functions. Formally, for a limit ordinal \(\lambda\), the value \(\varphi_\lambda(\beta)\) is defined as the \((1+\beta)\)-th common fixed point of the functions \(\varphi_\xi\) for all \(\xi < \lambda\). This allows the hierarchy to continue into the transfinite, generating ordinals like the Feferman–Schütte ordinal \(\Gamma_0\), which is often expressed as \(\varphi(1,0,0)\) in a multi-argument extension. The process can be further extended to finitely many arguments, a generalization studied by later mathematicians like Kleene and explored in the context of large countable ordinals. This transfinite extension is central to the function's role in ordinal analysis of formal systems such as Peano arithmetic.

Fundamental sequences and applications

Assigning fundamental sequences to ordinals generated by the Veblen function is essential for applications in proof theory and computability theory. For a limit ordinal \(\lambda = \varphi_\alpha(\beta)\), a canonical fundamental sequence can be defined by considering the ordering of the fixed points. This allows the definition of fast-growing hierarchies and Hardy hierarchies, which are used to calibrate the proof-theoretic strength of formal systems. The work of Takeuti and Schütte on ordinal diagrams utilized these sequences. Furthermore, these hierarchies connect to computable functions and have implications in the study of Goodstein's theorem and hydra games, demonstrating the combinatorial power of the ordinals constructed.

Relation to other ordinal notations

The Veblen function is deeply interconnected with several other systems for denoting large ordinals. It directly generalizes the Cantor normal form and provides an alternative notation for the epsilon numbers, where \(\varepsilon_\alpha = \varphi_1(\alpha)\). The multi-argument Veblen function, sometimes called the Veblen phi function, subsumes the ordinal collapsing functions developed by Pohlers and Buchholz for analyzing stronger systems like Π^1_2-comprehension. It also precedes and influences the development of ordinal notation systems like those of Girard's Π^1_2-logic and the θ function used in the analysis of Kripke–Platek set theory. Comparisons are often made to the large cardinal axioms in set theory, though the Veblen function operates strictly within the countable realm.

Examples and special cases

Prominent examples generated by the Veblen function include \(\varphi_0(0) = 1\) and \(\varphi_0(1) = \omega\). The first significant ordinal is \(\varphi_1(0) = \varepsilon_0\), the limit of the sequence \(\omega, \omega^\omega, \omega^{\omega^\omega}, \ldots\), which is the proof-theoretic ordinal of Peano arithmetic. The ordinal \(\varphi_2(0)\) is known as \(\zeta_0\), the first fixed point of \(\alpha \mapsto \varepsilon_\alpha\). The Feferman–Schütte ordinal \(\Gamma_0\) is defined as the smallest ordinal not reachable by the finite-argument Veblen function, often written as \(\varphi(1,0,0)\). Larger countable ordinals like the Ackermann ordinal and the small Veblen ordinal are also defined using extensions of this hierarchy, illustrating its capacity to organize the complex landscape of large countable ordinals studied in metamathematics.

Category:Ordinal numbers Category:Mathematical logic Category:Set theory