OpenAI preprint, September 2026 · §2. Countable diagrams and their tests
Colors S = 2^ω/=*:The palette
of all colors has exactly
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 , and Cantor space is the set of all binary sequences.✦ The colors are classes of binary sequences under a coarser equality than identity, and the palette is the set of them; the library defines both and counts .
The Claim
Definition 1. Two binary sequences are equal modulo finite, written , when they differ at only finitely many places: (1)✦A color is an equivalence class of ✦, and the color of a sequence is the class that contains it: (2)✦The palette is the set of all colors, the quotient of by :(3)✦With no hypothesis on the size of the continuum, there are exactly colors: (4)✦
In the paper, the result reads: the palette is , the binary sequences modulo equality outside a finite set.
What Is Checked
The definitions and the count (4) are stated over Cantor space and the relation of (1). The library proves that is an equivalence relation on .✦