Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.2, p. 8779 — (8) ⇔ (A.1) and (9) ⇔ (A.2): insensitivity with weak premises

Proved
SourceTheory.Uniform.lemma_A_2

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

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

Work under structural Assumption 1, let A\mathcal AA, C\mathcal CC be sources and BBB, DDD arbitrary sets. All quantifiers below range over ordered threefold partitions (C1,C2,C3)(C_1,C_2,C_3)(C1​,C2​,C3​) of SSS from C\mathcal CC and (A1,A2,A3)(A_1,A_2,A_3)(A1​,A2​,A3​) from A\mathcal AA.

  1. Equation (8), W(A1)=W(C1) & W(A3c)=W(C3c)≤W(D)⇒W(A2)≥W(C2)W(A_1)=W(C_1)\ \&\ W(A_3^c)=W(C_3^c)\le W(D)\Rightarrow W(A_2)\ge W(C_2)W(A1​)=W(C1​) & W(A3c​)=W(C3c​)≤W(D)⇒W(A2​)≥W(C2​), holds for all such partitions if and only if
W(C1)≥W(A1) & W(C3c)≤W(A3c)≤W(D) ⟹ W(A2)≥W(C2)(A.1)W(C_1)\ge W(A_1)\ \&\ W(C_3^c)\le W(A_3^c)\le W(D)\ \Longrightarrow\ W(A_2)\ge W(C_2) \quad (A.1)W(C1​)≥W(A1​) & W(C3c​)≤W(A3c​)≤W(D) ⟹ W(A2​)≥W(C2​)(A.1)

holds for all such partitions. 2. Equation (9), W(B)≤W(A1)=W(C1) & W(A3c)=W(C3c)⇒W(A2c)≤W(C2c)W(B)\le W(A_1)=W(C_1)\ \&\ W(A_3^c)=W(C_3^c)\Rightarrow W(A_2^c)\le W(C_2^c)W(B)≤W(A1​)=W(C1​) & W(A3c​)=W(C3c​)⇒W(A2c​)≤W(C2c​), holds for all such partitions if and only if

W(C3c)≤W(A3c) & W(C1)≥W(A1)≥W(B) ⟹ W(A2c)≤W(C2c)(A.2)W(C_3^c)\le W(A_3^c)\ \&\ W(C_1)\ge W(A_1)\ge W(B)\ \Longrightarrow\ W(A_2^c)\le W(C_2^c) \quad (A.2)W(C3c​)≤W(A3c​) & W(C1​)≥W(A1​)≥W(B) ⟹ W(A2c​)≤W(C2c​)(A.2)

holds for all such partitions.

Together, A\mathcal AA is more insensitive than C\mathcal CC with region [B,D][B,D][B,D] (Definition 4) exactly when (A.1) and (A.2) hold. These weak-premise forms are the ones used in the proof of Theorem 1.

Preamble
import Mathlib
import Definitions.Def_SourceTheory_Uniform_Model
Formal statement
namespace SourceTheory.Uniform

open Set

/-- Lemma A.2 (p. 8779): over all threefold partitions `(C₁, C₂, C₃)` from `𝒞` and
`(A₁, A₂, A₃)` from `𝒜`, Equation (8) is equivalent to (A.1), and Equation (9) is equivalent
to (A.2). -/
theorem lemma_A_2 {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 𝒞) (B D : Set S) :
    ((∀ C₁ C₂ C₃ A₁ A₂ A₃ : Set S, IsPartition3 𝒞 C₁ C₂ C₃ → IsPartition3 𝒜 A₁ A₂ A₃ →
        W A₁ = W C₁ → W (A₃ᶜ) = W (C₃ᶜ) → W (C₃ᶜ) ≤ W D → W C₂ ≤ W A₂) ↔
      (∀ C₁ C₂ C₃ A₁ A₂ A₃ : Set S, IsPartition3 𝒞 C₁ C₂ C₃ → IsPartition3 𝒜 A₁ A₂ A₃ →
        W A₁ ≤ W C₁ → W (C₃ᶜ) ≤ W (A₃ᶜ) → W (A₃ᶜ) ≤ W D → W C₂ ≤ W A₂)) ∧
    ((∀ C₁ C₂ C₃ A₁ A₂ A₃ : Set S, IsPartition3 𝒞 C₁ C₂ C₃ → IsPartition3 𝒜 A₁ A₂ A₃ →
        W B ≤ W A₁ → W A₁ = W C₁ → W (A₃ᶜ) = W (C₃ᶜ) → W (A₂ᶜ) ≤ W (C₂ᶜ)) ↔
      (∀ C₁ C₂ C₃ A₁ A₂ A₃ : Set S, IsPartition3 𝒞 C₁ C₂ C₃ → IsPartition3 𝒜 A₁ A₂ A₃ →
        W (C₃ᶜ) ≤ W (A₃ᶜ) → W A₁ ≤ W C₁ → W B ≤ W A₁ → W (A₂ᶜ) ≤ W (C₂ᶜ))) := by sorry

end SourceTheory.Uniform
Source
Baillon et al. (2025), Management Science 71(10), Lemma A.2, (A.1), (A.2), p. 8779; Equations (8), (9), p. 8772
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