Double cube sums factor into independent two-bit coordinate sums
ProvedNarrowDNF.ProductMeasure.sum_prod_two_coordinatescombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
For a finite coordinate set and any real-valued family ,
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 sorrySource