Walks on ordinals
In mathematics, the method of walks on ordinals, often called minimal walks on ordinals, was invented and introduced by Stevo Todorčević as a part of his new proof of the existence of the Countryman line in May 1984.
The method is a tool for constructing uncountable objects (from set-theoretic trees to separable Banach spaces) by utilizing an analysis of certain descending sequences of ordinals known as minimal walks.
The method is a particular recursive method of constructing mathematical structures that live on a given ordinal
, using a single transformation
which assigns to every ordinal
a set
of smaller ordinals that is closed and unbounded in the set of ordinals
. The transfinite sequence
![{\displaystyle C_{\xi }(\xi <\theta )}](https://wikimedia.org/api/rest_v1/media/math/render/svg/6a5eba5d55a9978793a929fc5d103f99b9a625e1)
which we call a C sequence and on which we base our recursive constructions.
The method might be formally described this as follows:
Let
be an ordinal and let
be another one defined as
Further
![{\displaystyle {\begin{aligned}&0=\emptyset ;\\&1=\{0\};\\&2=\{0,1\};\\&\,\,\,\vdots \\&\omega =\{0,1,2,\ldots \};\\&\omega +1=\omega \cup \{\omega \};\\&\omega +2=\omega \cup \{\omega ,\omega +1\};\\&\,\,\,\vdots \end{aligned))}](https://wikimedia.org/api/rest_v1/media/math/render/svg/bad963fe6ebb116e328580c4677b8cce0bcaf6c9)
and the Cantor's normal form of an ordinal is
where
are ordinals and
are natural numbers. For more details see Ordinal arithmetic.
Ordinals from the class
– in this case the ordinals
are all in the Cantor normal form of
and smaller than
. For each limit countable ordinal
we'll create a sequence
such that
for all
and such that
for all
and
when
is limit.
Minimal step from
towards
![{\displaystyle \beta \curvearrowright c_{\beta }(n(\alpha ,\beta ))}](https://wikimedia.org/api/rest_v1/media/math/render/svg/d5f9583db2999591a0ecf30d044508ca9aedc9b4)
where
![{\displaystyle n(\alpha ,\beta )=\min\{n:c_{\beta }(n)\geq \alpha \))](https://wikimedia.org/api/rest_v1/media/math/render/svg/a8939446c34e20c94d88da52118896cec54bec2f)
Minimal walk from
towards
is a finite decreasing sequence
![{\displaystyle \beta =\beta _{0}\curvearrowright \beta _{1}\curvearrowright \cdots \curvearrowright \beta _{k}=\alpha }](https://wikimedia.org/api/rest_v1/media/math/render/svg/0facfb4ae0017a40701cc924d31edb6e8ec862c4)
such that for all
the step
is the minimal step from
towards
i.e.
![{\displaystyle \beta _{i+1}=c_{\beta }(n(\alpha ,\beta _{i}))}](https://wikimedia.org/api/rest_v1/media/math/render/svg/568fcdec230ecc32cc87a01cd9819cae25df0ce7)
The method definition given above belongs to Todorcevic. Different, but equivalent method definitions, can be found in papers.
Many applications of the method have been found in combinatorial set theory, in general topology and in Banach space theory.