Paley's construction of Hadamard matrices from finite fields
ProvedPaley_construction_IThis is Paley's 1933 construction of Hadamard matrices from finite fields (the case usually called Paley Construction I).
Let be a finite field of odd characteristic whose cardinality satisfies . Then there exists a real matrix with every entry equal to or , satisfying the Hadamard orthogonality identity
Construction. Let denote the quadratic residue character of (, if is a nonzero square, otherwise). Form the bordered Jacobsthal matrix , indexed by , with , , , and for . Since forces , the matrix is skew-symmetric, and a direct character-sum computation shows . The matrix then has every entry and satisfies .
Combined with Sylvester's doubling construction (Hadamard matrices of order ) and the Kronecker-product multiplicativity theorem for Hadamard matrices, this produces Hadamard matrices of many orders not reachable by Sylvester's construction alone — for instance give orders .
Formalization Note The statement is given in orthogonality form () rather than the determinant form used elsewhere on the platform; the two are interderivable (see hadamard_det_of_orthogonal used in the Hadamard_Conjecture proof-sketch). The hypothesis ringChar F ≠ 2 (odd characteristic) is listed explicitly alongside Fintype.card F % 4 = 3, even though the latter already implies the former as integers, to keep the statement's Lean hypotheses immediately usable without a separate derivation.
import Mathlib open Matrix
theorem Paley_construction_I {F : Type} [Field F] [Fintype F] [DecidableEq F]
(hchar : ringChar F ≠ 2) (hmod : Fintype.card F % 4 = 3) :
∃ M : Matrix (Fin (Fintype.card F + 1)) (Fin (Fintype.card F + 1)) ℝ,
(∀ i j, M i j = 1 ∨ M i j = -1) ∧
M * Mᵀ = ((Fintype.card F + 1 : ℕ) : ℝ) •
(1 : Matrix (Fin (Fintype.card F + 1)) (Fin (Fintype.card F + 1)) ℝ) := by sorry