Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, p. 8780 — if C is more insensitive than A with a regular region, φ⁻¹(p + ε) − φ⁻¹(p) ≤ φ⁻¹(ε) on [0, 1/2]

Proved
SourceTheory.EqualSources.subadditive_pmatcher_inv

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

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

Let sources A\mathcal AA and C\mathcal CC satisfy Assumption 2, and let φ\varphiφ be the pmatcher from A\mathcal AA to C\mathcal CC: a transformation with wA(p)=wC(φ(p))w_{\mathcal A}(p) = w_{\mathcal C}(\varphi(p))wA​(p)=wC​(φ(p)) for p∈[0,1]p \in [0,1]p∈[0,1]. Let ψ\psiψ be its inverse on [0,1][0,1][0,1]: ψ(φ(p))=p\psi(\varphi(p)) = pψ(φ(p))=p and φ(ψ(p))=p\varphi(\psi(p)) = pφ(ψ(p))=p for all p∈[0,1]p \in [0,1]p∈[0,1]. Let B,DB, DB,D be events such that [B,D][B, D][B,D] is regular for C\mathcal CC and C\mathcal CC is more insensitive than A\mathcal AA with region [B,D][B, D][B,D]. Then for all p,ε≥0p, \varepsilon \ge 0p,ε≥0 with p+ε≤12p + \varepsilon \le \tfrac12p+ε≤21​,

ψ(p+ε)−ψ(p)≤ψ(ε).\psi(p+\varepsilon) - \psi(p) \le \psi(\varepsilon).ψ(p+ε)−ψ(p)≤ψ(ε).

Together with the corresponding inequality for φ\varphiφ, this forces the pmatcher to be linear on [0,12][0, \tfrac12][0,21​] in the proof of Theorem 4.

Formalization Note. φ−1\varphi^{-1}φ−1 is a binder ψ\psiψ with two-sided inverse laws on [0,1][0,1][0,1], not Lean's junk-valued Function.invFun. The paper states the inequality for p>0p > 0p>0, ε>0\varepsilon > 0ε>0; the boundary cases hold trivially since ψ(0)=0\psi(0) = 0ψ(0)=0. Structural Assumption 1 is not needed and is not assumed.

Preamble
import Mathlib
import Definitions.Def_SourceTheory_Uniform_Model

open Set
Formal statement
namespace SourceTheory.EqualSources

/-- Proof of Theorem 4, p. 8780: if `𝒞` is more insensitive than `𝒜` with an insensitivity region
`[B, D]` that is regular for `𝒞`, the inverse `ψ = φ⁻¹` of the pmatcher `φ` from `𝒜` to `𝒞` satisfies
`ψ(p + ε) − ψ(p) ≤ ψ(ε)` whenever `p, ε ≥ 0` and `p + ε ≤ 1/2`. -/
theorem subadditive_pmatcher_inv {S Γ : Type*} (𝓔 : Set (Set S))
    (pref : (S → Γ) → (S → Γ) → Prop) (U : Γ → ℝ) (W : Set S → ℝ)
    (𝒜 𝒞 : 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)
    (B D : Set S) (hB : B ∈ 𝓔) (hD : D ∈ 𝓔)
    (hreg : SourceTheory.Uniform.IsRegularRegion W 𝒞 B D) (hins : SourceTheory.Uniform.IsMoreInsensitive W 𝒞 𝒜 B D)
    (φ ψ : ℝ → ℝ) (hφ : SourceTheory.Uniform.IsTransformation φ) (hφA : ∀ p ∈ Icc (0 : ℝ) 1, wA p = wC (φ p))
    (hψ : ∀ p ∈ Icc (0 : ℝ) 1, ψ (φ p) = p ∧ φ (ψ p) = p) :
    ∀ p ε : ℝ, 0 ≤ p → 0 ≤ ε → p + ε ≤ 1 / 2 → ψ (p + ε) - ψ p ≤ ψ ε := by sorry

end SourceTheory.EqualSources
Source
Baillon et al. (2025), Management Science 71(10), App. B, proof of Theorem 4, 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