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.
Half-open boxes in and their volume
Definition
Fix with and let be the set of functions , writing for ( as the set of functions , and , , are metrics on it). A parameter is a function , where carries the total order of The extended real line , its order, and the arithmetic that is left undefined. For a pair of parameters set
both comparisons taken in . A half-open box is a set of this form. For a single write for the constant parameter with value , and abbreviate ; thus and is the unit cube. At , and for real , the box is the half-open interval of Intervals of : the nine order-convex forms, nondegeneracy, and length.
A box is nonempty exactly when for every . If some then no real satisfies both and , by transitivity of the order, so . Conversely suppose for every . Then in each coordinate some real satisfies : if take , which is ; if then , so take when is real and when . Assembling one such in each coordinate gives a point of ; the assembly is a definition by cases on finitely many coordinates and selects nothing.
The parameters of a nonempty box are determined by the set. Let , fix and put . Then : the inclusion is the defining condition, and for take any and replace its -th coordinate by , which leaves every other defining inequality untouched. Now exactly when has no upper bound in , and otherwise is the greatest element of ; likewise exactly when has no lower bound in , and otherwise is the greatest lower bound of in . So determines and for every , and hence determines .
Volume. For a half-open box define by
- ;
- if , with its unique parameter pair , then when or for some , and when every and every is real.
The product is the finite product of Finite sums and finite products, by recursion. In the last clause every factor is a strictly positive real, since in , so the product is a strictly positive real (Laws of finite sums and finite products, claim 6) and in particular no factor is and no product of the form is ever formed. That is what the case split buys: a box with a degenerate side is empty, not a box of volume with an infinite side. So is a total function on the half-open boxes with values in , and , .
Agreement with the published rectangle volume. For real parameters with for every , the closed rectangle of Axis-parallel rectangles in and their volume has , which is the value assigned above to . The two notions of volume therefore agree wherever both are written, and no second notion of volume is introduced.
Remarks
-
Why the upper face and not the lower one. The published 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 already fixes this library's half-open box as , in its Statement. The choice is a convention, but having two conventions for one phrase is not, so the published one is kept.
-
Why the parameters are allowed to be infinite. With real parameters only, every finite union of half-open boxes is a bounded set, so would not be one and the family would be closed under difference but not under complement. Admitting and as parameters makes a box, and it is what makes The elementary sets form an algebra of subsets of containing every half-open box an algebra rather than a ring.
-
Half-open, and not closed, for a second reason. Two closed rectangles that share a face are not disjoint, so a decomposition of a rectangle into closed pieces is disjoint only up to boundaries. Half-open boxes tile exactly: the cells of a coordinate grid are pairwise disjoint with union the whole box (The volume of a half-open box is the sum of the volumes of the cells of any coordinate grid subdividing it), and no boundary bookkeeping is needed anywhere below.
Depends on
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Axis-parallel rectangles in $\mathbb{R}^m$ and their volume
- Finite sums and finite products, by recursion
- Laws of finite sums and finite products
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
Used by
- Dyadic cubes of generation k in ℝⁿ Definition
- Elementary sets: the finite unions of half-open boxes in ℝⁿ Definition
- A coordinate scaling and a coordinate transposition send the unit cube to a set of measure equal to the absolute value of the determinant Lemma
- A shear sends the unit cube to a set of Lebesgue measure one Lemma
- A translation-invariant Borel measure giving the unit cube measure one gives each generation-k dyadic cube measure 2⁻ᵏⁿ Lemma
- 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
- For a Lebesgue measurable set and every positive ε there is an open superset whose difference from it has outer measure below ε Lemma
- For each generation, the dyadic cubes of that generation are pairwise disjoint and cover ℝⁿ Lemma
- Half-open boxes are closed under intersection, and the complement of a half-open box is a finite disjoint union of half-open boxes Lemma
- The sigma-algebra generated by the half-open boxes of ℝⁿ is the Borel sigma-algebra Lemma
- The volume of a half-open box is the sum of the volumes of the cells of any coordinate grid subdividing it Lemma
- Two dyadic cubes are either disjoint or one contains the other Lemma
- A box with a degenerate side is Lebesgue null, and so is every coordinate hyperplane in ℝⁿ Proposition
- Lebesgue measure is sigma-finite, and every metrically bounded subset of ℝⁿ has finite outer measure Proposition
- The elementary sets form an algebra of subsets of ℝⁿ containing every half-open box Proposition
- A box in ℝⁿ with parameters aᵢ≤ bᵢ is Lebesgue measurable of measure ∏_i<n(bᵢ-aᵢ), whichever of its faces are included 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, the Lebesgue measure of a measurable set is the supremum of the measures of its compact subsets Theorem
- Elementary volume is a sigma-finite premeasure on the algebra of elementary sets Theorem
- Every open subset of ℝⁿ is the union of a countable pairwise disjoint family of dyadic cubes Theorem
- If a Lebesgue measurable subset of ℝⁿ has positive measure, its difference set contains an open ball about the origin 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
38 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)