Vandermonde convolution over :
ProvedNRLFormulary.cbinom_vandermondeVandermonde convolution with complex parameters. For all complex numbers and every natural number ,
with .
This is the case 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.
import Mathlib import Definitions.Def_NRLFormulary_cbinom
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 NRLFormularyRead-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 , and a natural number , assumes nothing, and asserts the equality of complex numbers
where is the function supplied by this bundle, a product of factors divided by , with .
Details the code fixes:
- The index runs over the values .
- is truncated natural-number subtraction; since throughout the sum, it is the ordinary difference and the truncation is never reached.
- There are no hypotheses: and are arbitrary complex numbers, possibly zero, possibly natural numbers, possibly negative integers, and may be , in which case the assertion reads .
- All divisions are by factorials of natural numbers, hence never by zero.
The statement is currently recorded with its proof left open.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.