/-
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 FormalConjecturesUtilWeighing matrices and the Geramita–Seberry conjecture
A weighing matrix $W(n, w)$ of order $n$ and weight $w$ is an $n \times n$ matrix with entries in ${-1, 0, 1}$ satisfying $W W^{\mathsf{T}} = w I_n$. At $w = n$, this recovers Hadamard matrices.
References:
[Ea76] Eades, P. (1976). Some asymptotic existence results for orthogonal designs, Ars Combin. 1, 109--118.
[GS79] Geramita, A. V. and Seberry, J. (1979). Orthogonal Designs: Quadratic Forms and Hadamard Matrices, Lecture Notes in Pure and Applied Mathematics 45, Marcel Dekker, New York.
@[expose] public sectionnamespace WeighingMatrix
W is a weighing matrix $W(n, w)$ of order $n$ and weight $w$ if its entries lie in
${-1, 0, 1}$ and $W W^{\mathsf{T}} = w I_n$.
At $n = 0$, Matrix (Fin 0) (Fin 0) ℤ is a subsingleton, so the empty matrix trivially satisfies
IsWeighingMatrix (n := 0) w 0 for every $w$; existence statements below restrict to $n \ge 1$.
def IsWeighingMatrix {n : ℕ} (w : ℕ) (W : Matrix (Fin n) (Fin n) ℤ) : Prop :=
(∀ i j, W i j = -1 ∨ W i j = 0 ∨ W i j = 1) ∧
W * W.transpose = (w : ℤ) • 1For every order $n$, the zero matrix is a weighing matrix $W(n, 0)$ of weight $0$.
@[category API, AMS 5 15]
theorem isWeighingMatrix_zero (n : ℕ) : IsWeighingMatrix (n := n) 0 0 :=
⟨fun _ _ => .inr (.inl rfl), n:ℕ⊢ 0 * Matrix.transpose 0 = ↑0 • 1 All goals completed! 🐙⟩For every order $n$, the identity matrix is a weighing matrix $W(n, 1)$ of weight $1$.
@[category API, AMS 5 15]
theorem isWeighingMatrix_one (n : ℕ) : IsWeighingMatrix (n := n) 1 1 := n:ℕ⊢ IsWeighingMatrix 1 1
refine ⟨fun i j => ?_, n:ℕ⊢ 1 * Matrix.transpose 1 = ↑1 • 1 All goals completed! 🐙⟩
n:ℕi:Fin nj:Fin nhij:i = j⊢ 1 i j = -1 ∨ 1 i j = 0 ∨ 1 i j = 1n:ℕi:Fin nj:Fin nhij:¬i = j⊢ 1 i j = -1 ∨ 1 i j = 0 ∨ 1 i j = 1 n:ℕi:Fin nj:Fin nhij:i = j⊢ 1 i j = -1 ∨ 1 i j = 0 ∨ 1 i j = 1n:ℕi:Fin nj:Fin nhij:¬i = j⊢ 1 i j = -1 ∨ 1 i j = 0 ∨ 1 i j = 1 All goals completed! 🐙Negating a weighing matrix $W(n, w)$ yields a weighing matrix of the same order and weight.
All goals completed! 🐙The $2 \times 2$ Sylvester matrix $\begin{pmatrix} 1 & 1 \ 1 & -1 \end{pmatrix}$ is a weighing matrix $W(2, 2)$.
@[category test, AMS 5 15]
theorem isWeighingMatrix_two_two : IsWeighingMatrix (n := 2) 2 !![1, 1; 1, -1] := by ⊢ IsWeighingMatrix 2 !![1, 1; 1, -1]
refine ⟨fun i j => ?_, ?_⟩ refine_1 i:Fin 2j:Fin 2⊢ !![1, 1; 1, -1] i j = -1 ∨ !![1, 1; 1, -1] i j = 0 ∨ !![1, 1; 1, -1] i j = 1refine_2 ⊢ !![1, 1; 1, -1] * !![1, 1; 1, -1].transpose = ↑2 • 1
· refine_1 i:Fin 2j:Fin 2⊢ !![1, 1; 1, -1] i j = -1 ∨ !![1, 1; 1, -1] i j = 0 ∨ !![1, 1; 1, -1] i j = 1 fin_cases i refine_1.«0» j:Fin 2⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) j = -1 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) j = 0 ∨ !![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) j = 1refine_1.«1» j:Fin 2⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) j = -1 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) j = 0 ∨ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) j = 1 <;> refine_1.«0» j:Fin 2⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) j = -1 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) j = 0 ∨ !![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) j = 1refine_1.«1» j:Fin 2⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) j = -1 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) j = 0 ∨ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) j = 1 fin_cases j refine_1.«1».«0» ⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = -1 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = 0 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = 1refine_1.«1».«1» ⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = -1 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = 0 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = 1 <;> refine_1.«0».«0» ⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = -1 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = 0 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = 1refine_1.«0».«1» ⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = -1 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = 0 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = 1refine_1.«1».«0» ⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = -1 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = 0 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) = 1refine_1.«1».«1» ⊢ !![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = -1 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = 0 ∨
!![1, 1; 1, -1] ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) = 1 decide All goals completed! 🐙
· refine_2 ⊢ !![1, 1; 1, -1] * !![1, 1; 1, -1].transpose = ↑2 • 1 ext i j refine_2 i:Fin 2j:Fin 2⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].transpose) i j = (↑2 • 1) i j
fin_cases i refine_2.«0» j:Fin 2⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].transpose) ((fun i ↦ i) ⟨0, ⋯⟩) j = (↑2 • 1) ((fun i ↦ i) ⟨0, ⋯⟩) jrefine_2.«1» j:Fin 2⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].transpose) ((fun i ↦ i) ⟨1, ⋯⟩) j = (↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) j <;> refine_2.«0» j:Fin 2⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].transpose) ((fun i ↦ i) ⟨0, ⋯⟩) j = (↑2 • 1) ((fun i ↦ i) ⟨0, ⋯⟩) jrefine_2.«1» j:Fin 2⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].transpose) ((fun i ↦ i) ⟨1, ⋯⟩) j = (↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) j fin_cases j refine_2.«1».«0» ⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].transpose) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) =
(↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)refine_2.«1».«1» ⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].transpose) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) =
(↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) <;> refine_2.«0».«0» ⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].transpose) ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) =
(↑2 • 1) ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)refine_2.«0».«1» ⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].transpose) ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) =
(↑2 • 1) ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)refine_2.«1».«0» ⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].transpose) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩) =
(↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)refine_2.«1».«1» ⊢ (!![1, 1; 1, -1] * !![1, 1; 1, -1].transpose) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) =
(↑2 • 1) ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩) decide All goals completed! 🐙No weighing matrix $W(2, 3)$ exists because each row of length $2$ over ${-1, 0, 1}$ has squared norm at most $2$.
@[category test, AMS 5 15]
theorem not_exists_isWeighingMatrix_two_three : ¬ ∃ W, IsWeighingMatrix (n := 2) 3 W := by ⊢ ¬∃ W, IsWeighingMatrix 3 W
rintro ⟨W, hent, hmul⟩ W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1⊢ False
have h00 := congrArg (fun M => M 0 0) hmul W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:(W * W.transpose) 0 0 = (↑3 • 1) 0 0⊢ False
simp [Matrix.mul_apply, Fin.sum_univ_two] at h00 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3⊢ False
have hsq0 : W 0 0 * W 0 0 ≤ 1 := by ⊢ ¬∃ W, IsWeighingMatrix 3 W W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1⊢ False
rcases hent 0 0 with h | h | h inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = -1⊢ W 0 0 * W 0 0 ≤ 1inr.inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = 0⊢ W 0 0 * W 0 0 ≤ 1inr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = 1⊢ W 0 0 * W 0 0 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1⊢ False <;> inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = -1⊢ W 0 0 * W 0 0 ≤ 1inr.inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = 0⊢ W 0 0 * W 0 0 ≤ 1inr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = 1⊢ W 0 0 * W 0 0 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1⊢ False rw [h inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = -1⊢ -1 * -1 ≤ 1 inr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = 1⊢ 1 * 1 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1⊢ False] inr.inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = 0⊢ 0 * 0 ≤ 1inr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = 1⊢ 1 * 1 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1⊢ Falseinr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = 1⊢ 1 * 1 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1⊢ False <;> inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = -1⊢ -1 * -1 ≤ 1inr.inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = 0⊢ 0 * 0 ≤ 1inr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3h:W 0 0 = 1⊢ 1 * 1 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1⊢ False norm_num W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1⊢ False W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1⊢ False
have hsq1 : W 0 1 * W 0 1 ≤ 1 := by ⊢ ¬∃ W, IsWeighingMatrix 3 W W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1hsq1:W 0 1 * W 0 1 ≤ 1⊢ False
rcases hent 0 1 with h | h | h inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = -1⊢ W 0 1 * W 0 1 ≤ 1inr.inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = 0⊢ W 0 1 * W 0 1 ≤ 1inr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = 1⊢ W 0 1 * W 0 1 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1hsq1:W 0 1 * W 0 1 ≤ 1⊢ False <;> inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = -1⊢ W 0 1 * W 0 1 ≤ 1inr.inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = 0⊢ W 0 1 * W 0 1 ≤ 1inr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = 1⊢ W 0 1 * W 0 1 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1hsq1:W 0 1 * W 0 1 ≤ 1⊢ False rw [h inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = -1⊢ -1 * -1 ≤ 1 inr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = 1⊢ 1 * 1 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1hsq1:W 0 1 * W 0 1 ≤ 1⊢ False] inr.inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = 0⊢ 0 * 0 ≤ 1inr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = 1⊢ 1 * 1 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1hsq1:W 0 1 * W 0 1 ≤ 1⊢ Falseinr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = 1⊢ 1 * 1 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1hsq1:W 0 1 * W 0 1 ≤ 1⊢ False <;> inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = -1⊢ -1 * -1 ≤ 1inr.inl W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = 0⊢ 0 * 0 ≤ 1inr.inr W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1h:W 0 1 = 1⊢ 1 * 1 ≤ 1 W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1hsq1:W 0 1 * W 0 1 ≤ 1⊢ False norm_num W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1hsq1:W 0 1 * W 0 1 ≤ 1⊢ False W:Matrix (Fin 2) (Fin 2) ℤhent:∀ (i j : Fin 2), W i j = -1 ∨ W i j = 0 ∨ W i j = 1hmul:W * W.transpose = ↑3 • 1h00:W 0 0 * W 0 0 + W 0 1 * W 0 1 = 3hsq0:W 0 0 * W 0 0 ≤ 1hsq1:W 0 1 * W 0 1 ≤ 1⊢ False
linarith All goals completed! 🐙Weighing matrix conjecture (Wallis 1972; Geramita–Seberry [GS79]): for every positive integer $m \ge 1$ and every weight $0 \le w \le 4m$, there exists a weighing matrix $W(4m, w)$ of order $4m$ and weight $w$.
At $w = 4m$, this specializes to Hadamard's conjecture.
@[category research open, AMS 5 15]
theorem weighing_matrix_conjecture (m w : ℕ) (hm : 1 ≤ m) (hw : w ≤ 4 * m) :
∃ W, IsWeighingMatrix (n := 4 * m) w W := by m:ℕw:ℕhm:1 ≤ mhw:w ≤ 4 * m⊢ ∃ W, IsWeighingMatrix w W
sorry All goals completed! 🐙Asymptotic existence of weighing matrices (Eades [Ea76]; Geramita–Seberry [GS79], Thm. 7.17): for every fixed weight $w$, a weighing matrix $W(4m, w)$ exists for all sufficiently large multiples $4m$.
@[category research solved, AMS 5 15]
theorem weighing_matrix_conjecture.variants.asymptotic (w : ℕ) :
∀ᶠ m in Filter.atTop, ∃ W, IsWeighingMatrix (n := 4 * m) w W := by w:ℕ⊢ ∀ᶠ (m : ℕ) in Filter.atTop, ∃ W, IsWeighingMatrix w W
sorry All goals completed! 🐙end WeighingMatrix