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.
Elementary sets: the finite unions of half-open boxes in
Definition
Fix . A subset is an elementary set when there are a natural number and a list of half-open boxes (Half-open boxes in and their volume), that is a function on whose values are half-open boxes, with
Write for the family of all elementary subsets of .
The list is part of the data of the presentation and not of the set: one elementary set has many presentations, and nothing below reads a presentation off a set. At the union is empty, so ; at every half-open box is elementary, included. The boxes of a presentation are not required to be disjoint or nonempty.
Remarks
-
Every elementary set does admit a disjoint presentation, by a common coordinate grid built from the parameters of the given list (Every elementary set is a finite disjoint union of half-open boxes, and any finitely many boxes admit a common grid refinement). That is a theorem about , not part of the definition, and keeping it out of the definition is what lets a presentation be produced by hand wherever one is convenient.
-
is an algebra and not merely a ring of sets (The elementary sets form an algebra of subsets of containing every half-open box), and that is exactly what the infinite parameters of Half-open boxes in and their volume buy: with real parameters only, every member of would be bounded and the family would not contain .
Depends on
Used by
- L(ℝⁿ) is exactly the completion of the restriction of λₙ to the Borel sets Corollary
- Lebesgue outer measure on ℝⁿ Definition
- Countable covers by closed boxes, by open boxes and by closed cubes all compute Lebesgue outer measure Lemma
- Every elementary set is a finite disjoint union of half-open boxes, and any finitely many boxes admit a common grid refinement Lemma
- Every elementary set is squeezed in volume between a compact subset and an elementary set whose interior contains it Lemma
- The sigma-algebra generated by the half-open boxes of ℝⁿ is the Borel sigma-algebra Lemma
- Elementary volume is finitely additive, monotone and finitely subadditive on the elementary algebra Proposition
- The elementary sets form an algebra of subsets of ℝⁿ containing every half-open box Proposition
- Assuming countable choice, every Borel subset of ℝⁿ is Lebesgue measurable Theorem
- Assuming countable choice, L(ℝⁿ) is a sigma-algebra containing every elementary set and λₙ is a complete measure extending elementary volume Theorem
- Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume Theorem
- Assuming countable choice, the Lebesgue outer measure of an arbitrary subset of ℝⁿ is the infimum of the measures of the open sets containing it Theorem
- Elementary volume is a sigma-finite premeasure on the algebra of elementary sets Theorem
- Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation Theorem
- The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition Theorem
Dependency tree · two levels
7 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
- E. A. Carlen, Notes on Lebesgue Measure on $\mathbb{R}^n$ and $S^{n-1}$ (Rutgers Math 501), Section 1 (standard reference, not scraped)
- T. Tao, An Introduction to Measure Theory (GSM 126), Section 1.1 (standard reference, not scraped)