Tensor products preserve the Hadamard determinant equality
ProvedHadamard.tensor_product_existscombinatoricshadamard-matriceslinear-algebra
Let be natural numbers and let and be real sign matrices of orders and . Suppose
Then there exists a real sign matrix of order with
Both zero orders are allowed, with the empty determinant and interpreted as . This is the multiplicative closure principle for the determinant formulation of Hadamard matrices, reusable for tensor constructions and order reductions.
Preamble
import Mathlib.LinearAlgebra.Matrix.Kronecker import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Logic.Equiv.Fin.Basic import Mathlib.Tactic.Ring open scoped Kronecker
Formal statement
theorem Hadamard.tensor_product_exists (n m : ℕ)
(A : Matrix (Fin n) (Fin n) ℝ) (B : Matrix (Fin m) (Fin m) ℝ)
(hA : ∀ i j, A i j ∈ ({1, -1} : Finset ℝ))
(hB : ∀ i j, B i j ∈ ({1, -1} : Finset ℝ))
(hdA : |A.det| = (n : ℝ) ^ ((n : ℝ) / 2))
(hdB : |B.det| = (m : ℝ) ^ ((m : ℝ) / 2)) :
∃ C : Matrix (Fin (n * m)) (Fin (n * m)) ℝ,
(∀ i j, C i j ∈ ({1, -1} : Finset ℝ)) ∧
|C.det| = ((n * m : ℕ) : ℝ) ^ (((n * m : ℕ) : ℝ) / 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.