claimroutineinferred_dep
Negacyclic reduction gives bounded coefficients
Negacyclic folding gives coefficients within bits
bounds folded coefficients for truncation
Claim·§7 Exact normalized polynomial products·inside lemExact negacyclic product with one truncation
Statement (paper)
Reducing the real and imaginary numerator streams and modulo gives Gaussian integer coefficients , each a sum of exactly signed products of Gaussian integer input coefficients of modulus at most , so . Moreover , so the normalized product of disk polynomials lies in the disk, and all intermediate coefficient additions fit in bits without overflow or ambiguity between adjacent packing fields.
In plain English
Reducing the real and imaginary numerator streams modulo yields Gaussian integer coefficients , each a signed sum of exactly products of input coefficients, so . The normalized product stays in the disk since , and all intermediate additions fit in bits without overflow or ambiguity between packing fields.
Why it's here
The exact product coefficients recovered by centered extraction are folded modulo to get the ring product, and this claim bounds the folded values by . That bound shows the later truncation step stays in the disk and that the arithmetic stays within bits, so the rounding and output format can be handled in the next claim.
Classified routine:
A direct coefficient bound for negacyclic convolution: each coefficient of a product modulo y^r+1 is a signed sum of r products, so the triangle inequality gives |H_j| ≤ r2^{2p}. This is standard bookkeeping that follows from the preceding extraction claim.
Uses
Used by
Sources
PaperOpen
- Section
- §7 Exact normalized polynomial products
- Page
- —
- Label
—- Line
sections/06-transforms.tex:573
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Negacyclic reduction and normalized product in disk" rests on claim-lem-signed-ring-product-3