User:BTZorbas/sandbox

=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 $$\theta$$, using a single transformation $$\xi \mapsto C_{\xi}$$ which assigns to every ordinal $$\xi < \theta$$ a set $$C_{\xi}$$ of smaller ordinals that is closed and unbounded in the set of ordinals $$< \xi$$. The transﬁnite sequence
 * $$C_{\xi}(\xi < \theta)$$

which we call a C sequence and on which we base our recursive constructions.

The method might be formally described this as follows:

Let $$\alpha$$ be an ordinal and let $$\beta$$ be another one defined as $$\beta = \{\alpha:\alpha < \beta\}$$

Further

\begin{align} & 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{align} $$

and the Cantor's normal form of an ordinal is $$\alpha = n_1\omega^{\alpha_1} + n_2 \omega^{\alpha_2} + \cdots +n_k\omega^{\alpha_k}$$ where $$\alpha_1 \ge \alpha_2 \ge \cdots \ge \alpha_k \ge 0$$ are ordinals and $$ n_1, n_2, \ldots, n_k $$ are natural numbers. For more details see Ordinal arithmetic. Ordinals from the class $$\varepsilon_0 = \{\alpha:\alpha=\omega^\alpha\}$$ – in this case the ordinals $$\alpha_1>\alpha_2> \cdots >\alpha_k$$ are all in the Cantor normal form of $$\alpha$$ and smaller than $$\alpha$$. For each limit countable ordinal $$\alpha<\varepsilon_0$$ we'll create a sequence $$C_\alpha = \{c_\alpha(n):\alpha<\omega\}\subseteq\alpha$$ such that $$c_{\alpha+1}(n) = \alpha$$ for all $$n$$ and such that $$c_{\alpha}(n) < c_{\alpha}(n + 1) $$ for all $$n$$ and $$\alpha = \lim_{n\to\infty}c_\alpha(n)$$ when $$\alpha$$ is limit.

Minimal step from $$\beta$$ towards $$\alpha < \beta$$


 * $$\beta \curvearrowright c_\beta(n(\alpha,\beta))$$

where


 * $$n(\alpha,\beta)=\min\{n:c_\beta (n)\ge \alpha\}$$

Minimal walk from $$\beta$$ towards $$\alpha$$ is a finite decreasing sequence


 * $$\beta = \beta_0\curvearrowright \beta_1\curvearrowright \cdots \curvearrowright\beta_k = \alpha$$

such that for all $$i<k$$ the step $$\beta_i\curvearrowright \beta_{i-1}$$ is the minimal step from $$\beta_i$$ towards $$\alpha$$ i.e.


 * $$\beta_{i+1} = c_\beta(n(\alpha,\beta_i))$$

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.