Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 — for equal losses the midpoint rule φ1/2(ℓ)\varphi^{1/2}(\ell)φ1/2(ℓ) is at equal Euclidean distance from c1,…,cnc_1,\dots,c_nc1​,…,cn​

Proved
SeqLoss.Equidistance.theorem_2

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

cost-sharingeuclidean-distancefixed-fraction-ruleliabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n≥1n\ge 1n≥1 and let ℓ∈Ln\ell\in L^nℓ∈Ln be a loss problem with equal losses, ℓ1=⋯=ℓn\ell_1=\dots=\ell_nℓ1​=⋯=ℓn​, and total LLL. Let ck=(L/k,…,L/k,0,…,0)c_k=(L/k,\dots,L/k,0,\dots,0)ck​=(L/k,…,L/k,0,…,0), with kkk entries L/kL/kL/k, be the ideal allocations, k=1,…,nk=1,\dots,nk=1,…,n. Then the midpoint fixed-fraction allocation

φ1/2(ℓ)=(ℓ12+L2, ℓ22,…,ℓn2)\varphi^{1/2}(\ell)=\Big(\frac{\ell_1}{2}+\frac L2,\ \frac{\ell_2}{2},\dots,\frac{\ell_n}{2}\Big)φ1/2(ℓ)=(2ℓ1​​+2L​, 2ℓ2​​,…,2ℓn​​)

is at equal Euclidean distance from all of them:

d(φ1/2(ℓ),ck)=d(φ1/2(ℓ),ck′)for all k,k′∈{1,…,n}.d\big(\varphi^{1/2}(\ell),c_k\big)=d\big(\varphi^{1/2}(\ell),c_{k'}\big)\qquad\text{for all }k,k'\in\{1,\dots,n\}.d(φ1/2(ℓ),ck​)=d(φ1/2(ℓ),ck′​)for all k,k′∈{1,…,n}.

Each ckc_kck​ is the allocation most favourable to agent k+1k+1k+1 (and cnc_ncn​ to agent 111) among the ordered allocations, so the theorem says that the midpoint rule treats all agents' ideal outcomes alike, which is the paper's first normative argument for λ=1/2\lambda=1/2λ=1/2.

Formalization Note The paper's N\mathbb NN starts at 111, hence n≥1n\ge 1n≥1. Distances are Euclidean (Mathlib's EuclideanSpace ℝ (Fin n)), not the sup distance on Fin n → ℝ.

Preamble
import Mathlib
import Definitions.Def_SeqLoss_FixedFraction_Setting
import Definitions.Def_SeqLoss_Equidistance_IdealAllocations
Formal statement
namespace SeqLoss.Equidistance
theorem theorem_2 (n : ℕ) (hn : 0 < n) (ℓ : Fin n → ℝ) (hℓ : SeqLoss.FixedFraction.IsLoss ℓ)
    (heq : ∀ i j, ℓ i = ℓ j) :
    ∀ k k' : ℕ, 1 ≤ k → k ≤ n → 1 ≤ k' → k' ≤ n →
      euclDist (SeqLoss.FixedFraction.fixedFraction (1 / 2) n ℓ) (ideal ℓ k) =
        euclDist (SeqLoss.FixedFraction.fixedFraction (1 / 2) n ℓ) (ideal ℓ k') := by sorry
end SeqLoss.Equidistance
Source
Gudmundsson, Hougaard & Ko, Sharing Sequentially Triggered Losses, accepted manuscript (2023), p. 14, Theorem 2
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