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.
Euclidean borel spaces are standard borel
Example
For each finite , is standard Borel. For use ; is a singleton.
Facts & Assumptions
Given: A finite integer and the Borel measurable space .
The maximum-coordinate formula is a metric for n>=1. ( as the set of functions , and , , are metrics on it)
Every real Cauchy sequence converges. (The reals are complete)
Q is countable. ( is countably infinite)
The product of two countable sets is countable without choice. (A product of two at most countable sets is at most countable)
Rational points approximate every real coordinate. (The rationals embed densely in the reals)
A separable space with a complete compatible metric is Polish. (Polish spaces are separable completely metrizable spaces)
The Borel space of a Polish space is standard Borel. (Standard Borel spaces)
Verification
For , [F1] supplies the metric. A d-infinity Cauchy sequence is Cauchy in each coordinate since . The coordinate limits exist by [F2]. For a fixed tolerance take the maximum of the finitely many coordinate convergence thresholds; beyond it all coordinate errors are below that tolerance, so the vectors converge in d-infinity. This metric induces the usual Euclidean topology: follows by bounding each squared coordinate by the maximum squared.
Induction using [F3]–[F4] makes countable. Given a vector x and positive epsilon, [F5] gives a rational in each of its finitely many coordinate intervals of radius epsilon; the resulting vector q satisfies . Hence Q to the nth power is dense. For instance in dimension two, .
Steps 1.1–1.2 and [F6] show R to the nth power is Polish. The identity is the presentation of [F7]. For n=0 there is just the empty tuple, with zero metric and itself as a finite dense set; it is complete and Polish. No maximum over an empty index set is used.
Source notes
Durrett Theorem 2.1.22, printed pp.53–54. The explicit complete Euclidean metric and rational density give the Polish presentation directly.
Depends on
- Standard Borel spaces
- Polish spaces are separable completely metrizable spaces
- The reals are complete
- $\mathbb{Q}$ is countably infinite
- The rationals embed densely in the reals
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
- A product of two at most countable sets is at most countable
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
56 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)