Approximate agreement under common belief #
This file proves the p-belief version of Aumann's agreement theorem.
The set of states where the posterior probability of E is at least p.
Instances For
A set is p-evident for a partition if membership implies p-belief in itself.
Equations
- P.IsEvidentBelief μ p E = (E ⊆ P.belief μ p E)
Instances For
Common p-belief at a state, represented by an evident event containing that state.
Equations
- AgreeToDisagree.IsCommonBeliefAt P μ p C ω = ∃ (E : Set Ω), ω ∈ E ∧ (∀ (i : ι), (P i).IsEvidentBelief μ p E) ∧ ∀ (i : ι), E ⊆ (P i).belief μ p C
Instances For
Monotonicity of belief: X ⊆ Y implies P.belief μ p X ⊆ P.belief μ p Y.
The belief set equals a union over partition atoms with sufficient conditional probability.
For a measurable countable partition P, the belief set P.belief μ p X is measurable.
The downward step of belief idempotence.
If A is p-evident with 0 < p, then μ A > 0.
A set of positive measure is nonempty.
If A ⊆ P.belief μ p {ω | P.probabilityAt μ E ω = r}, then probability equals r on A.
Helpers for core_bound #
Core bound (Step 4 of the informal proof).