Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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.

On a compact manifold, a Morse function has finitely many critical points and a uniform Hessian gap on disjoint critical neighborhoods

Statement

Let M be a compact smooth manifold and let f:MR be Morse. Then f has finitely many critical points p1,,pr, and one can choose pairwise disjoint coordinate neighbourhoods Ui of pi and a constant η>0 such that:

  • in the chosen chart on Ui, every Hessian matrix Hi(x) of f on Ui satisfies Hi(x)v2ηv for every coordinate vector v; and
  • every smooth function g that is sufficiently C2-close to f on Ui has exactly one critical point in Ui, and that critical point is nondegenerate.

Facts & Assumptions

Given: A compact smooth manifold M and a Morse function f:MR.

[F1]

Every critical point of a Morse function is nondegenerate, and a smooth function is Morse exactly when all of its critical points are nondegenerate (Morse functions and excellent Morse functions, A smooth function is Morse if and only if its differential section is transverse to the zero section).

[L1]

A Morse function on a compact manifold has finitely many critical points (A Morse function on a compact manifold has finitely many critical points).

[L2]

A C1 map between Euclidean open sets with invertible derivative at a point is a local diffeomorphism near that point (The Euclidean inverse function theorem).

Proof

technique · direct
1.1

By [L1], the critical set of f is finite; write it as {p1,,pr}. Choose pairwise disjoint coordinate charts φi:UiBiRni with φi(pi)=0, and then shrink to relatively compact subcharts UiUi that are still pairwise disjoint.

L1givenchoose
2.1

If r=0, take η:=1; there are no neighbourhood conditions to check, so the conclusion is vacuous. If instead dimM=0, then M is discrete and each Ui:={pi} is a coordinate neighbourhood. Again take η:=1. The displayed matrix inequality is vacuous on the zero vector space, every point is critical and nondegenerate, and every function on Ui has exactly the one critical point pi. Thus the conclusion holds in either boundary case. Henceforth assume r1 and dimM1.

step 1.1cases
2.2

Write Fi:=(fφi1) on Bi. Since pi is nondegenerate by [F1], the derivative DFi(0) is the Hessian matrix at pi and is invertible. By [L2], after shrinking Ui again we may assume Fi is a diffeomorphism from φi(Ui) onto an open neighbourhood of 0.

F1L2step 1.1
3.1

Continuity of the Hessian matrices on the compact closures Ui lets us shrink the Ui so that every Hessian matrix Hi(x) of f on Ui stays within half the least singular value of DFi(0). Hence there is ηi>0 such that Hi(x)v2ηiv for all xUi and all coordinate vectors v. Let η:=miniηi>0.

step 2.1step 2.2choosealgebra
4.1

If g is sufficiently C2-close to f on Ui, then the gradient map (gφi1) is C1-close to Fi. Because Fi is a local diffeomorphism carrying 0 to 0 and the Hessian gap from step 3.1 keeps the derivative uniformly invertible on Ui, the inverse-function argument persists under sufficiently small C1 perturbation: the perturbed gradient has a unique zero in φi(Ui), and at that zero its derivative is still invertible. Thus g has exactly one nondegenerate critical point in Ui.

L2step 2.2step 3.1
5.1

Steps 1.1, 3.1, and 4.1 give the claimed finite critical set, disjoint critical neighbourhoods, uniform Hessian gap, and local persistence statement.

step 1.1step 3.1step 4.1

Depends on

Used by

Dependency tree · two levels

23 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