Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The fair-coin measure on Cantor space

Statement

In ZFC the Cantor space C=2N (Cantor sequence space, Cantor and Baire sequence spaces and coordinate codings) carries a probability measure μ on its Borel sigma-algebra B(C) (The Borel sigma-algebra of a topological space) such that

μ(Ns)=2−∣s∣for every finite binary word s,Ns:={x∈C:x↾∣s∣=s},

the construction using the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). The measure is the Carathéodory extension of the fair-coin content p0, which assigns to the cylinder prescribing the coordinates of a finite set F the value 2−∣F∣; it satisfies μ(C)=1, and it is multiplicative on cylinders with disjoint coordinate sets: if F,G⊆N are finite and disjoint, a∈2F and b∈2G, then μ([a]F∩[b]G)=2−∣F∣−∣G∣=μ([a]F)μ([b]G).

This is the fair-coin product measure on 2ω used by the master-code constructions below; the cylinders Ns are the basic clopen sets of the product topology of copies of the discrete two-point space (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space), and the identification of 2N with 2ω is the usual one, N=ω.

Facts & Assumptions

Given: ZFC, hence the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

[F1]

C=2N is a compact metric space with no isolated points whose topology consists of unions of the cylinders {x:x(i)=a(i) for all i∈F} over finite F⊆N and a∈2F; these cylinders form a base of clopen sets, and the metric is d(x,y)=2−m−1 for the first coordinate m at which x and y differ. (Cantor sequence space, Cantor and Baire sequence spaces and coordinate codings)

[F3]

An algebra of subsets of a set is closed under complements and finite unions; the sigma-algebra generated by a family is the smallest sigma-algebra containing it; the Borel sigma-algebra of a topological space is generated by its open sets, and for a product of discrete two-point spaces it is generated by the cylinders; in a topological space finite unions and finite intersections of closed sets are closed, a set is closed exactly when its complement is open, and a union of open sets is open. (Algebras of subsets, The sigma-algebra generated by a family of sets, The Borel sigma-algebra of a topological space, The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison)

[F4]

A premeasure on an algebra vanishes at ∅ and is countably additive on disjoint sequences whose union lies in the algebra; the outer set function induced by a premeasure is defined by covering costs; assuming the Axiom of Countable Choice the restriction of that outer set function to the generated sigma-algebra is a measure extending the premeasure. (Premeasures on algebras of sets, The outer set function induced by a premeasure, Assuming countable choice, a premeasure extends through its induced outer measure, Measures on sigma-algebras)

Proof

technique · direct
1.1

For finite F⊆N and a∈2F put [a]F:={x∈C:x(i)=a(i) for every i∈F}; each [a]F is open because the topology of C consists of unions of cylinders, and closed because C∖[a]F=⋃{[b]F:b∈2F, b≠a} is a finite union of cylinders and hence open; in particular [∅]∅=C. Consequently the family C0 of all finite unions of cylinders, the empty union included, contains ∅ and C and is closed under complements, and it is closed under finite intersections because [a]F∩[b]G=[a∪b]F∪G when a and b agree on F∩G and is ∅ otherwise; by de Morgan it is therefore an algebra of subsets of C.

F1F3
1.2

If F⊆G are finite and a∈2F, then the prescriptions b∈2G with b↾F=a are in bijection with the functions G∖F→2, so there are 2∣G∖F∣ of them, and [a]F is their pairwise disjoint union: a point of [a]F agrees with exactly one such b on G.

F1F2F3
2.1

The fair-coin content is well defined on C0. Let A∈C0 and let A=[a0]F0∪⋯∪[aℓ]Fℓ be a presentation; put G:=F0∪⋯∪Fℓ, a finite set. By step 1.2 each [ai]Fi is a disjoint union of cylinders [b]G, and these lie inside A; since the G-cylinders partition C, A is the disjoint union of the G-cylinders contained in it, and we let m(A,G) be their number and set p0(A):=m(A,G)⋅2−∣G∣. If G⊆H are finite, step 1.2 splits each G-cylinder into 2∣H∖G∣ many H-cylinders, so m(A,H)=m(A,G)⋅2∣H∖G∣ and m(A,H)2−∣H∣=m(A,G)2−∣G∣ because ∣H∣=∣G∣+∣H∖G∣ and 2−∣G∣−∣H∖G∣=2−∣G∣2−∣H∖G∣; two finite sets containing all Fi are compared through their union, which contains both, so the value does not depend on the presentation or on G.

step 1.2F2
3.1

From step 2.1, p0(∅)=0, p0(C)=1 and p0([a]F)=2−∣F∣; if A,B∈C0 are disjoint and G is finite and contains the supports of presentations of both, then the G-cylinders inside A∪B are exactly those inside A together with those inside B, because a G-cylinder meets the disjoint sets A and B in all of itself or in nothing, so m(A∪B,G)=m(A,G)+m(B,G) and p0(A∪B)=p0(A)+p0(B); hence p0 is monotone, and 0≤p0(A)≤1 for every A∈C0.

step 2.1F2
4.1

Let (Ak)k∈N be pairwise disjoint members of C0 whose union A lies in C0. For every m the set A0∪⋯∪Am is contained in A, so step 3.1 gives ∑k≤mp0(Ak)=p0(A0∪⋯∪Am)≤p0(A) and hence ∑k∈Np0(Ak)≤p0(A). Conversely A is a finite union of closed cylinders, hence closed by step 1.1 and [F3], so it is a compact subset of the compact space C; the Ak are open and cover A, so the finite-subcover property read in the ambient space through [F5] gives m with A⊆A0∪⋯∪Am, and then ∑k∈Np0(Ak)≥∑k≤mp0(Ak)=p0(A0∪⋯∪Am)≥p0(A) by step 3.1. Hence p0 is a premeasure on the algebra C0.

step 3.1step 1.1F1F3F4F5
5.1

Assume the Axiom of Countable Choice. By [F4] the outer set function μ∗ induced by the premeasure p0 has a restriction μ:=μ∗↾σ(C0) that is a measure on the sigma-algebra generated by the cylinders, and μ(A)=p0(A) for every A∈C0; in particular μ(C)=p0(C)=1, so μ is a probability measure.

step 4.1F4
6.1

The cylinders form a base of the topology of C and each is a union of open sets, so the sigma-algebra they generate is the Borel sigma-algebra: σ(C0)=B(C). Hence μ is a Borel probability measure and μ([a]F)=p0([a]F)=2−∣F∣ for every finite F and a∈2F; for a finite binary word s the cylinder Ns is [s]F with F={0,…,∣s∣−1}, so μ(Ns)=2−∣s∣.

step 5.1step 3.1F1F3
6.2

If F∩G=∅, a∈2F and b∈2G, then [a]F∩[b]G=[a∪b]F∪G by step 1.1, so μ([a]F∩[b]G)=2−∣F∪G∣=2−∣F∣−∣G∣=μ([a]F)μ([b]G), the middle equality using ∣F∪G∣=∣F∣+∣G∣ and the power laws.

step 5.1step 3.1F2
7.1

Steps 6.1 and 6.2 are the two claims: 2N carries the Borel probability measure μ with μ(Ns)=2−∣s∣, obtained as the Carathéodory extension of the fair-coin content, and μ is multiplicative on cylinders with disjoint coordinate sets. ∎

step 6.1step 6.2

Depends on

Used by

Dependency tree · two levels

87 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources