What was already known
Jack Allsop, Candida Bowtell, Thomas Lesgourgues and Kalina Petrova proved the threshold for balanced K₃-divisible tripartite graphs with minimum partite degree at least . Their paper uses numerical minimization for this positivity test and credits ChatGPT 5.6 only with improving the original numerical-verification code.
AI involvement
Claude Opus 5.5 wrote the Lean development under Juan Pablo Traverso Gianini’s direction and generated the exact rational subdivisions and coefficients with its Python script.
- Fractional triangle decompositions of dense tripartite graphs in Lean 4Fractional triangle decompositions of dense tripartite graphs in Lean 4
Importance
The certificate replaces the numerical positivity step in one published proof and preserves its fractional threshold.
Technical verification
Lean Comparator covers Proposition 4.4 and six other selected declarations. Lean verifies the generated coefficients exactly. The asymptotic partial Latin square transfer is outside the package.
Formal checking
Lean Comparator covers Proposition 4.4 and six other selected declarations. Lean verifies the generated coefficients exactly. The asymptotic partial Latin square transfer is outside the package.
- Checker
- Lean kernel and Comparator reported by Traverso Gianini
- Scope
- The two quartic positivity tests in Proposition 4.4. The separately reported seven-target comparison includes the fractional decomposition theorem, with .
- Basis
- Reported by the linked checker
- Certificate generation and proof provenanceCertificate generation and proof provenance
Human understanding
The sources document the proof and AI attribution. A human account of the certificate construction was not located.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision