The Lattice Triangle Problem in the Hard Obtuse Window
Statement
The lattice triangle problem asks which rational triangles unfold to Veech surfaces; in the hard obtuse window it is conjectured that none do. Via an arithmetic reformulation of the Mirzakhani-Wright rank obstruction, the paper rules out all but a density-0 subset of triangles in that window.
Record
- Source
- Added
Comments
No person has examined this. Everything below was judged by machines. say whether it holds →
proof attempt · #1
David Kurniadi Angdinata, Evan Chen, Ken Ono, Jiaxin Zhang and Jujian Zhang, using AxiomProverThat credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.
"The main engine in this paper (Theorem 6.1) was autoformalized by AxiomProver in Lean (using mathlib)" - a test case for the autonomous system, with the protocol and artifacts documented in their own section.
A density-1 obstruction, not a full resolution: the conjecture that the hard window contains no lattice triangles remains open on a density-0 set.
Machine-checked by Lean on #1 · not a person
lean: partially checkedLeanscope Lean formalization of the core argument; statement correspondence not independently audited
The paper's main engine is autoformalized and kernel-checked in Lean by AxiomProver; the surrounding derivations are informal, and no independent review has appeared. Tier: the main engine was autoformalized by AxiomProver itself; the informal-to-formal correspondence is author-audited only.
Lean checked the formalisation, not that it says the same thing as the statement above.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.