Proof of Proposition 3, p. 25 — tree additivity and continuity imply scale invariance
ProvedSeqLoss.TreeRules.scale_invariancecost-sharingliabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1trees
Let be a rule on loss trees (non-negative, balanced, label-invariant and continuous) that satisfies tree additivity. Then for every tree , loss and ,
This is the tree analogue of Lemma 1 and the first step of the proof of Proposition 3: it lets a loss on one edge be normalized to .
Preamble
import Mathlib import Definitions.Def_SeqLoss_TreeRules_Setting import Definitions.Def_SeqLoss_TreeRules_Axioms
Formal statement
namespace SeqLoss.TreeRules
theorem scale_invariance (φ : Finset (ℕ × ℕ) → (ℕ × ℕ → ℝ) → ℕ → ℝ)
(hφ : IsTreeRule φ) (hadd : TreeAdditive φ) (T : Finset (ℕ × ℕ)) (hT : IsTree T)
(ℓ : ℕ × ℕ → ℝ) (hℓ : IsTreeLoss ℓ) (α : ℝ) (hα : 0 ≤ α) :
∀ i ∈ N T, φ T (α • ℓ) i = α * φ T ℓ 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 sentence after 'Let T ∈ 𝒯'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.