All proofs
Project-declaredLean 4.32.0 · mathlib@249c48c2

Deriv Weierstrass P q expansion

TateCurve.Blueprint.derivWeierstrassP_q_expansion

Plain-language statement

The q-expansion of ℘' (Silverman, Advanced topics, Theorem I.6.2): under the hypotheses of weierstrassP_q_expansion, ℘'(z; Λ_τ) = (2πi)³ (Xₐ(e z, e τ) + 2Yₐ(e z, e τ)). Proof: as for weierstrassP_q_expansion, but simpler: group the absolutely convergent sum ℘'(z) = -2∑_ω (z - ω)⁻³ into rows ω = nτ + m (no regularising terms are needed here...

Exact Lean statement

theorem derivWeierstrassP_q_expansion (τ : ℂ) (hτ : 0 < τ.im) (z : ℂ) (hz : 0 < z.im)
    (hzτ : z.im < τ.im) :
    ℘'[periodPair τ hτ.ne'] z =
      (2 * (Real.pi : ℂ) * I) ^ 3 * (XAn (e z) (e τ) + 2 * YAn (e z) (e τ))

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem derivWeierstrassP_q_expansion (τ : ℂ) (hτ : 0 < τ.im) (z : ℂ) (hz : 0 < z.im)    (hzτ : z.im < τ.im) :    ℘'[periodPair τ hτ.ne'] z =      (2 * (Real.pi : ℂ) * I) ^ 3 * (XAn (e z) (e τ) + 2 * YAn (e z) (e τ)) := by  have hq0 : e τ  0 := e_ne_zero τ  have hu1 : ‖e z‖ < 1 := norm_e_lt_one hz  have hqu : ‖e τ‖ < ‖e z‖ := norm_e_lt_norm_e hzτ  -- Step 1: reindex the lattice sum by `ℤ × ℤ`  have h0 : HasSum (fun p :  ×   -2 / (z - (p.1 * τ + p.2)) ^ 3)      (℘'[periodPair τ hτ.ne'] z) :=    hasSum_lattice_prod hτ.ne' (f := fun w  -2 / (z - w) ^ 3)      ((periodPair τ hτ.ne').hasSum_derivWeierstrassP z)  -- Step 2: summability of rows (for Fubini)  have hrowsumm :  n : , Summable fun m :   -2 / (z - (n * τ + m)) ^ 3 := fun n     ((summable_int_inv_pow_sub (z - n * τ) (k := 3) (by norm_num)).mul_left (-2)).congr fun m  by      rw [div_eq_mul_inv, show z - (n * τ + m) = z - n * τ - m by ring]  -- Step 3: evaluate each row  have hrowval :  n : ,      ∑' m : , -2 / (z - (n * τ + m)) ^ 3      = (2 * (Real.pi : ℂ) * I) ^ 3 *          (e τ ^ (-n) * e z * (1 + e τ ^ (-n) * e z) / (1 - e τ ^ (-n) * e z) ^ 3) := by    intro n    rw [show ∑' m : , -2 / (z - (n * τ + m)) ^ 3        = -2 * ∑' m : , (((z - n * τ) - m) ^ 3)⁻¹ by      rw [ tsum_mul_left]      exact tsum_congr fun m  by        rw [div_eq_mul_inv, show z - (n * τ + m) = z - n * τ - m by ring],      tsum_int_inv_pow_sub, sum_int_inv_cube' _ (im_sub_int_mul_ne_zero hτ hz hzτ n),      e_sub_intCast_mul]    ring  -- Step 4: sum the rows (Fubini) and recombine into `XAn + 2YAn`  rw [ h0.tsum_eq, h0.summable.tsum_prod' fun n  hrowsumm n, tsum_congr hrowval,    tsum_mul_left, tsum_comp_neg      fun n :   e τ ^ n * e z * (1 + e τ ^ n * e z) / (1 - e τ ^ n * e z) ^ 3,    tsum_congr fun n :   (div_sq_add_two_mul_div_cube (e τ ^ n * e z)).symm,    Summable.tsum_add (summable_V hq0 hqu hu1) ((summable_V₂ hq0 hqu hu1).mul_left 2),    tsum_mul_left, XAn, YAn]  ring
Project
Fermat's Last Theorem
License
Apache-2.0
Commit
8dd808888295
Source
FLT/KnownIn1980s/EllipticCurves/TateCurveConstruction.lean:684-721

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.32.0

Eq finsum quotient out of bij On

AbstractHeckeOperator.eq_finsum_quotient_out_of_bijOn'

Plain-language statement

If a is fixed by V then ∑ᶠ g ∈ s, g • a is independent of the choice s of coset representatives in G for a subset of G ⧸ V

number theoryarithmetic geometryFermat's Last Theorem

Source project: Fermat's Last Theorem

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Comm Group no compact automorphisms

CommGroup.no_compact_automorphisms

Plain-language statement

A connected compact Hausdorff abelian topological group does not admit a nontrivial compact group of automorphisms.

number theoryarithmetic geometryFermat's Last Theorem

Source project: Fermat's Last Theorem

Person-level attribution pending.

View proof record