OctoInformBeta

OpenAI preprint, September 2026 · §4. Two models at the prescribed endpoint

Lemma 4.1: For γ<α<ω2\gamma<\alpha<\omega_2, fγ(β)<fα(β)f_\gamma(\beta)<f_\alpha(\beta) at every countable ordinal β\beta past a bound fixed by α\alpha and γ\gamma

An ω2\omega_2-sequence of functions on ω1\omega_1 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 f:ω1→ω1f\colon\omega_1\to\omega_1 lies above a function g:ω1→ω1g\colon\omega_1\to\omega_1 modulo countable sets when g(β)<f(β)g(\beta)<f(\beta) for every β<ω1\beta<\omega_1 outside a countable set. Lemma 4.1, in §4 on two models at the prescribed endpoint ℶω2\beth_{\omega_2}, asserts that this order has a chain of length ω2\omega_2: functions fα:ω1→ω1f_\alpha\colon\omega_1\to\omega_1, one for each α<ω2\alpha<\omega_2, each lying above every earlier one modulo countable sets.

The Functions fαf_\alpha

Indices α\alpha and γ\gamma are ordinals below ω2\omega_2, and arguments β\beta are countable ordinals, the ordinals below ω1\omega_1. For each α<ω2\alpha<\omega_2 the library fixes an injection eα:α→ω1e_\alpha\colon\alpha\to\omega_1.✦ For β<ω1\beta<\omega_1, the set Pα(β)P_\alpha(\beta) of indices placed below β\beta is the set of ordinals γ<α\gamma<\alpha with eα(γ)<βe_\alpha(\gamma)<\beta.✦

The function fα:ω1→ω1f_\alpha\colon\omega_1\to\omega_1 is defined by recursion on α<ω2\alpha<\omega_2: its value at β<ω1\beta<\omega_1 is fα(β)=sup⁡{fγ(β)+1:γ∈Pα(β)},f_\alpha(\beta)=\sup\{\,f_\gamma(\beta)+1 : \gamma\in P_\alpha(\beta)\,\},(1)✦ the supremum of the empty set being 00.

The Claim

Theorem 1. Let γ<α<ω2\gamma<\alpha<\omega_2. Then |{β<ω1:fα(β)≤fγ(β)}|≤ℵ0,\bigl|\{\beta<\omega_1 : f_\alpha(\beta)\le f_\gamma(\beta)\}\bigr|\le\aleph_0,(2)✦ and fγ(β)<fα(β)for every β<ω1 with eα(γ)<β.f_\gamma(\beta)<f_\alpha(\beta)\quad\text{for every }\beta<\omega_1\text{ with } e_\alpha(\gamma)<\beta.(3)✦

The theorem answers Lemma 4.1 with an explicit chain, the functions fαf_\alpha of (1).

What Is Checked

The theorem is stated over the functions fαf_\alpha of (1), built from the fixed injections eα:α→ω1e_\alpha\colon\alpha\to\omega_1 through the sets Pα(β)P_\alpha(\beta), for ordinals γ<α<ω2\gamma<\alpha<\omega_2 and countable ordinals β\beta.