Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tensor products preserve the Hadamard determinant equality

Proved
Hadamard.tensor_product_exists

by Wenqian Xing · Sep 6, 2026 · Mathlib c5ea003 (Lean v4.30.0)

combinatoricshadamard-matriceslinear-algebra

Let n,mn,mn,m be natural numbers and let AAA and BBB be real sign matrices of orders nnn and mmm. Suppose

∣det⁡A∣=nn/2,∣det⁡B∣=mm/2.|\det A|=n^{n/2},\qquad |\det B|=m^{m/2}.∣detA∣=nn/2,∣detB∣=mm/2.

Then there exists a real sign matrix CCC of order nmnmnm with

∣det⁡C∣=(nm)nm/2.|\det C|=(nm)^{nm/2}.∣detC∣=(nm)nm/2.

Both zero orders are allowed, with the empty determinant and 000^000 interpreted as 111. 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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me