Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, p. 8780 — for D from A, the boundary condition A₃ᶜ ≼ D means q₁ + q₂ ≤ P_A(D)

Proved
SourceTheory.InsensMatch.boundary_step

by mikedeng1 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

ambiguitydecision-theoryinsensitivityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Assume structural Assumption 1. Let A\mathcal AA be a source that is uniform with a-neutral probability PAP_{\mathcal A}PA​ and source function wAw_{\mathcal A}wA​. Let D∈AD \in \mathcal AD∈A, and let (A1,A2,A3)(A_1, A_2, A_3)(A1​,A2​,A3​) be a threefold partition of SSS from A\mathcal AA with qi=PA(Ai)q_i = P_{\mathcal A}(A_i)qi​=PA​(Ai​). Then

A3c≼D  ⟺  q1+q2≤PA(D).A_3^c \preccurlyeq D \iff q_1 + q_2 \le P_{\mathcal A}(D).A3c​≼D⟺q1​+q2​≤PA​(D).

In the proof of Theorem 3 this identifies the upper bound of φ\varphiφ's insensitivity region: the boundary condition of (8) becomes the condition p1+p2≤dp_1 + p_2 \le dp1​+p2​≤d of (13) with d=PA(D)d = P_{\mathcal A}(D)d=PA​(D), because the qqq probabilities are the arguments of φ\varphiφ.

Formalization Note. A3c≼DA_3^c \preccurlyeq DA3c​≼D is W(A3c)≤W(D)W(A_3^c) \le W(D)W(A3c​)≤W(D). The statement involves only the source A\mathcal AA, 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
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 14, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me