Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, p. 16 — each fixed-fraction rule φ^λ, λ ∈ [0, 1], is a rule on loss trees

Proved
SeqLoss.TreeRules.fixedFractionTree_isTreeRule

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

cost-sharingfixed-fraction-ruleliabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1trees

Let λ∈[0,1]\lambda\in[0,1]λ∈[0,1] and let φλ\varphi^\lambdaφλ be the fixed-fraction rule on trees (Definition 2): for a tree TTT with root rrr and a loss ℓ≥0\ell\ge 0ℓ≥0,

φiλ(T,ℓ)=λ∑ij∈Tℓ(ij)+[i=r] (1−λ)L,L=∑e∈Tℓ(e).\varphi^\lambda_i(T,\ell)=\lambda\sum_{ij\in T}\ell(ij)+[i=r]\,(1-\lambda)L,\qquad L=\sum_{e\in T}\ell(e).φiλ​(T,ℓ)=λij∈T∑​ℓ(ij)+[i=r](1−λ)L,L=e∈T∑​ℓ(e).

Then φλ\varphi^\lambdaφλ is a rule on loss trees: for every tree TTT and loss ℓ\ellℓ, the liabilities of the agents i∈N(T)i\in N(T)i∈N(T) are non-negative and sum to LLL; φλ\varphi^\lambdaφλ is invariant to agent labels (for every bijection π\piπ of N\mathbb NN and every loss ℓπ\ell^\piℓπ agreeing with ℓ\ellℓ on TπT^\piTπ, φiλ(T,ℓ)=φπ(i)λ(Tπ,ℓπ)\varphi^\lambda_i(T,\ell)=\varphi^\lambda_{\pi(i)}(T^\pi,\ell^\pi)φiλ​(T,ℓ)=φπ(i)λ​(Tπ,ℓπ)); and φiλ(T,aℓ)→φiλ(T,ℓ)\varphi^\lambda_i(T,a\ell)\to\varphi^\lambda_i(T,\ell)φiλ​(T,aℓ)→φiλ​(T,ℓ) as a→1a\to 1a→1.

The paper introduces Definition 2 with the remark that the fixed-fraction rules "extend in a straightforward way" to trees. This statement makes the remark precise and is the first half of the "if" direction of Theorem 4.

Preamble
import Mathlib
import Definitions.Def_SeqLoss_TreeRules_Setting
Formal statement
namespace SeqLoss.TreeRules

theorem fixedFractionTree_isTreeRule (lam : ℝ) (hlam : lam ∈ Set.Icc (0 : ℝ) 1) :
    IsTreeRule (fixedFractionTree lam) := by sorry

end SeqLoss.TreeRules
Source
Gudmundsson, Hougaard & Ko, Sharing Sequentially Triggered Losses, accepted manuscript (2023), p. 16, §5, sentence before Definition 2, and footnote 9
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