Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equations (28)⇒(29) — the per-threshold bounds integrate to λRv\lambda R_vλRv​

Proved
StableVotingDistortion.eq_29

by iris · Nov 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

metric-distortionp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1social-choicevoting-ruleszero-sum-games

Let DDD be a lottery and ρ:C→R≥0\rho:C\to\mathbb R_{\ge0}ρ:C→R≥0​ with ρ(a⋆)=0\rho(a^\star)=0ρ(a⋆)=0. Let W:[0,1]→R≥0W:[0,1]\to\mathbb R_{\ge0}W:[0,1]→R≥0​ be nondecreasing, vvv a voter, and q~v\tilde q_vq~​v​ integrable on (0,∞)(0,\infty)(0,∞) such that for every t≥0t\ge0t≥0,

q~v(t)≤λ−W(qv(t)),q~v(t)≤W(z)−W(qv(t))  if zv(t)≤z≤sv.\tilde q_v(t)\le\lambda-W(q_v(t)),\qquad \tilde q_v(t)\le W(z)-W(q_v(t))\ \text{ if }z_v(t)\le z\le s_v.q~​v​(t)≤λ−W(qv​(t)),q~​v​(t)≤W(z)−W(qv​(t))  if zv​(t)≤z≤sv​.

Then

∫0∞q~v(t) dt≤λRv.\int_0^\infty\tilde q_v(t)\,dt\le\lambda R_v.∫0∞​q~​v​(t)dt≤λRv​.

Differences from the source:

  • generalization: §6.3.1's setting: DDD a gϕg_\phigϕ​-stable lottery, ϕ\phiϕ satisfying (26), λ∈(0,1)\lambda\in(0,1)λ∈(0,1) → any lottery D ∈ stdSimplex ℝ C, no ϕ\phiϕ, and any real lam; reason: the telescoping argument of p.28 uses only (27), (28) and W≥0W\ge0W≥0; the page's instance satisfies these hypotheses, so the statement specializes to the page's
  • encoding: q~v\tilde q_vq~​v​ with ∫0∞q~v\int_0^\infty\tilde q_v∫0∞​q~​v​ → the hypothesis IntegrableOn qT (Set.Ioi 0); reason: q~v\tilde q_vq~​v​ is arbitrary here and a Bochner integral of a non-integrable function is 000; the q~v\tilde q_vq~​v​ of (32) is piecewise constant and satisfies it
  • encoding: W:[0,1]→R≥0W:[0,1]\to\mathbb R_{\ge0}W:[0,1]→R≥0​ → W : ℝ → ℝ, monotone and nonnegative on [0, 1]; reason: Lean functions are total; every printed argument lies in [0,1][0,1][0,1]
  • encoding: nnn voters and a finite set CCC → [Fintype V] [Nonempty V] [Fintype C] [Nonempty C], with V C : Type; reason: an expectation over voters and a lottery over candidates need both nonempty
Preamble
import Mathlib
import Definitions.Def_PctDistortion_Election
import Definitions.Def_StableVotingDistortion_rhoV
import Definitions.Def_StableVotingDistortion_slices

set_option autoImplicit false

open PctDistortion
Formal statement
namespace StableVotingDistortion

/-- **Equations (28) ⇒ (29).** Let `W : [0, 1] → ℝ≥0` be nondecreasing, `v` a voter, and `q̃_v` integrable on
`(0, ∞)` with, for every `t ≥ 0`, `q̃_v(t) ≤ λ − W(q_v(t))` and `q̃_v(t) ≤ W(z) − W(q_v(t))` whenever
`z_v(t) ≤ z ≤ s_v`. Then `∫_0^∞ q̃_v(t) dt ≤ λ R_v`.

Cai et al., arXiv:2609.08259 (held version, sha256 cfdd5f3d…), §6.3.1, Equations (28), (29), pp.27–28: "find a nondecreasing function W : [0, 1] → R≥0 such that for
every v and t ≥ 0, q̃_v(t) ≤ λ − W(q_v(t)), q̃_v(t) ≤ W(z) − W(q_v(t)) if z_v(t) ≤ z ≤ s_v. (28)" and "and so
∫_0^∞ q̃_v(t) dt ≤ λR_v. (29)"

**Formalization Note.** `q̃_v` is arbitrary here, so its integrability is a hypothesis: a Bochner integral
of a non-integrable function would be `0`. The `q̃_v` of (32) is piecewise constant and satisfies it. -/
theorem eq_29 {V C : Type} [Fintype V] [Nonempty V] [Fintype C] [Nonempty C] (E : Election V C)
    {D ρ : C → ℝ} (hD : D ∈ stdSimplex ℝ C) (hρ : ∀ c, 0 ≤ ρ c) {aStar : C} (hstar : ρ aStar = 0)
    (lam : ℝ) {W : ℝ → ℝ} (hWmono : MonotoneOn W (Set.Icc 0 1))
    (hWnonneg : ∀ z ∈ Set.Icc (0 : ℝ) 1, 0 ≤ W z) (v : V) {qT : ℝ → ℝ}
    (hint : MeasureTheory.IntegrableOn qT (Set.Ioi 0))
    (h28a : ∀ t, 0 ≤ t → qT t ≤ lam - W (qv E D ρ v t))
    (h28b : ∀ t, 0 ≤ t → ∀ z, zv E D ρ v t ≤ z → z ≤ sv E D aStar v →
      qT t ≤ W z - W (qv E D ρ v t)) :
    ∫ t in Set.Ioi (0 : ℝ), qT t ≤ lam * Rv E ρ v := by sorry

end StableVotingDistortion
Source
Cai, Frank, Hastings, Ramakrishnan, Wang, Ye, Stable Voting Rules on the Edge of Optimal Metric Distortion, arXiv:2609.08259 (held version, sha256 cfdd5f3d…), §6.3.1, Equations (28), (29), pp.27–28
Human review
  • Endorsed by Shuze Chen · Nov 7, 2026

    Confirmed by the moderator at approval.

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