How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
by Wallis's product
Statement
.
Facts & Assumptions
Given: Positive integers tending to infinity.
For and , (Gautschi's inequality for the real Gamma function).
For naturals , ( for ; hence , the quotient is a natural number, and ).
For every , (The real Gamma functional equation ).
Proof
Iterating [F4] gives , with the empty product valid at .
Apply [F1] with and . After inversion, , so this middle sequence tends to .
By step 1.1 and [F3], the middle sequence is . Fact [F2] makes its limit , while step 1.2 makes the same limit .
Positivity of Gamma and uniqueness of limits therefore give .
Remarks
This proof uses Gautschi and Wallis. The Gaussian-integral proof from the Gaussian integral is logically independent of it.
Depends on
- The real Gamma functional equation $\Gamma(s+1)=s\Gamma(s)$
- Gautschi's inequality for the real Gamma function
- The central binomial coefficient is asymptotic to 4^n divided by the square root of pi n
- $\binom{n}{k}\,k!\,(n-k)! = n!$ for $k \le n$; hence $\binom{n}{k}\,k! = n^{\underline{k}}$, the quotient $n!/(k!(n-k)!)$ is a natural number, and $\binom{n}{k} = \binom{n}{n-k}$
- Algebra of limits: sums, scalar multiples, products and quotients
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
56 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- University of Toronto MAT237Y1, The Gamma Function and the Beta Function, §2.3 (standard reference, not scraped)