Hadamard conjecture, residual case after Sylvester and Paley
OpenHadamard_Conjecture_residualThis is the residual case of the Hadamard conjecture left open after removing both the Sylvester family and the Paley-times-power-of-two family.
For a natural number satisfying both:
- is not a power of two (there is no with ), and
- is not of the form for any prime and any natural number ,
the claim is that there still exists a matrix with every entry or attaining Hadamard's determinant bound .
This is the honest remainder of the conjecture after two classical, unconditionally-proved construction families (Hadamard_Conjecture_paley_sylvester_case, itself built from Sylvester's 1867 doubling construction and Paley's 1933 finite-field construction via the Kronecker-product multiplicativity theorem) have been subtracted out. Many further classical constructions exist in the literature (Paley's second construction for , Williamson matrices, Turyn's construction, and others), each covering additional orders not captured by hypothesis (2) above; none of them, nor any known finite combination, is known to cover every remaining . In particular the first genuinely difficult historical case, order (resolved only in 2004 by Kharaghani and Tayfeh-Rezaie via a dedicated non-generic construction), lies in this residual family. No proof of this statement for all such is known; it is exactly as open as the general Hadamard conjecture restricted to this shrinking family.
Formalization Note Matrix entries live in ; membership in is expressed as Finset membership. The determinant exponent is a real number via Real.rpow.
import Mathlib
theorem Hadamard_Conjecture_residual (k : ℕ)
(hk1 : ¬ ∃ m : ℕ, k = 2 ^ m)
(hk2 : ¬ ∃ q t : ℕ, Nat.Prime q ∧ q % 4 = 3 ∧ 4 * k = (q + 1) * 2 ^ t) :
∃ M : Matrix (Fin (4 * k)) (Fin (4 * k)) ℝ,
(∀ i j, M i j ∈ ({1, -1} : Finset ℝ)) ∧
|M.det| = ((4 * k : ℕ) : ℝ) ^ (((4 * k : ℕ) : ℝ) / 2) := by sorry