Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-24 (gpt-6-sol)
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.

Morse-Sard for Euclidean maps

Statement

Let m≥0, n≥1, and r≥1 be integers, let U⊆Rm be open, and let f:U→Rn be a Cr map with

r>max⁡{m−n,0}.

Then the critical value set of f is a null subset of Rn.

Facts & Assumptions

Given: An integer n≥1 and a Cr map f:U→Rn with r>max⁡{m−n,0}.

[F1]

The critical value set is the image of the critical locus (The critical locus and critical value set).

[F2]

Nullity is expressed by countable cube covers of arbitrarily small total volume (Measure zero and content zero in Rm by countable and finite cube covers).

[L1]

Compact null sections reassemble into a null set, and the nonflat and flat critical strata have null images under the hypotheses of the preceding lemmas (Compact null sections imply a compact set is null, Sard on the nonflat critical strata, Sard on the infinitely flat critical stratum).

[L2]

If a Euclidean map has invertible derivative at a point, it becomes a coordinate there after shrinking (The Euclidean inverse function theorem).

Proof

technique · direct
1.1F1F2givenconstructcases

Prove the assertion by induction on the source dimension m, keeping the differentiability order r fixed. If m=0, then U is at most a point, so Crit⁡(f) and its image are finite, hence null in Rn. Assume m≥1 and the theorem proved for all smaller source dimensions and every positive target dimension satisfying the same differentiability inequality. Exhaust U by the canonically enumerated rational closed cubes with closures inside U. We use the following choice-free countable-union observation throughout: every compact null subset of Rn has, for each positive rational budget, a finite rational-cube cover below that budget. Indeed, start with a countable cube cover of total volume below half the budget from [F2], enlarge its cubes slightly to rational open cubes while retaining the budget, and take a finite subcover by compactness. Enumerate all finite rational-cube families and use the first qualifying family for each compact set and budget. For a countable sequence of compact null sets, use budgets ε2−i−1 and combine these canonical finite covers; [F2] makes their union null without making countably many arbitrary choices. Thus it suffices to prove f(Crit⁡(f)∩Qν) null for each cube: these images are compact and their countable union is the critical value set of [F1].

2.1L1step 1.1algebra

Fix one cube Qν and put C0:=Crit⁡(f)∩Qν,Cj:={x∈Qν:Dαf(x)=0 for every 1≤∣α∣≤j}(j≥1). These are the intersections of Qν with the corresponding closed strata in U. Then C0=(C0∖C1)∪⋃j=1r−1(Cj∖Cj+1)∪Cr. For each 1≤j<r and each ℓ≥1, the set Kj,ℓ:={x∈Cj:dist⁡(x,Cj+1)≥1/ℓ} is compact and contained in Cj∖Cj+1 (take distance to the empty set as infinite). Because Cj∖Cj+1=⋃ℓ≥1Kj,ℓ, the nonflat lemma in [L1] applies: its lower-dimensional Sard premise holds by the induction hypothesis at the unchanged order r, since r>max⁡{m−n,0} implies r>max⁡{(m−1)−n,0}. Each f(Kj,ℓ) is compact null, so the canonical-cover observation in step 1.1 makes f(Cj∖Cj+1) null. Also, Cr is compact, and r>max⁡{m−n,0} implies rn≥m; the flat lemma in [L1] makes f(Cr) null.

2.2L1L2step 1.1algebra

It remains to show that f(C0∖C1) is null. If n=1, then a linear map Rm→R is surjective exactly when it is nonzero, so C0=C1 and there is nothing to prove. Assume n>1, and fix x∈C0∖C1. Some first partial derivative of some component of f is nonzero at x; after reordering coordinates and components, assume ∂f1∂x1(x)≠0. By [L2], after shrinking choose a neighbourhood Wx of x and a Cr diffeomorphism Φx(y):=(f1(y),y2,…,ym) from Wx onto an open set Ix×Ωx⊆R×Rm−1. Write f∘Φx−1(t,u)=(t,f~x(t,u)). Each slice map u↦f~x(t,u) is Cr, and because r>max⁡{m−n,0}=max⁡{(m−1)−(n−1),0}, the induction hypothesis applies to those maps. If q=Φx−1(t,u)∈C0∩Wx, then in these coordinates the differential of f has block form Dfq=[10∗D(f~x)t(u)], so q is critical for f exactly when u is a critical point of the slice u↦f~x(t,u). For every rational open cube B whose closure lies in Wx, the compact set f(C0∩B‾) has sections contained in the slice critical value sets, hence null in Rn−1 by induction. The slicing lemma in [L1] makes this compact image null in Rn. Consider all rational cubes B for which such an x and chart exist; they form a countable family covering C0∖C1. Each has the compact-null conclusion just proved, independently of which witnessing chart exists. The canonical-cover observation in step 1.1 makes their image union f(C0∖C1) null without selecting charts or covers countably.

3.1F1step 2.1step 2.2step 1.1∎

Step 2.1 shows that f(Cj∖Cj+1) is null for every [F1, step 2.1, step 2.2, step 1.1] 1≤j<r and that f(Cr) is null, while step 2.2 handles f(C0∖C1). Hence f(C0)=f(Crit⁡(f)∩Qν) is null. Applying step 1.1 shows that the whole critical value set of f is null.

Depends on

Used by

Dependency tree · two levels

29 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