Proposition 2 (p. 12) on the tree problems e_n ≡ (T_n, ℓ_n) (p. 17) — PM and MP iff φ(e_n) = φ^λ(e_n)
ProvedSeqLoss.TreeRules.proposition_2_treesaxiomatic-characterizationcost-sharingliabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1trees
Let be a rule on loss trees and let with and the unit loss on . Then satisfies population monotonicity and merging proofness if and only if there is such that, for each ,
Concretely and, for , .
The paper proves Proposition 2 for the linear model and states (p. 17) that population monotonicity and merging proofness "extend immediately to the new setting"; this is that extension, the elementary-problem half of Theorem 4.
Formalization Note Population monotonicity uses the range (the page prints , under which the linear Proposition 2 is false).
Preamble
import Mathlib import Definitions.Def_SeqLoss_TreeRules_Setting import Definitions.Def_SeqLoss_TreeRules_Axioms
Formal statement
namespace SeqLoss.TreeRules
theorem proposition_2_trees (φ : Finset (ℕ × ℕ) → (ℕ × ℕ → ℝ) → ℕ → ℝ)
(hφ : IsTreeRule φ) :
(TreePopulationMonotone φ ∧ TreeMergingProof φ) ↔
∃ lam ∈ Set.Icc (0 : ℝ) 1, ∀ n : ℕ, 1 ≤ n → ∀ i ∈ Finset.Icc 1 n,
φ (treeChain n) (chainLoss n) i = fixedFractionTree lam (treeChain n) (chainLoss n) i := by sorry
end SeqLoss.TreeRules
Source
Gudmundsson, Hougaard & Ko, Sharing Sequentially Triggered Losses, accepted manuscript (2023), p. 12, Proposition 2, applied to e_n ≡ (T_n, ℓ_n) as stated on p. 17
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.