Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 14(i) — small masses: (37), (38) for p∈(0,p0]p\in(0,p_0]p∈(0,p0​] with β=β0\beta=\beta_0β=β0​

Proved
StableVotingDistortion.lemma_14_i

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), let ϕ\phiϕ satisfy (26) with ϕ(r)+r\phi(r)+rϕ(r)+r nonincreasing on [λ,1][\lambda,1][λ,1], and let 0<p0<λ0<p_0<\lambda0<p0​<λ. Let β0>0\beta_0>0β0​>0 satisfy

β0ϕ(p0)≥1,p0(1+β0(1+ϕ(0)))≤λ,\beta_0\phi(p_0)\ge1,\qquad p_0(1+\beta_0(1+\phi(0)))\le\lambda,β0​ϕ(p0​)≥1,p0​(1+β0​(1+ϕ(0)))≤λ, p0[1−β0(ϕ(p0)−ϕ(x))]≤σ(x)for 0≤x≤λ.p_0[1-\beta_0(\phi(p_0)-\phi(x))]\le\sigma(x)\quad\text{for }0\le x\le\lambda.p0​[1−β0​(ϕ(p0​)−ϕ(x))]≤σ(x)for 0≤x≤λ.

Then (37) and (38) hold for every p∈(0,p0]p\in(0,p_0]p∈(0,p0​] with β(p)=β0\beta(p)=\beta_0β(p)=β0​ and c(p,x)=((1+β0p)ϕ(x)−(λ−x))+c(p,x)=((1+\beta_0p)\phi(x)-(\lambda-x))_+c(p,x)=((1+β0​p)ϕ(x)−(λ−x))+​.

Differences from the source:

  • reading: "ϕ\phiϕ satisfy the hypotheses of Lemma 8", and 0<p0<λ<p1<10<p_0<\lambda<p_1<10<p0​<λ<p1​<1 → the hypotheses on ϕ\phiϕ only, and 0<p0<λ0<p_0<\lambda0<p0​<λ; reason: β\betaβ and ccc are what the lemma produces, and p1p_1p1​ plays no part in (i)
  • 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]
Preamble
import Mathlib
import Definitions.Def_StableVotingDistortion_IsScoreFunction
import Definitions.Def_StableVotingDistortion_scorePrimitives
import Definitions.Def_StableVotingDistortion_VerifierHypotheses

set_option autoImplicit false
Formal statement
namespace StableVotingDistortion

/-- **Lemma 14(i) (small masses).** Let `ϕ` satisfy (26) with `ϕ(r) + r` nonincreasing on `[λ, 1]`, and let
`0 < p₀ < λ`. If `β₀ > 0` satisfies (45), then (37) and (38) hold for every `p ∈ (0, p₀]` with `β(p) = β₀` and
`c(p, x) = ((1 + β₀ p) ϕ(x) − (λ − x))₊`.

Cai et al., arXiv:2609.08259 (held version, sha256 cfdd5f3d…), Lemma 14(i), p.44: "Let ϕ satisfy the hypotheses of Lemma 8, and let 0 < p_0 < λ < p_1 < 1. (i) Let
β_0 > 0 satisfy β_0 ϕ(p_0) ≥ 1, p_0 (1 + β_0(1 + ϕ(0))) ≤ λ, p_0 [1 − β_0 (ϕ(p_0) − ϕ(x))] ≤ σ(x) for 0 ≤ x ≤ λ.
(45) Then Equations (37) and (38) hold for every p ∈ (0, p_0] with β(p) = β_0 and
c(p, x) = ((1 + β_0 p)ϕ(x) − (λ − x))_+."

**Formalization Note.** "The hypotheses of Lemma 8" are those on `ϕ`: `β` and `c` are what this lemma
produces. `p₁` of the page's opening sentence plays no part in (i) and is not a binder. -/
theorem lemma_14_i {lam : ℝ} {ϕ : ℝ → ℝ} (hϕ : IsScoreFunction lam ϕ)
    (hadd : AntitoneOn (fun r => ϕ r + r) (Set.Icc lam 1))
    {p0 : ℝ} (hp0 : 0 < p0) (hp0lam : p0 < lam) {β0 : ℝ} (hβ0 : 0 < β0)
    (h45a : 1 ≤ β0 * ϕ p0) (h45b : p0 * (1 + β0 * (1 + ϕ 0)) ≤ lam)
    (h45c : ∀ x ∈ Set.Icc 0 lam, p0 * (1 - β0 * (ϕ p0 - ϕ x)) ≤ sigma lam ϕ x) :
    ∀ p ∈ Set.Ioc 0 p0,
      Eq37 lam ϕ (fun _ => β0) (fun p x => max ((1 + β0 * p) * ϕ x - (lam - x)) 0) p ∧
        Eq38 lam ϕ (fun _ => β0) (fun p x => max ((1 + β0 * p) * ϕ x - (lam - x)) 0) p := 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…), Lemma 14(i), p.44
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