Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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.

Γ(n+1)=n! for every natural number n

Statement

For every natural number n, Γ(n+1)=n!.

Facts & Assumptions

Given: Factorial recursion 0!=1 and (n+1)!=(n+1)n! from The factorial n! and the falling factorial nk, defined by recursion in N.

[F1]

For every s>0, Γ(s+1)=sΓ(s), and Γ(1)=1 (The real Gamma functional equation Γ(s+1)=sΓ(s)).

Proof

technique · induction
1.1

At n=0, [F1] gives Γ(1)=1=0!.

F1base
1.2

Assume Γ(n+1)=n!. Then [F1] gives Γ(n+2)=(n+1)Γ(n+1)=(n+1)n!=(n+1)!.

F1ihalgebra
2.1

The induction principle therefore proves Γ(n+1)=n! for every nN.

step 1.1step 1.2discharge-induction

Depends on

Used by

Dependency tree · two levels

24 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