Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (3.17) — (k+d−1k)=(k+d−1)!k!(d−1)!≤(k+d−1)d−1\binom{k+d-1}{k} = \frac{(k+d-1)!}{k!(d-1)!} \le (k+d-1)^{d-1}(kk+d−1​)=k!(d−1)!(k+d−1)!​≤(k+d−1)d−1

Proved
ScenarioApproach.Removal.choose_le_pow

by mikedeng1 · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1scenario-approach

For all natural numbers k≥0k \ge 0k≥0 and d≥1d \ge 1d≥1,

(k+d−1k)=(k+d−1)!k! (d−1)!≤(k+d−1)d−1.\binom{k+d-1}{k} = \frac{(k+d-1)!}{k!\,(d-1)!} \le (k+d-1)^{d-1}.(kk+d−1​)=k!(d−1)!(k+d−1)!​≤(k+d−1)d−1.

This elementary estimate controls the combinatorial factor in the bound (3.13) of Theorem 3.9 and is used in the derivation of the explicit violation level εk\varepsilon_kεk​ of Theorem 1.2.

Formalization Note The equality is stated in R\mathbb RR (factorials cast to reals) and the inequality in N\mathbb NN, with 00=10^0 = 100=1. The hypothesis d≥1d \ge 1d≥1 makes the natural-number subtractions k+d−1k+d-1k+d−1 and d−1d-1d−1 exact.

Preamble
import Mathlib
Formal statement
namespace ScenarioApproach.Removal

theorem choose_le_pow (k d : ℕ) (hd : 1 ≤ d) :
    ((k + d - 1).choose k : ℝ) =
        ((k + d - 1).factorial : ℝ) / ((k.factorial : ℝ) * ((d - 1).factorial : ℝ)) ∧
      (k + d - 1).choose k ≤ (k + d - 1) ^ (d - 1) := by sorry

end ScenarioApproach.Removal
Source
Campi & Garatti, Introduction to the Scenario Approach, SIAM/MOS 2018, DOI 10.1137/1.9781611975444, p. 48, Eq. (3.17)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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