passagemath-schemes 10.5.44__cp313-cp313-musllinux_1_2_aarch64.whl → 10.6.42__cp313-cp313-musllinux_1_2_aarch64.whl

sage/schemes/elliptic_curves/heegner.py

@@ -2531,7 +2531,7 @@ class HeegnerPoints_level_disc_cond(HeegnerPoints_level, HeegnerPoints_level_dis
 
             sage: len(heegner_points(389,-20,1))
             4
-            sage: QQ[sqrt(-20)].class_number()
+            sage: QQ[sqrt(-20)].class_number()                                          # needs sage.symbolic
             2
         """
         return len(self.points())
@@ -3356,7 +3356,7 @@ class HeegnerPointOnEllipticCurve(HeegnerPoint):
         the discriminant below is strong confirmation -- but not proof
         -- that this polynomial is correct::
 
-            sage: f = P.numerical_approx(70)[0].algdep(6); f                            # needs fpylll
+            sage: f = P.numerical_approx(70)[0].algebraic_dependency(6); f              # needs fpylll
             1225*x^6 + 1750*x^5 - 21675*x^4 - 380*x^3 + 110180*x^2 - 129720*x + 48771
             sage: f.discriminant().factor()                                             # needs fpylll
             2^6 * 3^2 * 5^11 * 7^4 * 13^2 * 19^6 * 199^2 * 719^2 * 26161^2
@@ -3461,7 +3461,7 @@ class HeegnerPointOnEllipticCurve(HeegnerPoint):
 
         if algorithm == 'lll':
             P = self.numerical_approx(prec)
-            f = P[0].algdep(n)
+            f = P[0].algebraic_dependency(n)
             if f.is_irreducible() and self._check_poly_discriminant(f):
                 return f.monic()
             else:
@@ -3544,7 +3544,7 @@ class HeegnerPointOnEllipticCurve(HeegnerPoint):
             sage: z = P.point_exact(200, optimize=True)
             sage: z[1].charpoly()
             x^12 + 6*x^11 + 90089/1715*x^10 + 71224/343*x^9 + 52563964/588245*x^8 - 483814934/588245*x^7 - 156744579/16807*x^6 - 2041518032/84035*x^5 + 1259355443184/14706125*x^4 + 3094420220918/14706125*x^3 + 123060442043827/367653125*x^2 + 82963044474852/367653125*x + 211679465261391/1838265625
-            sage: f = P.numerical_approx(500)[1].algdep(12); f / f.leading_coefficient()
+            sage: f = P.numerical_approx(500)[1].algebraic_dependency(12); f / f.leading_coefficient()
             x^12 + 6*x^11 + 90089/1715*x^10 + 71224/343*x^9 + 52563964/588245*x^8 - 483814934/588245*x^7 - 156744579/16807*x^6 - 2041518032/84035*x^5 + 1259355443184/14706125*x^4 + 3094420220918/14706125*x^3 + 123060442043827/367653125*x^2 + 82963044474852/367653125*x + 211679465261391/1838265625
 
             sage: E = EllipticCurve('5077a')
@@ -4227,13 +4227,14 @@ class KolyvaginPoint(HeegnerPoint):
             if E.root_number() == -1:
                 return self._recognize_point_over_QQ(P, 2*self.index())
             else:
-                # root number +1.  We use algdep to recognize the x
+                # root number +1.  We use algebraic_dependency
+                # to recognize the x
                 # coordinate, stick it in the appropriate quadratic
                 # field, then make sure that we got the right
                 # embedding, and if not fix things so we do.
                 x = P[0]
                 C = x.parent()
-                f = x.algdep(2)
+                f = x.algebraic_dependency(2)
                 K = self.quadratic_field()
                 roots = [r[0] for r in f.roots(K)]
                 if not roots:
@@ -6424,7 +6425,7 @@ def ell_heegner_point(self, D, c=ZZ(1), f=None, check=True):
     Working out the details manually::
 
         sage: P = E.heegner_point(-47).numerical_approx(prec=200)
-        sage: f = algdep(P[0], 5); f
+        sage: f = algebraic_dependency(P[0], 5); f
         x^5 - x^4 + x^3 + x^2 - 2*x + 1
         sage: f.discriminant().factor()
         47^2
@@ -6819,6 +6820,7 @@ def _adjust_heegner_index(self, a):
 
     EXAMPLES::
 
+        sage: # needs sage.symbolic
         sage: E = EllipticCurve('11a1')
         sage: a = RIF(sqrt(2)) - RIF(1.4142135623730951)
         sage: E._adjust_heegner_index(a)
@@ -7242,7 +7244,7 @@ def _heegner_forms_list(self, D, beta=None, expected_count=None):
         -195
         sage: len(E._heegner_forms_list(-195))
         4
-        sage: QQ[sqrt(-195)].class_number()
+        sage: QQ[sqrt(-195)].class_number()                                             # needs sage.symbolic
         4
 
         sage: E = EllipticCurve('389a')
@@ -7286,6 +7288,7 @@ def _heegner_best_tau(self, D, prec=None):
 
     EXAMPLES::
 
+        sage: # needs sage.symbolic
         sage: E = EllipticCurve('37a')
         sage: E._heegner_best_tau(-7)
         1/74*sqrt(-7) - 17/74

sage/schemes/elliptic_curves/height.py

@@ -1035,7 +1035,7 @@ class EllipticCurveCanonicalHeight:
 
         EXAMPLES::
 
-            sage: # needs sage.rings.number_field
+            sage: # needs sage.rings.number_field sage.symbolic
             sage: K.<i> = QuadraticField(-1)
             sage: E = EllipticCurve([0, 0, 0, 1+5*i, 3+i])
             sage: H = E.height_function()
@@ -1109,7 +1109,7 @@ class EllipticCurveCanonicalHeight:
 
         In [Tho2010]_ the value is given as 0.772::
 
-            sage: RealField(12)( H.B(5, 0.01) )                                         # needs sage.rings.number_field
+            sage: RealField(12)( H.B(5, 0.01) )                                         # needs sage.rings.number_field sage.symbolic
             0.777
         """
         K = self.K
@@ -1320,9 +1320,9 @@ class EllipticCurveCanonicalHeight:
         height strictly greater than 0.2, but fail to prove the same
         for 0.3::
 
-            sage: H.real_intersection_is_empty([H.B(n,0.2) for n in srange(1,10)], v)
+            sage: H.real_intersection_is_empty([H.B(n,0.2) for n in srange(1,10)], v)   # needs sage.symbolic
             True
-            sage: H.real_intersection_is_empty([H.B(n,0.3) for n in srange(1,10)], v)
+            sage: H.real_intersection_is_empty([H.B(n,0.3) for n in srange(1,10)], v)   # needs sage.symbolic
             False
 
         An example over a number field::
@@ -1339,9 +1339,9 @@ class EllipticCurveCanonicalHeight:
         height strictly greater than 0.07, but fail to prove the same
         for 0.08::
 
-            sage: H.real_intersection_is_empty([H.B(n,0.07) for n in srange(1,5)], v)  # long time, needs sage.rings.number_field
+            sage: H.real_intersection_is_empty([H.B(n,0.07) for n in srange(1,5)], v)  # long time, needs sage.rings.number_field sage.symbolic
             True
-            sage: H.real_intersection_is_empty([H.B(n,0.08) for n in srange(1,5)], v)   # needs sage.rings.number_field
+            sage: H.real_intersection_is_empty([H.B(n,0.08) for n in srange(1,5)], v)   # needs sage.rings.number_field sage.symbolic
             False
         """
         return UnionOfIntervals.intersection([self.Sn(-B, B, k+1, v) for k,B in enumerate(Bk)]).is_empty()
@@ -1628,7 +1628,7 @@ class EllipticCurveCanonicalHeight:
         The array of values on the grid shows symmetry, since `\wp` is
         even::
 
-            sage: H.wp_on_grid(v,4)
+            sage: H.wp_on_grid(v, 4)                                                    # needs sage.symbolic
             array([[25.43920182,  5.28760943,  5.28760943, 25.43920182],
                    [ 6.05099485,  1.83757786,  1.83757786,  6.05099485],
                    [ 6.05099485,  1.83757786,  1.83757786,  6.05099485],
@@ -1636,7 +1636,7 @@ class EllipticCurveCanonicalHeight:
 
         The array of values on the half-grid::
 
-            sage: H.wp_on_grid(v,4,True)
+            sage: H.wp_on_grid(v, 4, True)                                              # needs sage.symbolic
             array([[25.43920182,  5.28760943],
                    [ 6.05099485,  1.83757786],
                    [ 6.05099485,  1.83757786],
@@ -1693,18 +1693,18 @@ class EllipticCurveCanonicalHeight:
         for 0.03.  For the first proof, using only `n=1,2,3` is not
         sufficient::
 
-            sage: H.complex_intersection_is_empty([H.B(n,0.02) for n in [1,2,3]], v)  # long time, needs sage.rings.number_field
+            sage: H.complex_intersection_is_empty([H.B(n, 0.02) for n in [1,2,3]], v)  # long time, needs sage.rings.number_field sage.symbolic
             False
-            sage: H.complex_intersection_is_empty([H.B(n,0.02) for n in [1,2,3,4]], v)  # needs sage.rings.number_field
+            sage: H.complex_intersection_is_empty([H.B(n, 0.02) for n in [1,2,3,4]], v)  # needs sage.rings.number_field sage.symbolic
             True
-            sage: H.complex_intersection_is_empty([H.B(n,0.03) for n in [1,2,3,4]], v)  # long time, needs sage.rings.number_field
+            sage: H.complex_intersection_is_empty([H.B(n, 0.03) for n in [1,2,3,4]], v)  # long time, needs sage.rings.number_field sage.symbolic
             False
 
         Using `n\le6` enables us to prove the lower bound 0.03.  Note
         that it takes longer when the result is ``False`` than when it
         is ``True``::
 
-            sage: H.complex_intersection_is_empty([H.B(n,0.03) for n in [1..6]], v)     # needs sage.rings.number_field
+            sage: H.complex_intersection_is_empty([H.B(n, 0.03) for n in [1..6]], v)     # needs sage.rings.number_field sage.symbolic
             True
         """
         from sage.schemes.elliptic_curves.period_lattice_region import PeriodicRegion
@@ -1818,11 +1818,11 @@ class EllipticCurveCanonicalHeight:
         Using `N=5` we can prove that 0.1 is a lower bound (in fact we
         only need `N=2`), but not that 0.2 is::
 
-            sage: H.test_mu(0.1, 5)                                                     # needs sage.rings.number_field
+            sage: H.test_mu(0.1, 5)                                                     # needs sage.rings.number_field sage.symbolic
             B_1(0.100000000000000) = 1.51580969677387
             B_2(0.100000000000000) = 0.932072561526720
             True
-            sage: H.test_mu(0.2, 5)                                                     # needs sage.rings.number_field
+            sage: H.test_mu(0.2, 5)                                                     # needs sage.rings.number_field sage.symbolic
             B_1(0.200000000000000) = 2.04612906979932
             B_2(0.200000000000000) = 3.09458988474327
             B_3(0.200000000000000) = 27.6251108409484
@@ -1903,7 +1903,7 @@ class EllipticCurveCanonicalHeight:
         given)::
 
             sage: E = EllipticCurve([1, 0, 1, 421152067, 105484554028056]) # 60490d1
-            sage: E.height_function().min_gr(.0001, 5)
+            sage: E.height_function().min_gr(.0001, 5)                                  # needs sage.symbolic
             1.98684388146518
 
         Example 10.1 from [Tho2010]_ (where a lower bound of 0.18 was
@@ -1913,7 +1913,7 @@ class EllipticCurveCanonicalHeight:
             sage: K.<i> = QuadraticField(-1)
             sage: E = EllipticCurve([0, 0, 0, 91 - 26*i, -144 - 323*i])
             sage: H = E.height_function()
-            sage: H.min_gr(0.1, 4)              # long time
+            sage: H.min_gr(0.1, 4)              # long time, needs sage.symbolic
             0.1621049443313762
 
         Example 10.2 from [Tho2010]_::
@@ -1922,7 +1922,7 @@ class EllipticCurveCanonicalHeight:
             sage: K.<i> = QuadraticField(-1)
             sage: E = EllipticCurve([0, 1 - i, i, -i, 0])
             sage: H = E.height_function()
-            sage: H.min_gr(0.01, 5)             # long time
+            sage: H.min_gr(0.01, 5)             # long time, needs sage.symbolic
             0.020153685521979152
 
         In this example the point `P=(0,0)` has height 0.023 so our
@@ -1938,10 +1938,11 @@ class EllipticCurveCanonicalHeight:
         given)::
 
             sage: # needs sage.rings.number_field
+            sage: x = polygen(ZZ, 'x')
             sage: K.<a> = NumberField(x^3 - 2)
             sage: E = EllipticCurve([0, 0, 0, -3*a - a^2, a^2])
             sage: H = E.height_function()
-            sage: H.min_gr(0.1, 5)              # long time
+            sage: H.min_gr(0.1, 5)              # long time, needs sage.symbolic
             0.25
 
         TESTS:
@@ -1949,10 +1950,11 @@ class EllipticCurveCanonicalHeight:
         This example from the LMFDB gave problems before the fix in :issue:`8829`::
 
             sage: # needs sage.rings.number_field
+            sage: x = polygen(ZZ, 'x')
             sage: K.<phi> = NumberField(x^2 - x - 1)
             sage: E = EllipticCurve([phi + 1, -phi + 1, 1, 20*phi - 39, 196*phi + 237])
             sage: H = E.height_function()
-            sage: H.min_gr(.1, 5, verbose=True)         # long time
+            sage: H.min_gr(.1, 5, verbose=True)         # long time, needs sage.symbolic
             B_1(1) = 1540.199246369678
             ...
             halving mu to 0.25 and increasing n_max to 6
@@ -2028,7 +2030,7 @@ class EllipticCurveCanonicalHeight:
         given)::
 
             sage: E = EllipticCurve([1, 0, 1, 421152067, 105484554028056]) # 60490d1
-            sage: E.height_function().min(.0001, 5)
+            sage: E.height_function().min(.0001, 5)                                     # needs sage.symbolic
             0.0011263287309893311
 
         Example 10.1 from [Tho2010]_ (where a lower bound of 0.18 was
@@ -2061,6 +2063,7 @@ class EllipticCurveCanonicalHeight:
         given)::
 
             sage: # needs sage.rings.number_field
+            sage: x = polygen(ZZ, 'x')
             sage: K.<a> = NumberField(x^3 - 2)
             sage: E = EllipticCurve([0, 0, 0, -3*a - a^2, a^2])
             sage: H = E.height_function()
@@ -2071,7 +2074,7 @@ class EllipticCurveCanonicalHeight:
 
             sage: E = EllipticCurve('37a')
             sage: h = E.height_function()
-            sage: h.min(.01, 5)
+            sage: h.min(.01, 5)                                                         # needs sage.symbolic
             0.03987318057488725
             sage: E.gen(0).height()
             0.0511114082399688
@@ -2079,12 +2082,12 @@ class EllipticCurveCanonicalHeight:
         After base change the lower bound can decrease::
 
             sage: K.<a> = QuadraticField(-5)                                            # needs sage.rings.number_field
-            sage: E.change_ring(K).height_function().min(0.5, 10)       # long time, needs sage.rings.number_field
+            sage: E.change_ring(K).height_function().min(0.5, 10)       # long time, needs sage.rings.number_field sage.symbolic
             0.04419417382415922
 
             sage: E = EllipticCurve('389a')
             sage: h = E.height_function()
-            sage: h.min(0.1, 5)
+            sage: h.min(0.1, 5)                                                         # needs sage.symbolic
             0.05731275270029196
             sage: [P.height() for P in E.gens()]
             [0.686667083305587, 0.327000773651605]

sage/schemes/elliptic_curves/hom.py

@@ -1162,7 +1162,7 @@ def compare_via_evaluation(left, right):
         sage: from sage.schemes.elliptic_curves.hom_composite import EllipticCurveHom_composite
         sage: mu = EllipticCurveHom_composite.from_factors([phi, psi])
         sage: from sage.schemes.elliptic_curves.hom import compare_via_evaluation
-        sage: compare_via_evaluation(mu, E.scalar_multiplication(7))
+        sage: compare_via_evaluation(mu, E.scalar_multiplication(7))                    # needs sage.symbolic
         True
 
     .. SEEALSO::
@@ -1344,6 +1344,7 @@ def compute_trace_generic(phi):
     the result for Frobenius matches
     :meth:`~sage.schemes.elliptic_curves.ell_finite_field.EllipticCurve_finite_field.trace_of_frobenius`::
 
+        sage: # needs sage.symbolic
         sage: from sage.schemes.elliptic_curves.hom import compute_trace_generic
         sage: p = random_prime(10^3)
         sage: e = randrange(1, ceil(log(10^5,p)))

sage/schemes/elliptic_curves/hom_composite.py

@@ -64,7 +64,7 @@ Equality is decided correctly (and, in some cases, much faster than
 comparing :meth:`EllipticCurveHom.rational_maps`) even when distinct
 factorizations of the same isogeny are compared::
 
-    sage: psi == EllipticCurveIsogeny(E, P)                                             # needs sage.rings.finite_rings
+    sage: psi == EllipticCurveIsogeny(E, P)                                             # needs sage.rings.finite_rings sage.symbolic
     True
 
 We can easily obtain the individual factors of the composite map::
@@ -464,7 +464,7 @@ class EllipticCurveHom_composite(EllipticCurveHom):
             sage: P, = E.gens()
             sage: phi = EllipticCurveHom_composite(E, P)
             sage: psi = EllipticCurveHom_composite.from_factors(phi.factors())
-            sage: psi == phi
+            sage: psi == phi                                                            # needs sage.symbolic
             True
 
         TESTS::
@@ -479,7 +479,7 @@ class EllipticCurveHom_composite(EllipticCurveHom):
             sage: E = EllipticCurve(GF(419), [1,0])
             sage: P, = E.gens()
             sage: phi = EllipticCurveHom_composite(E, P)
-            sage: EllipticCurveHom_composite.from_factors(phi.factors()) == phi
+            sage: EllipticCurveHom_composite.from_factors(phi.factors()) == phi         # needs sage.symbolic
             True
         """
         maps = tuple(maps)
@@ -713,14 +713,14 @@ class EllipticCurveHom_composite(EllipticCurveHom):
 
         ::
 
-            sage: # needs sage.rings.finite_rings
+            sage: # needs sage.rings.finite_rings sage.rings.number_field sage.symbolic
             sage: E = EllipticCurve(GF(431**2), [1,0])
             sage: P,Q = E.gens()
-            sage: phi1 = EllipticCurveHom_composite(E, P)                               # needs sage.rings.number_field
-            sage: phi2 = EllipticCurveHom_composite(phi1.codomain(), phi1(Q))           # needs sage.rings.number_field
-            sage: psi1 = EllipticCurveHom_composite(E, Q)                               # needs sage.rings.number_field
-            sage: psi2 = EllipticCurveHom_composite(psi1.codomain(), psi1(P))           # needs sage.rings.number_field
-            sage: phi2 * phi1 == psi2 * psi1                                            # needs sage.rings.number_field
+            sage: phi1 = EllipticCurveHom_composite(E, P)
+            sage: phi2 = EllipticCurveHom_composite(phi1.codomain(), phi1(Q))
+            sage: psi1 = EllipticCurveHom_composite(E, Q)
+            sage: psi2 = EllipticCurveHom_composite(psi1.codomain(), psi1(P))
+            sage: phi2 * phi1 == psi2 * psi1
             True
         """
         if op != op_EQ:
@@ -845,9 +845,9 @@ class EllipticCurveHom_composite(EllipticCurveHom):
                     over Finite Field of size 65537
               To:   Elliptic Curve defined by y^2 + x*y + 3*y = x^3 + 2*x^2 + 4*x + 5
                     over Finite Field of size 65537
-            sage: psi * phi == phi.domain().scalar_multiplication(phi.degree())
+            sage: psi * phi == phi.domain().scalar_multiplication(phi.degree())         # needs sage.symbolic
             True
-            sage: phi * psi == psi.domain().scalar_multiplication(psi.degree())
+            sage: phi * psi == psi.domain().scalar_multiplication(psi.degree())         # needs sage.symbolic
             True
         """
         phis = (phi.dual() for phi in self._phis[::-1])

sage/schemes/elliptic_curves/hom_frobenius.py

@@ -431,18 +431,18 @@ class EllipticCurveHom_frobenius(EllipticCurveHom):
             sage: from sage.schemes.elliptic_curves.hom_frobenius import EllipticCurveHom_frobenius
             sage: E = EllipticCurve(GF(31), [0,1])
             sage: f = EllipticCurveHom_frobenius(E)
-            sage: f.dual() * f == EllipticCurveHom_scalar(f.domain(), 31)
+            sage: f.dual() * f == EllipticCurveHom_scalar(f.domain(), 31)               # needs sage.symbolic
             True
-            sage: f * f.dual() == EllipticCurveHom_scalar(f.codomain(), 31)
+            sage: f * f.dual() == EllipticCurveHom_scalar(f.codomain(), 31)             # needs sage.symbolic
             True
 
         A supersingular example::
 
             sage: E = EllipticCurve(GF(31), [1,0])
             sage: f = EllipticCurveHom_frobenius(E)
-            sage: f.dual() * f == EllipticCurveHom_scalar(f.domain(), 31)
+            sage: f.dual() * f == EllipticCurveHom_scalar(f.domain(), 31)               # needs sage.symbolic
             True
-            sage: f * f.dual() == EllipticCurveHom_scalar(f.codomain(), 31)
+            sage: f * f.dual() == EllipticCurveHom_scalar(f.codomain(), 31)             # needs sage.symbolic
             True
 
         TESTS:
@@ -459,13 +459,13 @@ class EllipticCurveHom_frobenius(EllipticCurveHom):
             ....:     except ArithmeticError:
             ....:         pass
             sage: f = EllipticCurveHom_frobenius(E, n)
-            sage: f.dual() * f == EllipticCurveHom_scalar(E, p**n)
+            sage: f.dual() * f == EllipticCurveHom_scalar(E, p**n)                      # needs sage.symbolic
             True
-            sage: f * f.dual() == EllipticCurveHom_scalar(f.codomain(), p**n)
+            sage: f * f.dual() == EllipticCurveHom_scalar(f.codomain(), p**n)           # needs sage.symbolic
             True
-            sage: f.dual().dual() == f  # known bug -- broken in characteristic 2,3
+            sage: f.dual().dual() == f  # known bug -- broken in characteristic 2,3     # needs sage.symbolic
             True
-            sage: p in (2,3) or f.dual().dual() == f
+            sage: p in (2,3) or f.dual().dual() == f                                    # needs sage.symbolic
             True
 
         ALGORITHM:

sage/schemes/elliptic_curves/hom_sum.py

@@ -20,7 +20,12 @@ EXAMPLES::
     Sum morphism:
       From: Elliptic Curve defined by y^2 = x^3 + 5*x + 5 over Finite Field of size 101
       To:   Elliptic Curve defined by y^2 = x^3 + 12*x + 98 over Finite Field of size 101
-      Via:  (Isogeny of degree 7 from Elliptic Curve defined by y^2 = x^3 + 5*x + 5 over Finite Field of size 101 to Elliptic Curve defined by y^2 = x^3 + 12*x + 98 over Finite Field of size 101, Isogeny of degree 7 from Elliptic Curve defined by y^2 = x^3 + 5*x + 5 over Finite Field of size 101 to Elliptic Curve defined by y^2 = x^3 + 12*x + 98 over Finite Field of size 101)
+      Via:  (Isogeny of degree 7
+              from Elliptic Curve defined by y^2 = x^3 + 5*x + 5 over Finite Field of size 101
+                to Elliptic Curve defined by y^2 = x^3 + 12*x + 98 over Finite Field of size 101,
+             Isogeny of degree 7
+              from Elliptic Curve defined by y^2 = x^3 + 5*x + 5 over Finite Field of size 101
+                to Elliptic Curve defined by y^2 = x^3 + 12*x + 98 over Finite Field of size 101)
     sage: phi + phi == phi * E.scalar_multiplication(2)                                 # needs sage.symbolic
     True
     sage: phi + phi + phi == phi * E.scalar_multiplication(3)                           # needs sage.symbolic
@@ -28,6 +33,7 @@ EXAMPLES::
 
 An example of computing with a supersingular endomorphism ring::
 
+    sage: # needs sage.symbolic
     sage: E = EllipticCurve(GF(419^2), [1,0])
     sage: i = E.automorphisms()[-1]
     sage: j = E.frobenius_isogeny()

sage/schemes/elliptic_curves/hom_velusqrt.py

@@ -47,7 +47,7 @@ However, they are certainly separable isogenies with the same kernel
 and must therefore be equal *up to post-isomorphism*::
 
     sage: isos = psi.codomain().isomorphisms(phi.codomain())
-    sage: sum(iso * psi == phi for iso in isos)
+    sage: sum(iso * psi == phi for iso in isos)                                         # needs sage.symbolic
     1
 
 Just like
@@ -1034,7 +1034,7 @@ class EllipticCurveHom_velusqrt(EllipticCurveHom):
             Elliptic-curve isogeny (using square-root Vélu) of degree 59:
               From: Elliptic Curve defined by y^2 + 5*x*y + 5*y = x^3 + 5*x^2 + 5*x + 5 over Finite Field of size 101
               To:   Elliptic Curve defined by y^2 = x^3 + 15*x + 25 over Finite Field of size 101
-            sage: phi == psi
+            sage: phi == psi                                                            # needs sage.symbolic
             True
         """
         if op != op_EQ:
@@ -1089,13 +1089,19 @@ class EllipticCurveHom_velusqrt(EllipticCurveHom):
             sage: K = E.cardinality() // 11 * E.gens()[0]
             sage: phi = E.isogeny(K, algorithm='velusqrt'); phi
             Elliptic-curve isogeny (using square-root Vélu) of degree 11:
-              From: Elliptic Curve defined by y^2 + x*y + y = x^3 + x^2 + x + 1 over Finite Field in z2 of size 101^2
-              To:   Elliptic Curve defined by y^2 = x^3 + 39*x + 40 over Finite Field in z2 of size 101^2
+              From: Elliptic Curve defined by y^2 + x*y + y = x^3 + x^2 + x + 1
+                    over Finite Field in z2 of size 101^2
+              To:   Elliptic Curve defined by y^2 = x^3 + 39*x + 40
+                    over Finite Field in z2 of size 101^2
             sage: phi.dual()
-            Isogeny of degree 11 from Elliptic Curve defined by y^2 = x^3 + 39*x + 40 over Finite Field in z2 of size 101^2 to Elliptic Curve defined by y^2 + x*y + y = x^3 + x^2 + x + 1 over Finite Field in z2 of size 101^2
-            sage: phi.dual() * phi == phi.domain().scalar_multiplication(11)
+            Isogeny of degree 11
+             from Elliptic Curve defined by y^2 = x^3 + 39*x + 40
+                  over Finite Field in z2 of size 101^2
+               to Elliptic Curve defined by y^2 + x*y + y = x^3 + x^2 + x + 1
+                  over Finite Field in z2 of size 101^2
+            sage: phi.dual() * phi == phi.domain().scalar_multiplication(11)            # needs sage.symbolic
             True
-            sage: phi * phi.dual() == phi.codomain().scalar_multiplication(11)
+            sage: phi * phi.dual() == phi.codomain().scalar_multiplication(11)          # needs sage.symbolic
             True
         """
         # FIXME: This code fails if the degree is divisible by the characteristic.

sage/schemes/elliptic_curves/homset.py

@@ -39,7 +39,7 @@ the endomorphism ring as scalar multiplications::
     True
     sage: (1 + omega + omega^2) == 0
     True
-    sage: (2*omega + 1)^2 == -3
+    sage: (2*omega + 1)^2 == -3                                                         # needs sage.symbolic
     True
 
 AUTHORS:
@@ -94,7 +94,7 @@ class EllipticCurveHomset(SchemeHomset_generic):
 
             sage: E = EllipticCurve(GF(101), [1,1])
             sage: H = End(E)
-            sage: TestSuite(H).run(skip='_test_elements')
+            sage: TestSuite(H).run(skip='_test_elements')                               # needs sage.symbolic
 
         ::
 

sage/schemes/elliptic_curves/isogeny_small_degree.py

@@ -1142,7 +1142,7 @@ def isogenies_7_0(E, minimal_models=True):
             to Elliptic Curve defined by y^2 + y = x^3 + (-7) over Number Field in r
                with defining polynomial x^2 + 3 with r = 1.732050807568878?*I]
 
-        sage: # needs sage.rings.number_field
+        sage: # needs sage.rings.number_field sage.symbolic
         sage: x = polygen(QQ, 'x')
         sage: K.<a> = NumberField(x^6 + 1512*x^3 - 21168)
         sage: E = EllipticCurve(K, [0,1])

sage/schemes/elliptic_curves/mod_poly.py

@@ -19,8 +19,7 @@ from sage.rings.integer_ring import ZZ
 from sage.libs.pari import pari
 from cypari2.handle_error import PariError
 
-from sage.databases.db_modular_polynomials import ClassicalModularPolynomialDatabase
-_db = ClassicalModularPolynomialDatabase()
+_db = None
 
 _cache_bound = 100
 _cache = {}
@@ -106,6 +105,7 @@ def classical_modular_polynomial(l, j=None):
         sage: classical_modular_polynomial(l, j) == classical_modular_polynomial(l)(j, Y)
         True
     """
+    global _db
     l = ZZ(l)
 
     if j is None:
@@ -118,13 +118,17 @@ def classical_modular_polynomial(l, j=None):
             pass
 
         try:
+            if _db is None:
+                from sage.databases.db_modular_polynomials import ClassicalModularPolynomialDatabase
+                _db = ClassicalModularPolynomialDatabase()
             Phi = ZZ['X,Y'](_db[l])
-        except ValueError:
+        except (FileNotFoundError, ImportError, ValueError):
             try:
                 pari_Phi = pari.polmodular(l)
             except PariError:
                 raise NotImplementedError('modular polynomial is not in database and computing it on the fly is not yet implemented')
-            d = {(i, j): c for i,f in enumerate(pari_Phi) for j, c in enumerate(f)}
+            d = {(i, j): c for i, f in enumerate(pari_Phi)
+                 for j, c in enumerate(f)}
             Phi = ZZ['X,Y'](d)
 
         if l <= _cache_bound:
@@ -140,8 +144,11 @@ def classical_modular_polynomial(l, j=None):
     if l in _cache:
         return _cache[l](j, Y)
     try:
+        if _db is None:
+            from sage.databases.db_modular_polynomials import ClassicalModularPolynomialDatabase
+            _db = ClassicalModularPolynomialDatabase()
         Phi = _db[l]
-    except ValueError:
+    except (ValueError, ImportError, FileNotFoundError):
         pass
     else:
         if l <= _cache_bound:

sage/schemes/elliptic_curves/padic_lseries.py

@@ -127,18 +127,24 @@ class pAdicLseries(SageObject):
 
     An example showing the calculation of nontrivial Teichmueller twists::
 
+        sage: # needs sage.graphs
         sage: E = EllipticCurve('11a1')
         sage: lp = E.padic_lseries(7)
-        sage: lp.series(4,eta=1)
-        3 + 7^3 + 6*7^4 + 3*7^5 + O(7^6) + (2*7 + 7^2 + O(7^3))*T + (1 + 5*7^2 + O(7^3))*T^2 + (4 + 4*7 + 4*7^2 + O(7^3))*T^3 + (4 + 3*7 + 7^2 + O(7^3))*T^4 + O(T^5)
-        sage: lp.series(4,eta=2)
-        5 + 6*7 + 4*7^2 + 2*7^3 + 3*7^4 + 2*7^5 + O(7^6) + (6 + 4*7 + 7^2 + O(7^3))*T + (3 + 2*7^2 + O(7^3))*T^2 + (1 + 4*7 + 7^2 + O(7^3))*T^3 + (6 + 6*7 + 6*7^2 + O(7^3))*T^4 + O(T^5)
-        sage: lp.series(4,eta=3)
-        O(7^6) + (5 + 4*7 + 2*7^2 + O(7^3))*T + (6 + 5*7 + 2*7^2 + O(7^3))*T^2 + (5*7 + O(7^3))*T^3 + (7 + 4*7^2 + O(7^3))*T^4 + O(T^5)
+        sage: lp.series(4, eta=1)
+        3 + 7^3 + 6*7^4 + 3*7^5 + O(7^6)
+          + (2*7 + 7^2 + O(7^3))*T + (1 + 5*7^2 + O(7^3))*T^2
+          + (4 + 4*7 + 4*7^2 + O(7^3))*T^3 + (4 + 3*7 + 7^2 + O(7^3))*T^4 + O(T^5)
+        sage: lp.series(4, eta=2)
+        5 + 6*7 + 4*7^2 + 2*7^3 + 3*7^4 + 2*7^5 + O(7^6)
+          + (6 + 4*7 + 7^2 + O(7^3))*T + (3 + 2*7^2 + O(7^3))*T^2
+          + (1 + 4*7 + 7^2 + O(7^3))*T^3 + (6 + 6*7 + 6*7^2 + O(7^3))*T^4 + O(T^5)
+        sage: lp.series(4, eta=3)
+        O(7^6) + (5 + 4*7 + 2*7^2 + O(7^3))*T + (6 + 5*7 + 2*7^2 + O(7^3))*T^2
+          + (5*7 + O(7^3))*T^3 + (7 + 4*7^2 + O(7^3))*T^4 + O(T^5)
 
     (Note that the last series vanishes at `T = 0`, which is consistent with ::
 
-        sage: E.quadratic_twist(-7).rank()
+        sage: E.quadratic_twist(-7).rank()                                              # needs sage.graphs
         1
 
     This proves that `E` has rank 1 over `\QQ(\zeta_7)`.)
@@ -311,7 +317,7 @@ class pAdicLseries(SageObject):
             sage: Et = E.quadratic_twist(-4)
             sage: lpt = Et.padic_lseries(5)
             sage: eta = lpt._quotient_of_periods_to_twist(-4)
-            sage: lpt.modular_symbol(0) == lp.modular_symbol(0,quadratic_twist=-4) / eta
+            sage: lpt.modular_symbol(0) == lp.modular_symbol(0, quadratic_twist=-4) / eta           # needs sage.graphs
             True
         """
         if quadratic_twist == +1:
@@ -397,9 +403,10 @@ class pAdicLseries(SageObject):
             sage: L.measure(1,2, quadratic_twist=-4, prec=15)                           # needs sage.graphs
             4 + 4*5 + 4*5^2 + 3*5^3 + 2*5^4 + 5^5 + 3*5^6 + 5^8 + 2*5^9 + 3*5^12 + 2*5^13 + 4*5^14 + O(5^15)
 
+            sage: # needs sage.graphs
             sage: E = EllipticCurve('11a1')
-            sage: a = E.quadratic_twist(-3).padic_lseries(5).measure(1,2,prec=15)
-            sage: b = E.padic_lseries(5).measure(1,2, quadratic_twist=-3,prec=15)
+            sage: a = E.quadratic_twist(-3).padic_lseries(5).measure(1,2, prec=15)
+            sage: b = E.padic_lseries(5).measure(1,2, quadratic_twist=-3, prec=15)
             sage: a == b * E.padic_lseries(5)._quotient_of_periods_to_twist(-3)
             True
         """
@@ -819,13 +826,14 @@ class pAdicLseriesOrdinary(pAdicLseries):
             sage: lp = E.padic_lseries(3)
             sage: lp.series(2, quadratic_twist=-19)                                     # needs sage.graphs
             2 + 2*3 + 2*3^2 + O(3^4) + (1 + O(3))*T + (1 + O(3))*T^2 + O(T^3)
-            sage: E.quadratic_twist(-19).label()    # optional -- database_cremona_ellcurve
+            sage: E.quadratic_twist(-19).label()    # optional -- database_cremona_ellcurve, needs sage.graphs
             '15523a1'
 
         This proves that the rank of '15523a1' is zero, even if ``mwrank`` cannot determine this.
 
         We calculate the `L`-series in the nontrivial Teichmueller components::
 
+            sage: # needs sage.graphs
             sage: L = EllipticCurve('110a1').padic_lseries(5, implementation='sage')
             sage: for j in [0..3]: print(L.series(4, eta=j))
             O(5^6) + (2 + 2*5 + 2*5^2 + O(5^3))*T + (5 + 5^2 + O(5^3))*T^2 + (4 + 4*5 + 2*5^2 + O(5^3))*T^3 + (1 + 5 + 3*5^2 + O(5^3))*T^4 + O(T^5)
@@ -837,16 +845,17 @@ class pAdicLseriesOrdinary(pAdicLseries):
 
             sage: E = EllipticCurve("53a1")
             sage: lp = E.padic_lseries(2)
-            sage: lp.series(7)
+            sage: lp.series(7)                                                          # needs sage.graphs
             O(2^8) + (1 + 2^2 + 2^3 + O(2^5))*T + (1 + 2^3 + O(2^4))*T^2 + (2^2 + 2^3 + O(2^4))*T^3 + (2 + 2^2 + O(2^3))*T^4 + O(T^5)
 
             sage: E = EllipticCurve("109a1")
             sage: lp = E.padic_lseries(2)
-            sage: lp.series(6)
+            sage: lp.series(6)                                                          # needs sage.graphs
             2^2 + 2^6 + O(2^7) + (2 + O(2^4))*T + O(2^3)*T^2 + (2^2 + O(2^3))*T^3 + (2 + O(2^2))*T^4 + O(T^5)
 
         Check that twists by odd Teichmuller characters are ok (:issue:`32258`)::
 
+            sage: # needs sage.graphs
             sage: E = EllipticCurve("443c1")
             sage: lp = E.padic_lseries(17, implementation='num')
             sage: l8 = lp.series(2,eta=8,prec=3)
@@ -1025,6 +1034,7 @@ class pAdicLseriesOrdinary(pAdicLseries):
 
         EXAMPLES::
 
+            sage: # needs sage.graphs
             sage: E = EllipticCurve('11a1')
             sage: Lp = E.padic_lseries(5)
             sage: Lp._c_bound()
@@ -1470,6 +1480,7 @@ class pAdicLseriesSupersingular(pAdicLseries):
 
         EXAMPLES::
 
+            sage: # needs sage.symbolic
             sage: E = EllipticCurve('14a')
             sage: L = E.padic_lseries(5)
             sage: phi = L.frobenius(5)
@@ -1714,6 +1725,7 @@ class pAdicLseriesSupersingular(pAdicLseries):
 
         EXAMPLES::
 
+            sage: # needs sage.symbolic
             sage: E = EllipticCurve('43a')
             sage: L = E.padic_lseries(7)
             sage: L.Dp_valued_regulator(7)