Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30
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.

Stirling's formula for Gamma

Statement

Fix δ with 0<δ<π. On the closed sector ∣arg⁡z∣≤π−δ, using the principal logarithm in zz−1/2:=exp⁡((z−1/2)Log⁡z), one has

Γ(z)=2π zz−1/2e−z(1+Oδ(∣z∣−1))

as ∣z∣→∞.

Facts & Assumptions

Given: A fixed closed sector ∣arg⁡z∣≤π−δ.

[L1]

Reciprocal Gamma has the Weierstrass product (The Weierstrass product for reciprocal Gamma).

[L2]

Harmonic numbers satisfy Hn=log⁡n+γ+o(1) (The Euler–Mascheroni constant and the harmonic asymptotic).

[L3]

The real Stirling formula gives log⁡(N−1)!=(N−12)log⁡N−N+12log⁡(2π)+o(1) as N→∞ through the positive integers (Stirling's formula for factorials).

Proof

technique · direct
1.1L1givenalgebra

Taking logarithms in [L1] on the chosen sector gives [L1, given, algebra] log⁡Γ(z)=−log⁡z−γz+∑n≥1(zn−Log⁡(1+zn)), where Log⁡ denotes the principal logarithm.

2.1step 1.1algebra

For an integer N≥1, define [step 1.1, algebra] IN(z):=∫0N⌊u⌋−u+1/2u+z du. On each interval [n,n+1] with 0≤n≤N−1, one has ∫nn+1n−u+1/2u+z du=(n+12+z)Log⁡n+1+zn+z−1. Summing these equalities and telescoping the logarithms yields IN(z)=(N+z−12)Log⁡(N+z)−(z+12)Log⁡z−N−log⁡(N−1)!−zHN−1+∑n=1N−1(zn−Log⁡(1+zn)).

3.1L2L3step 1.1step 2.1algebra

For fixed z in the sector, [L2] and [L3] give [L2, L3, step 1.1, step 2.1, algebra] HN−1=log⁡N+γ+o(1),log⁡(N−1)!=(N−12)log⁡N−N+12log⁡(2π)+o(1). The logarithm needs its first-order term: Log⁡(N+z)=log⁡N+Log⁡(1+z/N)=log⁡N+zN+Oz(N−2), whence (N+z−12)Log⁡(N+z)=(N+z−12)log⁡N+z+o(1). Substituting these three expansions into step 2.1, the N, log⁡N, and zlog⁡N terms cancel. The remaining finite sum converges by step 1.1, so the limit gives the Binet-type formula log⁡Γ(z)=(z−12)Log⁡z−z+12log⁡(2π)+∫0∞⌊u⌋−u+1/2u+z du.

4.1step 3.1algebra∎

Let [step 3.1, algebra] Φ(u):=∫0u(⌊v⌋−v+1/2) dv. Then Φ is 1-periodic and therefore bounded. Integrating by parts in step 3.1 gives ∫0∞⌊u⌋−u+1/2u+z du=∫0∞Φ(u)(u+z)2 du. On the closed sector ∣arg⁡z∣≤π−δ, one has ∣u+z∣≥cδ(u+∣z∣) for a constant cδ>0, so the integral above is Oδ(∣z∣−1) uniformly as ∣z∣→∞. Hence log⁡Γ(z)=(z−12)Log⁡z−z+12log⁡(2π)+Oδ(∣z∣−1), and exponentiating yields Γ(z)=2π zz−1/2e−z(1+Oδ(∣z∣−1)).

Depends on

Used by

Dependency tree · two levels

13 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