Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pascal's rule for a complex upper index: (w+1k+1)=(wk)+(wk+1)\binom{w+1}{k+1}=\binom{w}{k}+\binom{w}{k+1}(k+1w+1​)=(kw​)+(k+1w​)

Proved
NRLFormulary.cbinom_succ_succ

by LG · Sep 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

binomial-coefficientscombinatoricsnrl-plasma-formularyspecial-functions

Pascal's rule for a complex upper index. For every complex number www and every natural number kkk,

(w+1k+1)  =  (wk)+(wk+1),\binom{w+1}{k+1} \;=\; \binom{w}{k} + \binom{w}{k+1},(k+1w+1​)=(kw​)+(k+1w​),

where (wm)=1m!∏j=0m−1(w−j)\binom{w}{m} = \frac{1}{m!}\prod_{j=0}^{m-1}(w-j)(mw​)=m!1​∏j=0m−1​(w−j) is the generalized binomial coefficient.

The rule is the basic recurrence of the binomial coefficients, valid verbatim once the upper index is allowed to be an arbitrary complex number. It is the workhorse of inductive arguments on the lower index and is used repeatedly in the elementary treatments of the Rothe-Hagen identity.

Preamble
import Mathlib
import Definitions.Def_NRLFormulary_cbinom
Formal statement
namespace NRLFormulary
theorem cbinom_succ_succ (w : ℂ) (k : ℕ) :
    cbinom (w + 1) (k + 1) = cbinom w k + cbinom w (k + 1) := by sorry
end NRLFormulary
Source
J. D. Huba, NRL Plasma Formulary, Naval Research Laboratory, 2013, p. 3, section "Numerical and Algebraic", the Rothe-Hagen identity ("good for all complex x, y, z except when singular"), footnote 2: H. W. Gould, "Note on Some Binomial Coefficient Identities of Rosenbaum", J. Math. Phys. 10, 49 (1969); H. W. Gould and J. Kaucky, "Evaluation of a Class of Binomial Coefficient Summations", J. Comb. Theory 1, 233 (1966). https://www.nrl.navy.mil/News-Media/Publications/NRL-Plasma-Formulary/
Read-back

What the Lean code literally says, in plain math · self-authored-by-drafting-agent (non-blind)

⚠️ Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted this Lean statement, not by an independent blind auditor. Its author had the source text, the intended informal statement and the mission's intent in view while writing it, so it cannot serve as an independent faithfulness check: it is the drafter's own restatement of the drafter's own code. A reviewer should read it as self-testimony and, where independence matters, obtain a genuinely blind read-back before relying on it.

The statement quantifies over a complex number www and a natural number kkk, assumes nothing, and asserts the equality of complex numbers

∏j=0k(w+1−j)(k+1)!  =  ∏j=0k−1(w−j)k!  +  ∏j=0k(w−j)(k+1)!,\frac{\displaystyle\prod_{j=0}^{k}\bigl(w + 1 - j\bigr)}{(k+1)!} \;=\; \frac{\displaystyle\prod_{j=0}^{k-1}\bigl(w - j\bigr)}{k!} \;+\; \frac{\displaystyle\prod_{j=0}^{k}\bigl(w - j\bigr)}{(k+1)!},(k+1)!j=0∏k​(w+1−j)​=k!j=0∏k−1​(w−j)​+(k+1)!j=0∏k​(w−j)​,

which is what the three occurrences of the bundle's function C(w,m)=1m!∏j=0m−1(w−j)C(w,m) = \frac{1}{m!}\prod_{j=0}^{m-1}(w-j)C(w,m)=m!1​∏j=0m−1​(w−j) unfold to: on the left the upper index is w+1w+1w+1 and the lower index k+1k+1k+1, so the product has k+1k+1k+1 factors w+1,w,…,w+1−kw+1, w, \ldots, w+1-kw+1,w,…,w+1−k; in the first right-hand term the product has kkk factors w,w−1,…,w−k+1w, w-1, \ldots, w-k+1w,w−1,…,w−k+1; in the second it has k+1k+1k+1 factors w,w−1,…,w−kw, w-1, \ldots, w-kw,w−1,…,w−k.

Degenerate readings forced by the code:

  • The lower indices are k+1k+1k+1 and kkk, so the left-hand side never has lower index 000; the smallest instance is k=0k = 0k=0, where the assertion reads w+1=1+ww + 1 = 1 + ww+1=1+w.
  • Every w∈Cw \in \mathbb{C}w∈C is included, in particular w=0w = 0w=0 and negative integers.
  • All denominators are factorials of natural numbers, hence nonzero; no division-by-zero convention arises.

The statement is currently recorded with its proof left open.

Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me