Lemma (Integral combination). The common sign polynomials make
both quotients defining integral, and
Indeed, substituting the definitions from Node 3 gives
Each half-sum has integer coefficients because a sum of two signs is
even. Adding the two quotients gives the displayed identity for .
These are exact divisions before reduction; the norm identities are
not needed.
Lemma (Gaussian parity). Reduction modulo sends to
modulo . In particular, .
The formula
shows that divisibility by is equivalent to being even.
Thus . Apply this reduction to
polynomial coefficients while leaving the powers of in place.
Both and become zero, so the quotients defining must
be formed before reduction.
Lemma (All-ones congruence). The integral combination satisfies
In the exact formula
the second term vanishes because . Every coefficient of
is a sign, and both signs reduce to one. This proves the
coefficient congruence without using the norm identities or oddness.
If is odd, evaluating at then gives
. For , four pairs of
ones vanish and the ninth one remains. Retain the exact divisibilities
and for Node 6.