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 graph of a continuous function on a compact Euclidean set has content zero
Statement
The graph of every continuous on a compact set has content zero in .
Facts & Assumptions
Given: A compact set , a continuous function , its graph , and a tolerance .
A continuous map from a compact metric space is uniformly continuous (Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).
Content zero means the existence, for every positive tolerance, of a finite closed-cube cover with total volume at most that tolerance (Measure zero and content zero in by countable and finite cube covers).
A continuous real function on a nonempty compact metric space has bounded image (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
A compact subset of Euclidean space is closed 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).
Proof
If , then and the empty finite cover proves the conclusion. If , then has exactly one point, so has at most one point and is a single point of , covered for every tolerance by one closed cube of small enough side; [F2] gives content zero. Hence assume and , so that the divisions by below are defined.
By [F4], compactness places in a closed cube , and [F3] bounds in an interval. By [F1], for every there is such that whenever and .
Partition a fixed cube slightly larger than into coordinate cubes of side . Keep only the base cells meeting , and above each such cell keep the vertical -grid cubes that meet . Values of over one base cell differ by less than , so its retained vertical stack has total height at most . If is the volume of the enlarged base cube, the retained cubes cover and have total volume at most .
Choose and then so that . Step 2.1 is then a finite closed-cube cover of with total volume below ; by [F2], has content zero.
Depends on
- Measure zero and content zero in $\mathbb{R}^m$ by countable and finite cube covers
- Grid partitions of a rectangle in $\mathbb{R}^m$, their cells, refinements and mesh
- Axis-parallel rectangles in $\mathbb{R}^m$ and their volume
- 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
- Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- Continuity of a map between metric spaces, at a point and globally, in the $\varepsilon$-$\delta$ form
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
- Laws of finite sums and finite products
Used by
Dependency tree · two levels
72 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, Proposition 3.1.7 (standard reference, not scraped)