 
 
 
 
 
 
 
  
 
 is an elliptic curve over
 is an elliptic curve over 
 then
 then
 
is finite. This is a theorem when
 , and is
not known in a single case when
, and is
not known in a single case when 
 .
Proving finiteness of
.
Proving finiteness of 
 for any curve of rank
 for any curve of rank  would be a
massively important result that would have huge ramifications.
Much work toward the Birch and Swinnerton-Dyer conjecture (of
Greenberg, Skinner, Urban, Nekovar, etc.) assumes finiteness
of
 would be a
massively important result that would have huge ramifications.
Much work toward the Birch and Swinnerton-Dyer conjecture (of
Greenberg, Skinner, Urban, Nekovar, etc.) assumes finiteness
of 
 .  Note that if
.  Note that if 
 or
 or 
 ,
then it is a theorem that
,
then it is a theorem that 
 is finite; there
isn't even a single curve with
 is finite; there
isn't even a single curve with 
 for which
finiteness of
 for which
finiteness of 
 is known.
 is known.
As far as I can tell nobody has even the slightest clue how to prove this. However, we can at least try to do some computations.
 be the elliptic curve defined by
 be the elliptic curve defined by 
 of conductor
  of conductor  .  This curve has rank
.  This curve has rank  .
. 
![$ {\mbox{{\fontencoding{OT2}\fontfamily{wncyr}\fontseries{m}\fontshape{n}\selectfont Sh}}}(E)[p]$](img413.png) is finite for 5 primes
 is finite for 5 primes  .
.
![$ {\mbox{{\fontencoding{OT2}\fontfamily{wncyr}\fontseries{m}\fontshape{n}\selectfont Sh}}}(E)[p]$](img413.png) is finite for all primes
 is finite for all primes  .
.
![$ {\mbox{{\fontencoding{OT2}\fontfamily{wncyr}\fontseries{m}\fontshape{n}\selectfont Sh}}}(E)[p] = 0$](img415.png) for
any
 for
any  using a
 using a  -descent.  In practice this does not seem
practical except for
-descent.  In practice this does not seem
practical except for  .  For
.  For  use mwrank
or simon_two_descent in SAGE.  For
 use mwrank
or simon_two_descent in SAGE.  For  use
three_selmer_rank in SAGE (this command just
calls MAGMA and runs code of Michael Stoll).
 use
three_selmer_rank in SAGE (this command just
calls MAGMA and runs code of Michael Stoll). 
 .  And Perrin-Riou does exactly this in the supersingular case in
  [PR03].  (In fact, she does much more, in that
  she computes
.  And Perrin-Riou does exactly this in the supersingular case in
  [PR03].  (In fact, she does much more, in that
  she computes 
 in the whole
 in the whole 
 tower. Shark contains now
  her computations with a few modifications.  - from Christian
  Wuthrich.)
 tower. Shark contains now
  her computations with a few modifications.  - from Christian
  Wuthrich.)
 
 
 
 
 
 
