claimroutine
Kronecker evaluation separates product coefficients
Kronecker evaluation at keeps product coefficients below
setup for packing coefficients into big integers
Claim·§7 Exact normalized polynomial products·inside lemExact negacyclic product with one truncation
Statement (paper)
Write and with of degree less than and coefficients of absolute value at most , and set and for . Then , so each magnitude fits in bits. Moreover, each evaluation product equals , where is the corresponding ordinary product in , and every coefficient satisfies .
In plain English
Evaluating the integer polynomials at gives integers of magnitude below (so at most bits). Each product such as equals the evaluation at of the ordinary polynomial product , and every coefficient of satisfies .
Why it's here
This is the Kronecker-substitution setup for the parent lemma: because the product coefficients are far smaller than , they do not overlap when packed into one large integer. That lets a single big-integer multiplication carry all the coefficients of , which the later claims unpack with signed carries and centered extraction.
Classified routine:
Standard Kronecker substitution (Kronecker; Schönhage 1982) with elementary coefficient bounds. The node only checks the size estimates (e.g. |h_j| <= r 2^{2p} < B_0/2) that ensure the packed coefficients do not overlap.
Uses
Nothing else in the paper
Used by
Sources
PaperOpen
- Section
- §7 Exact normalized polynomial products
- Page
- —
- Label
—- Line
sections/06-transforms.tex:476
Leannot aligned
Phase 2 aligns this node to a Lean declaration.