Proof of Theorem 2, p. 24 — the prefix system forces and, for equal losses,
ProvedSeqLoss.Equidistance.prefix_system_solutioncost-sharingfixed-fraction-rulep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let , let have total , and let satisfy . Suppose that for some
Then
- ;
- if moreover , then , that is and .
Together with the previous milestone this shows that, for equal losses, an allocation equidistant from the ideal allocations can only be the midpoint rule's.
Formalization Note The paper determines "through "; the intended equation is , which is the hypothesis here. Agents are 0-based.
Preamble
import Mathlib import Definitions.Def_SeqLoss_FixedFraction_Setting import Definitions.Def_SeqLoss_Equidistance_IdealAllocations
Formal statement
namespace SeqLoss.Equidistance
theorem prefix_system_solution {n : ℕ} (hn : 0 < n) (ℓ x : Fin n → ℝ) (α : ℝ)
(hsum : ∑ i, x i = SeqLoss.FixedFraction.total ℓ)
(hsys : ∀ k : ℕ, 1 ≤ k → k ≤ n →
(∑ i ∈ Finset.univ.filter (fun i : Fin n => i.val < k), x i) - SeqLoss.FixedFraction.total ℓ / 2 = α * (k : ℝ)) :
α = SeqLoss.FixedFraction.total ℓ / (2 * (n : ℝ)) ∧
((∀ i j, ℓ i = ℓ j) → x = SeqLoss.FixedFraction.fixedFraction (1 / 2) n ℓ) := by sorry
end SeqLoss.Equidistance
Source
Gudmundsson, Hougaard & Ko, Sharing Sequentially Triggered Losses, accepted manuscript (2023), p. 24, Appendix A, proof of Theorem 2, from "Rearranging" to the end of the proof
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.