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 map sends a compact set of content zero to a set of content zero
Statement
Let . Then if is on an open with values in and is compact with content zero, then is compact and has content zero.
Content zero and nullity are those of Measure zero and content zero in by countable and finite cube covers.
Facts & Assumptions
Given: The integer , the open set , the map , and the compact set of content zero.
A set is null when, for every , it is covered by a sequence of closed cubes whose nonnegative volume series converges with sum at most ; it has content zero when such a cover can be finite (Measure zero and content zero in by countable and finite cube covers).
Padding a finite cover with degenerate zero-volume cubes proves that content zero implies null (Measure zero and content zero in by countable and finite cube covers).
A map between metric spaces is Lipschitz with constant , where and , when for all (Lipschitz map, -Hölder map for rational , and contraction).
A metric space is compact when every open cover of it has a finite subcover (Open cover, subcover, compact metric space, and compact subset of a metric space).
A map is of class when each component is of class ( Euclidean maps and diffeomorphisms).
For , (The Euclidean inner product on ).
Every subset of a null subset of is null (Subsets and countable unions of null subsets of are null).
If is Lipschitz and is null, then is null (A Lipschitz map sends null sets to null sets).
If is continuous and differentiable on with there, then (The mean value inequality: if is continuous and differentiable on with , then ).
If is totally differentiable at and at , then (The chain rule for total derivatives: ).
If is totally differentiable at then exists for every and equals , and the matrix of is (A total derivative computes every directional derivative, and its matrix is the Jacobian).
If every partial derivative of exists on a neighbourhood of and is continuous at , then is totally differentiable at with the linear map of matrix (If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative).
For a continuous real-valued on a nonempty compact metric space, the image is bounded above and below (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
For continuous between metric spaces, if is a compact subset of , then is a compact subset of (The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset).
A closed box in is compact, and a subset is compact if and only if it 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).
A compact subset of is null if and only if it has content zero (For compact subsets of , measure zero and content zero coincide).
Proof
If then , which is covered by the single degenerate cube of volume , so it has content zero by [F1] and the assertion holds. For the rest of the proof assume .
Since has content zero, [F2] makes null.
A map is continuous, since by [F5] and [L6] each component is totally differentiable and hence continuous at every point of . So is a compact subset of by [L8].
Every point lies in the open set , so some closed cube centred at with positive edge is contained in , and the interior of contains . Those interiors form an open cover of the compact , so by [F4] and [L9] finitely many of them cover : there are closed cubes with whose union contains .
Fix with . The functions are continuous on by [F5], and is a nonempty compact subset of by [L9], so [L7] bounds each of them on : there is with for all and all . Put . For and , [L5] and [L6] give , whose th coordinate is , of absolute value at most because by [F6]; hence , again by [F6].
Let . A cube is convex, so lies in for . The map is differentiable with , and is totally differentiable on by [F5] and [L6], so [L4] and [L5] make differentiable on with derivative , of norm at most by step 3.1. Hence [L3] on gives , so the restriction is Lipschitz with constant in the sense of [F3].
Write and let be the coordinatewise clamp, . Each scalar clamp satisfies , so by [F6] and is Lipschitz with constant ; therefore is defined on all of , agrees with on since fixes pointwise, and is Lipschitz with constant by step 4.1 and [F3].
For each , the set is a subset of the null set of step 1.2, hence null by [L1]; so [L2] applied to the Lipschitz map of step 5.1 makes null, and that set is because agrees with on .
By step 2.1 the union of the contains , so . Let . By step 6.1 and [F1] each of the sets admits a sequence of closed cubes covering it with volume sum at most ; concatenating those sequences gives one sequence of closed cubes covering with volume sum at most , so is null by [F1]. The index set is finite, so only finitely many covers are named and no choice principle is used.
The set is compact by step 1.3 and null by step 7.1, so [L10] gives that it has content zero.
Remarks
-
Why the published Lipschitz theorem is not enough on its own. [L2] is stated for a Lipschitz map defined on all of , and is defined only on and need not be Lipschitz there — its derivative may be unbounded near . Steps 2.1 to 5.1 exist to manufacture, on each of finitely many cubes, a genuinely global Lipschitz map that agrees with where it matters.
-
Compactness is used twice, for different things. It supplies the finite subcover in step 2.1, and in step 8.1 it converts nullity back into content zero; a null set need not have content zero without it.
Depends on
- Measure zero and content zero in $\mathbb{R}^m$ by countable and finite cube covers
- For compact subsets of $\mathbb{R}^m$, measure zero and content zero coincide
- Subsets and countable unions of null subsets of $\mathbb{R}^m$ are null
- A Lipschitz map $\mathbb{R}^m\to\mathbb{R}^m$ sends null sets to null sets
- Lipschitz map, $\alpha$-Hölder map for rational $0 < \alpha \le 1$, and contraction
- The mean value inequality: if $f : [a,b] \to \mathbb{R}^m$ is continuous and differentiable on $(a,b)$ with $\lVert f'\rVert_2 \le M$, then $\lVert f(b)-f(a)\rVert_2 \le M(b-a)$
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset
- 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
- $C^k$ Euclidean maps and diffeomorphisms
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- Open cover, subcover, compact metric space, and compact subset of a metric space
- A total derivative computes every directional derivative, and its matrix is the Jacobian
- If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
Used by
Dependency tree · two levels
98 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
- J. Feldman, A. Rechnitzer and E. Yeager, CLP-4 Vector Calculus (University of British Columbia), ch. 4 (standard reference, not scraped)