Theorem 8.18 — functional equation and log-convexity of
ProvedRudin.ch08_gamma_functional_equationanalysisspecial-functions
For , ; for nonnegative integers ; and is convex on .
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 RudinSource
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 , combined into one statement:
- For every real : .
- For every natural number : (the factorial cast into ; the case gives ).
- The function is convex on the open half-line : for in it and weights with , .
Item 1 is restricted to positive arguments; nothing is claimed for , where is still a total function. Item 3 uses the real logarithm, which returns on non-positive arguments, and includes implicitly that the domain is convex.
Human review
Confirmed by the mission captain (proposal self-audit).