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.
Every elementary set is squeezed in volume between a compact subset and an elementary set whose interior contains it
Statement
Let , let be elementary volume on the elementary sets (The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition, Elementary sets: the finite unions of half-open boxes in ), and for and a real put
the translates being those of Translation of a subset of . Then:
- is an elementary set, it is determined by and alone, it contains , and every point of is an interior point of in (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, as the set of functions , and , , are metrics on it).
- For every real there is with .
- If , then for every real there are an elementary set and a compact set (Open cover, subcover, compact metric space, and compact subset of a metric space) with and .
Nothing in claim 1 or claim 2 depends on a presentation of , so the assignment and the least satisfying claim 2 are both functions of the data and involve no selection.
Facts & Assumptions
Given: A natural number , an elementary set , and a real . A presentation of is written with pairwise disjoint half-open boxes, and when these are real.
; a box is nonempty exactly when for every ; ; and for a nonempty box when or for some , and when every and every is real (Half-open boxes in and their volume).
Every elementary set is the union of a finite list of pairwise disjoint half-open boxes, and a subset is an elementary set when there are a natural number and a list of half-open boxes with (Every elementary set is a finite disjoint union of half-open boxes, and any finitely many boxes admit a common grid refinement, Elementary sets: the finite unions of half-open boxes in ).
For every , there is exactly one function whose value at is the sum of the volumes of the members of any presentation of by a finite list of pairwise disjoint half-open boxes (The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition).
Elementary volume is finitely additive on pairwise disjoint elementary sets, monotone, and finitely subadditive (Elementary volume is finitely additive, monotone and finitely subadditive on the elementary algebra).
The translate of by is (Translation of a subset of ).
and are metrics on for ( as the set of functions , and , , are metrics on it).
is an interior point of if for some , where , and a subset is open in if every has such a ball inside (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, Open ball, closed ball and sphere in a metric space, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).
For reals the box is a compact subset of , and a subset is compact if and only if is closed in and bounded (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, claims 1 and 2; Axis-parallel rectangles in and their volume).
A compact subset of a metric space is closed and bounded (A compact subset of a metric space is closed and bounded).
If and are open, then is open (Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, claim 3).
is bounded if or there are and a real with (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).
For every real there is a natural number with (For every in a complete ordered field there is a natural with ).
For sequences of reals, ; ; if whenever then ; and (Laws of finite sums and finite products, claims 1, 2, 4 and 6).
Finite sums and finite products of a sequence of reals are defined by the recursions , and , (Finite sums and finite products, by recursion).
For , when and , or and ; and when and , or and (The extended real line , its order, and the arithmetic that is left undefined).
Proof
For a natural number , reals and a real with for every , one has : at both products are the empty product and both sides are , and passing from to uses together with and , so the estimate follows by induction on .
For a box and one has , where is the parameter , and the two boxes have the same volume; consequently, for a real , when and , and for any presentation of , so is elementary while its definition mentions no presentation.
For and one has .
If then every nonempty box of a disjoint presentation of has all parameters real, since an infinite parameter would make its volume, and hence the sum, equal to . Put and when every box is empty. Then is a real number and every endpoint of every nonempty box has modulus at most . Every point of a nonempty box therefore has every coordinate bounded by , hence has Euclidean norm at most ; thus every box lies in the ball about the origin of radius . Therefore is bounded and so is every subset of .
For claim 1, taking gives ; and if and then satisfies for every by step 1.3, so , whence the ball of lies in and is an interior point of it.
For claim 2, if the inequality holds with ; otherwise fix a disjoint presentation, let be a real with for every nonempty and every , and let : finite subadditivity and step 1.2 give , an empty contributing and a nonempty one contributing , so step 1.1 applied with and bounds each term by and hence .
For claim 3, assume , fix a disjoint presentation with all parameters of the nonempty real by step 1.4, and define for nonempty and for empty . Let be as in step 2.2, let , and put for nonempty and otherwise, and : then , each listed closed rectangle is compact and hence closed, a finite union of closed sets is closed by complementation, is bounded because , so is compact; and in both the empty and the nonempty case, so step 1.1 applied with and , whose difference is at most , gives .
Given a real , apply [F9] to the positive real to obtain with , and put , so that satisfies and ; steps 2.2 and 3.1 then give claims 2 and 3, and step 2.1 gives claim 1.
Depends on
- Elementary sets: the finite unions of half-open boxes in $\mathbb{R}^n$
- Half-open boxes in $\mathbb{R}^n$ and their volume
- The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition
- Elementary volume is finitely additive, monotone and finitely subadditive on the elementary algebra
- Every elementary set is a finite disjoint union of half-open boxes, and any finitely many boxes admit a common grid refinement
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- Open ball, closed ball and sphere in a metric space
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- A compact subset of a metric space is closed and bounded
- Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
- The $p$-norms $\lVert x\rVert_p$ for rational $p \ge 1$, and $\lVert x\rVert_\infty$
- Each $\lVert\cdot\rVert_p$ is a norm on $\mathbb{R}^n$, and the induced metrics are exactly $d_1$, $d_2$ and $d_\infty$ of the published metric-spaces page
- The finite and reverse triangle inequalities for a norm; and for $n \ge 1$ every norm $N$ on $\mathbb{R}^n$ satisfies $N(x) \le C\lVert x\rVert_1$ and is Lipschitz, hence continuous, for $d_2$
- Translation of a subset of $\mathbb{R}^n$
- Axis-parallel rectangles in $\mathbb{R}^m$ and their volume
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Laws of finite sums and finite products
- Finite sums and finite products, by recursion
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
Used by
Dependency tree · two levels
93 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)
- John K. Hunter, Measure Theory (UC Davis lecture notes), Chapter 2 (standard reference, not scraped)