Fractional triangle decompositions of dense tripartite graphs in Lean 4

Juan Pablo Traverso Gianini

Traverso gives exact rational Bernstein certificates for the two quartic positivity tests in Proposition 4.4 at d=0.23105d = 0.23105. The certificates use 20 and 5 boxes, respectively, and recover the fractional triangle-decomposition bound at η=1/20000\eta = 1/20000.

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 (0.769−η)n(0.769-\eta )n. Their paper uses numerical minimization for this positivity test and credits ChatGPT 5.6 only with improving the original numerical-verification code.

AI involvement AI-centered

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.

Importance Modest

The certificate replaces the numerical positivity step in one published proof and preserves its fractional threshold.

Technical verification Formal (Lean)

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 η=1/20000\eta =1/20000.
Basis
Reported by the linked checker

Human understanding Few

The sources document the proof and AI attribution. A human account of the certificate construction was not located.

Correction and publication history