All proofs
Project-declaredLean 4.32.0 · mathlib@249c48c2

Has Sum Y eval

TateCurve.Blueprint.hasSum_Y_eval

Plain-language statement

Rearrangement for Y: for 0 < ‖q‖ < ‖u‖ < 1 with u transcendental, the coefficients of the formal series TateCurve.Y evaluated at u sum to Yₐ(u, q). Proof: as for hasSum_X_eval, using v²/(1-v)³ = ∑_{m ≥ 1} (m choose 2) vᵐ for the rows n ≥ 1, the rational-function identity v²/(1-v)³ = -v⁻¹/(1-v⁻¹)³ together with `v/(1-v)³ = ∑_{m ≥ 1} ((m...

Exact Lean statement

theorem hasSum_Y_eval {u q : ℂ} (hu : Transcendental ℚ u) (h0 : 0 < ‖q‖)
    (h1 : ‖q‖ < ‖u‖) (h2 : ‖u‖ < 1) :
    HasSum (fun n : ℕ ↦ evalAt u ((PowerSeries.coeff n) Y) * q ^ n) (YAn u q)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem hasSum_Y_eval {u q : ℂ} (hu : Transcendental  u) (h0 : 0 < ‖q‖)    (h1 : ‖q‖ < ‖u‖) (h2 : ‖u‖ < 1) :    HasSum (fun n :   evalAt u ((PowerSeries.coeff n) Y) * q ^ n) (YAn u q) := by  have hu0 : u  0 := norm_pos_iff.mp (h0.trans h1)  have hq0 : q  0 := norm_pos_iff.mp h0  have hq1 : ‖q‖ < 1 := h1.trans h2  -- the two `u`-dependent Lambert double series  have hA := hasSum_prod_lambert (y := u) (fun m  ((m.choose 2 : ) : ℂ))    (fun v  v ^ 2 / (1 - v) ^ 3) choose_two_le_sq hq1 (norm_mul_lt_one h1 h2)    fun v hv  hasSum_pnat_lambert₂ hv  have hB := hasSum_prod_lambert (y := u⁻¹) (fun m  (((m + 1).choose 2 : ) : ℂ))    (fun v  v / (1 - v) ^ 3) choose_add_one_two_le_sq hq1 (norm_mul_inv_lt_one h0 h1)    fun v hv  hasSum_pnat_lambert₂' hv  -- combine, collect by divisors, and restore the `n = 0` term  have hdiv := hasSum_divisor_collect (x := q)    (fun d :   ((d.choose 2 : ) : ℂ) * u ^ d - (((d + 1).choose 2 : ) : ℂ) * u⁻¹ ^ d      + (d : ℂ))    (((hA.sub hB).add (hasSum_prodC hq1)).congr_fun fun p  by ring)  have hfull := hasSum_nat_of_pnat_add    (f := fun n :   evalAt u ((PowerSeries.coeff n) Y) * q ^ n)    (hdiv.congr_fun fun N  by rw [evalAt_coeff_Y hu N.pos.ne'])  -- identify the value with `YAn u q`  have hposEq :  n : +,      (q ^ (((n : ) : )) * u) ^ 2 / (1 - q ^ (((n : ) : )) * u) ^ 3        = (q ^ (n : ) * u) ^ 2 / (1 - q ^ (n : ) * u) ^ 3 := fun n  by rw [zpow_natCast]  have hnegEq :  n : +,      (q ^ (-((n : ) : )) * u) ^ 2 / (1 - q ^ (-((n : ) : )) * u) ^ 3        = -(q ^ (n : ) * u⁻¹ / (1 - q ^ (n : ) * u⁻¹) ^ 3) := fun n  by    rw [zpow_neg_natCast_mul, inv_sq_div_one_sub_inv_cube      (mul_ne_zero (pow_ne_zero _ hq0) (inv_ne_zero hu0))]  convert hfull using 1  rw [YAn, tsum_int_decomp (summable_V₂ hq0 h1 h2),    show (q ^ (0 : ) * u) ^ 2 / (1 - q ^ (0 : ) * u) ^ 3 = u ^ 2 / (1 - u) ^ 3 by      rw [zpow_zero, one_mul],    tsum_congr hposEq, tsum_congr hnegEq, tsum_neg, evalAt_coeff_Y_zero hu, pow_zero,    mul_one]  ring
Project
Fermat's Last Theorem
License
Apache-2.0
Commit
8dd808888295
Source
FLT/KnownIn1980s/EllipticCurves/TateCurveConstruction.lean:1289-1325

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