Hadamard conjecture, residual case after Sylvester and Paley over all finite fields
OpenHadamard_Conjecture_residual3This is the residual case of the Hadamard conjecture left open after removing everything reachable by Sylvester's doubling construction and by Paley's two constructions over arbitrary finite fields.
For a natural number satisfying both:
- is not a power of two, and
- there is no prime power () and with either and , or and ,
the claim is that there still exists a matrix with every entry or attaining Hadamard's determinant bound .
This is the honest remainder after the classical Sylvester and Paley families — now taken over all finite fields, not just prime fields — have been subtracted out, each having been proved unconditionally (Hadamard_Conjecture_paley_primepower_case).
Where this frontier sits. The smallest satisfying both hypotheses is , i.e. order . This matches the historical record exactly: order was the first order not settled by the Sylvester and Paley constructions, and it was resolved only in 1962 by Baumert, Golomb and Hall using Williamson matrices found by computer search. Closing further cases therefore requires genuinely different constructions — Williamson matrices, Turyn's construction, Baumert–Hall arrays, and others — none of which, nor any known finite combination, is known to cover every remaining . This statement is exactly as open as the general Hadamard conjecture restricted to this 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_residual3 (k : ℕ)
(hk1 : ¬ ∃ m : ℕ, k = 2 ^ m)
(hk2 : ¬ ∃ p n t : ℕ, Nat.Prime p ∧ 0 < n ∧
((p ^ n % 4 = 3 ∧ 4 * k = (p ^ n + 1) * 2 ^ t) ∨
(p ^ n % 4 = 1 ∧ 4 * k = (2 * (p ^ n + 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