Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Standard borel spaces have countable generating and measure determining algebras

Statement

Assume AC. Every standard-Borel space (E,S) has a countable algebra A which generates S, separates points, and determines finite measures: if finite measures μ,ν agree on A, then μ=ν. In particular it determines probability measures.

Facts & Assumptions

Given: AC and a standard-Borel space (E,S); in the determination assertion, two finite measures agreeing on the constructed algebra.

[F1]

There is a bimeasurable bijection f:EB with B[0,1] Borel. (Standard borel spaces admit bimeasurable real codings)

[F2]

The rational cuts can be enumerated. (Q is countably infinite)

[F3]

Rational right rays generate real Borel sets; their complementary closed left rays do also. (Seven generating families for the Borel sigma-algebra on the real line)

[F4]

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

[F5]

Countable choice selects from each nonempty set in a sequence. (The Axiom of Countable Choice (ACω))

[F6]

AC supplies that countable choice by restriction of a choice function. (The Axiom of Choice)

[F7]

A lambda-system containing a pi-system contains its generated sigma-algebra. (Dynkin's pi-lambda theorem)

[F8]

Rational cuts separate two distinct real numbers. (The rationals embed densely in the reals)

Proof

technique · direct
1.1

Fix f from [F1]. Enumerate the pullbacks Hq=f1[B(,q]] using [F2]. Let An be the Boolean algebra on the first n pullbacks, with A0={,E}. Its atoms are the at most 2n intersections obtained by taking each generator or its complement; every member is a union of atoms. Thus each An is finite, and A=nAn is an algebra: any two elements lie in a common An.

F1F2
2.1

AC implies [F5], so [F4] makes A countable. This is the exact countable-choice use for enumerating the finite algebras. The trace of the generators of [F3] generates B(B), so bimeasurability of f gives σ(A)=S. If xy, injectivity gives different codes; [F8] provides a rational between them, and its pullback contains exactly the lower-coded point.

step 1.1F1F3F4F5F6F8
3.1

For finite μ,ν agreeing on A, their total masses agree because EA. The equality class D={AS:μ(A)=ν(A)} contains E, is closed under complements by subtracting from the common finite total, and under countable disjoint unions by countable additivity. It is a lambda-system containing the pi-system A. By [F7], SD. This also covers zero total mass and E=; finiteness prevents subtraction of infinite totals.

step 1.1step 2.1F7

Source notes

Durrett Theorem 2.1.22 (printed pp.53–54) motivates real coding. The finite-algebra construction and finite-total lambda-system argument are derived here from the exact local countability and pi-lambda statements; arbitrary infinite measures are outside the claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

47 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