Jump to main content
Circulant Hadamard

An Odd Number of Ones at One

Full overview · An Odd Number of Ones at One
Show the proof map

At one the all-ones polynomial is u squared, and its denominator is plus or minus u.

Lemma (The value at one). Let be odd, let , and suppose satisfies . Then

The congruence is in the common evaluation ring with adjoined.

Every term becomes one

For an odd integer , the all-ones polynomial has terms:

At , every term equals . Consequently

Since is odd, is odd too. In the nonzero characteristic-two ring used in Node 6, an even number of ones sums to zero and an odd number sums to one. Thus .

Account for the denominator

The alternating sum contains , so we also need the value of . Node 3 gives

Because has real integer coefficients, . Evaluation at gives

Therefore, in the evaluation ring ,

Its residue modulo is : is odd, and minus equals plus in characteristic two. This is stronger than merely knowing that is nonzero. Node 6 also establishes that this denominator is a unit before and after reduction.

For , the calculation is , , and . Pairing the nine ones leaves one unpaired; after accounting for , the residue is still one.

Output. The empty-subset term has residue .

Source: the paper, equation (4.2) and the conclusion after equation (4.11). The real value makes the surviving residue explicit.

Back to The Final Contradiction