Improved integrality of Donaldson–Thomas invariants of loop quivers (GKS Conjecture 1.3 for twist knots)
For the -loop quiver, the numerical Donaldson–Thomas invariants (Kontsevich–Soibelman/Reineke) satisfy for every prime , with exact defects at : and , and these bounds are attained. Hence the optimal integer with for all is exactly . Via the identification of twist-knot extremal BPS invariants with loop-quiver DT invariants, this proves the Improved Integrality Conjecture (Garoufalidis–Kucharski–Sułkowski 2015, Conj. 1.3, an observation they credit to Kontsevich) for all twist knots with optimal constants, reproducing all twelve values GKS tabulated empirically. Supporting new results: a derivative theorem for Gaussian binomials at roots of unity, the first -supercongruence for DT invariants (), an exact necklace formula for the quantized invariants, and a self-contained proof of the signed Kazandzidis supercongruence.
- Result
- Proved(see note)
- Status
- Partial result
- AI contribution
- AI-discovered
- Method
- Argument
- Field
- Arithmetic of Donaldson–Thomas / BPS invariants
- Posed by
- S. Garoufalidis, P. Kucharski, P. Sułkowski
- Year posed
- 2015
- Years open
- 11y
- Solved
- 2026-07-31
- Model
- Claude Fable 5
- Vendor
- Anthropic
- Collaborators
- —
- Verification
- Unreviewed
- Publication
- Announced
- Significance
- 14 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
The sharp valuation bounds and optimal are proved for ALL loop quivers , hence for the extremal BPS invariants of all twist knots (both rows, matching every twist-knot entry of GKS Table 1). Scope limits: the /figure-eight divisibility was previously proved by Basor–Conrey–Morrison (arXiv:1703.00990), whose per- -adic characterization for is finer than the uniform bound; the torus-knot case of GKS Conj. 1.3 (multi-vertex quivers, growing with the knot) remains open and is not claimed; the general-knot conjecture remains open. The Lean formalization covers the reduction to the classical Kazandzidis congruences, not those congruences themselves.
What the AI did
The model ran the project end to end under human direction in a single supervised session: identified the open conjecture from literature reconnaissance, built two structurally independent exact-arithmetic implementations of the refined DT invariants, mined the divisibility patterns, found and wrote complete proofs (Reineke's formula + Jacobsthal–Kazandzidis supercongruences, including a new self-contained proof of the signed case), wrote the paper, and produced a partial Lean 4/Mathlib formalization (no sorries; reduction to the classical congruence inputs machine-checked, sharpness and the combinatorial core unconditional). An independent AI referee agent (same model family, adversarial prompt) failed the first draft over a scope overclaim and missing prior art (Basor–Conrey–Morrison 2017 had the case), which were fixed before this announcement.
Verification
No independent human review, and the repository says so itself. Evidence in the repo: two structurally independent implementations (plethystic CoHA engine vs. direct cyclic-word enumeration) agreeing on all computed invariants; Theorem 1 checked numerically for , and the Kazandzidis inputs to with sharpness; and a two-round adversarial AI referee report, which is author-side and does not count as independent verification here.
The Lean was read here on 24 August 2026 rather than taken on trust. Dtformal.lean carries no sorry, no admit, no native_decide and no axiom declarations whatsoever, on Lean 4.33.0. The classical Kazandzidis congruences enter as explicit hypotheses (`KazOdd`, `Kaz2`) rather than as axioms, and those definitions are faithful to the real congruences - `KazOdd` is , and `Kaz2` carries the sign the case needs - so the conditional theorems are substantive rather than vacuous. `sharp_two`, `sharp_three` and `orbit_sum_zero` take no such hypothesis, matching the claim that sharpness and the combinatorial core are unconditional. Lean was not compiled here, and the output of AxiomCheck.lean is not committed to the repository.
Sources
Submitted by fruppyz on