Documentation

TauCeti.AlgebraicGeometry.EllipticCurve.Isogeny.MulByInt.IsSepClosed

Torsion over a separably closed field #

Rationality of geometric torsion over a separably closed field is the hypothesis the counts of MulByInt/ take of the base field, so each of them holds here and the algebraically closed hypothesis they carried weakens to a separably closed one. The rationality theorem itself lives with the division-polynomial torsion theory in DivisionPolynomial.Torsion.IsSepClosed.

Main results #

References #

#ker [n] = n ² over a separably closed field, for n invertible there: the geometric n-torsion is then rational, which is the only thing the count asks of the base field.

#E[ℓ] = ℓ ², for a prime ℓ invertible in a separably closed base field.

@[simp]

E[ℓ] is two-dimensional over ZMod ℓ for a prime ℓ invertible in a separably closed base field, where the geometric ℓ-torsion is rational.

E[ℓ] ≅ (ZMod ℓ)² for a prime ℓ invertible in a separably closed base field.

#E[n] = n ² over a separably closed field in which n is invertible, read on Mathlib's intrinsic torsion subgroup.

[n] carries E[n ²] onto E[n] over a separably closed field in which n is invertible.

theorem WeierstrassCurve.Affine.exists_zsmul_eq_of_zsmul_eq_zero {F : Type u_1} [Field F] [DecidableEq F] [IsSepClosed F] (W : Affine F) [WeierstrassCurve.IsElliptic W] {n : ℤ} (hchar : ↑n ≠ 0) {T : (toAffine (W.baseChange F)).Point} (hT : n • T = 0) :
∃ (P : (toAffine (W.baseChange F)).Point), n • P = T ∧ n ^ 2 • P = 0

Every n-torsion point is n times an n ²-torsion point, over a separably closed field in which n is invertible.

theorem WeierstrassCurve.Affine.exists_point_zsmul_eq_of_zsmul_eq_zero {F : Type u_1} [Field F] [DecidableEq F] [IsSepClosed F] (W : Affine F) [WeierstrassCurve.IsElliptic W] {n : ℤ} (hchar : ↑n ≠ 0) {T : W.Point} (hT : n • T = 0) :
∃ (R : W.Point), n • R = T

Every n-torsion point of W is n times a point of W, over a separably closed field in which n is invertible.

theorem WeierstrassCurve.Affine.natCard_setOf_zsmul_eq_zero {F : Type u_1} [Field F] [DecidableEq F] [IsSepClosed F] (W : Affine F) [WeierstrassCurve.IsElliptic W] {n : ℤ} (hchar : ↑n ≠ 0) :
Nat.card ↑{R : W.Point | n • R = 0} = n.natAbs ^ 2

#E[n] = n ² over a separably closed field in which n is invertible, counted on the points of W themselves.

An elliptic curve has infinitely many points over a separably closed field: for every prime ℓ other than the characteristic, its ℓ-torsion alone has ℓ ² points.

The n-torsion read on W.toAffine.Point itself, rather than on the trivial base change W⁄K, has order n.natAbs ^ 2 when n is invertible in K.