Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06
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 countable-product cylinder premeasure is countably additive

Statement

Assume countable choice and dependent choice. For a countable sequence of probability spaces and its finite-product cylinder law μ0, μ0 is a premeasure on the cylinder algebra.

Facts & Assumptions

Given: Countable choice, dependent choice, a countable sequence of probability spaces, its cylinder algebra, and the finitely additive law μ0.

[F1]

The finite-coordinate product law is a probability measure and has the rectangle formula. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)

[F2]

For product-measurable A in two sigma-finite factors, each section is measurable, its section-measure function is measurable, and the product mass is the integral of that function. (For sigma-finite measures, the section-measure functions are measurable, The product measure of two sigma-finite measure spaces)

[F3]

A decreasing sequence of measurable sets with finite first measure has measure converging to that of its intersection. (Continuity from above when one set has finite measure)

[F4]

Countable choice supplies a point of the product of the nonempty coordinate spaces. (The Axiom of Countable Choice (ACω))

[F5]

Under countable choice, a countable union of finite coordinate supports is countable. (Countable unions of at most countable sets, assuming ACω)

[F6]

Dependent choice licenses a recursively constructed sequence when the admissible next coordinate depends on the prefix already chosen. (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain)

Proof

1.1

Every coordinate space is nonempty because it carries a probability measure. By [F4], the coordinate product is therefore nonempty, so the finitely additive cylinder law is well-defined. Let Cn be cylinders and suppose that μ0(Cn)η>0 for every n. By [F5], enumerate the countable union of their finite supports. After enlarging supports, take Cn to be determined by the first kn active coordinates, with (kn) nondecreasing. Recursively regarding each finite product as a two-factor product, [F2] expresses each cylinder mass as the integral of its measurable next-coordinate section-mass function.

F1F2F4F5
2.1

The finite-stage section argument recursively maintains the following invariant after m coordinates have been chosen: every remaining Cn-section has tail-cylinder mass at least η/2m. For a prefix with this invariant, let Dn be the measurable set of possible next coordinates whose further section has mass at least η/2m+1. The Dn decrease with n. The section formula and the bound by 1 give the next-coordinate measure of Dn at least η/2m+1; [F3] therefore makes nDn nonempty. Every choice from this intersection extends the prefix and preserves the invariant.

F2F3step 1.1
3.1

By [F6], make the recursively compatible selections from step 2.1. For each n, once the first kn active coordinates have been selected, they lie in the finite base of Cn because its remaining section has positive mass. Fill any inactive coordinates with the product point supplied by [F4]. The resulting point lies in every Cn, contradicting nCn=. Thus μ0(Cn)0.

F4F6step 2.1
4.1

Finite additivity plus continuity at the empty set gives countable additivity whenever a disjoint union remains a cylinder: apply it to the decreasing remainders. Hence μ0 is a premeasure.

step 3.1

Depends on

Used by

Dependency tree · two levels

35 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