claimroutineinferred_dep
Fixed multiplier lists for local square classes
Fixes finite multiplier lists putting in prescribed local square classes
makes the formula and independent of b
Statement (paper)
There is a finite list such that for every some satisfies , , and lies in the unit nonsquare class of (i.e. has even -adic valuation and nonsquare unit part). Moreover, for each , with , there is a finite list such that for every some satisfies and for all . These lists are fixed independently of .
In plain English
There is a finite list of nonzero rationals such that every has a multiple with that is positive, a square in , and a nonsquare unit class in . For each , there is also a finite list so that every nonzero has a multiple that is positive and a square in for all ; all lists are independent of .
Why it's here
This fixes finitely many multipliers once and for all, so the formula and the exceptional set do not depend on . It does this by normalizing into prescribed square classes at the finitely many relevant places (real, 2, 3, and the support of ), which the next claim uses to choose making locally square at . The finiteness holds because the relevant local square-class groups are finite.
Classified routine:
Direct consequence of the finiteness of the local square-class groups at finitely many places, combined with weak approximation (or CRT) to choose a representative multiplier for each class.
Sources
PaperOpen
- Section
- §3.2 Preparing integer witnesses
- Page
- —
- Label
—- Line
sections/03-parity.tex:108
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Choice of fixed multiplier lists M and D_m" rests on par:soundness