Get Veblen Function essential facts below. View Videos or join the Veblen Function discussion. Add Veblen Function to your PopFlock.com topic list for future reference or share this resource on social media.
In the special case when ?0(?)=??
this family of functions is known as the Veblen hierarchy.
The function ?1 is the same as the ? function1(?)= ??. If then From this and the fact that ?? is strictly increasing we get the ordering: if and only if either ( and ) or ( and ) or ( and ).
Fundamental sequences for the Veblen hierarchy
The fundamental sequence for an ordinal with cofinality ? is a distinguished strictly increasing ?-sequence which has the ordinal as its limit. If one has fundamental sequences for ? and all smaller limit ordinals, then one can create an explicit constructive bijection between ? and ?, (i.e. one not using the axiom of choice). Here we will describe fundamental sequences for the Veblen hierarchy of ordinals. The image of n under the fundamental sequence for ? will be indicated by ?[n].
A variation of Cantor normal form used in connection with the Veblen hierarchy is — every nonzero ordinal number ? can be uniquely written as , where k>0 is a natural number and each term after the first is less than or equal to the previous term, and each If a fundamental sequence can be provided for the last term, then that term can be replaced by such a sequence to get
For any ?, if ? is a limit with then let
No such sequence can be provided for = ?0 = 1 because it does not have cofinality ?.
For we choose
For we use and i.e. 0, , , etc..
For , we use and
Now suppose that ? is a limit:
If , then let
For , use
Otherwise, the ordinal cannot be described in terms of smaller ordinals using and this scheme does not apply to it.
The Γ function
The function ? enumerates the ordinals ? such that ??(0) = ?.
?0 is the Feferman-Schütte ordinal, i.e. it is the smallest ? such that ??(0) = ?.
For ?0, a fundamental sequence could be chosen to be and
For ??+1, let and
For ?? where is a limit, let
Finitely many variables
To build the Veblen function of a finite number of arguments (finitary Veblen function), let the binary function be as defined above.
Let be an empty string or a string consisting of one or more comma-separated zeros and be an empty string or a string consisting of one or more comma-separated ordinals with . The binary function can be written as where both and are empty strings.
The finitary Veblen functions are defined as follows:
if , then denotes the -th common fixed point of the functions for each
For example, is the -th fixed point of the functions , namely ; then enumerates the fixed points of that function, i.e., of the function; and enumerates the fixed points of all the . Each instance of the generalized Veblen functions is continuous in the last nonzero variable (i.e., if one variable is made to vary and all later variables are kept constantly equal to zero).
Every non-zero ordinal less than the small Veblen ordinal (SVO) can be uniquely written in normal form for the finitary Veblen function:
is a positive integer
is a string consisting of one or more comma-separated ordinals where and each
Fundamental sequences for limit ordinals of finitary Veblen function
For limit ordinals , written in normal form for the finitary Veblen function:
and if and is a successor ordinal,
and if and are successor ordinals,
if is a limit ordinal,
if and is a limit ordinal,
if is a successor ordinal and is a limit ordinal.
Transfinitely many variables
More generally, Veblen showed that ? can be defined even for a transfinite sequence of ordinals ??, provided that all but a finite number of them are zero. Notice that if such a sequence of ordinals is chosen from those less than an uncountable regular cardinal ?, then the sequence may be encoded as a single ordinal less than ??. So one is defining a function ? from ?? into ?.
The definition can be given as follows: let ? be a transfinite sequence of ordinals (i.e., an ordinal function with finite support) which ends in zero (i.e., such that =0), and let ? denote the same function where the final 0 has been replaced by ?. Then (?) is defined as the function enumerating the common fixed points of all functions (?) where ? ranges over all sequences which are obtained by decreasing the smallest-indexed nonzero value of ? and replacing some smaller-indexed value with the indeterminate ? (i.e., ?=?[?,] meaning that for the smallest index such that ? is nonzero the latter has been replaced by some value ?<? and that for some smaller index ?<, the value ??=0 has been replaced with ?).
For example, if ?=(1) denotes the transfinite sequence with value 1 at ? and 0 everywhere else, then ?(1) is the smallest fixed point of all the functions (?,0,...,0) with finitely many final zeroes (it is also the limit of the ?(1,0,...,0) with finitely many zeroes, the small Veblen ordinal).
The smallest ordinal ? such that ? is greater than ? applied to any function with support in ? (i.e., which cannot be reached "from below" using the Veblen function of transfinitely many variables) is sometimes known as the "large" Veblen ordinal.