lemmaroutine
Row coefficients are bounded and constructible
Lemma·
lem:row-coefficients·§4.6 Coefficient bounds and the completed constructionStatement (paper)
Let . Then
for every . The sum of the absolute values of all coefficients
in each row is at most .
The same bound holds for .
The matrices and the rows can be
constructed in bit operations.
In plain English
With , the scaled rows (and ) have integer polynomial entries whose coefficients have absolute sum at most in each row. The matrices , and the rows can be built in bit operations.
Why it's here
This lemma clears denominators with a single factor and shows the resulting integer coefficients stay of size , so the rows can be used as bounded-weight integer constraints in the completed construction. It also certifies that the construction, including the swap matrix from the swaps-matrix lemma, is efficiently computable, which later layout and counting results rely on.
Classified routine:
The proof clears denominators with a single factorial factor and bounds the coefficient sizes by direct bookkeeping on factorial and binomial magnitudes. Constructibility follows from explicit polynomial-time linear algebra over the rows, given the earlier swap-matrix lemma.
Uses
Used by
Sources
PaperOpen
- Section
- §4.6 Coefficient bounds and the completed construction
- Page
- —
- Label
lem:row-coefficients- Line
main_full_version.tex:2635
Leannot aligned
Phase 2 aligns this node to a Lean declaration.