Learning goals and prerequisites
Prove that a differentiable coordinate change preserves negligible Jordan boundaries and obtain a uniform two-sided volume estimate for each small cube. The inner-coverage argument supplies the lower bound alongside the outer linearization estimate. The next chapter uses these estimates to prove the integral theorem in every finite dimension.
We use finite-dimensional Euclidean topology, the fundamental theorem along a line segment, determinants, compact uniform continuity and the ordinary Darboux integral on boxes. Volume and integration are developed through finite Jordan covers and Darboux sums.
For estimates use and its induced matrix norm. A closed cube of side centered at has . Its ordinary volume is . Changing the norm does not change continuity or differentiability in finite dimension, but this norm makes the cube constants transparent.
1. Jordan volume and a finite-cover boundary test
A bounded set is Jordan null if, for every , it can be covered by finitely many axis-parallel boxes with total volume below epsilon. One may require the boxes to be cubes of arbitrarily small sides: subdivide each of a finite box cover finely, allowing arbitrarily small total extra volume at its faces. Jordan volume is the Riemann integral of the indicator of in a containing box, when that indicator is integrable.
Lemma: bounded Jordan sets have null boundaries, and conversely
A bounded set is Jordan measurable exactly when is Jordan null. Moreover, on a sufficiently fine regular cube grid, the total volume of cubes meeting tends to zero.
Proof from Darboux sums. A cell whose interior meets both and its complement has indicator oscillation one, and cells not meeting the boundary have oscillation zero. If the boundary is null, compactness of its closure permits a finite open box cover of arbitrarily small total volume. Enlarge a null cover slightly to make it open while keeping its total volume small. A sufficiently fine grid's boundary cells lie in that open cover: otherwise cells of shrinking diameter would supply points arbitrarily close to the compact boundary but outside its neighborhood, a contradiction. Their total volume is then small, proving the Darboux criterion.
Conversely, choose a grid with indicator upper-lower gap below epsilon. Every boundary point not on a grid face lies in a cell meeting both sets, hence one of those oscillating cells. The finitely many grid faces themselves are null: cover each bounded face by a slab of arbitrarily small thickness. The oscillating cells together with thin face slabs cover the whole boundary with arbitrarily small total volume. This proves nullity. The preceding open-cover argument then gives the regular-grid boundary-cell assertion. The argument also establishes the regular-grid boundary-cell estimate used below.
Finite unions, intersections and differences of bounded Jordan sets are Jordan: their boundaries are contained in the union of the original boundaries. Jordan volume and Riemann integration are finitely additive on pieces whose overlaps are null. To see this, refine their box approximations together; outside a cover of the finitely many null boundaries the relevant indicators add exactly, and the remaining error is bounded by the total covering volume. The same argument proves that changing a bounded integrand on a Jordan-null set does not change its integral.
If a function is continuous on a compact Jordan set , its zero extension to a containing box is integrable. In cubes inside , uniform continuity controls its oscillation. Cubes meeting the boundary have arbitrarily small total volume and a common bound on the function controls their contribution. Outside , the extension is zero. This also shows that tagged sums over the grid cubes wholly inside converge to its integral; the omitted boundary cubes have vanishing total volume.
2. Affine box volume
Lemma: parallelepiped volume
For an invertible real matrix and an axis-parallel box ,
The image of a box is a parallelepiped.
Elementary geometric proof. Gaussian elimination expresses as a product of coordinate permutations, nonzero coordinate scalings and shears that add a multiple of one coordinate to another. Permutations preserve box-cover volumes. A coordinate scaling multiplies their volumes by the absolute scale, first exactly for boxes and then for finite box approximations. A shear preserves the volume of a parallelepiped: a slice parallel to the changed coordinate remains an interval of the same length, merely translated by a quantity depending on the other coordinates.
The needed slicing principle for polytopes follows directly from Darboux sums. A bounded polytope has boundary in finitely many hyperplanes, each null. For a bounded hyperplane piece, solve for one coordinate with nonzero coefficient and subdivide the remaining coordinates into cubes of side ; its height variation is on each column, so covering volume is overall. Slice lengths of a polytope are piecewise affine on finitely many pieces, hence Riemann integrable. Integrating the cellwise lower and upper indicator sums bounds their slice-length integral between the same sums; the boundary-null criterion makes their gap vanish. This proves volume equals the integral of the slice lengths for these polytopes. Therefore a shear's unchanged slice lengths imply unchanged volume.
Apply these elementary operations successively to . Every intermediate image is a parallelepiped, so the slicing justification continues to apply. The volume factors are one for permutations and shears, and the absolute diagonal factors for scalings. Their product is by determinant algebra. Translation preserves the finite box approximations. This proves the lemma.
The absolute value is compulsory for ordinary volume. A coordinate reflection changes determinant sign but cannot turn a nonnegative volume into a negative one.
3. A local Lipschitz map sends a compact null set to a null set
Lemma: finite-cover null preservation
Let be a compact Jordan-null subset of an open set , and let be . Then is Jordan null.
Proof. Choose a compact neighborhood of inside , and bound there by some . Cover by finitely many sufficiently small cubes in that neighborhood, with total volume as small as desired. On each cube, segments stay in the neighborhood. The fundamental theorem along a segment gives . A cube of side centered at consequently has its image in the cube centered at of side . Those image-enclosing cubes have total volume at most times the original cover total. Make that total below to obtain the required finite image cover. If desired enlarge to at least one. The cube-by-cube estimate keeps every segment in the open domain.
The same conclusion holds for any bounded subset of such a compact null set, because its image lies in the null image cover. It also applies to the inverse of a diffeomorphism on compact subsets of its target.
Let now be a diffeomorphism between open subsets of . If is compact and Jordan measurable, then is compact and Jordan measurable. Indeed a homeomorphism of open neighborhoods maps the boundary to the boundary:
For justification, maps the interior of to the interior of in both directions because it and its inverse are open; compactness makes both sets closed. Subtracting interiors proves the boundary identity. Apply null preservation to and then the Jordan boundary criterion.
This is also valid for bounded Jordan subsets whose closure lies in , by applying the same local boundary argument. It will justify pieces cut by a finite grid in the target.
4. Uniform cube distortion: prove both inclusions
Fix compact . Choose a compact neighborhood of lying inside . On it, both and its inverse matrices are bounded, because their entries are continuous and every determinant is nonzero. Write for a bound on and for a bound on .
Uniform continuity gives a modulus bounding when and . Consider any sufficiently small closed grid cube of side meeting ; choose the size so that all of lies in . Let be its center and . The segment fundamental theorem gives
Set and normalize the image by
Then and throughout . Let and be concentric cubes of side and , taking small enough that .
Outer inclusion. The coordinate error bound immediately gives .
Inner inclusion. A boundary point has some coordinate at distance from the center. Its image under therefore has that coordinate at distance at least . Hence misses the open cube with the same interior as . Since is a homeomorphism on an open neighborhood, , and is an interior point of .
If a point of the open inner cube were outside the closed set , the segment joining it to , wholly in that inner cube, would have to hit on leaving the set. That contradicts the just-proved boundary exclusion. Therefore the open inner cube lies in , and closedness gives . This is the elementary first-exit property of a segment from an interior point of a closed set.
Undo the affine normalization. The linear-volume lemma and set inclusion give the two-sided estimate
Thus there is a single , independent of the selected cube near , with
For example take . Also with fixed for these small cubes. The affine-volume lemma converts the two enclosures into the stated volume bounds.
The uniform relative error allows the cell errors to be summed over a refining grid; the same constants also control boundary cubes.
Worked estimate
In dimension two, if and the center Jacobian is , the image area lies between and . The relative bounds remain useful as the number of grid cells grows on the order of . Uniform derivative continuity forces delta to zero as decreases.
Graded proof tasks
- Null cover. Reproduce the Lipschitz null-image proof and explain why the derivative bound need only hold on small cover cubes, not on every segment joining arbitrary points of .
- Boundary. Prove under the stated compact/homeomorphism hypotheses. Which facts would need rechecking if the set reached the boundary of ?
- Inner coverage. Explain why the outer image enclosure alone cannot establish the stated volume asymptotic. Reproduce the boundary-and-segment argument for the inner enclosure.
- Uniformity. Identify where compactness supplies common derivative, inverse-matrix and continuity bounds. Explain why a separate little-o statement for every unrelated cell center is not the summed estimate needed later.
Full solutions
- A finite cube cover of total volume has image enclosed by cubes of total volume at most , so choose . Each small cube and its internal segments stay in a fixed compact neighborhood inside , where the derivative bound is uniform. A distant connecting segment might leave a nonconvex domain; the proof never needs it.
- Compactness makes and closed in the ambient spaces. A homeomorphism between open neighborhoods carries interior to interior in both directions. Thus , giving the boundary identity. At a domain boundary there may be no open neighborhood for that argument, no uniform derivative bound and no defined image of missing boundary points. The theorem deliberately keeps compact closure inside .
- An upper enclosure only bounds image volume above and does not show the map covers most of the affine cell. Here the normalized image boundary lies outside the open inner cube, while its center is inside the image. A segment to any allegedly missing inner point would leave the closed image and hence meet its boundary within the inner cube, impossible. Taking closure includes the inner cube's faces. This provides the necessary lower bound before computing the asymptotic.
- Continuity of and its inverse matrices on gives finite common bounds; uniform continuity of gives one modulus for all small cubes near . Consequently every volume error is at most the same times cell volume, whose sum stays bounded. Pointwise little-o constants or scales depending independently on cell centers would not by themselves provide a common vanishing bound for the whole grid.
Summary and terms
A Jordan-null set has arbitrarily small finite box covers. A cell-distortion estimate bounds image volume above and below by nearby determinant-scaled volume. Uniformity lets the relative cell errors be summed safely. A diffeomorphism supplies neighborhood homeomorphism and invertible derivatives, not just a formal determinant. These finite-cover and finite-cell facts establish the geometric foundation of the next chapter's Riemann theorem.