OpenAI preprint, September 2026 · §4. Two models at the prescribed endpoint
Lemma4.1:For
,
at every countable ordinal
past a bound fixed by
and
An
-sequence
of functions on
increasing modulo countable sets.
Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its
declaration both in Lean and in words.
The Setting
A function lies above a function modulo countable sets when for every outside a countable set. Lemma 4.1, in §4 on two models at the prescribed endpoint , asserts that this order has a chain of length : functions , one for each , each lying above every earlier one modulo countable sets.
The Functions
Indices and are ordinals below , and arguments are countable ordinals, the ordinals below .For each the library fixes an injection .✦For , the set of indices placed below is the set of ordinals with .✦
The function is defined by recursion on : its value at is (1)✦ the supremum of the empty set being .
The Claim
Theorem 1. Let . Then (2)✦ and (3)✦
The theorem answers Lemma 4.1 with an explicit chain, the functions of (1).
What Is Checked
The theorem is stated over the functions of (1), built from the fixed injections through the sets , for ordinals and countable ordinals.