Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, p. 8780 — (C₁,C₂,C₃) matches (A₁,A₂,A₃) iff φ(q₁) = p₁ and φ(q₁+q₂) = p₁+p₂

Proved
SourceTheory.InsensMatch.matching_partitions

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

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

Assume structural Assumption 1 and Assumption 2 for sources C\mathcal CC and A\mathcal AA, and let φ\varphiφ be the pmatcher from A\mathcal AA to C\mathcal CC (a transformation with wA=wC∘φw_{\mathcal A} = w_{\mathcal C} \circ \varphiwA​=wC​∘φ on [0,1][0,1][0,1]). Let (C1,C2,C3)(C_1, C_2, C_3)(C1​,C2​,C3​) be a threefold partition of SSS from C\mathcal CC and (A1,A2,A3)(A_1, A_2, A_3)(A1​,A2​,A3​) one from A\mathcal AA, with a-neutral probabilities pi=PC(Ci)p_i = P_{\mathcal C}(C_i)pi​=PC​(Ci​) and qi=PA(Ai)q_i = P_{\mathcal A}(A_i)qi​=PA​(Ai​). The partitions are matching (A1∼C1A_1 \sim C_1A1​∼C1​ and A3c∼C3cA_3^c \sim C_3^cA3c​∼C3c​) if and only if

φ(q1)=p1andφ(q1+q2)=p1+p2.\varphi(q_1) = p_1 \quad\text{and}\quad \varphi(q_1 + q_2) = p_1 + p_2.φ(q1​)=p1​andφ(q1​+q2​)=p1​+p2​.

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 WWW: W(A1)=W(C1)W(A_1) = W(C_1)W(A1​)=W(C1​) and W(A3c)=W(C3c)W(A_3^c) = W(C_3^c)W(A3c​)=W(C3c​). 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
  • 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