Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedverified 2026-09-26 (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.

For a compact Morse function, disjoint local bump perturbations can separate finitely many equal critical values without changing the Hessians

Statement

Let M be a compact smooth manifold and let f:M→R be Morse. Then every C∞ neighbourhood U of f contains a smooth function g such that:

  • g has the same critical points as f;
  • the Hessian of g at each critical point equals the Hessian of f there; and
  • distinct critical points of g have distinct critical values.

Facts & Assumptions

Given: A compact smooth manifold M, a Morse function f:M→R, and a C∞ neighbourhood U of f.

[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]

Around a compact set inside an open set there exists a smooth bump that is identically 1 near the compact set and supported in the open set (A manifold bump for a compact set inside an open set).

[A1]

If a continuous cotangent field is nowhere zero on a compact set, then its norm has a positive minimum there.

[A2]

For finitely many fixed smooth bump functions, the linear combination map from the coefficient space into C∞(M) is continuous. Hence sufficiently small coefficients place that combination inside any prescribed C∞ neighbourhood of 0, and at the same time make its differential uniformly small on a chosen compact set.

Proof

technique · direct
1.1L1L2givenchoose

By [L1], the critical points of f are p1,…,pr. Choose pairwise disjoint open neighbourhoods Vi⋐Ui of the pi such that each Ui contains no critical point other than pi, and by [L2] choose smooth functions ρi with ρi=1 on Vi and supp⁡(ρi)⊆Ui.

2.1A1A2step 1.1givenchooseconstruct

Let K:=M∖⋃i=1rVi. This compact set contains no critical point of f. If K≠∅, [A1] gives m>0 with ∥dfx∥≥m for every x∈K; if K=∅, choose any m>0 and read the differential bound below as vacuous. Using [A2], choose real numbers λi such that the shifted numbers f(pi)+λi are pairwise distinct, the finite sum u:=∑i=1rλiρi satisfies f+u∈U, and, when K≠∅, ∑i∣λi∣ ∥dρi∥C0(K)<m/2. Define g:=f+u.

3.1step 1.1step 2.1algebra

On each neighbourhood Vi one has g=f+λi, because ρi=1 there and every ρj with j≠i vanishes there. Therefore pi is still a critical point of g, and the Hessian of g at pi equals the Hessian of f there.

4.1step 1.1step 2.1step 3.1algebra

For x∈K, step 2.1 gives ∥dgx−dfx∥≤∑i∣λi∣ ∥dρi∥C0(K)<m/2, so ∥dgx∥≥∥dfx∥−∥dgx−dfx∥>m/2>0. Hence g has no critical point on K. Since every critical point of f lies in some Vi, step 3.1 shows that the critical set of g is exactly {p1,…,pr}.

5.1step 2.1step 4.1

The critical values of g are g(pi)=f(pi)+λi, which are pairwise distinct by step 2.1. The same step also gives g∈U. Therefore g has the same critical points and Hessians as f, while all of its critical values are distinct.

6.1step 4.1step 5.1∎

Thus one can separate all repeated critical values by disjoint local perturbations without changing any critical Hessian.

Depends on

Used by

Dependency tree · two levels

15 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