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.
Doob-Dynkin factorization through the sigma-algebra generated by a function
Statement
Assume (The Axiom of Countable Choice ()). Let and . Then is -measurable if and only if there is a Borel measurable function such that
Facts & Assumptions
Given: and functions and .
The sigma-algebra generated by is . (The sigma-algebra generated by a function)
Threshold measurability characterizes -valued measurability. (Threshold characterisations of real-valued and extended-real-valued measurability)
is countable ( is countably infinite), so The Axiom of Countable Choice () selects one Borel lift for each rational threshold in step 1.2.
Proof
If for Borel , then for each Borel , by [L1].
Conversely suppose is -measurable. For every rational , [L1] and [L2] say that the family of Borel with is nonempty. By [L3], is countable; apply the stated to choose one for every . Define . These sets are Borel and increasing in , and , including when takes an infinite value.
The family also satisfies . Indeed the right side expands to the intersection of all with rational ; every rational has a rational strictly between and , and every also has . Thus the two collections of have the same intersection.
For put in , with empty infimum . For rational , monotonicity and step 2.1 give : if the infimum is at most , some index below each belongs to the defining set, and conversely membership in every forces the infimum at most . The threshold criterion [L2] therefore makes Borel measurable.
For every and rational , steps 1.2 and 3.1 give exactly when . Rational thresholds distinguish all points of , including both infinities, hence . Together with step 1.1 this proves the equivalence.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
29 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
- Mathematics@CUHK, Martingale Theory I, Section 2.6 (standard reference, not scraped)