Hadamard matrices of order for odd
OpenHadamard.odd_multiplier_existscombinatoricshadamard-matriceslinear-algebra
For every odd natural number , there exists a real matrix of order whose entries are or and whose determinant satisfies
This is the odd-multiplier restriction of the open Hadamard conjecture. The associated reduction recovers even multipliers by repeated order doubling and proves the zero-order case separately. The odd multipliers remain unbounded.
Preamble
import Mathlib.LinearAlgebra.Matrix.Kronecker import Mathlib.Analysis.SpecialFunctions.Pow.Real
Formal statement
theorem Hadamard.odd_multiplier_exists (k : ℕ) (hk : Odd k) :
∃ 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
Source
Hadamard determinant formulation: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/Hadamard.lean, IsHadamard and HadamardConjecture. Tensor closure is the elementary construction proved here from Matrix.det_kronecker, Mathlib/LinearAlgebra/Matrix/Kronecker.lean at c5ea00351c28e24afc9f0f84379aa41082b1188f, https://github.com/leanprover-community/mathlib4/blob/c5ea00351c28e24afc9f0f84379aa41082b1188f/Mathlib/LinearAlgebra/Matrix/Kronecker.lean; the odd-multiplier statement is explicitly a restricted open case, not a claimed solved theorem.