-
Notifications
You must be signed in to change notification settings - Fork 39
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'main' of github.com:ImperialCollegeLondon/FLT into main
- Loading branch information
Showing
9 changed files
with
348 additions
and
173 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,60 @@ | ||
/- | ||
Copyright (c) 2024 Kevin Buzzard. All rights reserved. | ||
Released under Apache 2.0 license as described in the file LICENSE. | ||
Authors: Kevin Buzzard | ||
-/ | ||
import Mathlib.AlgebraicGeometry.EllipticCurve.Group | ||
import Mathlib.FieldTheory.IsSepClosed | ||
import Mathlib.RepresentationTheory.Basic | ||
|
||
/-! | ||
See | ||
https://leanprover.zulipchat.com/#narrow/stream/217875-Is-there-code-for-X.3F/topic/n-torsion.20or.20multiplication.20by.20n.20as.20an.20additive.20group.20hom/near/429096078 | ||
The main theorems in this file are part of the PhD thesis work of David Angdinata, one of KB's | ||
PhD students. It would be great if anyone who is interested in working on these results | ||
could talk to David first. Note that he has already made substantial progress. | ||
-/ | ||
|
||
universe u | ||
|
||
variable {K : Type u} [Field K] (E : EllipticCurve K) | ||
|
||
open WeierstrassCurve | ||
|
||
abbrev EllipticCurve.n_torsion (n : ℕ) : Type u := Submodule.torsionBy ℤ (E.toWeierstrassCurve ⟮K⟯) n | ||
|
||
--variable (n : ℕ) in | ||
--#synth AddCommGroup (E.n_torsion n) | ||
|
||
def ZMod.module (A : Type*) [AddCommGroup A] (n : ℕ) (hn : ∀ a : A, n • a = 0) : | ||
Module (ZMod n) A := | ||
sorry | ||
|
||
-- not sure if this instance will cause more trouble than it's worth | ||
instance (n : ℕ) : Module (ZMod n) (E.n_torsion n) := sorry -- shouldn't be too hard | ||
|
||
-- This theorem needs e.g. a theory of division polynomials. It's ongoing work of David Angdinata. | ||
-- Please do not work on it without talking to KB and David first. | ||
theorem EllipticCurve.n_torsion_finite {n : ℕ} (hn : 0 < n) : Finite (E.n_torsion n) := sorry | ||
|
||
-- This theorem needs e.g. a theory of division polynomials. It's ongoing work of David Angdinata. | ||
-- Please do not work on it without talking to KB and David first. | ||
theorem EllipticCurve.n_torsion_card [IsSepClosed K] {n : ℕ} (hn : (n : K) ≠ 0) : | ||
Nat.card (E.n_torsion n) = n^2 := sorry | ||
|
||
-- I only need this if n is prime but there's no harm thinking about it in general I guess. | ||
-- It follows from the previous theorem using pure group theory (possibly including the | ||
-- structure theorem for finite abelian groups) | ||
theorem EllipticCurve.n_torsion_dimension [IsSepClosed K] {n : ℕ} (hn : (n : K) ≠ 0) : | ||
∃ φ : E.n_torsion n ≃+ (ZMod n) × (ZMod n), True := sorry | ||
|
||
-- We need this -- ask David? | ||
example (L M : Type u) [Field L] [Field M] [Algebra K L] [Algebra K M] (f : L →ₐ[K] M) : | ||
E.toWeierstrassCurve ⟮L⟯ →+ E.toWeierstrassCurve ⟮M⟯ := sorry | ||
|
||
-- Once we have it, plus the id and comp lemmas for it, we can get an action of Gal(K-bar/K) on E(K-bar)[n] | ||
def EllipticCurve.mod_p_Galois_representation (n : ℕ) (L : Type u) [Field L] [Algebra K L] : | ||
Representation (ZMod n) (L ≃ₐ[K] L) (E.n_torsion n) := sorry |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.