Coordinatewise OR sends two Bernoulli product cubes to bias 2p minus p squared
ProvedNarrowDNF.ProductMeasure.forcing_masscombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite, let , and let . For the finite product weights ,
The OR is taken coordinatewise. When , this says that the OR of two independent -biased cubes is a product cube of bias . The displayed finite-sum identity itself holds for every real .
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
import Theorems.Thm_NarrowDNF_ProductMeasure_sum_prod_two_coordinates
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.forcing_mass (p : ℝ) (z : ι → Bool) :
(∑ x : ι → Bool, ∑ d : ι → Bool,
if (fun i => x i || d i) = z then weight p x * weight p d else 0) =
weight (2*p-p^2) z := by sorrySource