claimroutineinferred_dep
Normalized Selmer pairs with positive coordinates
Normalizes Selmer pairs: positive coordinates, bit-vector representatives
encodes Selmer classes as bit vectors
Statement (paper)
Every Selmer class in Kummer coordinates has even valuations of both coordinates at , and its first coordinate is positive at the real place. The sign of the second coordinate defines a surjective homomorphism from to , so its kernel, the classes with both coordinates positive, has index two. Every class in this kernel has a unique representative of the form with and .
In plain English
Every Selmer class in coordinates has even valuations at in both coordinates and at the real place. The sign of gives a surjection , and each class in its index-two kernel has a unique representative with and .
Why it's here
This handles the remaining places, and , so that together with the odd-prime local conditions every Selmer class is encoded by a pair of bit vectors supported on and . The later claim turns these vectors into the Rédei matrix equations. The surjectivity of the sign map uses the nontrivial torsion classes, and the index-two statement costs only one dimension, so the Selmer dimension can be read off from the positive-coordinate subgroup.
Classified routine:
Standard 2-descent bookkeeping for curves with full 2-torsion: local conditions at 2 and the real place plus the torsion class images (earlier claims) give the normalized representatives, as in classical Rédei-matrix/2-Selmer computations (e.g. Heath-Brown's congruent number descent).
Uses
Used by
Sources
PaperOpen
- Section
- §3.3 A criterion for one twist
- Page
- —
- Label
—- Line
sections/03-parity.tex:359
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Conditions at 2 and real place; normalized Selmer pairs" rests on claim-par-descent-1
- infoinferred_depoutline: "Conditions at 2 and real place; normalized Selmer pairs" rests on claim-par-descent-2