Rothe-Hagen identity:
ProvedNRLFormulary.rothe_hagen_identityRothe-Hagen identity. Let be complex numbers and a natural number, and write for the generalized binomial coefficient with complex upper index. Assume the identity's denominators are all non-zero, namely
- for every ,
- for every ,
- .
Then
This is the identity printed on p. 3 of the NRL Plasma Formulary, where it is stated to hold for all complex , , "except when singular"; the three hypotheses above are that proviso written out. Setting recovers the Vandermonde convolution, and the identity is the coefficient form of the multiplicativity of the generalized binomial series.
Formalization Note. The sum runs over and the complementary index is the natural-number difference , which is the ordinary difference throughout that range.
import Mathlib import Definitions.Def_NRLFormulary_cbinom
namespace NRLFormulary
theorem rothe_hagen_identity (x y z : ℂ) (n : ℕ)
(hx : ∀ k ≤ n, x + (k : ℂ) * z ≠ 0)
(hy : ∀ k ≤ n, y + (k : ℂ) * z ≠ 0)
(hxy : x + y + (n : ℂ) * z ≠ 0) :
∑ k ∈ Finset.range (n + 1),
(x / (x + (k : ℂ) * z) * cbinom (x + (k : ℂ) * z) k) *
(y / (y + ((n - k : ℕ) : ℂ) * z) * cbinom (y + ((n - k : ℕ) : ℂ) * z) (n - k))
= (x + y) / (x + y + (n : ℂ) * z) * cbinom (x + y + (n : ℂ) * z) 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 three complex numbers , , and one natural number , and assumes three hypotheses:
- for every natural number with , the complex number is nonzero;
- for every natural number with , the complex number is nonzero;
- the complex number is nonzero.
Under these hypotheses it asserts the equality of two complex numbers:
where abbreviates the function supplied by this bundle, namely , a product of factors divided by the factorial of , with .
Details the code fixes:
- The summation index runs over the values .
- The complementary index is truncated natural-number subtraction. Because for every term of the sum, it coincides with the ordinary difference; the truncation at is never reached.
- All divisions are complex divisions. By hypotheses 1-3 every denominator occurring in the statement is nonzero, so Lean's convention that division by zero yields zero is not exercised.
- The hypotheses quantify over all , hence include : they imply and .
- The hypotheses are satisfiable — for example , , any — so the statement is not vacuous. At it reduces to .
- Nothing else is assumed about , , : they may be real, zero (subject to the hypotheses), or of any argument.
The statement is currently recorded with its proof left open.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.