Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedverified 2026-09-23 (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 manifold embedded in Euclidean space, the restricted linear height is Morse for generic directions

Statement

Let M⊆RN be a compact embedded smooth manifold.

  • If N=1, then every nonzero linear functional on R restricts to a Morse function on M.
  • If N≥2, then there is a subset E⊆SN−1 that is A-null for every smooth atlas A of SN−1 (Null subsets of a smooth manifold), such that for every u∈SN−1∖E, the height function hu:M→R,hu(x)=u⋅x is Morse.

Thus restricted linear heights are Morse for generic directions.

Facts & Assumptions

Given: A compact embedded smooth manifold M⊆RN.

[F1]

A smooth function is Morse exactly when its differential section is transverse to the zero section (A smooth function is Morse if and only if its differential section is transverse to the zero section).

[L1]

The critical values of a smooth Euclidean map are null (Morse-Sard for Euclidean maps); transverse preimages are embedded submanifolds (The transverse preimage theorem).

[L2]

The zero section of the cotangent bundle is an embedded submanifold (The zero section is a smooth embedding). Manifold nullity is chartwise Euclidean nullity (Null subsets of a smooth manifold).

[A1]

For u∈SN−1 and x∈M, the differential of hu at x is the cotangent vector v↦u⋅v on TxM. If d(hu)x=0, then TxM⊆u⊥=TuSN−1, so varying the parameter u in tangent directions to the sphere produces every cotangent vector on TxM.

Proof

technique · direct
1.1givenalgebra

If N=1, then every embedded compact submanifold of R is zero-dimensional, hence finite. The restriction of a nonzero linear functional to a finite manifold has all points critical and nondegenerate in the zero-dimensional Morse convention, so it is Morse.

1.2L2A1givenconstruct

Assume now that N≥2. Define a smooth family of cotangent sections by D:M×SN−1→T∗M,D(x,u)=d(hu)x. By [L2], its target zero section is an embedded submanifold. At any zero (x,u), [A1] says that the parameter derivative in tangent directions to SN−1 spans the whole fibre Tx∗M, so D is transverse to the zero section.

2.1F1L1L2step 1.2

Let W=D−1(0T∗M). Since the total family is transverse to the zero section, [L1] makes W an embedded submanifold of dimension N−1. It is closed in the compact space M×SN−1, hence compact. Write π:W→SN−1 for the parameter projection. In local coordinates near (x,u)∈W, the zero condition is H(x,u)=0 for a map to Rdim⁡M whose full derivative is surjective. The tangent space of W is ker⁡dH. The derivative dπ is surjective exactly when for each parameter tangent w there is a source tangent v with dH(v,w)=0. Because the full dH is surjective, this is equivalent to surjectivity of dxH, which is precisely transversality of the slice d(hu) to the zero section. Thus bad directions are exactly the critical values of π.

3.1F1L1L2step 2.1∎

Cover the compact W by finitely many source charts. Fix any smooth target chart ψ:V→RN−1 on the sphere, and restrict each source chart to the open preimage of V. In those finitely many Euclidean coordinates, ψ∘π is smooth and [L1] makes each critical-value image null. Their finite union equals ψ(E∩V) and is null. Since this holds for every target chart, E is null in every smooth atlas directly; no countable atlas or general manifold Sard theorem is needed. Outside E, [F1] makes hu Morse.

Depends on

Used by

Dependency tree · two levels

25 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