Weighted disjoint-pair sums
DefinitionFirst family in the weighted-pair counterexamples#✓fully proved
The family {∅, {0}} on Fin 2, used in the counterexamples of this file.
Used by 1
DefinitionSecond family in the weighted-pair counterexamples#✓fully proved
The family {∅} on Fin 2, used in the counterexamples of this file.
Used by 1
TheoremDown- and up-compressing two families can decrease disjoint pairs#✓fully proved
Down-compressing 𝒜 and up-compressing ℬ at the same coordinate can strictly decrease
the number of disjoint pairs.
theorem rby_separate_compression_strictly_decreases :
∃ (𝒜 ℬ : Finset (Finset (Fin 2))) (i : Fin 2),
(boxDoubled (Down.compression i 𝒜)
(UV.compression ({i} : Finset (Fin 2)) ∅ ℬ)).card
< (boxDoubled 𝒜 ℬ).card
noncomputable def boxDoubled (𝒜 ℬ : Finset (Finset α)) : Finset (Finset (α ⊕ α)) :=
((𝒜 ×ˢ ℬ).filter (fun p => Disjoint p.1 p.2)).image (fun p => dbl p.1 p.2)
MathlibExt/Probability/CorrelationInequalities/ReimerDoubled.lean:91
DefinitionProduct weight of a finset#✓fully proved
The product weight ∏ x, w x (x ∈ S) of the configuration with support S.
Used by 8
DefinitionProduct weight of a finset off one coordinate#✓fully proved
The product weight of S over all coordinates except i.
DefinitionWeighted number of disjoint pairs#✓fully proved
The weighted number of disjoint pairs: ∑ fwt w S * fwt w T over disjoint
(S, T) ∈ 𝒜 × ℬ.
noncomputable def wdpairs (w : α → Bool → ℝ) (𝒜 ℬ : Finset (Finset α)) : ℝ :=
∑ p ∈ (𝒜 ×ˢ ℬ).filter (fun p => Disjoint p.1 p.2), fwt w p.1 * fwt w p.2
noncomputable def fwt (w : α → Bool → ℝ) (S : Finset α) : ℝ :=
∏ x, w x (decide (x ∈ S))
MathlibExt/Probability/CorrelationInequalities/ReimerWeightedPairs.lean:121
Uses 1 · Used by 6
DefinitionWeighted number of disjoint pairs off one coordinate#✓fully proved
wdpairs with coordinate i omitted from the weights.
noncomputable def wdpairs' (w : α → Bool → ℝ) (i : α) (𝒜 ℬ : Finset (Finset α)) : ℝ :=
∑ p ∈ (𝒜 ×ˢ ℬ).filter (fun p => Disjoint p.1 p.2), fwt' w i p.1 * fwt' w i p.2
noncomputable def fwt' (w : α → Bool → ℝ) (i : α) (S : Finset α) : ℝ :=
∏ x ∈ univ.erase i, w x (decide (x ∈ S))
MathlibExt/Probability/CorrelationInequalities/ReimerWeightedPairs.lean:125
Uses 1 · Used by 2
DefinitionWeight of a family of finsets#✓fully proved
The weight ∑ S ∈ 𝒜, fwt w S of a family.
DefinitionWeight of a family off one coordinate#✓fully proved
fmarg with coordinate i omitted from the weights.
noncomputable def fmarg' (w : α → Bool → ℝ) (i : α) (𝒜 : Finset (Finset α)) : ℝ :=
∑ S ∈ 𝒜, fwt' w i S
noncomputable def fwt' (w : α → Bool → ℝ) (i : α) (S : Finset α) : ℝ :=
∏ x ∈ univ.erase i, w x (decide (x ∈ S))
MathlibExt/Probability/CorrelationInequalities/ReimerWeightedPairs.lean:125
Uses 1 · Used by 1
TheoremWeighted disjoint pairs bounded by the product of family weights#✓fully proved
For nonnegative weights, wdpairs w 𝒜 ℬ ≤ fmarg w 𝒜 * fmarg w ℬ (drop the disjointness
constraint).
theorem wdpairs_le_mul {w : α → Bool → ℝ} (hw : ∀ x b, 0 ≤ w x b) (𝒜 ℬ : Finset (Finset α)) :
wdpairs w 𝒜 ℬ ≤ fmarg w 𝒜 * fmarg w ℬ
noncomputable def wdpairs (w : α → Bool → ℝ) (𝒜 ℬ : Finset (Finset α)) : ℝ :=
∑ p ∈ (𝒜 ×ˢ ℬ).filter (fun p => Disjoint p.1 p.2), fwt w p.1 * fwt w p.2
MathlibExt/Probability/CorrelationInequalities/ReimerWeightedPairs.lean:156
noncomputable def fmarg (w : α → Bool → ℝ) (𝒜 : Finset (Finset α)) : ℝ :=
∑ S ∈ 𝒜, fwt w S
MathlibExt/Probability/CorrelationInequalities/ReimerWeightedPairs.lean:164
Uses 3
TheoremExpansion of the Reimer deficit over one coordinate#✓fully proved
The deficit fmarg w 𝒜 * fmarg w ℬ - wdpairs w 𝒜 ℬ expanded over coordinate i.
theorem wbutterfly_deficit_identity (w : α → Bool → ℝ) (𝒜 ℬ : Finset (Finset α)) (i : α) :
fmarg w 𝒜 * fmarg w ℬ - wdpairs w 𝒜 ℬ
= w i true * w i true
* (fmarg' w i (𝒜.memberSubfamily i) * fmarg' w i (ℬ.memberSubfamily i))
+ w i true * w i false
* (fmarg' w i (𝒜.memberSubfamily i) * fmarg' w i (ℬ.nonMemberSubfamily i)
- wdpairs' w i (𝒜.memberSubfamily i) (ℬ.nonMemberSubfamily i))
+ w i false * w i true
* (fmarg' w i (𝒜.nonMemberSubfamily i) * fmarg' w i (ℬ.memberSubfamily i)
- wdpairs' w i (𝒜.nonMemberSubfamily i) (ℬ.memberSubfamily i))
+ w i false * w i false
* (fmarg' w i (𝒜.nonMemberSubfamily i) * fmarg' w i (ℬ.nonMemberSubfamily i)
- wdpairs' w i (𝒜.nonMemberSubfamily i) (ℬ.nonMemberSubfamily i))
noncomputable def fmarg (w : α → Bool → ℝ) (𝒜 : Finset (Finset α)) : ℝ :=
∑ S ∈ 𝒜, fwt w S
MathlibExt/Probability/CorrelationInequalities/ReimerWeightedPairs.lean:164
noncomputable def wdpairs (w : α → Bool → ℝ) (𝒜 ℬ : Finset (Finset α)) : ℝ :=
∑ p ∈ (𝒜 ×ˢ ℬ).filter (fun p => Disjoint p.1 p.2), fwt w p.1 * fwt w p.2
MathlibExt/Probability/CorrelationInequalities/ReimerWeightedPairs.lean:156
noncomputable def fmarg' (w : α → Bool → ℝ) (i : α) (𝒜 : Finset (Finset α)) : ℝ :=
∑ S ∈ 𝒜, fwt' w i S
MathlibExt/Probability/CorrelationInequalities/ReimerWeightedPairs.lean:168
noncomputable def wdpairs' (w : α → Bool → ℝ) (i : α) (𝒜 ℬ : Finset (Finset α)) : ℝ :=
∑ p ∈ (𝒜 ×ˢ ℬ).filter (fun p => Disjoint p.1 p.2), fwt' w i p.1 * fwt' w i p.2
MathlibExt/Probability/CorrelationInequalities/ReimerWeightedPairs.lean:160
DefinitionBox value of a doubled family under a symmetric weight#✓fully proved
(∏ x, w x true)^2 * #𝒰: for a symmetric weight, the weight of a doubled family.
noncomputable def wboxValue (w : α → Bool → ℝ) (𝒰 : Finset (Finset (α ⊕ α))) : ℝ :=
(∏ x, w x true) ^ 2 * (𝒰.card : ℝ)
Used by 1
TheoremBox-value bound fails for non-symmetric weights#✓fully proved
For a non-symmetric weight, wdpairs w 𝒜 ℬ ≤ wboxValue w (boxDoubled 𝒜 ℬ) can fail.
theorem wdpairs_not_le_wboxValue_general :
∃ (w : Fin 1 → Bool → ℝ),
(∀ x b, 0 ≤ w x b) ∧
¬ (wdpairs w ({∅} : Finset (Finset (Fin 1))) {∅}
≤ wboxValue w (boxDoubled ({∅} : Finset (Finset (Fin 1))) {∅}))
noncomputable def wdpairs (w : α → Bool → ℝ) (𝒜 ℬ : Finset (Finset α)) : ℝ :=
∑ p ∈ (𝒜 ×ˢ ℬ).filter (fun p => Disjoint p.1 p.2), fwt w p.1 * fwt w p.2
MathlibExt/Probability/CorrelationInequalities/ReimerWeightedPairs.lean:156
noncomputable def wboxValue (w : α → Bool → ℝ) (𝒰 : Finset (Finset (α ⊕ α))) : ℝ :=
(∏ x, w x true) ^ 2 * (𝒰.card : ℝ)
MathlibExt/Probability/CorrelationInequalities/ReimerSymmetricWeights.lean:122
noncomputable def boxDoubled (𝒜 ℬ : Finset (Finset α)) : Finset (Finset (α ⊕ α)) :=
((𝒜 ×ˢ ℬ).filter (fun p => Disjoint p.1 p.2)).image (fun p => dbl p.1 p.2)
MathlibExt/Probability/CorrelationInequalities/ReimerDoubled.lean:91
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.