The Δ-theorem supplies odd order for each individual Δ-value.
If with odd, then
. The quotient therefore has odd order too.
For , the comparison is between the two inputs and :
, with the analogous expression
for . Both belong to . The sign branch
will provide their residue condition.
Every subset-root evaluation of is a unit, and
is a nonzero ring of characteristic two.
For , the evaluated norm identity gives
These inverse identities survive reduction. To see that reduction is
nonzero, put . The finite free
abelian group has . A maximal ideal above kills
but not odd , so its nonzero residue field is still a quotient
after adjoining . Thus is proper. For , the inverse
of an evaluation is its conjugate divided by .
Lemma (Residue-one comparisons). Every evaluated ratio
and has residue one.
Consequently .
Node 5 gives exact identities
with integral polynomial quotients. Evaluate and divide by the unit
. Subtracting one from each ratio leaves a multiple of
or , hence a multiple of .
Each factor in the alternating products defining therefore has
residue one. Inverses of these units also have residue one, so both
products do. All congruences use the single reduction ring from Node 6.2.
Lemma (Odd-order rigidity). A root of unity of odd order in a
characteristic-zero domain that reduces to one in a nonzero ring
of characteristic two must equal one.
Suppose instead that has odd order . Factor
and cancel in the original domain to get
If reduces to one, this becomes an odd number of ones,
which sums to one in characteristic two. That contradicts zero.
The cancellation happened before reduction; the quotient need not be
a domain. Applying the lemma to gives the exact equalities
.
Proposition (Exact comparisons). In general, equates
the even- and odd-subset products. For , it gives
Put . Both values have magnitude three, so
. Rearranging shows that the same multiplier carries
to their values at . The relative positions
are preserved; the three points need not coincide.
The fixed linear combination defining also acquires .
Dividing by the corresponding unit value of gives
With several distinct prime divisors, retain the exact alternating
product identities. They do not assert a common rotation between every
pair of inputs; Node 7 uses product expansion for that general case.
Explore the common rotation
For , compare the fixed inputs and . Choose a common rotation and watch all four evaluations turn together. The triangular markers are the values of .
Values at P = 1The values c(1), d(1), and g(1) lie on a circle of radius three. The triangular E(1) marker lies outside it. All four values rotate by 120 degrees from left to right.ReIm
Reference values · circle radius 3
Values at P = ωThe values c(ω), d(ω), and g(ω) lie on a circle of radius three. The triangular E(ω) marker lies outside it. All four values rotate by 120 degrees from left to right.ReIm
All four values rotated · circle radius 3
All four evaluations turn by 120°. Their relative angles stay fixed.
The polynomial is built from by
Here . Its value rotates by the same angle as the values of , although it need not lie on their circle. The forward multiplier is ; the reverse rotation is .
This is an illustration: no circulant Hadamard matrix of order 36 exists.
The conflict suggested by the picture
Node 5 gives . At , the all-ones terms cancel, so the same coefficient condition requires .
Required at : a nonzero residue.
Required at : zero residue.
But and must share an invertible rotation multiplier. It remains invertible modulo , so it cannot carry a nonzero residue to zero. The angle changes; the conflict is between the common rotation and these two arithmetic requirements.
Node 7 uses the equality proved above to compare the two residues and finish the nine-position example.
These are requirements of the Hadamard construction, not residues computed from the schematic points above. Changing an angle alone does not make a residue become zero.