LeanBridge Blueprint

4.1. Elliptic curves🔗

This section lists the LMFDB definitions in the category ec. Each definition links back to its LMFDB knowl. It also lists the knowls about the LMFDB's data on this subject that have mathematical content, from the categories dq, portrait and rcs.

Definition4.1.1
Statement uses 9
Statement dependency previews
Preview
Definition 3.3.8
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Extent of elliptic curve data over number fields. (LMFDB)

Imaginary quadratic fields Most of the elliptic curves in the database defined over number fields are defined over the five Euclidean imaginary quadratic fields fields, with discriminants -3, -4, -7, -8, -11. Over each of these fields the database contains elliptic curves of conductor norm bounded by (respectively) 150000, 100000, 50000, 50000, 50000. Within these bounds the database contains all *modular* elliptic curves; however, modularity has not yet been proved for elliptic curves over imaginary quadratic fields in general, and non-modular curves (if any exist) are not in the database. Assuming modularity, the database is complete within these bounds, by comparison with the database of Bianchi modular forms.

In addition the database contains a small number of elliptic curves with everywhere good reduction defined over some other imaginary quadratic fields.

Totally real fields The database contains elliptic curves defined over totally real fields of degree 2, 3, 4, 5 and 6. For each field the database contains curves of conductor norm up to a bound which depends on the field. Over totally real fields of degree 2 and 3, it is known that all elliptic curves are modular, and hence the database is complete for these fields, by comparison with the database of Hilbert Modular Forms. In higher degrees the database contains elliptic curves matching each of the Hilbert Modular Forms (of parallel weight 2, trivial character and rational coefficients) over the field in question, for fields of degree 2,3,4 and 5, and hence contains all modular elliptic curves of conductor norm up to the bound for that field. Over 21 of the 34 fields of degree 6, the database contains curves matching all of the relevant Hilbert Modular Forms; over the other 13 fields there are a total of 55 isogeny classes missing.

Other fields The only other field for which the database contains elliptic curves is the mixed signature cubic field 3.1.23.1. The elliptic curves here have conductor norm up to 20000 and match automorphic forms over this field. No results on modularity are known for this field, but the curves in the database include all modular curves within these bounds.

For the complete list of fields over which the database contains elliptic curves, the numbers of curves and isogeny classes, and the bounds on the conductor norms in each case, see this page.

Depends on: Definition 4.1.4 Definition 4.1.31 Definition 4.1.35 Definition 4.1.36 Definition 3.3.8 Definition 5.1.1 Definition 5.1.14 Definition 5.1.81 Definition 5.1.87

Definition4.1.2
Statement uses 10
Statement dependency previews
Preview
Definition 2.7
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Reliability of elliptic curve data over number fields. (LMFDB)

The reliability of the completeness claims for the elliptic curves over each number field represented in the database depends on the field and the current status of modularity of elliptic curves over the field in question. Over all totally real fields of degree 2 and 3, and most of degree 4, it is known that all elliptic curves are modular (see for degree 2, for degree 3 and Box (in preparation) for degree 4) and hence the database contains all curves of conductor norm up to the bound for that field. Over other fields we can only say that the database contains all *modular* elliptic curves within this range. Over totally real fields of degrees 4, 5 and 6 all the curves in the database have been proved to be modular, using the criteria of , and over imaginary quadratic fields of class number 1, all the curves in the database have also been proved to be modular using the 2-adic Faltings-Serre method or its 3-adic analogue.

All the data for each individual elliptic curve has been computed rigorously with no unproved conjectures or assumptions being used, except for some of the BSD invariants:

  • the analytic rank and special L-value were computed using the Magma function <tt>AnalyticRank()</tt>, which assumes that the L-function satisfies the Hasse-Weil conjecture and computes successive derivatives at the critial point to a fixed precision until it finds a non-zero value. This assumption on the Hasse-Weil conjecture is satisfied by all the elliptic curves in the database which are known to be modular.

  • the analytic order of \Sha was in all cases computed approximately from its definition, given by the BSD formula, and rounded to the nearest integer; in all cases this is a positive integer square.

Depends on: Definition 4.1.4 Definition 4.1.9 Definition 4.1.35 Definition 4.2.27 Definition 2.7 Definition 2.9 Definition 2.45 Definition 5.1.1 Definition 5.1.14 Definition 5.1.87

Definition4.1.3
Statement uses 8
Statement dependency previews
Preview
Definition 4.1.8
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Source of elliptic curve data over number fields. (LMFDB)

Source of the curves

The elliptic curves over number fields other than \Q come from several sources.

Imaginary quadratic fields The curves defined over the five Euclidean Imaginary quadratic fields consist of the curves in John Cremona's 1981 thesis, extended by him with Warren Moore in 2014 to conductor norm 10000. Curves were found to match almost all the cuspidal Bianchi newforms (with trivial character, weight 2 and rational coefficients) in the database, using custom code by Cremona and Moore, supplemented by Magma's EllipticCurveSearch function written by Steve Donnelly; in the remaining cases it has been proved that there is no matching curve. Additionally, curves with CM by the field in question, which are not associated to cuspidal Bianchi newforms, were found from their j-invariants by Cremona.

Totally real fields Over \Q(\sqrt{5}) the curves of conductor norm up to about 5000 were provided by Alyson Deines from joint work of Jonathan Bober, Alyson Deines, Ariah Klages-Mundt, Benjamin LeVeque, R. Andrew Ohana, Ashwath Rabindranath, Paul Sharaba and William Stein (see http://arxiv.org/abs/1202.6612). All the other curves were found from their associated Hilbert newforms using Magma's EllipticCurveSearch function, using a script written by John Cremona. This process is still ongoing: it is complete for fields of degree {}<6, but a few curves are still missing over 13 of the 55 sextic fields represented in the database. Otherwise the extent of the data matches that of the Hilbert Modular Form data for totally real fields of degrees 2, 3, 4, 5 and 6.

Other fields

  • Steve Donnelly, Paul E. Gunnells, Ariah Klages-Mundt, and Dan Yasaki provided the curves over the mixed cubic field 3.1.23.1.

  • Marc Masdeu provided \Q-curves over quadratic fields.

  • Haluk Sengun provided curves with everywhere good reduction over imaginary quadratic fields.

  • S. Yokoyama and Masdeu provided curves with everywhere good reduction over real quadratic fields (see here).

In some cases the same curve occurs in more than one of the above sources, in which case efforts have been made not to include it more than once in the database.

Source of the data for each curve

Models For each curve, the model in the database is a global minimal model where one exists (for example when the base field has class number one), and otherwise a semi-minimal model which is nonminimal at precisely one prime. These (semi-)minimal models we computed in SageMath using code written by John Cremona. Among all (semi-)minimal models we scale by units in order to minimize the archimedean embeddings of c_4 and c_4 simultaneously using a lattice basis reduction method, also implemented in SageMath by John Cremona.

Local data Conductors and local reduction data were computed using Tate's Algorithm, as implemented in SageMath by John Cremona, except for the local root numbers which were computed using Magma

Isogenies Complete isogeny classes were computed using implementations in SageMath by John Cremona and Ciaran Schembri of Billerey's algorithm (to determine the reducible primes) and Kohel-Ve;lu formulas.

Mordell-Weil groups and generators Where these exist in the database they were computed by John Cremona using Magma's MordellWeilShaInformation function, implemented by Steve Donnelly

Galois representations The images of mod-\ell Galois representations were computed by Andrew Sutherland using the methods described in (including a generalization to handle curves with complex multiplication).

Base change and \mathbb{Q}-curves The property of being the base change of an elliptic curve over \mathbb{Q} and of being a \mathbb{Q}-curve were computed by John Cremona using his implementation in SageMath.

Depends on: Definition 4.1.8 Definition 4.1.11 Definition 4.1.29 Definition 4.1.36 Definition 4.1.47 Definition 8.3.60 Definition 5.1.7 Definition 5.1.14

Definition4.1.4
Statement uses 3
Statement dependency previews
Preview
Definition 1.2.16
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 114
Reverse dependency previews
Preview
Definition 1.2.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Elliptic curve over a field. (LMFDB)

An elliptic curve E over a field k is a smooth projective curve of genus 1 together with a distinguished k-rational point O.

The most commonly used model for elliptic curves is a Weierstrass model: a smooth plane cubic with the point O as the unique point at infinity.

Tau Ceti Review: WeierstrassCurve.IsElliptic.

Depends on: Definition 1.2.16 Definition 1.2.17 Definition 1.2.18

Lean code for Definition4.1.4●1 definition
  • class(1 method)defined in Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean
    complete
    class WeierstrassCurve.IsElliptic.{u} {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) : Prop
    class WeierstrassCurve.IsElliptic.{u}
      {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) : Prop
    `WeierstrassCurve.IsElliptic` is a typeclass which asserts that a Weierstrass curve is an
    elliptic curve: that its discriminant is a unit. Note that this definition is only mathematically
    accurate for certain rings whose Picard group has trivial 12-torsion, such as a field or a PID. 
    isUnit : IsUnit W.Δ
Definition4.1.5
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 4.1.7
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Additive reduction. (LMFDB)

An elliptic curve E defined over a number field K is said to have additive reduction at a prime \mathfrak{p} of K if the reduction of E modulo \mathfrak{p} has a cuspidal singularity.

Tau Ceti Review: WeierstrassCurve.HasAdditiveReduction, WeierstrassCurve.reduction.

Depends on: Definition 4.1.4 Definition 5.1.1

Lean code for Definition4.1.5●6 declarations
  • class(extends 1, 3 methods)defined in Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    class WeierstrassCurve.HasAdditiveReduction.{u_1, u_2} (R : Type u_1)
      [CommRing R] [IsDomain R] [IsDiscreteValuationRing R] {K : Type u_2}
      [Field K] [Algebra R K] [IsFractionRing R K]
      (W : WeierstrassCurve K) : Prop
    class WeierstrassCurve.HasAdditiveReduction.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K) : Prop
    A minimal Weierstrass equation has additive reduction if and only if
    the valuation of its discriminant is less than 1 and the valuation of `a₄` is less than 1. 
    • WeierstrassCurve.IsMinimal R W
    val_Δ_maximal : MaximalFor (fun C => WeierstrassCurve.IsIntegral R (C • W)) (fun C => WeierstrassCurve.valuation_Δ_aux R (C • W)) 1
    Inherited from
    1. WeierstrassCurve.IsMinimal
    badReduction : (IsDedekindDomain.HeightOneSpectrum.valuation K (IsDiscreteValuationRing.maximalIdeal R)) W.Δ < 1
    additiveReduction : (IsDedekindDomain.HeightOneSpectrum.valuation K (IsDiscreteValuationRing.maximalIdeal R)) W.c₄ < 1
  • defdefined in Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    def WeierstrassCurve.reduction.{u_1, u_2} (R : Type u_1) [CommRing R]
      [IsDomain R] [IsDiscreteValuationRing R] {K : Type u_2} [Field K]
      [Algebra R K] [IsFractionRing R K] (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve (IsLocalRing.ResidueField R)
    def WeierstrassCurve.reduction.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve
        (IsLocalRing.ResidueField R)
    The reduction of a Weierstrass curve over `K` given by a minimal Weierstrass equation,
    which is a Weierstrass curve over the residue field of `R`. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.HasCusp.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    def WeierstrassCurve.HasCusp.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    A Weierstrass curve `W` over a field `F` has a **cuspidal singularity** (LMFDB
    `ec.additive_reduction`, `ec.reduction_type`): over an algebraic closure of `F` it has a singular
    point with a single tangent slope, that is, a single tangent line. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.Affine.IsTangentSlope.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F) (x₀ y₀ m : F) : Prop
    def WeierstrassCurve.Affine.IsTangentSlope.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      (x₀ y₀ m : F) : Prop
    A **tangent slope** of a Weierstrass curve `W` at a singular point `(x₀, y₀)` (LMFDB
    `ec.split_multiplicative_reduction`): the line `y - y₀ = m (x - x₀)` meets the curve at `(x₀, y₀)`
    with multiplicity at least `3`, that is, `t³` divides the Weierstrass polynomial restricted to the
    line `t ↦ (x₀ + t, y₀ + m t)`. A singular point is a double point: every line through it meets the
    curve there with multiplicity at least `2`, and the tangent lines are those meeting it with higher
    multiplicity. The predicate is only used at singular points: at a nonsingular point the tangent
    line meets the curve with multiplicity at least `2`, and at least `3` only at a flex. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasAdditiveReduction_iff_hasCusp.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      {W : WeierstrassCurve K} [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasAdditiveReduction R W ↔
        (WeierstrassCurve.reduction R W).HasCusp
    theorem WeierstrassCurve.hasAdditiveReduction_iff_hasCusp.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      {W : WeierstrassCurve K}
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasAdditiveReduction R
          W ↔
        (WeierstrassCurve.reduction R
            W).HasCusp
    **Additive reduction is cuspidal reduction** (Silverman VII.5.1): a minimal equation has
    additive reduction, Mathlib's `v(Δ) < 1` and `v(c₄) < 1`, exactly when its reduction has a cusp. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasCusp_iff.{u_1} {F : Type u_1} [Field F]
      {W : WeierstrassCurve F} : W.HasCusp ↔ W.Δ = 0 ∧ W.c₄ = 0
    theorem WeierstrassCurve.hasCusp_iff.{u_1}
      {F : Type u_1} [Field F]
      {W : WeierstrassCurve F} :
      W.HasCusp ↔ W.Δ = 0 ∧ W.c₄ = 0
    **A Weierstrass curve has a cusp exactly when `Δ = c₄ = 0`** (Silverman III.1.4). 
Definition4.1.6
Statement uses 16
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Definition 4.1.9
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Analytic order of \Sha. (LMFDB)

The Tate-Shafarevich group \Sha of an elliptic curve E defined over a number field K is a torsion abelian group, which can be defined in terms of Galois cohomology as

\Sha(E) := \ker\left(H^1(G_K,E) \to \prod_v H^1(G_{K_v},E_{K_v}) \right),

where v runs over all places of K (finite and infinite), K_v is the completion of K at v, E_{K_v} is the base change of E to K_v, and G_K and G_{K_v} denote absolute Galois groups.

The group \Sha is conjectured to be finite, and its order appears in the strong form of the Birch-Swinnerton-Dyer Conjecture for E. The order implied by the conjecture is called the analytic order of Sha and can be defined as the real number

\Sha_{\text{an}} := |D_K|^{1/2}\cdot \frac{L^{(r)}(E,1)} {r!} \cdot \frac{\#E(K)_{\rm tor}^2}{\mathrm{Reg}_{\rm NT}(E/K)} \cdot \frac{1}{ \Omega(E/K) \cdot \prod_{\mathfrak{p}} c_{\mathfrak{p}}}.

Here D_K is the discriminant of K, L(E,s) is the L-function of E/K, r is the analytic rank of E/K, \mathrm{Reg}_{\rm NT}(E/K) is the Neron-Tate (un-normalised) regulator of E/K, E(K)_{\rm tor} is the torsion subgroup of the Mordell-Weil group E(K), \Omega(E/K) is the global period of E/K, and c_{\mathfrak{p}} is the Tamagawa number of E at the prime \mathfrak{p} of K.

It is known that if \Sha is finite then its order is a square, so one expects the real number \Sha_{\text{an}} to always be a square integer.

For elliptic curves defined over \Q of rank 0 or 1, it is a theorem that \Sha<sub>an</sub> is a positive rational number, and this rational number can in principle be computed exactly. This exact computation has only been carried out for the curves in the database with rank 0. For curves of rank 2 and above, there is no such theorem, and the values computed are floating point approximate values which are very close to integers. In the LMFDB we store and display the rounded values in this case.

Depends on: Definition 4.1.4 Definition 4.1.8 Definition 4.1.54 Definition 4.1.62 Definition 4.1.105 Definition 4.1.108 Definition 4.1.117 Definition 4.1.119 Definition 8.3.5 Definition 8.3.56 Definition 8.3.97 Definition 8.3.178 Definition 5.1.1 Definition 5.1.17 Definition 5.1.61 Definition 5.1.64

Definition4.1.7
Statement uses 7
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Definition 4.1.12
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Bad reduction of an elliptic curve at a prime. (LMFDB)

An elliptic curve E defined over a number field K is said to have bad reduction at a prime \mathfrak{p} of K if the reduction of E modulo \mathfrak{p} is singular. There are three types of bad reduction:

A curve has bad reduction at \mathfrak{p} if and only if \mathfrak{p} divides its discriminant.

Depends on: Definition 4.1.4 Definition 4.1.5 Definition 4.1.19 Definition 4.1.59 Definition 4.1.116 Definition 5.1.1 Definition 5.1.64

Lean code for Definition4.1.7●1 definition
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    def WeierstrassCurve.IsBadReduction.{u, v} (R : Type v) [CommRing R]
      [IsDomain R] [IsDiscreteValuationRing R] {K : Type u} [Field K]
      [Algebra R K] [IsFractionRing R K] (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] : Prop
    def WeierstrassCurve.IsBadReduction.{u, v}
      (R : Type v) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R] {K : Type u}
      [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] : Prop
    A minimal Weierstrass curve over `K` has **bad reduction** (LMFDB `ec.bad_reduction`) if it
    does not have good reduction, i.e. its reduction over the residue field of `R` is singular. 
Definition4.1.8
uses 1
Used by 7
Reverse dependency previews
Preview
Definition 4.1.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Base change. (LMFDB)

If E is an elliptic curve defined over a field K, and L is an extension field of K, then the same equation defining E as an elliptic curve over K also defines a curve over L called the base change of E from K to L. Any curve defined over L which is isomorphic to E over L is called a base-change curve from K to L. A sufficient but not necessary condition for a curve to be a base change is that the coefficients of its Weierstrass equation lie in K.

When K=\Q and L is a number field, elliptic curves over L which are base-changes of curves over \Q may simply be called base-change curves. A necessary, but not sufficient, condition for this is that the j-invariant of E should be in \Q.

Tau Ceti Review: WeierstrassCurve.baseChange.

Depends on: Definition 4.1.43

Lean code for Definition4.1.8●6 declarations
  • defdefined in Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean
    complete
    def WeierstrassCurve.baseChange.{u, v} {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) (A : Type v) [CommRing A] [Algebra R A] :
      WeierstrassCurve A
    def WeierstrassCurve.baseChange.{u, v}
      {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) (A : Type v)
      [CommRing A] [Algebra R A] :
      WeierstrassCurve A
    The Weierstrass curve base changed to an algebra `A` over `R`. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/BaseChangeCurve.lean
    complete
    def WeierstrassCurve.IsBaseChangeCurve.{u_1, u_2} (K : Type u_1) [Field K]
      {L : Type u_2} [Field L] [Algebra K L] (W : WeierstrassCurve L) : Prop
    def WeierstrassCurve.IsBaseChangeCurve.{u_1,
        u_2}
      (K : Type u_1) [Field K] {L : Type u_2}
      [Field L] [Algebra K L]
      (W : WeierstrassCurve L) : Prop
    A Weierstrass curve `W` over a field extension `L` of `K` is a **base-change curve from `K` to
    `L`** (LMFDB `ec.base_change`): it is isomorphic over `L`, by a change of variables, to the base
    change `E⁄L` of an elliptic curve `E` over `K`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/BaseChangeCurve.lean
    complete
    theorem WeierstrassCurve.isBaseChangeCurve_baseChange.{u_1, u_2} {K : Type u_1}
      [Field K] {L : Type u_2} [Field L] [Algebra K L]
      (E : WeierstrassCurve K) [(E.baseChange L).IsElliptic] :
      WeierstrassCurve.IsBaseChangeCurve K (E.baseChange L)
    theorem WeierstrassCurve.isBaseChangeCurve_baseChange.{u_1,
        u_2}
      {K : Type u_1} [Field K] {L : Type u_2}
      [Field L] [Algebra K L]
      (E : WeierstrassCurve K)
      [(E.baseChange L).IsElliptic] :
      WeierstrassCurve.IsBaseChangeCurve K
        (E.baseChange L)
    **A curve whose coefficients lie in `K` is a base-change curve from `K`.** 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/BaseChangeCurve.lean
    complete
    theorem WeierstrassCurve.not_exists_baseChange_eq_translate_x_cube_add_one :
      ¬∃ E,
          E.baseChange (QuadraticAlgebra ℚ 2 0) =
            { u := 1, r := QuadraticAlgebra.omega, s := 0, t := 0 } •
              { a₁ := 0, a₂ := 0, a₃ := 0, a₄ := 0, a₆ := 1 }.baseChange
                (QuadraticAlgebra ℚ 2 0)
    theorem WeierstrassCurve.not_exists_baseChange_eq_translate_x_cube_add_one :
      ¬∃ E,
          E.baseChange
              (QuadraticAlgebra ℚ 2 0) =
            { u := 1,
                r := QuadraticAlgebra.omega,
                s := 0, t := 0 } •
              { a₁ := 0, a₂ := 0, a₃ := 0,
                    a₄ := 0,
                    a₆ := 1 }.baseChange
                (QuadraticAlgebra ℚ 2 0)
    **The translate by `√2` of `y² = x³ + 1` does not have its coefficients in `ℚ`**: its `a₂`
    is `3 √2`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/BaseChangeCurve.lean
    complete
    theorem WeierstrassCurve.IsBaseChangeCurve.j_mem_range.{u_1, u_2} {K : Type u_1}
      [Field K] {L : Type u_2} [Field L] [Algebra K L]
      {W : WeierstrassCurve L} [W.IsElliptic]
      (h : WeierstrassCurve.IsBaseChangeCurve K W) :
      W.j ∈ (algebraMap K L).range
    theorem WeierstrassCurve.IsBaseChangeCurve.j_mem_range.{u_1,
        u_2}
      {K : Type u_1} [Field K] {L : Type u_2}
      [Field L] [Algebra K L]
      {W : WeierstrassCurve L} [W.IsElliptic]
      (h :
        WeierstrassCurve.IsBaseChangeCurve K
          W) :
      W.j ∈ (algebraMap K L).range
    **The `j`-invariant of a base-change curve from `K` lies in `K`.** 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/BaseChangeCurve.lean
    complete
    theorem WeierstrassCurve.not_isBaseChangeCurve_x_cube_add_one_add_sqrt_two :
      ¬WeierstrassCurve.IsBaseChangeCurve ℚ
          { a₁ := 0, a₂ := 0, a₃ := 0, a₄ := 0,
            a₆ := 1 + QuadraticAlgebra.omega }
    theorem WeierstrassCurve.not_isBaseChangeCurve_x_cube_add_one_add_sqrt_two :
      ¬WeierstrassCurve.IsBaseChangeCurve ℚ
          { a₁ := 0, a₂ := 0, a₃ := 0,
            a₄ := 0,
            a₆ := 1 + QuadraticAlgebra.omega }
    **The curve `y² = x³ + 1 + √2` over `ℚ(√2)` is not a base-change curve from `ℚ`**: its `c₆`
    is `-864 (1 + √2)`, which is not a rational number times a square. 
Definition4.1.9
Statement uses 15
Statement dependency previews
Preview
Definition 1.2.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 4.1.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Birch Swinnerton-Dyer conjecture. (LMFDB)

The Birch and Swinnerton-Dyer conjecture (BSD) is one of the Millennium Prize Problems listed by the Clay Mathematics Institute. It relates the order of vanishing (or analytic rank) and the leading coefficient of the L-function associated to an elliptic curve E defined over a number field K at the central point s=1 to certain arithmetic data, the BSD invariants of E.

  • The weak form of the BSD conjecture states just that the analytic rank r_{an} (that is, the order of vanishing of vanishing of L(E,s) at s=1), is equal to the rank r of E/K.

  • The strong form of the conjecture states that r=r_{an} and also that the leading coefficient of the L-function is given by the formula

\frac{1}{r!} L^{(r)}(E,1) = \frac{1}{|d_K|^{1/2}}\cdot \frac{\# \Sha(E/K)\cdot \Omega(E/K) \cdot \mathrm{Reg}_{\rm NT}(E/K) \cdot \prod_{\mathfrak{p}} c_{\mathfrak{p}}}{\#E(K)_{\rm tor}^2}.

The quantities appearing in this formula are as follows:

Implicit in the strong form of the conjecture is that the Tate-Shafarevich group \Sha(E/K) is finite.

There is a similar conjecture for abelian varieties over number fields.

Tau Ceti Review: WeierstrassCurve.Affine.regulator.

Depends on: Definition 1.2.2 Definition 4.1.4 Definition 4.1.6 Definition 4.1.62 Definition 4.1.105 Definition 4.1.108 Definition 4.1.117 Definition 4.1.119 Definition 2.7 Definition 2.9 Definition 2.13 Definition 2.45 Definition 5.1.1 Definition 5.1.17 Definition 5.1.64

Lean code for Definition4.1.9●5 declarations
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/BSD/Conjecture.lean
    complete
    def WeierstrassCurve.BirchSwinnertonDyer.{u_1} {K : Type u_1} [Field K]
      [NumberField K] [DecidableEq K] (W : WeierstrassCurve K)
      [W.IsElliptic] : Prop
    def WeierstrassCurve.BirchSwinnertonDyer.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [DecidableEq K] (W : WeierstrassCurve K)
      [W.IsElliptic] : Prop
    The **Birch and Swinnerton-Dyer conjecture** (LMFDB `ec.bsdconjecture`, `ec.q.bsdconjecture`)
    for an elliptic curve `E` over a number field `K`: its L-function `L(E / K, s)` is an analytic
    L-function, whose analytic rank `r`, its order of vanishing at `s = 1`, is the rank of the
    Mordell-Weil group `E(K)`; the Tate–Shafarevich group `Ш(E / K)` is finite; and
    
    `L⁽ʳ⁾(E, 1) / r! = #Ш(E / K) Ω(E / K) Reg_NT(E / K) ∏_𝔭 c_𝔭 / (|d_K| ^ (1 / 2) #E(K)_tors ^ 2)`,
    
    where `Ω(E / K)` is the global period, `Reg_NT(E / K)` is the Néron-Tate regulator, the `c_𝔭` are
    the Tamagawa numbers and `d_K` is the discriminant of `K`. The existence of the analytic
    L-function, a theorem over `ℚ` by modularity, and the finiteness of Ш are implicit in the LMFDB's
    statement. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/BSD/Conjecture.lean
    complete
    def WeierstrassCurve.WeakBirchSwinnertonDyer.{u_1} {K : Type u_1} [Field K]
      [NumberField K] [DecidableEq K] (W : WeierstrassCurve K) : Prop
    def WeierstrassCurve.WeakBirchSwinnertonDyer.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [DecidableEq K]
      (W : WeierstrassCurve K) : Prop
    The **weak Birch and Swinnerton-Dyer conjecture** (LMFDB `ec.bsdconjecture`) for a Weierstrass
    curve `E` over a number field `K`: its L-function `L(E / K, s)` is an analytic L-function, whose
    analytic rank, its order of vanishing at `s = 1`, is the rank of the Mordell-Weil group
    `E(K)`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/BSD/Conjecture.lean
    complete
    theorem WeierstrassCurve.birchSwinnertonDyer_iff.{u_1} {K : Type u_1} [Field K]
      [NumberField K] [DecidableEq K] {W : WeierstrassCurve K}
      [W.IsElliptic] {L : AnalyticLFunction}
      (hL : W.IsAnalyticLFunction L) :
      W.BirchSwinnertonDyer ↔
        L.analyticRank = Module.finrank ℤ W.toAffine.Point ∧
          Finite ↥W.sha ∧
            L.leadingCoeff =
              ↑(↑(Nat.card ↥W.sha) * W.globalPeriod * W.toAffine.regulator *
                    ↑W.tamagawaProduct /
                  (√|↑(NumberField.discr K)| *
                    ↑(Nat.card ↥(AddCommGroup.torsion W.toAffine.Point)) ^
                      2))
    theorem WeierstrassCurve.birchSwinnertonDyer_iff.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [DecidableEq K] {W : WeierstrassCurve K}
      [W.IsElliptic] {L : AnalyticLFunction}
      (hL : W.IsAnalyticLFunction L) :
      W.BirchSwinnertonDyer ↔
        L.analyticRank =
            Module.finrank ℤ
              W.toAffine.Point ∧
          Finite ↥W.sha ∧
            L.leadingCoeff =
              ↑(↑(Nat.card ↥W.sha) *
                        W.globalPeriod *
                      W.toAffine.regulator *
                    ↑W.tamagawaProduct /
                  (√|↑(NumberField.discr K)| *
                    ↑(Nat.card
                          ↥(AddCommGroup.torsion
                              W.toAffine.Point)) ^
                      2))
    The Birch and Swinnerton-Dyer conjecture, for an analytic L-function of the curve. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/GlobalPeriod.lean
    complete
    def WeierstrassCurve.globalPeriod.{u_1} {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) [W.IsElliptic] [NumberField K] : ℝ
    def WeierstrassCurve.globalPeriod.{u_1}
      {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) [W.IsElliptic]
      [NumberField K] : ℝ
    The **global period** `Ω(E/K) = |N(Δ) / N(𝔡)| ^ (1/12) ∏_v Ω_v(E_v)` (LMFDB `ec.period`) of an
    elliptic curve over a number field `K`, where `Δ` is the discriminant of the equation `W`, `𝔡` the
    minimal discriminant ideal, `N` the norm and the product runs over the infinite places of `K`. On a
    global minimal model it is `∏_v Ω_v(E_v)`, and it does not depend on the model. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MordellWeil/Regulator/Basic.lean
    complete
    def WeierstrassCurve.Affine.regulator.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F) [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)]
      [Module.Finite ℤ W.PointModTorsion] : ℝ
    def WeierstrassCurve.Affine.regulator.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)]
      [Module.Finite ℤ W.PointModTorsion] : ℝ
    **The regulator** of an elliptic curve whose points modulo torsion are finitely generated as a
    `ℤ`-module: the absolute determinant of the Gram matrix of the Néron-Tate pairing on any basis of
    that quotient. For a curve of rank zero this is the empty determinant, namely `1`. 
Definition4.1.10
Statement uses 4
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.1.95
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Canonical height on an elliptic curve. (LMFDB)

Let E be an elliptic curve defined over a number field K. The canonical height on E is a function

\hat{h}: E(K) \to \R_{ {}\ge0}

defined on the Mordell-Weil group E(K) which induces a positive definite quadratic form on E(K)\otimes\R.

One definition of \hat{h}(P) is

\hat{h}(P)=\lim_{n\to\infty} n^{-2}h\bigl(x(nP)\bigr), where h(x) is the Weil height of x\in K. This definition gives the non-normalised height. A normalised height which is invariant under base-change is given by

\frac{1}{[K:\Q]} \hat{h}(P).

Related to the canonical height is the height pairing

\langle-,-\rangle : E(K)\times E(K) \to \R

defined by \langle P,Q\rangle = \frac{1}{2}(\hat{h}(P+Q)-\hat{h}(P)-\hat{h}(Q)), which is a positive definite quadratic form on E(K)\otimes\R, used in defining the regulator of E/K.

Tau Ceti Review: WeierstrassCurve.Affine.Point.canonicalHeight, WeierstrassCurve.Affine.Point.tendsto_naiveHeight_nsmul_div_sq, WeierstrassCurve.Affine.Point.canonicalHeight_nonneg, WeierstrassCurve.Affine.posDef_neronTateGramMatrix, WeierstrassCurve.Affine.neronTatePairing, WeierstrassCurve.Affine.neronTatePairing_apply.

Depends on: Definition 4.1.4 Definition 4.1.54 Definition 5.1.1 Definition 5.1.92

Lean code for Definition4.1.10●8 declarations
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/CanonicalHeight/Basic.lean
    complete
    def WeierstrassCurve.Affine.Point.canonicalHeight.{u_1} {F : Type u_1}
      [Field F] {W : WeierstrassCurve.Affine F}
      [Height.AdmissibleAbsValues F] [DecidableEq F] (P : W.Point) : ℝ
    def WeierstrassCurve.Affine.Point.canonicalHeight.{u_1}
      {F : Type u_1} [Field F]
      {W : WeierstrassCurve.Affine F}
      [Height.AdmissibleAbsValues F]
      [DecidableEq F] (P : W.Point) : ℝ
    **The canonical (Néron–Tate) height** `canonicalHeight P = lim h(2ⁿ P) / 4ⁿ`,
    normalised against the naïve height of the `x`-coordinate.
    
    The limit exists whenever the curve is elliptic
    (`Point.tendsto_naiveHeight_two_pow_nsmul_div_four_pow`); the definition itself needs no hypothesis
    beyond those making `2 ^ n • P` meaningful, so it is stated without one. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/CanonicalHeight/Limit.lean
    complete
    theorem WeierstrassCurve.Affine.Point.tendsto_naiveHeight_nsmul_div_sq.{u_1}
      {F : Type u_1} [Field F] [Height.AdmissibleAbsValues F]
      [DecidableEq F] {W : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)]
      (P : W.Point) :
      Filter.Tendsto (fun n => (n • P).naiveHeight / ↑n ^ 2) Filter.atTop
        (nhds P.canonicalHeight)
    theorem WeierstrassCurve.Affine.Point.tendsto_naiveHeight_nsmul_div_sq.{u_1}
      {F : Type u_1} [Field F]
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      {W : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)]
      (P : W.Point) :
      Filter.Tendsto
        (fun n =>
          (n • P).naiveHeight / ↑n ^ 2)
        Filter.atTop (nhds P.canonicalHeight)
    The classical limit formula for the canonical height, along all natural multiples. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/CanonicalHeight/Basic.lean
    complete
    theorem WeierstrassCurve.Affine.Point.canonicalHeight_nonneg.{u_1}
      {F : Type u_1} [Field F] {W : WeierstrassCurve.Affine F}
      [Height.AdmissibleAbsValues F] [DecidableEq F]
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)]
      (P : W.Point) : 0 ≤ P.canonicalHeight
    theorem WeierstrassCurve.Affine.Point.canonicalHeight_nonneg.{u_1}
      {F : Type u_1} [Field F]
      {W : WeierstrassCurve.Affine F}
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)]
      (P : W.Point) : 0 ≤ P.canonicalHeight
    **The canonical height is non-negative.** This is what makes it a candidate for the
    positive-definite form behind the Néron–Tate pairing and the regulator, and what lets
    `canonicalHeight P = 0` be a meaningful characterisation of torsion rather than one inequality
    among two. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MordellWeil/PointModTorsion/Basic.lean
    complete
    theorem WeierstrassCurve.Affine.posDef_neronTateGramMatrix.{u_1, u_2}
      {F : Type u_1} [Field F] (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F] [DecidableEq F]
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)]
      [Northcott WeierstrassCurve.Affine.Point.canonicalHeight]
      {ι : Type u_2} [Finite ι] (b : Module.Basis ι ℤ W.PointModTorsion) :
      (W.neronTateGramMatrix b).PosDef
    theorem WeierstrassCurve.Affine.posDef_neronTateGramMatrix.{u_1,
        u_2}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)]
      [Northcott
          WeierstrassCurve.Affine.Point.canonicalHeight]
      {ι : Type u_2} [Finite ι]
      (b :
        Module.Basis ι ℤ W.PointModTorsion) :
      (W.neronTateGramMatrix b).PosDef
    The Gram matrix of the Néron–Tate pairing is positive definite under Northcott finiteness,
    for every finite basis of the points modulo torsion. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/CanonicalHeight/Basic.lean
    complete
    def WeierstrassCurve.Affine.neronTatePairing.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F) [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)] :
      LinearMap.BilinMap ℤ W.Point ℝ
    def WeierstrassCurve.Affine.neronTatePairing.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)] :
      LinearMap.BilinMap ℤ W.Point ℝ
    **The Néron–Tate pairing** `⟨P, Q⟩`, the bilinear form associated with the canonical height.
    It is Mathlib's `QuadraticMap.associated'`, the halved polar form. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/CanonicalHeight/Basic.lean
    complete
    theorem WeierstrassCurve.Affine.neronTatePairing_apply.{u_1} {F : Type u_1}
      [Field F] {W : WeierstrassCurve.Affine F}
      [Height.AdmissibleAbsValues F] [DecidableEq F]
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)]
      (P Q : W.Point) :
      (W.neronTatePairing P) Q =
        ((P + Q).canonicalHeight - P.canonicalHeight - Q.canonicalHeight) /
          2
    theorem WeierstrassCurve.Affine.neronTatePairing_apply.{u_1}
      {F : Type u_1} [Field F]
      {W : WeierstrassCurve.Affine F}
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)]
      (P Q : W.Point) :
      (W.neronTatePairing P) Q =
        ((P + Q).canonicalHeight -
              P.canonicalHeight -
            Q.canonicalHeight) /
          2
    **The Néron–Tate pairing is the polarisation of the canonical height**: its value at `P, Q`
    is half of `canonicalHeight (P + Q) - canonicalHeight P - canonicalHeight Q`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/CanonicalHeightBaseChange.lean
    complete
    theorem WeierstrassCurve.Affine.Point.canonicalHeight_mapAlong.{u_1, u_2}
      {K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L]
      {W : WeierstrassCurve.Affine K} (P : W.Point) [NumberField K]
      [NumberField L] [DecidableEq K] [DecidableEq L]
      [WeierstrassCurve.IsElliptic W] :
      (WeierstrassCurve.Affine.Point.mapAlong (algebraMap K L) ⋯
            P).canonicalHeight =
        ↑(Module.finrank K L) * P.canonicalHeight
    theorem WeierstrassCurve.Affine.Point.canonicalHeight_mapAlong.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K]
      [Field L] [Algebra K L]
      {W : WeierstrassCurve.Affine K}
      (P : W.Point) [NumberField K]
      [NumberField L] [DecidableEq K]
      [DecidableEq L]
      [WeierstrassCurve.IsElliptic W] :
      (WeierstrassCurve.Affine.Point.mapAlong
            (algebraMap K L) ⋯
            P).canonicalHeight =
        ↑(Module.finrank K L) *
          P.canonicalHeight
    **The canonical height over a finite extension `L / K` is `[L : K]` times the canonical height
    over `K`**: `ĥ_L(P) = [L : K] ĥ_K(P)` for a point `P` of `W(K)`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/CanonicalHeightBaseChange.lean
    complete
    theorem WeierstrassCurve.Affine.Point.canonicalHeight_mapAlong_div_finrank.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L]
      {W : WeierstrassCurve.Affine K} (P : W.Point) [NumberField K]
      [NumberField L] [DecidableEq K] [DecidableEq L]
      [WeierstrassCurve.IsElliptic W] :
      (WeierstrassCurve.Affine.Point.mapAlong (algebraMap K L) ⋯
              P).canonicalHeight /
          ↑(Module.finrank ℚ L) =
        P.canonicalHeight / ↑(Module.finrank ℚ K)
    theorem WeierstrassCurve.Affine.Point.canonicalHeight_mapAlong_div_finrank.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K]
      [Field L] [Algebra K L]
      {W : WeierstrassCurve.Affine K}
      (P : W.Point) [NumberField K]
      [NumberField L] [DecidableEq K]
      [DecidableEq L]
      [WeierstrassCurve.IsElliptic W] :
      (WeierstrassCurve.Affine.Point.mapAlong
              (algebraMap K L) ⋯
              P).canonicalHeight /
          ↑(Module.finrank ℚ L) =
        P.canonicalHeight /
          ↑(Module.finrank ℚ K)
    **The normalised canonical height `ĥ / [K : ℚ]` is invariant under base change** (LMFDB
    `ec.regulator`): for a finite extension `L / K` of number fields and a point `P` of `W(K)`,
    `ĥ_L(P) / [L : ℚ] = ĥ_K(P) / [K : ℚ]`. 
Definition4.1.11
Statement uses 8
Statement dependency previews
Preview
Definition 1.1.27
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 15
Reverse dependency previews
Preview
Definition 4.1.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Complex multiplication. (LMFDB)

An elliptic curve whose endomorphism ring is larger than \Z is said to have complex multiplication (often abbreviated to CM). In this case, for curves defined over fields of characteristic zero, the endomorphism ring is isomorphic to an order in an imaginary quadratic field. The discriminant of this order is the CM discriminant.

An elliptic curve whose geometric endomorphism ring is larger than \Z is said to have potential complex multiplication (potential CM). In the literature, these too are often called CM elliptic curves.

The property of having potential CM depends only on the j-invariant of the curve. In characteristic 0, CM j-invariants are algebraic integers, and there are only finitely many in any given number field. There are precisely 13 CM j-invariants in \Q (all integers), associated to the 13 imaginary quadratic orders of class number 1:

\begin{array}{c|ccccccccccccc} j & -12288000 & 54000 & 0 & 287496 & 1728 & 16581375 & -3375 & 8000 & -32768 & -884736 & -884736000 & -147197952000 & -262537412640768000\\ \text{CM discriminant} &-27 & -12 & -3 & -16 & -4 & -28 & -7 & -8 & -11 & -19 & -43 & -67 & -163 \end{array}

CM elliptic curves are examples of CM abelian varieties.

Depends on: Definition 1.2.14 Definition 4.1.4 Definition 4.1.23 Definition 4.1.28 Definition 4.1.43 Definition 5.1.7 Definition 5.1.57 Definition 1.1.27

Definition4.1.12
Statement uses 7
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 4.1.13
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Conductor of an elliptic curve. (LMFDB)

The conductor of an elliptic curve E defined over a number field K is an ideal of the ring of integers of K that is divisible by the prime ideals of bad reduction and no others. It is defined as

\mathfrak{n} = \prod_{\mathfrak{p}}\mathfrak{p}^{e_{\mathfrak{p}}}

where the exponent e_{\mathfrak{p}} is as follows:

  • e_{\mathfrak{p}}=0 if E has good reduction at \mathfrak{p};

  • e_{\mathfrak{p}}=1 if E has multiplicative reduction at \mathfrak{p};

  • e_{\mathfrak{p}}=2 if E has additive reduction at \mathfrak{p} and \mathfrak{p} does not lie above either 2 or 3; and

  • 2\leq e_{\mathfrak{p}}\leq 2+6v_{\mathfrak{p}}(2)+3v_{\mathfrak{p}}(3), where v_{\mathfrak{p}} is the valuation at \mathfrak{p}, if E has additive reduction and \mathfrak{p} lies above 2 or 3.

For \mathfrak{p}=2 and 3, there is an algorithm of Tate that simultaneously creates a minimal Weierstrass equation and computes the exponent of the conductor. See:

<UL> <LI> J. Tate, Algorithm for determining the type of a singular fiber in an elliptic pencil, Modular functions of one variable, IV (Proc. Internat. Summer School, Univ. Antwerp, Antwerp, 1972), 33-52. <EM>Lecture Notes in Math.</EM>, Vol. <B>476</B>, Springer, Berlin, 1975.

<LI> J.H. Silverman, <EM>Advanced topics in the arithmetic of elliptic curves</EM>, GTM <B>151</B>, Springer-Verlag, New York, 1994.

</UL>

The conductor norm is the norm [\mathcal{O}_K:\mathfrak{n}] of the ideal \mathfrak{n}.

Depends on: Definition 4.1.4 Definition 4.1.5 Definition 4.1.7 Definition 4.1.31 Definition 4.1.57 Definition 5.1.1 Definition 5.1.74

Definition4.1.13
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.12
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Conductor labels for elliptic curves. (LMFDB)

The LMFDB uses a systematic labelling of conductors of elliptic curves defined over each number field K. The conductors are integral ideals of K. For an ideal of norm N the label has the form N.i where i is the index (starting from 1) of the ideal in an ordered list of all integral ideals of norm N.

  • over imaginary quadratic fields, we use the standard labelling scheme for ideals;

  • over totally real fields, we use the same labels for ideals as are used for levels of Hilbert modular forms; the order of these is recorded in the database;

  • over other fields, the ordering of the ideals of fixed norm is recorded in the database.

In future it is planned to move to using the standard labelling scheme for ideals over all fields.

Depends on: Definition 4.1.12 Definition 5.1.1 Definition 5.1.37

Lean code for Definition4.1.14●6 declarations
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/TateAlgorithm/Reduction/Curve.lean
    complete
    def WeierstrassCurve.algorithmicOggExponent.{u_1, u_2} (R : Type u_1)
      [CommRing R] [IsDomain R] [IsDiscreteValuationRing R] {K : Type u_2}
      [Field K] [Algebra R K] [IsFractionRing R K]
      [PerfectField (IsLocalRing.ResidueField R)] (W : WeierstrassCurve K)
      [W.IsElliptic] : ℕ
    def WeierstrassCurve.algorithmicOggExponent.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      [PerfectField
          (IsLocalRing.ResidueField R)]
      (W : WeierstrassCurve K)
      [W.IsElliptic] : ℕ
    **The algorithmic Ogg exponent of an elliptic curve**, `v(Δ_min) − m + 1`, where `m` is the
    component count of the reduction symbol and `v(Δ_min)` the valuation of the minimal discriminant
    (`natCast_algorithmicOggExponent`). It is `0` at good reduction, `1` at multiplicative reduction
    and at least `2` at additive reduction. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/TateAlgorithm/Reduction/Conductor.lean
    complete
    theorem WeierstrassCurve.count_algorithmicConductor.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O]
      [∀ (v : IsDedekindDomain.HeightOneSpectrum O),
          PerfectField
            (IsLocalRing.ResidueField (Localization.AtPrime v.asIdeal))]
      {K : Type u_2} [Field K] [Algebra O K] [IsFractionRing O K]
      (W : WeierstrassCurve K) [W.IsElliptic]
      (v : IsDedekindDomain.HeightOneSpectrum O) :
      (Associates.mk v.asIdeal).count
          (Associates.mk
              (WeierstrassCurve.algorithmicConductor O W)).factors =
        WeierstrassCurve.algorithmicOggExponent
          (Localization.AtPrime v.asIdeal) W
    theorem WeierstrassCurve.count_algorithmicConductor.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O]
      [∀
          (v :
            IsDedekindDomain.HeightOneSpectrum
              O),
          PerfectField
            (IsLocalRing.ResidueField
              (Localization.AtPrime
                v.asIdeal))]
      {K : Type u_2} [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve K) [W.IsElliptic]
      (v :
        IsDedekindDomain.HeightOneSpectrum
          O) :
      (Associates.mk v.asIdeal).count
          (Associates.mk
              (WeierstrassCurve.algorithmicConductor
                O W)).factors =
        WeierstrassCurve.algorithmicOggExponent
          (Localization.AtPrime v.asIdeal) W
    **The exponent of `𝔭ᵥ` in the algorithmic conductor is the algorithmic Ogg exponent at `v`.**
    This reads the local exponents back off the ideal, so results about the conductor can be proved
    without unfolding the defining product. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/TateAlgorithm/Reduction/Curve.lean
    complete
    theorem WeierstrassCurve.algorithmicOggExponent_eq_zero_iff.{u_1, u_2}
      {R : Type u_1} [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      [PerfectField (IsLocalRing.ResidueField R)] (W : WeierstrassCurve K)
      [W.IsElliptic] :
      WeierstrassCurve.algorithmicOggExponent R W = 0 ↔
        WeierstrassCurve.HasGoodReduction R (WeierstrassCurve.minimal R W)
    theorem WeierstrassCurve.algorithmicOggExponent_eq_zero_iff.{u_1,
        u_2}
      {R : Type u_1} [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      [PerfectField
          (IsLocalRing.ResidueField R)]
      (W : WeierstrassCurve K)
      [W.IsElliptic] :
      WeierstrassCurve.algorithmicOggExponent
            R W =
          0 ↔
        WeierstrassCurve.HasGoodReduction R
          (WeierstrassCurve.minimal R W)
    **The algorithmic Ogg exponent vanishes exactly at good reduction.** 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/TateAlgorithm/Reduction/Curve.lean
    complete
    theorem WeierstrassCurve.algorithmicOggExponent_eq_one_iff.{u_1, u_2}
      {R : Type u_1} [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      [PerfectField (IsLocalRing.ResidueField R)] (W : WeierstrassCurve K)
      [W.IsElliptic] :
      WeierstrassCurve.algorithmicOggExponent R W = 1 ↔
        WeierstrassCurve.HasMultiplicativeReduction R
          (WeierstrassCurve.minimal R W)
    theorem WeierstrassCurve.algorithmicOggExponent_eq_one_iff.{u_1,
        u_2}
      {R : Type u_1} [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      [PerfectField
          (IsLocalRing.ResidueField R)]
      (W : WeierstrassCurve K)
      [W.IsElliptic] :
      WeierstrassCurve.algorithmicOggExponent
            R W =
          1 ↔
        WeierstrassCurve.HasMultiplicativeReduction
          R (WeierstrassCurve.minimal R W)
    **The algorithmic Ogg exponent is `1` exactly at multiplicative reduction.** 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/OggExponentAdditive.lean
    complete
    theorem WeierstrassCurve.algorithmicOggExponent_eq_two.{u_1, u_2} {R : Type u_1}
      [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      [PerfectField (IsLocalRing.ResidueField R)] {K : Type u_2} [Field K]
      [Algebra R K] [IsFractionRing R K] (h2 : IsUnit 2) (h3 : IsUnit 3)
      (E : WeierstrassCurve K) [E.IsElliptic]
      (ha :
        WeierstrassCurve.HasAdditiveReduction R
          (WeierstrassCurve.minimal R E)) :
      WeierstrassCurve.algorithmicOggExponent R E = 2
    theorem WeierstrassCurve.algorithmicOggExponent_eq_two.{u_1,
        u_2}
      {R : Type u_1} [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      [PerfectField
          (IsLocalRing.ResidueField R)]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K] (h2 : IsUnit 2)
      (h3 : IsUnit 3) (E : WeierstrassCurve K)
      [E.IsElliptic]
      (ha :
        WeierstrassCurve.HasAdditiveReduction
          R (WeierstrassCurve.minimal R E)) :
      WeierstrassCurve.algorithmicOggExponent
          R E =
        2
    **The algorithmic Ogg exponent is `2` at additive reduction in residue characteristic at least
    `5`** (Silverman, *Advanced Topics*, IV.9): if `2` and `3` are units of `R` and a minimal equation
    of `E` has additive reduction, then `v(Δ_min) = m + 1` for the symbol at which Tate's algorithm
    stops, so `f = v(Δ_min) − m + 1 = 2`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/OggExponentAdditive.lean
    complete
    theorem WeierstrassCurve.count_algorithmicConductor_eq_two.{u_2, u_3}
      (O : Type u_2) [CommRing O] [IsDedekindDomain O]
      [∀ (v : IsDedekindDomain.HeightOneSpectrum O),
          PerfectField
            (IsLocalRing.ResidueField (Localization.AtPrime v.asIdeal))]
      {F : Type u_3} [Field F] [Algebra O F] [IsFractionRing O F]
      (E : WeierstrassCurve F) [E.IsElliptic]
      (v : IsDedekindDomain.HeightOneSpectrum O) (h2 : 2 ∉ v.asIdeal)
      (h3 : 3 ∉ v.asIdeal)
      (ha :
        WeierstrassCurve.HasAdditiveReduction
          (Localization.AtPrime v.asIdeal)
          (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal) E)) :
      (Associates.mk v.asIdeal).count
          (Associates.mk
              (WeierstrassCurve.algorithmicConductor O E)).factors =
        2
    theorem WeierstrassCurve.count_algorithmicConductor_eq_two.{u_2,
        u_3}
      (O : Type u_2) [CommRing O]
      [IsDedekindDomain O]
      [∀
          (v :
            IsDedekindDomain.HeightOneSpectrum
              O),
          PerfectField
            (IsLocalRing.ResidueField
              (Localization.AtPrime
                v.asIdeal))]
      {F : Type u_3} [Field F] [Algebra O F]
      [IsFractionRing O F]
      (E : WeierstrassCurve F) [E.IsElliptic]
      (v :
        IsDedekindDomain.HeightOneSpectrum O)
      (h2 : 2 ∉ v.asIdeal)
      (h3 : 3 ∉ v.asIdeal)
      (ha :
        WeierstrassCurve.HasAdditiveReduction
          (Localization.AtPrime v.asIdeal)
          (WeierstrassCurve.minimal
            (Localization.AtPrime v.asIdeal)
            E)) :
      (Associates.mk v.asIdeal).count
          (Associates.mk
              (WeierstrassCurve.algorithmicConductor
                O E)).factors =
        2
    **The exponent of a prime not above `2` or `3` in the conductor is `2` at additive reduction**
    (LMFDB `ec.conductor_valuation`, `ec.conductor`): for an elliptic curve over the fraction field of a
    Dedekind domain `O`, such as a number field, and a height-one prime `v` of `O` containing neither
    `2` nor `3`, at which a minimal equation has additive reduction, `v` occurs with exponent `2` in
    Tau Ceti's algorithmic conductor `∏ᵥ 𝔭ᵥ ^ fᵥ`. 
Definition4.1.15
uses 0used by 1✓L∃∀N

Congruent numbers. (LMFDB)

A <b>congruent number</b> n is a positive rational number which is the area \frac{1}{2}XY of a right triangle with rational legs X, Y and rational hypotenuse Z, so X,Y,Z are positive rational numbers satisfying the equations X^2 + Y^2 = Z^2 \tag{1} and \frac{1}{2} XY = n. \tag{2}

For example, 6 is a congruent number because it is the area of the 3,4,5 right triangle. So is 5, with (X,Y,Z)=(3/2,20/3,41/6), while none of the integers 1, 2, 3 or 4 is a congruent number. The integers less than 100 which are congruent are

5,6,7,13,14,15,20,21,22,23,24,28,29,30,31,34,37,38,39,41,45,46,47, 52,53,54,55,56,60,61,62,63,65,69,70,71,77,78,79,80,84,85,86,87,88,92,93,94,95,96

Lean code for Definition4.1.15●4 declarations
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/CongruentNumber/Basic.lean
    complete
    def Rat.IsCongruentNumber (n : ℚ) : Prop
    def Rat.IsCongruentNumber (n : ℚ) : Prop
    A rational number `n` is a **congruent number** (LMFDB `ec.congruent_number`) if it is the area
    `X Y / 2` of a right triangle with rational legs `X`, `Y` and rational hypotenuse `Z`: there are
    positive rationals `X`, `Y`, `Z` with `X² + Y² = Z²` and `X Y / 2 = n`. A congruent number is
    positive (`Rat.IsCongruentNumber.pos`). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/CongruentNumber/Basic.lean
    complete
    theorem Rat.IsCongruentNumber.pos {n : ℚ} (h : n.IsCongruentNumber) : 0 < n
    theorem Rat.IsCongruentNumber.pos {n : ℚ}
      (h : n.IsCongruentNumber) : 0 < n
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/CongruentNumber/Basic.lean
    complete
    theorem Rat.isCongruentNumber_six : Rat.IsCongruentNumber 6
    theorem Rat.isCongruentNumber_six :
      Rat.IsCongruentNumber 6
    **`6` is a congruent number**, the area of the right triangle `(3, 4, 5)`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/CongruentNumber/Basic.lean
    complete
    theorem Rat.isCongruentNumber_five : Rat.IsCongruentNumber 5
    theorem Rat.isCongruentNumber_five :
      Rat.IsCongruentNumber 5
    **`5` is a congruent number**, the area of the right triangle `(3 / 2, 20 / 3, 41 / 6)`. 
Definition4.1.16
Statement uses 7
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Congruent number curves. (LMFDB)

For each positive integer n, the <b>congruent number curve</b> E_n is the elliptic curve defined over \Q with equation y^2 = x(x^2-n^2). Rational points (x,y)\in E_n(\Q) with y\not=0 are associated to solutions of the congruent number problem for n: given rational numbers X,Y,Z satisfying X^2+Y^2=Z^2 and XY=2n, set x=\frac{1}{4}Z^2 and y=\frac{1}{8}Z(X^2-Y^2); then y^2=x(x^2-n^2).

The only rational points of finite order on E_n(\Q) are the point at infinity (the origin for the group law) and the three points of order 2: (0,0), (\pm n,0); thus, n is congruent if and only if E_n(\Q) is infinite, that is, if and only if the rank of E_n(\Q) is positive.

For example, the elliptic curve E_6: y^2 = x^3 - 36x has rank 1, with Mordell-Weil group E_6(\Q) generated (modulo torsion) by P = (-3,9), and 2P=(25/4,-35/8) is the rational point arising from the (3,4,5)-triangle. In general, only points in 2E_n(\Q) come from solutions to the congruent number problem; these are the rational points (x,y) for which x and x\pm n are all squares.

The conductor of E_n is 32n_0^2 when the square-free part n_0 of n is odd, and 16n_0^2 when n_0 is even.

Each congruent number elliptic curve E_n belongs to an isogeny class of four isogenous curves, connected by 2-isogenies. The curves 2-isogenous to E_n=[0,0,0,-n^2,0] are [0,0,0,4n^2,0] and [0,\pm 12n,0,n^2,0].

Depends on: Definition 4.1.4 Definition 4.1.36 Definition 4.1.37 Definition 4.1.54 Definition 4.1.72 Definition 4.1.105 Definition 4.1.121

Definition4.1.17
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Congruent number problem. (LMFDB)

The <b>congruent number problem</b> is the problem of determining whether a given rational number is or is not a congruent number.

Since n is congruent if and only if nt^2 is, for any nonzero rational number t, it is sufficient to consider the case where n is a square-free integer; some sources state the congruent number problem only for positive integers for this reason.

A positive integer n is congruent if and only if there exists a rational number a, such that a, a-n and a+n are all squares of rational numbers. For, given rational X,Y,Z satisfying X^2+Y^2=Z^2 and XY=2n, the rational number a=(Z/2)^2 satisfies a\pm n=((X\pm Y)/2)^2, and conversely, given a=A^2 with a+n=B^2 and a-n=C^2, set (X,Y,Z)=(2A,B+C,B-C).

For example, with the 3,4,5 right triangle and n = 6, let a = 25/4=(5/2)^2; then a-n=25/4 - 6 = (1/2)^2 and a+n=25/4 + 6 = (7/2)^2.

It is known that a positive integer number n is congruent if and only if there exists a rational solution (x,y) with y\not=0 to the elliptic curve equation: E_n:\quad y^2 = x^3 - n^2 x, or, in other words, a rational point P=(x,y) on the congruent number curve E_n(\Q) with y\not=0.

Depends on: Definition 4.1.4 Definition 4.1.15 Definition 4.1.16

Lean code for Definition4.1.17●5 declarations
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/CongruentNumber/Basic.lean
    complete
    theorem Rat.isCongruentNumber_iff_exists_isSquare {n : ℚ} (hn : 0 < n) :
      n.IsCongruentNumber ↔
        ∃ a, IsSquare a ∧ IsSquare (a - n) ∧ IsSquare (a + n)
    theorem Rat.isCongruentNumber_iff_exists_isSquare
      {n : ℚ} (hn : 0 < n) :
      n.IsCongruentNumber ↔
        ∃ a,
          IsSquare a ∧
            IsSquare (a - n) ∧
              IsSquare (a + n)
    **Congruent numbers and three squares in arithmetic progression** (LMFDB
    `ec.congruent_number_problem`): a positive rational `n` is congruent if and only if there is a
    rational `a` with `a`, `a - n` and `a + n` all squares of rationals. A triangle `(X, Y, Z)` gives
    `a = (Z / 2)²` with `a ± n = ((X ± Y) / 2)²`, and `a = A²`, `a + n = B²`, `a - n = C²` give the
    triangle `(|B| + |C|, |B| - |C|, 2 |A|)`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/CongruentNumber/Curve.lean
    complete
    theorem Rat.isCongruentNumber_iff_exists_equation {n : ℚ} (hn : 0 < n) :
      n.IsCongruentNumber ↔
        ∃ x y,
          (WeierstrassCurve.congruentNumberCurve n).toAffine.Equation x y ∧
            y ≠ 0
    theorem Rat.isCongruentNumber_iff_exists_equation
      {n : ℚ} (hn : 0 < n) :
      n.IsCongruentNumber ↔
        ∃ x y,
          (WeierstrassCurve.congruentNumberCurve
                    n).toAffine.Equation
              x y ∧
            y ≠ 0
    **Congruent numbers and the congruent number curve** (LMFDB `ec.congruent_number_problem`,
    `ec.congruent_number_curve`): a positive rational `n` is congruent if and only if the congruent
    number curve `E_n : y² = x³ - n² x` has a rational point `(x, y)` with `y ≠ 0`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/CongruentNumber/Basic.lean
    complete
    theorem Rat.isCongruentNumber_mul_sq_iff {n t : ℚ} (ht : t ≠ 0) :
      (n * t ^ 2).IsCongruentNumber ↔ n.IsCongruentNumber
    theorem Rat.isCongruentNumber_mul_sq_iff {n t : ℚ}
      (ht : t ≠ 0) :
      (n * t ^ 2).IsCongruentNumber ↔
        n.IsCongruentNumber
    **Congruence is a property of square classes**: for `t ≠ 0`, `n t²` is a congruent number if
    and only if `n` is. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/CongruentNumber/Basic.lean
    complete
    theorem Rat.exists_squarefree_mul_sq {n : ℚ} (hn : 0 < n) :
      ∃ n₀, Squarefree n₀ ∧ ∃ t, t ≠ 0 ∧ n = ↑n₀ * t ^ 2
    theorem Rat.exists_squarefree_mul_sq {n : ℚ}
      (hn : 0 < n) :
      ∃ n₀,
        Squarefree n₀ ∧
          ∃ t, t ≠ 0 ∧ n = ↑n₀ * t ^ 2
    **Every positive rational is a squarefree positive integer times a square**: `n = n₀ t²` with
    `n₀` a squarefree positive integer and `t ≠ 0` rational. By
    `Rat.isCongruentNumber_mul_sq_iff`, the congruent number problem therefore reduces to squarefree
    positive integers. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/CongruentNumber/Basic.lean
    complete
    def Rat.IsCongruentNumber (n : ℚ) : Prop
    def Rat.IsCongruentNumber (n : ℚ) : Prop
    A rational number `n` is a **congruent number** (LMFDB `ec.congruent_number`) if it is the area
    `X Y / 2` of a right triangle with rational legs `X`, `Y` and rational hypotenuse `Z`: there are
    positive rationals `X`, `Y`, `Z` with `X² + Y² = Z²` and `X Y / 2 = n`. A congruent number is
    positive (`Rat.IsCongruentNumber.pos`). 
Definition4.1.18
Statement uses 6
Statement dependency previews
Preview
Definition 3.3.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Labels of elliptic curves over number fields. (LMFDB)

The label of an elliptic curve over a number field K has three components, denoting the conductor, the isogeny class and the isomorphism class:

  • The conductor label is a label for the conductor, which is an integral ideal of the base field, whose format depends on the field but always includes the norm of the conductor.

  • The isogeny class label normally consists of one or more letters a-z or A-Z; the ordering of the isogeny classes is based on lexicographical ordering of the Dirichlet coefficients of the L-series. For this to be well-defined, a standard ordering is used for the primes of the base field. In the case of elliptic curves E defined over an imaginary quadratic field K, the isogeny class label has a prefix "CM" for curves with complex multiplication by an order in K itself.

  • The isomorphism class is a positive integer giving the index (starting at 1) of the curve in its isogeny class.

Together these give a label of the form N.a1 where N is the conductor label, a the class and 1 the curve number. Omitting the third component gives an isogeny class label, of the form N.a.

In addition, to specify the elliptic curve completely prepend the label of the base field to give a full label of the curve, for example 3.1.23.1-89.1-A1.

Where possible the labelling of isogeny classes matches that of associated cusp forms (Bianchi newforms over imaginary quadratic fields and Hilbert newforms over totally real fields). The prefix "CM" on the isogeny class label for certain elliptic curves over imaginary quadratic fields is used, because the Bianchi modular forms conjecturally attached to such curves are not cuspidal.

Depends on: Definition 4.1.11 Definition 4.1.13 Definition 4.1.37 Definition 3.4.13 Definition 3.3.1 Definition 5.1.37

Definition4.1.19
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.30
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 10
Reverse dependency previews
Preview
Definition 4.1.7
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Discriminant of a Weierstrass equation. (LMFDB)

The discriminant \Delta of a Weierstrass equation over a field K is an element of K defined in terms of the Weierstrass coefficients. If the Weierstrass equation is y^2+a_1xy+a_3y=x^3+a_2x^2+a_4x+a_6, then \Delta is given by a polynomial expression in a_1,\dots,a_6, namely,

\Delta=-b_2^2b_8 - 8 b_4^3 -27 b_6 ^2 + 9 b_2 b_4 b_6 where

\begin{aligned} b_2 &= a_1^2 + 4 a_2\\ b_4 &= 2a_4 + a_1 a_3\\ b_6 &= a_3^2 + 4 a_6 \\ b_8 &= a_1^2 a_6 + 4 a_2 a_6 - a_1 a_3 a_4 + a_2 a_3^2 - a_4^2. \end{aligned}

Then \Delta\neq 0 if and only if the equation defines a smooth curve, in which case its projective closure gives an elliptic curve.

Tau Ceti Review: WeierstrassCurve.Δ, Module.freeLocus, WeierstrassCurve.IsElliptic, WeierstrassCurve.toEllipticCurveGeom.

Depends on: Definition 1.2.18 Definition 4.1.4 Definition 4.1.121 Definition 1.1.30

Lean code for Definition4.1.19●7 declarations
  • defdefined in Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean
    complete
    def WeierstrassCurve.Δ.{u} {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) : R
    def WeierstrassCurve.Δ.{u} {R : Type u}
      [CommRing R] (W : WeierstrassCurve R) :
      R
    The discriminant `Δ` of a Weierstrass curve. If `R` is a field, then this polynomial vanishes
    if and only if the cubic curve cut out by this equation is singular. Sometimes only defined up to
    sign in the literature; we choose the sign used by the LMFDB. For more discussion, see
    [the LMFDB page on discriminants](https://www.lmfdb.org/knowledge/show/ec.discriminant). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/JacobianCriterion.lean
    complete
    theorem WeierstrassCurve.Δ_ne_zero_iff_freeLocus_baseChange_eq_univ.{u_1, u_2}
      {F : Type u_1} [Field F] (W : WeierstrassCurve F) (K : Type u_2)
      [Field K] [Algebra F K] [IsAlgClosed K] :
      W.Δ ≠ 0 ↔
        Module.freeLocus
            (WeierstrassCurve.toAffine
                (WeierstrassCurve.Affine.baseChange W K)).CoordinateRing
            Ω[(WeierstrassCurve.toAffine
                  (WeierstrassCurve.Affine.baseChange W
                    K)).CoordinateRing⁄K] =
          Set.univ
    theorem WeierstrassCurve.Δ_ne_zero_iff_freeLocus_baseChange_eq_univ.{u_1,
        u_2}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) (K : Type u_2)
      [Field K] [Algebra F K]
      [IsAlgClosed K] :
      W.Δ ≠ 0 ↔
        Module.freeLocus
            (WeierstrassCurve.toAffine
                (WeierstrassCurve.Affine.baseChange
                  W K)).CoordinateRing
            Ω[(WeierstrassCurve.toAffine
                  (WeierstrassCurve.Affine.baseChange
                    W K)).CoordinateRing⁄K] =
          Set.univ
    **A Weierstrass equation defines a smooth curve exactly when its discriminant is nonzero**
    (LMFDB `ec.discriminant`, with smoothness in the sense of `ag.curve.smooth` and
    `ag.singular_point`): for a Weierstrass curve `W` over a field `F` and an algebraically closed
    extension `K` of `F`, an algebraic closure for instance, `Δ ≠ 0` exactly when the affine curve
    `W⁄K` is non-singular at all of its points, its module of differentials being locally free at
    every point of the spectrum of its coordinate ring. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/JacobianCriterion.lean
    complete
    theorem WeierstrassCurve.Δ_ne_zero_iff_forall_equation_mem_freeLocus_baseChange.{u_1,
        u_2}
      {F : Type u_1} [Field F] (W : WeierstrassCurve F) (K : Type u_2)
      [Field K] [Algebra F K] [IsAlgClosed K] :
      W.Δ ≠ 0 ↔
        ∀ (x y : K)
          (h :
            (WeierstrassCurve.toAffine
                  (WeierstrassCurve.Affine.baseChange W K)).Equation
              x y),
          {
              asIdeal :=
                RingHom.ker
                  (WeierstrassCurve.Affine.CoordinateRing.evalAlgHom h),
              isPrime := ⋯ } ∈
            Module.freeLocus
              (WeierstrassCurve.toAffine
                  (WeierstrassCurve.Affine.baseChange W K)).CoordinateRing
              Ω[(WeierstrassCurve.toAffine
                    (WeierstrassCurve.Affine.baseChange W
                      K)).CoordinateRing⁄K]
    theorem WeierstrassCurve.Δ_ne_zero_iff_forall_equation_mem_freeLocus_baseChange.{u_1,
        u_2}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) (K : Type u_2)
      [Field K] [Algebra F K]
      [IsAlgClosed K] :
      W.Δ ≠ 0 ↔
        ∀ (x y : K)
          (h :
            (WeierstrassCurve.toAffine
                  (WeierstrassCurve.Affine.baseChange
                    W K)).Equation
              x y),
          {
              asIdeal :=
                RingHom.ker
                  (WeierstrassCurve.Affine.CoordinateRing.evalAlgHom
                    h),
              isPrime := ⋯ } ∈
            Module.freeLocus
              (WeierstrassCurve.toAffine
                  (WeierstrassCurve.Affine.baseChange
                    W K)).CoordinateRing
              Ω[(WeierstrassCurve.toAffine
                    (WeierstrassCurve.Affine.baseChange
                      W K)).CoordinateRing⁄K]
    **A Weierstrass equation defines a curve that is non-singular at all of its points exactly
    when its discriminant is nonzero**, with points as in LMFDB `ag.variety` (LMFDB `ec.discriminant`):
    for a Weierstrass curve `W` over a field `F` and an algebraically closed extension `K` of `F`,
    `Δ ≠ 0` exactly when, at every point `(x, y) ∈ K²` of the affine curve `W⁄K`, that is, at the kernel
    of evaluation at `(x, y)`, the module of differentials of its coordinate ring is locally free. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/JacobianCriterion.lean
    complete
    theorem WeierstrassCurve.Affine.mem_freeLocus_iff.{u_1} {L : Type u_1} [Field L]
      (W : WeierstrassCurve.Affine L) (p : PrimeSpectrum W.CoordinateRing) :
      p ∈ Module.freeLocus W.CoordinateRing Ω[W.CoordinateRing⁄L] ↔
        (WeierstrassCurve.Affine.CoordinateRing.mk W) W.polynomialX ∉
            p.asIdeal ∨
          (WeierstrassCurve.Affine.CoordinateRing.mk W) W.polynomialY ∉
            p.asIdeal
    theorem WeierstrassCurve.Affine.mem_freeLocus_iff.{u_1}
      {L : Type u_1} [Field L]
      (W : WeierstrassCurve.Affine L)
      (p : PrimeSpectrum W.CoordinateRing) :
      p ∈
          Module.freeLocus W.CoordinateRing
            Ω[W.CoordinateRing⁄L] ↔
        (WeierstrassCurve.Affine.CoordinateRing.mk
                W)
              W.polynomialX ∉
            p.asIdeal ∨
          (WeierstrassCurve.Affine.CoordinateRing.mk
                W)
              W.polynomialY ∉
            p.asIdeal
    **The Jacobian criterion for a Weierstrass curve** (LMFDB `ag.singular_point` for the
    Weierstrass cubic): over a field `L`, the module of differentials `Ω[R⁄L]` of the coordinate ring
    `R` of the affine curve is locally free at a point `p` of `Spec R` exactly when the partial
    derivatives `W_X` and `W_Y` of the Weierstrass polynomial do not both vanish at `p`, that is, when
    the Jacobian matrix `(W_X, W_Y)` has rank one, the codimension of the curve in the plane. 
  • defdefined in Mathlib/RingTheory/Spectrum/Prime/FreeLocus.lean
    complete
    def Module.freeLocus.{uR, uM} (R : Type uR) (M : Type uM) [CommRing R]
      [AddCommGroup M] [Module R M] : Set (PrimeSpectrum R)
    def Module.freeLocus.{uR, uM} (R : Type uR)
      (M : Type uM) [CommRing R]
      [AddCommGroup M] [Module R M] :
      Set (PrimeSpectrum R)
    The free locus of a module, i.e. the set of primes `p` such that `Mₚ` is free over `Rₚ`. 
  • class(1 method)defined in Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean
    complete
    class WeierstrassCurve.IsElliptic.{u} {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) : Prop
    class WeierstrassCurve.IsElliptic.{u}
      {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) : Prop
    `WeierstrassCurve.IsElliptic` is a typeclass which asserts that a Weierstrass curve is an
    elliptic curve: that its discriminant is a unit. Note that this definition is only mathematically
    accurate for certain rings whose Picard group has trivial 12-torsion, such as a field or a PID. 
    isUnit : IsUnit W.Δ
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/Scheme/OfWeierstrass.lean
    complete
    def WeierstrassCurve.toEllipticCurveGeom.{u} {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) [W.IsElliptic] :
      TauCeti.AlgebraicGeometry.EllipticCurveGeom
        (AlgebraicGeometry.Spec ↧R)
    def WeierstrassCurve.toEllipticCurveGeom.{u}
      {R : Type u} [CommRing R]
      (W : WeierstrassCurve R)
      [W.IsElliptic] :
      TauCeti.AlgebraicGeometry.EllipticCurveGeom
        (AlgebraicGeometry.Spec ↧R)
    The **elliptic curve over `Spec R` of an elliptic Weierstrass curve** `W` over `R`: the
    projective model `W.projModel`, with structure morphism `W.projModelOver` and zero section the
    point `[0 : 1 : 0]` (`W.projModelZero`). Its pointed Weierstrass atlas consists of a single chart
    over the whole base, whose isomorphism with the projective model is the identity. The total space
    is identified with `W.projModel` by `toEllipticCurveGeomIso`. 
Definition4.1.20
uses 1used by 0✓L∃∀N
Lean code for Definition4.1.20●5 declarations
  • defdefined in Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean
    complete
    def Ideal.absNorm.{u_1} {S : Type u_1} [CommRing S] [IsDedekindDomain S]
      [Infinite S] : Ideal S →*₀ ℕ
    def Ideal.absNorm.{u_1} {S : Type u_1}
      [CommRing S] [IsDedekindDomain S]
      [Infinite S] : Ideal S →*₀ ℕ
    The absolute norm of the ideal `I : Ideal S` is the cardinality of the quotient `S ⧸ I`. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/DiscriminantIdeal.lean
    complete
    def WeierstrassCurve.minimalDiscriminantIdeal.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O] {K : Type u_2} [Field K]
      [Algebra O K] [IsFractionRing O K] (W : WeierstrassCurve K)
      [W.IsElliptic] : Ideal O
    def WeierstrassCurve.minimalDiscriminantIdeal.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve K)
      [W.IsElliptic] : Ideal O
    **The minimal discriminant ideal** `𝔇_{E/K} = ∏ᵥ 𝔭ᵥ ^ v (Δ_min,ᵥ)`: the product over the
    height-one primes of `O` of the local minimal discriminants of `W`. The product is finite
    (`hasFiniteMulSupport_pow_localMinimalDiscriminantValuation`): after choosing an integral model,
    only finitely many primes divide its nonzero discriminant ideal, and every local minimal exponent
    is bounded by that ideal's multiplicity. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Reduced.lean
    complete
    theorem WeierstrassCurve.absNorm_minimalDiscriminantIdeal
      (E : WeierstrassCurve ℚ) [E.IsElliptic] :
      ↑(Ideal.absNorm (WeierstrassCurve.minimalDiscriminantIdeal ℤ E)) =
        |E.reducedMinimalModel.Δ|
    theorem WeierstrassCurve.absNorm_minimalDiscriminantIdeal
      (E : WeierstrassCurve ℚ)
      [E.IsElliptic] :
      ↑(Ideal.absNorm
            (WeierstrassCurve.minimalDiscriminantIdeal
              ℤ E)) =
        |E.reducedMinimalModel.Δ|
    **The minimal discriminant over `ℤ` is the discriminant of the reduced minimal model**, up to
    sign: the norm of the minimal discriminant ideal of `E` over `ℤ`, which is the absolute value
    `|Δ_min|` of a generator, is `|Δ|` of `reducedMinimalModel E`. 
  • defdefined in Mathlib/RingTheory/Norm/Defs.lean
    complete
    def Algebra.norm.{u_1, u_2} (R : Type u_1) {S : Type u_2} [CommRing R]
      [Ring S] [Algebra R S] : S →* R
    def Algebra.norm.{u_1, u_2} (R : Type u_1)
      {S : Type u_2} [CommRing R] [Ring S]
      [Algebra R S] : S →* R
    The norm of an element `s` of an `R`-algebra is the determinant of `(*) s`. 
  • defdefined in Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean
    complete
    def WeierstrassCurve.Δ.{u} {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) : R
    def WeierstrassCurve.Δ.{u} {R : Type u}
      [CommRing R] (W : WeierstrassCurve R) :
      R
    The discriminant `Δ` of a Weierstrass curve. If `R` is a field, then this polynomial vanishes
    if and only if the cubic curve cut out by this equation is singular. Sometimes only defined up to
    sign in the literature; we choose the sign used by the LMFDB. For more discussion, see
    [the LMFDB page on discriminants](https://www.lmfdb.org/knowledge/show/ec.discriminant). 
Lean code for Definition4.1.21●4 declarations
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Valuation.lean
    complete
    def WeierstrassCurve.localMinimalDiscriminantValuation.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      (W : WeierstrassCurve K) [W.IsElliptic] : ℕ
    def WeierstrassCurve.localMinimalDiscriminantValuation.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K)
      [W.IsElliptic] : ℕ
    **The valuation of the local minimal discriminant.** This is the exponent of the maximal
    ideal of `R` in `W.localMinimalDiscriminant R`, equivalently the additive valuation of the
    discriminant of a minimal integral equation in the variable-change orbit of `W`.
    
    The ellipticity hypothesis ensures that this discriminant is nonzero, so the extended-natural
    additive valuation is finite and has an honest natural-number value. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/DiscriminantIdeal.lean
    complete
    theorem WeierstrassCurve.count_minimalDiscriminantIdeal_eq_localMinimalDiscriminantValuation.{u_1,
        u_2}
      (O : Type u_1) [CommRing O] [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K] [IsFractionRing O K] (W : WeierstrassCurve K)
      (v : IsDedekindDomain.HeightOneSpectrum O) [W.IsElliptic] :
      (Associates.mk v.asIdeal).count
          (Associates.mk
              (WeierstrassCurve.minimalDiscriminantIdeal O W)).factors =
        WeierstrassCurve.localMinimalDiscriminantValuation
          (Localization.AtPrime v.asIdeal) W
    theorem WeierstrassCurve.count_minimalDiscriminantIdeal_eq_localMinimalDiscriminantValuation.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve K)
      (v :
        IsDedekindDomain.HeightOneSpectrum O)
      [W.IsElliptic] :
      (Associates.mk v.asIdeal).count
          (Associates.mk
              (WeierstrassCurve.minimalDiscriminantIdeal
                O W)).factors =
        WeierstrassCurve.localMinimalDiscriminantValuation
          (Localization.AtPrime v.asIdeal) W
    **The exponent of `𝔭ᵥ` in the minimal discriminant ideal is `v (Δ_min,ᵥ)`.** This reads the
    local minimal exponents back off the ideal, so results about `𝔇_{E/K}` can be proved without
    unfolding the defining product. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/DiscriminantIdeal.lean
    complete
    def WeierstrassCurve.minimalDiscriminantIdeal.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O] {K : Type u_2} [Field K]
      [Algebra O K] [IsFractionRing O K] (W : WeierstrassCurve K)
      [W.IsElliptic] : Ideal O
    def WeierstrassCurve.minimalDiscriminantIdeal.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve K)
      [W.IsElliptic] : Ideal O
    **The minimal discriminant ideal** `𝔇_{E/K} = ∏ᵥ 𝔭ᵥ ^ v (Δ_min,ᵥ)`: the product over the
    height-one primes of `O` of the local minimal discriminants of `W`. The product is finite
    (`hasFiniteMulSupport_pow_localMinimalDiscriminantValuation`): after choosing an integral model,
    only finitely many primes divide its nonzero discriminant ideal, and every local minimal exponent
    is bounded by that ideal's multiplicity. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/LocalData.lean
    complete
    theorem WeierstrassCurve.localData_discriminantValuation.{u_1} {K : Type u_1}
      [Field K] (W : WeierstrassCurve K) [NumberField K] [W.IsElliptic]
      (p :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers K)) :
      (W.localData p).discriminantValuation =
        (Associates.mk p.asIdeal).count
          (Associates.mk
              (WeierstrassCurve.minimalDiscriminantIdeal
                (NumberField.RingOfIntegers K) W)).factors
    theorem WeierstrassCurve.localData_discriminantValuation.{u_1}
      {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) [NumberField K]
      [W.IsElliptic]
      (p :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers K)) :
      (W.localData p).discriminantValuation =
        (Associates.mk p.asIdeal).count
          (Associates.mk
              (WeierstrassCurve.minimalDiscriminantIdeal
                (NumberField.RingOfIntegers K)
                W)).factors
    **The discriminant valuation is the exponent of `𝔭` in the minimal discriminant ideal.** 
Definition4.1.22
Statement uses 3
Statement dependency previews
Preview
Definition 1.2.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 4.1.23
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Endomorphism of an elliptic curve. (LMFDB)

An endomorphism of an elliptic curve defined over a field K is a homomorphism \varphi\colon E\to E defined over K. The set of all endomorphisms of E forms a ring called the endomorphism ring of E, denoted \End(E), a special case of the endomorphism ring of an abelian variety.

Tau Ceti Review: TauCeti.Isogeny, TauCeti.Isogeny.Hom.

Depends on: Definition 1.2.2 Definition 1.2.22 Definition 4.1.4

Lean code for Definition4.1.22●2 definitions
  • structure(2 fields)defined in TauCeti/AlgebraicGeometry/EllipticCurve/Isogeny/Basic.lean
    complete
    structure TauCeti.Isogeny.{u_1} {F : Type u_1} [Field F]
      (W₁ W₂ : WeierstrassCurve.Affine F) : Type u_1
    structure TauCeti.Isogeny.{u_1} {F : Type u_1}
      [Field F]
      (W₁ W₂ : WeierstrassCurve.Affine F) :
      Type u_1
    The pullback data of a nonzero isogeny between affine Weierstrass curves.
    
    The `mapsInfinity` field is the algebraic form of pointedness. Injectivity and finiteness of the
    induced extension are the next results in the isogeny development; they are consequences of this
    condition rather than additional structure fields. 
    pullback : TauCeti.CoordinatePullback W₁ W₂
    The contravariant map out of the target coordinate ring. 
    mapsInfinity : self.pullback.MapsInfinity
    The source point at infinity maps to the target point at infinity. 
  • structure(2 fields)defined in TauCeti/AlgebraicGeometry/EllipticCurve/Isogeny/Hom/Basic.lean
    complete
    structure TauCeti.Isogeny.Hom.{u_1} {F : Type u_1} [Field F]
      (W₁ W₂ : WeierstrassCurve.Affine F) : Type u_1
    structure TauCeti.Isogeny.Hom.{u_1} {F : Type u_1}
      [Field F]
      (W₁ W₂ : WeierstrassCurve.Affine F) :
      Type u_1
    **The carrier of `Hom(W₁, W₂)`**: an `F`-linear multiplicative map out of the target
    coordinate ring, pointed wherever it is unital. Its zero map is the zero morphism's formal
    representative and its unital elements are the isogenies. 
    toNonUnitalAlgHom : W₂.CoordinateRing →ₙₐ[F] W₁.FunctionField
    The underlying multiplicative map. Not an `AlgHom`: unitality is what the zero map fails. 
    mapsInfinity_of_map_one : self.toNonUnitalAlgHom.MapsInfinityOfMapOne
    Pointedness, required only of the unital maps. 
Definition4.1.23
Statement uses 4
Statement dependency previews
Preview
Definition 1.2.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 4.1.11
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Endomorphism ring of an elliptic curve. (LMFDB)

The endomorphism ring \End(E) of an elliptic curve E over a field K is the ring of all endomorphisms of E defined over K. For endomorphisms defined over extensions, we speak of the geometric endomorphism ring of E.

For elliptic curves defined over fields of characteristic zero, this ring is isomorphic to \Z, unless the curve has complex multiplication (CM) defined over the ground field, in which case the endomorphism ring is an order in an imaginary quadratic field; for curves defined over \Q, this order is one of the 13 orders of class number one.

\End(E) always contains a subring isomorphic to \Z, since for m\in\Z there is the multiplication-by-m map [m] \colon E\to E.

This is a special case of the endomorphism ring of an abelian variety.

Depends on: Definition 1.2.2 Definition 1.2.22 Definition 4.1.4 Definition 4.1.22

Definition4.1.24
Statement uses 8
Statement dependency previews
Preview
Definition 1.1.14
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 10
Reverse dependency previews
Preview
Definition 4.1.25
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Galois representations attached to an elliptic curve. (LMFDB)

If E is an elliptic curve defined over a field K and m is a positive integer, then the mod-m Galois representation attached to E is the continuous homomorphism

\overline{\rho}_{E,m}: \Gal(\overline{K}/K) \to \Aut(E[m])

describing the action of the absolute Galois group of K on the m-torsion subgroup E[m].

When the characteristic of K does not divide m > 1, we may identify the finite abelian group E[m] with (\Z/m\Z)^2 and hence view the representation as a map

\overline{\rho}_{E,m}: \Gal(\overline{K}/K) \to \GL(2,\Z/m\Z)

defined up to conjugation. In particular, when m=\ell is a prime different from the characteristic of K, we have the mod-\ell Galois representation

\overline{\rho}_{E,\ell}: \Gal(\overline{K}/K) \to \GL(2,\Z/\ell\Z).

Taking the inverse limit over prime powers m=\ell^n yields the \ell-adic Galois representation attached to E,

\rho_{E,\ell}: \Gal(\overline{K}/K) \to \Aut(T_{\ell}(E)) \cong \GL(2,\Z_{\ell}),

which describes the action of the absolute Galois group of K on T_{\ell}(E), the \ell-adic Tate module of E.

When K has characteristic zero one can take the inverse limit over all positive integers m (ordered by divisibility) to obtain the adelic Galois representation

\rho_{E}: \Gal(\overline{K}/K) \to \GL(2,\hat{\Z}).

If E is an elliptic curve without complex multiplication that is defined over a number field, then the image of \rho_E is an open subgroup of \GL(2,\hat{\Z}) that has an associated level, index, and genus.

Depends on: Definition 4.1.4 Definition 4.1.11 Definition 4.1.61 Definition 1.1.14 Definition 1.1.16 Definition 1.1.21 Definition 8.3.56 Definition 5.1.1

Definition4.1.25
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.21
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Image of the adelic Galois representation. (LMFDB)

The image of the adelic Galois representation associate to an elliptic curve E over a number field K that does not have potential complex multiplication is an open subgroup H of \GL(2,\widehat{\Z}). The subgroup H has the following invariants:

  • The level of H is the least positive integer N such that H is the full inverse image of its projection to \GL(2,\Z/N\Z).

  • The index of H is the positive integer [\GL(2,\Z/N\Z):H].

  • The genus of H is the genus of the corresponding modular curve X_H.

Depends on: Definition 4.1.11 Definition 4.1.24 Definition 1.1.21 Definition 4.4.1

Definition4.1.26
Statement uses 8
Statement dependency previews
Preview
Definition 1.1.11
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Image of l-adic Galois representation. (LMFDB)

Let E/K be an elliptic curve over a number field, let \ell be a prime, and let H be the image of the \ell-adic Galois representation

\rho_{E,\ell}\colon G_{\Q}\to \Aut(E[\ell^{\infty}])\simeq \GL_2(\Z_{\ell}).

If E does not have potential complex multiplication, then H is an open subgroup of \GL_2(\Z_{\ell}) that is equal to the inverse image of its projection to \GL_2(\Z/\ell^n\Z), where \ell^n is the level of H.

If E has potential complex multiplication by an imaginary quadratic order \mathcal O, then H is an open subgroup of a Cartan subgroup of \GL_2(\Z_{\ell}) or its normalizer, depending on whether K contains \mathcal O or not. The particular Cartan subgroup depends on \mathcal O and \ell, but in every case H is determined by its projection to \GL_2(\Z/\ell^n\Z), where n is 4,3,1,1,\ldots for \ell=2,3,5,7,\ldots.

The subgroup H can be identified (up to conjugacy) by giving the label of its projection to \GL_2(\Z/\ell^n\Z) as defined by by Rouse, Sutherland, and Zureick-Brown in .

Depends on: Definition 4.1.4 Definition 4.1.11 Definition 4.1.24 Definition 1.1.11 Definition 1.1.15 Definition 1.1.16 Definition 1.1.21 Definition 5.1.1

Definition4.1.27
Statement uses 9
Statement dependency previews
Preview
Definition 1.1.10
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 4.4.32
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Image of mod-l Galois representation. (LMFDB)

Let \ell be a prime and let E be an elliptic curve defined over a number field K.

Subgroups G of \GL(2,\F_{\ell}) that can arise as the image of the mod-\ell Galois representation

\bar\rho_{E,\ell}\colon {\Gal}(\overline{K}/K)\to \GL(2,\F_{\ell})

attached to E that do not contain \SL(2,\F_{\ell}) are identified using the labels introduced by Sutherland in . For groups with surjective determinant map (necessarily the case when K=\Q), these labels have the form

\texttt{LS.a.b.c},

where \texttt{L} is the prime \ell, \texttt{S} is one of G, B, Cs, Cn, Ns, Nn, A4, S4, A5, and \texttt{a}, \texttt{b}, \texttt{c} are optional positive integers. When the determinant map is not surjective the label has "\texttt{[d]}", where d is the index of the determinant image in \F_{\ell}^\times.

When \bar\rho_{E,\ell} does not contain \SL(2,\F_{\ell}) the possibilities for \texttt{S} are: Borel B, split Cartan Cs, normalizer of the split Cartan Ns, nonsplit Cartan Cn, normalizer of the nonsplit Cartan Nn, exceptional A4, S4, A5. The cases A4 and A5 cannot occur when K=\Q.

Depends on: Definition 4.1.4 Definition 4.1.24 Definition 1.1.10 Definition 1.1.12 Definition 1.1.17 Definition 1.1.19 Definition 1.1.20 Definition 1.1.23 Definition 5.1.1

Lean code for Definition4.1.27●6 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/SutherlandGroupLabel.lean
    complete
    def Matrix.GeneralLinearGroup.HasSutherlandClass (p : ℕ)
      [Fact (Nat.Prime p)] (H : Subgroup (GL (Fin 2) (ZMod p)))
      (S : Matrix.GeneralLinearGroup.SutherlandClass) : Prop
    def Matrix.GeneralLinearGroup.HasSutherlandClass
      (p : ℕ) [Fact (Nat.Prime p)]
      (H : Subgroup (GL (Fin 2) (ZMod p)))
      (S :
        Matrix.GeneralLinearGroup.SutherlandClass) :
      Prop
    A subgroup `H` of `GL₂(𝔽_p)` **has Sutherland class** `S` (LMFDB `ec.galois_rep_modell_image`)
    if it satisfies Sutherland's condition for `S` and none of the conditions of the classes before `S`
    in his list. His conditions are meant to be mutually exclusive (Proposition 3.1 of the paper); the
    order only resolves the case `p = 2`, where the LMFDB's `Nn = GL₂(𝔽₂)` (`labelNn_two`) has
    dihedral projective image `S₃` and Sutherland's class of `GL₂(𝔽₂)` is `G`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2CanonicalLabel.lean
    complete
    def Matrix.GeneralLinearGroup.IsCanonicalSutherlandLabel (p : ℕ)
      [Fact (Nat.Prime p)] (H : Subgroup (GL (Fin 2) (ZMod p)))
      (L : Matrix.GeneralLinearGroup.SutherlandGroupLabel) : Prop
    def Matrix.GeneralLinearGroup.IsCanonicalSutherlandLabel
      (p : ℕ) [Fact (Nat.Prime p)]
      (H : Subgroup (GL (Fin 2) (ZMod p)))
      (L :
        Matrix.GeneralLinearGroup.SutherlandGroupLabel) :
      Prop
    `L` is **Sutherland's label** `ℓS.a.b.c[d]` of the subgroup `H` of `GL₂(𝔽_p)`
    (arXiv:1504.07618, §6.4; LMFDB `ec.galois_rep_modell_image`), as computed by his script
    `subgroups.m`: `H` has class `S`, `d` is the index of `det H` in `𝔽_pˣ`, `H` is conjugate to the
    group the label names (classes `G`, `B`, `Cs`, `Cn`, `Ns`, `Nn`), and the integers `a`, `b`, `c`
    satisfy Sutherland's conditions (`SutherlandGroupLabel.CanonicalParamsOf`). Every subgroup has
    exactly one such label, and two subgroups with the same label are conjugate. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2LabelClassification.lean
    complete
    def Matrix.GeneralLinearGroup.sutherlandLabel (p : ℕ) [Fact (Nat.Prime p)]
      (H : Subgroup (GL (Fin 2) (ZMod p))) :
      Matrix.GeneralLinearGroup.SutherlandGroupLabel
    def Matrix.GeneralLinearGroup.sutherlandLabel
      (p : ℕ) [Fact (Nat.Prime p)]
      (H : Subgroup (GL (Fin 2) (ZMod p))) :
      Matrix.GeneralLinearGroup.SutherlandGroupLabel
    **Sutherland's label** `ℓS.a.b.c[d]` of a subgroup of `GL₂(𝔽_p)` (arXiv:1504.07618v7, §6.4;
    LMFDB `ec.galois_rep_modell_image`): the unique label of `IsCanonicalSutherlandLabel`, without the
    prime. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2LabelClassification.lean
    complete
    theorem Matrix.GeneralLinearGroup.sutherlandLabel_eq_sutherlandLabel_iff {p : ℕ}
      [Fact (Nat.Prime p)] {H K : Subgroup (GL (Fin 2) (ZMod p))} :
      Matrix.GeneralLinearGroup.sutherlandLabel p H =
          Matrix.GeneralLinearGroup.sutherlandLabel p K ↔
        K ∈ Matrix.GeneralLinearGroup.subgroupConjClass p H
    theorem Matrix.GeneralLinearGroup.sutherlandLabel_eq_sutherlandLabel_iff
      {p : ℕ} [Fact (Nat.Prime p)]
      {H K : Subgroup (GL (Fin 2) (ZMod p))} :
      Matrix.GeneralLinearGroup.sutherlandLabel
            p H =
          Matrix.GeneralLinearGroup.sutherlandLabel
            p K ↔
        K ∈
          Matrix.GeneralLinearGroup.subgroupConjClass
            p H
    **The Sutherland label identifies the conjugacy classes of subgroups of `GL₂(𝔽_p)`**
    (arXiv:1504.07618v7, §6.4; LMFDB `ec.galois_rep_modell_image`, "are identified using the labels"):
    two subgroups have the same label exactly when they are conjugate. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/GaloisRep/ModEllImageCanonicalLabel.lean
    complete
    def WeierstrassCurve.modGaloisImageLabel.{u_1, u_2} {F : Type u_1}
      {K : Type u_2} [Field F] [Field K] [DecidableEq K] [Algebra F K]
      (W : WeierstrassCurve F) (ℓ : ℕ) [Fact (Nat.Prime ℓ)]
      (b :
        Module.Basis (Fin 2) (ZMod ℓ)
          ↥(AddSubgroup.torsionBy (W.baseChange K).toAffine.Point ↑ℓ)) :
      Matrix.GeneralLinearGroup.SutherlandGroupLabel
    def WeierstrassCurve.modGaloisImageLabel.{u_1,
        u_2}
      {F : Type u_1} {K : Type u_2} [Field F]
      [Field K] [DecidableEq K] [Algebra F K]
      (W : WeierstrassCurve F) (ℓ : ℕ)
      [Fact (Nat.Prime ℓ)]
      (b :
        Module.Basis (Fin 2) (ZMod ℓ)
          ↥(AddSubgroup.torsionBy
              (W.baseChange K).toAffine.Point
              ↑ℓ)) :
      Matrix.GeneralLinearGroup.SutherlandGroupLabel
    **Sutherland's label** `ℓS.a.b.c[d]` of the mod-`ℓ` image of `W` (LMFDB
    `ec.galois_rep_modell_image`), in a basis of `E[ℓ]`, on which it does not depend
    (`modGaloisImageLabel_eq`). A basis exists for an elliptic curve over a separably closed field `K`
    in which `ℓ` is invertible (`WeierstrassCurve.nonempty_basis_torsionBy`). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/GaloisRep/ModEllImageCanonicalLabel.lean
    complete
    theorem WeierstrassCurve.modGaloisImageLabel_cls_eq_S4.{u_1} {K : Type u_1}
      [Field K] [DecidableEq K] [Algebra ℚ K] [IsSepClosure ℚ K]
      (W : WeierstrassCurve ℚ) [W.IsElliptic] (ℓ : ℕ) [Fact (Nat.Prime ℓ)]
      (b :
        Module.Basis (Fin 2) (ZMod ℓ)
          ↥(AddSubgroup.torsionBy (W.baseChange K).toAffine.Point ↑ℓ))
      (hL : 6 ≤ (W.modGaloisImageLabel ℓ b).cls.toNat) :
      (W.modGaloisImageLabel ℓ b).cls =
        Matrix.GeneralLinearGroup.SutherlandClass.S4
    theorem WeierstrassCurve.modGaloisImageLabel_cls_eq_S4.{u_1}
      {K : Type u_1} [Field K] [DecidableEq K]
      [Algebra ℚ K] [IsSepClosure ℚ K]
      (W : WeierstrassCurve ℚ) [W.IsElliptic]
      (ℓ : ℕ) [Fact (Nat.Prime ℓ)]
      (b :
        Module.Basis (Fin 2) (ZMod ℓ)
          ↥(AddSubgroup.torsionBy
              (W.baseChange K).toAffine.Point
              ↑ℓ))
      (hL :
        6 ≤
          (W.modGaloisImageLabel ℓ
                b).cls.toNat) :
      (W.modGaloisImageLabel ℓ b).cls =
        Matrix.GeneralLinearGroup.SutherlandClass.S4
    **Over `ℚ` the classes `A4` and `A5` do not occur** (LMFDB `ec.galois_rep_modell_image`): an
    exceptional label of the mod-`ℓ` image has class `S4`, for `K` a separable closure of `ℚ`. 
Definition4.1.28
Statement uses 3
Statement dependency previews
Preview
Definition 1.2.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 4.1.11
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Geometric endomorphism ring. (LMFDB)

The geometric endomorphism ring of an elliptic curve E over a field K is \End(E_{\overline{K}}), the endomorphism ring of the base change of E to an algebraic closure \overline{K} of K.

This is a special case of the geometric endomorphism ring of an abelian variety.

Tau Ceti Review: TauCeti.Isogeny.Hom.

Depends on: Definition 1.2.2 Definition 1.2.26 Definition 4.1.23

Lean code for Definition4.1.28●6 declarations
  • abbrevdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/GeometricEndomorphismRing.lean
    complete
    abbrev WeierstrassCurve.GeometricEndAlgClosure.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Type u_1
    abbrev WeierstrassCurve.GeometricEndAlgClosure.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Type u_1
    The **geometric endomorphism ring** (LMFDB `ec.geom_endomorphism_ring`) of an elliptic curve
    `W` over `F`: the endomorphism ring `End(W_F̄)` of its base change to an algebraic closure `F̄` of
    `F`, here Mathlib's `AlgebraicClosure F`. Any other algebraic closure of `F` gives an isomorphic
    ring (`WeierstrassCurve.geometricEndAlgClosureEquiv`). 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/GeometricEndomorphismRing.lean
    complete
    def WeierstrassCurve.geometricEndAlgClosureEquiv.{u_1, u_2} {F : Type u_1}
      [Field F] (W : WeierstrassCurve F) (K : Type u_2) [Field K]
      [W.IsElliptic] [Algebra F K] [IsAlgClosure F K] :
      W.GeometricEndAlgClosure ≃+*
        TauCeti.Isogeny.Hom (W.baseChange K).toAffine
          (W.baseChange K).toAffine
    def WeierstrassCurve.geometricEndAlgClosureEquiv.{u_1,
        u_2}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) (K : Type u_2)
      [Field K] [W.IsElliptic] [Algebra F K]
      [IsAlgClosure F K] :
      W.GeometricEndAlgClosure ≃+*
        TauCeti.Isogeny.Hom
          (W.baseChange K).toAffine
          (W.baseChange K).toAffine
    **The geometric endomorphism ring does not depend on the algebraic closure** (LMFDB
    `ec.geom_endomorphism_ring`): for every algebraic closure `K` of `F`, the endomorphism ring of
    `W⁄K` is isomorphic to `W.GeometricEndAlgClosure`, by base change along an isomorphism
    `AlgebraicClosure F ≃ₐ[F] K`. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/GeometricEndomorphismRing.lean
    complete
    def WeierstrassCurve.baseChangeEndEquiv.{u_1, u_2, u_3} {F : Type u_1}
      [Field F] (W : WeierstrassCurve F) {K : Type u_2} {L : Type u_3}
      [Field K] [Field L] [W.IsElliptic] [Algebra F K] [Algebra F L]
      (e : K ≃ₐ[F] L) :
      TauCeti.Isogeny.Hom (W.baseChange K).toAffine
          (W.baseChange K).toAffine ≃+*
        TauCeti.Isogeny.Hom (W.baseChange L).toAffine
          (W.baseChange L).toAffine
    def WeierstrassCurve.baseChangeEndEquiv.{u_1,
        u_2, u_3}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) {K : Type u_2}
      {L : Type u_3} [Field K] [Field L]
      [W.IsElliptic] [Algebra F K]
      [Algebra F L] (e : K ≃ₐ[F] L) :
      TauCeti.Isogeny.Hom
          (W.baseChange K).toAffine
          (W.baseChange K).toAffine ≃+*
        TauCeti.Isogeny.Hom
          (W.baseChange L).toAffine
          (W.baseChange L).toAffine
    **Base change of endomorphisms along an isomorphism** `e : K ≃ₐ[F] L` of extensions of `F`:
    the ring isomorphism `End(W_K) ≃ End(W_L)` given by base change along `e`, with inverse the base
    change along `e⁻¹`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/GeometricEndomorphismRing.lean
    complete
    theorem WeierstrassCurve.baseChangeEndHom_injective.{u_1, u_2, u_3}
      {F : Type u_1} [Field F] (W : WeierstrassCurve F) {K : Type u_2}
      {L : Type u_3} [Field K] [Field L] [W.IsElliptic] [Algebra F K]
      [Algebra F L] (σ : K →ₐ[F] L) :
      Function.Injective ⇑(W.baseChangeEndHom σ)
    theorem WeierstrassCurve.baseChangeEndHom_injective.{u_1,
        u_2, u_3}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) {K : Type u_2}
      {L : Type u_3} [Field K] [Field L]
      [W.IsElliptic] [Algebra F K]
      [Algebra F L] (σ : K →ₐ[F] L) :
      Function.Injective
        ⇑(W.baseChangeEndHom σ)
    **Base change of endomorphisms is injective**: an endomorphism of `W⁄K` is determined by its
    base change along any homomorphism `σ : K →ₐ[F] L` of extensions of `F`. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/GeometricEndomorphismRing.lean
    complete
    def WeierstrassCurve.geometricEndEquivAlgClosure.{u_1} {F : Type u_1}
      [Field F] (W : WeierstrassCurve F) [W.IsElliptic] [PerfectField F] :
      W.GeometricEnd ≃+* W.GeometricEndAlgClosure
    def WeierstrassCurve.geometricEndEquivAlgClosure.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) [W.IsElliptic]
      [PerfectField F] :
      W.GeometricEnd ≃+*
        W.GeometricEndAlgClosure
    The **isomorphism of Tau Ceti's geometric endomorphism ring with that of this file** over a
    perfect field `F`: Tau Ceti's `W.GeometricEnd`, over the separable closure `SeparableClosure F`, is
    isomorphic to the geometric endomorphism ring `W.GeometricEndAlgClosure` over the algebraic
    closure, since the separable closure of a perfect field is an algebraic closure. 
  • structure(2 fields)defined in TauCeti/AlgebraicGeometry/EllipticCurve/Isogeny/Hom/Basic.lean
    complete
    structure TauCeti.Isogeny.Hom.{u_1} {F : Type u_1} [Field F]
      (W₁ W₂ : WeierstrassCurve.Affine F) : Type u_1
    structure TauCeti.Isogeny.Hom.{u_1} {F : Type u_1}
      [Field F]
      (W₁ W₂ : WeierstrassCurve.Affine F) :
      Type u_1
    **The carrier of `Hom(W₁, W₂)`**: an `F`-linear multiplicative map out of the target
    coordinate ring, pointed wherever it is unital. Its zero map is the zero morphism's formal
    representative and its unital elements are the isogenies. 
    toNonUnitalAlgHom : W₂.CoordinateRing →ₙₐ[F] W₁.FunctionField
    The underlying multiplicative map. Not an `AlgHom`: unitality is what the zero map fails. 
    mapsInfinity_of_map_one : self.toNonUnitalAlgHom.MapsInfinityOfMapOne
    Pointedness, required only of the unital maps. 
Definition4.1.29
Statement uses 7
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Definition 4.1.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Global minimal model. (LMFDB)

A global minimal model for an elliptic curve E defined over a number field K is a Weierstrass equation for E which is integral and is a local minimal model at all primes of K.

When K has class number 1 all elliptic curves over K have global minimal models. In general, there is an obstruction to the existence of a global minimal model for each elliptic curve E defined over K, which is an ideal class of K. In case this class is nontrivial for E, there is a semi-global minimal model for E, which is minimal at all primes except one, the ideal class of that one prime being the obstruction class.

Depends on: Definition 4.1.4 Definition 4.1.33 Definition 4.1.49 Definition 4.1.121 Definition 5.1.1 Definition 5.1.7 Definition 5.1.36

Definition4.1.30
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.1.42
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Good ordinary reduction. (LMFDB)

An elliptic curve E defined over a number field K is said to have ordinary reduction at a prime \mathfrak{p} of K if the reduction E_{\mathfrak{p}} of E modulo \mathfrak{p} is smooth, and E_{\mathfrak{p}} is ordinary.

An elliptic curve E_{\mathfrak{p}} defined over a finite field of characteristic p is ordinary if E_{\mathfrak{p}}(\overline{\F_p}) has nontrivial p-torsion.

Tau Ceti Review: WeierstrassCurve.HasGoodOrdinaryReduction, WeierstrassCurve.IsOrdinary.

Depends on: Definition 4.1.4 Definition 5.1.1

Lean code for Definition4.1.30●2 definitions
  • class(extends 2, 3 methods)defined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/OrdinaryReduction.lean
    complete
    class WeierstrassCurve.HasGoodOrdinaryReduction.{u_1, u_2} (R : Type u_1)
      [CommRing R] [IsDomain R] [IsDiscreteValuationRing R] {K : Type u_2}
      [Field K] [Algebra R K] [IsFractionRing R K] (p : ℕ)
      (W : WeierstrassCurve K) : Prop
    class WeierstrassCurve.HasGoodOrdinaryReduction.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K] (p : ℕ)
      (W : WeierstrassCurve K) : Prop
    **Good ordinary reduction** at `p`: a minimal equation with good reduction whose reduction is
    ordinary at `p`, that is, has a nonzero `p`-torsion point over the algebraic closure of the residue
    field. It is meant for `p` the characteristic of the residue field. 
    • WeierstrassCurve.HasGoodReduction R W
    val_Δ_maximal : MaximalFor (fun C => WeierstrassCurve.IsIntegral R (C • W)) (fun C => WeierstrassCurve.valuation_Δ_aux R (C • W)) 1
    Inherited from
    1. WeierstrassCurve.HasGoodReduction
    2. WeierstrassCurve.IsMinimal
    goodReduction : (IsDedekindDomain.HeightOneSpectrum.valuation K (IsDiscreteValuationRing.maximalIdeal R)) W.Δ = 1
    Inherited from
    1. WeierstrassCurve.HasGoodReduction
    isOrdinary_reduction : WeierstrassCurve.IsOrdinary p (WeierstrassCurve.reduction R W)
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/Supersingular.lean
    complete
    def WeierstrassCurve.IsOrdinary.{u_1} {K : Type u_1} [Field K] (p : ℕ)
      (W : WeierstrassCurve K) : Prop
    def WeierstrassCurve.IsOrdinary.{u_1}
      {K : Type u_1} [Field K] (p : ℕ)
      (W : WeierstrassCurve K) : Prop
    **An ordinary Weierstrass curve at `p`**: the curve is not supersingular at `p`, so it has a
    nonzero `p`-torsion point over the algebraic closure of `K`. 
Definition4.1.31
Statement uses 4
Statement dependency previews
Preview
Definition 1.2.18
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 10
Reverse dependency previews
Preview
Definition 4.1.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Good reduction. (LMFDB)

An elliptic curve E defined over a number field K is said to have good reduction at a prime \mathfrak{p} of K if the reduction of E modulo \mathfrak{p} is smooth.

If E has good reduction at every prime of K then E is said to have everywhere good reduction.

Tau Ceti Review: WeierstrassCurve.HasGoodReduction.

Depends on: Definition 1.2.18 Definition 4.1.4 Definition 5.1.1 Definition 5.1.64

Lean code for Definition4.1.31●1 definition
  • class(extends 1, 2 methods)defined in Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    class WeierstrassCurve.HasGoodReduction.{u_1, u_2} (R : Type u_1) [CommRing R]
      [IsDomain R] [IsDiscreteValuationRing R] {K : Type u_2} [Field K]
      [Algebra R K] [IsFractionRing R K] (W : WeierstrassCurve K) : Prop
    class WeierstrassCurve.HasGoodReduction.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K) : Prop
    A minimal Weierstrass equation has good reduction if and only if
    the valuation of its discriminant is 1. 
    • WeierstrassCurve.IsMinimal R W
    val_Δ_maximal : MaximalFor (fun C => WeierstrassCurve.IsIntegral R (C • W)) (fun C => WeierstrassCurve.valuation_Δ_aux R (C • W)) 1
    Inherited from
    1. WeierstrassCurve.IsMinimal
    goodReduction : (IsDedekindDomain.HeightOneSpectrum.valuation K (IsDiscreteValuationRing.maximalIdeal R)) W.Δ = 1
Definition4.1.32
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.1.42
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Good supersingular reduction. (LMFDB)

An elliptic curve E defined over a number field K is said to have supersingular reduction at a prime \mathfrak{p} of K if the reduction E_{\mathfrak{p}} of E modulo \mathfrak{p} is smooth, and E_{\mathfrak{p}} is supersingular.

An elliptic curve E_{\mathfrak{p}} defined over a finite field of characteristic p is supersingular if E_{\mathfrak{p}}(\overline{\F_p}) has no p-torsion.

Tau Ceti Review: WeierstrassCurve.HasGoodSupersingularReduction, WeierstrassCurve.IsSupersingular.

Depends on: Definition 4.1.4 Definition 5.1.1

Lean code for Definition4.1.32●2 definitions
  • class(extends 2, 3 methods)defined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/OrdinaryReduction.lean
    complete
    class WeierstrassCurve.HasGoodSupersingularReduction.{u_1, u_2} (R : Type u_1)
      [CommRing R] [IsDomain R] [IsDiscreteValuationRing R] {K : Type u_2}
      [Field K] [Algebra R K] [IsFractionRing R K] (p : ℕ)
      (W : WeierstrassCurve K) : Prop
    class WeierstrassCurve.HasGoodSupersingularReduction.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K] (p : ℕ)
      (W : WeierstrassCurve K) : Prop
    **Good supersingular reduction** at `p`: a minimal equation with good reduction whose
    reduction is supersingular at `p`, that is, has no nonzero `p`-torsion point over the algebraic
    closure of the residue field. It is meant for `p` the characteristic of the residue field. 
    • WeierstrassCurve.HasGoodReduction R W
    val_Δ_maximal : MaximalFor (fun C => WeierstrassCurve.IsIntegral R (C • W)) (fun C => WeierstrassCurve.valuation_Δ_aux R (C • W)) 1
    Inherited from
    1. WeierstrassCurve.HasGoodReduction
    2. WeierstrassCurve.IsMinimal
    goodReduction : (IsDedekindDomain.HeightOneSpectrum.valuation K (IsDiscreteValuationRing.maximalIdeal R)) W.Δ = 1
    Inherited from
    1. WeierstrassCurve.HasGoodReduction
    isSupersingular_reduction : WeierstrassCurve.IsSupersingular p (WeierstrassCurve.reduction R W)
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/Supersingular.lean
    complete
    def WeierstrassCurve.IsSupersingular.{u_1} {K : Type u_1} [Field K] (p : ℕ)
      (W : WeierstrassCurve K) : Prop
    def WeierstrassCurve.IsSupersingular.{u_1}
      {K : Type u_1} [Field K] (p : ℕ)
      (W : WeierstrassCurve K) : Prop
    **A supersingular Weierstrass curve at `p`**: the curve has no nonzero point of order dividing
    `p` over the algebraic closure of `K`. For an elliptic curve over a field of characteristic `p > 0`
    this is supersingularity in the sense of Silverman V.3.1. 
Definition4.1.33
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Integral model. (LMFDB)

An integral model for an elliptic curve E defined over a number field K is a Weierstrass equation for E all of whose coefficients are in the ring of integers of K.

Tau Ceti Review: WeierstrassCurve.IsIntegral.

Depends on: Definition 4.1.4 Definition 4.1.121 Definition 5.1.74

Lean code for Definition4.1.33●1 definition
  • class(1 method)defined in Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    class WeierstrassCurve.IsIntegral.{u_1, u_2} (R : Type u_1) [CommRing R]
      {K : Type u_2} [Field K] [Algebra R K] (W : WeierstrassCurve K) : Prop
    class WeierstrassCurve.IsIntegral.{u_1, u_2}
      (R : Type u_1) [CommRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      (W : WeierstrassCurve K) : Prop
    A Weierstrass equation over the fraction field `K` is integral if
    it has coefficients in the ring `R`. 
    integral : ∃ W_int, W = W_int.baseChange K
Definition4.1.34
uses 0used by 0XL∃∀N

Order of the Intrinsic Subgroup. (LMFDB)

Let E be an elliptic curve over a field k. Define the pairing

\langle \cdot, \cdot \rangle \colon E(k)_{\text{tors}} \times E(k)_{\text{tors}} \to k^\times \otimes \mathbb{Q}/\mathbb{Z}

as follows. Let P, Q \in E(k)_{\text{tors}}. Take n \in \Z such that nP = 0, and f \in k(E)^\times with \operatorname{div}(f) = n(P - O). Let D = \sum e_jQ_j \in \operatorname{Div}^0(X) so that P, O \notin |D| and [D] = [Q - O]; we define

\langle P, Q \rangle = \prod_j N_{k(Q_j)/k}(f(Q_j))^{e_j} \otimes \frac 1n.

In , Yamazaki et al. show that this definition is independent of n and f, and the pairing is symmetric and biadditive.

The intrinsic subgroup of E is the set

E(k)_{\text{tors}}^\text{is} = \{P \in E(k)_{\text{tors}} : \langle P, Q \rangle = 0 \text{ for all } Q \in E(k)_{\text{tors}}\}.

For curves E/\Q, the intrinsic subgroup is cyclic with order at most 5, by the results of .

Definition4.1.35
Statement uses 10
Statement dependency previews
Preview
Definition 1.1.34
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 4.1.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Elliptic curve invariants. (LMFDB)

The invariants of an elliptic curve E over a number field K are its

Each Weierstrass model for E also has a discriminant, \Delta, and discriminant norm, N(\Delta), which are not strictly invariants of E since different models have, in general, different discriminants.

Depends on: Definition 4.1.4 Definition 4.1.12 Definition 4.1.19 Definition 4.1.23 Definition 4.1.43 Definition 4.1.53 Definition 4.1.121 Definition 5.1.1 Definition 1.1.34 Definition 8.2.7

Definition4.1.36
Statement uses 8
Statement dependency previews
Preview
Definition 1.2.8
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 15
Reverse dependency previews
Preview
Definition 1.2.38
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Isogeny between elliptic curves. (LMFDB)

Let E_1 and E_2 be two elliptic curves defined over a field K. An isogeny (over K) between E_1 and E_2 is a non-constant morphism f\colon E_1 \to E_2 defined over K, i.e., a morphism of curves given by rational functions with coefficients in K, such that f(O_{E_1})= O_{E_2}. Elliptic curves E_1 and E_2 are called isogenous if there exists an isogeny f\colon E_1 \to E_2.

An isogeny respects the group laws on E_1 and E_2, and hence determines a group homomorphism E_1(L)\to E_2(L) for any extension L of K. The kernel is a finite group, defined over K; in general the points in the kernel are not individually defined over K but over a finite Galois extension of K and are permuted by the Galois action.

The degree of an isogeny is its degree as a morphism of algebraic curves. For a separable isogeny this is equal to the cardinality of the kernel. Over a field of characteristic 0 such as a number field, all isogenies are separable. In finite characteristic p, isogenies of degree coprime to p are all separable.

An isogeny is cyclic if its kernel is a cyclic group. Every isogeny is the composition of a cyclic isogeny with the multiplication-by-m map for some m\ge1.

Isogeny is an equivalence relation, and the equivalence classes are called isogeny classes. Over a number field, it is a consequence of a theorem of Shafarevich that isogeny classes are finite. Between any two curves in an isogeny class there is a unique degree of cyclic isogeny between them, except when the curves have additional endomorphisms defined over the base field of the curves; in that case there are cyclic isogenies of infinitely many different degrees between any two isogenous curves.

Isogenies from an elliptic curve E to itself are called endomorphisms. The set of all endomrpshisms of E forms a ring under pointwise addition and composition, the endomorphism ring of E.

An isogeny of elliptic curves is a special case of an isogeny of abelian varieties.

Depends on: Definition 1.2.8 Definition 4.9.11 Definition 4.1.4 Definition 4.1.22 Definition 4.1.23 Definition 8.3.66 Definition 5.1.1 Definition 5.1.44

Definition4.1.37
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 11
Reverse dependency previews
Preview
Definition 2.70
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Isogeny class of an elliptic curve. (LMFDB)

The isogeny class (over a field K) of an elliptic curve E defined over K is the set of all isomorphism classes of elliptic curves defined over K that are isogenous to E over K. Over a number field K this is always a finite set; over \Q, it has at most 8 elements by a theorem of Kenku .

Depends on: Definition 4.1.4 Definition 4.1.36

Definition4.1.38
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Isogeny class degree. (LMFDB)

The isogeny class degree of an isogeny class of elliptic curves is the least common multiple of the degrees of all rational cyclic isogenies between elliptic curves in the isogeny class.

Depends on: Definition 4.1.4 Definition 4.1.36 Definition 4.1.37

Definition4.1.39
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Isogeny graph of an isogeny class of elliptic curves. (LMFDB)

The isogeny graph of an isogeny class of elliptic curves is the graph whose vertices are the isomorphism classes (over the base field) of elliptic curves in the isogeny class and whose edges are the isogenies of prime degree between the curves representing the vertices.

The vertices of the isogeny graphs in the LMFDB are labeled by the final entry of the LMFDB label of the corresponding (isomorphism classes of) elliptic curves. Their edges, of which there may be several between any two given vertices, are labeled by the prime that is the degree of the corresponding isogeny.

Depends on: Definition 4.1.4 Definition 4.1.37

Lean code for Definition4.1.39●2 definitions
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Isogeny/Graph.lean
    complete
    def WeierstrassCurve.IsogenyGraph.{u_1} {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) : Type u_1
    def WeierstrassCurve.IsogenyGraph.{u_1}
      {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) : Type u_1
    The **isogeny graph** (LMFDB `ec.isogeny_graph`) of an elliptic curve `W` over `K`: its vertices
    are the isomorphism classes in the isogeny class of `W`, and its edges are labelled by primes. It
    is a quiver: the arrows from `c` to `c'` are the primes `ℓ` such that there is an isogeny of degree
    `ℓ` over `K` from a curve in `c` to a curve in `c'`. Its reversal of arrows, which keeps the label
    by taking dual isogenies, is involutive, so it is an undirected multigraph. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Isogeny/Graph.lean
    complete
    def WeierstrassCurve.IsomorphismClass.HasIsogenyOfDegree.{u_1}
      {K : Type u_1} [Field K] (n : ℕ)
      (c c' : WeierstrassCurve.IsomorphismClass K) : Prop
    def WeierstrassCurve.IsomorphismClass.HasIsogenyOfDegree.{u_1}
      {K : Type u_1} [Field K] (n : ℕ)
      (c c' :
        WeierstrassCurve.IsomorphismClass K) :
      Prop
    There is an isogeny of degree `n` over `K` from a Weierstrass curve in the isomorphism class
    `c` to a Weierstrass curve in the isomorphism class `c'`. 
Definition4.1.40
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Isogeny matrix of an isogeny class of elliptic curves. (LMFDB)

The isogeny matrix of an isogeny class of elliptic curves is a symmetric matrix with integral entries that records the minimum among the degrees of the cyclic isogenies between the elliptic curves in the isogeny class.

In the LMFDB, the rows and columns of the matrices are ordered by the final entry of the label of the elliptic curves in the isogeny class in question, so that the (i,j)-th entry is the smallest possible degree of a cyclic isogeny between the i-th and j-th curve in the isogeny class.

Depends on: Definition 4.1.4 Definition 4.1.37

Lean code for Definition4.1.40●6 declarations
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Isogeny/Matrix.lean
    complete
    def WeierstrassCurve.isogenyMatrix.{u_1} {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) : Matrix ↑W.isogenyClass ↑W.isogenyClass ℕ
    def WeierstrassCurve.isogenyMatrix.{u_1}
      {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) :
      Matrix ↑W.isogenyClass ↑W.isogenyClass ℕ
    The **isogeny matrix** (LMFDB `ec.isogeny_matrix`) of an elliptic curve `W` over `K`: the
    matrix indexed by the isomorphism classes in the isogeny class of `W` whose `(c, c')` entry is the
    least degree of a cyclic isogeny over `K` (`TauCeti.Isogeny.IsCyclic`) from a curve in `c` to a
    curve in `c'`. Over a field of characteristic zero it is symmetric (`isSymm_isogenyMatrix`). The
    LMFDB orders its rows and columns by the LMFDB labels of the curves. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Isogeny/Matrix.lean
    complete
    theorem WeierstrassCurve.isSymm_isogenyMatrix.{u_1} {K : Type u_1} [Field K]
      {W : WeierstrassCurve K} [CharZero K] : W.isogenyMatrix.IsSymm
    theorem WeierstrassCurve.isSymm_isogenyMatrix.{u_1}
      {K : Type u_1} [Field K]
      {W : WeierstrassCurve K} [CharZero K] :
      W.isogenyMatrix.IsSymm
    **The isogeny matrix is symmetric** over a field of characteristic zero: the dual of a cyclic
    isogeny is a cyclic isogeny of the same degree in the other direction. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Isogeny/CyclicExists.lean
    complete
    theorem WeierstrassCurve.isLeast_isogenyMatrix.{u_1} {K : Type u_1} [Field K]
      [CharZero K] {W : WeierstrassCurve K} [W.IsElliptic]
      (c c' : ↑W.isogenyClass) :
      IsLeast ((↑c).cyclicIsogenyDegrees ↑c') (W.isogenyMatrix c c')
    theorem WeierstrassCurve.isLeast_isogenyMatrix.{u_1}
      {K : Type u_1} [Field K] [CharZero K]
      {W : WeierstrassCurve K} [W.IsElliptic]
      (c c' : ↑W.isogenyClass) :
      IsLeast ((↑c).cyclicIsogenyDegrees ↑c')
        (W.isogenyMatrix c c')
    **Every entry of the isogeny matrix is the least degree of a cyclic isogeny** between curves in
    the two classes, over a field of characteristic zero: such cyclic isogenies exist. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Isogeny/CyclicExists.lean
    complete
    theorem WeierstrassCurve.exists_isCyclic_degree_eq_isogenyMatrix.{u_1}
      {K : Type u_1} [Field K] [CharZero K] {W W₁ W₂ : WeierstrassCurve K}
      [W.IsElliptic] [W₁.IsElliptic] [W₂.IsElliptic]
      (h₁ : ⟦W₁⟧ ∈ W.isogenyClass) (h₂ : ⟦W₂⟧ ∈ W.isogenyClass) :
      ∃ φ, φ.IsCyclic ∧ φ.degree = W.isogenyMatrix ⟨⟦W₁⟧, h₁⟩ ⟨⟦W₂⟧, h₂⟩
    theorem WeierstrassCurve.exists_isCyclic_degree_eq_isogenyMatrix.{u_1}
      {K : Type u_1} [Field K] [CharZero K]
      {W W₁ W₂ : WeierstrassCurve K}
      [W.IsElliptic] [W₁.IsElliptic]
      [W₂.IsElliptic]
      (h₁ : ⟦W₁⟧ ∈ W.isogenyClass)
      (h₂ : ⟦W₂⟧ ∈ W.isogenyClass) :
      ∃ φ,
        φ.IsCyclic ∧
          φ.degree =
            W.isogenyMatrix ⟨⟦W₁⟧, h₁⟩
              ⟨⟦W₂⟧, h₂⟩
    **The entry of the isogeny matrix at the classes of two curves is the degree of a cyclic
    isogeny between them**, over a field of characteristic zero. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Isogeny/CyclicExists.lean
    complete
    theorem TauCeti.Isogeny.exists_isCyclic.{u_1} {K : Type u_1} [Field K]
      [CharZero K] {W₁ W₂ : WeierstrassCurve.Affine K}
      [WeierstrassCurve.IsElliptic W₁] [WeierstrassCurve.IsElliptic W₂]
      (h : Nonempty (TauCeti.Isogeny W₁ W₂)) : ∃ ψ, ψ.IsCyclic
    theorem TauCeti.Isogeny.exists_isCyclic.{u_1}
      {K : Type u_1} [Field K] [CharZero K]
      {W₁ W₂ : WeierstrassCurve.Affine K}
      [WeierstrassCurve.IsElliptic W₁]
      [WeierstrassCurve.IsElliptic W₂]
      (h : Nonempty (TauCeti.Isogeny W₁ W₂)) :
      ∃ ψ, ψ.IsCyclic
    **There is a cyclic isogeny between two elliptic curves as soon as there is an isogeny**, over
    a field of characteristic zero: an isogeny of least degree between them is cyclic. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Isogeny/ClassDegree.lean
    complete
    def WeierstrassCurve.IsomorphismClass.cyclicIsogenyDegrees.{u_1}
      {K : Type u_1} [Field K]
      (c c' : WeierstrassCurve.IsomorphismClass K) : Set ℕ
    def WeierstrassCurve.IsomorphismClass.cyclicIsogenyDegrees.{u_1}
      {K : Type u_1} [Field K]
      (c c' :
        WeierstrassCurve.IsomorphismClass K) :
      Set ℕ
    The degrees of the cyclic isogenies over `K` (`TauCeti.Isogeny.IsCyclic`) from an elliptic
    curve in the isomorphism class `c` to an elliptic curve in the isomorphism class `c'`. 
Definition4.1.41
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 4.1.43
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Isomorphism of elliptic curves. (LMFDB)

An isomorphism between two elliptic curves E, E' defined over a field K is an isogeny f:E\to E' such that there exist an isogeny g:E'\to E with the compositions g\circ f and f\circ g being the identity maps. Equivalently, an isomorphism E\to E' is an isogeny of degree 1.

Isomorphism is an equivalence relation, the equivalnce classes being called isomorphism classes.

When E and E' are defined by Weierstrass models, such an isomorphism is uniquely represented as a Weierstrass isomorphism between these models.

Tau Ceti Review: WeierstrassCurve.VariableChange, TauCeti.Isogeny.degree_eq_one_of_comp_eq_id, TauCeti.Isogeny.exists_variableChangeIsogeny_eq_of_degree_eq_one, TauCeti.Isogeny.variableChangeIsogeny_inj.

Depends on: Definition 4.1.4 Definition 4.1.36

Lean code for Definition4.1.41●4 declarations
  • structure(4 fields)defined in Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean
    complete
    structure WeierstrassCurve.VariableChange.{u} (R : Type u) [CommRing R] : Type u
    structure WeierstrassCurve.VariableChange.{u}
      (R : Type u) [CommRing R] : Type u
    An admissible linear change of variables of Weierstrass curves defined over a ring `R` given by
    a tuple `(u, r, s, t)` for some `u` in `Rˣ` and some `r, s, t` in `R`. As a matrix, it is
    $$\begin{pmatrix} u^2 & 0 & r \cr u^2s & u^3 & t \cr 0 & 0 & 1 \end{pmatrix}.$$
    In other words, this is the change of variables `(X, Y) ↦ (u²X + r, u³Y + u²sX + t)`.
    When `R` is a field, any two isomorphic Weierstrass equations are related by this. 
    u : Rˣ
    The `u` coefficient of an admissible linear change of variables, which must be a unit. 
    r : R
    The `r` coefficient of an admissible linear change of variables. 
    s : R
    The `s` coefficient of an admissible linear change of variables. 
    t : R
    The `t` coefficient of an admissible linear change of variables. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/Isogeny/Degree.lean
    complete
    theorem TauCeti.Isogeny.degree_eq_one_of_comp_eq_id.{u_1} {F : Type u_1}
      [Field F] {W₁ W₂ : WeierstrassCurve.Affine F}
      {ψ : TauCeti.Isogeny W₂ W₁} {φ : TauCeti.Isogeny W₁ W₂}
      (h : ψ.comp φ = TauCeti.Isogeny.id W₁) : ψ.degree = 1 ∧ φ.degree = 1
    theorem TauCeti.Isogeny.degree_eq_one_of_comp_eq_id.{u_1}
      {F : Type u_1} [Field F]
      {W₁ W₂ : WeierstrassCurve.Affine F}
      {ψ : TauCeti.Isogeny W₂ W₁}
      {φ : TauCeti.Isogeny W₁ W₂}
      (h : ψ.comp φ = TauCeti.Isogeny.id W₁) :
      ψ.degree = 1 ∧ φ.degree = 1
    **Both factors of an identity composite have degree one.** Degree is multiplicative and the
    identity has degree one, and `1` factors in `ℕ` only as `1 * 1`. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/Isogeny/VariableChange.lean
    complete
    theorem TauCeti.Isogeny.exists_variableChangeIsogeny_eq_of_degree_eq_one.{u_1}
      {F : Type u_1} [Field F] {W₁ W₂ : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic W₁] [WeierstrassCurve.IsElliptic W₂]
      (φ : TauCeti.Isogeny W₁ W₂) (hφ : φ.degree = 1) :
      ∃ C,
        ∃ (h : C • W₁ = W₂), TauCeti.Isogeny.variableChangeIsogeny C h = φ
    theorem TauCeti.Isogeny.exists_variableChangeIsogeny_eq_of_degree_eq_one.{u_1}
      {F : Type u_1} [Field F]
      {W₁ W₂ : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic W₁]
      [WeierstrassCurve.IsElliptic W₂]
      (φ : TauCeti.Isogeny W₁ W₂)
      (hφ : φ.degree = 1) :
      ∃ C,
        ∃ (h : C • W₁ = W₂),
          TauCeti.Isogeny.variableChangeIsogeny
              C h =
            φ
    **An isogeny of degree one between elliptic curves is a change of variables** (Silverman
    III.3.1(b)): there is a change of variables `C` with `C • W₁ = W₂` whose isogeny is `φ`. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/Isogeny/VariableChange.lean
    complete
    theorem TauCeti.Isogeny.variableChangeIsogeny_inj.{u_1} {F : Type u_1} [Field F]
      {W₁ W₂ : WeierstrassCurve.Affine F}
      (C C' : WeierstrassCurve.VariableChange F) (h : C • W₁ = W₂)
      (h' : C' • W₁ = W₂) :
      TauCeti.Isogeny.variableChangeIsogeny C h =
          TauCeti.Isogeny.variableChangeIsogeny C' h' ↔
        C = C'
    theorem TauCeti.Isogeny.variableChangeIsogeny_inj.{u_1}
      {F : Type u_1} [Field F]
      {W₁ W₂ : WeierstrassCurve.Affine F}
      (C C' :
        WeierstrassCurve.VariableChange F)
      (h : C • W₁ = W₂) (h' : C' • W₁ = W₂) :
      TauCeti.Isogeny.variableChangeIsogeny C
            h =
          TauCeti.Isogeny.variableChangeIsogeny
            C' h' ↔
        C = C'
    **A change of variables is determined by its isogeny.** 
Definition4.1.42
Statement uses 5
Statement dependency previews
Preview
Definition 4.1.30
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Iwasawa invariants of elliptic curves. (LMFDB)

The Iwasawa invariants of elliptic curves are \lambda-invariants and \mu-invariants.

For an elliptic curve E and a prime p of ordinary or multiplicative reduction, the \lambda- and \mu-invariants are non-negative integers \lambda_p(E) and \mu_p(E) which arise as the Iwasawa invariants of the p-adic L-function L_p(E).

If E has supersingular reduction at p, then there are two associated p-adic L-functions: L_{p,\alpha}(E) and L_{p,\beta}(E) associated to the pair of roots \alpha and \beta of the Hecke polynomial x^2-a_p(E)x+p. However, in this case, these functions are not Iwasawa functions. Instead, we consider the pair of Iwasawa functions L_p^+(E) and L_p^-(E) as defined in Robert Pollack, On the p-adic L-function of a modular form at a supersingular prime, Duke Mathematical Journal, 118 (2003) no. 3, 523-558 (when a_p(E)=0) and Florian Sprung, Iwasawa theory for elliptic curves at supersingular primes: a pair of main conjectures. J. Number Theory 132 (2012), no. 7, 1483–1506 (when a_p(E) is non-zero). We then get two \lambda-invariants: \lambda^+_p(E) and \lambda^-_p(E), and two \mu-invariants: \mu^+_p(E) and \mu^-_p(E). These invariants are computed as in section 6 of Bernadette Perrin-Riou, Arithmétique des courbes elliptiques à réduction supersingulière en p, Experimental Mathematics 12 (2003), no. 2, 155–186 .

We note that if E has rank 0, then its Iwasawa invariants at a prime p>5 are zero unless at least one of the following hold:

  1. the p-adic valuation of L(E,1)/\Omega_E is non-zero;

  2. p is a split multiplicative prime;

  3. a_p=1.

Conditions (1) and (2) hold for only finitely many p. Condition (3) will hold for finitely many p if E possesses a non-trivial torsion point. In this case, we compute a prime q so that for all good p \geq q the Iwasawa invariants at p vanish.

Depends on: Definition 4.1.30 Definition 4.1.32 Definition 4.1.46 Definition 4.1.56 Definition 4.1.57

Definition4.1.43
Statement uses 4
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 10
Reverse dependency previews
Preview
Definition 4.1.8
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

j-invariant of an elliptic curve. (LMFDB)

The j-invariant of an elliptic curve E defined over a field K is an invariant of the isomorphism class of E over \overline{K}. If the Weierstrass equation of E is

y^2+a_1xy+a_3y=x^3+a_2x^2+a_4x+a_6,

then its j-invariant is given by

j = \frac{c_4^3}{\Delta} where

\begin{aligned} b_2 &= a_1^2 + 4 a_2\\ b_4 &= 2a_4 + a_1 a_3\\ b_6 &= a_3^2 + 4 a_6 \\ b_8 &= a_1^2 a_6 + 4 a_2 a_6 - a_1 a_3 a_4 + a_2 a_3^2 - a_4^2\\ c_4 &= b_2^2 - 24b_4 \end{aligned}

and

\Delta=-b_2^2b_8 - 8 b_4^3 -27 b_6 ^2 + 9 b_2 b_4 b_6

is the discriminant of E.

Tau Ceti Review: WeierstrassCurve.j.

Depends on: Definition 4.1.4 Definition 4.1.19 Definition 4.1.41 Definition 4.1.121

Lean code for Definition4.1.43●1 definition
  • defdefined in Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean
    complete
    def WeierstrassCurve.j.{u} {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) [W.IsElliptic] : R
    def WeierstrassCurve.j.{u} {R : Type u}
      [CommRing R] (W : WeierstrassCurve R)
      [W.IsElliptic] : R
    The j-invariant `j` of an elliptic curve, which is invariant under isomorphisms over `R`.
    Note that to prove two equal elliptic curves have the same `j`, you need to use `simp_rw`,
    as `rw` cannot transfer instance `WeierstrassCurve.IsElliptic` automatically. 
Definition4.1.44
uses 1used by 0✓L∃∀N

j-invariant denominator valuation. (LMFDB)

The valuation of the denominator of the j-invariant at a prime. This is 0 if the j-invariant has non-negative valuation, and is minus the valuation otherwise.

Tau Ceti Review: WeierstrassCurve.j.

Depends on: Definition 4.1.43

Lean code for Definition4.1.44●3 definitions
  • abbrevdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/LocalData.lean
    complete
    abbrev WeierstrassCurve.LocalData.jDenominatorValuation
      (self : WeierstrassCurve.LocalData) : ℕ
    abbrev WeierstrassCurve.LocalData.jDenominatorValuation
      (self : WeierstrassCurve.LocalData) : ℕ
    The valuation `ord_𝔭(j)₋` of the denominator of the `j`-invariant. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/LocalData.lean
    complete
    def WeierstrassCurve.localData.{u_1} {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) [NumberField K] [W.IsElliptic]
      (p :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers K)) :
      WeierstrassCurve.LocalData
    def WeierstrassCurve.localData.{u_1}
      {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) [NumberField K]
      [W.IsElliptic]
      (p :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers K)) :
      WeierstrassCurve.LocalData
    The **local data** (LMFDB `ec.local_data`) of an elliptic curve `W` over a number field at a
    prime `𝔭`, without the local root number: the Tamagawa number `c_𝔭(E)`, read on the completion at
    `𝔭`, and, read over the localisation of the ring of integers at `𝔭`, the Kodaira symbol at which
    Tate's algorithm stops, the reduction type, the algorithmic Ogg exponent `ord_𝔭(𝔑)`, the valuation
    `ord_𝔭(𝔇)` of the minimal discriminant, and the valuation `ord_𝔭(j)₋ = max 0 (-ord_𝔭(j))` of the
    denominator of the `j`-invariant. 
  • defdefined in Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean
    complete
    def WeierstrassCurve.j.{u} {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) [W.IsElliptic] : R
    def WeierstrassCurve.j.{u} {R : Type u}
      [CommRing R] (W : WeierstrassCurve R)
      [W.IsElliptic] : R
    The j-invariant `j` of an elliptic curve, which is invariant under isomorphisms over `R`.
    Note that to prove two equal elliptic curves have the same `j`, you need to use `simp_rw`,
    as `rw` cannot transfer instance `WeierstrassCurve.IsElliptic` automatically. 
Definition4.1.45
Statement uses 4
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Kodaira symbol. (LMFDB)

The Kodaira symbol of an elliptic curve E defined over a number field encodes the reduction type of E at a prime \mathfrak{p} of K. It describes the combinatorics of the special fiber of the Ne;ron model of the elliptic curve. The Ne;ron model is obtained from the local minimal model for E at \mathfrak{p} using Tate's algorithm. For an exact definition and properties, consult a text on elliptic curves.

Depends on: Definition 4.1.4 Definition 4.1.49 Definition 4.1.107 Definition 5.1.1

Definition4.1.46
Statement uses 4
Statement dependency previews
Preview
Definition 4.1.30
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

lambda-invariant of an elliptic curve. (LMFDB)

The analytic \lambda-invariant of an elliptic curve E at a prime p of ordinary or multiplicative reduction is the number of zeroes of the p-adic L-function of E. Explicitly, if we write the p-adic L-function of E as a power series in a variable T:

L_p(E,T) = p^{\mu_p(E)} (a_0 + a_1 T + a_2 T^2 + ...)

where \mu_p(E) is the \mu-invariant of E, then the \lambda-invariant is the first index i such that a_i is a p-adic unit. By the main conjecture for elliptic curves, this invariant should match the algebraic \lambda-invariant which is defined analogously in terms of the Selmer group of E.

When E has supersingular reduction at p, there is a pair of p-adic L-functions: L_p^+(E,T) and L_p^-(E,T) and one defines analogously a pair of \lambda-invariants: \lambda^+_p(E) and \lambda^-_p(E).

Depends on: Definition 4.1.30 Definition 4.1.32 Definition 4.1.56 Definition 4.1.57

Definition4.1.47
Statement uses 5
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.1.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Local data of an elliptic curve. (LMFDB)

The local data of an elliptic curve E defined over a number field K at a prime \mathfrak{p} of K consists of

Depends on: Definition 4.1.4 Definition 4.1.45 Definition 4.1.107 Definition 4.1.117 Definition 5.1.1

Definition4.1.48
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Local minimal discriminant of an elliptic curve. (LMFDB)

Let E be an elliptic curve defined over a number field K, and \mathfrak{p} a prime of K. The local minimal discriminant of E is the ideal \mathfrak{p}^e where e is is the valuation of the discriminant of a local minimal model for E at \mathfrak{p}.

Tau Ceti Review: WeierstrassCurve.localMinimalDiscriminant, WeierstrassCurve.localMinimalDiscriminantValuation.

Depends on: Definition 4.1.4 Definition 4.1.49 Definition 5.1.1

Lean code for Definition4.1.48●2 definitions
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/LocalDiscriminant.lean
    complete
    def WeierstrassCurve.localMinimalDiscriminant.{u_1, u_2} (R : Type u_1)
      [CommRing R] [IsDomain R] [IsDiscreteValuationRing R] {K : Type u_2}
      [Field K] [Algebra R K] [IsFractionRing R K]
      (W : WeierstrassCurve K) : Ideal R
    def WeierstrassCurve.localMinimalDiscriminant.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K) : Ideal R
    **The local minimal discriminant ideal.** It is the principal ideal of `R` generated by the
    discriminant of a minimal integral equation in the variable-change orbit of `W`.
    
    The definition uses Mathlib's chosen `W.minimal R`; use `localMinimalDiscriminant_eq_span_Δ` to
    compute it from any minimal equation in the same orbit. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Valuation.lean
    complete
    def WeierstrassCurve.localMinimalDiscriminantValuation.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      (W : WeierstrassCurve K) [W.IsElliptic] : ℕ
    def WeierstrassCurve.localMinimalDiscriminantValuation.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K)
      [W.IsElliptic] : ℕ
    **The valuation of the local minimal discriminant.** This is the exponent of the maximal
    ideal of `R` in `W.localMinimalDiscriminant R`, equivalently the additive valuation of the
    discriminant of a minimal integral equation in the variable-change orbit of `W`.
    
    The ellipticity hypothesis ensures that this discriminant is nonzero, so the extended-natural
    additive valuation is finite and has an honest natural-number value. 
Definition4.1.49
Statement uses 5
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 4.1.29
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Local minimal model. (LMFDB)

A local minimal model for an elliptic curve E defined over a number field K at a prime \mathfrak{p} of K is a Weierstrass equation for E all of whose coefficients are integral at \mathfrak{p}, and whose discriminant has minimal valuation at \mathfrak{p} among all such equations.

Tau Ceti Review: WeierstrassCurve.minimal.

Depends on: Definition 4.1.4 Definition 4.1.19 Definition 4.1.121 Definition 5.1.1 Definition 5.1.41

Lean code for Definition4.1.49●1 definition
  • defdefined in Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    def WeierstrassCurve.minimal.{u_1, u_2} (R : Type u_1) [CommRing R]
      [IsDomain R] [IsDiscreteValuationRing R] {K : Type u_2} [Field K]
      [Algebra R K] [IsFractionRing R K] (W : WeierstrassCurve K) :
      WeierstrassCurve K
    def WeierstrassCurve.minimal.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K) :
      WeierstrassCurve K
    A minimal Weierstrass equation for a given Weierstrass curve over `K`. 
Definition4.1.50
Statement uses 9
Statement dependency previews
Preview
Definition 3.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Local root number. (LMFDB)

The local root number of an elliptic curve E over a number field at a prime \mathfrak p is the sign of the local functional equation of E. This is equal to +1 at primes of good or non-split multiplicative reduction, -1 at primes of split multiplicative reduction, and at primes of additive reduction is \pm1 with no simple characterization.

For an elliptic curve defined over \Q, the root number at a prime p is also equal to the eigenvalue of the associated Atkin-Lehner involution for the associated modular form.

Depends on: Definition 3.1.1 Definition 3.1.6 Definition 4.1.4 Definition 4.1.5 Definition 4.1.31 Definition 4.1.59 Definition 4.1.116 Definition 5.1.1 Definition 5.1.64

Definition4.1.51
Statement uses 5
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Maximal l-adic Galois representation. (LMFDB)

Let E be an elliptic curve over a number field K, let \ell be prime, and let

\rho_{E,\ell}\colon \Gal(\overline{K}/K)\to \Aut(E[\ell^\infty]) \simeq \GL_2(\Z_{\ell})

be the \ell-adic Galois representation associated to E.

If E does not have potential complex multiplication, then \rho_{E,\ell} is maximal if its image contains \SL_2(\Z_{\ell}).

In general, let \mathcal{O} be the geometric endomorphism ring of E. Then E[\ell^\infty] is an \mathcal{O}-module, and we view \Aut_{\mathcal{O}}(E[\ell^\infty]) as a subgroup of \Aut(E[\ell^\infty]) \simeq \GL_2(\Z_{\ell}) that contains the image of \rho_{E,\ell} whenever K contains \mathcal O. We say that \rho_{E,\ell} is maximal if its image contains \SL_2(\Z_{\ell}) \cap \Aut_{\mathcal{O}}(E[\ell^\infty]), in which case we call \ell a maximal prime for E.

Depends on: Definition 4.1.4 Definition 4.1.11 Definition 4.1.24 Definition 4.1.28 Definition 5.1.1

Definition4.1.52
Statement uses 8
Statement dependency previews
Preview
Definition 1.1.10
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Maximal Galois representation. (LMFDB)

Let E be an elliptic curve over a number field K, let \ell be prime, and let

\bar\rho_{E,\ell}\colon \Gal(\overline{K}/K)\to \Aut(E[\ell]) \simeq \GL_2(\F_{\ell})

be the mod-\ell Galois representation associated to E.

If E does not have potential complex multiplication, then \bar\rho_{E,\ell} is maximal if its image contains \SL_2(\F_{\ell}).

In general, let \mathcal{O} be the geometric endomorphism ring. Then E[\ell] is an \mathcal{O}-module and we view \Aut_{\mathcal{O}}(E[\ell]) \leq \Aut(E[\ell]) \simeq \GL_2(\F_{\ell}). We say that \bar\rho_{E,\ell} is maximal if its image contains \SL_2(\F_{\ell}) \cap \Aut_{\mathcal{O}}(E[\ell]).

For K=\Q, the image of a maximal \bar\rho_{E,\ell} is \GL_2(\F_{\ell}), a Borel subgroup, the normalizer of a split Cartan subgroup, or the normalizer of a non-split Cartan subgroup, depending on whether \mathcal{O}=\Z or \mathcal{O}\ne \Z and \ell is ramified, split, or inert in \mathcal{O}, respectively.

Depends on: Definition 4.1.4 Definition 4.1.11 Definition 4.1.24 Definition 4.1.28 Definition 1.1.10 Definition 1.1.19 Definition 1.1.20 Definition 5.1.1

Definition4.1.53
Statement uses 8
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Definition 4.1.21
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Minimal discriminant. (LMFDB)

The minimal discriminant (or minimal discriminant ideal) of an elliptic curve E over a number field K is the ideal \mathfrak{D}_{min} of the ring of integers of K given by

\mathfrak{D}_{\mathrm{min}} = \prod_{\mathfrak{p}}\mathfrak{p}^{e_{\mathfrak{p}}},

where the product is over all primes \mathfrak{p} of K, and \mathfrak{p}^{e_{\mathfrak{p}}} is the local minimal discriminant of E at \mathfrak{p}.

If E has a Weierstrass model which is a global minimal model then \mathfrak{D}_{\mathrm{min}} = (\Delta), the principal ideal generated by the discriminant \Delta of this model. In general, \mathfrak{D}_{\mathrm{min}} differs from the ideal generated by the discriminant of any Weierstrass model by the 12th power of an ideal.

Tau Ceti Review: WeierstrassCurve.minimalDiscriminantIdeal, WeierstrassCurve.minimalDiscriminantIdeal_def, WeierstrassCurve.minimalDiscriminantIdeal_smul, WeierstrassCurve.minimalDiscriminantIdeal_eq_span_of_isGlobalMinimal, WeierstrassCurve.span_Δ_eq_minimalDiscriminantIdeal_mul_weierstrassDefectIdeal_pow_twelve.

Depends on: Definition 4.1.4 Definition 4.1.19 Definition 4.1.29 Definition 4.1.48 Definition 4.1.121 Definition 5.1.1 Definition 5.1.64 Definition 5.1.74

Lean code for Definition4.1.53●6 declarations
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/DiscriminantIdeal.lean
    complete
    def WeierstrassCurve.minimalDiscriminantIdeal.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O] {K : Type u_2} [Field K]
      [Algebra O K] [IsFractionRing O K] (W : WeierstrassCurve K)
      [W.IsElliptic] : Ideal O
    def WeierstrassCurve.minimalDiscriminantIdeal.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve K)
      [W.IsElliptic] : Ideal O
    **The minimal discriminant ideal** `𝔇_{E/K} = ∏ᵥ 𝔭ᵥ ^ v (Δ_min,ᵥ)`: the product over the
    height-one primes of `O` of the local minimal discriminants of `W`. The product is finite
    (`hasFiniteMulSupport_pow_localMinimalDiscriminantValuation`): after choosing an integral model,
    only finitely many primes divide its nonzero discriminant ideal, and every local minimal exponent
    is bounded by that ideal's multiplicity. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/DiscriminantIdeal.lean
    complete
    theorem WeierstrassCurve.minimalDiscriminantIdeal_def.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O] {K : Type u_2} [Field K]
      [Algebra O K] [IsFractionRing O K] (W : WeierstrassCurve K)
      [W.IsElliptic] :
      WeierstrassCurve.minimalDiscriminantIdeal O W =
        ∏ᶠ (v : IsDedekindDomain.HeightOneSpectrum O),
          v.asIdeal ^
            WeierstrassCurve.localMinimalDiscriminantValuation
              (Localization.AtPrime v.asIdeal) W
    theorem WeierstrassCurve.minimalDiscriminantIdeal_def.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve K)
      [W.IsElliptic] :
      WeierstrassCurve.minimalDiscriminantIdeal
          O W =
        ∏ᶠ (v :
          IsDedekindDomain.HeightOneSpectrum
            O),
          v.asIdeal ^
            WeierstrassCurve.localMinimalDiscriminantValuation
              (Localization.AtPrime v.asIdeal)
              W
    The defining prime-power factorisation of the minimal discriminant ideal. Outside this module
    the body of `minimalDiscriminantIdeal` is not exposed, so this is the interface for unfolding
    it. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/DiscriminantIdeal.lean
    complete
    theorem WeierstrassCurve.minimalDiscriminantIdeal_smul.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O] {K : Type u_2} [Field K]
      [Algebra O K] [IsFractionRing O K]
      (D : WeierstrassCurve.VariableChange K) (W : WeierstrassCurve K)
      [W.IsElliptic] :
      WeierstrassCurve.minimalDiscriminantIdeal O (D • W) =
        WeierstrassCurve.minimalDiscriminantIdeal O W
    theorem WeierstrassCurve.minimalDiscriminantIdeal_smul.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (D : WeierstrassCurve.VariableChange K)
      (W : WeierstrassCurve K)
      [W.IsElliptic] :
      WeierstrassCurve.minimalDiscriminantIdeal
          O (D • W) =
        WeierstrassCurve.minimalDiscriminantIdeal
          O W
    **The minimal discriminant ideal is invariant under a change of variables**, so it is an
    invariant of the curve and not of the equation presenting it. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/DiscriminantIdeal.lean
    complete
    theorem WeierstrassCurve.minimalDiscriminantIdeal_eq_span_of_isGlobalMinimal.{u_1,
        u_2}
      {O : Type u_1} [CommRing O] [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K] [IsFractionRing O K] {W : WeierstrassCurve K}
      [W.IsElliptic] (h : WeierstrassCurve.IsGlobalMinimal O W) {d : O}
      (hd : (algebraMap O K) d = W.Δ) :
      WeierstrassCurve.minimalDiscriminantIdeal O W = Ideal.span {d}
    theorem WeierstrassCurve.minimalDiscriminantIdeal_eq_span_of_isGlobalMinimal.{u_1,
        u_2}
      {O : Type u_1} [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      {W : WeierstrassCurve K} [W.IsElliptic]
      (h :
        WeierstrassCurve.IsGlobalMinimal O W)
      {d : O}
      (hd : (algebraMap O K) d = W.Δ) :
      WeierstrassCurve.minimalDiscriminantIdeal
          O W =
        Ideal.span {d}
    **A globally minimal equation computes the minimal discriminant ideal as `(Δ W)`.** 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/DefectIdeal.lean
    complete
    theorem WeierstrassCurve.span_Δ_eq_minimalDiscriminantIdeal_mul_weierstrassDefectIdeal_pow_twelve.{u_1,
        u_2}
      {O : Type u_1} [CommRing O] [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K] [IsFractionRing O K] (W : WeierstrassCurve K)
      [W.IsElliptic] [WeierstrassCurve.IsIntegral O W] {d : O}
      (hd : (algebraMap O K) d = W.Δ) :
      Ideal.span {d} =
        WeierstrassCurve.minimalDiscriminantIdeal O W *
          WeierstrassCurve.weierstrassDefectIdeal O W ^ 12
    theorem WeierstrassCurve.span_Δ_eq_minimalDiscriminantIdeal_mul_weierstrassDefectIdeal_pow_twelve.{u_1,
        u_2}
      {O : Type u_1} [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve K) [W.IsElliptic]
      [WeierstrassCurve.IsIntegral O W]
      {d : O}
      (hd : (algebraMap O K) d = W.Δ) :
      Ideal.span {d} =
        WeierstrassCurve.minimalDiscriminantIdeal
            O W *
          WeierstrassCurve.weierstrassDefectIdeal
              O W ^
            12
    **The discriminant ideal of an integral equation is its minimal discriminant ideal times the
    twelfth power of its defect ideal:** `(Δ W) = 𝔇_{E/K} · 𝔍_W ^ 12`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/MinimalDiscriminantModel.lean
    complete
    theorem WeierstrassCurve.exists_spanSingleton_Δ_eq.{u_1, u_2} {O : Type u_1}
      [CommRing O] [IsDedekindDomain O] {K : Type u_2} [Field K]
      [Algebra O K] [IsFractionRing O K] (W : WeierstrassCurve K)
      [W.IsElliptic] :
      ∃ 𝔞,
        (FractionalIdeal.spanSingleton (nonZeroDivisors O)) W.Δ =
          ↑(WeierstrassCurve.minimalDiscriminantIdeal O W) * 𝔞 ^ 12
    theorem WeierstrassCurve.exists_spanSingleton_Δ_eq.{u_1,
        u_2}
      {O : Type u_1} [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve K)
      [W.IsElliptic] :
      ∃ 𝔞,
        (FractionalIdeal.spanSingleton
              (nonZeroDivisors O))
            W.Δ =
          ↑(WeierstrassCurve.minimalDiscriminantIdeal
                O W) *
            𝔞 ^ 12
    **The minimal discriminant ideal differs from the discriminant ideal of any Weierstrass model by
    the twelfth power of a fractional ideal** (LMFDB `ec.minimal_discriminant`): for every elliptic
    Weierstrass equation `W` over `K`, `(Δ W) = 𝔇_{E/K} · 𝔞 ^ 12` for a fractional ideal `𝔞` of `O`,
    an ideal of `O` when `W` is integral (Tau Ceti's defect ideal). 
Definition4.1.54
Statement uses 4
Statement dependency previews
Preview
Definition 1.2.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 12
Reverse dependency previews
Preview
Definition 4.1.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Mordell-Weil group. (LMFDB)

For an elliptic curve E defined over a field K, the Mordell-Weil group of E/K is the group E(K) of K-rational points of E. It is a finitely-generated Abelian group.

This is a special case of the Mordell-Weil group of an abelian variety.

The Mordell-Weil Theorem, first proved by Mordell for elliptic curves defined over \Q and later generalized by Weil to abelian varieties A over general number fields K, states that, if K is a number field, then A(K) is a finitely generated abelian group. Its rank is called the Mordell-Weil rank of A over K.

The Mordell-Weil theorem implies in particular that the torsion subgroup E(K)_{\mathrm{tor}} of E(K) is finite, and thus that the torsion order of E, one of the BSD invariants, is finite.

Tau Ceti Review: WeierstrassCurve.Affine.Point.

Depends on: Definition 1.2.2 Definition 1.2.41 Definition 4.1.4 Definition 5.1.1

Lean code for Definition4.1.54●1 definition
  • inductive(2 constructors, 3 parameters)defined in Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean
    complete
    inductive WeierstrassCurve.Affine.Point.{r} {R : Type r} [CommRing R]
      (W' : WeierstrassCurve.Affine R) : Type r
    inductive WeierstrassCurve.Affine.Point.{r}
      {R : Type r} [CommRing R]
      (W' : WeierstrassCurve.Affine R) :
      Type r
    A nonsingular point on a Weierstrass curve `W` in affine coordinates. This is either the unique
    point at infinity `WeierstrassCurve.Affine.Point.zero` or a nonsingular affine point
    `WeierstrassCurve.Affine.Point.some (x, y)` satisfying the Weierstrass equation of `W`. 
    WeierstrassCurve.Affine.Point.zero.{r} {R : Type r}
      [CommRing R] {W' : WeierstrassCurve.Affine R} : W'.Point
    WeierstrassCurve.Affine.Point.some.{r} {R : Type r}
      [CommRing R] {W' : WeierstrassCurve.Affine R} (x y : R)
      (h : W'.Nonsingular x y) : W'.Point
Definition4.1.55
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 4.1.70
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Mordell-Weil theorem. (LMFDB)

For an elliptic curve E defined over a number field F, the Mordell-Weil theorem states that the set E(F) of F-rational points on E is a finitely generated Abelian group.

This group is called the Mordell-Weil group of E/K.

Tau Ceti Review: WeierstrassCurve.Affine.fg_point_of_numberField.

Depends on: Definition 4.1.4 Definition 4.1.54 Definition 5.1.1

Lean code for Definition4.1.55●1 theorem
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MordellWeil/FinitelyGenerated.lean
    complete
    theorem WeierstrassCurve.Affine.fg_point_of_numberField.{u_2} {F : Type u_2}
      [Field F] [NumberField F] [DecidableEq F]
      {W : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)] :
      AddGroup.FG W.Point
    theorem WeierstrassCurve.Affine.fg_point_of_numberField.{u_2}
      {F : Type u_2} [Field F] [NumberField F]
      [DecidableEq F]
      {W : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)] :
      AddGroup.FG W.Point
    **The Mordell–Weil theorem**: the group `E(K)` of `K`-rational points of an elliptic curve `E`
    over a number field `K` is finitely generated.
    
    The square on the left-hand side is completed by an admissible change of variables, possible since
    `K` has characteristic zero, and the finiteness hypotheses of `fg_point` for the resulting model
    are the class number theorem and Dirichlet's unit theorem. 
Definition4.1.56
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.30
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 4.1.42
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

mu-invariant of an elliptic curve. (LMFDB)

The analytic \mu-invariant of an elliptic curve E at a prime of ordinary or multiplicative reduction is the largest integer n such that p^n divides the p-adic L-function of E. By the main conjecture for elliptic curves, this invariant should match the algebraic \mu-invariant which is defined analogously in terms of the Selmer group of E.

When E has supersingular reduction at p, there is a pair of p-adic L-functions: L_p^+(E,T) and L_p^-(E,T) and one defines analogously a pair of \mu-invariants: \mu^+_p(E) and \mu^-_p(E).

Depends on: Definition 4.1.30 Definition 4.1.32 Definition 4.1.57

Definition4.1.57
Statement uses 4
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 4.1.12
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Multiplicative reduction. (LMFDB)

An elliptic curve E defined over a number field K is said to have multiplicative reduction at a prime \mathfrak p of K if the reduction of E modulo \mathfrak p has a nodal singularity.

The case of multiplicative reduction is further subdivided into split multiplicative reduction and nonsplit multiplicative reduction.

Tau Ceti Review: WeierstrassCurve.HasMultiplicativeReduction.

Depends on: Definition 4.1.4 Definition 4.1.59 Definition 4.1.116 Definition 5.1.1

Lean code for Definition4.1.57●6 declarations
  • class(extends 1, 3 methods)defined in Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    class WeierstrassCurve.HasMultiplicativeReduction.{u_1, u_2} (R : Type u_1)
      [CommRing R] [IsDomain R] [IsDiscreteValuationRing R] {K : Type u_2}
      [Field K] [Algebra R K] [IsFractionRing R K]
      (W : WeierstrassCurve K) : Prop
    class WeierstrassCurve.HasMultiplicativeReduction.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K) : Prop
    A minimal Weierstrass equation has multiplicative reduction if and only if
    the valuation of its discriminant is less than 1 and the valuation of `a₄` equals 1. 
    • WeierstrassCurve.IsMinimal R W
    val_Δ_maximal : MaximalFor (fun C => WeierstrassCurve.IsIntegral R (C • W)) (fun C => WeierstrassCurve.valuation_Δ_aux R (C • W)) 1
    Inherited from
    1. WeierstrassCurve.IsMinimal
    badReduction : (IsDedekindDomain.HeightOneSpectrum.valuation K (IsDiscreteValuationRing.maximalIdeal R)) W.Δ < 1
    multiplicativeReduction : (IsDedekindDomain.HeightOneSpectrum.valuation K (IsDiscreteValuationRing.maximalIdeal R)) W.c₄ = 1
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.HasNode.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    def WeierstrassCurve.HasNode.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    A Weierstrass curve `W` over a field `F` has a **nodal singularity** (LMFDB
    `ec.multiplicative_reduction`, `ec.reduction_type`): over an algebraic closure of `F` it has a
    singular point with two distinct tangent slopes, that is, two distinct tangent lines. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.Affine.IsTangentSlope.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F) (x₀ y₀ m : F) : Prop
    def WeierstrassCurve.Affine.IsTangentSlope.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      (x₀ y₀ m : F) : Prop
    A **tangent slope** of a Weierstrass curve `W` at a singular point `(x₀, y₀)` (LMFDB
    `ec.split_multiplicative_reduction`): the line `y - y₀ = m (x - x₀)` meets the curve at `(x₀, y₀)`
    with multiplicity at least `3`, that is, `t³` divides the Weierstrass polynomial restricted to the
    line `t ↦ (x₀ + t, y₀ + m t)`. A singular point is a double point: every line through it meets the
    curve there with multiplicity at least `2`, and the tangent lines are those meeting it with higher
    multiplicity. The predicate is only used at singular points: at a nonsingular point the tangent
    line meets the curve with multiplicity at least `2`, and at least `3` only at a flex. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasMultiplicativeReduction_iff_hasNode.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      {W : WeierstrassCurve K} [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasMultiplicativeReduction R W ↔
        (WeierstrassCurve.reduction R W).HasNode
    theorem WeierstrassCurve.hasMultiplicativeReduction_iff_hasNode.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      {W : WeierstrassCurve K}
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasMultiplicativeReduction
          R W ↔
        (WeierstrassCurve.reduction R
            W).HasNode
    **Multiplicative reduction is nodal reduction** (Silverman VII.5.1): a minimal equation has
    multiplicative reduction, Mathlib's `v(Δ) < 1` and `v(c₄) = 1`, exactly when its reduction has a
    node. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasNode_iff.{u_1} {F : Type u_1} [Field F]
      {W : WeierstrassCurve F} : W.HasNode ↔ W.Δ = 0 ∧ W.c₄ ≠ 0
    theorem WeierstrassCurve.hasNode_iff.{u_1}
      {F : Type u_1} [Field F]
      {W : WeierstrassCurve F} :
      W.HasNode ↔ W.Δ = 0 ∧ W.c₄ ≠ 0
    **A Weierstrass curve has a node exactly when `Δ = 0` and `c₄ ≠ 0`** (Silverman III.1.4). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasMultiplicativeReduction_iff_or.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      {W : WeierstrassCurve K} [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasMultiplicativeReduction R W ↔
        WeierstrassCurve.HasSplitMultiplicativeReduction R W ∨
          WeierstrassCurve.IsNonsplitMultiplicativeReduction R W
    theorem WeierstrassCurve.hasMultiplicativeReduction_iff_or.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      {W : WeierstrassCurve K}
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasMultiplicativeReduction
          R W ↔
        WeierstrassCurve.HasSplitMultiplicativeReduction
            R W ∨
          WeierstrassCurve.IsNonsplitMultiplicativeReduction
            R W
    **Multiplicative reduction is split or non-split** (LMFDB `ec.multiplicative_reduction`). 
Definition4.1.58
Statement uses 6
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Mordell-Weil generators. (LMFDB)

The Mordell-Weil group E(K) of an elliptic curve E over a number field K is a finitely generated abelian group, explicitly described by giving a \Z-basis for the group, equivalently, a (minimal) set of Mordell-Weil generators, each of which is a rational point on the curve.

The generators consist of r non-torsion generators, where r is the rank of E(K), and up to two torsion generators, which generate the torsion subgroup E(K)_{\textrm{tor}}.

Tau Ceti Review: WeierstrassCurve.Affine.fg_point_of_numberField.

Depends on: Definition 4.1.4 Definition 4.1.54 Definition 4.1.105 Definition 4.1.119 Definition 8.3.5 Definition 5.1.1

Lean code for Definition4.1.58●8 declarations
  • structure(4 fields)defined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/MordellWeilGenerators.lean
    complete
    structure WeierstrassCurve.Affine.IsMordellWeilGenerators.{u_1} {F : Type u_1}
      [Field F] [DecidableEq F] {W : WeierstrassCurve.Affine F} {r s : ℕ}
      (P : Fin r → W.Point) (T : Fin s → W.Point) : Prop
    structure WeierstrassCurve.Affine.IsMordellWeilGenerators.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F]
      {W : WeierstrassCurve.Affine F}
      {r s : ℕ} (P : Fin r → W.Point)
      (T : Fin s → W.Point) : Prop
    The families `P` and `T` of points of `W` are **Mordell–Weil generators** of `E(F)` (LMFDB
    `ec.mw_generators`), with **non-torsion generators** `P` and **torsion generators** `T`: the
    classes of the `P i` form a `ℤ`-basis of `E(F)/E(F)_tors`, the `T j` form a `ℤ`-basis of the
    torsion subgroup `E(F)_tors` (`WeierstrassCurve.Affine.IsTorsionBasis`), and no `ℤ`-basis of
    `E(F)_tors` has fewer than `s` points. Together the `P i` and the `T j` thus form a minimal
    `ℤ`-basis of `E(F)`. 
    linearIndependent : LinearIndependent ℤ (⇑(Submodule.torsion ℤ W.Point).mkQ ∘ P)
    span_eq_top : Submodule.span ℤ (Set.range (⇑(Submodule.torsion ℤ W.Point).mkQ ∘ P)) = ⊤
    isTorsionBasis : WeierstrassCurve.Affine.IsTorsionBasis T
    le_of_isTorsionBasis : ∀ (t : ℕ) (T' : Fin t → W.Point), WeierstrassCurve.Affine.IsTorsionBasis T' → s ≤ t
  • structure(2 fields)defined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/MordellWeilGenerators.lean
    complete
    structure WeierstrassCurve.Affine.IsTorsionBasis.{u_1} {F : Type u_1} [Field F]
      [DecidableEq F] {W : WeierstrassCurve.Affine F} {s : ℕ}
      (T : Fin s → W.Point) : Prop
    structure WeierstrassCurve.Affine.IsTorsionBasis.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F]
      {W : WeierstrassCurve.Affine F} {s : ℕ}
      (T : Fin s → W.Point) : Prop
    The family `T` of points of `W` is a **`ℤ`-basis of the torsion subgroup** `E(F)_tors`: the
    `T j` generate `E(F)_tors`, and an integral combination of them vanishes only when each of its terms
    does, so that `E(F)_tors` is the direct sum of the cyclic subgroups generated by the `T j`. 
    closure_eq_torsion : AddSubgroup.closure (Set.range T) = AddCommGroup.torsion W.Point
    zsmul_eq_zero_of_sum_eq_zero : ∀ (b : Fin s → ℤ), ∑ j, b j • T j = 0 → ∀ (j : Fin s), b j • T j = 0
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MordellWeil/FinitelyGenerated.lean
    complete
    theorem WeierstrassCurve.Affine.fg_point_of_numberField.{u_2} {F : Type u_2}
      [Field F] [NumberField F] [DecidableEq F]
      {W : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)] :
      AddGroup.FG W.Point
    theorem WeierstrassCurve.Affine.fg_point_of_numberField.{u_2}
      {F : Type u_2} [Field F] [NumberField F]
      [DecidableEq F]
      {W : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)] :
      AddGroup.FG W.Point
    **The Mordell–Weil theorem**: the group `E(K)` of `K`-rational points of an elliptic curve `E`
    over a number field `K` is finitely generated.
    
    The square on the left-hand side is completed by an admissible change of variables, possible since
    `K` has characteristic zero, and the finiteness hypotheses of `fg_point` for the resulting model
    are the class number theorem and Dirichlet's unit theorem. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/MordellWeilGenerators.lean
    complete
    theorem WeierstrassCurve.Affine.exists_isMordellWeilGenerators.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F]
      {W : WeierstrassCurve.Affine F} [Module.Finite ℤ W.Point] :
      ∃ r s P T, WeierstrassCurve.Affine.IsMordellWeilGenerators P T
    theorem WeierstrassCurve.Affine.exists_isMordellWeilGenerators.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F]
      {W : WeierstrassCurve.Affine F}
      [Module.Finite ℤ W.Point] :
      ∃ r s P T,
        WeierstrassCurve.Affine.IsMordellWeilGenerators
          P T
    **Existence of Mordell–Weil generators**: if `E(F)` is finitely generated, for instance over a
    number field by the Mordell–Weil theorem, then it has Mordell–Weil generators. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/MordellWeilGenerators.lean
    complete
    theorem WeierstrassCurve.Affine.IsMordellWeilGenerators.finrank_eq.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F]
      {W : WeierstrassCurve.Affine F} {r s : ℕ} {P : Fin r → W.Point}
      {T : Fin s → W.Point}
      (h : WeierstrassCurve.Affine.IsMordellWeilGenerators P T) :
      Module.finrank ℤ W.PointModTorsion = r
    theorem WeierstrassCurve.Affine.IsMordellWeilGenerators.finrank_eq.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F]
      {W : WeierstrassCurve.Affine F}
      {r s : ℕ} {P : Fin r → W.Point}
      {T : Fin s → W.Point}
      (h :
        WeierstrassCurve.Affine.IsMordellWeilGenerators
          P T) :
      Module.finrank ℤ W.PointModTorsion = r
    **The number of non-torsion generators is the rank** of `E(F)/E(F)_tors`, that of `E(F)`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/MordellWeilGenerators.lean
    complete
    theorem WeierstrassCurve.Affine.IsMordellWeilGenerators.closure_eq_top.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F]
      {W : WeierstrassCurve.Affine F} {r s : ℕ} {P : Fin r → W.Point}
      {T : Fin s → W.Point}
      (h : WeierstrassCurve.Affine.IsMordellWeilGenerators P T) :
      AddSubgroup.closure (Set.range P ∪ Set.range T) = ⊤
    theorem WeierstrassCurve.Affine.IsMordellWeilGenerators.closure_eq_top.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F]
      {W : WeierstrassCurve.Affine F}
      {r s : ℕ} {P : Fin r → W.Point}
      {T : Fin s → W.Point}
      (h :
        WeierstrassCurve.Affine.IsMordellWeilGenerators
          P T) :
      AddSubgroup.closure
          (Set.range P ∪ Set.range T) =
        ⊤
    **Mordell–Weil generators generate** `E(F)`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/TorsionGenerators.lean
    complete
    theorem WeierstrassCurve.Affine.exists_isTorsionBasis_le_two.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F] [CharZero F]
      {W : WeierstrassCurve.Affine F} [WeierstrassCurve.IsElliptic W]
      [Module.Finite ℤ W.Point] :
      ∃ s ≤ 2, ∃ T, WeierstrassCurve.Affine.IsTorsionBasis T
    theorem WeierstrassCurve.Affine.exists_isTorsionBasis_le_two.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F]
      [CharZero F]
      {W : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic W]
      [Module.Finite ℤ W.Point] :
      ∃ s ≤ 2,
        ∃ T,
          WeierstrassCurve.Affine.IsTorsionBasis
            T
    **The torsion subgroup has a `ℤ`-basis of at most two points**: over a field of characteristic
    zero, when `E(F)` is finitely generated, for instance over a number field, `E(F)_tors` embeds in
    `E(F̄)[N] ≃ (ℤ/N)²` for its order `N`, so it has a `ℤ`-basis of at most two points. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/TorsionGenerators.lean
    complete
    theorem WeierstrassCurve.Affine.IsMordellWeilGenerators.le_two.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F] [CharZero F]
      {W : WeierstrassCurve.Affine F} [WeierstrassCurve.IsElliptic W]
      [Module.Finite ℤ W.Point] {r s : ℕ} {P : Fin r → W.Point}
      {T : Fin s → W.Point}
      (h : WeierstrassCurve.Affine.IsMordellWeilGenerators P T) : s ≤ 2
    theorem WeierstrassCurve.Affine.IsMordellWeilGenerators.le_two.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F]
      [CharZero F]
      {W : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic W]
      [Module.Finite ℤ W.Point] {r s : ℕ}
      {P : Fin r → W.Point}
      {T : Fin s → W.Point}
      (h :
        WeierstrassCurve.Affine.IsMordellWeilGenerators
          P T) :
      s ≤ 2
    **There are at most two torsion generators** among Mordell–Weil generators of an elliptic curve
    over a field of characteristic zero, for instance a number field (LMFDB `ec.mw_generators`). 
Definition4.1.59
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.1.7
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Non-split multiplicative reduction. (LMFDB)

An elliptic curve E defined over a number field K is said to have non-split multiplicative reduction at a prime \mathfrak{p} of K if the reduction of E modulo \mathfrak{p} has a nodal singularity with tangent slopes not defined over the residue field at \mathfrak{p}.

Depends on: Definition 4.1.4 Definition 5.1.1

Lean code for Definition4.1.59●6 declarations
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    def WeierstrassCurve.IsNonsplitMultiplicativeReduction.{u, v} (R : Type v)
      [CommRing R] [IsDomain R] [IsDiscreteValuationRing R] {K : Type u}
      [Field K] [Algebra R K] [IsFractionRing R K] (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] : Prop
    def WeierstrassCurve.IsNonsplitMultiplicativeReduction.{u,
        v}
      (R : Type v) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R] {K : Type u}
      [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] : Prop
    A minimal Weierstrass curve over `K` has **non-split multiplicative reduction** (LMFDB
    `ec.nonsplit_multiplicative_reduction`) if it has multiplicative reduction that is not split. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.HasNonsplitNode.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    def WeierstrassCurve.HasNonsplitNode.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    A Weierstrass curve `W` over a field `F` has a **nodal singularity with tangent slopes not
    defined over `F`** (LMFDB `ec.nonsplit_multiplicative_reduction`): a singular point over `F` with
    two distinct tangent slopes over an algebraic closure of `F`, none of which lies in `F`. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.Affine.IsTangentSlope.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F) (x₀ y₀ m : F) : Prop
    def WeierstrassCurve.Affine.IsTangentSlope.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      (x₀ y₀ m : F) : Prop
    A **tangent slope** of a Weierstrass curve `W` at a singular point `(x₀, y₀)` (LMFDB
    `ec.split_multiplicative_reduction`): the line `y - y₀ = m (x - x₀)` meets the curve at `(x₀, y₀)`
    with multiplicity at least `3`, that is, `t³` divides the Weierstrass polynomial restricted to the
    line `t ↦ (x₀ + t, y₀ + m t)`. A singular point is a double point: every line through it meets the
    curve there with multiplicity at least `2`, and the tangent lines are those meeting it with higher
    multiplicity. The predicate is only used at singular points: at a nonsingular point the tangent
    line meets the curve with multiplicity at least `2`, and at least `3` only at a flex. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.isNonsplitMultiplicativeReduction_iff_hasNonsplitNode.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      {W : WeierstrassCurve K} [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.IsNonsplitMultiplicativeReduction R W ↔
        (WeierstrassCurve.reduction R W).HasNonsplitNode
    theorem WeierstrassCurve.isNonsplitMultiplicativeReduction_iff_hasNonsplitNode.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      {W : WeierstrassCurve K}
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.IsNonsplitMultiplicativeReduction
          R W ↔
        (WeierstrassCurve.reduction R
            W).HasNonsplitNode
    **Non-split multiplicative reduction is reduction with a node whose tangent slopes are not
    defined over the residue field.** 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.HasNonsplitNode.hasNode.{u_1} {F : Type u_1} [Field F]
      {W : WeierstrassCurve F} (h : W.HasNonsplitNode) : W.HasNode
    theorem WeierstrassCurve.HasNonsplitNode.hasNode.{u_1}
      {F : Type u_1} [Field F]
      {W : WeierstrassCurve F}
      (h : W.HasNonsplitNode) : W.HasNode
    **A node with tangent slopes not defined over the base field is a node.** 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasNonsplitNode_iff.{u_1} {F : Type u_1} [Field F]
      {W : WeierstrassCurve F} :
      W.HasNonsplitNode ↔ W.Δ = 0 ∧ W.c₄ ≠ 0 ∧ ¬W.nodePolynomial.Splits
    theorem WeierstrassCurve.hasNonsplitNode_iff.{u_1}
      {F : Type u_1} [Field F]
      {W : WeierstrassCurve F} :
      W.HasNonsplitNode ↔
        W.Δ = 0 ∧
          W.c₄ ≠ 0 ∧ ¬W.nodePolynomial.Splits
    **A Weierstrass curve has a node with tangent slopes not defined over the base field exactly
    when `Δ = 0`, `c₄ ≠ 0` and its node polynomial does not split.** 
Definition4.1.60
Statement uses 4
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Obstruction class of an elliptic curve. (LMFDB)

Let E be an elliptic curve defined over a number field K. The obstruction class of E is an ideal class of K which is trivial if and only if E has a global minimal model.

Tau Ceti Review: WeierstrassCurve.globalMinimalityClass, WeierstrassCurve.weierstrassDefectClass.

Depends on: Definition 4.1.4 Definition 4.1.29 Definition 5.1.1 Definition 5.1.36

Lean code for Definition4.1.60●2 definitions
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Class.lean
    complete
    def WeierstrassCurve.globalMinimalityClass.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O] {K : Type u_2} [Field K]
      [Algebra O K] [IsFractionRing O K] (E : WeierstrassCurve K)
      [E.IsElliptic] : ClassGroup O
    def WeierstrassCurve.globalMinimalityClass.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (E : WeierstrassCurve K)
      [E.IsElliptic] : ClassGroup O
    **The curve-level global-minimality obstruction.** It is the defect class of any integral
    equation obtained from `E`; the change-of-variables formula makes the choice immaterial. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Class.lean
    complete
    def WeierstrassCurve.weierstrassDefectClass.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O] {K : Type u_2} [Field K]
      [Algebra O K] [IsFractionRing O K] (W : WeierstrassCurve O)
      [(W.baseChange K).IsElliptic] : ClassGroup O
    def WeierstrassCurve.weierstrassDefectClass.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve O)
      [(W.baseChange K).IsElliptic] :
      ClassGroup O
    **The positive Weierstrass defect class** `[𝔍_W]` of an integral equation `W` over `O`.
    
    This convention records the excess of the equation's discriminant over the minimal discriminant.
    It is inverse to `weierstrassClass`, the orientation used in Silverman VIII.8. 
Definition4.1.61
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.22
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Tate module of an elliptic curve. (LMFDB)

Let p \in \mathbb{Z}_{\geq 0} be a prime and E an elliptic curve defined over a field K. The p-adic Tate module of E is the inverse limit

T_p(E) = \lim_{\xleftarrow[n \in \mathbb{N}]{}} E[p^n].

Here for m\in\mathbb{Z}_{\geq 0}, E[m] denotes the m-torsion subgroup of E, which is the kernel of the multiplication-by-m endomorphism of E.

If K has characteristic not equal to p, then T_p(E) is a free \Z_p-module of rank 2. It carries an action of the absolute Galois group of K, and thus has an associated Galois representation.

This is a special case of the Tate module of an abelian variety.

Tau Ceti Review: TauCeti.TateModule, WeierstrassCurve.tateModuleGaloisRepresentation.

Depends on: Definition 4.9.20 Definition 4.1.22 Definition 8.3.56

Lean code for Definition4.1.61●2 definitions
  • defdefined in TauCeti/Algebra/Module/Torsion/TateModule.lean
    complete
    def TauCeti.TateModule.{u_1} (p : ℕ) (A : Type u_1) [AddCommGroup A] :
      Type u_1
    def TauCeti.TateModule.{u_1} (p : ℕ)
      (A : Type u_1) [AddCommGroup A] :
      Type u_1
    The `p`-adic Tate module of an abelian group: compatible families of `p^n`-torsion points. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/TateModule/Galois.lean
    complete
    def WeierstrassCurve.tateModuleGaloisRepresentation.{u_1, u_2}
      {F : Type u_1} {K : Type u_2} [Field F] [Field K] [DecidableEq K]
      [Algebra F K] (W : WeierstrassCurve F) (ℓ : ℕ) [Fact (Nat.Prime ℓ)] :
      Representation ℤ_[ℓ] Gal(K/F)
        (TauCeti.TateModule ℓ (W.baseChange K).toAffine.Point)
    def WeierstrassCurve.tateModuleGaloisRepresentation.{u_1,
        u_2}
      {F : Type u_1} {K : Type u_2} [Field F]
      [Field K] [DecidableEq K] [Algebra F K]
      (W : WeierstrassCurve F) (ℓ : ℕ)
      [Fact (Nat.Prime ℓ)] :
      Representation ℤ_[ℓ] Gal(K/F)
        (TauCeti.TateModule ℓ
          (W.baseChange K).toAffine.Point)
    **The `ℓ`-adic Galois representation** of `W`: an `F`-automorphism `σ` of `K` acts on the
    Tate module `T_ℓ E` of `W` over `K` by applying `σ` to the coordinates of every point of every
    level `E[ℓ ^ n]`. 
Definition4.1.62
Statement uses 10
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.1.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Global period of an elliptic curve. (LMFDB)

The global period \Omega(E/K) of an elliptic curve defined over a number field K is a product of local factors \Omega_v(E_v/K_v), one for each infinite place v of K. Here, K_v denotes the completion of K at v (so K_v=\R for a real place and K_v=\C for a complex place), and E_v denotes the base change of E to K_v.

Fixing a Weierstrass model for E with coefficients a_i\in K, a model for E_v is given by the Weierstrass equation with coefficients a_{i,v}, the images of a_i under v in K_v. Associated to this model we have a discriminant \Delta(E_v) and an invariant differential \omega_v=dx/(2y+a_{1,v}x+a_{3,v}).

For a real place given by an embedding v:K\to\R, we define

\Omega_v(E_v) = \left|\int_{E_v(\R)} \omega_E\right|.

In terms of a basis of the period lattice of E_v of the form [x,yi] (when \Delta(E_v)>0) or [2x,x+yi] (when \Delta(E_v)<0), where x and y are positive real numbers, we have \Omega_v(E_v)=2x.

For a complex place given by an embedding v:K\to\C, we define

\Omega_v(E_v) = \left|\int_{E_v(\C)} \omega_E\wedge\overline{\omega_E}\right|.

In terms of a basis [w_1,w_2] of the period lattice of E_v, where \Im(w_2/w_1)>0, we have \Omega_v(E_v)=2\Im(\overline{w_1}w_2), which is double the covolume of the period lattice.

When E has a global minimal model, we have

\Omega(E/K) = \prod_{v}\Omega_v(E_v).

In general, given an arbitrary model for E with discriminant \Delta(E), we have

\Omega(E/K) = \left|\frac{N(\Delta(E))}{N(\mathfrak{d}(E))}\right|^{1/12}\prod_{v}\Omega_v(E_v),

where \mathfrak{d} is the minimal discriminant ideal of E and N(\mathfrak{d}) denotes its norm. This quantity is independent of the model of E.

Depends on: Definition 4.1.4 Definition 4.1.8 Definition 4.1.19 Definition 4.1.29 Definition 4.1.53 Definition 4.1.92 Definition 4.1.121 Definition 5.1.1 Definition 5.1.19 Definition 5.1.61

Definition4.1.63
Statement uses 5
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Potential good reduction. (LMFDB)

An elliptic curve E defined over a number field K is said to have potential good reduction if E has everywhere good reduction over a finite extension of K.

This is equivalent to the j-invariant of E being integral.

Depends on: Definition 4.1.4 Definition 4.1.31 Definition 4.1.43 Definition 5.1.1 Definition 5.1.41

Lean code for Definition4.1.63●6 declarations
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/PotentialGoodReduction.lean
    complete
    def WeierstrassCurve.HasPotentialEverywhereGoodReduction.{u} {K : Type u}
      [Field K] (W : WeierstrassCurve K) [NumberField K] : Prop
    def WeierstrassCurve.HasPotentialEverywhereGoodReduction.{u}
      {K : Type u} [Field K]
      (W : WeierstrassCurve K)
      [NumberField K] : Prop
    An elliptic curve `W` over a number field `K` has **potential good reduction** (LMFDB
    `ec.potential_good_reduction`, `ec.reduction`) if it has everywhere good reduction over a finite
    extension `L` of `K`, which is then a number field: at every prime of `L` a minimal equation of
    `W` over the local ring has good reduction. One extension serves every prime of `L`, unlike Tau
    Ceti's local `WeierstrassCurve.HasPotentialGoodReduction`. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/PotentialGoodReduction.lean
    complete
    def WeierstrassCurve.HasEverywhereGoodReduction.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O] {F : Type u_2} [Field F]
      [Algebra O F] [IsFractionRing O F] (W : WeierstrassCurve F) : Prop
    def WeierstrassCurve.HasEverywhereGoodReduction.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F]
      [IsFractionRing O F]
      (W : WeierstrassCurve F) : Prop
    A Weierstrass curve `W` over the fraction field `F` of a Dedekind domain `O` has **everywhere
    good reduction** (LMFDB `ec.good_reduction`) if it has good reduction at every height-one prime
    `v` of `O`: a minimal equation of `W` over the localisation `Oᵥ` has good reduction. For a number
    field `F` and `O = 𝓞 F` these are the primes of `F`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/PotentialGoodReduction.lean
    complete
    theorem WeierstrassCurve.hasPotentialEverywhereGoodReduction_iff_isInteger_j.{u}
      {K : Type u} [Field K] {W : WeierstrassCurve K} [NumberField K]
      [W.IsElliptic] :
      W.HasPotentialEverywhereGoodReduction ↔
        IsLocalization.IsInteger (NumberField.RingOfIntegers K) W.j
    theorem WeierstrassCurve.hasPotentialEverywhereGoodReduction_iff_isInteger_j.{u}
      {K : Type u} [Field K]
      {W : WeierstrassCurve K} [NumberField K]
      [W.IsElliptic] :
      W.HasPotentialEverywhereGoodReduction ↔
        IsLocalization.IsInteger
          (NumberField.RingOfIntegers K) W.j
    **Potential good reduction is the integrality of the `j`-invariant** (LMFDB
    `ec.potential_good_reduction`, `ec.reduction`; Silverman VII.5.5 at every prime at once): an
    elliptic curve over a number field has everywhere good reduction over a finite extension exactly
    when its `j`-invariant is integral, that is, lies in the ring of integers `𝓞 K`, the integral
    closure of `ℤ` in `K`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/PotentialGoodReduction.lean
    complete
    theorem WeierstrassCurve.hasPotentialEverywhereGoodReduction_of_isInteger_j.{u}
      {K : Type u} [Field K] {W : WeierstrassCurve K} [NumberField K]
      [W.IsElliptic]
      (hj : IsLocalization.IsInteger (NumberField.RingOfIntegers K) W.j) :
      W.HasPotentialEverywhereGoodReduction
    theorem WeierstrassCurve.hasPotentialEverywhereGoodReduction_of_isInteger_j.{u}
      {K : Type u} [Field K]
      {W : WeierstrassCurve K} [NumberField K]
      [W.IsElliptic]
      (hj :
        IsLocalization.IsInteger
          (NumberField.RingOfIntegers K)
          W.j) :
      W.HasPotentialEverywhereGoodReduction
    **An integral `j`-invariant gives potential good reduction**: one finite extension `L` of `K`
    serves every prime. Over a finite extension `L₁ / K` the curve takes the Legendre form
    `y² = x (x - 1) (x + B)`, and over a finite extension `L / L₁` the Deuring normal form
    `y² + a x y + y = x³`. At a prime of `L` not above `2` the Legendre form has good reduction, and at
    a prime not above `3` the Deuring form, since `j` stays integral there. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/PotentialGoodReduction.lean
    complete
    theorem WeierstrassCurve.HasPotentialEverywhereGoodReduction.isInteger_j.{u}
      {K : Type u} [Field K] {W : WeierstrassCurve K} [NumberField K]
      [W.IsElliptic] (h : W.HasPotentialEverywhereGoodReduction) :
      IsLocalization.IsInteger (NumberField.RingOfIntegers K) W.j
    theorem WeierstrassCurve.HasPotentialEverywhereGoodReduction.isInteger_j.{u}
      {K : Type u} [Field K]
      {W : WeierstrassCurve K} [NumberField K]
      [W.IsElliptic]
      (h :
        W.HasPotentialEverywhereGoodReduction) :
      IsLocalization.IsInteger
        (NumberField.RingOfIntegers K) W.j
    **Potential good reduction makes the `j`-invariant integral**, that is, an element of the ring
    of integers `𝓞 K`: over the extension `L`, at every prime a minimal equation has unit discriminant,
    so `j = c₄³ / Δ` lies in every local ring of `𝓞 L`, hence in `𝓞 L`, and `j ∈ K` is then integral
    over `ℤ`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/PotentialGoodReduction.lean
    complete
    theorem WeierstrassCurve.hasPotentialEverywhereGoodReduction_x_cube_sub_x :
      (TauCeti.CurveX3SubX.curve ℚ).HasPotentialEverywhereGoodReduction
    theorem WeierstrassCurve.hasPotentialEverywhereGoodReduction_x_cube_sub_x :
      (TauCeti.CurveX3SubX.curve
          ℚ).HasPotentialEverywhereGoodReduction
    **The curve `y² = x³ - x` over `ℚ` has potential good reduction**, its `j`-invariant being
    `1728`, although its discriminant is `64`. 
Definition4.1.64
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.74
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Definition 2.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Elliptic curve over \mathbb Q. (LMFDB)

An elliptic curve E over \mathbb{Q} has a Weierstrass equation of the form

E : y^2 = x^3 + ax + b with a, b \in \mathbb{Z} such that its discriminant

\Delta := -16(4a^3 + 27b^2 ) \not = 0.

Note that such an equation is not unique and E has a unique minimal Weierstrass equation.

Tau Ceti Review: WeierstrassCurve.IsElliptic, WeierstrassCurve.exists_minimalPairModel, WeierstrassCurve.IsReducedMinimal, WeierstrassCurve.existsUnique_reducedMinimal.

Depends on: Definition 4.1.74 Definition 4.1.86

Lean code for Definition4.1.64●4 declarations
  • class(1 method)defined in Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean
    complete
    class WeierstrassCurve.IsElliptic.{u} {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) : Prop
    class WeierstrassCurve.IsElliptic.{u}
      {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) : Prop
    `WeierstrassCurve.IsElliptic` is a typeclass which asserts that a Weierstrass curve is an
    elliptic curve: that its discriminant is a unit. Note that this definition is only mathematically
    accurate for certain rings whose Picard group has trivial 12-torsion, such as a field or a PID. 
    isUnit : IsUnit W.Δ
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalPairModel.lean
    complete
    theorem WeierstrassCurve.exists_minimalPairModel (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : Nonempty E.MinimalPairModel
    theorem WeierstrassCurve.exists_minimalPairModel
      (E : WeierstrassCurve ℚ)
      [E.IsElliptic] :
      Nonempty E.MinimalPairModel
    **Existence of a minimal-pair model**: every elliptic curve over `ℚ` is isomorphic over `ℚ`
    to the base change of a minimal-pair short equation over `ℤ`. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Reduced.lean
    complete
    def WeierstrassCurve.IsReducedMinimal (W : WeierstrassCurve ℚ)
      [W.IsElliptic] : Prop
    def WeierstrassCurve.IsReducedMinimal
      (W : WeierstrassCurve ℚ)
      [W.IsElliptic] : Prop
    **A reduced minimal Weierstrass equation over `ℚ`**: globally minimal over `ℤ`, with the
    residual freedom of the changes of variables over `ℤ` pinned by `a₁, a₃ ∈ {0, 1}` and
    `a₂ ∈ {-1, 0, 1}`. Every elliptic curve over `ℚ` has exactly one such equation in its
    variable-change orbit (`existsUnique_reducedMinimal`). 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Reduced.lean
    complete
    theorem WeierstrassCurve.existsUnique_reducedMinimal (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : ∃! W, (↑W).IsReducedMinimal ∧ ∃ C, C • E = ↑W
    theorem WeierstrassCurve.existsUnique_reducedMinimal
      (E : WeierstrassCurve ℚ)
      [E.IsElliptic] :
      ∃! W,
        (↑W).IsReducedMinimal ∧
          ∃ C, C • E = ↑W
    **Existence and uniqueness of the reduced minimal equation**: the variable-change orbit of an
    elliptic curve over `ℚ` contains exactly one reduced minimal equation. The equation is unique; the
    change of variables reaching it is not, since it may be composed with `[-1]`. 
Definition4.1.65
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

abc quality. (LMFDB)

Given a triple a,b,c of nonzero coprime integers, the quality of the triple is defined as

Q = \frac{\log \max(|a|, |b|, |c|)}{\log \operatorname{rad}(abc)},

where \operatorname{rad}(abc) is the product of the primes dividing abc. The abc conjecture stipulates that for any \epsilon > 0 there are only finitely many relatively prime triples a,b,c with quality larger than 1+\epsilon.

The abc quality of an elliptic curve E is the quality of an a,b,c triple determined by its j-invariant, namely the one defined by writing \frac{j}{1728} = \frac{a}{c} in lowest terms and setting b = c - a. Note that the abc quality is undefined for j=0 and j=1728.

The reason for defining the quality of E in this way comes from the equivalence of the abc conjecture with the modified Szpiro conjecture. For elliptic curves with small conductor, j-invariants often have unusually large quality.

Tau Ceti Review: WeierstrassCurve.abcQuality, WeierstrassCurve.abcQuality_eq_of_j_div_eq, TauCeti.AbcConjecture, TauCeti.abcConjecture_iff_forall_finite.

Depends on: Definition 4.1.4 Definition 4.1.43 Definition 4.1.72

Lean code for Definition4.1.65●6 declarations
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/AbcQuality.lean
    complete
    def WeierstrassCurve.abcQuality (E : WeierstrassCurve ℚ) [E.IsElliptic]
      (_h : E.j ≠ 0 ∧ E.j ≠ 1728) : ℝ
    def WeierstrassCurve.abcQuality
      (E : WeierstrassCurve ℚ) [E.IsElliptic]
      (_h : E.j ≠ 0 ∧ E.j ≠ 1728) : ℝ
    **The abc quality** of an elliptic curve `E` over `ℚ`: with `j / 1728 = a / c` in lowest terms
    and `b = c - a`, the quality `log max(|a|, |b|, |c|) / log rad(a b c)` of the abc triple
    `(a, b, c)`. The hypothesis `j ≠ 0 ∧ j ≠ 1728` is exactly `a b c ≠ 0`; without it the quotient
    would be `0` by division by zero. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/AbcQuality.lean
    complete
    theorem WeierstrassCurve.abcQuality_eq_of_j_div_eq (E : WeierstrassCurve ℚ)
      [E.IsElliptic] (h : E.j ≠ 0 ∧ E.j ≠ 1728) {a b c : ℤ}
      (hac : IsCoprime a c) (habc : a + b = c) (hj : E.j / 1728 = ↑a / ↑c) :
      E.abcQuality h =
        Real.log (max (max ↑a.natAbs ↑b.natAbs) ↑c.natAbs) /
          Real.log ↑(UniqueFactorizationMonoid.radical (a * b * c).natAbs)
    theorem WeierstrassCurve.abcQuality_eq_of_j_div_eq
      (E : WeierstrassCurve ℚ) [E.IsElliptic]
      (h : E.j ≠ 0 ∧ E.j ≠ 1728) {a b c : ℤ}
      (hac : IsCoprime a c) (habc : a + b = c)
      (hj : E.j / 1728 = ↑a / ↑c) :
      E.abcQuality h =
        Real.log
            (max (max ↑a.natAbs ↑b.natAbs)
              ↑c.natAbs) /
          Real.log
            ↑(UniqueFactorizationMonoid.radical
                (a * b * c).natAbs)
    **The abc quality is the quality of any reduced triple for `j / 1728`**: if `a + b = c` with
    `a` and `c` coprime and `j / 1728 = a / c`, then the abc quality of `E` is
    `log max(|a|, |b|, |c|) / log rad(a b c)`. The sign of `c` is arbitrary. 
  • defdefined in TauCeti/NumberTheory/AbcConjecture.lean
    complete
    def TauCeti.AbcConjecture : Prop
    def TauCeti.AbcConjecture : Prop
    **The abc conjecture** (Masser, Oesterlé): for every `ε > 0` there is a constant `C` such that
    `max(|a|, |b|, |c|) ≤ C · rad(a b c) ^ (1 + ε)` for all coprime integers `a` and `b` with
    `a + b = c`. It is the abc conjecture with exponent `1`. 
  • theoremdefined in TauCeti/NumberTheory/AbcConjecture.lean
    complete
    theorem TauCeti.abcConjecture_iff_forall_finite :
      TauCeti.AbcConjecture ↔
        ∀ (ε : ℝ),
          0 < ε →
            {(a, b, c) |
                0 < a ∧
                  0 < b ∧
                    0 < c ∧
                      {a, b, c}.Pairwise Nat.Coprime ∧
                        a + b = c ∧
                          ↑(UniqueFactorizationMonoid.radical (a * b * c)) ^
                              (1 + ε) <
                            ↑c}.Finite
    theorem TauCeti.abcConjecture_iff_forall_finite :
      TauCeti.AbcConjecture ↔
        ∀ (ε : ℝ),
          0 < ε →
            {(a, b, c) |
                0 < a ∧
                  0 < b ∧
                    0 < c ∧
                      {a, b, c}.Pairwise
                          Nat.Coprime ∧
                        a + b = c ∧
                          ↑(UniqueFactorizationMonoid.radical
                                  (a * b *
                                    c)) ^
                              (1 + ε) <
                            ↑c}.Finite
    **The abc conjecture as finitely many exceptions**, the form of `ABC.abc` in the
    `formal-conjectures` project: it is equivalent to ask that, for every `ε > 0`, only finitely many
    triples of pairwise coprime positive integers `a + b = c` have `rad(a b c) ^ (1 + ε) < c`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/SzpiroRatioConjecture.lean
    complete
    theorem TauCeti.abcConjecture_iff_algorithmicModifiedSzpiroRatioConjecture :
      TauCeti.AbcConjecture ↔
        TauCeti.AlgorithmicModifiedSzpiroRatioConjecture
    theorem TauCeti.abcConjecture_iff_algorithmicModifiedSzpiroRatioConjecture :
      TauCeti.AbcConjecture ↔
        TauCeti.AlgorithmicModifiedSzpiroRatioConjecture
    **The abc conjecture is equivalent to the modified Szpiro conjecture in finiteness form**
    (Oesterlé; LMFDB `ec.q.szpiro_ratio` and `ec.q.abc_quality`): for every `ε > 0`, only finitely many
    elliptic curves over `ℚ`, up to isomorphism, have modified Szpiro ratio greater than `6 + ε`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/ModifiedSzpiroAbc.lean
    complete
    theorem TauCeti.abcConjecture_iff_algorithmicModifiedSzpiroConjecture :
      TauCeti.AbcConjecture ↔ TauCeti.AlgorithmicModifiedSzpiroConjecture
    theorem TauCeti.abcConjecture_iff_algorithmicModifiedSzpiroConjecture :
      TauCeti.AbcConjecture ↔
        TauCeti.AlgorithmicModifiedSzpiroConjecture
    **The abc conjecture and the modified Szpiro conjecture are equivalent** (Oesterlé; LMFDB
    `ec.q.abc_quality`), the modified Szpiro conjecture being stated against the conductor of Tate's
    algorithm. 
Definition4.1.66
Statement uses 7
Statement dependency previews
Preview
Definition 1.2.41
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Analytic rank of an elliptic curve over \Q. (LMFDB)

The analytic rank of an elliptic curve E is the analytic rank of its L-function L(E,s). The weak form of the BSD conjecture implies that the analytic rank is equal to the rank of the Mordell-Weil group of E.

For elliptic curves E over \Q, it is known that L(E,s) satisfies the Hasse-Weil conjecture, and hence that the parity of the analytic rank is always compatible with the sign of the functional equation.

In general, analytic ranks stored in the LMFDB are only upper bounds on the true analytic rank (they could be incorrect if L(E,s) had a zero very close to but not on the central point). For elliptic curves over \Q of analytic rank less than 2 this upper bound is necessarily tight, due to parity; for analytic ranks 2 and 3 is also tight due to results of Kolyvagin; Murty and Murty; Bump, Friedberg and Hoffstein; Coates and Wiles; Gross and Zagier which together say that when the analytic rank is 0 or 1 then it equals the Mordell-Weil rank.

Depends on: Definition 1.2.41 Definition 4.1.4 Definition 4.1.54 Definition 2.7 Definition 2.13 Definition 2.25 Definition 2.60

Definition4.1.67
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Analytic order of \Sha. (LMFDB)

The Tate-Shafarevic group \Sha of an elliptic curve E defined over \mathbb{Q} is a torsion group defined in terms of Galois cohomology, which is conjectured to be finite. Its order \#\Sha appears in the strong form of the Birch-Swinnerton-Dyer Conjecture for E. The value of the order which is predicted by the conjecture is called the Analytic Order of Sha, \Sha_{an}. <!--Note that the value of \Sha<sub>an</sub> predicted by the conjecture is always a square.-->

For elliptic curves of rank 0 or 1 it is a theorem that \Sha<sub>an</sub> is a positive rational number, and this rational number can be computed exactly; this exact computation has only been carried out for the curves in the database with rank 0 and conductor N\le 500000. These values are always in fact integer squares in all cases computed to date. For curves of rank 2 and above, there is no such theorem, and the values computed are simply floating point approximate values which happen to be very close to integers. In the LMFDB we store and display the rounded values in this case.

Depends on: Definition 4.1.4 Definition 8.3.97

Definition4.1.68
Statement uses 4
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Analytic order of Sha (numerical value). (LMFDB)

For an elliptic curve defined over \Q of analytic rank 0 or 1, the analytic order of \Sha is known to be rational and can been computed exactly. For curves of rank at least 2 it is not known to be rational, but in all the cases where it has been computed it is close to a square integer, as predicted by the Birch and Swinnerton-Dyer conjecture; in these cases we display the rounded value.

Depends on: Definition 4.1.4 Definition 4.1.6 Definition 4.1.66 Definition 4.1.70

Definition4.1.69
Statement uses 7
Statement dependency previews
Preview
Definition 4.1.6
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

For an elliptic E curve over \mathbb{Q} the Birch/Swinnerton-Dyer invariants are

The Birch and Swinnerton-Dyer Conjecture asserts that the above invariants combine to give the order of vanishing and the first non-zero Taylor series coefficient of L(E,s) at the central point s=1.

Depends on: Definition 4.1.6 Definition 4.1.70 Definition 4.1.93 Definition 4.1.100 Definition 4.1.105 Definition 4.1.108 Definition 4.1.118

Definition4.1.70
Statement uses 11
Statement dependency previews
Preview
Definition 1.2.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 2.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Birch and Swinnerton-Dyer conjecture. (LMFDB)

The Birch and Swinnerton-Dyer conjecture is one of the Millennium Prize Problems listed by the Clay Mathematics Institute. It relates the order of vanishing and the first non-zero Taylor series coefficient of the L-function associated to an elliptic curve E defined over \Q at the central point s=1 to certain arithmetic data, the BSD invariants of E.

Specifically, the BSD conjecture states that the order r of vanishing of L(E,s) at s=1 is equal to the rank of the Mordell-Weil group E(\Q), and that

<!-- comment: if you make the following display into a normal one using .. or .. then something about the html code for Sha stops it displaying properly-->

<p align="center"> \displaystyle \frac{1}{r!} L^{(r)}(E,1)= \displaystyle \frac{\# \Sha(E/\Q)\cdot \Omega_E \cdot \mathrm{Reg}(E/\Q) \cdot \prod_p c_p}{\#E(\Q)_{\rm tor}^2}. </p> The quantities appearing in this formula are the BSD invariants of E:

  • r is the rank of E(\Q) (a non-negative integer);

  • \#\Sha(E/\Q) is the order of the Tate-Shafarevich group

    of E (which is conjectured to always be finite, a positive integer);

  • \mathrm{Reg}(E/\Q) is the regulator of E/\Q;

  • \Omega_E is the real period of E/\Q (a positive real number);

  • c_p is the Tamagawa number of E at each prime p (a positive integer which is 1 for all but at most finitely many primes);

  • E(\Q)_{\rm tor} is the torsion order of E(\Q) (a positive integer).

There is a similar conjecture for abelian varieties, in which the real period is replaced by the covolume of the period lattice.

Depends on: Definition 1.2.2 Definition 4.1.4 Definition 4.1.6 Definition 4.1.55 Definition 4.1.93 Definition 4.1.105 Definition 4.1.108 Definition 4.1.117 Definition 4.1.118 Definition 2.7 Definition 2.13

Definition4.1.71
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Canonical height. (LMFDB)

Let E be an elliptic curve defined over \mathbb{Q}. The canonical height of a rational point P\in E(\mathbb{Q}) is computed by writing the x-coordinate x(nP)=A_n(P)/D_n(P) as a fraction in lowest terms and setting

\hat{h}(P) = \lim_{n\to\infty} \frac{1}{n^2}\log \max\bigl\{|A_n(P)|,|D_n(P)|\bigr\}.

(<EM>Note</EM>. Some sources define \hat{h} to be \frac12 of this quantity.)

Properties of \hat{h}: <UL> <LI> \hat{h}(P)=\log \max\bigl\{|A_1(P)|,|D_1(P)|\bigr\}+O(1) as P ranges over E(\mathbb{Q}). <LI> \hat{h}(P)\ge0; and \hat{h}(P)=0 if and only if P is a torsion point. <LI> \hat{h}:E(\mathbb{Q})\to\mathbb{R} extends to a positive definite quadratic form on E(\mathbb{Q})\otimes\mathbb{R}. </UL> The height pairing on E is the associated bilinear form \langle P,Q\rangle=\frac{1}{2}\bigl(\hat{h}(P+Q)-\hat{h}(P)-\hat{h}(Q)\bigr), which is used to compute the elliptic regulator of E. It is a symmetric positive definite bilinear form on E(\Q)\otimes\R.

For a number field K, the canonical height of P\in E(K) is given by \hat{h}(P)=\lim_{n\to\infty} n^{-2}h\bigl(x(nP)\bigr), where h is the Weil height.

Tau Ceti Review: WeierstrassCurve.Affine.Point.canonicalHeight, WeierstrassCurve.Affine.canonicalHeightQuadratic, WeierstrassCurve.Affine.neronTatePairing.

Depends on: Definition 4.1.4 Definition 4.1.108 Definition 5.1.92

Lean code for Definition4.1.71●3 definitions
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/CanonicalHeight/Basic.lean
    complete
    def WeierstrassCurve.Affine.Point.canonicalHeight.{u_1} {F : Type u_1}
      [Field F] {W : WeierstrassCurve.Affine F}
      [Height.AdmissibleAbsValues F] [DecidableEq F] (P : W.Point) : ℝ
    def WeierstrassCurve.Affine.Point.canonicalHeight.{u_1}
      {F : Type u_1} [Field F]
      {W : WeierstrassCurve.Affine F}
      [Height.AdmissibleAbsValues F]
      [DecidableEq F] (P : W.Point) : ℝ
    **The canonical (Néron–Tate) height** `canonicalHeight P = lim h(2ⁿ P) / 4ⁿ`,
    normalised against the naïve height of the `x`-coordinate.
    
    The limit exists whenever the curve is elliptic
    (`Point.tendsto_naiveHeight_two_pow_nsmul_div_four_pow`); the definition itself needs no hypothesis
    beyond those making `2 ^ n • P` meaningful, so it is stated without one. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/CanonicalHeight/Basic.lean
    complete
    def WeierstrassCurve.Affine.canonicalHeightQuadratic.{u_1} {F : Type u_1}
      [Field F] (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F] [DecidableEq F]
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)] :
      QuadraticMap ℤ W.Point ℝ
    def WeierstrassCurve.Affine.canonicalHeightQuadratic.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)] :
      QuadraticMap ℤ W.Point ℝ
    **The canonical height as a `ℤ`-quadratic map** with values in `ℝ`, which is what makes
    Mathlib's polarisation API available to it. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/CanonicalHeight/Basic.lean
    complete
    def WeierstrassCurve.Affine.neronTatePairing.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F) [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)] :
      LinearMap.BilinMap ℤ W.Point ℝ
    def WeierstrassCurve.Affine.neronTatePairing.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)] :
      LinearMap.BilinMap ℤ W.Point ℝ
    **The Néron–Tate pairing** `⟨P, Q⟩`, the bilinear form associated with the canonical height.
    It is Mathlib's `QuadraticMap.associated'`, the halved polar form. 
Definition4.1.72
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 11
Reverse dependency previews
Preview
Definition 2.70
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Conductor of an elliptic curve over \Q. (LMFDB)

The conductor N of an elliptic curve E defined over \Q is a positive integer divisible by the primes of bad reduction and no others. It has the form N=\prod p^{e_p}, where the exponent e_p is

For all primes p, there is an algorithm of Tate that simultaneously creates a local minimal Weierstrass equation and computes the exponent of the conductor. See:

<UL> <LI> J. Tate, Algorithm for determining the type of a singular fiber in an elliptic pencil, Modular functions of one variable, IV (Proc. Internat. Summer School, Univ. Antwerp, Antwerp, 1972), 33-52. <EM>Lecture Notes in Math.</EM>, Vol. <B>476</B>, Springer, Berlin, 1975.

<LI> J.H. Silverman, <EM>Advanced topics in the arithmetic of elliptic curves</EM>, GTM <B>151</B>, Springer-Verlag, New York, 1994.

</UL>

Depends on: Definition 4.1.4 Definition 4.1.5 Definition 4.1.57

Definition4.1.73
Statement uses 6
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Cremona label. (LMFDB)

The Cremona label of an elliptic curve over \mathbb{Q} is a way of indexing the elliptic curves over \mathbb{Q}. It has the form 11a1 or 10050bf2. The first number represents the conductor, the letter or letters represent the isogeny class and the last number represents the isomorphism class within the isogeny class as it appears in Cremona's tables. In each isogeny class the curve with number 1 is the \Gamma_0(N)-optimal curve.<br> For more details, see "The elliptic curve database for conductors to 130000" by John Cremona in ANTS-VII proceedings, Lecture Notes in Computer Science, vol. 4076, 2006, 11-29.

In the Cremona labeling, it is somewhat difficult to describe the mechanisms for ordering isogeny classes or curves within a class, since these depend on the order in which the curves were computed (though for conductors over 230,000 the isogeny class labels coincide). Cremona labels are only available for conductors up to 500,000. For these reasons, within this site we also use the LMFDB label, whose definition is somewhat simpler. Note that the lack of internal punctuation distinguishes Cremona labels from LMFDB labels.

Depends on: Definition 4.1.4 Definition 4.1.36 Definition 4.1.37 Definition 4.1.41 Definition 4.1.72 Definition 4.1.91

Definition4.1.74
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 4.1.64
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Discriminant of an elliptic curve over \Q. (LMFDB)

The discriminant \Delta of an elliptic curve E defined over \mathbb{Q} is a nonzero integer divisible exactly by the primes of bad reduction. It is the discriminant of the minimal Weierstrass equation of the curve.

Tau Ceti Review: WeierstrassCurve.minimalDiscriminantIdeal, WeierstrassCurve.reducedMinimalModel.

Depends on: Definition 4.1.4 Definition 4.1.19 Definition 4.1.86

Lean code for Definition4.1.74●2 definitions
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/DiscriminantIdeal.lean
    complete
    def WeierstrassCurve.minimalDiscriminantIdeal.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O] {K : Type u_2} [Field K]
      [Algebra O K] [IsFractionRing O K] (W : WeierstrassCurve K)
      [W.IsElliptic] : Ideal O
    def WeierstrassCurve.minimalDiscriminantIdeal.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve K)
      [W.IsElliptic] : Ideal O
    **The minimal discriminant ideal** `𝔇_{E/K} = ∏ᵥ 𝔭ᵥ ^ v (Δ_min,ᵥ)`: the product over the
    height-one primes of `O` of the local minimal discriminants of `W`. The product is finite
    (`hasFiniteMulSupport_pow_localMinimalDiscriminantValuation`): after choosing an integral model,
    only finitely many primes divide its nonzero discriminant ideal, and every local minimal exponent
    is bounded by that ideal's multiplicity. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Reduced.lean
    complete
    def WeierstrassCurve.reducedMinimalModel (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : WeierstrassCurve ℚ
    def WeierstrassCurve.reducedMinimalModel
      (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : WeierstrassCurve ℚ
    **The reduced minimal model** of an elliptic curve over `ℚ`: the unique reduced minimal
    equation in its variable-change orbit. It is characterised by
    `isReducedMinimal_reducedMinimalModel`, `exists_smul_eq_reducedMinimalModel` and
    `eq_reducedMinimalModel`, fixes reduced equations, and depends only on the
    `ℚ`-isomorphism class of `E` (`VariableChange.reducedMinimalModel_smul`). 
Definition4.1.75
Statement uses 5
Statement dependency previews
Preview
Definition 1.2.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Endomorphism ring of an elliptic curve. (LMFDB)

The endomorphism ring \End(E) of an elliptic curve E is the ring of all endomorphisms of E defined over K. For endomorphisms defined over extensions, we speak of the geometric endomorphism ring of E.

For elliptic curves defined over \Q, this ring is always isomorphic to \Z consisting of the multiplication-by-m maps [m] \colon E\to E for m \in \Z.

This is a special case of the endomorphism ring of an abelian variety.

Depends on: Definition 1.2.2 Definition 1.2.22 Definition 4.1.4 Definition 4.1.22 Definition 4.1.28

Definition4.1.76
Statement uses 5
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Faltings height of an elliptic curve. (LMFDB)

The Faltings height of an elliptic curve E defined over \Q is the quantity

h_{\mathrm{Faltings}}(E) = -\frac{1}{2}\log(A),

where A is the covolume (that is, the area of a fundamental period parallelogram) of the Neron lattice of E.

The stable Faltings height of E is

h_{\mathrm{stable}}(E) = \frac{1}{12}(\log\mathrm{denom}(j)-\log(|\Delta|)) - \frac{1}{2}\log(A),

where j is the j-invariant of E, \Delta the discriminant of any model of E and A the covolume of the period lattice of that model. The stable height is independent of the model of E, and the unstable and stable heights are equal for semistable curves, for which \mathrm{denom}(j)=|\Delta|.

Depends on: Definition 4.1.4 Definition 4.1.19 Definition 4.1.43 Definition 4.1.92 Definition 4.1.113

Definition4.1.77
Statement uses 5
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Faltings ratio. (LMFDB)

In each isogeny class of elliptic curves defined over \Q, there is a unique curve E_{\text{min}} whose Neron lattice is a sublattice of the Ne;ron lattices of all the curves in the class (G. Stevens, ); it is the unique curve of minimal Faltings height among the curves in the isogeny class.

The Faltings ratio of each curve E is the index of the Ne;ron lattice of E_{\text{min}} in that of E.

Depends on: Definition 4.1.4 Definition 4.1.36 Definition 4.1.76 Definition 4.1.92 Definition 8.3.166

Definition4.1.78
uses 0used by 0✓L∃∀N

Frey curve. (LMFDB)

Given a triple of integers A, B, C with A + B = C, the Frey curve (or Frey-Hellegouarch curve) associated to this triple is the elliptic curve

y^2 = x(x-A)(x+B).

Tau Ceti Review: TauCeti.freyCurve, TauCeti.isElliptic_freyCurve_iff_ne_zero.

Lean code for Definition4.1.78●2 declarations
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/FreyCurve/Basic.lean
    complete
    def TauCeti.freyCurve.{u_1} {R : Type u_1} [CommRing R] (A B : R) :
      WeierstrassCurve R
    def TauCeti.freyCurve.{u_1} {R : Type u_1}
      [CommRing R] (A B : R) :
      WeierstrassCurve R
    **The Frey–Hellegouarch curve** `y² = x (x - A) (x + B)`, that is `a₂ = B - A` and
    `a₄ = -A B`, the other coefficients being `0`. Its roots `0`, `A` and `-B` differ by `A`, `B` and
    `A + B`. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/FreyCurve/Basic.lean
    complete
    theorem TauCeti.isElliptic_freyCurve_iff_ne_zero.{u_1} {F : Type u_1} [Field F]
      (h2 : 2 ≠ 0) (A B : F) :
      (TauCeti.freyCurve A B).IsElliptic ↔ A ≠ 0 ∧ B ≠ 0 ∧ A + B ≠ 0
    theorem TauCeti.isElliptic_freyCurve_iff_ne_zero.{u_1}
      {F : Type u_1} [Field F] (h2 : 2 ≠ 0)
      (A B : F) :
      (TauCeti.freyCurve A B).IsElliptic ↔
        A ≠ 0 ∧ B ≠ 0 ∧ A + B ≠ 0
    **Over a field of characteristic not `2`, the Frey curve is elliptic exactly when `A`, `B`
    and `A + B` are nonzero.** 
Definition4.1.79
uses 0used by 1XL∃∀N

Integral points. (LMFDB)

The integral points on a given model of an elliptic curve E defined over \Q are the points P=(x,y) on the model that have integral coordinates x and y.

The number of integral points is finite, by a theorem of Siegel.

Definition4.1.80
Statement uses 7
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Elliptic curve invariants. (LMFDB)

Invariants of an elliptic curve E over \mathbb{Q} are its

Depends on: Definition 4.1.4 Definition 4.1.11 Definition 4.1.23 Definition 4.1.72 Definition 4.1.74 Definition 4.1.81 Definition 8.2.7

Definition4.1.81
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 4.1.80
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

j-invariant of a rational elliptic curve. (LMFDB)

The j-invariant of an elliptic curve E defined over \mathbb{Q} is an invariant of the isomorphism class of E over \overline{\mathbb{Q}} . If the Weierstrass equation of E is y^2+a_1xy+a_3y=x^3+a_2x^2+a_4x+a_6, then its j-invariant is given by

j= \frac{c_4^3}{\Delta} where

\begin{aligned} b_2 &= a_1^2 + 4 a_2\\ b_4 &= 2a_4 + a_1 a_3\\ b_6 &= a_3^2 + 4 a_6 \\ b_8 &= a_1^2 a_6 + 4 a_2 a_6 - a_1 a_3 a_4 + a_2 a_3^2 - a_4^2\\ c_4 &= b_2^2 - 24b_4 \\ c_6 &= -b_2^3 + 36 b_2 b_4 - 216 b_6\end{aligned}

and \Delta=-b_2^2b_8 - 8 b_4^3 -27 b_6 ^2 + 9 b_2 b_4 b_6

is the discriminant of E.

Tau Ceti Review: WeierstrassCurve.j.

Depends on: Definition 4.1.4 Definition 4.1.74 Definition 4.1.121

Lean code for Definition4.1.81●1 definition
  • defdefined in Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean
    complete
    def WeierstrassCurve.j.{u} {R : Type u} [CommRing R]
      (W : WeierstrassCurve R) [W.IsElliptic] : R
    def WeierstrassCurve.j.{u} {R : Type u}
      [CommRing R] (W : WeierstrassCurve R)
      [W.IsElliptic] : R
    The j-invariant `j` of an elliptic curve, which is invariant under isomorphisms over `R`.
    Note that to prove two equal elliptic curves have the same `j`, you need to use `simp_rw`,
    as `rw` cannot transfer instance `WeierstrassCurve.IsElliptic` automatically. 
Definition4.1.82
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.86
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Kodaira symbol. (LMFDB)

The Kodaira symbol encodes the reduction type of an elliptic curve at a prime p. It describes the combinatorics of the special fiber of the Ne;ron model of the elliptic curve. The Ne;ron model is obtained from the minimal Weierstrass equation using Tate's algorithm. For an exact definition and properties, consult a text on elliptic curves.

Depends on: Definition 4.1.86 Definition 4.1.94

Definition4.1.83
Statement uses 6
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Label for an elliptic curve over \mathbb Q. (LMFDB)

The LMFDB label of an elliptic curve E over \mathbb{Q} is a way of indexing the elliptic curves over \mathbb{Q}. It has the form "11.a1" or "10050.bf2".

The label has three components: the conductor, the isogeny class label, and the isomorphism class index.

  1. The first component is the decimal representation of the conductor (a positive integer).

  2. The second component is the isogeny class label, a string which represents the isogeny class index, a non-negative integer encoded as in base 26 using the 26 symbols a,b,.., z. The isogeny classes of elliptic curves with the same conductor are sorted lexicographically by the q-expansions of the associated modular forms, and the isogeny class index of each isogeny class of fixed conductor is the index (starting at 0) of the class in this ordering.

  3. The third component is the decimal representation of the isomorphism class index, a positive integer giving the index of the coefficient vector [a_1, a_2, a_3, a_4, a_6] of the reduced minimal Weierstrass equation of E in a lexicographically sorted list of all the elliptic curves in the isogeny class.

The complete label is obtained by concatenating [conductor, ".", isogeny class label, isomorphism class index].

Note that this is not the same as the Cremona label, even though for certain curves they only differ in the insertion of the dot "." (for example, "37a1" and "37.a1" are the same curve). The presence of the punctuation "." distinguishes an LMFDB label from a Cremona label. Cremona labels are only defined for curves of conductor up to 500000.

Depends on: Definition 4.1.4 Definition 4.1.12 Definition 4.1.37 Definition 4.1.41 Definition 4.1.72 Definition 4.1.86

Definition4.1.84
Statement uses 6
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Manin constant for elliptic curves over \Q. (LMFDB)

Let E be an optimal elliptic curves of conductor N, let f be the modular form associated to E, and let \varphi:X_0(N)\to E be the associated modular parametrization. Let \omega_E be the Ne;ron differential on E. Then the pull-back \varphi^*\omega_E of \omega_E to X_0(N) satisfies

\varphi^*\omega_E = c \cdot 2\pi i f(z)dz

for some non-zero rational number c called the Manin constant of E. In fact c\in \Z, by a theorem of Edixhoven.

It is conjectured that c=1 for all optimal curves, and there are several results stating that c=1 if certain conditions hold: see Amod Agashe, Ken Ribet and William Stein: The Manin Constant, Pure and Applied Mathematics Quarterly, Vol. 2 no.2 (2006), pp. 617–636. In an appendix to that paper, John Cremona gives an algorithm for verifying that c=1 in individual cases, and proves that c=1 for all optimal elliptic curves over \Q in the database. Kestutis Cesnavicius proves c=1 for semistable elliptic curves over \Q, and more generally that v_p(c) = 0 if p^2 \nmid N in *The Manin constant in the semistable case*, Compositio Math. 154 (2018), 1889–1920.

For non-optimal elliptic curves E' over \Q, the Manin constant is defined, in terms of the Manin constant of the unique optimal curve isogenous to E'. Let \varphi:X_0(N)\to E and f be as above, and \psi:E\to E' an isogeny of least degree from E to E'. Then we obtain a parametrization \psi\circ\varphi:X_0(N)\to E' and define the Manin constant c' of E' to be the non-zero rational number such that

(\psi\circ\varphi)^*\omega_{E'} = c' \cdot 2\pi i f(z)dz.

This is an integer multiple of the Manin constant of E, since \psi^*\omega_{E'} is an integer multiple of \omega_E; the multiplier divides the degree of \psi but may be strictly less: it may equal 1.

Depends on: Definition 4.1.4 Definition 4.1.36 Definition 4.1.72 Definition 4.1.89 Definition 4.1.91 Definition 4.1.113

Definition4.1.85
Statement uses 8
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

The minimal quadratic twist of an elliptic curve E defined over \mathbb{Q} is defined as follows.

  • First consider the finite set of all quadratic twists of E which have minimal conductor. If this set contains just one curve, it is the minimal quadratic twist.

  • Otherwise, sort the curves with minimal conductor into isogeny classes, and restrict attention to the curves whose class comes first in the LMFDB labelling; equivalently, sort the curves by the sequence of coefficients (a_n) of their L-function and restrict to the curve or curves with the first such sequence.

  • If E does not have Complex Multiplication (CM), then the minimal isogeny class contains a *unique* curve with the same j-invariant as E, and this curve is the minimal quadratic twist of E.

  • If E does have CM, then the minimal isogeny class contains exactly *two* curves with j-invariant j(E). In all but one case these two curves have distinct minimal discriminants, with the same sign, and we define the minimal quadratic twist to be the curve whose minimal discriminant has smallest absolute value.

  • The exception is for elliptic curves with j=66^3, which have CM by the imaginary quadratic order with discriminant -16. The minimal conductor is 32, and curves 32.a1 and 32.a2 (which are quadratic twists of each other by -1) both have minimal discriminant 2^9. The minimal quadratic twist for j=66^3 is defined to be 32.a1.

All elliptic curves E over \mathbb{Q} with j-invariant 1728 are quartic twists of each other. The smallest conductor of such a curve is 32. Both the curves 32.a3 and 32.a4 have j-invariant 1728, and they have minimal discriminants -2^{12} and 2^6 respectively. We define the minimal quartic twist (or just minimal twist) of every elliptic curve with j=1728 to be the curve 32.a3, which has smaller discriminant, and equation Y^2=X^3-X.

All elliptic curves E over \mathbb{Q} with j-invariant 0 are sextic twists of each other. The smallest conductor of such a curve is 27. Both the curves 27.a3 and 27.a4 have j-invariant 0, and they have minimal discriminants -3^9 and -3^3 respectively. We define the minimal sextic twist (or just minimal twist) of every elliptic curve with j=0 to be the curve 27.a4, which has smaller discriminant, and equation Y^2+Y=X^3.

The minimal twist of an elliptic curve E is its minimal quadratic twist, unless j(E)=0 or 1728, in which cases the minimal twist is its minimal sextic or quartic twist respectively. The minimal quadratic twist depends only on the j-invariant unless j=0 or 1728; in each of these cases, there are infinitely many different minimal quadratic twists, though only one minimal twist.

Depends on: Definition 4.1.4 Definition 4.1.11 Definition 4.1.37 Definition 4.1.43 Definition 4.1.53 Definition 4.1.72 Definition 4.1.120 Definition 5.1.57

Definition4.1.86
uses 0
Used by 7
Reverse dependency previews
Preview
Definition 4.1.64
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Minimal Weierstrass equation over \mathbb Q. (LMFDB)

Every elliptic curve over \mathbb{Q} has an integral Weierstrass model (or equation) of the form y^2+a_1xy+a_3y=x^3+a_2x^2+a_4x+a_6,

where a_1,a_2,a_3,a_4,a_6 are integers. Each such equation has a discriminant \Delta. A minimal Weierstrass equation is one for which |\Delta| is minimal among all Weierstrass models for the same curve. For elliptic curves over \mathbb{Q}, minimal models exist, and there is a unique reduced minimal model which satisfies the additional constraints a_1,a_3\in\{0,1\}, a_2\in\{-1,0,1\}.

Tau Ceti Review: WeierstrassCurve.IsGlobalMinimal, WeierstrassCurve.IsReducedMinimal, WeierstrassCurve.reducedMinimalModel.

Lean code for Definition4.1.86●3 definitions
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/GlobalMinimalModel.lean
    complete
    def WeierstrassCurve.IsGlobalMinimal.{u_1, u_2} (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {K : Type u_2} [Field K] [Algebra O K]
      [IsFractionRing O K] (W : WeierstrassCurve K) [_hE : W.IsElliptic] :
      Prop
    def WeierstrassCurve.IsGlobalMinimal.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {K : Type u_2}
      [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve K)
      [_hE : W.IsElliptic] : Prop
    **A globally minimal Weierstrass equation** (LMFDB `ec.global_minimal_model`): `W` is minimal
    over the discrete valuation ring `Localization.AtPrime v.asIdeal` at every height-one prime `v` of
    `O`. Integrality over `O` is not assumed; it is the theorem `IsGlobalMinimal.isIntegral`. The
    ellipticity instance keeps the predicate to elliptic curves, the setting in which the invariants
    derived from it make sense; the definition itself does not consume it, which its binder name
    records. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Reduced.lean
    complete
    def WeierstrassCurve.IsReducedMinimal (W : WeierstrassCurve ℚ)
      [W.IsElliptic] : Prop
    def WeierstrassCurve.IsReducedMinimal
      (W : WeierstrassCurve ℚ)
      [W.IsElliptic] : Prop
    **A reduced minimal Weierstrass equation over `ℚ`**: globally minimal over `ℤ`, with the
    residual freedom of the changes of variables over `ℤ` pinned by `a₁, a₃ ∈ {0, 1}` and
    `a₂ ∈ {-1, 0, 1}`. Every elliptic curve over `ℚ` has exactly one such equation in its
    variable-change orbit (`existsUnique_reducedMinimal`). 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Reduced.lean
    complete
    def WeierstrassCurve.reducedMinimalModel (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : WeierstrassCurve ℚ
    def WeierstrassCurve.reducedMinimalModel
      (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : WeierstrassCurve ℚ
    **The reduced minimal model** of an elliptic curve over `ℚ`: the unique reduced minimal
    equation in its variable-change orbit. It is characterised by
    `isReducedMinimal_reducedMinimalModel`, `exists_smul_eq_reducedMinimalModel` and
    `eq_reducedMinimalModel`, fixes reduced equations, and depends only on the
    `ℚ`-isomorphism class of `E` (`VariableChange.reducedMinimalModel_smul`). 
Definition4.1.87
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Modular degree of an elliptic curve over \mathbb Q. (LMFDB)

The modular degree of an elliptic curve over \Q is the minimum degree of a modular parametrization of the curve.

Depends on: Definition 4.1.4 Definition 4.1.89

Definition4.1.88
Statement uses 3
Statement dependency previews
Preview
Definition 3.1.64
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Modular form associated to an elliptic curve/\mathbb Q. (LMFDB)

For every elliptic curve over \Q of conductor N, there is a unique weight 2 newform for \Gamma_0(N) with the same L-function. This was proved by Breuil, Conrad, Diamond, and Taylor, building on the proof of Fermat's last theorem by Wiles and Taylor-Wiles.

Depends on: Definition 3.1.64 Definition 3.1.101 Definition 4.1.4

Definition4.1.89
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 4.1.84
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Modular parametrization of an elliptic curve over \mathbb Q. (LMFDB)

A modular parametrization of an elliptic curve E over \mathbb{Q} is a non-constant map X_0(N) \to E, where N is the conductor of E.

Depends on: Definition 4.1.4

Definition4.1.90
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Naive height. (LMFDB)

The naive height of an elliptic curve in short Weierstrass form

y^2 = x^3 + a_4 x + a_6

is the quantity \max(4\lvert a_4 \rvert^3, 27\lvert a_6 \rvert^2).

Tau Ceti Review: WeierstrassCurve.minimalPairModel, WeierstrassCurve.naiveHeight, WeierstrassCurve.shortEquationHeight.

Depends on: Definition 4.1.4 Definition 4.1.121

Lean code for Definition4.1.90●3 definitions
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalPairModel.lean
    complete
    def WeierstrassCurve.minimalPairModel (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : E.MinimalPairModel
    def WeierstrassCurve.minimalPairModel
      (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : E.MinimalPairModel
    **A chosen minimal-pair model** of an elliptic curve over `ℚ`. Its equation and its height
    do not depend on the choice (`minimalPairModel_unique`, `naiveHeight_eq`). 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalPairModel.lean
    complete
    def WeierstrassCurve.naiveHeight (E : WeierstrassCurve ℚ) [E.IsElliptic] : ℕ
    def WeierstrassCurve.naiveHeight
      (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : ℕ
    **The naïve height of an elliptic curve over `ℚ`**: the height `max (4|A|³) (27B²)` of its
    minimal-pair equation `y² = x³ + Ax + B`. It can be computed from any minimal-pair model
    (`naiveHeight_eq`), is invariant under `ℚ`-isomorphism (`naiveHeight_variableChange`), and is the
    quantity by which tables of elliptic curves over `ℚ` are ordered. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalPairModel.lean
    complete
    def WeierstrassCurve.shortEquationHeight (W : WeierstrassCurve ℤ) : ℕ
    def WeierstrassCurve.shortEquationHeight
      (W : WeierstrassCurve ℤ) : ℕ
    **The height of a short Weierstrass equation** `y² = x³ + a₄x + a₆` over `ℤ`:
    `max (4|a₄|³) (27a₆²)`. The formula is stated for every Weierstrass equation over `ℤ`, but it is
    the height of the equation only when the equation is short, which is how it is used. It is a
    function of the equation, not of the curve it defines: over `ℚ`, the scaling `x = u²x'`,
    `y = u³y'` sends `(a₄, a₆)` to `(u⁻⁴a₄, u⁻⁶a₆)` and divides the same expression by `|u|¹²`. It
    becomes an invariant of the curve once the equation is pinned to the minimal pair, which is
    `naiveHeight`. 
Definition4.1.91
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.37
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.1.73
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Optimal elliptic curve over \mathbb Q. (LMFDB)

An elliptic curve over \Q is optimal if it is an optimal quotient of the corresponding modular curve. Every isogeny class contains a unique optimal curve. For more information, see William Stein's page on optimal quotients.

Optimal curves have a Cremona label whose last component is the number 1, with the exception of class 990h where the optimal curve is 990h3 (number 3). This is a historical accident and has no mathematical significance.

NB It has not yet been proved in all cases that the first curve in each class is optimal; however this is true for all isogeny classes of conductor {}\le400000, and for many others (for example whenever the isogeny class consists of only one curve). The current optimality status of each curve is shown on its home page.

Depends on: Definition 4.1.37 Definition 4.1.64 Definition 4.1.72

Definition4.1.92
Statement uses 6
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.1.62
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Period lattice of an elliptic curve. (LMFDB)

For E an elliptic curve defined over \C by a Weierstrass equation with coefficients a_1,a_2,a_3,a_4,a_6, the period lattice of E is the set \Lambda of periods of the invariant differential dx/(2y+a_1x+a_3), which is a discrete lattice of rank 2 in \C. There is an isomorphism (of complex Lie groups) \C/\Lambda \cong E(\C) defined in terms of the Weierstrass \wp-function.

For elliptic curves defined over \R (and in particular, for those defined over \Q), the period lattice has one of two possible types depending on the sign of the discriminant \Delta of E:

  • If \Delta>0, then \Lambda is *rectangular*, with a \Z-basis of the form \left<x,yi\right>, where x and y are positive real numbers; in this case, E(\R) has two connected components.

  • If \Delta<0, then \Lambda has a \Z-basis of the form \left<2x,x+yi\right>, where x and y are positive real numbers; in this case, E(\R) has one connected component.

The real period of E is defined to be 2x in each case, so is equal to the smallest positive real period multiplied by the number of real components.

Note that the period lattice depends on the choice of Weierstrass model of E; different models have homothetic lattices. For elliptic curves defined over \Q, the period lattice associated to a global minimal model of E is called the N'e;ron lattice of E. The real period of the Ne;ron lattice is denoted \Omega_E, and appears in the Birch Swinnerton-Dyer conjecture for E.

Depends on: Definition 4.1.4 Definition 4.1.29 Definition 4.1.74 Definition 4.1.93 Definition 4.1.121 Definition 8.3.121

Definition4.1.93
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.86
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 4.1.69
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Real period. (LMFDB)

For an elliptic curve E defined over \R with period lattice \Lambda, the real period \Omega is the least positive element of \Lambda\cap\R multiplied by the number of components of E(\R).

When an elliptic curve is defined by means of a Weierstrass equation, the period lattice \Lambda is the lattice of periods of the invariant differential dx/(2y+a_1x+a_3). Different Weierstrass models defining isomorphic curves have period lattices which are homothetic, meaning that they differ by a nonzero multiplicative constant. When we speak of the period lattice or the real period for an elliptic curve defined over \Q, we always mean the lattice and period associated with a minimal equation.

Depends on: Definition 4.1.86 Definition 4.1.121 Definition 4.1.122

Definition4.1.94
uses 1used by 1✓L∃∀N

Reduction type of an elliptic curve over \mathbb Q. (LMFDB)

The reduction type of an elliptic curve E defined over \mathbb{Q} at a prime p depends on the reduction \tilde E of E modulo p. This reduction is constructed by taking a minimal Weierstrass equation for E and reducing its coefficients modulo p to obtain a curves over \mathbb{F}_p. The reduced curve is either smooth (non-singular) or has a unique singular point.

E has good reduction at p if \tilde E is non-singular over \mathbb{F}_p. The reduction type is ordinary (ord) if \tilde E is ordinary (equivalently, if \tilde E(\overline{\F_p}) has non-trivial p-torsion) and supersingular (ss) otherwise. The coefficient a(p) of the L-function L(E,s) is divisible by p if the reduction is supersingular and not if it is ordinary.

E has bad reduction at p if \tilde E is singular over \mathbb{F}_p. In this case the reduction type is further classified according to the nature of the singularity. In all cases the singularity is a double point.

E has multiplicative reduction at p if \tilde E has a nodal singularity: the singular point is a node, with distinct tangents. It is called split if the two tangents are defined over \mathbb{F}_p and non-split otherwise. The coefficient a(p) of L(E,s) is 1 if the reduction is split and -1 if it is non-split.

E has additive reduction at p if \tilde E has a cuspidal singularity: the singular point is a cusp, with only one tangent. In this case a(p)=0.

Depends on: Definition 4.1.86

Lean code for Definition4.1.94●6 declarations
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/LFunctionCoefficient.lean
    complete
    theorem WeierstrassCurve.LFunction_apply_absNorm_eq_frobeniusTrace
      (W : WeierstrassCurve ℚ)
      (v :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers ℚ))
      [W.IsElliptic] :
      W.LFunction (Ideal.absNorm v.asIdeal) =
        (WeierstrassCurve.reduction (Localization.AtPrime v.asIdeal)
            (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal)
              W)).frobeniusTrace
    theorem WeierstrassCurve.LFunction_apply_absNorm_eq_frobeniusTrace
      (W : WeierstrassCurve ℚ)
      (v :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers ℚ))
      [W.IsElliptic] :
      W.LFunction (Ideal.absNorm v.asIdeal) =
        (WeierstrassCurve.reduction
            (Localization.AtPrime v.asIdeal)
            (WeierstrassCurve.minimal
              (Localization.AtPrime v.asIdeal)
              W)).frobeniusTrace
    **The coefficient `a(p)` of `L(E, s)` is the Frobenius trace of the reduction at `p`** (LMFDB
    `ec.q.reduction_type`): for an elliptic curve over `ℚ` and the prime `v` above `p`, the coefficient
    of `p⁻ˢ` in Mathlib's `WeierstrassCurve.LFunction` is `p + 1 − #Ẽ(𝔽_p)`, where `Ẽ` is the reduction
    modulo `p` of a minimal equation over `ℤ_(p)`, its singular point counted. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/LFunctionCoefficient.lean
    complete
    theorem WeierstrassCurve.LFunction_apply_absNorm_eq_one (W : WeierstrassCurve ℚ)
      (v :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers ℚ))
      [W.IsElliptic]
      (h :
        WeierstrassCurve.HasSplitMultiplicativeReduction
          (Localization.AtPrime v.asIdeal)
          (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal) W)) :
      W.LFunction (Ideal.absNorm v.asIdeal) = 1
    theorem WeierstrassCurve.LFunction_apply_absNorm_eq_one
      (W : WeierstrassCurve ℚ)
      (v :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers ℚ))
      [W.IsElliptic]
      (h :
        WeierstrassCurve.HasSplitMultiplicativeReduction
          (Localization.AtPrime v.asIdeal)
          (WeierstrassCurve.minimal
            (Localization.AtPrime v.asIdeal)
            W)) :
      W.LFunction (Ideal.absNorm v.asIdeal) =
        1
    **`a(p) = 1` at split multiplicative reduction** (LMFDB `ec.q.reduction_type`). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/LFunctionCoefficient.lean
    complete
    theorem WeierstrassCurve.LFunction_apply_absNorm_eq_neg_one
      (W : WeierstrassCurve ℚ)
      (v :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers ℚ))
      [W.IsElliptic]
      (h :
        WeierstrassCurve.IsNonsplitMultiplicativeReduction
          (Localization.AtPrime v.asIdeal)
          (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal) W)) :
      W.LFunction (Ideal.absNorm v.asIdeal) = -1
    theorem WeierstrassCurve.LFunction_apply_absNorm_eq_neg_one
      (W : WeierstrassCurve ℚ)
      (v :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers ℚ))
      [W.IsElliptic]
      (h :
        WeierstrassCurve.IsNonsplitMultiplicativeReduction
          (Localization.AtPrime v.asIdeal)
          (WeierstrassCurve.minimal
            (Localization.AtPrime v.asIdeal)
            W)) :
      W.LFunction (Ideal.absNorm v.asIdeal) =
        -1
    **`a(p) = -1` at non-split multiplicative reduction** (LMFDB `ec.q.reduction_type`). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/LFunctionCoefficient.lean
    complete
    theorem WeierstrassCurve.LFunction_apply_absNorm_eq_zero
      (W : WeierstrassCurve ℚ)
      (v :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers ℚ))
      [W.IsElliptic]
      (h :
        WeierstrassCurve.HasAdditiveReduction
          (Localization.AtPrime v.asIdeal)
          (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal) W)) :
      W.LFunction (Ideal.absNorm v.asIdeal) = 0
    theorem WeierstrassCurve.LFunction_apply_absNorm_eq_zero
      (W : WeierstrassCurve ℚ)
      (v :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers ℚ))
      [W.IsElliptic]
      (h :
        WeierstrassCurve.HasAdditiveReduction
          (Localization.AtPrime v.asIdeal)
          (WeierstrassCurve.minimal
            (Localization.AtPrime v.asIdeal)
            W)) :
      W.LFunction (Ideal.absNorm v.asIdeal) =
        0
    **`a(p) = 0` at additive reduction** (LMFDB `ec.q.reduction_type`). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/LFunctionCoefficient.lean
    complete
    theorem WeierstrassCurve.hasGoodSupersingularReduction_iff_dvd_LFunction_apply
      (W : WeierstrassCurve ℚ)
      (v :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers ℚ))
      [W.IsElliptic]
      [WeierstrassCurve.HasGoodReduction (Localization.AtPrime v.asIdeal)
          (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal) W)] :
      WeierstrassCurve.HasGoodSupersingularReduction
          (Localization.AtPrime v.asIdeal) (Ideal.absNorm v.asIdeal)
          (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal) W) ↔
        ↑(Ideal.absNorm v.asIdeal) ∣ W.LFunction (Ideal.absNorm v.asIdeal)
    theorem WeierstrassCurve.hasGoodSupersingularReduction_iff_dvd_LFunction_apply
      (W : WeierstrassCurve ℚ)
      (v :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers ℚ))
      [W.IsElliptic]
      [WeierstrassCurve.HasGoodReduction
          (Localization.AtPrime v.asIdeal)
          (WeierstrassCurve.minimal
            (Localization.AtPrime v.asIdeal)
            W)] :
      WeierstrassCurve.HasGoodSupersingularReduction
          (Localization.AtPrime v.asIdeal)
          (Ideal.absNorm v.asIdeal)
          (WeierstrassCurve.minimal
            (Localization.AtPrime v.asIdeal)
            W) ↔
        ↑(Ideal.absNorm v.asIdeal) ∣
          W.LFunction
            (Ideal.absNorm v.asIdeal)
    **At good reduction, `p` divides `a(p)` exactly when the reduction is supersingular** (LMFDB
    `ec.q.reduction_type`). 
  • inductive(3 constructors)defined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    inductive WeierstrassCurve.ReductionType : Type
    inductive WeierstrassCurve.ReductionType : Type
    The **reduction type** (LMFDB `ec.reduction_type`) of an elliptic curve at a prime: **good**,
    **multiplicative** (split or non-split), or **additive**. 
    WeierstrassCurve.ReductionType.good :
      WeierstrassCurve.ReductionType
    WeierstrassCurve.ReductionType.multiplicative
      (split : Bool) : WeierstrassCurve.ReductionType
    WeierstrassCurve.ReductionType.additive :
      WeierstrassCurve.ReductionType
Definition4.1.95
Statement uses 4
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Regulator of elliptic curve. (LMFDB)

The regulator of an elliptic curve E defined over a number field K, denoted \operatorname{Reg}(E/K), is the volume of E(K)/E(K)_{tor} with respect to the height pairing \langle -,-\rangle associated to the canonical height \hat{h}, i.e. \langle P,Q\rangle = \frac{1}{2}(\hat{h}(P+Q)-\hat{h}(P)-\hat{h}(Q)).

If the Mordell-Weil group E(K) has rank r and P_1, \ldots, P_r \in E(K) generate E(K)/E(K)_{tor}, then

\operatorname{Reg}(E/K) = \left|\det (\langle P_i, P_j \rangle )_{1\leq i,j \leq r}\right|,

which is independent of the choice of generators.

Special cases are when E(K) has rank 0, in which case E(K)/E(K)_{tor}=0 and \operatorname{Reg}(E/K)=1, and when E(K) has rank 1, in which case \operatorname{Reg}(E/K) is equal to the canonical height \hat{h}(P) of a generator P.

Tau Ceti Review: WeierstrassCurve.Affine.neronTatePairing, WeierstrassCurve.Affine.neronTatePairingModTorsion, WeierstrassCurve.Affine.regulator.

Depends on: Definition 4.1.4 Definition 4.1.10 Definition 4.1.54 Definition 5.1.1

Lean code for Definition4.1.95●3 definitions
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/CanonicalHeight/Basic.lean
    complete
    def WeierstrassCurve.Affine.neronTatePairing.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F) [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)] :
      LinearMap.BilinMap ℤ W.Point ℝ
    def WeierstrassCurve.Affine.neronTatePairing.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)] :
      LinearMap.BilinMap ℤ W.Point ℝ
    **The Néron–Tate pairing** `⟨P, Q⟩`, the bilinear form associated with the canonical height.
    It is Mathlib's `QuadraticMap.associated'`, the halved polar form. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MordellWeil/PointModTorsion/Basic.lean
    complete
    def WeierstrassCurve.Affine.neronTatePairingModTorsion.{u_1} {F : Type u_1}
      [Field F] (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F] [DecidableEq F]
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)] :
      LinearMap.BilinMap ℤ W.PointModTorsion ℝ
    def WeierstrassCurve.Affine.neronTatePairingModTorsion.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)] :
      LinearMap.BilinMap ℤ W.PointModTorsion ℝ
    **The Néron-Tate pairing on the points modulo torsion.** 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MordellWeil/Regulator/Basic.lean
    complete
    def WeierstrassCurve.Affine.regulator.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F) [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)]
      [Module.Finite ℤ W.PointModTorsion] : ℝ
    def WeierstrassCurve.Affine.regulator.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)]
      [Module.Finite ℤ W.PointModTorsion] : ℝ
    **The regulator** of an elliptic curve whose points modulo torsion are finitely generated as a
    `ℤ`-module: the absolute determinant of the Gram matrix of the Néron-Tate pairing on any basis of
    that quotient. For a curve of rank zero this is the empty determinant, namely `1`. 
Definition4.1.96
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Semistable elliptic curve. (LMFDB)

An elliptic curve is semistable if it has multiplicative reduction at every bad prime.

Tau Ceti Review: WeierstrassCurve.IsSemistable.

Depends on: Definition 4.1.4 Definition 4.1.7 Definition 4.1.107

Lean code for Definition4.1.96●6 declarations
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Semistable.lean
    complete
    def WeierstrassCurve.IsSemistable.{u_3, u_4} (O : Type u_3) [CommRing O]
      [IsDedekindDomain O] {F : Type u_4} [Field F] [Algebra O F]
      [IsFractionRing O F] (W : WeierstrassCurve F) [_hE : W.IsElliptic] :
      Prop
    def WeierstrassCurve.IsSemistable.{u_3, u_4}
      (O : Type u_3) [CommRing O]
      [IsDedekindDomain O] {F : Type u_4}
      [Field F] [Algebra O F]
      [IsFractionRing O F]
      (W : WeierstrassCurve F)
      [_hE : W.IsElliptic] : Prop
    **Semistability over a Dedekind domain**: at every height-one prime, a local minimal equation
    has no additive reduction. Equivalently, the reduction is good or multiplicative everywhere.
    
    The predicate is stated on an elliptic equation but depends only on its `F`-isomorphism class, as
    proved by `isSemistable_smul`. The ellipticity instance excludes singular cubics, which have no
    reduction type in the good/multiplicative/additive trichotomy of elliptic curves. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/SemistableNodal.lean
    complete
    theorem WeierstrassCurve.isSemistable_iff_forall_hasMultiplicativeReduction.{u_1,
        u_2}
      {O : Type u_1} [CommRing O] [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F] [IsFractionRing O F] (W : WeierstrassCurve F)
      [W.IsElliptic] :
      WeierstrassCurve.IsSemistable O W ↔
        ∀ (v : IsDedekindDomain.HeightOneSpectrum O),
          WeierstrassCurve.IsBadReduction (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal)
                W) →
            WeierstrassCurve.HasMultiplicativeReduction
              (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal) W)
    theorem WeierstrassCurve.isSemistable_iff_forall_hasMultiplicativeReduction.{u_1,
        u_2}
      {O : Type u_1} [CommRing O]
      [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F]
      [IsFractionRing O F]
      (W : WeierstrassCurve F)
      [W.IsElliptic] :
      WeierstrassCurve.IsSemistable O W ↔
        ∀
          (v :
            IsDedekindDomain.HeightOneSpectrum
              O),
          WeierstrassCurve.IsBadReduction
              (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal
                (Localization.AtPrime
                  v.asIdeal)
                W) →
            WeierstrassCurve.HasMultiplicativeReduction
              (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal
                (Localization.AtPrime
                  v.asIdeal)
                W)
    **An elliptic curve is semistable exactly when it has multiplicative reduction at every bad
    prime** (LMFDB `ec.semistable`, `ec.q.semistable`): at every height-one prime `v` at which a
    minimal equation over `Oᵥ` has bad reduction, it has multiplicative reduction. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/SemistableNodal.lean
    complete
    theorem WeierstrassCurve.isSemistable_iff_forall_hasNode.{u_1, u_2}
      {O : Type u_1} [CommRing O] [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F] [IsFractionRing O F] (W : WeierstrassCurve F)
      [W.IsElliptic] :
      WeierstrassCurve.IsSemistable O W ↔
        ∀ (v : IsDedekindDomain.HeightOneSpectrum O),
          WeierstrassCurve.IsBadReduction (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal)
                W) →
            (WeierstrassCurve.reduction (Localization.AtPrime v.asIdeal)
                (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal)
                  W)).HasNode
    theorem WeierstrassCurve.isSemistable_iff_forall_hasNode.{u_1,
        u_2}
      {O : Type u_1} [CommRing O]
      [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F]
      [IsFractionRing O F]
      (W : WeierstrassCurve F)
      [W.IsElliptic] :
      WeierstrassCurve.IsSemistable O W ↔
        ∀
          (v :
            IsDedekindDomain.HeightOneSpectrum
              O),
          WeierstrassCurve.IsBadReduction
              (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal
                (Localization.AtPrime
                  v.asIdeal)
                W) →
            (WeierstrassCurve.reduction
                (Localization.AtPrime
                  v.asIdeal)
                (WeierstrassCurve.minimal
                  (Localization.AtPrime
                    v.asIdeal)
                  W)).HasNode
    **An elliptic curve is semistable exactly when its reduction at every bad prime has a node**
    (LMFDB `ec.semistable`, `ec.q.semistable`, `ec.reduction_type`). 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    def WeierstrassCurve.IsBadReduction.{u, v} (R : Type v) [CommRing R]
      [IsDomain R] [IsDiscreteValuationRing R] {K : Type u} [Field K]
      [Algebra R K] [IsFractionRing R K] (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] : Prop
    def WeierstrassCurve.IsBadReduction.{u, v}
      (R : Type v) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R] {K : Type u}
      [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] : Prop
    A minimal Weierstrass curve over `K` has **bad reduction** (LMFDB `ec.bad_reduction`) if it
    does not have good reduction, i.e. its reduction over the residue field of `R` is singular. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.HasNode.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    def WeierstrassCurve.HasNode.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    A Weierstrass curve `W` over a field `F` has a **nodal singularity** (LMFDB
    `ec.multiplicative_reduction`, `ec.reduction_type`): over an algebraic closure of `F` it has a
    singular point with two distinct tangent slopes, that is, two distinct tangent lines. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasMultiplicativeReduction_iff_hasNode.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      {W : WeierstrassCurve K} [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasMultiplicativeReduction R W ↔
        (WeierstrassCurve.reduction R W).HasNode
    theorem WeierstrassCurve.hasMultiplicativeReduction_iff_hasNode.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      {W : WeierstrassCurve K}
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasMultiplicativeReduction
          R W ↔
        (WeierstrassCurve.reduction R
            W).HasNode
    **Multiplicative reduction is nodal reduction** (Silverman VII.5.1): a minimal equation has
    multiplicative reduction, Mathlib's `v(Δ) < 1` and `v(c₄) = 1`, exactly when its reduction has a
    node. 
Definition4.1.97
Statement uses 4
Statement dependency previews
Preview
Definition 3.1.57
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Serre invariants. (LMFDB)

Let \bar \rho_{E,\ell} be the mod-\ell Galois representation of an elliptic curve E/\Q.

The Serre invariants (k,M) of \bar \rho_{E,\ell} consist of the Serre weight k and the Serre conductor M giving the weight and minimal level of a newform f\in S_{k}^{\textrm new}(\Gamma_1(M)) whose associated mod-\ell Galois representation is isomorphic to \bar \rho_{E,\ell}.

This means that a_p(E) and a_p(f) reduce to the same element of the residue field of a prime above \ell in the coefficient field of f (this residue field need not have degree one, but every a_p(f) must reduce to an element of \F_{\ell} in order for this condition to hold).

The modular form f is not uniquely determined, but the minimal level M arising among all such f is uniquely determined, and among those with level M, the weight is uniquely determined.

For all but finitely many primes \ell, including all \ell>7 of good reduction for E, the Serre invariants are (2,N), where N is the conductor of the elliptic curve. The primes \ell for which this does not hold are exceptional.

In general, the Serre weight k is divisible by 2 and the Serre conductor M divides N.

Depends on: Definition 3.1.57 Definition 3.1.101 Definition 4.1.24 Definition 5.1.64

Definition4.1.98
Statement uses 3
Statement dependency previews
Preview
Definition 2.47
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Special value of an elliptic curve L-function. (LMFDB)

The special value of an elliptic curve E/\Q is the first nonzero value of L^{(r)}(E,1)/r! for r\in \Z_{\ge 0}, where L(E,s) is the L-function of E in its arithmetic normalization.

The special value appears on the LHS of the formula in the Birch and Swinnerton-Dyer conjecture.

Depends on: Definition 4.1.4 Definition 4.1.70 Definition 2.47

Definition4.1.99
Statement uses 4
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Szpiro ratio. (LMFDB)

The (modified) Szpiro ratio of an elliptic curve E is defined as

\sigma_m(E) = \frac{\log \max(|c_4|^3, |c_6|^2)}{\log N},

where N is the conductor of E and c_4 and c_6 are defined as for the j-invariant. The (modified) Szpiro conjecture is that, for any \epsilon > 0, there are only finitely many elliptic curves with Szpiro ratio larger than 6+\epsilon. In , Oesterlé proves that this conjecture is equivalent to the abc conjecture.

In Oesterlé's paper cited above, there is another conjecture, that the ratio

\frac{\log \Delta}{\log N},

also has the property of only taking values larger than 6+\epsilon finitely many times (here \Delta is the minimal discriminant of E). This conjecture is implied by the modified Szpiro conjecture (and thus the abc conjecture), but it is not currently known to be equivalent. All of the Szpiro ratios in the LMFDB are computed in terms of c_4 and c_6 rather than \Delta for this reason.

Tau Ceti Review: WeierstrassCurve.algorithmicSzpiroRatio, TauCeti.AlgorithmicModifiedSzpiroConjecture, WeierstrassCurve.algorithmicConductor.

Depends on: Definition 4.1.4 Definition 4.1.53 Definition 4.1.72 Definition 4.1.81

Lean code for Definition4.1.99●10 declarations
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/SzpiroRatio.lean
    complete
    def WeierstrassCurve.algorithmicModifiedSzpiroRatio (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : ℝ
    def WeierstrassCurve.algorithmicModifiedSzpiroRatio
      (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : ℝ
    The (modified) **Szpiro ratio** `σₘ(E) = log max (|c₄|³, c₆²) / log N` (LMFDB
    `ec.q.szpiro_ratio`) of an elliptic curve over `ℚ`, where `c₄` and `c₆` are the invariants of the
    reduced minimal model and `N` is the norm of the algorithmic conductor. The conductor of an
    elliptic curve over `ℚ` exceeds `1`, as there is no elliptic curve over `ℚ` with good reduction
    everywhere (`WeierstrassCurve.one_lt_absNorm_algorithmicConductor`); for `N = 1` the quotient
    would be `0` by division by zero. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/SzpiroRatioConjecture.lean
    complete
    def TauCeti.AlgorithmicModifiedSzpiroRatioConjecture : Prop
    def TauCeti.AlgorithmicModifiedSzpiroRatioConjecture :
      Prop
    **The modified Szpiro conjecture** in the form of LMFDB `ec.q.szpiro_ratio`, against the
    algorithmic conductor: for every `ε > 0`, only finitely many elliptic curves over `ℚ`, up to
    isomorphism, have modified Szpiro ratio `log max (|c₄|³, c₆²) / log N` greater than `6 + ε`. The
    isomorphism classes are the orbits of the changes of variables. It is equivalent to Tau Ceti's
    bound form `TauCeti.AlgorithmicModifiedSzpiroConjecture`
    (`TauCeti.algorithmicModifiedSzpiroConjecture_iff_algorithmicModifiedSzpiroRatioConjecture`). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/SzpiroRatioConjecture.lean
    complete
    theorem TauCeti.abcConjecture_iff_algorithmicModifiedSzpiroRatioConjecture :
      TauCeti.AbcConjecture ↔
        TauCeti.AlgorithmicModifiedSzpiroRatioConjecture
    theorem TauCeti.abcConjecture_iff_algorithmicModifiedSzpiroRatioConjecture :
      TauCeti.AbcConjecture ↔
        TauCeti.AlgorithmicModifiedSzpiroRatioConjecture
    **The abc conjecture is equivalent to the modified Szpiro conjecture in finiteness form**
    (Oesterlé; LMFDB `ec.q.szpiro_ratio` and `ec.q.abc_quality`): for every `ε > 0`, only finitely many
    elliptic curves over `ℚ`, up to isomorphism, have modified Szpiro ratio greater than `6 + ε`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/SzpiroRatioConjecture.lean
    complete
    theorem TauCeti.algorithmicModifiedSzpiroConjecture_iff_algorithmicModifiedSzpiroRatioConjecture :
      TauCeti.AlgorithmicModifiedSzpiroConjecture ↔
        TauCeti.AlgorithmicModifiedSzpiroRatioConjecture
    theorem TauCeti.algorithmicModifiedSzpiroConjecture_iff_algorithmicModifiedSzpiroRatioConjecture :
      TauCeti.AlgorithmicModifiedSzpiroConjecture ↔
        TauCeti.AlgorithmicModifiedSzpiroRatioConjecture
    **The two forms of the modified Szpiro conjecture are equivalent**: Tau Ceti's bound
    `max (|c₄|³, c₆²) ≤ C N ^ (6 + ε)` and the finiteness of the isomorphism classes of modified Szpiro
    ratio above `6 + ε` of LMFDB `ec.q.szpiro_ratio`. A bound at `6 + ε / 2` bounds `N`, hence `c₄` and
    `c₆`, on the curves of ratio above `6 + ε`; conversely the largest `max (|c₄|³, c₆²)` among the
    finitely many exceptions is a constant. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/Szpiro.lean
    complete
    def WeierstrassCurve.algorithmicSzpiroRatio (E : WeierstrassCurve ℚ)
      [E.IsElliptic]
      (_h : 1 < Ideal.absNorm (WeierstrassCurve.algorithmicConductor ℤ E)) :
      ℝ
    def WeierstrassCurve.algorithmicSzpiroRatio
      (E : WeierstrassCurve ℚ) [E.IsElliptic]
      (_h :
        1 <
          Ideal.absNorm
            (WeierstrassCurve.algorithmicConductor
              ℤ E)) :
      ℝ
    **The Szpiro ratio** `log |Δ_min| / log N` of an elliptic curve over `ℚ`, where `|Δ_min|` is
    the norm of the minimal discriminant ideal over `ℤ` and `N` that of the algorithmic conductor. The
    hypothesis `1 < N` makes the denominator nonzero; without it the quotient would be `0` by division
    by zero. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/SzpiroRatioConjecture.lean
    complete
    def TauCeti.AlgorithmicSzpiroRatioConjecture : Prop
    def TauCeti.AlgorithmicSzpiroRatioConjecture :
      Prop
    **Szpiro's conjecture** in the form of LMFDB `ec.q.szpiro_ratio`, against the algorithmic
    conductor: for every `ε > 0`, only finitely many elliptic curves over `ℚ`, up to isomorphism, have
    Szpiro ratio `log |Δ_min| / log N` greater than `6 + ε`. The ratio is defined since `N > 1`
    (`WeierstrassCurve.one_lt_absNorm_algorithmicConductor`). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/SzpiroRatioConjecture.lean
    complete
    theorem TauCeti.AlgorithmicModifiedSzpiroRatioConjecture.algorithmicSzpiroRatioConjecture
      (h : TauCeti.AlgorithmicModifiedSzpiroRatioConjecture) :
      TauCeti.AlgorithmicSzpiroRatioConjecture
    theorem TauCeti.AlgorithmicModifiedSzpiroRatioConjecture.algorithmicSzpiroRatioConjecture
      (h :
        TauCeti.AlgorithmicModifiedSzpiroRatioConjecture) :
      TauCeti.AlgorithmicSzpiroRatioConjecture
    **The modified Szpiro conjecture implies Szpiro's conjecture**, in the finiteness forms of LMFDB
    `ec.q.szpiro_ratio`, since the Szpiro ratio `log |Δ_min| / log N` is at most the modified one. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/EverywhereGoodReduction.lean
    complete
    theorem WeierstrassCurve.one_lt_absNorm_algorithmicConductor
      (E : WeierstrassCurve ℚ) [E.IsElliptic] :
      1 < Ideal.absNorm (WeierstrassCurve.algorithmicConductor ℤ E)
    theorem WeierstrassCurve.one_lt_absNorm_algorithmicConductor
      (E : WeierstrassCurve ℚ)
      [E.IsElliptic] :
      1 <
        Ideal.absNorm
          (WeierstrassCurve.algorithmicConductor
            ℤ E)
    **Every elliptic curve over `ℚ` has bad reduction at some prime** (Tate; LMFDB
    `ec.q.szpiro_ratio`): the norm `N` of its algorithmic conductor exceeds `1`, so that its Szpiro
    ratios are defined. Otherwise no prime would divide the discriminant of the integral model of its
    reduced minimal model, which would then be an elliptic curve over `ℤ`. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/Szpiro.lean
    complete
    def TauCeti.AlgorithmicModifiedSzpiroConjecture : Prop
    def TauCeti.AlgorithmicModifiedSzpiroConjecture :
      Prop
    **The modified Szpiro conjecture**, against the algorithmic conductor: for every `ε > 0` there
    is a constant `C` such that every elliptic curve over `ℚ` satisfies
    `max (|c₄|³, c₆²) ≤ C N ^ (6 + ε)`, where `c₄` and `c₆` are the invariants of the reduced minimal
    model and `N` is the norm of the algorithmic conductor. The invariants of any globally minimal
    equation have the same absolute values, as such equations differ by changes of variables over `ℤ`
    with `u = ±1`. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/TateAlgorithm/Reduction/Conductor.lean
    complete
    def WeierstrassCurve.algorithmicConductor.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O]
      [∀ (v : IsDedekindDomain.HeightOneSpectrum O),
          PerfectField
            (IsLocalRing.ResidueField (Localization.AtPrime v.asIdeal))]
      {K : Type u_2} [Field K] [Algebra O K] [IsFractionRing O K]
      (W : WeierstrassCurve K) [W.IsElliptic] : Ideal O
    def WeierstrassCurve.algorithmicConductor.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O]
      [∀
          (v :
            IsDedekindDomain.HeightOneSpectrum
              O),
          PerfectField
            (IsLocalRing.ResidueField
              (Localization.AtPrime
                v.asIdeal))]
      {K : Type u_2} [Field K] [Algebra O K]
      [IsFractionRing O K]
      (W : WeierstrassCurve K)
      [W.IsElliptic] : Ideal O
    **The algorithmic conductor** `∏ᵥ 𝔭ᵥ ^ fᵥ` of an elliptic curve over the fraction field of a
    Dedekind domain `O`: the product over the height-one primes of `O` of the prime powers whose
    exponents are the algorithmic Ogg exponents `fᵥ = v (Δ_min,ᵥ) − mᵥ + 1` read off Tate's algorithm.
    The product is finite (`hasFiniteMulSupport_pow_algorithmicOggExponent`). 
Definition4.1.100
uses 0used by 1✓L∃∀N

Tamagawa numbers for an elliptic curve. (LMFDB)

If E is an elliptic curve defined over the p-adic field \mathbb{Q}_p, its Tamagawa number is the finite index

c_p=[E(\mathbb{Q}_p):E^0(\mathbb{Q}_p)].

Here E^0(\mathbb{Q}_p) is the subgroup of points which have good reduction. If E has good reduction, then E(\mathbb{Q}_p)=E^0(\mathbb{Q}_p) and c_p=1.

An elliptic curve E defined over \mathbb{Q} has a Tamagawa number c_p at every prime p, with c_p=1 for all primes of good reduction (and hence c_p=1 for all but finitely many primes).

Tau Ceti Review: WeierstrassCurve.Affine.nonsingularReduction.

Lean code for Definition4.1.100●4 declarations
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/Tamagawa.lean
    complete
    def WeierstrassCurve.tamagawaNumber.{u_1} {K : Type u_1} [Field K]
      [NumberField K] (W : WeierstrassCurve K)
      (p :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers K)) :
      ℕ
    def WeierstrassCurve.tamagawaNumber.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (W : WeierstrassCurve K)
      (p :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers K)) :
      ℕ
    The **Tamagawa number** `c_𝔭(E) = [E(K_𝔭) : E⁰(K_𝔭)]` (LMFDB `ec.tamagawa_number`) of a
    Weierstrass curve `W` over a number field `K` at a prime `𝔭`, where `E(K_𝔭)` is the group of points
    of Mathlib's chosen minimal equation, over the valuation ring of the completion `K_𝔭`, of the base
    change of `W` to `K_𝔭`, and `E⁰(K_𝔭)` is its subgroup of points whose reduction modulo `𝔭` is
    nonsingular. An infinite index would read `0`; the index is finite, but that is not formalised. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/Affine/Point/NonsingularReduction.lean
    complete
    def WeierstrassCurve.Affine.nonsingularReduction.{u_1, u_2} {F : Type u_1}
      {Γ₀ : Type u_2} [Field F] [LinearOrderedCommGroupWithZero Γ₀]
      (v : Valuation F Γ₀) (W : WeierstrassCurve.Affine F)
      [WeierstrassCurve.IsIntegral (↥v.valuationSubring) W]
      [DecidableEq F] : AddSubgroup W.Point
    def WeierstrassCurve.Affine.nonsingularReduction.{u_1,
        u_2}
      {F : Type u_1} {Γ₀ : Type u_2} [Field F]
      [LinearOrderedCommGroupWithZero Γ₀]
      (v : Valuation F Γ₀)
      (W : WeierstrassCurve.Affine F)
      [WeierstrassCurve.IsIntegral
          (↥v.valuationSubring) W]
      [DecidableEq F] : AddSubgroup W.Point
    **The subgroup `E₀(F)` of points with nonsingular reduction**: the points of `W(F)` whose
    reduction is a nonsingular point of the reduced curve. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/Tamagawa.lean
    complete
    theorem WeierstrassCurve.tamagawaNumber_eq_one_of_hasGoodReduction.{u_1}
      {K : Type u_1} [Field K] [NumberField K] (W : WeierstrassCurve K)
      (p :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers K))
      (h :
        WeierstrassCurve.HasGoodReduction
          (↥(IsDedekindDomain.HeightOneSpectrum.adicCompletionIntegers K p))
          (WeierstrassCurve.minimal
            (↥(IsDedekindDomain.HeightOneSpectrum.adicCompletionIntegers K
                p))
            (W.baseChange
              (IsDedekindDomain.HeightOneSpectrum.adicCompletion K p)))) :
      W.tamagawaNumber p = 1
    theorem WeierstrassCurve.tamagawaNumber_eq_one_of_hasGoodReduction.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (W : WeierstrassCurve K)
      (p :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers K))
      (h :
        WeierstrassCurve.HasGoodReduction
          (↥(IsDedekindDomain.HeightOneSpectrum.adicCompletionIntegers
              K p))
          (WeierstrassCurve.minimal
            (↥(IsDedekindDomain.HeightOneSpectrum.adicCompletionIntegers
                K p))
            (W.baseChange
              (IsDedekindDomain.HeightOneSpectrum.adicCompletion
                K p)))) :
      W.tamagawaNumber p = 1
    **The Tamagawa number is `1` at good reduction**: if Mathlib's chosen minimal equation of `W`
    over the valuation ring of `K_𝔭` has good reduction, then every point of `E(K_𝔭)` has nonsingular
    reduction, and `c_𝔭(E) = 1`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/Tamagawa.lean
    complete
    theorem WeierstrassCurve.hasFiniteMulSupport_tamagawaNumber.{u_1} {K : Type u_1}
      [Field K] [NumberField K] (W : WeierstrassCurve K) [W.IsElliptic] :
      Function.HasFiniteMulSupport W.tamagawaNumber
    theorem WeierstrassCurve.hasFiniteMulSupport_tamagawaNumber.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (W : WeierstrassCurve K)
      [W.IsElliptic] :
      Function.HasFiniteMulSupport
        W.tamagawaNumber
    **Only finitely many Tamagawa numbers differ from `1`**, as `c_𝔭(E) = 1` at every prime of good
    reduction. 
Definition4.1.101
Statement uses 4
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Torsion growth in number fields. (LMFDB)

Let E be an elliptic curve defined over \Q and let K be a number field. We say that there is torsion growth from \Q to K if the torsion subgroup E(K)_{\rm tor} of E(K) is strictly larger than E(\Q)_{\rm tor}.

If there is torsion growth in a field K then obviously the torsion also grows in every extension of K. We say that the torsion growth in K is primitive if E(K)_{\rm tor} is strictly larger than E(K')_{\rm tor} for all proper subfields K' \subsetneq K.

For every elliptic curve E there is torsion growth in at least one field of degree 2, 3, or 4, and torsion can only grow in fields whose degree is divisible by 2, 3, 5 or 7: see Theorem 7.2 of . Additionally, there is no primitive torsion growth in fields of degrees 22 or 26: see Lemma 2.11 of . Hence the only degrees less than 24 in which primitive torsion growth occurs are 2,3,4,5,6,7,8,9,10,12,14,15,16,18,20,21.

Depends on: Definition 4.1.4 Definition 4.1.119 Definition 5.1.1 Definition 5.1.14

Definition4.1.102
uses 0used by 1✓L∃∀N

Torsion subgroup of an elliptic curve over \mathbb Q. (LMFDB)

If E is an elliptic curve defined over \mathbb{Q}, its torsion subgroup is the subgroup of the Mordell-Weil group E(\mathbb{Q}) consisting of all the rational points of finite order. It is a finite abelian group of order at most 16 (by a theorem of Mazur), which is a product of at most 2 cyclic factors. The "torsion structure" is the list of invariants of the group:

  • [] for the trivial group;

  • [n] for a cyclic group of order n (only n=2,3,4,5,6,7,8,9,10 or 12 occur for elliptic curves over \mathbb{Q});

  • [n_1,n_2] with n_1\mid n_2 for a product of cyclic groups of orders n_1 and n_2 (only [2,2m] for m=2,4,6 or 8 occur over \mathbb{Q}).

Tau Ceti Review: AddCommGroup.torsion.

Lean code for Definition4.1.102●1 definition
  • defdefined in Mathlib/GroupTheory/Torsion.lean
    complete
    def AddCommGroup.torsion.{u_1} (G : Type u_1) [AddCommGroup G] :
      AddSubgroup G
    def AddCommGroup.torsion.{u_1} (G : Type u_1)
      [AddCommGroup G] : AddSubgroup G
    The torsion additive subgroup of an additive abelian group. 
Definition4.1.103
uses 1used by 0✓L∃∀N

Weil height of a point on an elliptic curve over \Q. (LMFDB)

The Weil height (also known as the naive height) h(P) of a rational point P with coordinates (x,y) on an elliptic curve defined over \Q is defined to be \log\max(|a|,|b|) where the rational number x is expressed as x=a/b with a,b coprime integers.

Tau Ceti Review: WeierstrassCurve.Affine.Point.naiveHeight, Height.logHeight₁, Rat.mulHeight₁_eq_max.

Depends on: Definition 4.1.64

Lean code for Definition4.1.103●4 declarations
  • defdefined in Mathlib/NumberTheory/Height/EllipticCurve.lean
    complete
    def WeierstrassCurve.Affine.Point.naiveHeight.{u_1} {F : Type u_1} [Field F]
      [Height.AdmissibleAbsValues F] {W : WeierstrassCurve.Affine F}
      (P : W.Point) : ℝ
    def WeierstrassCurve.Affine.Point.naiveHeight.{u_1}
      {F : Type u_1} [Field F]
      [Height.AdmissibleAbsValues F]
      {W : WeierstrassCurve.Affine F}
      (P : W.Point) : ℝ
    The naïve logarithmic height of an affine point on `W`. 
  • theoremdefined in Mathlib/NumberTheory/Height/EllipticCurve.lean
    complete
    theorem WeierstrassCurve.Affine.Point.naiveHeight_eq_logHeight₁.{u_1}
      {F : Type u_1} [Field F] [Height.AdmissibleAbsValues F]
      {W : WeierstrassCurve.Affine F} {P : W.Point} :
      P.naiveHeight = Height.logHeight₁ (P.xRep 0)
    theorem WeierstrassCurve.Affine.Point.naiveHeight_eq_logHeight₁.{u_1}
      {F : Type u_1} [Field F]
      [Height.AdmissibleAbsValues F]
      {W : WeierstrassCurve.Affine F}
      {P : W.Point} :
      P.naiveHeight =
        Height.logHeight₁ (P.xRep 0)
  • defdefined in Mathlib/NumberTheory/Height/Basic.lean
    complete
    def Height.logHeight₁.{u_1} {K : Type u_1} [Field K]
      [Height.AdmissibleAbsValues K] (x : K) : ℝ
    def Height.logHeight₁.{u_1} {K : Type u_1}
      [Field K] [Height.AdmissibleAbsValues K]
      (x : K) : ℝ
    The logarithmic height of an element of `K`. 
  • theoremdefined in Mathlib/NumberTheory/Height/NumberField.lean
    complete
    theorem Rat.mulHeight₁_eq_max (q : ℚ) :
      Height.mulHeight₁ q = ↑(max q.num.natAbs q.den)
    theorem Rat.mulHeight₁_eq_max (q : ℚ) :
      Height.mulHeight₁ q =
        ↑(max q.num.natAbs q.den)
    The multiplicative height of a rational number is the maximum of the absolute value of
    its numerator and its denominator. 
Definition4.1.104
Statement uses 5
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

An elliptic curve E defined over a number field K is a \mathbb{Q}-curve if it is isogenous over \overline{K} to each of its Galois conjugates. Note that the isogenies need not be defined over K itself.

An elliptic curve which is the base change of a curve defined over \mathbb{Q} is a \mathbb{Q}-curve, but not all \mathbb{Q}-curves are base-change curves.

Elliptic curves with CM are all \mathbb{Q}-curves, as are all those whose j-invariant is in \mathbb{Q}.

Depends on: Definition 4.1.4 Definition 4.1.8 Definition 4.1.11 Definition 4.1.36 Definition 5.1.1

Definition4.1.105
Statement uses 7
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 9
Reverse dependency previews
Preview
Definition 2.74
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Rank of an elliptic curve over a number field. (LMFDB)

The rank of an elliptic curve E defined over a number field K is the rank of its Mordell-Weil group E(K).

The Mordell-Weil Theorem says that E(K) is a finitely-generated abelian group, hence

E(K) \cong E(K)_{\rm tor} \times \Z^r

where E(K)_{\rm tor} is the finite torsion subgroup of E(K), and r\geq 0 is the rank.

Rank is an isogeny invariant: all curves in an isogeny class have the same rank.

Tau Ceti Review: TauCeti.Isogeny.Hom.finrank_pointModTorsion_eq, WeierstrassCurve.Affine.fg_point_of_numberField.

Depends on: Definition 4.1.4 Definition 4.1.36 Definition 4.1.37 Definition 4.1.54 Definition 4.1.55 Definition 4.1.119 Definition 5.1.1

Lean code for Definition4.1.105●3 declarations
  • defdefined in Mathlib/GroupTheory/Torsion.lean
    complete
    def CommGroup.freeRank.{u_1} (G : Type u_1) [CommGroup G] [Group.FG G] : ℕ
    def CommGroup.freeRank.{u_1} (G : Type u_1)
      [CommGroup G] [Group.FG G] : ℕ
    The free rank of a finitely generated abelian group is the rank of its free part. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MordellWeil/PointModTorsion/Isogeny.lean
    complete
    theorem TauCeti.Isogeny.Hom.finrank_pointModTorsion_eq.{u_1} {F : Type u_1}
      [Field F] [DecidableEq F] {W₁ W₂ : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic W₁] [WeierstrassCurve.IsElliptic W₂]
      [Module.Finite ℤ W₂.PointModTorsion] {f : TauCeti.Isogeny.Hom W₁ W₂}
      (hf : f ≠ 0) :
      Module.finrank ℤ W₁.PointModTorsion =
        Module.finrank ℤ W₂.PointModTorsion
    theorem TauCeti.Isogeny.Hom.finrank_pointModTorsion_eq.{u_1}
      {F : Type u_1} [Field F] [DecidableEq F]
      {W₁ W₂ : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic W₁]
      [WeierstrassCurve.IsElliptic W₂]
      [Module.Finite ℤ W₂.PointModTorsion]
      {f : TauCeti.Isogeny.Hom W₁ W₂}
      (hf : f ≠ 0) :
      Module.finrank ℤ W₁.PointModTorsion =
        Module.finrank ℤ W₂.PointModTorsion
    **Isogenous curves have the same rank**: a nonzero morphism `f` and its dual are injective on
    the points modulo torsion. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MordellWeil/FinitelyGenerated.lean
    complete
    theorem WeierstrassCurve.Affine.fg_point_of_numberField.{u_2} {F : Type u_2}
      [Field F] [NumberField F] [DecidableEq F]
      {W : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)] :
      AddGroup.FG W.Point
    theorem WeierstrassCurve.Affine.fg_point_of_numberField.{u_2}
      {F : Type u_2} [Field F] [NumberField F]
      [DecidableEq F]
      {W : WeierstrassCurve.Affine F}
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)] :
      AddGroup.FG W.Point
    **The Mordell–Weil theorem**: the group `E(K)` of `K`-rational points of an elliptic curve `E`
    over a number field `K` is finitely generated.
    
    The square on the left-hand side is completed by an admissible change of variables, possible since
    `K` has characteristic zero, and the finiteness hypotheses of `fg_point` for the resulting model
    are the class number theorem and Dirichlet's unit theorem. 
Definition4.1.106
Statement uses 7
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Reduction of an elliptic curve. (LMFDB)

An elliptic curve E over a number field K is semistable if it has multiplicative reduction at every bad prime, and has potential good reduction if its j-invariant is integral.

If E has potential good reduction then it cannot be semistable unless it has everywhere good reduction.

Tau Ceti Review: WeierstrassCurve.IsSemistable.

Depends on: Definition 4.1.4 Definition 4.1.7 Definition 4.1.43 Definition 4.1.63 Definition 4.1.107 Definition 4.1.113 Definition 5.1.41

Lean code for Definition4.1.106●6 declarations
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Semistable.lean
    complete
    def WeierstrassCurve.IsSemistable.{u_3, u_4} (O : Type u_3) [CommRing O]
      [IsDedekindDomain O] {F : Type u_4} [Field F] [Algebra O F]
      [IsFractionRing O F] (W : WeierstrassCurve F) [_hE : W.IsElliptic] :
      Prop
    def WeierstrassCurve.IsSemistable.{u_3, u_4}
      (O : Type u_3) [CommRing O]
      [IsDedekindDomain O] {F : Type u_4}
      [Field F] [Algebra O F]
      [IsFractionRing O F]
      (W : WeierstrassCurve F)
      [_hE : W.IsElliptic] : Prop
    **Semistability over a Dedekind domain**: at every height-one prime, a local minimal equation
    has no additive reduction. Equivalently, the reduction is good or multiplicative everywhere.
    
    The predicate is stated on an elliptic equation but depends only on its `F`-isomorphism class, as
    proved by `isSemistable_smul`. The ellipticity instance excludes singular cubics, which have no
    reduction type in the good/multiplicative/additive trichotomy of elliptic curves. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/SemistableNodal.lean
    complete
    theorem WeierstrassCurve.isSemistable_iff_forall_hasMultiplicativeReduction.{u_1,
        u_2}
      {O : Type u_1} [CommRing O] [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F] [IsFractionRing O F] (W : WeierstrassCurve F)
      [W.IsElliptic] :
      WeierstrassCurve.IsSemistable O W ↔
        ∀ (v : IsDedekindDomain.HeightOneSpectrum O),
          WeierstrassCurve.IsBadReduction (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal)
                W) →
            WeierstrassCurve.HasMultiplicativeReduction
              (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal) W)
    theorem WeierstrassCurve.isSemistable_iff_forall_hasMultiplicativeReduction.{u_1,
        u_2}
      {O : Type u_1} [CommRing O]
      [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F]
      [IsFractionRing O F]
      (W : WeierstrassCurve F)
      [W.IsElliptic] :
      WeierstrassCurve.IsSemistable O W ↔
        ∀
          (v :
            IsDedekindDomain.HeightOneSpectrum
              O),
          WeierstrassCurve.IsBadReduction
              (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal
                (Localization.AtPrime
                  v.asIdeal)
                W) →
            WeierstrassCurve.HasMultiplicativeReduction
              (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal
                (Localization.AtPrime
                  v.asIdeal)
                W)
    **An elliptic curve is semistable exactly when it has multiplicative reduction at every bad
    prime** (LMFDB `ec.semistable`, `ec.q.semistable`): at every height-one prime `v` at which a
    minimal equation over `Oᵥ` has bad reduction, it has multiplicative reduction. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/PotentialGoodReduction.lean
    complete
    def WeierstrassCurve.HasPotentialEverywhereGoodReduction.{u} {K : Type u}
      [Field K] (W : WeierstrassCurve K) [NumberField K] : Prop
    def WeierstrassCurve.HasPotentialEverywhereGoodReduction.{u}
      {K : Type u} [Field K]
      (W : WeierstrassCurve K)
      [NumberField K] : Prop
    An elliptic curve `W` over a number field `K` has **potential good reduction** (LMFDB
    `ec.potential_good_reduction`, `ec.reduction`) if it has everywhere good reduction over a finite
    extension `L` of `K`, which is then a number field: at every prime of `L` a minimal equation of
    `W` over the local ring has good reduction. One extension serves every prime of `L`, unlike Tau
    Ceti's local `WeierstrassCurve.HasPotentialGoodReduction`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/PotentialGoodReduction.lean
    complete
    theorem WeierstrassCurve.hasPotentialEverywhereGoodReduction_iff_isInteger_j.{u}
      {K : Type u} [Field K] {W : WeierstrassCurve K} [NumberField K]
      [W.IsElliptic] :
      W.HasPotentialEverywhereGoodReduction ↔
        IsLocalization.IsInteger (NumberField.RingOfIntegers K) W.j
    theorem WeierstrassCurve.hasPotentialEverywhereGoodReduction_iff_isInteger_j.{u}
      {K : Type u} [Field K]
      {W : WeierstrassCurve K} [NumberField K]
      [W.IsElliptic] :
      W.HasPotentialEverywhereGoodReduction ↔
        IsLocalization.IsInteger
          (NumberField.RingOfIntegers K) W.j
    **Potential good reduction is the integrality of the `j`-invariant** (LMFDB
    `ec.potential_good_reduction`, `ec.reduction`; Silverman VII.5.5 at every prime at once): an
    elliptic curve over a number field has everywhere good reduction over a finite extension exactly
    when its `j`-invariant is integral, that is, lies in the ring of integers `𝓞 K`, the integral
    closure of `ℤ` in `K`. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/PotentialGoodReduction.lean
    complete
    def WeierstrassCurve.HasEverywhereGoodReduction.{u_1, u_2} (O : Type u_1)
      [CommRing O] [IsDedekindDomain O] {F : Type u_2} [Field F]
      [Algebra O F] [IsFractionRing O F] (W : WeierstrassCurve F) : Prop
    def WeierstrassCurve.HasEverywhereGoodReduction.{u_1,
        u_2}
      (O : Type u_1) [CommRing O]
      [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F]
      [IsFractionRing O F]
      (W : WeierstrassCurve F) : Prop
    A Weierstrass curve `W` over the fraction field `F` of a Dedekind domain `O` has **everywhere
    good reduction** (LMFDB `ec.good_reduction`) if it has good reduction at every height-one prime
    `v` of `O`: a minimal equation of `W` over the localisation `Oᵥ` has good reduction. For a number
    field `F` and `O = 𝓞 F` these are the primes of `F`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/PotentialGoodReduction.lean
    complete
    theorem WeierstrassCurve.IsSemistable.hasEverywhereGoodReduction.{u}
      {K : Type u} [Field K] {W : WeierstrassCurve K} [NumberField K]
      [W.IsElliptic]
      (h : WeierstrassCurve.IsSemistable (NumberField.RingOfIntegers K) W)
      (hW : W.HasPotentialEverywhereGoodReduction) :
      WeierstrassCurve.HasEverywhereGoodReduction
        (NumberField.RingOfIntegers K) W
    theorem WeierstrassCurve.IsSemistable.hasEverywhereGoodReduction.{u}
      {K : Type u} [Field K]
      {W : WeierstrassCurve K} [NumberField K]
      [W.IsElliptic]
      (h :
        WeierstrassCurve.IsSemistable
          (NumberField.RingOfIntegers K) W)
      (hW :
        W.HasPotentialEverywhereGoodReduction) :
      WeierstrassCurve.HasEverywhereGoodReduction
        (NumberField.RingOfIntegers K) W
    **A semistable curve with potential good reduction has everywhere good reduction** (LMFDB
    `ec.reduction`): its `j`-invariant is integral, while at a prime of multiplicative reduction it has
    a pole. 
Definition4.1.107
Statement uses 5
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 4.1.45
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Reduction type. (LMFDB)

The reduction type of an elliptic curve E defined over a number field K at a prime \mathfrak{p} of K depends on the reduction \tilde E of E modulo \mathfrak{p}. Let \F_q be the ring of integers of K modulo \mathfrak{p}, a finite field of characteristic p.

E has good reduction at \mathfrak p if \tilde E is non-singular over \F_q. The reduction type is ordinary if \tilde E is ordinary (equivalently, \tilde E(\overline{\F_q}) has p-torsion) and supersingular otherwise.

On the other hand, if the reduction of E modulo \mathfrak{p} is singular, then E has bad reduction. There are two types of bad reduction are as follows.

E has multiplicative reduction at \mathfrak p if \tilde E has a nodal singularity. It is called split multiplicative reduction if the two tangents at the node are defined over \F_q and non-split multiplicative reduction otherwise.

E has additive reduction at \mathfrak p if \tilde E has a cuspidal singularity.

Tau Ceti Review: WeierstrassCurve.HasGoodOrdinaryReduction.

Depends on: Definition 4.1.4 Definition 4.1.7 Definition 4.1.31 Definition 5.1.1 Definition 5.1.74

Lean code for Definition4.1.107●9 declarations
  • class(extends 2, 3 methods)defined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/OrdinaryReduction.lean
    complete
    class WeierstrassCurve.HasGoodOrdinaryReduction.{u_1, u_2} (R : Type u_1)
      [CommRing R] [IsDomain R] [IsDiscreteValuationRing R] {K : Type u_2}
      [Field K] [Algebra R K] [IsFractionRing R K] (p : ℕ)
      (W : WeierstrassCurve K) : Prop
    class WeierstrassCurve.HasGoodOrdinaryReduction.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K] (p : ℕ)
      (W : WeierstrassCurve K) : Prop
    **Good ordinary reduction** at `p`: a minimal equation with good reduction whose reduction is
    ordinary at `p`, that is, has a nonzero `p`-torsion point over the algebraic closure of the residue
    field. It is meant for `p` the characteristic of the residue field. 
    • WeierstrassCurve.HasGoodReduction R W
    val_Δ_maximal : MaximalFor (fun C => WeierstrassCurve.IsIntegral R (C • W)) (fun C => WeierstrassCurve.valuation_Δ_aux R (C • W)) 1
    Inherited from
    1. WeierstrassCurve.HasGoodReduction
    2. WeierstrassCurve.IsMinimal
    goodReduction : (IsDedekindDomain.HeightOneSpectrum.valuation K (IsDiscreteValuationRing.maximalIdeal R)) W.Δ = 1
    Inherited from
    1. WeierstrassCurve.HasGoodReduction
    isOrdinary_reduction : WeierstrassCurve.IsOrdinary p (WeierstrassCurve.reduction R W)
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    def WeierstrassCurve.IsNonsplitMultiplicativeReduction.{u, v} (R : Type v)
      [CommRing R] [IsDomain R] [IsDiscreteValuationRing R] {K : Type u}
      [Field K] [Algebra R K] [IsFractionRing R K] (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] : Prop
    def WeierstrassCurve.IsNonsplitMultiplicativeReduction.{u,
        v}
      (R : Type v) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R] {K : Type u}
      [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] : Prop
    A minimal Weierstrass curve over `K` has **non-split multiplicative reduction** (LMFDB
    `ec.nonsplit_multiplicative_reduction`) if it has multiplicative reduction that is not split. 
  • inductive(3 constructors)defined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    inductive WeierstrassCurve.ReductionType : Type
    inductive WeierstrassCurve.ReductionType : Type
    The **reduction type** (LMFDB `ec.reduction_type`) of an elliptic curve at a prime: **good**,
    **multiplicative** (split or non-split), or **additive**. 
    WeierstrassCurve.ReductionType.good :
      WeierstrassCurve.ReductionType
    WeierstrassCurve.ReductionType.multiplicative
      (split : Bool) : WeierstrassCurve.ReductionType
    WeierstrassCurve.ReductionType.additive :
      WeierstrassCurve.ReductionType
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.HasNode.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    def WeierstrassCurve.HasNode.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    A Weierstrass curve `W` over a field `F` has a **nodal singularity** (LMFDB
    `ec.multiplicative_reduction`, `ec.reduction_type`): over an algebraic closure of `F` it has a
    singular point with two distinct tangent slopes, that is, two distinct tangent lines. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasMultiplicativeReduction_iff_hasNode.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      {W : WeierstrassCurve K} [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasMultiplicativeReduction R W ↔
        (WeierstrassCurve.reduction R W).HasNode
    theorem WeierstrassCurve.hasMultiplicativeReduction_iff_hasNode.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      {W : WeierstrassCurve K}
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasMultiplicativeReduction
          R W ↔
        (WeierstrassCurve.reduction R
            W).HasNode
    **Multiplicative reduction is nodal reduction** (Silverman VII.5.1): a minimal equation has
    multiplicative reduction, Mathlib's `v(Δ) < 1` and `v(c₄) = 1`, exactly when its reduction has a
    node. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.HasCusp.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    def WeierstrassCurve.HasCusp.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    A Weierstrass curve `W` over a field `F` has a **cuspidal singularity** (LMFDB
    `ec.additive_reduction`, `ec.reduction_type`): over an algebraic closure of `F` it has a singular
    point with a single tangent slope, that is, a single tangent line. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasAdditiveReduction_iff_hasCusp.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      {W : WeierstrassCurve K} [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasAdditiveReduction R W ↔
        (WeierstrassCurve.reduction R W).HasCusp
    theorem WeierstrassCurve.hasAdditiveReduction_iff_hasCusp.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      {W : WeierstrassCurve K}
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasAdditiveReduction R
          W ↔
        (WeierstrassCurve.reduction R
            W).HasCusp
    **Additive reduction is cuspidal reduction** (Silverman VII.5.1): a minimal equation has
    additive reduction, Mathlib's `v(Δ) < 1` and `v(c₄) < 1`, exactly when its reduction has a cusp. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.HasSplitNode.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    def WeierstrassCurve.HasSplitNode.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    A Weierstrass curve `W` over a field `F` has a **nodal singularity with both tangent slopes
    defined over `F`** (LMFDB `ec.split_multiplicative_reduction`): a singular point over `F` with two
    distinct tangent slopes in `F`. A node has only two tangent slopes, so these are both of them. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasSplitMultiplicativeReduction_iff_hasSplitNode.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      {W : WeierstrassCurve K} [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasSplitMultiplicativeReduction R W ↔
        (WeierstrassCurve.reduction R W).HasSplitNode
    theorem WeierstrassCurve.hasSplitMultiplicativeReduction_iff_hasSplitNode.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      {W : WeierstrassCurve K}
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasSplitMultiplicativeReduction
          R W ↔
        (WeierstrassCurve.reduction R
            W).HasSplitNode
    **Split multiplicative reduction is reduction with a node whose tangent slopes are defined over
    the residue field**: Mathlib's condition that the node polynomial of the integral model splits
    over the residue field is that both tangent slopes at the node of the reduction lie in it. 
Definition4.1.108
Statement uses 7
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 7
Reverse dependency previews
Preview
Definition 1.2.50
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Regulator of an elliptic curve. (LMFDB)

The regulator of an elliptic curve E defined over a number field K, denoted \operatorname{Reg}(E/K), is the volume of E(K)/E(K)_{tor} with respect to the height pairing \langle -,-\rangle associated to the canonical height \hat{h}, i.e. \langle P,Q\rangle = \frac{1}{2}(\hat{h}(P+Q)-\hat{h}(P)-\hat{h}(Q)).

If the Mordell-Weil group E(K) has rank r and P_1, \ldots, P_r \in E(K) generate E(K)/E(K)_{\mathrm{tor}}, then

\operatorname{Reg}(E/K) = \left|\det (\langle P_i, P_j \rangle )_{1\leq i,j \leq r}\right|,

which is independent of the choice of generators.

Special cases are when E(K) has rank 0, in which case E(K)/E(K)_{\mathrm{tor}}=0 and \operatorname{Reg}(E/K)=1, and when E(K) has rank 1, in which case \operatorname{Reg}(E/K) is equal to the canonical height \hat{h}(P) of a generator P.

The canonical height used to define the regulator is usually *normalised* so that it is invariant under base change. Note that the regulator which appears in the Birch Swinnerton-Dyer conjecture is with respect to the non-normalised height; this is sometimes called the Neron-Tate regulator, and denoted \operatorname{Reg}_{\rm NT}(E/K). These are related by

\operatorname{Reg}_{\rm NT}(E/K) = d^r \operatorname{Reg}(E/K),

where d is the degree [K:\Q].

Tau Ceti Review: WeierstrassCurve.Affine.neronTatePairing.

Depends on: Definition 4.1.4 Definition 4.1.8 Definition 4.1.10 Definition 4.1.54 Definition 4.1.105 Definition 5.1.1 Definition 5.1.14

Lean code for Definition4.1.108●6 declarations
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/Regulator.lean
    complete
    def WeierstrassCurve.Affine.normalizedRegulator.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [DecidableEq K]
      (W : WeierstrassCurve.Affine K) [WeierstrassCurve.IsElliptic W] : ℝ
    def WeierstrassCurve.Affine.normalizedRegulator.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [DecidableEq K]
      (W : WeierstrassCurve.Affine K)
      [WeierstrassCurve.IsElliptic W] : ℝ
    The **regulator** `Reg(E/K)` (LMFDB `ec.regulator`) of an elliptic curve over a number field
    `K`: the volume of `E(K)/E(K)_tors` for the height pairing of the normalised canonical height
    `ĥ / [K : ℚ]`, that is, the Néron–Tate regulator `WeierstrassCurve.Affine.regulator` divided by
    `[K : ℚ] ^ r`, where `r` is the rank of `E(K)`. This is the LMFDB normalisation, invariant under
    base change; the Néron–Tate regulator itself is the one in the conjecture of Birch and
    Swinnerton-Dyer. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/CanonicalHeight/Basic.lean
    complete
    def WeierstrassCurve.Affine.neronTatePairing.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F) [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic (WeierstrassCurve.toAffine W)] :
      LinearMap.BilinMap ℤ W.Point ℝ
    def WeierstrassCurve.Affine.neronTatePairing.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      [Height.AdmissibleAbsValues F]
      [DecidableEq F]
      [WeierstrassCurve.IsElliptic
          (WeierstrassCurve.toAffine W)] :
      LinearMap.BilinMap ℤ W.Point ℝ
    **The Néron–Tate pairing** `⟨P, Q⟩`, the bilinear form associated with the canonical height.
    It is Mathlib's `QuadraticMap.associated'`, the halved polar form. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/Regulator.lean
    complete
    theorem WeierstrassCurve.Affine.normalizedRegulator_eq_abs_det.{u_1, u_2}
      {K : Type u_1} [Field K] [NumberField K] [DecidableEq K]
      (W : WeierstrassCurve.Affine K) [WeierstrassCurve.IsElliptic W]
      {ι : Type u_2} [Fintype ι] (b : Module.Basis ι ℤ W.PointModTorsion)
      [DecidableEq ι] :
      W.normalizedRegulator =
        |((↑(Module.finrank ℚ K))⁻¹ • W.neronTateGramMatrix b).det|
    theorem WeierstrassCurve.Affine.normalizedRegulator_eq_abs_det.{u_1,
        u_2}
      {K : Type u_1} [Field K] [NumberField K]
      [DecidableEq K]
      (W : WeierstrassCurve.Affine K)
      [WeierstrassCurve.IsElliptic W]
      {ι : Type u_2} [Fintype ι]
      (b : Module.Basis ι ℤ W.PointModTorsion)
      [DecidableEq ι] :
      W.normalizedRegulator =
        |((↑(Module.finrank ℚ K))⁻¹ •
              W.neronTateGramMatrix b).det|
    **The normalised regulator is a volume**: on any basis `b` of `E(K)/E(K)_tors` it is the
    absolute determinant of the Gram matrix of the normalised height pairing
    `[K : ℚ]⁻¹ ⟨-, -⟩`. In particular it does not depend on the basis. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/Regulator.lean
    complete
    theorem WeierstrassCurve.Affine.normalizedRegulator_eq_canonicalHeight_div.{u_1}
      {K : Type u_1} [Field K] [NumberField K] [DecidableEq K]
      (W : WeierstrassCurve.Affine K) [WeierstrassCurve.IsElliptic W]
      (h : Module.finrank ℤ W.PointModTorsion = 1) {P : W.Point}
      (hP : ℤ ∙ (Submodule.torsion ℤ W.Point).mkQ P = ⊤) :
      W.normalizedRegulator = P.canonicalHeight / ↑(Module.finrank ℚ K)
    theorem WeierstrassCurve.Affine.normalizedRegulator_eq_canonicalHeight_div.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [DecidableEq K]
      (W : WeierstrassCurve.Affine K)
      [WeierstrassCurve.IsElliptic W]
      (h :
        Module.finrank ℤ W.PointModTorsion =
          1)
      {P : W.Point}
      (hP :
        ℤ ∙
            (Submodule.torsion ℤ W.Point).mkQ
              P =
          ⊤) :
      W.normalizedRegulator =
        P.canonicalHeight /
          ↑(Module.finrank ℚ K)
    **The rank-one case**: when `E(K)` has rank `1` and the class of `P` generates
    `E(K)/E(K)_tors`, the regulator is the normalised canonical height `ĥ(P) / [K : ℚ]` of `P`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/Regulator.lean
    complete
    theorem WeierstrassCurve.Affine.regulator_eq_pow_mul_normalizedRegulator.{u_1}
      {K : Type u_1} [Field K] [NumberField K] [DecidableEq K]
      (W : WeierstrassCurve.Affine K) [WeierstrassCurve.IsElliptic W] :
      W.regulator =
        ↑(Module.finrank ℚ K) ^ Module.finrank ℤ W.PointModTorsion *
          W.normalizedRegulator
    theorem WeierstrassCurve.Affine.regulator_eq_pow_mul_normalizedRegulator.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [DecidableEq K]
      (W : WeierstrassCurve.Affine K)
      [WeierstrassCurve.IsElliptic W] :
      W.regulator =
        ↑(Module.finrank ℚ K) ^
            Module.finrank ℤ
              W.PointModTorsion *
          W.normalizedRegulator
    **The Néron–Tate regulator is `[K : ℚ] ^ r` times the normalised one**:
    `Reg_NT(E/K) = [K : ℚ] ^ r Reg(E/K)`. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Arithmetic/CanonicalHeightBaseChange.lean
    complete
    theorem WeierstrassCurve.Affine.Point.canonicalHeight_mapAlong_div_finrank.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L]
      {W : WeierstrassCurve.Affine K} (P : W.Point) [NumberField K]
      [NumberField L] [DecidableEq K] [DecidableEq L]
      [WeierstrassCurve.IsElliptic W] :
      (WeierstrassCurve.Affine.Point.mapAlong (algebraMap K L) ⋯
              P).canonicalHeight /
          ↑(Module.finrank ℚ L) =
        P.canonicalHeight / ↑(Module.finrank ℚ K)
    theorem WeierstrassCurve.Affine.Point.canonicalHeight_mapAlong_div_finrank.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K]
      [Field L] [Algebra K L]
      {W : WeierstrassCurve.Affine K}
      (P : W.Point) [NumberField K]
      [NumberField L] [DecidableEq K]
      [DecidableEq L]
      [WeierstrassCurve.IsElliptic W] :
      (WeierstrassCurve.Affine.Point.mapAlong
              (algebraMap K L) ⋯
              P).canonicalHeight /
          ↑(Module.finrank ℚ L) =
        P.canonicalHeight /
          ↑(Module.finrank ℚ K)
    **The normalised canonical height `ĥ / [K : ℚ]` is invariant under base change** (LMFDB
    `ec.regulator`): for a finite extension `L / K` of number fields and a point `P` of `W(K)`,
    `ĥ_L(P) / [L : ℚ] = ĥ_K(P) / [K : ℚ]`. 
Definition4.1.109
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.24
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Elliptic curve over a ring. (LMFDB)

An elliptic curve over a commutative ring R is an elliptic scheme E \to \operatorname{Spec} R.

For example, an elliptic curve over \Z[1/N] is the same as an elliptic curve over \Q with good reduction at all primes not dividing N. (More precisely, the latter is the generic fiber of the former.)

Depends on: Definition 4.1.4 Definition 4.1.31 Definition 4.1.111 Definition 1.1.24

Definition4.1.110
uses 0used by 0XL∃∀N

Rouse label. (LMFDB)

The Rouse label associated with an elliptic curve is the label given to the modular curve parametrizing all elliptic curves whose 2-adic image is contained in some specific subgroup of \GL(2,\Z_2).

Definition4.1.111
uses 0used by 1XL∃∀N

Elliptic scheme. (LMFDB)

An elliptic scheme over a scheme S is a smooth proper morphism E \to S whose fibers are elliptic curves.

Definition4.1.112
Statement uses 6
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Semi-global minimal model. (LMFDB)

An elliptic curve E defined over a number field K of class number h(K) greater than 1 may not have a global minimal model. In this case there still exist semi-global minimal models for E which are local minimal models at all except one prime. At this prime, the discriminant valuation exceeds that of the minimal discriminant ideal by 12.

Depends on: Definition 4.1.4 Definition 4.1.19 Definition 4.1.49 Definition 4.1.53 Definition 5.1.1 Definition 5.1.7

Definition4.1.113
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 4.1.76
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Semistable elliptic curve. (LMFDB)

An elliptic curve is semistable if it has multiplicative reduction at every bad prime.

Tau Ceti Review: WeierstrassCurve.IsSemistable.

Depends on: Definition 4.1.4 Definition 4.1.7 Definition 4.1.107

Lean code for Definition4.1.113●6 declarations
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalModel/Semistable.lean
    complete
    def WeierstrassCurve.IsSemistable.{u_3, u_4} (O : Type u_3) [CommRing O]
      [IsDedekindDomain O] {F : Type u_4} [Field F] [Algebra O F]
      [IsFractionRing O F] (W : WeierstrassCurve F) [_hE : W.IsElliptic] :
      Prop
    def WeierstrassCurve.IsSemistable.{u_3, u_4}
      (O : Type u_3) [CommRing O]
      [IsDedekindDomain O] {F : Type u_4}
      [Field F] [Algebra O F]
      [IsFractionRing O F]
      (W : WeierstrassCurve F)
      [_hE : W.IsElliptic] : Prop
    **Semistability over a Dedekind domain**: at every height-one prime, a local minimal equation
    has no additive reduction. Equivalently, the reduction is good or multiplicative everywhere.
    
    The predicate is stated on an elliptic equation but depends only on its `F`-isomorphism class, as
    proved by `isSemistable_smul`. The ellipticity instance excludes singular cubics, which have no
    reduction type in the good/multiplicative/additive trichotomy of elliptic curves. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/SemistableNodal.lean
    complete
    theorem WeierstrassCurve.isSemistable_iff_forall_hasMultiplicativeReduction.{u_1,
        u_2}
      {O : Type u_1} [CommRing O] [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F] [IsFractionRing O F] (W : WeierstrassCurve F)
      [W.IsElliptic] :
      WeierstrassCurve.IsSemistable O W ↔
        ∀ (v : IsDedekindDomain.HeightOneSpectrum O),
          WeierstrassCurve.IsBadReduction (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal)
                W) →
            WeierstrassCurve.HasMultiplicativeReduction
              (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal) W)
    theorem WeierstrassCurve.isSemistable_iff_forall_hasMultiplicativeReduction.{u_1,
        u_2}
      {O : Type u_1} [CommRing O]
      [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F]
      [IsFractionRing O F]
      (W : WeierstrassCurve F)
      [W.IsElliptic] :
      WeierstrassCurve.IsSemistable O W ↔
        ∀
          (v :
            IsDedekindDomain.HeightOneSpectrum
              O),
          WeierstrassCurve.IsBadReduction
              (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal
                (Localization.AtPrime
                  v.asIdeal)
                W) →
            WeierstrassCurve.HasMultiplicativeReduction
              (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal
                (Localization.AtPrime
                  v.asIdeal)
                W)
    **An elliptic curve is semistable exactly when it has multiplicative reduction at every bad
    prime** (LMFDB `ec.semistable`, `ec.q.semistable`): at every height-one prime `v` at which a
    minimal equation over `Oᵥ` has bad reduction, it has multiplicative reduction. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/SemistableNodal.lean
    complete
    theorem WeierstrassCurve.isSemistable_iff_forall_hasNode.{u_1, u_2}
      {O : Type u_1} [CommRing O] [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F] [IsFractionRing O F] (W : WeierstrassCurve F)
      [W.IsElliptic] :
      WeierstrassCurve.IsSemistable O W ↔
        ∀ (v : IsDedekindDomain.HeightOneSpectrum O),
          WeierstrassCurve.IsBadReduction (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal)
                W) →
            (WeierstrassCurve.reduction (Localization.AtPrime v.asIdeal)
                (WeierstrassCurve.minimal (Localization.AtPrime v.asIdeal)
                  W)).HasNode
    theorem WeierstrassCurve.isSemistable_iff_forall_hasNode.{u_1,
        u_2}
      {O : Type u_1} [CommRing O]
      [IsDedekindDomain O] {F : Type u_2}
      [Field F] [Algebra O F]
      [IsFractionRing O F]
      (W : WeierstrassCurve F)
      [W.IsElliptic] :
      WeierstrassCurve.IsSemistable O W ↔
        ∀
          (v :
            IsDedekindDomain.HeightOneSpectrum
              O),
          WeierstrassCurve.IsBadReduction
              (Localization.AtPrime v.asIdeal)
              (WeierstrassCurve.minimal
                (Localization.AtPrime
                  v.asIdeal)
                W) →
            (WeierstrassCurve.reduction
                (Localization.AtPrime
                  v.asIdeal)
                (WeierstrassCurve.minimal
                  (Localization.AtPrime
                    v.asIdeal)
                  W)).HasNode
    **An elliptic curve is semistable exactly when its reduction at every bad prime has a node**
    (LMFDB `ec.semistable`, `ec.q.semistable`, `ec.reduction_type`). 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    def WeierstrassCurve.IsBadReduction.{u, v} (R : Type v) [CommRing R]
      [IsDomain R] [IsDiscreteValuationRing R] {K : Type u} [Field K]
      [Algebra R K] [IsFractionRing R K] (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] : Prop
    def WeierstrassCurve.IsBadReduction.{u, v}
      (R : Type v) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R] {K : Type u}
      [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K)
      [WeierstrassCurve.IsMinimal R W] : Prop
    A minimal Weierstrass curve over `K` has **bad reduction** (LMFDB `ec.bad_reduction`) if it
    does not have good reduction, i.e. its reduction over the residue field of `R` is singular. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.HasNode.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    def WeierstrassCurve.HasNode.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    A Weierstrass curve `W` over a field `F` has a **nodal singularity** (LMFDB
    `ec.multiplicative_reduction`, `ec.reduction_type`): over an algebraic closure of `F` it has a
    singular point with two distinct tangent slopes, that is, two distinct tangent lines. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasMultiplicativeReduction_iff_hasNode.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      {W : WeierstrassCurve K} [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasMultiplicativeReduction R W ↔
        (WeierstrassCurve.reduction R W).HasNode
    theorem WeierstrassCurve.hasMultiplicativeReduction_iff_hasNode.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      {W : WeierstrassCurve K}
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasMultiplicativeReduction
          R W ↔
        (WeierstrassCurve.reduction R
            W).HasNode
    **Multiplicative reduction is nodal reduction** (Silverman VII.5.1): a minimal equation has
    multiplicative reduction, Mathlib's `v(Δ) < 1` and `v(c₄) = 1`, exactly when its reduction has a
    node. 
Definition4.1.114
Statement uses 6
Statement dependency previews
Preview
Definition 1.1.27
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Simplified equation. (LMFDB)

Every elliptic curve over a field k whose characteristic is not 2 or 3 has a simplified equation (or short Weierstrass model) of the form y^2 = x^3 + Ax + B. When k=\mathbb{Q} is the field of rational numbers, one can choose A and B to be integers.

For elliptic curves over \Q this model will necessarily have bad reduction at 2, even when E has good reduction at 2; it may also bad reduction at 3 even when the minimal model of E does not.

Tau Ceti Review: WeierstrassCurve.IsShortNF, WeierstrassCurve.exists_minimalPairModel.

Depends on: Definition 4.1.4 Definition 4.1.7 Definition 4.1.31 Definition 4.1.86 Definition 1.1.27 Definition 1.1.30

Lean code for Definition4.1.114●6 declarations
  • class(3 methods)defined in Mathlib/AlgebraicGeometry/EllipticCurve/NormalForms.lean
    complete
    class WeierstrassCurve.IsShortNF.{u_1} {R : Type u_1} [CommRing R]
      (W : WeierstrassCurve R) : Prop
    class WeierstrassCurve.IsShortNF.{u_1}
      {R : Type u_1} [CommRing R]
      (W : WeierstrassCurve R) : Prop
    A `WeierstrassCurve` is in short normal form, if its `a₁, a₂, a₃ = 0`.
    In other words it is `Y² = X³ + a₄X + a₆`.
    
    This is the normal form of characteristic ≠ 2 or 3, and
    also the normal form of characteristic = 3 and j = 0. 
    a₁ : W.a₁ = 0
    a₂ : W.a₂ = 0
    a₃ : W.a₃ = 0
  • defdefined in Mathlib/AlgebraicGeometry/EllipticCurve/NormalForms.lean
    complete
    def WeierstrassCurve.toShortNF.{u_1} {R : Type u_1} [CommRing R]
      (W : WeierstrassCurve R) [Invertible 2] [Invertible 3] :
      WeierstrassCurve.VariableChange R
    def WeierstrassCurve.toShortNF.{u_1}
      {R : Type u_1} [CommRing R]
      (W : WeierstrassCurve R) [Invertible 2]
      [Invertible 3] :
      WeierstrassCurve.VariableChange R
    There is an explicit change of variables of a `WeierstrassCurve` to
    a short normal form, provided that 2 and 3 are invertible in the ring.
    It is the composition of an explicit change of variables with `WeierstrassCurve.toCharNeTwoNF`. 
  • theoremdefined in TauCeti/AlgebraicGeometry/EllipticCurve/MinimalPairModel.lean
    complete
    theorem WeierstrassCurve.exists_minimalPairModel (E : WeierstrassCurve ℚ)
      [E.IsElliptic] : Nonempty E.MinimalPairModel
    theorem WeierstrassCurve.exists_minimalPairModel
      (E : WeierstrassCurve ℚ)
      [E.IsElliptic] :
      Nonempty E.MinimalPairModel
    **Existence of a minimal-pair model**: every elliptic curve over `ℚ` is isomorphic over `ℚ`
    to the base change of a minimal-pair short equation over `ℤ`. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/ShortModelReduction.lean
    complete
    def WeierstrassCurve.HasBadReductionAt (W : WeierstrassCurve ℤ) (p : ℕ) :
      Prop
    def WeierstrassCurve.HasBadReductionAt
      (W : WeierstrassCurve ℤ) (p : ℕ) : Prop
    A Weierstrass equation `W` with integer coefficients has **bad reduction** at a prime `p`
    (LMFDB `ec.simple_equation`, `ec.bad_reduction`): its reduction modulo `p` is singular, that is,
    it has a singular point over `𝔽_p`. As `𝔽_p` is perfect, a singular point over an algebraic
    closure of `𝔽_p` is already one over `𝔽_p`. The equation need not be minimal. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/ShortModelReduction.lean
    complete
    theorem WeierstrassCurve.hasBadReductionAt_two_of_isShortNF
      {W : WeierstrassCurve ℤ} [W.IsShortNF] : W.HasBadReductionAt 2
    theorem WeierstrassCurve.hasBadReductionAt_two_of_isShortNF
      {W : WeierstrassCurve ℤ} [W.IsShortNF] :
      W.HasBadReductionAt 2
    **A short Weierstrass equation over `ℤ` has bad reduction at `2`** (LMFDB
    `ec.simple_equation`): its discriminant `-16 (4 A³ + 27 B²)` is even. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/ShortModelReduction.lean
    complete
    theorem WeierstrassCurve.hasBadReductionAt_three_minimalPairModel_curve11a2 :
      (TauCeti.WorkedExamples.curve11a2.baseChange
                ℚ).minimalPairModel.model.HasBadReductionAt
        3
    theorem WeierstrassCurve.hasBadReductionAt_three_minimalPairModel_curve11a2 :
      (TauCeti.WorkedExamples.curve11a2.baseChange
                ℚ).minimalPairModel.model.HasBadReductionAt
        3
    **The short equation over `ℤ` of 11.a2 has bad reduction at `3`** (LMFDB `ec.simple_equation`):
    the minimal-pair equation `y² = x³ - 13392 x - 1080432` of 11.a2 has discriminant `-6¹² ⋅ 11⁵`,
    although the minimal equation of 11.a2 has good reduction at `3`. 
Definition4.1.115
Statement uses 6
Statement dependency previews
Preview
Definition 2.7
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Special value of an elliptic curve L-function. (LMFDB)

The special value of an elliptic curve E defined over a number field K is the first nonzero value of L^{(r)}(E,1)/r! for r\in \Z_{\ge 0}, where L(E/K,s) is the L-function of E in its arithmetic normalization. It is also known as the leading coefficient of the L-function.

The special value appears in the Birch and Swinnerton-Dyer conjecture.

Depends on: Definition 4.1.4 Definition 4.1.9 Definition 2.7 Definition 2.45 Definition 2.47 Definition 5.1.1

Definition4.1.116
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.1.7
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Split multiplicative reduction. (LMFDB)

An elliptic curve E defined over a number field K is said to have split multiplicative reduction at a prime \mathfrak{p} of K if the reduction of E modulo \mathfrak{p} has a nodal singularity with both tangent slopes defined over the residue field at \mathfrak{p}.

Tau Ceti Review: WeierstrassCurve.HasSplitMultiplicativeReduction.

Depends on: Definition 4.1.4 Definition 5.1.1

Lean code for Definition4.1.116●6 declarations
  • class(extends 2, 4 methods)defined in Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean
    complete
    class WeierstrassCurve.HasSplitMultiplicativeReduction.{u_1, u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      (W : WeierstrassCurve K) : Prop
    class WeierstrassCurve.HasSplitMultiplicativeReduction.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      (W : WeierstrassCurve K) : Prop
    A minimal Weierstrass equation has split multiplicative reduction if and only if
    the polynomial `c₄ T ^ 2 + a₁ c₄ T - (54 b₆ - 3 b₂ b₄ + a₂ c₄)` splits in the residue field.
    
    To see how this expression arises, note that the node `(x₀, y₀)` has second order Taylor expansion
    `(Y - y₀)^2 + a_1(X - x₀)(Y - y₀) - (3x₀ + a_2)(X - x₀)^2` where `x₀ = (18 b₆ - b₂ b₄) / c₄`. 
    • WeierstrassCurve.HasMultiplicativeReduction R W
    val_Δ_maximal : MaximalFor (fun C => WeierstrassCurve.IsIntegral R (C • W)) (fun C => WeierstrassCurve.valuation_Δ_aux R (C • W)) 1
    Inherited from
    1. WeierstrassCurve.HasMultiplicativeReduction
    2. WeierstrassCurve.IsMinimal
    badReduction : (IsDedekindDomain.HeightOneSpectrum.valuation K (IsDiscreteValuationRing.maximalIdeal R)) W.Δ < 1
    Inherited from
    1. WeierstrassCurve.HasMultiplicativeReduction
    multiplicativeReduction : (IsDedekindDomain.HeightOneSpectrum.valuation K (IsDiscreteValuationRing.maximalIdeal R)) W.c₄ = 1
    Inherited from
    1. WeierstrassCurve.HasMultiplicativeReduction
    splitMultiplicativeReduction : (Polynomial.map (algebraMap R (IsLocalRing.ResidueField R))
        (Polynomial.C (WeierstrassCurve.integralModel R W).c₄ * Polynomial.X ^ 2 +
            Polynomial.C ((WeierstrassCurve.integralModel R W).a₁ * (WeierstrassCurve.integralModel R W).c₄) *
              Polynomial.X -
          Polynomial.C
            (54 * (WeierstrassCurve.integralModel R W).b₆ -
                3 * (WeierstrassCurve.integralModel R W).b₂ * (WeierstrassCurve.integralModel R W).b₄ +
              (WeierstrassCurve.integralModel R W).a₂ * (WeierstrassCurve.integralModel R W).c₄))).Splits
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.HasSplitNode.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    def WeierstrassCurve.HasSplitNode.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve F) : Prop
    A Weierstrass curve `W` over a field `F` has a **nodal singularity with both tangent slopes
    defined over `F`** (LMFDB `ec.split_multiplicative_reduction`): a singular point over `F` with two
    distinct tangent slopes in `F`. A node has only two tangent slopes, so these are both of them. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    def WeierstrassCurve.Affine.IsTangentSlope.{u_1} {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F) (x₀ y₀ m : F) : Prop
    def WeierstrassCurve.Affine.IsTangentSlope.{u_1}
      {F : Type u_1} [Field F]
      (W : WeierstrassCurve.Affine F)
      (x₀ y₀ m : F) : Prop
    A **tangent slope** of a Weierstrass curve `W` at a singular point `(x₀, y₀)` (LMFDB
    `ec.split_multiplicative_reduction`): the line `y - y₀ = m (x - x₀)` meets the curve at `(x₀, y₀)`
    with multiplicity at least `3`, that is, `t³` divides the Weierstrass polynomial restricted to the
    line `t ↦ (x₀ + t, y₀ + m t)`. A singular point is a double point: every line through it meets the
    curve there with multiplicity at least `2`, and the tangent lines are those meeting it with higher
    multiplicity. The predicate is only used at singular points: at a nonsingular point the tangent
    line meets the curve with multiplicity at least `2`, and at least `3` only at a flex. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.hasSplitMultiplicativeReduction_iff_hasSplitNode.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R] [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K]
      {W : WeierstrassCurve K} [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasSplitMultiplicativeReduction R W ↔
        (WeierstrassCurve.reduction R W).HasSplitNode
    theorem WeierstrassCurve.hasSplitMultiplicativeReduction_iff_hasSplitNode.{u_1,
        u_2}
      (R : Type u_1) [CommRing R] [IsDomain R]
      [IsDiscreteValuationRing R]
      {K : Type u_2} [Field K] [Algebra R K]
      [IsFractionRing R K]
      {W : WeierstrassCurve K}
      [WeierstrassCurve.IsMinimal R W] :
      WeierstrassCurve.HasSplitMultiplicativeReduction
          R W ↔
        (WeierstrassCurve.reduction R
            W).HasSplitNode
    **Split multiplicative reduction is reduction with a node whose tangent slopes are defined over
    the residue field**: Mathlib's condition that the node polynomial of the integral model splits
    over the residue field is that both tangent slopes at the node of the reduction lie in it. 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.HasSplitNode.hasNode.{u_1} {F : Type u_1} [Field F]
      {W : WeierstrassCurve F} (h : W.HasSplitNode) : W.HasNode
    theorem WeierstrassCurve.HasSplitNode.hasNode.{u_1}
      {F : Type u_1} [Field F]
      {W : WeierstrassCurve F}
      (h : W.HasSplitNode) : W.HasNode
    **A node with both tangent slopes defined over the base field is a node.** 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/NodeCusp.lean
    complete
    theorem WeierstrassCurve.Affine.nodePolynomial_eq_of_isSingular.{u_1}
      {F : Type u_1} [Field F] {W : WeierstrassCurve.Affine F} {x₀ y₀ : F}
      (h : W.IsSingular x₀ y₀) :
      WeierstrassCurve.nodePolynomial W =
        Polynomial.C (WeierstrassCurve.c₄ W) *
          (Polynomial.C 1 * Polynomial.X ^ 2 +
              Polynomial.C W.a₁ * Polynomial.X +
            Polynomial.C (-(3 * x₀ + W.a₂)))
    theorem WeierstrassCurve.Affine.nodePolynomial_eq_of_isSingular.{u_1}
      {F : Type u_1} [Field F]
      {W : WeierstrassCurve.Affine F}
      {x₀ y₀ : F} (h : W.IsSingular x₀ y₀) :
      WeierstrassCurve.nodePolynomial W =
        Polynomial.C (WeierstrassCurve.c₄ W) *
          (Polynomial.C 1 * Polynomial.X ^ 2 +
              Polynomial.C W.a₁ *
                Polynomial.X +
            Polynomial.C (-(3 * x₀ + W.a₂)))
    **The node polynomial is `c₄` times the tangent polynomial at a singular point**: if `(x₀, y₀)`
    is singular, Tau Ceti's `WeierstrassCurve.nodePolynomial`, the polynomial of Mathlib's
    `WeierstrassCurve.HasSplitMultiplicativeReduction`, is `c₄ (T² + a₁ T - (3 x₀ + a₂))`. 
Definition4.1.117
Statement uses 3
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 4.1.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Tamagawa number. (LMFDB)

The Tamagawa number of an elliptic curve E defined over a number field at a prime \mathfrak{p} of K is the index [E(K_{\mathfrak{p}}):E^0(K_{\mathfrak{p}})], where K_{\mathfrak{p}} is the completion of K at \mathfrak{p} and E^0(K_{\mathfrak{p}}) is the subgroup of E(K_{\mathfrak{p}}) consisting of all points whose reduction modulo \mathfrak{p} is smooth.

The Tamagawa number of E at \mathfrak{p} is usually denoted c_{\mathfrak{p}}(E). It is a positive integer, and equal to 1 if E has good reduction at \mathfrak{p} and may be computed in general using Tate's algorithm.

The product of the Tamagawa numbers over all primes is a positive integer known as the Tamagawa product.

Depends on: Definition 4.1.4 Definition 4.1.31 Definition 5.1.1

Definition4.1.118
Statement uses 4
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 4.1.69
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Torsion order of an elliptic curve. (LMFDB)

The torsion order of an elliptic curve E over a field K is the order of the torsion subgroup E(K)_{\text{tor}} of its Mordell-Weil group E(K).

The torsion subgroup E(K)_{\text{tor}} is the set of all points on E with coordinates in K having finite order in the group E(K). When K is a number field (for example, when K=\Q) it is a finite set, since by the Mordell-Weil Theorem, E(K) is finitely generated.

When K=\Q the torsion order n satisfies n\le16, by a theorem of Mazur.

Depends on: Definition 4.1.4 Definition 4.1.54 Definition 4.1.55 Definition 4.1.119

Definition4.1.119
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.54
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Definition 4.1.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Torsion subgroup of an elliptic curve. (LMFDB)

For an elliptic curve E over a field K, the torsion subgroup of E over K is the subgroup E(K)_{\text{tor}} of the Mordell-Weil group E(K) consisting of points of finite order. For a number field K this is always a finite group, since by the Mordell-Weil Theorem E(K) is finitely generated.

The torsion subgroup is always either cyclic or a product of two cyclic groups. The torsion structure is the list of invariants of the group:

  • [] for the trivial group;

  • [n] for a cyclic group of order n>1;

  • [n_1,n_2] with n_1\mid n_2 for a product of non-trivial cyclic groups of orders n_1 and n_2.

For K=\Q the possible torsion structures are [n] for n\le10 and n=12, and [2,2n] for n=1,2,3,4.

Tau Ceti Review: AddCommGroup.torsion.

Depends on: Definition 4.1.54 Definition 4.1.55

Lean code for Definition4.1.119●1 definition
  • defdefined in Mathlib/GroupTheory/Torsion.lean
    complete
    def AddCommGroup.torsion.{u_1} (G : Type u_1) [AddCommGroup G] :
      AddSubgroup G
    def AddCommGroup.torsion.{u_1} (G : Type u_1)
      [AddCommGroup G] : AddSubgroup G
    The torsion additive subgroup of an additive abelian group. 
Definition4.1.120
Statement uses 6
Statement dependency previews
Preview
Definition 1.1.27
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Twists of elliptic curves. (LMFDB)

A twist of an elliptic curve E defined over a field K is another elliptic curve E', also defined over K, which is isomorphic to E over the algebraic closure of K.

Two elliptic curves are twists if an only if they have the same j-invariant.

For elliptic curves E with j(E)\not=0, 1728, the only twists of E are its quadratic twists E^{(d)}. Provided that the characteristic of K is not 2, the nontrivial quadratic twists of E are in bijection with the nontrivial elements d of K^*/(K^*)^2, and E^{(d)} is isomorphic to E over the quadratic extension K(\sqrt{d}).

Over fields of characteristic not 2 or 3, elliptic curves with j-invariant 1728 also admit quartic twists, parametrised by K^*/(K^*)^4, and elliptic curves with j-invariant 0 also admit sextic twists, parametrised by K^*/(K^*)^6. Elliptic curves E over fields K of characteristic 2 and 3 with j(E)=0=1728 have nonabelian automorphism groups, and their twists are more complicated to describe, being in all cases parametrised by H^1(\Gal(\overline{K}/K), \Aut(E)).

Elliptic curve twists are a special case of twists of abelian varieties.

Tau Ceti Review: WeierstrassCurve.quadraticTwist, WeierstrassCurve.VariableChange.twistCohomologyClass.

Depends on: Definition 4.9.22 Definition 4.1.4 Definition 4.1.43 Definition 4.2.5 Definition 1.1.27 Definition 1.1.30

Lean code for Definition4.1.120●8 declarations
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Twist/Basic.lean
    complete
    def WeierstrassCurve.IsTwist.{u_1} {K : Type u_1} [Field K]
      (W W' : WeierstrassCurve K) : Prop
    def WeierstrassCurve.IsTwist.{u_1}
      {K : Type u_1} [Field K]
      (W W' : WeierstrassCurve K) : Prop
    A Weierstrass curve `W'` over a field `K` is a **twist** (LMFDB `ec.twists`) of `W` if it is
    isomorphic to `W` over an algebraic closure `K̄` of `K`: a change of variables over `K̄` carries
    `W` to `W'`. Two elliptic curves are twists of each other exactly when they have the same
    `j`-invariant (`isTwist_iff_j_eq`). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Twist/Basic.lean
    complete
    theorem WeierstrassCurve.isTwist_iff_j_eq.{u_1} {K : Type u_1} [Field K]
      {W W' : WeierstrassCurve K} [W.IsElliptic] [W'.IsElliptic] :
      W.IsTwist W' ↔ W.j = W'.j
    theorem WeierstrassCurve.isTwist_iff_j_eq.{u_1}
      {K : Type u_1} [Field K]
      {W W' : WeierstrassCurve K}
      [W.IsElliptic] [W'.IsElliptic] :
      W.IsTwist W' ↔ W.j = W'.j
    **Two elliptic curves are twists of each other exactly when they have the same
    `j`-invariant**: over the algebraically closed field `K̄`, curves with the same `j`-invariant are
    isomorphic. 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/QuadraticTwist/Basic.lean
    complete
    def WeierstrassCurve.quadraticTwist.{u_1, u_3} {K : Type u_1} [Field K]
      (E : WeierstrassCurve K) (L : Type u_3) [Field L] [Algebra K L]
      [Algebra.IsQuadraticExtension K L] [Algebra.IsSeparable K L] :
      WeierstrassCurve K
    def WeierstrassCurve.quadraticTwist.{u_1, u_3}
      {K : Type u_1} [Field K]
      (E : WeierstrassCurve K) (L : Type u_3)
      [Field L] [Algebra K L]
      [Algebra.IsQuadraticExtension K L]
      [Algebra.IsSeparable K L] :
      WeierstrassCurve K
    **The quadratic twist of `E` by the separable quadratic extension `L/K`**: the twist by the
    trace and norm of a generator of `L/K`. The choice of generator is harmless —
    `exists_quadraticTwist_eq` names one, and `exists_smul_quadraticTwist_eq` says every other gives
    the same curve up to a change of variables over `K`.
    
    Separability is not decoration. On a purely inseparable quadratic extension the trace form
    vanishes, so `t = 0` and — in characteristic `2`, the only characteristic where such an extension
    exists — the discriminant `D = t² - 4n` is `0`, and the model is singular for every `E` and
    barely depends on `E`. This is a different failure from the one the module docstring gives for
    refusing a twist-by-a-generator constructor, which is `(t, n) = (0, 1)` and so `D = -4`: there
    the parameters cease to reflect the extension but the twist stays generically nonsingular. The
    two coincide only in characteristic `2`. Choosing the generator by
    `Algebra.IsQuadraticExtension.exists_discrim_ne_zero` rules this case out, so the *twist
    parameters* never degenerate. That is all it can rule out: `E` is arbitrary here, so a singular
    `E` still gives a singular twist. Nonsingularity of the result needs `E` elliptic too, which is
    `isElliptic_quadraticTwist`. 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Twist/QuarticSextic.lean
    complete
    def WeierstrassCurve.quarticTwist.{u_1} {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) (D : K) : WeierstrassCurve K
    def WeierstrassCurve.quarticTwist.{u_1}
      {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) (D : K) :
      WeierstrassCurve K
    The **quartic twist** (LMFDB `ec.twists`) of a Weierstrass curve `W` by `D`: the curve
    `y² = x³ - 27 c₄ D x`. Over a field of characteristic not `2` or `3`, the curve
    `y² = x³ - 27 c₄ x - 54 c₆` is a model of `W`, so when `j(W) = 1728`, that is `c₆ = 0`, the quartic
    twist by `1` is a model of `W`. The quartic twists of such a `W` by `D ≠ 0` are then its twists,
    parametrised by `K*/(K*)⁴` (`exists_smul_quarticTwist_eq_quarticTwist_iff`). 
  • defdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Twist/QuarticSextic.lean
    complete
    def WeierstrassCurve.sexticTwist.{u_1} {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) (D : K) : WeierstrassCurve K
    def WeierstrassCurve.sexticTwist.{u_1}
      {K : Type u_1} [Field K]
      (W : WeierstrassCurve K) (D : K) :
      WeierstrassCurve K
    The **sextic twist** (LMFDB `ec.twists`) of a Weierstrass curve `W` by `D`: the curve
    `y² = x³ - 54 c₆ D`. Over a field of characteristic not `2` or `3`, the curve
    `y² = x³ - 27 c₄ x - 54 c₆` is a model of `W`, so when `j(W) = 0`, that is `c₄ = 0`, the sextic
    twist by `1` is a model of `W`. The sextic twists of such a `W` by `D ≠ 0` are then its twists,
    parametrised by `K*/(K*)⁶` (`exists_smul_sexticTwist_eq_sexticTwist_iff`). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Twist/AutJZero.lean
    complete
    theorem WeierstrassCurve.exists_mul_ne_mul_autGroup_of_charTwo.{u_1}
      {K : Type u_1} [Field K] (E : WeierstrassCurve K) [IsAlgClosed K]
      [E.IsElliptic] [CharP K 2] (hj : E.j = 0) :
      ∃ C ∈ E.autGroup, ∃ D ∈ E.autGroup, C * D ≠ D * C
    theorem WeierstrassCurve.exists_mul_ne_mul_autGroup_of_charTwo.{u_1}
      {K : Type u_1} [Field K]
      (E : WeierstrassCurve K) [IsAlgClosed K]
      [E.IsElliptic] [CharP K 2]
      (hj : E.j = 0) :
      ∃ C ∈ E.autGroup,
        ∃ D ∈ E.autGroup, C * D ≠ D * C
    **In characteristic `2`, the automorphism group of an elliptic curve with `j = 0` over an
    algebraically closed field is nonabelian** (LMFDB `ec.twists`). 
  • theoremdefined in LeanBridge/ForMathlib/AlgebraicGeometry/EllipticCurve/Twist/AutJZero.lean
    complete
    theorem WeierstrassCurve.exists_mul_ne_mul_autGroup_of_charThree.{u_1}
      {K : Type u_1} [Field K] (E : WeierstrassCurve K) [IsAlgClosed K]
      [E.IsElliptic] [CharP K 3] (hj : E.j = 0) :
      ∃ C ∈ E.autGroup, ∃ D ∈ E.autGroup, C * D ≠ D * C
    theorem WeierstrassCurve.exists_mul_ne_mul_autGroup_of_charThree.{u_1}
      {K : Type u_1} [Field K]
      (E : WeierstrassCurve K) [IsAlgClosed K]
      [E.IsElliptic] [CharP K 3]
      (hj : E.j = 0) :
      ∃ C ∈ E.autGroup,
        ∃ D ∈ E.autGroup, C * D ≠ D * C
    **In characteristic `3`, the automorphism group of an elliptic curve with `j = 0` over an
    algebraically closed field is nonabelian** (LMFDB `ec.twists`). 
  • defdefined in TauCeti/AlgebraicGeometry/EllipticCurve/Twist/Cocycle.lean
    complete
    def WeierstrassCurve.VariableChange.twistCohomologyClass.{u_1, u_2}
      {K : Type u_1} [Field K] {W : WeierstrassCurve K} {L : Type u_2}
      [Field L] [Algebra K L] {V : WeierstrassCurve K}
      [Algebra.IsAlgebraic K L] (C : WeierstrassCurve.VariableChange L)
      (hC : C • V.baseChange L = W.baseChange L) :
      TauCeti.NonabelianH1 Gal(L/K) (W.AutCoeff L)
    def WeierstrassCurve.VariableChange.twistCohomologyClass.{u_1,
        u_2}
      {K : Type u_1} [Field K]
      {W : WeierstrassCurve K} {L : Type u_2}
      [Field L] [Algebra K L]
      {V : WeierstrassCurve K}
      [Algebra.IsAlgebraic K L]
      (C : WeierstrassCurve.VariableChange L)
      (hC :
        C • V.baseChange L = W.baseChange L) :
      TauCeti.NonabelianH1 Gal(L/K)
        (W.AutCoeff L)
    The nonabelian cohomology class associated to a pointed trivialisation. 
Definition4.1.121
uses 1
Used by 14
Reverse dependency previews
Preview
Definition 4.1.16
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Weierstrass equation or model. (LMFDB)

A Weierstrass equation or Weierstrass model over a field k is a plane curve E of the form

y^2 + a_1xy + a_3y = x^3 + a_2 x^2 + a_4 x + a_6,

with a_1, a_2, a_3, a_4, a_6 \in k.

The Weierstrass coefficients of this model E are the five coefficients a_i. These are often displayed as a list [a_1, a_2, a_3, a_4, a_6].

It is common not to distinguish between the affine curve defined by a Weierstrass equation and its projective closure, which contains exactly one additional point at infinity, [0:1:0].

A Weierstrass model is smooth if and only if its discriminant \Delta is nonzero. In this case, the plane curve E together with the point at infinity as base point, define an elliptic curve defined over k.

Two smooth Weierstrass models define isomorphic elliptic curves if and only if they are isomorphic as Weierstrass models.

Tau Ceti Review: WeierstrassCurve.

Depends on: Definition 4.1.4

Lean code for Definition4.1.121●1 definition
  • structure(5 fields)defined in Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean
    complete
    structure WeierstrassCurve.{u} (R : Type u) : Type u
    structure WeierstrassCurve.{u} (R : Type u) : Type u
    A Weierstrass curve `Y² + a₁XY + a₃Y = X³ + a₂X² + a₄X + a₆` with parameters `aᵢ`. 
    a₁ : R
    The `a₁` coefficient of a Weierstrass curve. 
    a₂ : R
    The `a₂` coefficient of a Weierstrass curve. 
    a₃ : R
    The `a₃` coefficient of a Weierstrass curve. 
    a₄ : R
    The `a₄` coefficient of a Weierstrass curve. 
    a₆ : R
    The `a₆` coefficient of a Weierstrass curve. 
Definition4.1.122
Statement uses 2
Statement dependency previews
Preview
Definition 4.1.41
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Isomorphism between Weierstrass models. (LMFDB)

Two Weierstrass models E, E' over a field K with Weierstrass coefficients [a_1,a_2,a_3,a_4,a_6] and [a'_1,a'_2,a'_3,a'_4,a'_6] are isomorphic over K if there exist u\in K^* and r,s,t\in K such that

\begin{aligned} u a_1' &= a_1+2s, \\ u^2a_2' &= a_2-sa_1+3r-s^2, \\ u^3a_3' &= a_3+ra_1+2t, \\ u^4a_4' &= a_4-sa_3+2ra_2-(t+rs)a_1+3r^2-2st, \\ u^6a_6' &= a_6+ra_4+r^2a_2+r^3-ta_3-t^2-rta_1. \\ \end{aligned}

The set of transformations with parameters [u,r,s,t]\in K^*\times K^3 form the group of Weierstrass isomorphisms, which acts on both the set of all Weierstrass models over K and also on the subset of smooth models, preserving the point at infinity. The discriminants \Delta, \Delta' of the two models are related by

u^{12}\Delta' = \Delta.

In the smooth case such a Weierstrass isomorphism [u,r,s,t] induces an isomorphism between the two elliptic curves E, E' they define. In terms of affine coordinates this is given by

(x,y) \mapsto (x',y')

where

\begin{aligned} x &= u^2x' + r \\ y &= u^3y' + su^2x' + t \\ \end{aligned}

Tau Ceti Review: WeierstrassCurve.VariableChange.

Depends on: Definition 4.1.41 Definition 4.1.121

Lean code for Definition4.1.122●1 definition
  • structure(4 fields)defined in Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean
    complete
    structure WeierstrassCurve.VariableChange.{u} (R : Type u) [CommRing R] : Type u
    structure WeierstrassCurve.VariableChange.{u}
      (R : Type u) [CommRing R] : Type u
    An admissible linear change of variables of Weierstrass curves defined over a ring `R` given by
    a tuple `(u, r, s, t)` for some `u` in `Rˣ` and some `r, s, t` in `R`. As a matrix, it is
    $$\begin{pmatrix} u^2 & 0 & r \cr u^2s & u^3 & t \cr 0 & 0 & 1 \end{pmatrix}.$$
    In other words, this is the change of variables `(X, Y) ↦ (u²X + r, u³Y + u²sX + t)`.
    When `R` is a field, any two isomorphic Weierstrass equations are related by this. 
    u : Rˣ
    The `u` coefficient of an admissible linear change of variables, which must be a unit. 
    r : R
    The `r` coefficient of an admissible linear change of variables. 
    s : R
    The `s` coefficient of an admissible linear change of variables. 
    t : R
    The `t` coefficient of an admissible linear change of variables. 
Definition4.1.123
Statement uses 5
Statement dependency previews
Preview
Definition 4.1.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Pictures for elliptic curves over number fields. (LMFDB)

For each elliptic curve E over a number field K, the plot displayed consists of the graphs of the real points of E with respect to each real embedding of K. Complex embeddings of K are ignored, so for example there is no plot shown when K is a totally complex field such as an imaginary quadratic field.

The plots are produced using SageMath, which uses plotting logic designed by David Roe to determine which subset of E(\mathbb{R}) in the real affine plane to include in the plot.

Tau Ceti Review: NumberField.IsTotallyComplex, NumberField.isTotallyComplex_of_minpoly_eq_X_sq_sub_C_of_neg, NumberField.isTotallyComplex_of_sq_ratCast_of_neg, NumberField.IsTotallyComplex.nrRealPlaces_eq_zero.

Depends on: Definition 4.1.4 Definition 5.1.1 Definition 5.1.10 Definition 5.1.69 Definition 5.1.85

Lean code for Definition4.1.123●6 declarations
  • class(1 method)defined in Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean
    complete
    class NumberField.IsTotallyComplex.{u_1} (K : Type u_1) [Field K] : Prop
    class NumberField.IsTotallyComplex.{u_1}
      (K : Type u_1) [Field K] : Prop
    A field `K` is totally complex if all of its infinite places are complex.
    
    isComplex : ∀ (v : NumberField.InfinitePlace K), v.IsComplex
  • theoremdefined in TauCeti/NumberTheory/NumberField/Quadratic/InfinitePlace.lean
    complete
    theorem NumberField.isTotallyComplex_of_minpoly_eq_X_sq_sub_C_of_neg.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {θ : NumberField.RingOfIntegers K} {d : ℤ}
      (hmin : minpoly ℤ θ = Polynomial.X ^ 2 - Polynomial.C d)
      (hd : d < 0) : NumberField.IsTotallyComplex K
    theorem NumberField.isTotallyComplex_of_minpoly_eq_X_sq_sub_C_of_neg.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {θ : NumberField.RingOfIntegers K}
      {d : ℤ}
      (hmin :
        minpoly ℤ θ =
          Polynomial.X ^ 2 - Polynomial.C d)
      (hd : d < 0) :
      NumberField.IsTotallyComplex K
    **An imaginary quadratic field is totally complex.** Any number field `K` containing an
    algebraic integer `θ` with `minpoly ℤ θ = X² - d` and `d < 0` is totally complex — in particular the
    imaginary quadratic field `ℚ(√d)`. 
  • theoremdefined in TauCeti/NumberTheory/NumberField/InfinitePlace/Basic.lean
    complete
    theorem NumberField.isTotallyComplex_of_sq_ratCast_of_neg.{u_1} {K : Type u_1}
      [Field K] [Algebra ℚ K] {x : K} {r : ℚ}
      (hx2 : x ^ 2 = (algebraMap ℚ K) r) (hr : r < 0) :
      NumberField.IsTotallyComplex K
    theorem NumberField.isTotallyComplex_of_sq_ratCast_of_neg.{u_1}
      {K : Type u_1} [Field K] [Algebra ℚ K]
      {x : K} {r : ℚ}
      (hx2 : x ^ 2 = (algebraMap ℚ K) r)
      (hr : r < 0) :
      NumberField.IsTotallyComplex K
    **A field with a negative square is totally complex.** If some `x : K` has `x² = r` for a
    negative rational `r`, then every infinite place of `K` is complex. 
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean
    complete
    theorem NumberField.IsTotallyComplex.complexEmbedding_not_isReal.{u_2}
      {K : Type u_2} [Field K] [NumberField.IsTotallyComplex K]
      (φ : K →+* ℂ) : ¬NumberField.ComplexEmbedding.IsReal φ
    theorem NumberField.IsTotallyComplex.complexEmbedding_not_isReal.{u_2}
      {K : Type u_2} [Field K]
      [NumberField.IsTotallyComplex K]
      (φ : K →+* ℂ) :
      ¬NumberField.ComplexEmbedding.IsReal φ
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean
    complete
    theorem NumberField.IsTotallyComplex.nrRealPlaces_eq_zero.{u_2} (K : Type u_2)
      [Field K] [NumberField K] [h : NumberField.IsTotallyComplex K] :
      NumberField.InfinitePlace.nrRealPlaces K = 0
    theorem NumberField.IsTotallyComplex.nrRealPlaces_eq_zero.{u_2}
      (K : Type u_2) [Field K] [NumberField K]
      [h : NumberField.IsTotallyComplex K] :
      NumberField.InfinitePlace.nrRealPlaces
          K =
        0
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
    complete
    theorem NumberField.InfinitePlace.card_real_embeddings.{u_1} (K : Type u_1)
      [Field K] [NumberField K] :
      Fintype.card { φ // NumberField.ComplexEmbedding.IsReal φ } =
        NumberField.InfinitePlace.nrRealPlaces K
    theorem NumberField.InfinitePlace.card_real_embeddings.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Fintype.card
          { φ //
            NumberField.ComplexEmbedding.IsReal
              φ } =
        NumberField.InfinitePlace.nrRealPlaces
          K
Definition4.1.124
Statement uses 10
Statement dependency previews
Preview
Definition 3.3.8
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Completeness of elliptic curve data. (LMFDB)

Imaginary quadratic fields Over each imaginary quadratic number field of absolute discriminant less than 700, the database contains elliptic curves of conductor norm up to a bound that depends on the field, corresponding to the level norm bound for Bianchi modular forms over that field. <!--- <table> <tr> <th>Discriminant<td>-3<td>-4<td>-7<td>-8<td>-11<td>-19<td>-43<td>-67<td>-163<td>-23<td>-31 </tr> <th>Bound<td>150000<td>100000<td>50000<td>50000<td>50000<td>15000<td>15000<td>10000<td>5000<td>2000<td>5000 </tr> </table> ---> Within these bounds the database contains all *modular* elliptic curves; however, modularity has not yet been proved for elliptic curves over imaginary quadratic fields in general, and non-modular curves (if any exist) are not in the database. Assuming modularity, the database is complete within these bounds, by comparison with the database of Bianchi modular forms.

In addition the database contains a small number of elliptic curves with everywhere good reduction defined over some other imaginary quadratic fields.

Totally real fields The database contains elliptic curves defined over totally real fields of degree 2, 3, 4, 5 and 6. For each field the database contains curves of conductor norm up to a bound which depends on the field. Over totally real fields of degree 2 and 3, it is known that all elliptic curves are modular, and hence the database is complete for these fields, by comparison with the database of Hilbert Modular Forms. In higher degrees the database contains elliptic curves matching each of the Hilbert Modular Forms (of parallel weight 2, trivial character and rational coefficients) over the field in question, for fields of degree up to 6, and hence contains all modular elliptic curves of conductor norm up to the bound for that field.

Other fields The only other field for which the database contains elliptic curves is the mixed signature cubic field 3.1.23.1. The elliptic curves here have conductor norm up to 20000 and match automorphic forms over this field. No results on modularity are known for this field, but the curves in the database include all modular curves within these bounds.

For the complete list of fields over which the database contains elliptic curves, the numbers of curves and isogeny classes, and the bounds on the conductor norms in each case, see this page.

Depends on: Definition 4.1.31 Definition 4.1.35 Definition 4.1.36 Definition 3.3.8 Definition 5.1.1 Definition 5.1.14 Definition 5.1.17 Definition 5.1.81 Definition 5.1.87 Definition 3.4.18

Definition4.1.125
Statement uses 15
Statement dependency previews
Preview
Definition 2.7
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Reliability of elliptic curve data. (LMFDB)

The reliability of the completeness claims for the elliptic curves over each number field represented in the database depends on the field and the current status of modularity of elliptic curves over the field in question. Over all totally real fields of degree 2 and 3, and most of degree 4, it is known that all elliptic curves are modular (see for degree 2, for degree 3 and for degree 4) and hence the database contains all curves of conductor norm up to the bound for that field. Over other fields we can only say that the database contains all *modular* elliptic curves within this range. Over totally real fields of degrees 4, 5 and 6 all the curves in the database have been proved to be modular, using the criteria of , and over imaginary quadratic fields of class number 1, all the curves in the database have also been proved to be modular using the 2-adic Faltings-Serre method or its 3-adic analogue.

All the data for each individual elliptic curve has been computed rigorously with no unproved conjectures or assumptions being used, except for some of the BSD invariants:

  • the analytic rank and special L-value were computed using either the Magma function <tt>AnalyticRank()</tt>, which assumes that the L-function satisfies the Hasse-Weil conjecture and computes successive derivatives at the critial point to a fixed precision until it finds a non-zero value; or using the pari library's <tt>lfun</tt> function. This assumption on the Hasse-Weil conjecture is satisfied by all the elliptic curves in the database which are known to be modular.

  • the analytic order of \Sha was in all cases computed approximately from its definition, given by the BSD formula, and rounded to the nearest integer; in all cases this is a positive integer square.

  • the heights of generators, regulators, and periods have been computed to 128-bit precision in all cases (with the regulator being exactly 1 for curves of rank 0).

  • the special L-value and analytic order of \Sha have been computed to the same precision over fields of degree 2 and 3, and to lower precision over fields of higher degree.

Depends on: Definition 4.1.4 Definition 4.1.6 Definition 4.1.9 Definition 4.1.10 Definition 4.1.35 Definition 4.1.62 Definition 4.1.108 Definition 4.2.27 Definition 2.7 Definition 2.9 Definition 2.45 Definition 5.1.1 Definition 5.1.7 Definition 5.1.14 Definition 5.1.87

Definition4.1.126
Statement uses 28
Statement dependency previews
Preview
Definition 1.2.41
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Reliability of elliptic curve data over \Q. (LMFDB)

Completeness of the collection

All elliptic curves defined over \mathbb{Q} are known to be modular, and hence arise (up to isogeny) via the Eichler-Shimura construction from classical modular forms of weight 2, trivial character, level N equal to the conductor of the curve, and having rational Fourier coefficients.

<ul> <li> For conductors less than 500000, where modular symbol methods were used to determine the curves (see Cremona97), the reliability of the completeness of the data thus relies on the rigour and correct implementation of the modular symbol algorithms used to compute them, together with the correctness of the algorithms used to compute complete isogeny classes from any one elliptic curve. <li> For smooth conductors, completeness relies on the work of Matschke and Von Kahnel and Matschke and Best . <li> For prime conductors, completeness relies on the work of Bennett, Gherga and Rechnitzer BGR2019. </ul> Individual curve data

####Equation The c_4 and c_6-invariants of the optimal curve in each isogeny class were computed from numerical approximations obtained using modular symbols. See J. E. Cremona Algorithms for modular elliptic curves, 2nd edn., Cambridge 1997.

For additional justification that the equations obtained are rigorously correct, see J. E. Cremona, Appendix to a paper by Amod Agashe, Ken Ribet and William Stein: *The Manin Constant*, Pure and Applied Mathematics Quarterly, Vol. 2 no.2 (2006), pp. 617-636, supplemented for conductors over 130000 by updated notes. Note that for conductors greater than 270000 we have not always identified the optimal curve in each class rigorously, but expect that it is always the curve whose Cremona label number is 1.

####Conductor , local data and basic invariants These are rigorously computed.

####Mordell-Weil group and generators, and BSD invariants The analytic rank r_{an} is computed using modular symbols and is rigorous for r_{an}\le3 and conductor N\le500000. When r_{an}\le1, it is a theorem that r_{an} equals the Mordell-Weil rank r of the curve. When r=1 the generator is obtained from <tt>mwrank</tt> or using Heegner points. When r_{an}\ge2, the Mordell-Weil rank and generators are obtained from <tt>mwrank</tt>. When r_{an}\ge4 we cannot compute the exact value, and when we claim that r_{an}=4 we only know rigorously that r_{an}\in\{2,4\}.

The torsion subgroup and generators are obtained using standard rigorous algorithms, based on Mazur's classification.

The heights of generators of infinite order are given approximately; currently we do not guarantee the precision. Similarly for the regulator, the real period and the special L-value. The analytic order of \Sha was computed exactly for curves of rank 0, where the quotient of the special L-value L(E,1) and the real period is a positive rational number, that was computed using modular symbols for curves with conductor N\le500000 and using a rigorous algorithm of William Stein for larger conductors. For curves of positive rank the analytic order of \Sha was computed approximately and rounded. Note that for rank 1 curves, while it is possible in principal to compute the analytic order of \Sha exactly, this has only been done for conductors less than 5000. For curves of rank greater than 1, the quantity predicted by the BSD conjecture to be the order of \Sha is not even known to be rational and can only be computed as a floating point approximation.

####Integral points These were computed rigorously, using independent implementations in Magma and SageMath which were compared as a consistency check.

####Galois representations The images of the mod-\ell and \ell-adic Galois representations were computed rigorously. In particular, for the mod-\ell representations a variant of Sutherland's algorithm was used to rigorously compute the image of the mod-\ell representation for all primes \ell<1000, and for elliptic curves over \Q without complex multiplication Zywina's algorithm was used to verify the surjectivity of the mod \ell representation for all primes \ell \ge 1000.

####Iwasawa invariants These were computed rigorously.

####Torsion growth The torsion growth data was computed rigorously.

Depends on: Definition 1.2.41 Definition 6.1.31 Definition 3.1.1 Definition 3.1.9 Definition 3.1.38 Definition 3.1.57 Definition 3.1.101 Definition 4.1.4 Definition 4.1.6 Definition 4.1.11 Definition 4.1.24 Definition 4.1.36 Definition 4.1.42 Definition 4.1.47 Definition 4.1.54 Definition 4.1.70 Definition 4.1.72 Definition 4.1.73 Definition 4.1.79 Definition 4.1.84 Definition 4.1.91 Definition 4.1.93 Definition 4.1.95 Definition 4.1.101 Definition 4.1.102 Definition 4.1.105 Definition 8.3.45 Definition 8.3.60

Definition4.1.127
Statement uses 18
Statement dependency previews
Preview
Definition 1.2.8
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Source of elliptic curve data. (LMFDB)

Source of the curves

The elliptic curves over number fields other than \Q come from several sources.

Imaginary quadratic fields The curves defined over the first five (Euclidean) imaginary quadratic fields of class number one include the curves in John Cremona's 1981 thesis, extended by him with Warren Moore in 2014 and subsequently. In 2021-2022 the other fields of class number one were included; for the fields of discriminant -19, -43, -67 (of class number 1), some of the curves appeared first in Elise Whitley's 1990 PhD thesis. Also in 2021-2024, curves defined over all fields of absolute discriminant up to 700 were included, with conductor norm less than some bound depending on the field.

For the field of discriminant -20 (of class number 2), some of the curves appeared first in Jeremy Bygott's 1999 PhD thesis; for the fields of discriminant -23 and -31 (of class number 3), some of the curves appeared first in Mark Lingham's 2005 PhD thesis. In all cases, curves were found to match almost all the cuspidal Bianchi newforms (with trivial character, weight 2 and rational coefficients) in the database, originally using custom code by Cremona and Moore, but with the vast majority found by Magma's <tt>EllipticCurveSearch</tt> function written by Steve Donnelly; in some of the remaining cases it has been proved that there is no matching curve.

Additionally, for the fields with class number 1, curves with CM by the field in question, which are not associated to cuspidal Bianchi newforms, were found from their j-invariants by Cremona.

Totally real fields Over \Q(\sqrt{5}) the curves of conductor norm up to about 5000 were provided by Alyson Deines from joint work of Jonathan Bober, Alyson Deines, Ariah Klages-Mundt, Benjamin LeVeque, R. Andrew Ohana, Ashwath Rabindranath, Paul Sharaba and William Stein (see http://arxiv.org/abs/1202.6612). All the other curves were found from their associated Hilbert newforms using Magma's <tt>EllipticCurveSearch</tt> function, using a script written by John Cremona. Hence the extent of the data matches that of the Hilbert Modular Form data for totally real fields of degrees 2, 3, 4, 5 and 6.

Other fields

  • Steve Donnelly, Paul E. Gunnells, Ariah Klages-Mundt, and Dan Yasaki provided the curves over the mixed cubic field 3.1.23.1.

  • Marc Masdeu provided \Q-curves over quadratic fields.

  • Haluk Sengun provided curves with everywhere good reduction over imaginary quadratic fields.

  • S. Yokoyama and Masdeu provided curves with everywhere good reduction over real quadratic fields (see here).

In some cases the same curve occurs in more than one of the above sources, in which case efforts have been made not to include it more than once in the database.

Source of the data for each curve

Models For each curve, the model in the database is a global minimal model where one exists (for example when the base field has class number one), and otherwise a semi-minimal model which is nonminimal at precisely one prime. These (semi-)minimal models we computed in SageMath using code written by John Cremona. Among all (semi-)minimal models we scale by units in order to minimize the archimedean embeddings of c_4 and c_4 simultaneously using a lattice basis reduction method, also implemented in SageMath by John Cremona.

Local data Conductors and local reduction data were computed using Tate's Algorithm, as implemented in SageMath by John Cremona, except for the local root numbers which were computed using Tim Dokchitser's implementation in Magma.

Isogenies Complete isogeny classes were computed using implementations in SageMath by John Cremona and Ciaran Schembri of Billerey's algorithm (to determine the reducible primes) and Kohel-Ve;lu formulas.

Mordell-Weil groups and generators and Birch--Swinnerton-Dyer data These were computed by John Cremona using Magma's <tt>MordellWeilShaInformation</tt> and <tt>AnalyticRank</tt> functions, implemented by Steve Donnelly and Mark Watkins; the special L-values were in some cases computed using the pari library.

Galois representations The images of mod-\ell Galois representations were computed using Andrew Sutherland's Magma implemention of his methods described in (including a generalization to handle curves with complex multiplication).

Base change and \mathbb{Q}-curves The property of being the base change of an elliptic curve over \mathbb{Q} and of being a \mathbb{Q}-curve were computed by John Cremona using his implementation in SageMath of the algorithm described in .

Depends on: Definition 1.2.8 Definition 4.1.4 Definition 4.1.8 Definition 4.1.11 Definition 4.1.29 Definition 4.1.31 Definition 4.1.35 Definition 4.1.36 Definition 4.1.47 Definition 8.3.60 Definition 3.4.16 Definition 3.4.17 Definition 3.3.1 Definition 5.1.3 Definition 5.1.7 Definition 5.1.17 Definition 5.1.64 Definition 5.1.87