Jump to main content
Circulant Hadamard
Back to Proof map

The Final Contradiction

Full overview · The Final Contradiction
Show the proof map


8.1. The Nontrivial Roots Cancel the Ones

Lemma (Vanishing away from one). For and every nonempty subset of the distinct prime divisors of ,

The product root has order , which divides . Thus . Cancel the nonzero factor in characteristic zero. For , the nine terms make three copies of . These evaluations vanish exactly before any modular reduction.

Cut from the overview · 0:17–0:49


8.2. An Odd Number of Ones at One

Lemma (The value at one). The remaining evaluation satisfies

Each of the terms of becomes one. Because has real integer coefficients, the norm identity gives . This accounts for the denominator as well as the numerator. The integer is odd, and minus equals plus in characteristic two, so either sign of has residue . For , the quotient is .

Cut from the overview · 1:16–1:37


8.3. One Surviving Odd Term

Lemma (One surviving term). The coefficient congruence gives

Evaluation preserves coefficient congruences. Multiplication by the units then preserves them in the same evaluation ring used in Node 7. Every nonempty-subset numerator is zero. The empty subset has sign , evaluates at , and contributes , whose residue is one.

Cut from the overview · 0:49–1:37


8.4. The Two Residues Cannot Agree

Proposition (The contradiction). No circulant Hadamard matrix has order with odd: its polynomials would satisfy

Node 7 gives the first residue, and the all-ones evaluation gives the second. Both are in the same quotient of . Node 6 proves that this quotient is nonzero, so . The contradiction excludes every odd . The earlier Δ-theorem requires , so this argument does not exclude .

Cut from the overview · 1:37–1:55


8.5. Only orders 1 and 4

Theorem (Circulant Hadamard). A real circulant Hadamard matrix exists if and only if its order is or .

For , the order restriction gives with a positive odd integer. The contradiction leaves , hence . Order lies outside that restriction and has the example . At order , use the circulant matrix with first row . Any two distinct rows agree twice and disagree twice, so their inner product is zero; each row has squared length . The detailed statement displays and verifies both examples.

Cut from the overview · 1:55–2:42
Back to Proof map