Proof of Theorem 3, p. 8780 — the dual case (9)/(14): A₂ᶜ ≼ C₂ᶜ iff φ(q₁+q₂) − φ(q₁) ≤ 1 − φ(q₁+q₃), and B ≼ A₁ iff P_A(B) ≤ q₁
ProvedSourceTheory.InsensMatch.dual_stepambiguitydecision-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 matching threefold partitions of from and (, ), with , and let . Then
These are the two translations behind the paper's remark that "Equations (9) and (14) are similar": the conclusion of (9) becomes the inequality of (14), and the boundary condition of (9) becomes with .
Formalization Note. is , and is . The paper states this step in one sentence; the two clauses spell out its two halves, mirroring the weight comparison and the boundary step for (8)/(13).
Preamble
import Mathlib import Definitions.Def_SourceTheory_Uniform_Model
Formal statement
namespace SourceTheory.InsensMatch
open Set
/-- Proof of Theorem 3 (p. 8780), the dual case (9)/(14): for matching threefold partitions,
`A₂ᶜ ≼ C₂ᶜ` iff `φ(q₁ + q₂) − φ(q₁) ≤ 1 − φ(q₁ + q₃)`, and for `B` from `𝒜`, `B ≼ A₁` iff
`P_𝒜(B) ≤ q₁`, where `qᵢ = P_𝒜(Aᵢ)`. -/
theorem dual_step {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₃ᶜ)) (B : Set S) (hB : B ∈ 𝒜) :
(W (A₂ᶜ) ≤ W (C₂ᶜ) ↔ φ (PA A₁ + PA A₂) - φ (PA A₁) ≤ 1 - φ (PA A₁ + PA A₃)) ∧
(W B ≤ W A₁ ↔ PA B ≤ 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.