The Bohr–Mollerup theorem
ProvedFamousTheorems.bohr_mollerup_theoremThe Bohr–Mollerup theorem. Let satisfy
- ,
- for all ,
- is convex on .
Then on .
Among all functions interpolating the factorial, the Gamma function is thus the unique log-convex one. Artin made this characterization the foundation of his treatment of the Gamma function, and it gives quick proofs of identities such as the duplication formula.
Formalization note. Mathlib's Real.eq_Gamma_of_log_convex. f is a function ℝ → ℝ, and all hypotheses and the conclusion Set.EqOn f Real.Gamma (Set.Ioi 0) concern positive arguments only.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem bohr_mollerup_theorem {f : ℝ → ℝ} (hf_conv : ConvexOn ℝ (Set.Ioi 0) (Real.log ∘ f)) (hf_feq : ∀ {y : ℝ}, 0 < y → f (y + 1) = y * f y)
(hf_pos : ∀ {y : ℝ}, 0 < y → 0 < f y) (hf_one : f 1 = 1) : Set.EqOn f Real.Gamma (Set.Ioi 0) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Real.eq_Gamma_of_log_convex`. Proof here reduces to that Mathlib result.