Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, p. 10 — additivity and zero truncation hold iff φi(ℓ)=∑j≥iℓj φi(ej)\varphi_i(\ell)=\sum_{j\ge i}\ell_j\,\varphi_i(e_j)φi​(ℓ)=∑j≥i​ℓj​φi​(ej​)

Proved
SeqLoss.FixedFraction.proposition_1

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

axiomatic-characterizationcost-sharingliabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

A rule φ\varphiφ satisfies additivity and zero truncation if and only if, for each nnn, each ℓ∈Ln\ell\in L^nℓ∈Ln and each agent i∈{1,…,n}i\in\{1,\dots,n\}i∈{1,…,n},

φi(ℓ)=∑j≥iℓj⋅φi(ej),\varphi_i(\ell)=\sum_{j\ge i}\ell_j\cdot\varphi_i(e_j),φi​(ℓ)=j≥i∑​ℓj​⋅φi​(ej​),

where the sum runs over j=i,…,nj=i,\dots,nj=i,…,n and ej=(0,…,0,1)∈Lje_j=(0,\dots,0,1)\in L^jej​=(0,…,0,1)∈Lj is the elementary jjj-loss problem (agent i≤ji\le ji≤j is an agent of eje_jej​).

The proposition reduces the choice of an additive, zero-truncating rule to its values on the elementary problems.

Formalization Note. Agents are 0-based. The term φi(ej)\varphi_i(e_j)φi​(ej​) is φ (j+1) (elem (j+1)) ⟨i, _⟩ for 0-based i≤ji\le ji≤j; the sum is written over all jjj with the summand 000 for j<ij<ij<i. Both sides are compared on loss vectors only.

Preamble
import Mathlib
import Definitions.Def_SeqLoss_FixedFraction_Setting
import Definitions.Def_SeqLoss_FixedFraction_Axioms
Formal statement
namespace SeqLoss.FixedFraction

theorem proposition_1 (φ : (n : ℕ) → (Fin n → ℝ) → (Fin n → ℝ)) (hφ : IsRule φ) :
    (Additive φ ∧ ZeroTruncation φ) ↔
    ∀ n (ℓ : Fin n → ℝ), IsLoss ℓ → ∀ i : Fin n,
      φ n ℓ i = ∑ j : Fin n,
        if h : i ≤ j then ℓ j * φ (j.val + 1) (elem (j.val + 1)) ⟨i.val, Nat.lt_succ_of_le h⟩
        else 0 := by sorry

end SeqLoss.FixedFraction
Source
Gudmundsson, Hougaard & Ko, Sharing Sequentially Triggered Losses: Automated Conflict Resolution Through Smart Contracts, accepted manuscript (2023), Management Science 70(3) 1773–1786, doi:10.1287/mnsc.2023.4772, p. 10, §3.1, Proposition 1; proof Appendix A, p. 22
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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