Complementary coordinate dependence factors weighted expectations
ProvedNarrowDNF.ConditionalExpectation.expectation_mul_of_complement_localcombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite, , and . Suppose satisfy: whenever agree on , and whenever they agree on . For the finite Bernoulli product weighted sum ,
For , this expresses independence of observables reading complementary coordinate sets. The formal identity itself allows arbitrary real , since it needs only algebraic factorization of product weights.
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
import Theorems.Thm_NarrowDNF_ConditionalExpectation_expectation_merge
import Theorems.Thm_NarrowDNF_ProductMeasure_expectation_restrict
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_mul_of_complement_local (p : ℝ) (P : ι → Prop) [DecidablePred P]
(F G : Cube ι → ℝ)
(hF : ∀ x y, (∀ i, P i → x i = y i) → F x = F y)
(hG : ∀ x y, (∀ i, ¬ P i → x i = y i) → G x = G y) :
expectation p (fun x => F x * G x) = expectation p F * expectation p G := by sorrySource