Jump to main content
Circulant Hadamard

Why We Can Divide

Full overview · Why We Can Divide
Show the proof map

The odd norm makes every evaluated polynomial invertible before reduction.

Lemma (Division survives reduction). Let be odd. In

every subset-root evaluation of is a unit. The quotient is nonzero of characteristic two, and these evaluated values remain invertible in it.

A ring for all the evaluations

Let be the distinct primes dividing the odd integer , with the roots chosen in Node 4. Put

The ring allows division by powers of . For , write and ; define in the same way. The empty product is .

The norm identities give

Consequently every is a unit of , with the explicit inverse

This justifies division by before taking any congruence. For , the ring is , and the inverse is .

Reduction is nonzero and has characteristic two

We reduce modulo the ideal . Since , the resulting ring has . We must also know that it has .

Powers of the generating roots reduce to finitely many monomials, which span over . Also has no additive torsion. It is therefore a nonzero free abelian group of finite rank, so . Choose a maximal ideal of containing . In its residue field, forces . Thus . The odd integer has residue , so .

Therefore remains a proper ideal after adjoining , and contains . This proves that is a nonzero ring of characteristic two. We do not need it to be a field or a domain.

Output. All the required denominators are units, and reduction takes place in one nonzero ring of characteristic two. Algebraic congruence here has no meaning of geometric closeness on the complex circle.

Source: the paper, Section 4, the local-ring setup before equation (4.3). The paper works in a localization at one maximal ideal above ; adjoining gives the common ring used in this exposition.

Back to Odd-Order Rigidity