OctoInformBeta

OpenAI preprint, September 2026 · §2. Countable diagrams and their tests

Colors S = 2^ω/=*: The palette S=2ω/=*S = 2^\omega/{=^*} of all colors has exactly 2ℵ02^{\aleph_0} elements, with no hypothesis on the continuum

Colors are binary sequences up to finitely many changes.

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 binary sequence is a map a:ℕ→{0,1}a \colon \mathbb{N} \to \{0, 1\}, and Cantor space 2ω2^\omega is the set of all binary sequences.✦ The colors are classes of binary sequences under a coarser equality than identity, and the palette SS is the set of them; the library defines both and counts SS.

The Claim

Definition 1. Two binary sequences a,b∈2ωa, b \in 2^\omega are equal modulo finite, written a=*ba =^* b, when they differ at only finitely many places: a=*b⇔{n∈ℕ:a(n)≠b(n)} is finite.a =^* b \iff \{\, n \in \mathbb{N} : a(n) \neq b(n) \,\} \text{ is finite.}(1)✦ A color is an equivalence class of =*=^*✦, and the color of a sequence a∈2ωa \in 2^\omega is the class that contains it: [a]={b∈2ω:b=*a}.[a] = \{\, b \in 2^\omega : b =^* a \,\}.(2)✦ The palette SS is the set of all colors, the quotient of 2ω2^\omega by =*=^*: S=2ω/=*={[a]:a∈2ω}.S = 2^\omega/{=^*} = \{\, [a] : a \in 2^\omega \,\}.(3)✦ With no hypothesis on the size of the continuum, there are exactly 2ℵ02^{\aleph_0} colors: |2ω/=*|=2ℵ0.\bigl|\, 2^\omega/{=^*} \,\bigr| = 2^{\aleph_0}.(4)✦

In the paper, the result reads: the palette is S=2ω/=*S = 2^\omega/{=^*}, the binary sequences modulo equality outside a finite set.

What Is Checked

The definitions and the count (4) are stated over Cantor space 2ω2^\omega and the relation =*=^* of (1). The library proves that =*=^* is an equivalence relation on 2ω2^\omega.✦