Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rademacher's Gamma quotient estimate

Open
LL_Decomp530a.leaf_rademacher_gamma_ratio

by sthubbar · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

For every real Q≥0Q\ge0Q≥0 and every complex sss with −1/2≤Re⁡s≤1/2-1/2\le\operatorname{Re}s\le1/2−1/2≤Res≤1/2, one has ∣Γ(Q2+1−s2)/Γ(Q2+s2)∣≤(∣Q+1+s∣/2)1/2−Re⁡s\left|\Gamma\big(\tfrac{Q}{2}+\tfrac{1-s}{2}\big)\big/\Gamma\big(\tfrac{Q}{2}+\tfrac{s}{2}\big)\right|\le\big(|Q+1+s|/2\big)^{1/2-\operatorname{Re}s}​Γ(2Q​+21−s​)/Γ(2Q​+2s​)​≤(∣Q+1+s∣/2)1/2−Res, where the right side is a real power of a nonnegative real number.

Preamble
import Mathlib

open Classical Complex Set Filter ZMod
open scoped Topology
Formal statement
namespace LL_Decomp530a
theorem leaf_rademacher_gamma_ratio :
    ∀ Q : ℝ, 0 ≤ Q → ∀ s : ℂ, -(1 / 2 : ℝ) ≤ s.re → s.re ≤ 1 / 2 →
      ‖Complex.Gamma ((Q : ℂ) / 2 + (1 - s) / 2) /
        Complex.Gamma ((Q : ℂ) / 2 + s / 2)‖ ≤
        (‖(Q : ℂ) + 1 + s‖ / 2) ^ (1 / 2 - s.re) := by sorry
end LL_Decomp530a
Source
Rademacher 1959, Math. Z. 72, p. 197, Lemma 1, display 5.1; input to Baker, Harman and Pintz 1997, Lemma 8.
Read-back

What the Lean code literally says, in plain math · claude-haiku

The declaration is named LL_Decomp530a.leaf_rademacher_gamma_ratio and is a single theorem with no hypotheses beyond those in its statement. It quantifies over a real number QQQ and a complex number s=σ+iτs = \sigma + i\taus=σ+iτ (with σ=Re⁡(s)\sigma = \operatorname{Re}(s)σ=Re(s)). The hypotheses are Q≥0Q \ge 0Q≥0 and −12≤σ≤12-\tfrac12 \le \sigma \le \tfrac12−21​≤σ≤21​; τ\tauτ is unrestricted. The conclusion is the inequality

∣Γ ⁣(Q2+1−s2)Γ ⁣(Q2+s2)∣  ≤  (∣Q+1+s∣2)12−σ,\left|\frac{\Gamma\!\left(\frac{Q}{2}+\frac{1-s}{2}\right)}{\Gamma\!\left(\frac{Q}{2}+\frac{s}{2}\right)}\right| \;\le\; \left(\frac{|Q+1+s|}{2}\right)^{\frac12-\sigma},​Γ(2Q​+2s​)Γ(2Q​+21−s​)​​≤(2∣Q+1+s∣​)21​−σ,

where Γ\GammaΓ is the Euler Gamma function (as Complex.Gamma), ∣⋅∣|\cdot|∣⋅∣ is the complex modulus (‖·‖), and the exponent 12−σ\tfrac12-\sigma21​−σ is a real number, so the power is the real power. Every quantifier is universal: the statement says that for all such QQQ and sss the inequality holds. The hypotheses are satisfiable (for example Q=0Q=0Q=0, s=12s=\tfrac12s=21​), so the statement is not vacuous. Two edge cases need attention. First, Lean's Complex.Gamma is total: it takes the value 000 at the nonpositive integers, and Lean's complex division returns 000 when the divisor is 000. The denominator Γ(Q+s2)\Gamma(\tfrac{Q+s}{2})Γ(2Q+s​) is a genuine pole exactly when Q+s=0Q+s=0Q+s=0, that is s=−Qs=-Qs=−Q with sss real and Q∈[0,12]Q\in[0,\tfrac12]Q∈[0,21​] (here σ=−Q≥−12\sigma=-Q\ge -\tfrac12σ=−Q≥−21​ is forced). At those points the left side is 000 by junk-value convention rather than by a mathematical limit, so the inequality holds trivially there and says nothing about the actual ratio, which is undefined. Everywhere else the denominator's real part is (Q+σ)/2>−14(Q+\sigma)/2 > -\tfrac14(Q+σ)/2>−41​ and it avoids every nonpositive integer, so the ratio is the honest Gamma quotient. Second, the numerator Γ(Q+1−s2)\Gamma(\tfrac{Q+1-s}{2})Γ(2Q+1−s​) has real part at least 14\tfrac1441​, so it never hits a pole. The base ∣Q+1+s∣/2|Q+1+s|/2∣Q+1+s∣/2 is never zero, since its real part Q+1+σQ+1+\sigmaQ+1+σ is at least 12\tfrac1221​, so the real power has no 000^000 or 0positive0^{\text{positive}}0positive ambiguity. The bound is the expected shape of a Stirling-type estimate: for large QQQ the Gamma ratio behaves like (Q/2)12−s(Q/2)^{\frac12-s}(Q/2)21​−s, whose modulus is (Q/2)12−σ(Q/2)^{\frac12-\sigma}(Q/2)21​−σ, which matches the right side up to the shift Q↦Q+1+sQ\mapsto Q+1+sQ↦Q+1+s. So the statement is a nontrivial, mathematically plausible bound, with the only trivial cases being the junk-value points s=−Qs=-Qs=−Q on the real segment.

Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Nov 17, 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