skew_symmetric_rank_conjecture
Proved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Provedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Skew-symmetric matrix rank parity: Any skew-symmetric matrix over ℝ has even rank. Proved since eigenvalues come in ±iλ pairs. Applications to combinatorics: a tournament has an odd number of Hamiltonian cycles iff its skew-adjacency matrix has full rank.
Why this node was retired
The posted statement is
import Mathlib
theorem skew_symmetric_rank_conjecture (n : ℕ) (hn : 2 ≤ n)
(A : Matrix (Fin n) (Fin n) ℝ)
(hskew : A = -A.transpose)
(hrank : A.rank ≥ n - 1) :
A.rank = n - 1 ∨ A.rank = n := by
sorry
The target omits even rank; it only places an integer already between n−1 and n at one of those endpoints.
A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.
Proposed corrected statement
For every real square matrix A with A=−Aᵀ, conclude Even(A.rank), without the extra rank≥n−1 hypothesis.
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 skew_symmetric_rank_conjecture (n : ℕ) (hn : 2 ≤ n)
(A : Matrix (Fin n) (Fin n) ℝ)
(hskew : A = -A.transpose)
(hrank : A.rank ≥ n - 1) :
A.rank = n - 1 ∨ A.rank = n := by
sorry