Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Obs. 1, p. 8779, with (5), p. 8771 — the a-neutral probability of a uniform source takes every value in [0, 1]

Proved
SourceTheory.PrefMatch.source_prob_range

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

convex-rangednessdecision-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1source-of-uncertainty

Assume structural Assumption 1 for (≽,U,W)(\succcurlyeq, U, W)(≽,U,W) on the events E\mathcal EE. Let A\mathcal AA be a source (a subalgebra of E\mathcal EE on which WWW is convex ranged) that is uniform with a-neutral probability measure PAP_{\mathcal A}PA​, and let wAw_{\mathcal A}wA​ be its source function, so that W=wA∘PAW = w_{\mathcal A} \circ P_{\mathcal A}W=wA​∘PA​ on A\mathcal AA. Then PAP_{\mathcal A}PA​ takes every value in [0,1][0,1][0,1]:

∀q∈[0,1]  ∃A∈A: PA(A)=q.\forall q \in [0,1]\ \ \exists A \in \mathcal A : \ P_{\mathcal A}(A) = q.∀q∈[0,1]  ∃A∈A: PA​(A)=q.

The paper proves this for risk in the proof of Observation 1 ("Convex rangedness implies that www's domain is the entire [0,1][0,1][0,1]") and states that the case of a uniform source is identical. It is what lets every probability p∈[0,1]p \in [0,1]p∈[0,1] be realized by an event of the source, so that conditions on events translate into conditions on wAw_{\mathcal A}wA​ for all ppp.

Formalization Note. The probability measure is only finitely additive; the paper defers the general (finitely additive) proof to its Online Appendix A.

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

open Set SourceTheory.Uniform

/-- Proof of Observation 1 (p. 8779), applied to a uniform source by (5) (p. 8771): convex
rangedness forces the a-neutral probability `P_𝒜` of a uniform source to take every value in
`[0, 1]`. -/
theorem source_prob_range {S Γ : Type*} (𝓔 : Set (Set S)) (pref : (S → Γ) → (S → Γ) → Prop)
    (U : Γ → ℝ) (W : Set S → ℝ) (h1 : Assumption1 𝓔 pref U W)
    (𝒜 : Set (Set S)) (h𝒜 : IsSource 𝓔 W 𝒜) (PA : Set S → ℝ) (wA : ℝ → ℝ)
    (hPA : IsUniformWith pref U 𝒜 PA) (hwA : IsSourceFunction W 𝒜 PA wA) :
    ∀ q ∈ Icc (0 : ℝ) 1, ∃ A ∈ 𝒜, PA A = q := by sorry

end SourceTheory.PrefMatch
Source
Baillon et al. (2025), Management Science 71(10), App. B, proof of Observation 1, p. 8779, applied to a uniform source per (5), p. 8771
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