Documentation

Atlas.EllipticCurves.code.EndomorphismClassification

theorem even_of_sq_eq_prime_pow (p : ) (hp : Nat.Prime p) (n k : ) :
k ^ 2 = p ^ nEven n

Number-theoretic lemma: if k² = pⁿ for a prime p and natural number k, then n is even. Proved by strong induction on n using that primes are not squares.

theorem even_of_int_sq_eq_four_mul_prime_pow (p : ) (hp : Nat.Prime p) (n : ) (t : ) (h : t ^ 2 = 4 * p ^ n) :

Integer analogue: if an integer satisfies t² = 4·pⁿ for a prime p, then n is even. This is used to detect when tr π_E)² = 4q forces special behavior over even-degree extensions.

Under the hypotheses of Corollary 13.7, the Frobenius endomorphism is not an integer. Concretely: if #F = pⁿ and either n is odd or E is ordinary, then the Frobenius π_E does not satisfy tr(π_E)² = 4q (i.e. is not a scalar multiple of the identity). This is the key technical step toward showing that End⁰(E) = ℚ(π_E) is an imaginary quadratic field.

Corollary 13.7 (Sutherland §13.1). Let E be an elliptic curve over 𝔽_q with q = pⁿ. If n is odd or E is ordinary, then End⁰(E) = ℚ(π_E) ≃ ℚ(√D) is an imaginary quadratic field with D = (tr π_E)² - 4q. Concretely we extract three pieces of data: (1) the Frobenius discriminant is negative; (2) the endomorphism algebra has -dimension 2; (3) it contains an element α ∉ ℚ with α² ∈ ℚ_{<0} (an imaginary generator).