Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 3, p. 25 — edge-by-edge decomposition φ(T, ℓ) = Σ_{jk∈T} ℓ(jk) φ(T, ℓ_k)

Proved
SeqLoss.TreeRules.edge_decomposition

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

cost-sharingliabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1trees

Let φ\varphiφ be a rule on loss trees that satisfies tree additivity. For an edge eee write ℓe\ell_eℓe​ for the loss that is 111 on eee and 000 everywhere else. Then for every tree TTT and loss ℓ≥0\ell\ge 0ℓ≥0,

φi(T,ℓ)=∑e∈Tℓ(e) φi(T,ℓe)for each i∈N(T).\varphi_i(T,\ell)=\sum_{e\in T}\ell(e)\,\varphi_i(T,\ell_e)\qquad\text{for each } i\in N(T).φi​(T,ℓ)=e∈T∑​ℓ(e)φi​(T,ℓe​)for each i∈N(T).

The page writes ℓk\ell_kℓk​ for the unit loss on the edge jkjkjk. The decomposition reduces every problem to problems with a single unit loss.

Formalization Note The loss ℓ\ellℓ is defined on all of N×N\mathbb N\times\mathbb NN×N and need not vanish off TTT; the identity holds as stated, because a rule assigns zero to every agent for losses that vanish on TTT (balance and non-negativity).

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

theorem edge_decomposition (φ : Finset (ℕ × ℕ) → (ℕ × ℕ → ℝ) → ℕ → ℝ)
    (hφ : IsTreeRule φ) (hadd : TreeAdditive φ) (T : Finset (ℕ × ℕ)) (hT : IsTree T)
    (ℓ : ℕ × ℕ → ℝ) (hℓ : IsTreeLoss ℓ) :
    ∀ i ∈ N T, φ T ℓ i = ∑ e ∈ T, ℓ e * φ T (Pi.single e 1) i := by sorry

end SeqLoss.TreeRules
Source
Gudmundsson, Hougaard & Ko, Sharing Sequentially Triggered Losses, accepted manuscript (2023), p. 25, Appendix A, proof of Proposition 3, first display
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