OctoInformBeta

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

Lemma 3.4: Rank above any Ξ³<𝔠\gamma<\mathfrak c, containing any given small subset; fewer than 𝔠\mathfrak c finite sets of indices miss an index

Large sets have large subsets of arbitrarily high ordinal 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

The counterexample to the packing/covering conjecture is built on the countable set DD of pairs (m,f)(m,f) with f:{0,1}mβ†’{0,1}f:\{0,1\}^m\to\{0,1\}, with an ideal 𝒦\mathcal K and an ultrafilter 𝒰\mathcal U on DD, and gives each member of 𝒰\mathcal U an ordinal rank below the continuum 𝔠\mathfrak c. Given a set XX in 𝒰\mathcal U and a subset ss of XX outside 𝒰\mathcal U, the question is how high the rank of a set of 𝒰\mathcal U lying between ss and XX can be pushed. A second question concerns the ordinals below 𝔠\mathfrak c alone: whether fewer than 𝔠\mathfrak c finite sets of such ordinals can cover all of them. The library asks the first question over an arbitrary set Ξ±\alpha in place of DD.

Ideals, Ultrafilters and the Ordinal Rank

The index set is the set of ordinals below 𝔠\mathfrak c, the continuum taken as its initial ordinal, well ordered by size.✦ It has cardinality 𝔠\mathfrak c, and its elements, the indices, are written ii, tt, Ξ³\gamma. A bijection of the index set onto the set {0,1}β„•\{0,1\}^{\mathbb N} of infinite binary sequences is fixed once and for all.✦

An ideal 𝒦\mathcal K on a set Ξ±\alpha is a family of subsets of Ξ±\alpha that contains the empty set, is closed under subsets and under unions of two members, and does not contain Ξ±\alpha.✦ For subsets XX and YY of Ξ±\alpha, XX is contained in YY modulo 𝒦\mathcal K, written XβŠ†π’¦YX\subseteq_{\mathcal K}Y, when the part of XX outside YY lies in 𝒦\mathcal K: XβŠ†π’¦Y⇔X\Yβˆˆπ’¦.X\subseteq_{\mathcal K}Y\iff X\setminus Y\in\mathcal K.(1)✦

Let 𝒰\mathcal U be an ultrafilter on Ξ±\alpha; a subset of Ξ±\alpha is large when it belongs to 𝒰\mathcal U and small when it does not. Fix a family (Fi)i<𝔠(F_i)_{i<\mathfrak c} of subsets of Ξ±\alpha, indexed by the ordinals below 𝔠\mathfrak c, that enumerates 𝒰\mathcal U. The ordinal rank ρ(X)\rho(X) of a large subset XX of Ξ±\alpha, relative to 𝒦\mathcal K and this family, is the least index ii such that FiF_i is contained in XX modulo 𝒦\mathcal K: ρ(X)=min⁡{i<𝔠:FiβŠ†π’¦X}.\rho(X)=\min\{\,i<\mathfrak c : F_i\subseteq_{\mathcal K}X\,\}.(2)✦

The Claim

Theorem 1.

  1. (Rank-raising thinning.) Let 𝒦\mathcal K be an ideal and 𝒰\mathcal U an ultrafilter on a set Ξ±\alpha, let (Fi)i<𝔠(F_i)_{i<\mathfrak c} enumerate 𝒰\mathcal U, and let ρ\rho be the ordinal rank (2). If XX is large and sβŠ†Xs\subseteq X is small, then for every Ξ³<𝔠\gamma<\mathfrak c there is a large set uu with sβŠ†uβŠ†Xandρ(u)>Ξ³.s\subseteq u\subseteq X\qquad\text{and}\qquad \rho(u)>\gamma.(3)✦

  2. Let (Aj)j∈J(A_j)_{j\in J} be a family of fewer than 𝔠\mathfrak c finite sets of indices below 𝔠\mathfrak c. Then there is an index t<𝔠t<\mathfrak c with tβˆ‰β‹ƒj∈JAj.t\notin\bigcup_{j\in J}A_j.(4)✦

In the paper, the result reads: if sβŠ†XβŠ†Ds\subseteq X\subseteq D with ss small and XX large, and Ξ³<𝔠\gamma<\mathfrak c, then there is a large uu with sβŠ†uβŠ†Xs\subseteq u\subseteq X and ρ(u)>Ξ³\rho(u)>\gamma.

What Is Checked

The claim is stated over an ideal 𝒦\mathcal K and an ultrafilter 𝒰\mathcal U on a set Ξ±\alpha, a family (Fi)i<𝔠(F_i)_{i<\mathfrak c} enumerating 𝒰\mathcal U, containment modulo 𝒦\mathcal K (1), the ordinal rank ρ\rho (2), and finite sets of ordinals below 𝔠\mathfrak c.

Of these constructions, the library proves that for every large set XX the set of indices over which (2) takes its minimum is nonempty.✦