OctoInformBeta

OpenAI preprint, September 2026 · §3. An ultrafilter rank and simultaneous reservations

Lemma 3.3: In a rank model, largeness and rank survive changes by small sets; the ordinal rank is antitone modulo 𝒦\mathcal K on large sets

Small changes preserve largeness and rank.

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

In §3 of the counterexample, large sets carry an ordinal rank. The small sets are the members of an ideal 𝒦\mathcal K, the large sets are the members of an ultrafilter 𝒰\mathcal U disjoint from 𝒦\mathcal K, and each large set XX has a rank ρ(X)\rho(X), an ordinal below the continuum 𝔠\mathfrak c. Lemma 3.3 asks how much of a set the rank sees: whether altering a set by a small set can change its largeness or its rank, and how the ranks of two large sets compare when one lies inside the other modulo 𝒦\mathcal K.

The library states the lemma for an arbitrary ideal 𝒦\mathcal K on a set α\alpha and an ultrafilter 𝒰\mathcal U on α\alpha: once for the ordinal rank built from an enumeration of 𝒰\mathcal U, and once for a rank model, a triple of an ideal, an ultrafilter and a rank, which is the form in which 𝒰\mathcal U and ρ\rho enter §5 and §6.

Ideals, Ultrafilters and Ranks

An ideal 𝒦\mathcal K of subsets of a set α\alpha is a family of subsets of α\alpha that contains the empty set, is closed under taking subsets and under unions of two members, and does not contain α\alpha; its members are the small sets.✦ For an ideal 𝒦\mathcal K on α\alpha and subsets XX and YY of α\alpha, XX is contained in YY modulo 𝒦\mathcal K when the difference X\YX\setminus Y is small: X⊆𝒦Y⇔X\Y∈𝒦.X\subseteq_{\mathcal K}Y \iff X\setminus Y\in\mathcal K.(1)✦

A subset of α\alpha is large when it belongs to the ultrafilter 𝒰\mathcal U on α\alpha, and 𝒰\mathcal U is disjoint from 𝒦\mathcal K when no small set is large.

The continuum index set is the set of ordinals below 𝔠\mathfrak c, the continuum taken as its initial ordinal✦; it has cardinality 𝔠\mathfrak c, and a bijection of it onto the set {0,1}ℕ\{0,1\}^{\mathbb N} of binary sequences is fixed once and for all✦. Let (Fξ)ξ<𝔠(F_\xi)_{\xi<\mathfrak c} be a family of subsets of α\alpha indexed by the ordinals below 𝔠\mathfrak c that enumerates 𝒰\mathcal U, that is, whose members are exactly the large sets. The ordinal rank ρ(X)\rho(X) of a large set XX, relative to 𝒦\mathcal K and this family, is the least index ξ\xi such that FξF_\xi is contained in XX modulo 𝒦\mathcal K: ρ(X)=min⁡{ξ<𝔠:Fξ⊆𝒦X}.\rho(X)=\min\{\,\xi<\mathfrak c : F_\xi\subseteq_{\mathcal K}X\,\}.(2)✦

A rank model on a set α\alpha is a triple (𝒦,𝒰,ρ)(\mathcal K,\mathcal U,\rho) of an ideal 𝒦\mathcal K of subsets of α\alpha, an ultrafilter 𝒰\mathcal U on α\alpha disjoint from 𝒦\mathcal K, and a rank ρ\rho assigning to every subset of α\alpha an ordinal below 𝔠\mathfrak c, such that ρ\rho is antitone modulo 𝒦\mathcal K on large sets and admits rank-raising thinning.✦ The first condition means that ρ(Y)≤ρ(X)\rho(Y)\le\rho(X) whenever XX and YY are large and X⊆𝒦YX\subseteq_{\mathcal K}Y. The second means that if XX is large and ss is a subset of XX that is not large, then for every γ<𝔠\gamma<\mathfrak c there is a large set uu with s⊆u⊆Xandρ(u)>γ.s\subseteq u\subseteq X \quad\text{and}\quad \rho(u)>\gamma.(3)

The Claim

Theorem 1. Let 𝒦\mathcal K be an ideal of subsets of a set α\alpha, let 𝒰\mathcal U be an ultrafilter on α\alpha, and let XX and YY be subsets of α\alpha.

  1. If 𝒰\mathcal U is disjoint from 𝒦\mathcal K and X△Y∈𝒦X\mathbin{\triangle}Y\in\mathcal K, then X∈𝒰⇔Y∈𝒰.X\in\mathcal U \iff Y\in\mathcal U.(4)✦

  2. If ρ\rho is the ordinal rank relative to 𝒦\mathcal K and an enumeration (Fξ)ξ<𝔠(F_\xi)_{\xi<\mathfrak c} of 𝒰\mathcal U, and XX and YY are large with X⊆𝒦YX\subseteq_{\mathcal K}Y, then ρ(Y)≤ρ(X).\rho(Y)\le\rho(X).(5)✦

  3. If (𝒦,𝒰,ρ)(\mathcal K,\mathcal U,\rho) is a rank model and X△Y∈𝒦X\mathbin{\triangle}Y\in\mathcal K, then X∈𝒰⇔Y∈𝒰,andρ(X)=ρ(Y) when X∈𝒰.X\in\mathcal U \iff Y\in\mathcal U, \qquad\text{and}\qquad \rho(X)=\rho(Y) \ \text{ when } X\in\mathcal U.(6)✦

In the paper, the result reads: if X△Y∈𝒦X\mathbin{\triangle}Y\in\mathcal K, then XX is large if and only if YY is large, and then ρ(X)=ρ(Y)\rho(X)=\rho(Y); if XX and YY are large and X⊆𝒦YX\subseteq_{\mathcal K}Y, then ρ(X)≥ρ(Y)\rho(X)\ge\rho(Y).

The lemma’s first half is (4), together with (6) for the rank of any rank model, and its second half is (5), for the ordinal rank.

What Is Checked

The claim is stated over an ideal 𝒦\mathcal K of subsets of a set α\alpha with the relation ⊆𝒦\subseteq_{\mathcal K} of (1), an ultrafilter 𝒰\mathcal U on α\alpha, the ordinal rank (2) of an enumeration of 𝒰\mathcal U indexed by the ordinals below 𝔠\mathfrak c, and rank models.

The library proves that the least index in (2) exists: for every large set XX, the set of indices ξ\xi with Fξ⊆𝒦XF_\xi\subseteq_{\mathcal K}X is nonempty.✦