Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 (Hecke), (B) ⟹ (A)

Proved
Gelbart.hecke_nice_of_automorphic

by LG · Sep 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

l-functionsmodular-formsnumber-theory

The forward half of Hecke's Theorem 1. Let an=O(nc)a_n = O(n^{c})an​=O(nc) with c>0c > 0c>0, let h,k>0h, k > 0h,k>0 and C=±1C = \pm 1C=±1. If

f(−1/z)=C(zi)kf(z)(Im⁡z>0),f(-1/z) = C\left(\frac{z}{i}\right)^{k} f(z) \qquad (\operatorname{Im} z > 0),f(−1/z)=C(iz​)kf(z)(Imz>0),

then Φ(s)+a0/s+Ca0/(k−s)\Phi(s) + a_0/s + C a_0/(k-s)Φ(s)+a0​/s+Ca0​/(k−s) extends to an entire function, bounded in every vertical strip, satisfying the functional equation F(k−s)=CF(s)F(k-s) = C F(s)F(k−s)=CF(s); equivalently Φ(k−s)=CΦ(s)\Phi(k-s) = C\Phi(s)Φ(k−s)=CΦ(s).

Preamble
import Definitions.Def_Gelbart_hecke_conditions
Formal statement
namespace Gelbart

theorem hecke_nice_of_automorphic
    (a : ℕ → ℂ) (c h k : ℝ) (C : ℂ)
    (hc : 0 < c) (hh : 0 < h) (hk : 0 < k) (hC : C = 1 ∨ C = -1)
    (hgrowth : HeckeCoeffGrowth a c) :
    HeckeAutomorphic a h k C → HeckeNice a h k C (c + 1) := by sorry

end Gelbart
Source
S. Gelbart, An elementary introduction to the Langlands program, Bull. Amer. Math. Soc. (N.S.) 10 (1984), no. 2, 177-219, https://doi.org/10.1090/S0273-0979-1984-15237-6, p. 188, §II.B.2, Theorem 1 (Hecke), direction (B) => (A)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent that drafted the statements (non-blind)

⚠️ NON-BLIND READ-BACK — NOT INDEPENDENT TESTIMONY. This read-back was written by the same agent that drafted the Lean statements in this proposal, on the explicit instruction of the proposal owner. It was not written blind by an independent auditor: its author had full sight of the source text, the intended informal statement, and the drafting rationale. It therefore carries no independent evidential weight, and a reviewer must not treat it as an audit or as corroboration of faithfulness. An independent, blind read-back is still outstanding for every item in this proposal.

Throughout, a:N→Ca : \mathbb{N}\to\mathbb{C}a:N→C is a coefficient sequence, hhh and kkk are reals, CCC is complex, fa,h(z)=∑n≥0ane2πinz/hf_{a,h}(z) = \sum_{n\ge0} a_n e^{2\pi i n z/h}fa,h​(z)=∑n≥0​an​e2πinz/h is an unconditional sum (value 000 where not summable), and Φa,h(s)=(2π/h)−sΓ(s)∑n≥1ann−s\Phi_{a,h}(s) = (2\pi/h)^{-s}\Gamma(s)\sum_{n\ge1}a_n n^{-s}Φa,h​(s)=(2π/h)−sΓ(s)∑n≥1​an​n−s. The growth predicate with exponent ccc says: there is a real KKK with ∥an∥≤Knc\lVert a_n\rVert \le K n^{c}∥an​∥≤Knc for all n≥1n \ge 1n≥1.

Given: a sequence aaa, reals c,h,kc, h, kc,h,k with c>0c > 0c>0, h>0h > 0h>0, k>0k > 0k>0, a complex CCC with C=1C = 1C=1 or C=−1C = -1C=−1, and the growth hypothesis for aaa with exponent ccc. The claim is a one-directional implication. Its hypothesis is: for every complex zzz with Im⁡z>0\operatorname{Im} z > 0Imz>0, fa,h(−1/z)=C (z/i)kfa,h(z)f_{a,h}(-1/z) = C\,(z/i)^{k} f_{a,h}(z)fa,h​(−1/z)=C(z/i)kfa,h​(z). Its conclusion is the existence of a function F:C→CF : \mathbb{C}\to\mathbb{C}F:C→C that is complex-differentiable everywhere, satisfies F(s)=Φa,h(s)+a0/s+Ca0/(k−s)F(s) = \Phi_{a,h}(s) + a_0/s + C a_0/(k-s)F(s)=Φa,h​(s)+a0​/s+Ca0​/(k−s) for every sss with Re⁡s>c+1\operatorname{Re} s > c+1Res>c+1, is bounded on each vertical strip σ1≤Re⁡s≤σ2\sigma_1 \le \operatorname{Re} s \le \sigma_2σ1​≤Res≤σ2​ by some constant depending on the strip, and satisfies F(k−s)=C F(s)F(k-s) = C\,F(s)F(k−s)=CF(s) for every complex sss. The converse implication is not asserted here.

Human review
  • Endorsed by Shuze Chen · Sep 14, 2026

  • Endorsed by LG · Sep 14, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me