Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedaudited 2026-09-07
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--Smale height function on a tilted torus

Example

Start with E(u,v)=((2+cosv)cosu,sinv,(2+cosv)sinu), with angles modulo 2π. Rotate this embedded torus so that its new vertical coordinate is f(u,v)=(2+cosv)sinu+εsinv1+ε2,0<ε<1/2. For the induced metric g=(2+cosv)2du2+dv2, the pair (f,g) is Morse--Smale. It has one maximum, one minimum, and two saddles. Its maximum-to-minimum trajectory space modulo time is one-dimensional, whereas spaces with index drop one are zero-dimensional.

Facts & Assumptions

Given: The rotated embedded torus, f,g, and ε above. Write A=2+cosv, S=1+ε2, and ϕ=arctanε.

[F1]

The metric Morse--Smale condition is transversality of all backward-/forward-limit manifolds for the complete negative gradient (Morse--Smale pairs).

[F2]

A transverse stable--unstable intersection has dimension equal to the index drop (A parametrized Morse trajectory space is a manifold).

[F3]

A regular intermediate level represents each time-translation class exactly once (A regular level identifies unparametrized trajectories).

Verification

technique · direct
1.1

The negative-gradient equations are u˙=cosu/(SA) and v˙=(sinvsinuεcosv)/S. The field is complete on this compact torus. Critical points require u=π/2 or 3π/2. For u=π/2 they have v=ϕ,π+ϕ; for u=3π/2 they have v=2πϕ,πϕ. The mixed Hessian entry is zero, the uu entry is Asinu/S, and the vv entry is (cosvsinu+εsinv)/S, which equals ±1 at these points. Thus all four are nondegenerate: a maximum, an upper saddle a=(π/2,π+ϕ), a minimum, and a lower saddle b=(3π/2,πϕ), respectively. Their saddle values are (2S)/S and (2S)/S.

givenalgebra
2.1

The closed strip πv2π is forward invariant: on its lower boundary v˙=ε/S>0, and on its upper boundary v˙=ε/S<0. Since a lies in its interior, every orbit with backward limit a stays in this strip, and cannot have forward limit b, which is outside it. The reverse connection is excluded by strict decrease of f. Thus there are no connections between the distinct saddles.

step 1.1algebra
3.1

On a surface all other nonempty intersections are automatically transverse: an unstable manifold of a maximum or stable manifold of a minimum is open; the remaining extremal stable/unstable manifolds are singletons and meet only their own complementary open manifold. At each saddle its stable and unstable tangent lines at that saddle are the complementary negative-gradient eigenspaces. A nonconstant orbit cannot have identical endpoints because f strictly decreases. Together with step 2.1 these observations cover every pair and prove (f,g) Morse--Smale.

F1step 1.1step 2.1
4.1

A connecting trajectory has df(X)<0, so its regular-level slice is a transverse hypersurface in the parametrized intersection. By [F2] and [F3] the space modulo time has dimension λ(p)λ(q)1. This is zero for index drop one and one for the maximum-to-minimum pair. In particular, the latter slice is not a finite set: the open basins of the maximum and minimum overlap, since their complements are the finitely many saddle separatrices and critical points.

F2F3step 3.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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