/- Copyright 2026 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import FormalConjecturesUtil

Butson-type Hadamard matrices

A Butson-type Hadamard matrix $H(k, n)$ (also written $\operatorname{BH}(n, k)$) is an $n \times n$ complex matrix $M$ whose entries are $k$-th roots of unity ($k > 0$, $M_{ij}^k = 1$) and whose rows are mutually orthogonal in $\mathbb{C}^n$, so that $M M^* = n I_n$. At $k = 2$, $H(2, n)$ recovers real Hadamard matrices; at $k = 4$, $H(4, n)$ consists of matrices with entries in ${\pm 1, \pm i}$.

While the Wikipedia article states as a conjecture that $H(p, m p)$ exists for every odd prime $p \ge 3$ and integer $m \ge 1$, this fails already at $H(3, 15)$ [dL84, Wi00]. For fourth roots of unity ($k = 4$), the complex Hadamard conjecture [Tu70, dLF11] asks whether $H(4, 2m)$ exists for every $m \ge 1$.

References:

    Wikipedia

    [Bu62] Butson, A. T. (1962). Generalized Hadamard matrices, Proc. Amer. Math. Soc. 13, 894--898.

    [Tu70] Turyn, R. J. (1970). Complex Hadamard matrices, in Combinatorial Structures and their Applications (Calgary, 1969), Gordon and Breach, New York, 435--437.

    [dL84] de Launey, W. (1984). On the non-existence of generalised Hadamard matrices, J. Statist. Plann. Inference 10 (3), 385--396.

    [Wi00] Winterhof, A. (2000). On the non-existence of generalized Hadamard matrices, J. Statist. Plann. Inference 84, 337--342.

    [dLF11] de Launey, W. and Flannery, D. L. (2011). Algebraic Design Theory, Mathematical Surveys and Monographs 175, Amer. Math. Soc.

@[expose] public sectionnamespace ButsonHadamardMatrix

M is a Butson-type Hadamard matrix $H(k, n)$ if $k > 0$, every entry satisfies $z^k = 1$, and $M M^* = n I_n$.

def IsButsonHadamard {n : ℕ} (k : ℕ) (M : Matrix (Fin n) (Fin n) ℂ) : Prop := 0 < k ∧ (∀ i j, M i j ^ k = 1) ∧ M * M.conjTranspose = (n : ℂ) • 1

If $k \mid k'$ and $k' > 0$, then every Butson-type Hadamard matrix $H(k, n)$ is also an $H(k', n)$ matrix.

All goals completed! 🐙, hM.2.2⟩

No matrix satisfies IsButsonHadamard 0, since $k > 0$ is required.

@[category test, AMS 5 15] theorem not_isButsonHadamard_zero {n : ℕ} (M : Matrix (Fin n) (Fin n) ℂ) : ¬ IsButsonHadamard 0 M := fun h => Nat.lt_irrefl 0 h.1

The $2 \times 2$ Sylvester matrix $\begin{pmatrix} 1 & 1 \ 1 & -1 \end{pmatrix}$ realizes both $H(2, 2)$ and $H(4, 2)$.

@[category test, AMS 5 15] theorem exists_isButsonHadamard_four_two : ∃ M, IsButsonHadamard (n := 2) 4 M := ⊢ ∃ M, IsButsonHadamard 4 M refine ⟨!![(1 : ℂ), 1; 1, -1], ⊢ 0 < 4 All goals completed! 🐙, fun i j => ?_, ?_⟩ i:Fin 2j:Fin 2⊢ !![1, 1; 1, -1] i j ^ 4 = 1 j:Fin 2⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) j ^ 4 = 1j:Fin 2⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) j ^ 4 = 1 j:Fin 2⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) j ^ 4 = 1j:Fin 2⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) j ^ 4 = 1 ⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) ^ 4 = 1⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) ^ 4 = 1 ⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) ^ 4 = 1⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) ^ 4 = 1⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) ^ 4 = 1⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) ^ 4 = 1 All goals completed! 🐙 ⊢ !![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose = ↑2 • 1 i:Fin 2j:Fin 2⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose) i j = (↑2 • 1) i j j:Fin 2⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose) ((fun i ↦ i) ⟨0, ⋯⟩) j = (↑2 • 1) ((fun i ↦ i) ⟨0, ⋯⟩) jj:Fin 2⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose) ((fun i ↦ i) ⟨1, ⋯⟩) j = (↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) j j:Fin 2⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose) ((fun i ↦ i) ⟨0, ⋯⟩) j = (↑2 • 1) ((fun i ↦ i) ⟨0, ⋯⟩) jj:Fin 2⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose) ((fun i ↦ i) ⟨1, ⋯⟩) j = (↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) j ⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = (↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = (↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) ⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose) ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = (↑2 • 1) ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose) ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = (↑2 • 1) ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = (↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].conjTranspose) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = (↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) ⊢ 1 + 1 = 2 ⊢ 1 + 1 = 2⊢ 1 + 1 = 2 All goals completed! 🐙

No $H(2, 3)$ (real $3 \times 3$ Hadamard matrix) exists because two rows in ${\pm 1}^3$ cannot be orthogonal.

M:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + -1 * star (-1) + -1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = -1⊢ False M:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + 1 * star 1 + 1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + 1 * star 1 + 1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + 1 * star 1 + -1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + 1 * star 1 + -1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + 1 * star (-1) + 1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + 1 * star (-1) + 1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + 1 * star (-1) + -1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + 1 * star (-1) + -1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + -1 * star 1 + 1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + -1 * star 1 + 1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + -1 * star 1 + -1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + -1 * star 1 + -1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + -1 * star (-1) + 1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + -1 * star (-1) + 1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + -1 * star (-1) + -1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star 1 + -1 * star (-1) + -1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + 1 * star 1 + 1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + 1 * star 1 + 1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + 1 * star 1 + -1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + 1 * star 1 + -1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + 1 * star (-1) + 1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + 1 * star (-1) + 1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + 1 * star (-1) + -1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + 1 * star (-1) + -1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + -1 * star 1 + 1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + -1 * star 1 + 1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + -1 * star 1 + -1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + -1 * star 1 + -1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + -1 * star (-1) + 1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + -1 * star (-1) + 1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + -1 * star (-1) + -1 * star 1 = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:1 * star (-1) + -1 * star (-1) + -1 * star (-1) = 0a0:M 0 0 = 1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + 1 * star 1 + 1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + 1 * star 1 + 1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + 1 * star 1 + -1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + 1 * star 1 + -1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + 1 * star (-1) + 1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + 1 * star (-1) + 1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + 1 * star (-1) + -1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + 1 * star (-1) + -1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + -1 * star 1 + 1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + -1 * star 1 + 1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + -1 * star 1 + -1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + -1 * star 1 + -1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + -1 * star (-1) + 1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + -1 * star (-1) + 1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + -1 * star (-1) + -1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star 1 + -1 * star (-1) + -1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = 1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + 1 * star 1 + 1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + 1 * star 1 + 1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + 1 * star 1 + -1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + 1 * star 1 + -1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + 1 * star (-1) + 1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + 1 * star (-1) + 1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + 1 * star (-1) + -1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + 1 * star (-1) + -1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = 1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + -1 * star 1 + 1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + -1 * star 1 + 1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + -1 * star 1 + -1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + -1 * star 1 + -1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = 1a2:M 0 2 = -1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + -1 * star (-1) + 1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + -1 * star (-1) + 1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = 1b2:M 1 2 = -1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + -1 * star (-1) + -1 * star 1 = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = 1⊢ FalseM:Matrix (Fin 3) (Fin 3) ℂleft✝:0 < 2hpow:∀ (i j : Fin 3), M i j ^ 2 = 1horth:M * M.conjTranspose = ↑3 • 1hentry:∀ (i j : Fin 3), M i j = 1 ∨ M i j = -1hrow01:-1 * star (-1) + -1 * star (-1) + -1 * star (-1) = 0a0:M 0 0 = -1b0:M 1 0 = -1a1:M 0 1 = -1b1:M 1 1 = -1a2:M 0 2 = -1b2:M 1 2 = -1⊢ False All goals completed! 🐙

Butson's prime divisibility theorem [Bu62]: if $p$ is prime, $n \ge 2$, and a Butson-type Hadamard matrix $H(p, n)$ exists, then $p \mid n$.

The hypothesis $n \ge 2$ excludes the trivial $1 \times 1$ matrix $[1]$, which satisfies $H(p, 1)$ for every $p \ge 1$.

@[category research solved, AMS 5 15] theorem butson_prime_divisibility {p n : ℕ} (hp : p.Prime) (hn : 2 ≤ n) (hex : ∃ M, IsButsonHadamard (n := n) p M) : p ∣ n := p:ℕn:ℕhp:Nat.Prime phn:2 ≤ nhex:∃ M, IsButsonHadamard p M⊢ p ∣ n All goals completed! 🐙

Disproof of the odd-prime-multiple existence claim [dL84, Wi00]: contrary to the conjecture stated on Wikipedia, it is not true that a Butson-type Hadamard matrix $H(p, m p)$ exists for every odd prime $p \ge 3$ and every positive integer $m \ge 1$ (for instance, no $H(3, 15)$ matrix exists).

@[category research solved, AMS 5 15] theorem not_forall_odd_prime_mul_exists : ¬ ∀ (p m : ℕ), p.Prime → 3 ≤ p → 1 ≤ m → ∃ M, IsButsonHadamard (n := m * p) p M := ⊢ ¬∀ (p m : ℕ), Nat.Prime p → 3 ≤ p → 1 ≤ m → ∃ M, IsButsonHadamard p M All goals completed! 🐙

Complex Hadamard conjecture for fourth roots of unity [Tu70, dLF11]: for every integer $m \ge 1$, there exists a $2m \times 2m$ Butson-type Hadamard matrix $H(4, 2m)$ with entries in ${1, -1, i, -i}$.

This quaternary conjecture comes from [Tu70, dLF11] (rather than the Wikipedia page above). By Turyn's doubling construction [Tu70], an $H(4, 2m)$ matrix yields a real Hadamard matrix $H(2, 4m)$, so this conjecture implies Hadamard's conjecture.

@[category research open, AMS 5 15] theorem butson_hadamard_fourth_roots_conjecture (m : ℕ) (hm : 1 ≤ m) : ∃ M, IsButsonHadamard (n := 2 * m) 4 M := m:ℕhm:1 ≤ m⊢ ∃ M, IsButsonHadamard 4 M All goals completed! 🐙end ButsonHadamardMatrix