What was already known
Karcher constructed the saddle-tower family. Wiygul reduced the index and nullity questions for the two-period and six-ended families to spectral problems on simpler regions.
AI involvement
Wiygul supplied the geometric reductions and Fourier approach. He credits Claude Fable 5 and Claude Opus 4.8 with key analytic computations and ideas, including the arguments in Proposition 4.56 and Lemma 4.64 that he identifies as essential to the six-ended result.
- Wiygul’s saddle-tower index and nullity formulasAI attribution and proof provenance
Importance
The formulas give the exact index and bounded nullity in two infinite families of periodic quotients. The six-ended case ties changes in nullity to a single spectral threshold.
Technical verification
Wiygul reports statement comparison and acceptance by Lean and NanoDa for the five selected declarations, including both index and nullity formulas and the certified bounds on the threshold.
Possible mismatch: The KarcherIndex documentation says that Theorem 1.1(v) in the preprint should include the endpoint in its checkerboard containment statement. The checked index and nullity claims use the constructed realizations.
Formal checking
Wiygul reports statement comparison and acceptance by Lean and NanoDa for the five selected declarations, including both index and nullity formulas and the certified bounds on the threshold.
- Checker
- Lean 4 and NanoDa, reported by the KarcherIndex project
- Scope
- For the constructed Karcher towers with ends and two periods, the index is and the bounded nullity is 3 for every . For the six-ended tower with periods, the index is . The bounded nullity is 7 when is an integer and 3 otherwise, with one threshold for all positive integers .
- Basis
- Reported by the linked checker
Human understanding
Wiygul explains how symmetry and the Dirichlet-to-Neumann map reduce the index and nullity calculations to Fourier analysis on the circle. He describes which spectral modes contribute at each phase.
Correction and publication history
New curated result with documented central AI work and a scoped checking assessment.
Read this published revision