Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Rothe factor: Ak(x,z)=xx+kz(x+kzk)A_k(x,z)=\frac{x}{x+kz}\binom{x+kz}{k}Ak​(x,z)=x+kzx​(kx+kz​) whenever x+kz≠0x+kz\ne 0x+kz=0

Proved
NRLFormulary.rotheA_eq_div_form

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

binomial-coefficientscombinatoricsnrl-plasma-formularyspecial-functions

The two forms of the Rothe factor agree off the singular locus. Let x,zx, zx,z be complex numbers and kkk a natural number with x+kz≠0x + kz \ne 0x+kz=0. Then the polynomial form of the Rothe factor equals the quotient form:

Ak(x,z)  =  xx+kz(x+kzk),A_k(x,z) \;=\; \frac{x}{x+kz}\binom{x+kz}{k},Ak​(x,z)=x+kzx​(kx+kz​),

where A0(x,z)=1A_0(x,z) = 1A0​(x,z)=1 and Ak(x,z)=x(x+kz−1)⋯(x+kz−k+1)k!A_k(x,z) = \frac{x(x+kz-1)\cdots(x+kz-k+1)}{k!}Ak​(x,z)=k!x(x+kz−1)⋯(x+kz−k+1)​ for k≥1k \ge 1k≥1.

This is the bridge between the identity as printed in the handbook, whose summands carry the denominator x+kzx+kzx+kz, and the singularity-free form of the identity, whose summands are polynomials. It is exactly the cancellation of the factor x+kzx+kzx+kz against the leading factor of the falling factorial, and it is what lets a solver transport a proof of the polynomial identity to the printed one.

Preamble
import Mathlib
import Definitions.Def_NRLFormulary_cbinom
import Definitions.Def_NRLFormulary_rotheA
Formal statement
namespace NRLFormulary
theorem rotheA_eq_div_form (x z : ℂ) (k : ℕ) (h : x + (k : ℂ) * z ≠ 0) :
    rotheA x z k = x / (x + (k : ℂ) * z) * cbinom (x + (k : ℂ) * z) k := 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, zzz and a natural number kkk, and assumes the single hypothesis that the complex number x+kzx + kzx+kz is nonzero (with kkk coerced into C\mathbb{C}C). It then asserts the equality of complex numbers

R(x,z,k)  =  xx+kz⋅C(x+kz, k),R(x,z,k) \;=\; \frac{x}{x+kz}\cdot C(x+kz,\,k),R(x,z,k)=x+kzx​⋅C(x+kz,k),

where the two functions are the ones supplied by this bundle:

  • 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), a product of mmm factors over m!m!m!, with C(w,0)=1C(w,0) = 1C(w,0)=1;
  • R(x,z,0)=1R(x,z,0) = 1R(x,z,0)=1, and for a successor index, R(x,z,k+1)=x∏j=0k−1(x+(k+1)z−(j+1))(k+1)!R(x,z,k+1) = \frac{x\prod_{j=0}^{k-1}\bigl(x+(k+1)z-(j+1)\bigr)}{(k+1)!}R(x,z,k+1)=(k+1)!x∏j=0k−1​(x+(k+1)z−(j+1))​, a product of kkk factors x+(k+1)z−1,…,x+(k+1)z−kx+(k+1)z-1, \ldots, x+(k+1)z-kx+(k+1)z−1,…,x+(k+1)z−k.

Details the code fixes:

  • For k=0k = 0k=0 the hypothesis reads x≠0x \ne 0x=0 and the assertion reads 1=xx⋅11 = \frac{x}{x}\cdot 11=xx​⋅1.
  • The hypothesis constrains only the single value x+kzx + kzx+kz for the specific kkk in the statement; nothing is assumed for other indices.
  • The hypothesis is satisfiable (for instance x=1x = 1x=1, z=0z = 0z=0, any kkk), so the statement is not vacuous. Under it, the displayed division is an ordinary quotient and Lean's division-by-zero convention is not exercised; the remaining denominator is a factorial, hence nonzero.
  • zzz is unconstrained, and both sides are complex numbers.

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