Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, p. 12 — additivity, zero truncation, merging proofness and population monotonicity characterize the fixed-fraction rules

Proved
SeqLoss.FixedFraction.theorem_1

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

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

Let φ\varphiφ be a (continuous) rule for sequentially triggered losses. Then φ\varphiφ satisfies

  1. additivity: φ(ℓ)+φ(ℓ′)=φ(ℓ+ℓ′)\varphi(\ell)+\varphi(\ell')=\varphi(\ell+\ell')φ(ℓ)+φ(ℓ′)=φ(ℓ+ℓ′),
  2. zero truncation: φi(ℓ)=φi(ℓ,0)\varphi_i(\ell)=\varphi_i(\ell,0)φi​(ℓ)=φi​(ℓ,0),
  3. merging proofness: φi(e3)+φi+1(e3)≤φi(e2)\varphi_i(e_3)+\varphi_{i+1}(e_3)\le\varphi_i(e_2)φi​(e3​)+φi+1​(e3​)≤φi​(e2​) for i=1,2i=1,2i=1,2, and
  4. population monotonicity: φi(en)≥φi(en+1)\varphi_i(e_n)\ge\varphi_i(e_{n+1})φi​(en​)≥φi​(en+1​) and φk(en)≥φk+1(en+1)\varphi_k(e_n)\ge\varphi_{k+1}(e_{n+1})φk​(en​)≥φk+1​(en+1​) for 1≤i≤j<k≤n1\le i\le j<k\le n1≤i≤j<k≤n, 1≤j<n1\le j<n1≤j<n,

if and only if there is λ∈[0,1]\lambda\in[0,1]λ∈[0,1] such that φ=φλ\varphi=\varphi^\lambdaφ=φλ, that is, for every nnn and every loss vector ℓ∈Ln\ell\in L^nℓ∈Ln,

φ1(ℓ)=λℓ1+(1−λ)L,φi(ℓ)=λℓi(i=2,…,n).\varphi_1(\ell)=\lambda\ell_1+(1-\lambda)L,\qquad \varphi_i(\ell)=\lambda\ell_i\quad(i=2,\dots,n).φ1​(ℓ)=λℓ1​+(1−λ)L,φi​(ℓ)=λℓi​(i=2,…,n).

This is the paper's main characterization: the four normative requirements leave exactly a one-parameter family of compromises between the direct liability rule (λ=1\lambda=1λ=1) and the indirect liability rule (λ=0\lambda=0λ=0).

Formalization Note. "φ=φλ\varphi=\varphi^\lambdaφ=φλ" is stated as agreement on every loss vector ℓ≥0\ell\ge 0ℓ≥0 for every nnn; a rule's values outside LnL^nLn are meaningless. Population monotonicity is Axiom 3 with the corrected range 1≤j<n1\le j<n1≤j<n: with the printed 1<j<n1<j<n1<j<n the theorem is false (counterexample in the Axioms item). λ∈[0,1]\lambda\in[0,1]λ∈[0,1] is part of the conclusion.

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

theorem theorem_1 (φ : (n : ℕ) → (Fin n → ℝ) → (Fin n → ℝ)) (hφ : IsRule φ) :
    (Additive φ ∧ ZeroTruncation φ ∧ MergingProof φ ∧ PopulationMonotone φ) ↔
    ∃ lam ∈ Set.Icc (0:ℝ) 1,
      ∀ n (ℓ : Fin n → ℝ), IsLoss ℓ → φ n ℓ = fixedFraction lam n ℓ := 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. 12, §3.3, Theorem 1
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