Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Local functions factor after conditioning on their common coordinates

Proved
NarrowDNF.ConditionalExpectation.local_conditional_independence

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let III be finite, 0<p<10<p<10<p<1, and S,R⊆IS,R\subseteq IS,R⊆I. Suppose real functions F,GF,GF,G on the Boolean cube depend only on coordinates in SSS and RRR, respectively. Put H=S∩RH=S\cap RH=S∩R, and let

MHF(x)=Ep[F(X)∣X∣H=x∣H]M_HF(x)=\mathbb E_p[F(X)\mid X|_H=x|_H]MH​F(x)=Ep​[F(X)∣X∣H​=x∣H​]

be the finite weighted conditional mean; define MHGM_HGMH​G similarly. Then

Ep[FG]=Ep[(MHF)(MHG)].\mathbb E_p[FG]=\mathbb E_p[(M_HF)(M_HG)].Ep​[FG]=Ep​[(MH​F)(MH​G)].

This identifies the contribution of the shared coordinates to the product expectation. Strictly positive product weights ensure that every prescribed restriction has a well-defined positive conditioning mass.

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_ConditionalExpectation_expectation_mul_of_complement_local
import Theorems.Thm_NarrowDNF_ConditionalExpectation_moment_restriction
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.local_conditional_independence {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1)
    (S R : Finset ι) (F G : Cube ι → ℝ)
    (hF : ∀ x y, (∀ i ∈ S, x i = y i) → F x = F y)
    (hG : ∀ x y, (∀ i ∈ R, x i = y i) → G x = G y) :
    expectation p (fun x => F x * G x) =
      expectation p (fun x =>
        conditional (fun x : Cube ι => fun i : {i // i ∈ S ∩ R} => x i) (weight p) F x *
        conditional (fun x : Cube ι => fun i : {i // i ∈ S ∩ R} => x i) (weight p) G x) := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/ConditionalIndependence.lean#L53-L101

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