Proof of Theorem 3, p. 8780 — for matching partitions, A₂ ≽ C₂ iff φ(q₂) ≥ φ(q₁+q₂) − φ(q₁)
ProvedSourceTheory.InsensMatch.weight_comparisonambiguitydecision-theoryinsensitivityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pmatcher
Assume structural Assumption 1 and Assumption 2 for sources and , and let be the pmatcher from to . Let and be threefold partitions of from and that are matching, and , and write . Then
This is the step of the proof of Theorem 3 that turns the conclusion of condition (8) into the inequality of condition (13) for .
Formalization Note. is .
Preamble
import Mathlib import Definitions.Def_SourceTheory_Uniform_Model
Formal statement
namespace SourceTheory.InsensMatch
open Set
/-- Proof of Theorem 3 (p. 8780), second step: for matching threefold partitions,
`A₂ ≽ C₂` iff `φ(q₂) ≥ φ(q₁ + q₂) − φ(q₁)`, where `qᵢ = P_𝒜(Aᵢ)`. -/
theorem weight_comparison {S Γ : Type*} (𝓔 : Set (Set S)) (pref : (S → Γ) → (S → Γ) → Prop)
(U : Γ → ℝ) (W : Set S → ℝ) (h1 : SourceTheory.Uniform.Assumption1 𝓔 pref U W)
(𝒜 𝒞 : Set (Set S)) (h𝒜 : SourceTheory.Uniform.IsSource 𝓔 W 𝒜) (h𝒞 : SourceTheory.Uniform.IsSource 𝓔 W 𝒞)
(PC PA : Set S → ℝ) (wC wA : ℝ → ℝ) (h2 : SourceTheory.Uniform.Assumption2 pref U W 𝒞 𝒜 PC PA wC wA)
(φ : ℝ → ℝ) (hφ : SourceTheory.Uniform.IsTransformation φ) (hφA : ∀ p ∈ Icc (0 : ℝ) 1, wA p = wC (φ p))
(C₁ C₂ C₃ A₁ A₂ A₃ : Set S) (hC : SourceTheory.Uniform.IsPartition3 𝒞 C₁ C₂ C₃) (hA : SourceTheory.Uniform.IsPartition3 𝒜 A₁ A₂ A₃)
(hm₁ : W A₁ = W C₁) (hm₃ : W (A₃ᶜ) = W (C₃ᶜ)) :
W C₂ ≤ W A₂ ↔ φ (PA A₁ + PA A₂) - φ (PA A₁) ≤ φ (PA A₂) := by sorry
end SourceTheory.InsensMatch
Source
Baillon et al. (2025), Management Science 71(10), proof of Theorem 3, p. 8780
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.