Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, p. 8780 — for matching (C₁,C₂), (A₁,A₂): φ(q₁) = p₁, and A₂ ≼ C₂ iff φ(q₂) ≤ 1 − φ(1 − q₂)

Proved
SourceTheory.PrefMatch.theorem_2_matching_step

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

ambiguitydecision-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pmatchersource-preference

Assume structural Assumption 1 and Assumption 2 for sources C\mathcal CC and A\mathcal AA, and let φ\varphiφ be a transformation with wA=wC∘φw_{\mathcal A} = w_{\mathcal C} \circ \varphiwA​=wC​∘φ on [0,1][0,1][0,1]. Let (C1,C2)(C_1, C_2)(C1​,C2​) be a twofold partition from C\mathcal CC and (A1,A2)(A_1, A_2)(A1​,A2​) one from A\mathcal AA that are matching, W(A1)=W(C1)W(A_1) = W(C_1)W(A1​)=W(C1​), 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​). Then φ(q1)=p1\varphi(q_1) = p_1φ(q1​)=p1​, and

A2≼C2  ⟺  φ(q2)≤1−φ(1−q2).A_2 \preccurlyeq C_2 \iff \varphi(q_2) \le 1 - \varphi(1 - q_2).A2​≼C2​⟺φ(q2​)≤1−φ(1−q2​).

This is the computation in the proof of Theorem 2: since p2=1−p1=1−φ(q1)=1−φ(1−q2)p_2 = 1 - p_1 = 1 - \varphi(q_1) = 1 - \varphi(1-q_2)p2​=1−p1​=1−φ(q1​)=1−φ(1−q2​), the conclusion of source preference (6) at a matching pair is the dislike inequality of φ\varphiφ at q2q_2q2​.

Formalization Note. Twofold partitions are (C1,C1c)(C_1, C_1^c)(C1​,C1c​) and (A1,A1c)(A_1, A_1^c)(A1​,A1c​), so q2=PA(A1c)q_2 = P_{\mathcal A}(A_1^c)q2​=PA​(A1c​); A2≼C2A_2 \preccurlyeq C_2A2​≼C2​ is W(A1c)≤W(C1c)W(A_1^c) \le W(C_1^c)W(A1c​)≤W(C1c​).

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
  • 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