Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: Literature-sourcedjudge 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.

A standard torus height function has four critical points

Example

On the torus T2=R2/Z2, the smooth function

f([x],[y])=cos(2πx)+cos(2πy)

has exactly four critical points: one minimum, two saddles, and one maximum. It is Morse but not excellent.

Facts & Assumptions

Given: The torus function f([x],[y])=cos(2πx)+cos(2πy).

[F1]

Morse, excellent, nondegenerate, and index are defined on the A page (Morse functions and excellent Morse functions, Nondegenerate critical points, nullity, index, and coindex).

Verification

technique · direct computation
1.1

The partial derivatives are f/x=2πsin(2πx) and f/y=2πsin(2πy), so a point is critical exactly when x,y{0,12} mod Z. Hence there are exactly four critical points.

givenalgebra
2.1

The Hessian matrix is diag(4π2cos(2πx),4π2cos(2πy)). At (0,0) it is negative definite, at (12,12) it is positive definite, and at (0,12) and (12,0) it has one positive and one negative eigenvalue. Therefore the four critical points have indices 2,0,1,1 respectively, and all are nondegenerate.

F1step 1.1algebra
3.1

Hence f is Morse by [F1]. Its critical values are 2,2,0,0, so the two saddles share the value 0. Therefore f is not excellent.

F1step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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