Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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 n1, let URm be open, and let f:URn be a Cr map with

r>max{mn,0}.

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

Facts & Assumptions

Given: An integer n1 and a Cr map f:URn with r>max{mn,0}.

[F1]

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

[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.1

If m=0, then U is at most a point, so Crit(f) is [F1, given, choose, cases] finite and f(Crit(f)) is finite. Every finite subset of Rn is null, so the theorem follows. Assume henceforth that m1. Exhaust U by countably many compact cubes Qν with interiors contained in U. It is enough to show that f(Crit(f)Qν) is null for every ν, because the critical value set in [F1] is the countable union of those images.

F1givenchoosecases
2.1

Fix one cube Qν and put [L1, step 1.1, algebra] C0:=Crit(f)Qν,Cj:={xQν:Dαf(x)=0 for every 1αj}(j1). Then C0=(C0C1)j=1r1(CjCj+1)Cr. For each 1j<r and each 1, the set Kj,:={xCjQν:dist(x,Cj+1)1/} is compact and contained in CjCj+1. Because CjCj+1=1Kj,, the nonflat lemma in [L1] shows that f(CjCj+1) is null. Also, the set Cr is compact, and the hypothesis r>max{mn,0} implies rnm; thus the flat lemma in [L1] makes f(Cr) null.

L1step 1.1algebra
2.2

It remains to show that f(C0C1) is null. [L1, L2, step 1.1, algebra] If n=1, then a linear map RmR is surjective exactly when it is nonzero, so C0=C1 and there is nothing to prove. Assume n>1, and fix xC0C1. Some first partial derivative of some component of f is nonzero at x; after reordering coordinates and components, assume f1x1(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×ΩxR×Rm1. Write fΦx1(t,u)=(t,f~x(t,u)). Each slice map uf~x(t,u) is Cr, and because r>max{mn,0}=max{(m1)(n1),0}, the induction hypothesis applies to those maps. If q=Φx1(t,u)C0Wx, then in these coordinates the differential of f has block form Dfq=[10D(f~x)t(u)], so q is critical for f exactly when u is a critical point of the slice uf~x(t,u). Now choose an open neighbourhood WxWx of x with compact closure KxWx. The compact set f(C0Kx) has sections contained in the critical value sets of the slice maps, hence null in Rn1 by induction. Applying the slicing lemma in [L1] shows that f(C0Kx) is null in Rn. A countable subcover of C0C1 by the neighbourhoods Wx therefore makes f(C0C1) null.

L1L2step 1.1algebra
3.1

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

F1step 2.1step 2.2step 1.1

Depends on

Used by

Dependency tree · two levels

22 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