Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 8.18 — functional equation and log-convexity of Γ\GammaΓ

Proved
Rudin.ch08_gamma_functional_equation

by Lucas · Sep 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisspecial-functions

For x>0x > 0x>0, Γ(x+1)=xΓ(x)\Gamma(x+1) = x\Gamma(x)Γ(x+1)=xΓ(x); Γ(n+1)=n!\Gamma(n+1) = n!Γ(n+1)=n! for nonnegative integers nnn; and log⁡Γ\log \GammalogΓ is convex on (0,∞)(0,\infty)(0,∞).

Preamble
import Mathlib
import Definitions.Def_Rudin_ch08_fourier

open Filter Topology
Formal statement
namespace Rudin

/-- Rudin, Theorem 8.18: the Gamma function satisfies `Γ(x+1) = x Γ(x)` for `x > 0`,
`Γ(n+1) = n!` for nonnegative integers `n`, and `log Γ` is convex on `(0, ∞)`. -/
theorem ch08_gamma_functional_equation :
    (∀ x : ℝ, 0 < x → Real.Gamma (x + 1) = x * Real.Gamma x) ∧
    (∀ n : ℕ, Real.Gamma (n + 1) = n.factorial) ∧
    ConvexOn ℝ (Set.Ioi (0 : ℝ)) (fun x => Real.log (Real.Gamma x)) := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 8, pp. 192-193, Definition 8.17 and Theorem 8.18
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Three unconditional assertions about the real Gamma function Γ\GammaΓ, combined into one statement:

  1. For every real x>0x > 0x>0: Γ(x+1)=x Γ(x)\Gamma(x+1) = x\,\Gamma(x)Γ(x+1)=xΓ(x).
  2. For every natural number nnn: Γ(n+1)=n!\Gamma(n+1) = n!Γ(n+1)=n! (the factorial cast into R\mathbb{R}R; the case n=0n=0n=0 gives Γ(1)=1\Gamma(1)=1Γ(1)=1).
  3. The function x↦log⁡Γ(x)x \mapsto \log \Gamma(x)x↦logΓ(x) is convex on the open half-line (0,∞)(0,\infty)(0,∞): for x,yx,yx,y in it and weights s,t≥0s,t \ge 0s,t≥0 with s+t=1s+t=1s+t=1, log⁡Γ(sx+ty)≤slog⁡Γ(x)+tlog⁡Γ(y)\log\Gamma(sx+ty) \le s\log\Gamma(x) + t\log\Gamma(y)logΓ(sx+ty)≤slogΓ(x)+tlogΓ(y).

Item 1 is restricted to positive arguments; nothing is claimed for x≤0x \le 0x≤0, where Γ\GammaΓ is still a total function. Item 3 uses the real logarithm, which returns 000 on non-positive arguments, and includes implicitly that the domain (0,∞)(0,\infty)(0,∞) is convex.

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

  • Endorsed by Lucas · Sep 13, 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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me