ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-04

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.

The standard quadratic form realizes every Morse index

Example

Fix $n \geq 0$ and $0 \leq λ \leq n$ . On $R^{n}$ , the quadratic form

$q_{λ} (x_{1}, \dots, x_{n}) : = - \sum_{i = 1}^{λ} x_{i}^{2} + \sum_{i = λ + 1}^{n} x_{i}^{2}$

has a unique critical point at the origin, and that critical point has Morse index $λ$ .

Facts & Assumptions

Given: Integers $n \geq 0$ and $0 \leq λ \leq n$ , and the quadratic form $q_{λ}$ above.

[F1]

Index and nondegeneracy are read from the Hessian (Nondegenerate critical points, nullity, index, and coindex).

[L1]

The Morse normal form is exactly the displayed signed quadratic form (Morse lemma).

Verification

technique · direct computation

1.1

The partial derivatives satisfy $\partial q_{λ} / \partial x_{i} = - 2 x_{i}$ for $1 \leq i \leq λ$ and $\partial q_{λ} / \partial x_{i} = 2 x_{i}$ for $λ < i \leq n$ , so all first derivatives vanish exactly at $x = 0$ .

givenalgebra

2.1

The Hessian matrix at the origin is $diag (\underset{λ}{\underset{⏟}{- 2, \dots, - 2}}, \underset{n - λ}{\underset{⏟}{2, \dots, 2}})$ , so the critical point is nondegenerate and has exactly $λ$ negative directions. By [F1], its index is $λ$ .

F1step 1.1algebra

3.1

The displayed formula is already the Morse normal form from [L1], including the endpoint cases $λ = 0$ and $λ = n$ .

L1step 2.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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

Liviu I. Nicolaescu, An Invitation to Morse Theory, 2nd ed. (standard reference, not scraped)
Michele Audin and Mihai Damian, Morse Theory and Floer Homology (standard reference, not scraped)