claimroutineinferred_dep
Auxiliary primes give required congruences
Auxiliary primes give and
fixes prime types for the congruence conditions
Statement (paper)
Let be an auxiliary prime of type and let be a set of auxiliary primes of type , with types imposed by the residue classes and modulo respectively. Then on each of the sets and the total -sum is and the total -sum is , so that the product of the corresponding primes satisfies and .
In plain English
Take one auxiliary prime of type (residue class 7 mod 12) and auxiliary primes of type (residue class 1 mod 12). Then on both and , the total -sum is and the total -sum is , so the product of these primes satisfies and .
Why it's here
The fixed-prime sums from the previous claim (-sums zero on and , -sum on and on ) show that alone supplies the missing -sum of . Its -contribution of cancels the from , while the type- primes in contribute nothing. This yields the congruence conditions on for both twists and , and fixes the auxiliary prime types for the later matrix-kernel argument.
Classified routine:
Direct parity bookkeeping from the fixed symbol sums of the previous claim: adding one prime of type (1,1) and several of type (0,0) gives total s-sum 1 and λ-sum 0, which translates into the stated congruences mod 4 and mod 3 via the residue classes mod 12.
Sources
PaperOpen
- Section
- §3.4 One parameter for both twists
- Page
- —
- Label
—- Line
sections/03-parity.tex:570
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Auxiliary prime types give required congruences" rests on claim-par-simultaneous-matrices-1