Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Gamma functional equation away from the poles

Statement

For every z∈C∖{0,−1,−2,…}, Γ(z+1)=zΓ(z), where Γ is the meromorphic continuation of Euler's Gamma function.

Facts & Assumptions

Given: Euler's Gamma integral on Re⁡z>0 and z∈C∖{0,−1,−2,…}.

[F2]

Euler's Gamma function is holomorphic on the right half-plane: this integral defines a holomorphic function on the right half-plane.

[F3]

The Gamma functional equation: if Re⁡w>0, then Γ(w+1)=wΓ(w).

[F4]

Dedekind completeness implies the Archimedean property: for every real r, some integer m≥1 satisfies r>−m.

Proof

1.1givenF1F2algebraconstruct

For each integer m≥0, let Vm={w∈C:Re⁡w>−m−1} and define Gm(w)=Γ(w+m+1)/(w(w+1)⋯(w+m)) as a meromorphic function on Vm. Its numerator is holomorphic on this half-plane by [F1] and [F2], and its denominator is a polynomial.

2.1givenF3F4step 1.1algebra

For every w∈Vm, Re⁡(w+m+1)>0. Applying [F3] at w+m+1 and cancelling the common meromorphic factor w+m+1 gives Gm+1(w)=Gm(w) on the overlap Vm⊂Vm+1. By [F4], the union of the Vm is C, so these compatible meromorphic formulas define a meromorphic continuation of Euler's Gamma function on the whole plane.

3.1givenF4step 2.1algebrachoose∎

Choose m≥1 large enough that z∈Vm; then z+1∈Vm−1. Because z is not a nonpositive integer, the denominator factors below are nonzero. The glued formulas give Γ(z)=Γ(z+m+1)/(z(z+1)⋯(z+m)) and Γ(z+1)=Γ(z+m+1)/((z+1)⋯(z+m)). Multiplying the first identity by z yields the second.

Depends on

Used by

Dependency tree · two levels

10 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