Proof of Theorem 2, p. 8780 — for matching (C₁,C₂), (A₁,A₂): φ(q₁) = p₁, and A₂ ≼ C₂ iff φ(q₂) ≤ 1 − φ(1 − q₂)
ProvedSourceTheory.PrefMatch.theorem_2_matching_stepambiguitydecision-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pmatchersource-preference
Assume structural Assumption 1 and Assumption 2 for sources and , and let be a transformation with on . Let be a twofold partition from and one from that are matching, , with a-neutral probabilities and . Then , and
This is the computation in the proof of Theorem 2: since , the conclusion of source preference (6) at a matching pair is the dislike inequality of at .
Formalization Note. Twofold partitions are and , so ; is .
Preamble
import Mathlib import Definitions.Def_SourceTheory_Uniform_Model
Formal statement
namespace SourceTheory.PrefMatch
open Set SourceTheory.Uniform
/-- Proof of Theorem 2 (p. 8780): for matching twofold partitions `(C₁, C₂)` from `𝒞` and
`(A₁, A₂)` from `𝒜` (`C₂ = C₁ᶜ`, `A₂ = A₁ᶜ`), `φ(q₁) = p₁`, and `A₂ ≼ C₂` is equivalent to
`φ(q₂) ≤ 1 − φ(1 − q₂)`, where `pᵢ = P_𝒞(Cᵢ)` and `qᵢ = P_𝒜(Aᵢ)`. -/
theorem theorem_2_matching_step {S Γ : Type*} (𝓔 : Set (Set S))
(pref : (S → Γ) → (S → Γ) → Prop) (U : Γ → ℝ) (W : Set S → ℝ) (h1 : Assumption1 𝓔 pref U W)
(𝒜 𝒞 : Set (Set S)) (h𝒜 : IsSource 𝓔 W 𝒜) (h𝒞 : IsSource 𝓔 W 𝒞)
(PC PA : Set S → ℝ) (wC wA : ℝ → ℝ) (h2 : Assumption2 pref U W 𝒞 𝒜 PC PA wC wA)
(φ : ℝ → ℝ) (hφ : IsTransformation φ) (hφA : ∀ p ∈ Icc (0 : ℝ) 1, wA p = wC (φ p)) :
∀ C₁ ∈ 𝒞, ∀ A₁ ∈ 𝒜, W A₁ = W C₁ →
φ (PA A₁) = PC C₁ ∧ (W (A₁ᶜ) ≤ W (C₁ᶜ) ↔ φ (PA (A₁ᶜ)) ≤ 1 - φ (1 - PA (A₁ᶜ))) := by sorry
end SourceTheory.PrefMatch
Source
Baillon et al. (2025), Management Science 71(10), App. B, proof of Theorem 2, p. 8780
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.