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 product of a content-zero set and a compact interval has content zero
Statement
If has content zero and , then has content zero in .
Facts & Assumptions
Given: A set of content zero, a compact interval , and a real tolerance .
A set has content zero when for every positive tolerance it has a finite cover by closed cubes whose total volume is at most that tolerance (Measure zero and content zero in by countable and finite cube covers).
For every real there is a unique integer such that (Integer part: for every real there is exactly one integer with ).
Proof
If , the empty family covers . If , use [F1] with tolerance , obtaining a finite cube cover with side lengths and total base volume at most ; then the cubes cover and have total -volume at most the base total.
Suppose and . Use [F1] with tolerance ; enlarge any zero-side cubes slightly, using the unused half of this tolerance, so that the resulting finite cover has and total base volume below . For each , let . Fact [F2] gives and , and the consecutive -cubes of side above cover .
The total volume of the cubes in step 1.2 is , the first two inequalities being the bounds and of step 1.2 and the last the strict bound on the base total. Together with step 1.1 this supplies an arbitrarily small finite cube cover in every case, so has content zero.
Depends on
- Measure zero and content zero in $\mathbb{R}^m$ by countable and finite cube covers
- Axis-parallel rectangles in $\mathbb{R}^m$ and their volume
- Laws of finite sums and finite products
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
Used by
Dependency tree · two levels
35 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
- Michael E. Taylor, Introduction to Analysis in Several Variables, §3.1 (standard reference, not scraped)