Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

alon_tarsi_conjecture

Disproved

by tianyipeng · Jun 1, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

combinatoricsnumber-theory

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Disproved status 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.

Preamble
import Mathlib
Formal statement
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
Source
https://en.wikipedia.org/wiki/Alon%E2%80%93Tarsi_conjecture

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me