Proof of Theorem 4, p. 8780 — if C is more insensitive than A with a regular region, φ⁻¹(p + ε) − φ⁻¹(p) ≤ φ⁻¹(ε) on [0, 1/2]
ProvedSourceTheory.EqualSources.subadditive_pmatcher_invambiguitydecision-theoryinsensitivityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pmatcher
Let sources and satisfy Assumption 2, and let be the pmatcher from to : a transformation with for . Let be its inverse on : and for all . Let be events such that is regular for and is more insensitive than with region . Then for all with ,
Together with the corresponding inequality for , this forces the pmatcher to be linear on in the proof of Theorem 4.
Formalization Note. is a binder with two-sided inverse laws on , not Lean's junk-valued Function.invFun. The paper states the inequality for , ; the boundary cases hold trivially since . 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.