Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2 — cancelability extends from a single good to any set disjoint from S ∪ T

Proved
RoundRobinEq.CancelableBluff.lemma_2_2

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

cancelable-valuationsfair-divisionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let v:2M→Rv : 2^M \to \mathbb Rv:2M→R be cancelable, and let S,T,R⊆MS, T, R \subseteq MS,T,R⊆M with R∩(S∪T)=∅R \cap (S \cup T) = \emptysetR∩(S∪T)=∅. Then

  1. v(S∪R)>v(T∪R)  ⟹  v(S)>v(T)v(S \cup R) > v(T \cup R) \;\Longrightarrow\; v(S) > v(T)v(S∪R)>v(T∪R)⟹v(S)>v(T);
  2. v(S)≥v(T)  ⟹  v(S∪R)≥v(T∪R)v(S) \ge v(T) \;\Longrightarrow\; v(S \cup R) \ge v(T \cup R)v(S)≥v(T)⟹v(S∪R)≥v(T∪R);
  3. v(S)=v(T)  ⟹  v(S∪R)=v(T∪R)v(S) = v(T) \;\Longrightarrow\; v(S \cup R) = v(T \cup R)v(S)=v(T)⟹v(S∪R)=v(T∪R).
v(S∪R)>v(T∪R)⇒v(S)>v(T),v(S)≥v(T)⇒v(S∪R)≥v(T∪R).v(S \cup R) > v(T \cup R) \Rightarrow v(S) > v(T), \qquad v(S) \ge v(T) \Rightarrow v(S \cup R) \ge v(T \cup R).v(S∪R)>v(T∪R)⇒v(S)>v(T),v(S)≥v(T)⇒v(S∪R)≥v(T∪R).

Cancelability is defined by adding one good; the lemma says that adding a whole set of fresh goods to both sides never reverses a comparison. It is the tool behind Lemma 3.3 and the observation that, for cancelable valuations, a good of largest singleton value also has the largest marginal value.

Formalization Note The page reads "R⊆M∖S∪TR \subseteq M \setminus S \cup TR⊆M∖S∪T", which means R⊆M∖(S∪T)R \subseteq M \setminus (S \cup T)R⊆M∖(S∪T); it is stated as Disjoint R (S ∪ T). The page writes viv_ivi​ for vvv inside the statement. The lemma assumes only cancelability: the page's codomain R≥0\mathbb R_{\ge 0}R≥0​ and the standing monotonicity are not used, so the Lean statement takes any real-valued cancelable vvv (a statement at least as strong as the page's).

Preamble
import Mathlib
import Definitions.Def_RoundRobinEq_CancelableBluff_Setting
Formal statement
namespace RoundRobinEq.CancelableBluff

theorem lemma_2_2 {M : Type*} [DecidableEq M] (v : Finset M → ℝ) (hv : IsCancelable v)
    (S T R : Finset M) (hR : Disjoint R (S ∪ T)) :
    (v (T ∪ R) < v (S ∪ R) → v T < v S) ∧
      (v T ≤ v S → v (T ∪ R) ≤ v (S ∪ R)) ∧
      (v S = v T → v (S ∪ R) = v (T ∪ R)) := by sorry

end RoundRobinEq.CancelableBluff
Source
Amanatidis et al., Round-Robin Beyond Additive Agents, arXiv:2301.13652v1, p. 5, Lemma 2.2
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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