Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma A.2 — increasing weights against nonpositive partial sums give a positive weighted sum

Proved
StochFictPlay.Supermodular.lemmaA2_weighted_sum_pos

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

inequalitiesp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1summation-by-parts

Let b1<b2<⋯<bnb_1 < b_2 < \dots < b_nb1​<b2​<⋯<bn​ be a strictly increasing sequence of reals and let c1,…,cnc_1, \dots, c_nc1​,…,cn​ be reals satisfying condition (13):

∑k=1jck≤0  for all j≤n,  with strict inequality for some j and equality at j=n.\sum_{k=1}^{j} c_k \le 0 \ \text{ for all } j \le n,\ \text{ with strict inequality for some } j \text{ and equality at } j = n.k=1∑j​ck​≤0  for all j≤n,  with strict inequality for some j and equality at j=n.

Then

∑k=1nbkck>0.\sum_{k=1}^{n} b_k c_k > 0.k=1∑n​bk​ck​>0.

This summation-by-parts fact is what converts stochastic dominance into strict increasing differences in the proof of Theorem 5.1.

Formalization Note Indices are 0-based; the partial sum ∑k=1jck\sum_{k=1}^j c_k∑k=1j​ck​ is the sum over indices below jjj. The paper prints the conclusion as ∑i=1nbkck\sum_{i=1}^n b_k c_k∑i=1n​bk​ck​, a typographical slip for ∑k=1nbkck\sum_{k=1}^n b_k c_k∑k=1n​bk​ck​, which is what is stated.

Preamble
import Mathlib
Formal statement
namespace StochFictPlay.Supermodular

/-- Lemma A.2 (Hofbauer–Sandholm 2002, manuscript p. 28). Let `b₁ < b₂ < … < bₙ` be strictly
increasing and let `c₁, …, cₙ` satisfy condition (13): every partial sum `∑_{k ≤ j} c_k` is
`≤ 0`, at least one is `< 0`, and the full sum is `0`. Then `∑_k b_k c_k > 0`.
Indices are 0-based: the partial sum `∑_{k=1}^{j} c_k` is the sum over `k.val < j`. The page
prints the conclusion as `∑_{i=1}^{n} b_k c_k`, a slip for `∑_{k=1}^{n}`; the corrected sum is
stated. -/
theorem lemmaA2_weighted_sum_pos (n : ℕ) (b c : Fin n → ℝ) (hb : StrictMono b)
    (hc_le : ∀ j : ℕ, j ≤ n → ∑ k : Fin n, (if k.val < j then c k else 0) ≤ 0)
    (hc_lt : ∃ j : ℕ, j ≤ n ∧ ∑ k : Fin n, (if k.val < j then c k else 0) < 0)
    (hc_eq : ∑ k : Fin n, c k = 0) :
    0 < ∑ k : Fin n, b k * c k := by sorry

end StochFictPlay.Supermodular
Source
Hofbauer and Sandholm, On the Global Convergence of Stochastic Fictitious Play, Econometrica 70 (2002); authors' manuscript of February 21, 2002, p. 28, Lemma A.2 and condition (13)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me