Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generated
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 Morse function on the torus is perfect over every field

Example

Assume ACω. On the two-dimensional torus T2=(R/Z)2 (The two-dimensional torus T2=(R/Z)2) let f(x,y)=cos⁡(2πx)+cos⁡(2πy). Its critical points are the four points with coordinates in {0,12}, with Hessians diag⁡(−4π2cos⁡(2πx),−4π2cos⁡(2πy)), so the indices are 2 at (0,0), 1 at (0,12) and (12,0), and 0 at (12,12): Mf(t)=1+2t+t2. The index-ordered handle presentation has one 0-handle, two 1-handles and one 2-handle, and its handle chain complex over any field F has ranks 1,2,1; the boundary coefficients are the intersection numbers of attaching and belt spheres: each 1-handle attaches with two feet on the belt circle of the 0-handle and the attaching circle of the 2-handle meets each belt 0-sphere of a 1-handle in two points, and in both cases the two contributions have opposite signs (and cancel mod two), so ∂1=∂2=0. Hence H0≅F, H1≅F2, H2≅F and PT2,F(t)=1+2t+t2=Mf(t): f is F-perfect for every field, and the Euler identity gives 1−2+1=0=χ(T2).

Facts & Assumptions

Given: The flat torus T2=(R/Z)2, the function f(x,y)=cos⁡(2πx)+cos⁡(2πy), and a field F.

[F2]

The Morse numbers and Morse polynomial are mk(f)=#{p:ind⁡(p)=k} and Mf(t)=∑kmk(f)tk (Morse numbers and the Morse polynomial); the handle chain complex of an index-ordered presentation has Ck with basis the core classes and Hk(C∙)≅Hk(T2;F) (The handle chain complex computes singular homology).

[F3]

For the surface endpoints k=0 and k=n−1=1, the handle boundary coefficients in the core bases are given by the endpoint clause of the boundary-coefficient lemma: the coefficient of ∂k+1ei at fj is the intersection number of the attaching sphere of the upper handle with the belt sphere of the lower handle in the middle level (Handle boundary coefficients are attaching-belt intersection numbers). The matrix definition Attaching-belt intersection matrix of adjacent-index handles requires 1≤k≤n−2 and has no surface case.

[F4]

For every field there is a unique Q∈Z[t] with nonnegative coefficients and Mf=PT2,F+(1+t)Q; f is F-perfect exactly when mk(f)=bk(T2;F) for all k; and the Euler characteristic identity ∑k(−1)kmk(f)=χ(T2) holds (Morse polynomial identity, Perfect Morse function over a field, Morse Euler characteristic identity, Poincare polynomial of a space and of a pair over a field).

Verification

technique · direct-geometric-computation
1.1F1F2given

On the torus the gradient of f is −2π(sin⁡2πx,sin⁡2πy), which vanishes exactly when both coordinates lie in {0,12}; at such a point the Hessian is diag⁡(−4π2cos⁡2πx,−4π2cos⁡2πy), whose diagonal entries are both negative at (0,0), of opposite signs at the two mixed points, and both positive at (12,12). Hence the critical points are these four points, all nondegenerate, with indices 2,1,1,0, and by [F2], Mf(t)=1+2t+t2.

2.1F2step 1.1

By [F2] the index-ordered presentation of f has m0=1 handle of index 0, m1=2 of index 1 and m2=1 of index 2; its handle chain complex over F has dim⁡FC0=1, dim⁡FC1=2, dim⁡FC2=1.

3.1F3step 2.1

First boundary: the 1-handles are attached to the single 0-handle along two feet on its boundary circle S1, and the attaching 0-sphere S0 is oriented as the boundary of the attaching interval, so the two feet contribute with opposite signs and their intersection numbers with the belt circle cancel; by the endpoint coefficient clause of [F3] this gives zero coefficients, so ∂1=0. Equivalently, each 1-handle is a band gluing the two marked points with opposite orientations, and the two feet lie in the same component of the connected boundary.

3.2F3step 2.1algebra

Second boundary: just below the maximum (0,0), the sublevel is the torus with an open disk removed. Each 1-handle is an untwisted band in this oriented surface. Its outgoing sides D1×S0 are both in the boundary, and its belt sphere consists of their two midpoints. The remaining 2-handle caps this boundary circle, which traverses the two sides of each band in opposite core directions: this follows from the boundary orientation of the rectangle D1×D1. With the belt-point orientations compatible with the oriented core, the two local intersection signs are opposite. Thus every coefficient of ∂2 is zero by [F3], integrally and over every field; modulo two the two points likewise cancel.

4.1F2F3F4step 3.1step 3.2

Since ∂1=∂2=0, the handle chain complex equals its homology: H0≅F, H1≅F2, H2≅F; by [F2] the same holds for H∗(T2;F), so PT2,F(t)=1+2t+t2=Mf(t). Comparing in the Morse polynomial identity [F4], the correction polynomial is Q=0 and mk(f)=bk(T2;F) for every k: the function f is F-perfect, for every field F.

5.1F4step 1.1step 4.1∎

Euler check: ∑k(−1)kmk(f)=1−2+1=0, and by the Euler identity of [F4] this equals χ(T2); the same alternating sum of the Betti numbers 1−2+1 is zero.

Remarks

  • The first interesting case. The surface has nontrivial 1-handles, while both endpoint boundary maps vanish for the standard perfect function. These endpoint computations use the boundary-coefficient lemma; the middle-index attaching-belt matrix definition has no surface case.
  • Coefficient independence. Because all boundary maps vanish integrally (the cancellation is by opposite signs, not merely mod two), the computation holds over every field at once; this contrasts with real projective space, where the torsion makes the answer depend on the characteristic.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

80 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