claimroutineinferred_dep
Selmer conditions as Rédei matrix equations
Rewrites Selmer conditions as ,
linear algebra form for the kernel computation
Statement (paper)
A pair with and satisfies the local conditions at the primes (i.e. agrees with the local torsion class ) if and only if and . The additional requirement that the second coordinate be a square at is equivalent to .
In plain English
A normalized pair meets the local conditions at the primes exactly when and . The extra condition that the second coordinate is a square at is equivalent to the single linear equation .
Why it's here
This turns the local Selmer conditions at odd primes and at into linear algebra over for the vectors from the normalized-pair claim. The matrix equations are what the kernel computation in the next claim uses, together with the hypotheses and , to bound the Selmer group.
Classified routine:
A standard translation of local 2-descent conditions into Legendre-symbol (Rédei-type) matrix equations over F_2, as in Heath-Brown's and Monsky's treatments of congruent-number Selmer groups. It is direct bookkeeping of local Hilbert symbols on top of the normalized-pair claim.
Uses
Used by
Sources
PaperOpen
- Section
- §3.3 A criterion for one twist
- Page
- —
- Label
—- Line
sections/03-parity.tex:392
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Selmer conditions as Redei matrix equations" rests on claim-par-descent-3