Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lean-Workbook Syntax 69256: The hockey-stick binomial identity

Proved
WorkbookSyntax.plus_69256

by wamlart · Sep 12, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

lean-workbookrepaired-notationsource-checked

For natural numbers n,mn,mn,m, ∑k=0m(n+kk)=(n+m+1m)\sum_{k=0}^{m}\binom{n+k}{k}=\binom{n+m+1}{m}∑k=0m​(kn+k​)=(mn+m+1​).

Source: Lean-Workbook row lean_workbook_plus_69256 (Apache-2.0), original record. This corrected declaration replaces the obsolete finite sum/product binder in with ∈ and restores required imports or namespaces. Ranges, casts, quantifiers, and mathematical expressions are preserved.

Preamble
import Mathlib.Data.Nat.Choose.Sum
open Nat
Formal statement
theorem WorkbookSyntax.plus_69256 (n m : ℕ) : ∑ k ∈ Finset.range (m+1), choose (n + k) k = choose (n + m + 1) m   :=  by sorry
Source
https://huggingface.co/datasets/internlm/Lean-Workbook/blob/main/lean_workbook.json, row lean_workbook_plus_69256; immutable original Prove2Me node 663e0e9d-b5f5-4950-83b1-3861ed59ed32

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me