OctoInformBeta

OpenAI preprint, September 2026 · §5. A dual space with coded norming functionals

Lemma 5.2: On the first uncountable ordinal ω1\omega_1, closures at the same stage agree below each shared ordinal

Countable initial segments admit coherent finite closures.

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

Here ω1\omega_1 is the first uncountable ordinal, regarded as the set of all ordinals below the initial ordinal of ℵ1\aleph_1.✦ Let Γ=ω1\Gamma=\omega_1. The problem is to choose finite stages exhausting each initial segment, with compatibility at every coordinate retained at a stage.

Coherent Closure Families

Let Λ\Lambda be a well-ordered set with countable initial segments, and write Λ≤β={ξ∈Λ:ξ≤β}\Lambda_{\leq\beta}=\{\xi\in\Lambda:\xi\leq\beta\}. A coherent finite closure system CC on Λ\Lambda is a family of finite subsets Cβ(n)C_\beta(n) of Λ\Lambda, indexed by β∈Λ\beta\in\Lambda and the nonnegative integers n∈ℕ0n\in\mathbb N_0, satisfying (1): β∈Cβ(n)⊆Λ≤β,Cβ(n)⊆Cβ(n+1),⋃n∈ℕ0Cβ(n)=Λ≤β,Cα(n)=Cβ(n)∩Λ≤αwhenever α∈Cβ(n).\begin{gathered} \beta\in C_\beta(n)\subseteq\Lambda_{\leq\beta},\qquad C_\beta(n)\subseteq C_\beta(n+1),\\ \bigcup_{n\in\mathbb N_0}C_\beta(n)=\Lambda_{\leq\beta},\\ C_\alpha(n)=C_\beta(n)\cap\Lambda_{\leq\alpha} \quad\text{whenever }\alpha\in C_\beta(n). \end{gathered}(1)

A predecessor closure family GG at β∈Λ\beta\in\Lambda is a family of finite subsets Gα(n)G_\alpha(n) of Λ\Lambda, indexed by α<β\alpha<\beta and n∈ℕ0n\in\mathbb N_0.✦ The family GG is coherent below β\beta when it satisfies (1) at every endpoint α<β\alpha<\beta.✦

A coherent endpoint extension of GG at β\beta is an increasing sequence H(n)H(n) of finite subsets of Λ≤β\Lambda_{\leq\beta}, each containing β\beta, whose union is Λ≤β\Lambda_{\leq\beta} and whose compatibility with GG is given by (2): Gα(n)=H(n)∩Λ≤αfor α<β with α∈H(n).G_\alpha(n)=H(n)\cap\Lambda_{\leq\alpha} \quad\text{for }\alpha<\beta\text{ with }\alpha\in H(n).(2)✦

The endpoint closure construction NβN_\beta assigns to a predecessor closure family GG a sequence Nβ(G)(n)N_\beta(G)(n) of finite subsets of Λ\Lambda.✦ The chosen closure family SS on Λ\Lambda is the family of finite subsets Sβ(n)S_\beta(n) of Λ\Lambda, indexed by β∈Λ\beta\in\Lambda and n∈ℕ0n\in\mathbb N_0, defined by recursion along the well-order as in (3): Sβ(n)=Nβ((Sα)α<β)(n).S_\beta(n)=N_\beta\bigl((S_\alpha)_{\alpha<\beta}\bigr)(n).(3)✦

On Γ\Gamma, the positive-indexed closures Fβ(p)F_\beta(p) are the finite subsets specified by (4). Closure stages start at n=0n=0, whereas the positive-index convention starts at p=1p=1; the subtraction is truncated at zero. Fβ(p)=Sβ(max⁡{p−1,0})(β∈Γ,p∈ℕ0).F_\beta(p)=S_\beta\bigl(\max\{p-1,0\}\bigr) \qquad(\beta\in\Gamma,\ p\in\mathbb N_0).(4)✦

The Claim

Theorem 1. Let Λ\Lambda be a well-ordered set with countable initial segments. Then ∃CC is a coherent finite closure system on Λ.\exists\,C\quad C\text{ is a coherent finite closure system on }\Lambda.(5)✦ For the positive-indexed closures on Γ\Gamma, let β,γ,α∈Γ\beta,\gamma,\alpha\in\Gamma and p∈ℕ0p\in\mathbb N_0, and suppose that α∈Fβ(p)∩Fγ(p)\alpha\in F_\beta(p)\cap F_\gamma(p). Then Fβ(p)∩Γ≤α=Fγ(p)∩Γ≤α.F_\beta(p)\cap\Gamma_{\leq\alpha} =F_\gamma(p)\cap\Gamma_{\leq\alpha}.(6)✦

What Is Checked

Assertion (5) is stated over well-orders with countable initial segments, while (6) concerns the closure family (4) on Γ\Gamma.