OAI/Analysis/FiniteFactor/FiniteProductMixture.lean
10 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.FiniteFactor.finiteChoiceLawline 14 - instance
OAI.FiniteFactor.finiteChoiceLaw_probabilityline 19 - def
OAI.FiniteFactor.finiteAverageLawline 23 - instance
OAI.FiniteFactor.finiteAverageLaw_probabilityline 28 - theorem
OAI.FiniteFactor.finiteChoiceLaw_update_baseline 32 - theorem
OAI.FiniteFactor.finiteChoiceLaw_update_replaceline 42 - theorem
OAI.FiniteFactor.finiteAverageLaw_insertline 52 - theorem
OAI.FiniteFactor.coordinateUpdateLaw_smul_rightline 65 - theorem
OAI.FiniteFactor.coordinateUpdateLaw_finset_sumline 72 - theorem
OAI.FiniteFactor.finiteAverageLaw_eq_sumline 83Source documentation
The finite independent diagonal-or-replacement mixture is an exact finite sum of the laws for each replacement pattern.
theorem finiteAverageLaw_eq_sum (μ ν : ι → Measure X) [∀ i, IsProbabilityMeasure (μ i)] [∀ i, IsProbabilityMeasure (ν i)] (F : Finset ι) : finiteAverageLaw μ ν F = ((2 : ℝ≥0∞)⁻¹)^F.card • ∑ I ∈ F.powerset, finiteChoiceLaw μ ν I := by …Mentions: OAI.FiniteFactor.finiteAverageLaw, OAI.FiniteFactor.finiteChoiceLaw