Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Double cube sums factor into independent two-bit coordinate sums

Proved
NarrowDNF.ProductMeasure.sum_prod_two_coordinates

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

For a finite coordinate set III and any real-valued family Fi:{0,1}2→RF_i:\{0,1\}^2\to\mathbb RFi​:{0,1}2→R,

∑x,y∈{0,1}I∏i∈IFi(xi,yi)=∏i∈I(∑a,b∈{0,1}Fi(a,b)).\sum_{x,y\in\{0,1\}^I}\prod_{i\in I}F_i(x_i,y_i) =\prod_{i\in I}\left(\sum_{a,b\in\{0,1\}}F_i(a,b)\right).x,y∈{0,1}I∑​i∈I∏​Fi​(xi​,yi​)=i∈I∏​​a,b∈{0,1}∑​Fi​(a,b)​.

No positivity or probability normalization is required. The identity also includes the empty coordinate set. It supplies the finite distributivity step that converts the point-mass calculation for coordinatewise forcing into separate computations on individual bits.

Preamble
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Order.BigOperators.Ring.Finset
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Real.Basic
import Mathlib.Logic.Equiv.Prod
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_ProductMeasure

namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.ProductMeasure
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.ProductMeasure.sum_prod_two_coordinates (F : ι → Bool → Bool → ℝ) :
    (∑ x : ι → Bool, ∑ y : ι → Bool, ∏ i, F i (x i) (y i)) =
      ∏ i, ∑ a : Bool, ∑ b : Bool, F i a b := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/ProductMeasure.lean#L190-L205

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