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.
Fair-coin cylinder content is a premeasure
Statement
The fair-coin content on the cylinder algebra is a finite premeasure, with . This assertion is choice-free.
Facts & Assumptions
Common refinement proves finite additivity and total mass one. Binary-sequence cylinders and fair-coin content.
Omega is compact and cylinders are clopen. Binary-sequence space is compact without Tychonoff.
Only disjoint countable unions remaining in the algebra must be additive. Premeasures on algebras of sets.
Proof
Given: The fair-coin content on the cylinder algebra is a finite premeasure, with . This assertion is choice-free.
Let with disjoint and . All these sets are clopen, being finite unions of clopen cylinders. The family consisting of and all A_n is an open cover of Omega. Compactness gives finitely many members covering Omega and hence finitely many A_n covering A. Using their least indices if the same member repeats gives a finite index set F with . This uses ambient compactness only of Omega itself, not an unstated compact-subset criterion.
For every n outside F, disjointness gives . Thus all other terms have zero content, and finite additivity gives . If A is empty every A_n is empty and the same identity is zero equals zero. Along with and , this is precisely a finite premeasure.
Depends on
Used by
Dependency tree · two levels
7 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
- E–W Examples 2.8–2.9; local compactness construction (standard reference, not scraped)