Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Vandermonde convolution over C\mathbb{C}C: ∑k=0n(xk)(yn−k)=(x+yn)\sum_{k=0}^{n}\binom{x}{k}\binom{y}{n-k}=\binom{x+y}{n}∑k=0n​(kx​)(n−ky​)=(nx+y​)

Proved
NRLFormulary.cbinom_vandermonde

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

binomial-coefficientscombinatoricsnrl-plasma-formularyspecial-functions

Vandermonde convolution with complex parameters. For all complex numbers x,yx, yx,y and every natural number nnn,

∑k=0n(xk)(yn−k)  =  (x+yn),\sum_{k=0}^{n} \binom{x}{k}\binom{y}{n-k} \;=\; \binom{x+y}{n},k=0∑n​(kx​)(n−ky​)=(nx+y​),

with (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).

This is the case z=0z = 0z=0 of the Rothe-Hagen identity, and the classical convolution identity for binomial coefficients extended from natural-number to complex upper indices. It is the natural first milestone of the mission: it needs the same complex-upper-index machinery as the goal but none of the Rothe factor's cancellation, and it is the base case against which any polynomial-identity argument for the general statement is calibrated.

Preamble
import Mathlib
import Definitions.Def_NRLFormulary_cbinom
Formal statement
namespace NRLFormulary
theorem cbinom_vandermonde (x y : ℂ) (n : ℕ) :
    ∑ k ∈ Finset.range (n + 1), cbinom x k * cbinom y (n - k) = cbinom (x + y) n := 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 two complex numbers xxx, yyy and a natural number nnn, assumes nothing, and asserts the equality of complex numbers

∑k=0nC(x,k) C(y, n−k)  =  C(x+y, n),\sum_{k=0}^{n} C(x,k)\,C(y,\,n-k) \;=\; C(x+y,\,n),k=0∑n​C(x,k)C(y,n−k)=C(x+y,n),

where 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) is the function supplied by this bundle, a product of mmm factors divided by m!m!m!, with C(w,0)=1C(w,0) = 1C(w,0)=1.

Details the code fixes:

  • The index kkk runs over the n+1n+1n+1 values 0,1,…,n0, 1, \ldots, n0,1,…,n.
  • n−kn-kn−k is truncated natural-number subtraction; since k≤nk \le nk≤n throughout the sum, it is the ordinary difference and the truncation is never reached.
  • There are no hypotheses: xxx and yyy are arbitrary complex numbers, possibly zero, possibly natural numbers, possibly negative integers, and nnn may be 000, in which case the assertion reads 1=11 = 11=1.
  • All divisions are by factorials of natural numbers, hence never by zero.

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