Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-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.

Regular sublevels are compact manifolds with boundary

Statement

Let f:M→R be smooth on a boundaryless smooth m-manifold and let c be a regular value such that the closed sublevel f−1((−∞,c]) is compact. Then f−1((−∞,c]) is a compact smooth m-dimensional submanifold with boundary, its boundary is the level f−1(c), its interior is the open sublevel f−1((−∞,c)), and the boundary is empty exactly when the level is empty; in that case f−1((−∞,c])=f−1((−∞,c)) is a compact manifold without boundary. In particular every regular sublevel of a Morse function whose sublevels are compact is a compact manifold with boundary.

Facts & Assumptions

Given: A smooth function f:M→R on a boundaryless smooth m-manifold M, a regular value c, and the compact closed sublevel S=f−1((−∞,c]).

[F1]

A value c is regular when it is not a critical value, so dfx≠0 at every x∈f−1(c); sublevels, levels and the open sublevel are as in Closed sublevel and level set of a smooth function and Critical points and critical values of a smooth function.

[L1]

At a point where f is a submersion there are charts in which f reads as a coordinate function (Local normal form for submersions).

[L2]

Half-space charts compatible in the local-extension sense define a smooth structure with boundary (Smooth charts, atlases, and structures with boundary), and the boundary of such a manifold is closed and embedded (The boundary of a positive-dimensional manifold is a closed embedded smooth (n-1)-manifold).

Proof

technique · direct
1.1F1given

If x∈S has f(x)<c, continuity of f and openness of (−∞,c) give an open neighbourhood U of x with f(U)⊆(−∞,c), so U⊆S. Hence every point of the open sublevel is interior; the local normal form below excludes points of the level from the interior.

1.2F1L1algebra

Let x∈f−1(c). By [F1] the differential dfx is nonzero, so f is a submersion at x; by [L1] choose adapted source coordinates with last coordinate f−c. To see that these are coordinates, start with the submersion normal form and replace its final coordinate by ψ−1(um)−c, whose derivative is nonzero. Then S∩U corresponds to {um≤0} and the level to {um=0}. Every neighbourhood of a level point also meets {f>c}, so no level point is interior to S.

2.1L2step 1.1step 1.2construct

The charts of step 1.2 around points of the level together with the ordinary charts of M around the interior points of step 1.1 cover S. Their transition maps are restrictions of smooth transition maps of the ambient manifold M (each boundary chart extends to an ambient smooth chart), hence smooth in the local-extension sense; therefore they define a smooth m-manifold structure with boundary on S whose boundary is the level f−1(c) and whose interior is the open sublevel, and [L2] makes that boundary closed and embedded.

3.1F1L3step 1.1step 2.1∎

By hypothesis S is compact. If the level is empty, step 1.1 applies at every point and S=S∘, so S is a compact manifold without boundary; conversely, if the boundary is empty then the level is empty. The assertion for a Morse function with compact sublevels is the special case in which the regular values are exactly the non-critical values.

Depends on

Used by

Dependency tree · two levels

26 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