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.
Countable discrete spaces are standard borel
Example
Every at most countable set with its full power-set sigma-algebra is standard Borel, including the empty set. For example has the discrete complete metric .
Facts & Assumptions
Given: An at most countable set S with its full power-set sigma-algebra.
A separable completely metrizable space is Polish. (Polish spaces are separable completely metrizable spaces)
A measurable space with a Polish presentation is standard Borel. (Standard Borel spaces)
Verification
On S define if and otherwise. Symmetry and separation are immediate, and if , at least one of or holds, giving . Balls of radius one half are singletons. Every Cauchy sequence is eventually constant, by applying the Cauchy condition with tolerance one half; hence d is complete. On N, for instance, and .
The countable set S itself is dense. Every subset is a union of singleton opens, so the Borel sigma-algebra is exactly its full power set. By [F1] S is Polish and the identity gives the presentation in [F2]. For empty S there are no Cauchy sequences, the empty metric is complete, and the empty set is a countable dense subset; for a singleton the only sequence is constant.
Source notes
Marker, Descriptive Set Theory, Example 1.2, printed p.2; Durrett Theorem 2.1.22, printed pp.53–54. The metric and its Cauchy property are explicitly evaluated here.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 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)