Refutations of accepted claims

Counterexamples and refutations with reproducible verification in Lean 4. For each one, I couldn't find a previously existing solution on the internet.

Restricted Bell polynomial real-rootedness (n = 800, m = 5)

Moll–Ramírez–Villamizar Conjecture 6.4 (2017) · arXiv:1707.08138 · Journal of Combinatorics 9 (2018), Conjecture 6.2

The restricted Bell polynomial B₈₀₀,≤₅ has a nonreal complex zero, refuting Conjecture 6.4 of Moll–Ramírez–Villamizar (2017). The explicit counterexample is verified in Lean from the finite-set-partition definition.

Verification: Lean, kernel-checked; standard axioms only. Lean 4.28.0 and Mathlib v4.28.0; the unconditional theorem starts from bounded finite partitions. The 13 audited declarations use only propext, Classical.choice, and Quot.sound; no native_decide.

Details and verification · GitHub repository

Sra's six-matrix trace inequality (Δ₆ > 0)

MathOverflow 263833 (S. Sra, 2017) · arXiv:2608.29595, Problem 8.1 and Appendix E

Six explicit rational 3×3 positive definite matrices give Δ₆ ≈ −99.97 < 0, so the six-matrix trace consequence of Sra's quantum coupon collector conjecture fails. The underlying conjecture was already refuted by Sra, and this failure follows from his Theorem 8.4 by a short argument.

Verification: Lean, kernel-checked; standard axioms only. Lean 4.35.0 with Mathlib v4.35.0; all 18 audited declarations depend only on propext, Classical.choice, and Quot.sound, and the proof is replayed by Lean's kernel checker and the independent nanoda checker.

Prior work: Earlier refutations are known; see the entry.

Details and verification · GitHub repository