alon_tarsi_conjecture
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Alon–Tarsi conjecture (1992): For even n, the number of even n×n Latin squares ≠ odd n×n Latin squares. Equivalently, #ELS(n) ≠ #OLS(n). Proved for n = p, p+1 (prime p). Open in general.
Why this node was retired
The posted statement is
import Mathlib
theorem alon_tarsi_conjecture (n : ℕ) (hn : 2 ≤ n) (hodd : ¬ 2 ∣ n) :
let even_count := ((Finset.univ (α := Equiv.Perm (Fin n))).filter
(fun sigma => Equiv.Perm.sign sigma = 1)).card
let odd_count := ((Finset.univ (α := Equiv.Perm (Fin n))).filter
(fun sigma => Equiv.Perm.sign sigma = -1)).card
even_count ≠ odd_count := by
sorry
It counts signed permutations, not Latin squares, and assumes odd n rather than even n.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
For positive even n, count n×n Latin squares by the product of row/column permutation signs and ask that the two parities have different counts.
Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.
import Mathlib
import Mathlib
theorem alon_tarsi_conjecture (n : ℕ) (hn : 2 ≤ n) (hodd : ¬ 2 ∣ n) :
let even_count := ((Finset.univ (α := Equiv.Perm (Fin n))).filter
(fun sigma => Equiv.Perm.sign sigma = 1)).card
let odd_count := ((Finset.univ (α := Equiv.Perm (Fin n))).filter
(fun sigma => Equiv.Perm.sign sigma = -1)).card
even_count ≠ odd_count := by
sorry