Fix indentation in some docstrings
diff r da1d714ce6c6 r d35e82645fb5 sage/libs/mwrank/interface.py
 a/sage/libs/mwrank/interface.py Thu Feb 04 15:59:15 2010 +0000
+++ b/sage/libs/mwrank/interface.py Thu Feb 04 11:06:06 2010 0800
@@ 244,26 +244,26 @@
"""
Returns the rank of this curve, computed using 2descent.
 In general this may only be a lower bound for the rank; an
 upper bound may be obtained using the function rank_bound().
 To test whether the value has been proved to be correct, use
 the method \method{certain}.
+ In general this may only be a lower bound for the rank; an
+ upper bound may be obtained using the function rank_bound().
+ To test whether the value has been proved to be correct, use
+ the method \method{certain}.
 EXAMPLES::
+ EXAMPLES::
 sage: E = mwrank_EllipticCurve([0, 1, 0, 900, 10098])
 sage: E.rank()
 0
 sage: E.certain()
 True
+ sage: E = mwrank_EllipticCurve([0, 1, 0, 900, 10098])
+ sage: E.rank()
+ 0
+ sage: E.certain()
+ True
 ::
+ ::
 sage: E = mwrank_EllipticCurve([0, 1, 1, 929, 10595])
 sage: E.rank()
 0
 sage: E.certain()
 False
+ sage: E = mwrank_EllipticCurve([0, 1, 1, 929, 10595])
+ sage: E.rank()
+ 0
+ sage: E.certain()
+ False
"""
return self.__two_descent_data().getrank()
@@ 273,11 +273,11 @@
Returns an upper bound for the rank of this curve, computed
using 2descent.
 If the curve has no 2torsion, this is equal to the 2Selmer
 rank. If the curve has 2torsion, the upper bound may be
 smaller than the bound obtained from the 2Selmer rank minus
 the 2rank of the torsion, since more information is gained
 from the 2isogenous curve or curves.
+ If the curve has no 2torsion, this is equal to the 2Selmer
+ rank. If the curve has 2torsion, the upper bound may be
+ smaller than the bound obtained from the 2Selmer rank minus
+ the 2rank of the torsion, since more information is gained
+ from the 2isogenous curve or curves.
EXAMPLES:
@@ 307,32 +307,33 @@
sage: E.rank_bound()
2
 In this case the value returned by \method{rank} is only a
 lower bound in general (though in this is correct)::
+ In this case the value returned by \method{rank} is only a
+ lower bound in general (though in this is correct)::
sage: E.rank()
0
 sage: E.certain()
 False
+ sage: E.certain()
+ False
+
"""
return self.__two_descent_data().getrankbound()
def selmer_rank(self):
r"""
 Returns the rank of the 2Selmer group of the curve.

+ Returns the rank of the 2Selmer group of the curve.
+
EXAMPLES:
 The following is the curve 960D1, which has rank 0, but Sha of
+ The following is the curve 960D1, which has rank 0, but Sha of
order 4. The 2torsion has rank 2, and the Selmer rank is 3::
sage: E = mwrank_EllipticCurve([0, 1, 0, 900, 10098])
sage: E.selmer_rank()
3
 Nevertheless, we can obtain a tight upper bound on the rank
 since a second descent is performed which establishes the
 2rank of Sha::
+ Nevertheless, we can obtain a tight upper bound on the rank
+ since a second descent is performed which establishes the
+ 2rank of Sha::
sage: E.rank_bound()
0
@@ 355,14 +356,14 @@
sage: E.rank_bound()
2
 In cases like this with no 2torsion, the rank upper bound is
 always equal to the 2Selmer rank. If we ask for the rank,
 all we get is a lower bound::

+ In cases like this with no 2torsion, the rank upper bound is
+ always equal to the 2Selmer rank. If we ask for the rank,
+ all we get is a lower bound::
+
sage: E.rank()
0
 sage: E.certain()
 False
+ sage: E.certain()
+ False
"""
return self.__two_descent_data().getselmer()
@@ 411,11 +412,11 @@
called, then it is first called by \method{certain}
using the default parameters.
 The result is true if and only if the results of the methods
 \method{rank} and \method{rank_bound} are equal.
+ The result is true if and only if the results of the methods
+ \method{rank} and \method{rank_bound} are equal.
EXAMPLES:

+
A $2$descent does not determine $E(\Q)$ with certainty
for the curve $y^2 + y = x^3  x^2  120x  2183$.
@@ 427,7 +428,7 @@
sage: E.rank()
0
 The previous value is only a lower bound; the upper bound is greater::
+ The previous value is only a lower bound; the upper bound is greater::
sage: E.rank_bound()
2
diff r da1d714ce6c6 r d35e82645fb5 sage/schemes/elliptic_curves/ell_rational_field.py
 a/sage/schemes/elliptic_curves/ell_rational_field.py Thu Feb 04 15:59:15 2010 +0000
+++ b/sage/schemes/elliptic_curves/ell_rational_field.py Thu Feb 04 11:06:06 2010 0800
@@ 2459,12 +2459,12 @@
sage: E.selmer_rank()
3
 Here the Selmer rank is equal to the 2torsion rank (=1) plus
 the 2rank of Sha (=2), and the rank itself is zero::

 sage: E.rank()
 0

+ Here the Selmer rank is equal to the 2torsion rank (=1) plus
+ the 2rank of Sha (=2), and the rank itself is zero::
+
+ sage: E.rank()
+ 0
+
In contrast, for the curve 571A, also with rank 0 and Sha of
order 4, we get a worse bound::
@@ 2474,16 +2474,17 @@
sage: E.rank_bound()
2
 To establish that the rank is in fact 0 in this case, we would
 need to carry out a higher descent::

 sage: E.three_selmer_rank() # optional: magma
 0

 Or use the Lfunction to compute the analytic rank::

+ To establish that the rank is in fact 0 in this case, we would
+ need to carry out a higher descent::
+
+ sage: E.three_selmer_rank() # optional: magma
+ 0
+
+ Or use the Lfunction to compute the analytic rank::
+
sage: E.rank(only_use_mwrank=False)
0
+
"""
try:
return self.__selmer_rank
@@ 2518,6 +2519,7 @@
2
sage: E.rank(only_use_mwrank=False) # uses Lfunction
0
+
"""
try:
return self.__rank_bound