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 has a countable algebra which generates , separates points, and determines finite measures: if finite measures agree on , then . In particular it determines probability measures.
Facts & Assumptions
Given: AC and a standard-Borel space ; in the determination assertion, two finite measures agreeing on the constructed algebra.
There is a bimeasurable bijection with Borel. (Standard borel spaces admit bimeasurable real codings)
The rational cuts can be enumerated. ( is countably infinite)
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)
Under countable choice a countable union of finite sets is countable. (Countable unions of at most countable sets, assuming )
Countable choice selects from each nonempty set in a sequence. (The Axiom of Countable Choice ())
AC supplies that countable choice by restriction of a choice function. (The Axiom of Choice)
A lambda-system containing a pi-system contains its generated sigma-algebra. (Dynkin's pi-lambda theorem)
Rational cuts separate two distinct real numbers. (The rationals embed densely in the reals)
Proof
Fix from [F1]. Enumerate the pullbacks using [F2]. Let be the Boolean algebra on the first pullbacks, with . Its atoms are the at most intersections obtained by taking each generator or its complement; every member is a union of atoms. Thus each is finite, and is an algebra: any two elements lie in a common .
AC implies [F5], so [F4] makes countable. This is the exact countable-choice use for enumerating the finite algebras. The trace of the generators of [F3] generates , so bimeasurability of gives . If , injectivity gives different codes; [F8] provides a rational between them, and its pullback contains exactly the lower-coded point.
For finite agreeing on , their total masses agree because . The equality class contains , 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 . By [F7], . This also covers zero total mass and ; finiteness prevents subtraction of infinite totals.
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
- Standard borel spaces admit bimeasurable real codings
- Dynkin's pi-lambda theorem
- Seven generating families for the Borel sigma-algebra on the real line
- The Axiom of Choice
- $\mathbb{Q}$ is countably infinite
- Countable unions of at most countable sets, assuming $\mathrm{AC}_\omega$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The rationals embed densely in the reals
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
- Durrett, Probability: Theory and Examples, 5th ed. (standard reference, not scraped)