Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Complementary coordinate dependence factors weighted expectations

Proved
NarrowDNF.ConditionalExpectation.expectation_mul_of_complement_local

by chenghua.liu · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let III be finite, P⊆IP\subseteq IP⊆I, and p∈Rp\in\mathbb Rp∈R. Suppose F,G:{0,1}I→RF,G:\{0,1\}^I\to\mathbb RF,G:{0,1}I→R satisfy: F(x)=F(y)F(x)=F(y)F(x)=F(y) whenever x,yx,yx,y agree on PPP, and G(x)=G(y)G(x)=G(y)G(x)=G(y) whenever they agree on I∖PI\setminus PI∖P. For the finite Bernoulli product weighted sum Ep\mathbb E_pEp​,

Ep[FG]=(EpF)(EpG).\mathbb E_p[FG]=(\mathbb E_p F)(\mathbb E_p G).Ep​[FG]=(Ep​F)(Ep​G).

For 0≤p≤10\le p\le10≤p≤1, this expresses independence of observables reading complementary coordinate sets. The formal identity itself allows arbitrary real ppp, 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 sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/ConditionalIndependence.lean#L32-L51

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