Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Morse numbers and the Morse polynomial

Definition

Let M be a closed smooth n-manifold (Smooth manifolds and their smooth charts, Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right) and let f:M→R be a Morse function (Morse functions and excellent Morse functions). Write Crit⁡(f) for the set of critical points of f (Critical points and critical values of a smooth function) and ind⁡(p) for the index of a nondegenerate critical point p (Nondegenerate critical points, nullity, index, and coindex). For every integer k the Morse number of f in degree k is mk(f):=#{ p∈Crit⁡(f):ind⁡(p)=k }.

Each mk(f) is a finite nonnegative integer, and mk(f)=0 unless 0≤k≤n. The Morse polynomial of f is Mf(t):=∑k=0nmk(f) tk∈Z[t], a polynomial with nonnegative integer coefficients and Mf(1)=#Crit⁡(f).

The index is the number of negative squares of the Hessian in the library's convention (Nondegenerate critical points, nullity, index, and coindex). The definition is purely geometric: no field, coefficient ring, or orientation enters, and the empty and zero-dimensional cases are included.

Remarks

Depends on

Used by

Dependency tree · two levels

19 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