Proof of Theorem 3, p. 8780 — for D from A, the boundary condition A₃ᶜ ≼ D means q₁ + q₂ ≤ P_A(D)
ProvedSourceTheory.InsensMatch.boundary_stepambiguitydecision-theoryinsensitivityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Assume structural Assumption 1. Let be a source that is uniform with a-neutral probability and source function . Let , and let be a threefold partition of from with . Then
In the proof of Theorem 3 this identifies the upper bound of 's insensitivity region: the boundary condition of (8) becomes the condition of (13) with , because the probabilities are the arguments of .
Formalization Note. is . The statement involves only the source , so the second source and Assumption 2 are not assumed.
Preamble
import Mathlib import Definitions.Def_SourceTheory_Uniform_Model
Formal statement
namespace SourceTheory.InsensMatch
open Set
/-- Proof of Theorem 3 (p. 8780), boundary step: for `D` from `𝒜` and a threefold partition
`(A₁, A₂, A₃)` from `𝒜`, `A₃ᶜ ≼ D` iff `q₁ + q₂ ≤ P_𝒜(D)`, where `qᵢ = P_𝒜(Aᵢ)`. -/
theorem boundary_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 𝒜) (PA : Set S → ℝ) (wA : ℝ → ℝ)
(hPA : SourceTheory.Uniform.IsUniformWith pref U 𝒜 PA) (hwA : SourceTheory.Uniform.IsSourceFunction W 𝒜 PA wA)
(D : Set S) (hD : D ∈ 𝒜) (A₁ A₂ A₃ : Set S) (hA : SourceTheory.Uniform.IsPartition3 𝒜 A₁ A₂ A₃) :
W (A₃ᶜ) ≤ W D ↔ PA A₁ + PA A₂ ≤ PA D := 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.