OctoInformBeta

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

Ideals, βŠ†_𝒦, and the larger ideals 𝒦 and 𝒦_0: The ideal 𝒦\mathcal K on the countable set DD contains the density-zero ideal π’₯\mathcal J and leaves every signed pattern of GG-columns with disjoint taken and complemented sets positive

A proper ideal containing the complement of every AA-column.

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 question is how far the density-zero ideal π’₯\mathcal J on the countable set DD of Boolean functions can be enlarged against continuum many subsets of DD, the columns AtA_t and GtG_t, one pair for each ordinal tt below the continuum 𝔠\mathfrak c. The enlarged ideal is then carried to the ground set E0=LβŠ”RE_0 = L \sqcup R, made of two copies LL and RR of DD, one copy at a time.

Density, Columns and Slices

A point of DD is a pair (m,f)(m, f) of a natural number mm and a Boolean function f:{0,1}mβ†’{0,1}f \colon \{0,1\}^m \to \{0,1\} of mm variables.✦ The block Dm={m}Γ—{0,1}{0,1}mD_m = \{m\} \times \{0,1\}^{\{0,1\}^m} of DD holds the wm=22mw_m = 2^{2^m} functions of mm variables.✦ For a finite set BB, the density of a set XX in BB is |X∩B|/|B||X \cap B| / |B|.✦ The density-zero ideal π’₯\mathcal J on DD is the family of subsets of DD whose density in the blocks DmD_m tends to zero: X∈π’₯⇔limmβ†’βˆž|X∩Dm|wm=0.X \in \mathcal J \iff \lim_{m \to \infty} \frac{|X \cap D_m|}{w_m} = 0.(1)✦

Fix a bijection t↦βtt \mapsto \beta_t from the ordinals below 𝔠\mathfrak c onto the binary sequences β„•β†’{0,1}\mathbb N \to \{0,1\}.✦ The column C(s)C(s) of a binary sequence ss is the set of points (m,f)(m, f) of DD at which ff takes the value 11 on the first mm terms of ss: C(s)={(m,f)∈D:f(s(0),…,s(mβˆ’1))=1}.C(s) = \{(m, f) \in D : f(s(0), \dots, s(m-1)) = 1\}.(2)✦ For an ordinal tt below 𝔠\mathfrak c, the AA-column AtA_t and the GG-column GtG_t are the columns of the sequence Ξ²t\beta_t prefixed by 1,01, 0 and by 0,00, 0: At=C(10Ξ²t),Gt=C(00Ξ²t),A_t = C(1\,0\,\beta_t), \qquad G_t = C(0\,0\,\beta_t),(3) where abΞ²a\,b\,\beta is the sequence a,b,Ξ²(0),Ξ²(1),…a, b, \beta(0), \beta(1), \dots.

For finite sets PP and NN of ordinals below 𝔠\mathfrak c, the signed pattern GP,NG_{P,N} of GG-columns is the set of points of DD that lie in GtG_t for every t∈Pt \in P and outside GtG_t for every t∈Nt \in N: GP,N={x∈D:x∈Gt for t∈P,xβˆ‰Gt for t∈N}.G_{P,N} = \{x \in D : x \in G_t \text{ for } t \in P,\ x \notin G_t \text{ for } t \in N\}.(4)✦

Write E0=DΓ—{false,true}E_0 = D \times \{\mathrm{false}, \mathrm{true}\}, with LL the copy of DD at false and RR the copy at true.✦ The left slice XLX_L of a subset XX of E0E_0 is the subset {d∈D:(d,false)∈X}\{d \in D : (d, \mathrm{false}) \in X\} of DD, and its right slice XRX_R is {d∈D:(d,true)∈X}\{d \in D : (d, \mathrm{true}) \in X\}.✦

The Claim

Definition 1. An ideal on a set SS is a family ℐ\mathcal I of subsets of SS that contains the empty set, is closed under subsets and under finite unions, and does not contain SS: βˆ…βˆˆβ„,XβŠ†Yβˆˆβ„β‡’Xβˆˆβ„,X,Yβˆˆβ„β‡’XβˆͺYβˆˆβ„,Sβˆ‰β„.\emptyset \in \mathcal I, \qquad X \subseteq Y \in \mathcal I \Rightarrow X \in \mathcal I, \qquad X, Y \in \mathcal I \Rightarrow X \cup Y \in \mathcal I, \qquad S \notin \mathcal I.(5)✦ For an ideal ℐ\mathcal I on SS, containment modulo ℐ\mathcal I is the relation βŠ†β„\subseteq_{\mathcal I} between subsets XX and YY of SS given by XβŠ†β„Y⇔X\Yβˆˆβ„.X \subseteq_{\mathcal I} Y \iff X \setminus Y \in \mathcal I.(6)✦ For a finite set FF of ordinals below 𝔠\mathfrak c, the meet AFA_F of the AA-columns over FF is the subset of DD AF={x∈D:x∈At for every t∈F}.A_F = \{x \in D : x \in A_t \text{ for every } t \in F\}.(7)✦ The family 𝒦\mathcal K consists of the subsets XX of DD whose intersection with some finite meet of AA-columns lies in π’₯\mathcal J: Xβˆˆπ’¦β‡”X∩AF∈π’₯ for some finite set F of ordinals below 𝔠.X \in \mathcal K \iff X \cap A_F \in \mathcal J \text{ for some finite set } F \text{ of ordinals below } \mathfrak c.(8)✦ The family 𝒦0\mathcal K_0 consists of the subsets XX of E0E_0 with both slices in 𝒦\mathcal K: Xβˆˆπ’¦0⇔XLβˆˆπ’¦ and XRβˆˆπ’¦.X \in \mathcal K_0 \iff X_L \in \mathcal K \text{ and } X_R \in \mathcal K.(9)✦

Theorem 1. The family 𝒦\mathcal K is an ideal on DD✦; in particular, Dβˆ‰π’¦.D \notin \mathcal K.(10)✦ It contains the density-zero ideal and the complement of every AA-column: π’₯βŠ†π’¦,\mathcal J \subseteq \mathcal K,(11)✦ D\Atβˆˆπ’¦for every ordinal t<𝔠.D \setminus A_t \in \mathcal K \quad \text{for every ordinal } t < \mathfrak c.(12)✦ For disjoint finite sets PP and NN of ordinals below 𝔠\mathfrak c, the signed pattern GP,NG_{P,N} is positive for 𝒦\mathcal K, that is, it is not in 𝒦\mathcal K: GP,Nβˆ‰π’¦.G_{P,N} \notin \mathcal K.(13)✦

In the paper, the result reads: an ideal is closed under subsets and finite unions, XβŠ†π’¦YX \subseteq_{\mathcal K} Y means X\Yβˆˆπ’¦X \setminus Y \in \mathcal K, by (3.2) 𝒦\mathcal K is the family of sets XX with Xβˆ©β‹‚t∈FAt∈π’₯X \cap \bigcap_{t \in F} A_t \in \mathcal J for some finite FF, 𝒦0\mathcal K_0 is the family of subsets of E0E_0 with both slices in 𝒦\mathcal K, and 𝒦\mathcal K is proper and contains π’₯\mathcal J and every complement Atc=D\AtA_t^c = D \setminus A_t, while every consistent pattern of positive AA-columns and signed GG-columns is 𝒦\mathcal K-positive. A pattern is consistent when no column is both taken and complemented.

What Is Checked

The claim is stated over ideals of subsets as in (5), the density-zero ideal π’₯\mathcal J of (1), the columns AtA_t and GtG_t of (3), built from the fixed bijection t↦βtt \mapsto \beta_t and the columns (2) of binary sequences, the signed patterns of (4) and the slices of subsets of E0E_0.