An Algorithm for Checking Injectivity of Specialization Maps from Elliptic Surfaces
Abstract
Let E/ Q(t) be an elliptic curve and let t0 ∈ Q be a rational number for which the specialization Et0 is an elliptic curve. Given a subgroup M of E( Q(t)) with mild conditions and t0 ∈ Q coming from a relatively large subset SM ⊂ Q, we provide an algorithm that can show that the specialization map σt0 : E( Q(t)) Et0( Q) is injective when restricted to M. The set SM is effectively computable in certain cases, and we carry out this computation for some explicit examples where E is given by a Weierstrass equation.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.