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.
The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}
Statement
Let . Under the identification one has
Facts & Assumptions
Given: Positive integers and the identification .
The Borel sigma-algebra on a topological space is the sigma-algebra generated by its open sets. (The Borel sigma-algebra of a topological space)
Continuous maps pull Borel sets back to Borel sets. (A continuous map has Borel preimages of Borel sets)
The coordinate projections and are continuous.
Every open set in is a countable union of open rectangles with and open.
Proof
If and are Borel, then so [L2] makes Borel in . Therefore every measurable rectangle for belongs to , and hence
By [A2], every open set in is a countable union of open rectangles, hence belongs to . Since [L1] says a Borel sigma-algebra is generated by the open sets, this gives the reverse inclusion. Combining with step 1.1 proves the equality.
Depends on
- The Borel sigma-algebra of a topological space
- For n at least one, open sets, closed sets, compact sets, open balls, boxes, rational open boxes, and rational half-open boxes generate the Borel sigma-algebra on R^n
- Second countability: an at most countable basis for the topology
- Second countability is hereditary
- Assuming countable choice, a countable product of second countable spaces is second countable
- A continuous map has Borel preimages of Borel sets
Used by
Dependency tree · two levels
25 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
- John K. Hunter, Measure Theory, Proposition 5.3 (standard reference, not scraped)