Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sentence after (19): ∑i=0l(m+im)=(m+l+1l)\sum_{i=0}^{l}\binom{m+i}{m} = \binom{m+l+1}{l}∑i=0l​(mm+i​)=(lm+l+1​)

Proved
KempeCloning.binomial_normalization

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-cloningquantum-informationquantum-opticsstimulated-emission

For all natural numbers mmm and lll,

∑i=0l(m+im)=(m+l+1l).\sum_{i=0}^{l}\binom{m+i}{m} = \binom{m+l+1}{l}.i=0∑l​(mm+i​)=(lm+l+1​).

This is the identity the paper quotes to show that the cloner states ∣Fl⟩|\mathcal F_l\rangle∣Fl​⟩ of (19) are normalized: the squared amplitudes of ∣Fl⟩|\mathcal F_l\rangle∣Fl​⟩ are (m+l−im)/(m+l+1l)\binom{m+l-i}{m}/\binom{m+l+1}{l}(mm+l−i​)/(lm+l+1​), i=0,…,li = 0,\dots,li=0,…,l.

Differences from the source:

  • reading: the identity for the m,lm, lm,l of (19), "for arbitrary NNN and mmm" (p.5) → every m,l∈Nm, l\in\mathbb Nm,l∈N, including m=0m = 0m=0; reason: the page does not exclude m=0m = 0m=0; the stronger reading is taken
Preamble
import Mathlib
Formal statement
namespace KempeCloning

/-- **The binomial identity behind the normalization of `|F_l⟩`.**
Kempe, Simon, Weihs, arXiv:quant-ph/0003025v1, Sec. II C, sentence after (19), p.5: "To see that
|F_l⟩ is properly normalized note that Σ_{i=0}^{l} binom(m+i, m) = binom(m+l+1, l)."

For all natural numbers `m, l`: `Σ_{i=0}^{l} binom(m + i, m) = binom(m + l + 1, l)`. -/
theorem binomial_normalization (m l : ℕ) :
    ∑ i ∈ Finset.range (l + 1), (m + i).choose m = (m + l + 1).choose l := by sorry

end KempeCloning
Source
Kempe, Simon, Weihs, Λ's, V's, and optimal cloning with stimulated emission, arXiv:quant-ph/0003025v1, Sec. II C, sentence after (19), p.5
Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 30, 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