Proof of Theorem 3, p. 8780 — (C₁,C₂,C₃) matches (A₁,A₂,A₃) iff φ(q₁) = p₁ and φ(q₁+q₂) = p₁+p₂
ProvedSourceTheory.InsensMatch.matching_partitionsambiguitydecision-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 (a transformation with on ). Let be a threefold partition of from and one from , with a-neutral probabilities and . The partitions are matching ( and ) if and only if
This is the first step of the paper's proof of Theorem 3: it rewrites the premise of Definition 4's conditions (8)–(9) as two values of the pmatcher.
Formalization Note. Matching is written with : and . Partitions may have empty cells.
Preamble
import Mathlib import Definitions.Def_SourceTheory_Uniform_Model
Formal statement
namespace SourceTheory.InsensMatch
open Set
/-- Proof of Theorem 3 (p. 8780), first step: threefold partitions `(C₁, C₂, C₃)` from `𝒞` and
`(A₁, A₂, A₃)` from `𝒜` are matching (`A₁ ~ C₁` and `A₃ᶜ ~ C₃ᶜ`) iff `φ(q₁) = p₁` and
`φ(q₁ + q₂) = p₁ + p₂`, where `qᵢ = P_𝒜(Aᵢ)` and `pᵢ = P_𝒞(Cᵢ)`. -/
theorem matching_partitions {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₃) :
(W A₁ = W C₁ ∧ W (A₃ᶜ) = W (C₃ᶜ)) ↔
(φ (PA A₁) = PC C₁ ∧ φ (PA A₁ + PA A₂) = PC C₁ + PC C₂) := 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.