← All papers
First page of Notes on Laver Tables

Notes on Laver Tables

Renrui Qi

math.LO Jan 12, 2025 · v5 math.CO
The main lower-bound theorem was formalized in Lean 4 by a credited Peking University AI-for-math team, who also found typos along the way.
We present some new lower bound estimates for certain numbers in Laver table theory and introduce several related structures of interest.

Laver's work shows that the rank-into-rank axiom I3 implies the totality of a computable function F arising from Laver tables. Dougherty's 1992 lower bound for F only slightly exceeded Ackermann growth, and it had not been improved in three decades.

The author studies how the application operation on elementary embeddings acts on critical points, extending Dougherty's combinatorial method. New combinatorial objects called basic Laver patterns and systems are introduced, together with operations on them, and are used to propagate estimates starting from small critical points. Laver Table Yarns are also introduced: structures that interweave crit*-sequences from increasing chains of embeddings. The main theorem was formalized in Lean 4 by a third-party team.

The lower bound for F(n) is substantially improved, showing that F grows fast enough that its totality is unprovable in Peano Arithmetic. For computable increasing λ-sequences, the order type of the associated crit*-set is shown to be computable. Open questions are posed about copyability of patterns and the heights of LTY ordinals.