Documentation

TauCeti.AlgebraicGeometry.EllipticCurve.Isogeny.MulByInt.Separability

Separability of multiplication by n #

Whether [n] is separable is decided by its differential, and [n] = n • id computes that: the pullback of the invariant differential along [n] is n • ω, which vanishes exactly when n does in the base field. In characteristic zero, and in characteristic p for p ∤ n, [n] is therefore separable, and then nothing is inseparable in it, so its separable degree is its whole degree n ².

Main results #

References #

[n] scales the invariant differential by n: the pullback of ω along [n] is n • ω. This is the differential computation the separability criterion for [n] rests on.

@[simp]

[n] is separable exactly when n is nonzero in the base field (Silverman III.5.4).

A separable [n] has separable degree n ², its degree, since nothing is inseparable.

The inseparable degree of [n] is divisible by the characteristic when n vanishes in the base field.

The inseparable degree of [n ^ k] is the k-th power of that of [n].