Finite Fubini across a coordinate partition
ProvedNarrowDNF.ConditionalExpectation.expectation_mergecombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite, , , and . For any coordinate set , write for the finite sum weighted by . If and are assignments on and , let be their merged assignment. Then
This is the finite product decomposition of expectation. As an identity of weighted sums, it holds for every real , including outside the probability range.
Preamble
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Order.BigOperators.Ring.Finset
import Mathlib.Data.Bool.Basic
import Mathlib.Data.Finset.Lattice.Fold
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Real.Basic
import Mathlib.Logic.Equiv.Prod
import Mathlib.Order.Monotone.Basic
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_Adaptive
import Definitions.Def_NarrowDNF_ConditionalExpectation
import Definitions.Def_NarrowDNF_ProductMeasure
namespace NarrowDNF.ConditionalExpectation
end NarrowDNF.ConditionalExpectation
namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.ConditionalExpectation
open ProductMeasure
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.ConditionalExpectation.expectation_merge (p : ℝ) (P : ι → Prop) [DecidablePred P] (F : Cube ι → ℝ) :
expectation p F = expectation p (fun z => expectation p (fun y => F (merge P z y))) := by sorrySource