Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equations (32)–(33) — the offset slice does not lower the mean

Proved
StableVotingDistortion.eq_33

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

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

Let λ∈(0,1)\lambda\in(0,1)λ∈(0,1), ϕ\phiϕ satisfy (26), DDD be a gϕg_\phigϕ​-stable lottery, ρ≥0\rho\ge0ρ≥0 with ρ(a⋆)=0\rho(a^\star)=0ρ(a⋆)=0, and t≥0t\ge0t≥0. Assume A>0A>0A>0 and 0<pt<10<p_t<10<pt​<1, and let β(p)≥0\beta(p)\ge0β(p)≥0 and c(p,x)≥0c(p,x)\ge0c(p,x)≥0 for p∈(0,1)p\in(0,1)p∈(0,1) and x∈[0,λ)x\in[0,\lambda)x∈[0,λ). With q~v(t)\tilde q_v(t)q~​v​(t) defined by (32),

Ev[qv(t)]≤Ev[q~v(t)].\mathbb E_v[q_v(t)]\le\mathbb E_v[\tilde q_v(t)].Ev​[qv​(t)]≤Ev​[q~​v​(t)].

The cases pt∈{0,1}p_t\in\{0,1\}pt​∈{0,1} and A=0A=0A=0 are treated separately on pp.30–31 and are part of Lemma 8, not of this item.

Differences from the source:

  • encoding: β:(0,1)→R≥0\beta:(0,1)\to\mathbb R_{\ge0}β:(0,1)→R≥0​, c:(0,1)×[0,λ)→R≥0c:(0,1)\times[0,\lambda)\to\mathbb R_{\ge0}c:(0,1)×[0,λ)→R≥0​ → total functions constrained only on those domains; reason: Lean functions are total; only printed arguments are used
  • encoding: ϕ:[0,1]→R\phi:[0,1]\to\mathbb Rϕ:[0,1]→R → a function ℝ → ℝ constrained only 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_voterMean
import Definitions.Def_StableVotingDistortion_IsGStable
import Definitions.Def_StableVotingDistortion_IsScoreFunction
import Definitions.Def_StableVotingDistortion_scorePrimitives
import Definitions.Def_StableVotingDistortion_slices
import Definitions.Def_StableVotingDistortion_offset

set_option autoImplicit false

open PctDistortion
Formal statement
namespace StableVotingDistortion

/-- **Equations (32)–(33).** For a `g_ϕ`-stable lottery under (26), `ρ ≥ 0` with `ρ(a⋆) = 0`, `t ≥ 0`, `A > 0`,
`0 < p_t < 1`, `β ≥ 0` on `(0, 1)` and `c ≥ 0` on `(0, 1) × [0, λ)`, the offset slice of (32) satisfies
`E_v[q_v(t)] ≤ E_v[q̃_v(t)]`.

Cai et al., arXiv:2609.08259 (held version, sha256 cfdd5f3d…), §6.3.1, Equations (32), (33), p.29: "let A = E_v[1{s_v<λ}ϕ(s_v)] and assume for now that A > 0 and
0 < p_t < 1. Given β(p) ≥ 0 and c(p, x) ≥ 0 for p ∈ (0, 1) and x < λ, we define q̃_v(t) = q_v(t) + β(p_t)k_v(t) +
{c(p_t, s_v), s_v < λ; ϕ(s_v) c̄(p_t), s_v ≥ λ}, c̄(p) = E_v[1{s_v<λ}c(p, s_v)]/A. (32)" and "Consequently,
E_v[q_v(t)] ≤ E_v[q̃_v(t)]. (33)" -/
theorem eq_33 {V C : Type} [Fintype V] [Nonempty V] [Fintype C] [Nonempty C] (E : Election V C)
    {lam : ℝ} {ϕ β : ℝ → ℝ} {c : ℝ → ℝ → ℝ} (hϕ : IsScoreFunction lam ϕ)
    {D ρ : C → ℝ} (hD : IsGStable (gPhi ϕ) E D) (hρ : ∀ b, 0 ≤ ρ b) {aStar : C} (hstar : ρ aStar = 0)
    {t : ℝ} (ht : 0 ≤ t) (hA : 0 < Aval lam ϕ E D aStar)
    (hpt : pt D ρ t ∈ Set.Ioo (0 : ℝ) 1)
    (hβ : ∀ p ∈ Set.Ioo (0 : ℝ) 1, 0 ≤ β p)
    (hc : ∀ p ∈ Set.Ioo (0 : ℝ) 1, ∀ x ∈ Set.Ico 0 lam, 0 ≤ c p x) :
    voterMean (fun v => qv E D ρ v t) ≤ voterMean (fun v => qTilde lam ϕ β c E D ρ aStar v t) := 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 (32), (33), p.29
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