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.
A Nonempty Euclidean Open Set Is Not Null
Statement
For every integer , every nonempty open subset is not null in the closed-cube-cover sense of Measure zero and content zero in by countable and finite cube covers. The proof uses no choice principle.
Facts & Assumptions
Given: An integer and a nonempty Euclidean open set .
A set is null when, for every , a sequence of closed cubes covers it with total volume at most ; nullity passes to subsets (Measure zero and content zero in by countable and finite cube covers).
Every closed Euclidean box is compact, and the proof of Heine–Borel in uses no choice principle (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).
A closed rectangle has volume equal to the product of its side lengths; finite coordinate cuts partition it into finitely many subrectangles whose volumes sum to its volume (Axis-parallel rectangles in and their volume).
Finite sums are additive and monotone, and a finite subfamily of nonnegative terms is bounded by a partial sum through its largest index (Finite sums and finite products, by recursion, Laws of finite sums and finite products).
A nonnegative series whose partial sums are bounded by converges with sum at most , and every partial sum is at most the series sum (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).
For reals and natural , where is the canonical embedding of naturals into (The binomial theorem in : ).
Proof
Given: As in Facts & Assumptions.
Choose and with the Euclidean ball . Put and let . For every , , so and .
Suppose were null. By [F1], with there is a sequence of closed cubes covering whose side lengths have . For each , set and enlarge concentrically to an open cube of side . By [F6] and , . For every , induction using the finite-sum recursion gives . Thus every partial sum of the nonnegative enlarged-cost sequence satisfies , by [F4] and [F5]. A second application of [F5] gives a convergent total enlarged-cost series with sum at most .
The open cubes cover the closed box , so [F2] gives a finite subcover . Order its indices increasingly and take larger than the largest one. By [F4], the subcover's total cost is at most , which is at most by step 2.1.
Write for the closed cube with the same center and side as , so . Cut and these finitely many closed covering cubes at all their coordinate endpoints. The positive-side grid cells inside partition it; the interior of each cell lies in one covering cube because no covering-cube boundary crosses the cell. Assign each cell to the least index of a covering cube containing its interior. By finite cut-additivity from [F3], the assigned cells for each cube have total volume at most that closed cube's volume, while all cells sum to . Thus , a contradiction. Therefore is not null.
Depends on
- Measure zero and content zero in $\mathbb{R}^m$ by countable and finite cube covers
- 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
- Axis-parallel rectangles in $\mathbb{R}^m$ and their volume
- Finite sums and finite products, by recursion
- Series, partial sums, convergence and the sum, divergence, and the tail series
- Laws of finite sums and finite products
- A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum
- Integer powers $a^m$
- The binomial theorem in $\mathbb{R}$: $(x+y)^{n} = \sum_{k<n+1} \iota\!\binom{n}{k}\, x^{k} y^{\,n-k}$
Used by
Dependency tree · two levels
70 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
- Jiří Lebl, Basic Analysis II, Section 10.3, Outer Measure and Null Sets (standard reference, not scraped)
- Jiří Lebl, Basic Analysis II, Section 10.1, Riemann Integral over Rectangles (standard reference, not scraped)