All proofs
Project-declaredLean 4.33.0-rc1 · mathlib@79d0395a1825

Sum of rdist eq step cond Mutual Info

sum_of_rdist_eq_step_condMutualInfo

Plain-language statement

For four measurable random variables Y0,Y1,Y2,Y3Y_0,Y_1,Y_2,Y_3 in a finite abelian group, the conditional mutual-information term used in the fibring identity can be reduced to I ⁣[(Y0Y1,Y2Y3):(Y0Y2,Y1Y3)|Y0Y1Y2+Y3]=I[Y0Y1:Y1Y3Y0Y1Y2+Y3].I\!\left[(Y_0-Y_1,Y_2-Y_3):(Y_0-Y_2,Y_1-Y_3)\,\middle|\,Y_0-Y_1-Y_2+Y_3\right]=I[Y_0-Y_1:Y_1-Y_3\mid Y_0-Y_1-Y_2+Y_3].

Exact Lean statement

lemma sum_of_rdist_eq_step_condMutualInfo {Y : Fin 4 → Ω → G}
    (h_meas : ∀ i, Measurable (Y i)) :
    I[⟨Y 0 - Y 1, Y 2 - Y 3⟩:⟨Y 0 - Y 2, Y 1 - Y 3⟩|Y 0 - Y 1 - (Y 2 - Y 3);μ] =
    I[Y 0 - Y 1 : Y 1 - Y 3|Y 0 - Y 1 - Y 2 + Y 3;μ]

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma sum_of_rdist_eq_step_condMutualInfo {Y : Fin 4  Ω  G}    (h_meas :  i, Measurable (Y i)) :    I[Y 0 - Y 1, Y 2 - Y 3:Y 0 - Y 2, Y 1 - Y 3|Y 0 - Y 1 - (Y 2 - Y 3);μ] =    I[Y 0 - Y 1 : Y 1 - Y 3|Y 0 - Y 1 - Y 2 + Y 3;μ] := by  suffices I[Y 0 - Y 1, Y 2 - Y 3:Y 0 - Y 2, Y 1 - Y 3|Y 0 - Y 1 - (Y 2 - Y 3);μ] =    I[Y 0 - Y 1 : Y 1 - Y 3|Y 0 - Y 1 - (Y 2 - Y 3) ; μ] by convert this using 2; abel  symm  have hm (f : G  G  G × G) {a b i j k l : Fin 4} :    Measurable (uncurry f ∘ Y i - Y j - (Y k - Y l), Y a - Y b) := by fun_prop  have hmf : Measurable fun ω  ((Y 0 - Y 1) ω, (Y 0 - Y 1) ω - (Y 0 - Y 1 - (Y 2 - Y 3)) ω) :=    hm (fun z x  (x, x - z))  have hmg : Measurable fun ω  ((Y 1 - Y 3) ω + (Y 0 - Y 1 - (Y 2 - Y 3)) ω, (Y 1 - Y 3) ω) :=    hm (fun z x  (x + z, x))  have hmij {i j : Fin 4} : Measurable (Y i - Y j) := (h_meas _).sub (h_meas _)  have hm0123 {i j k l : Fin 4} : Measurable (Y i - Y j - (Y k - Y l)) :=    ((h_meas _).sub (h_meas _)).sub ((h_meas _).sub (h_meas _))  rw [ condMutualInfo_of_inj_map hmij hmij hm0123 (fun z x  (x, x - z)),    condMutualInfo_comm hmf hmij,     condMutualInfo_of_inj_map hmij hmf hm0123 (fun z x  (x + z, x)),    condMutualInfo_comm hmg hmf]  · congr! 3 with ω    · simp    · rw [sub_sub, add_sub_left_comm,  sub_sub]      simp  · exact fun _ _ _ h  (Prod.ext_iff.1 h).2  exact fun _ _ _ h  (Prod.ext_iff.1 h).1
Project
Polynomial Freiman-Ruzsa project
License
Apache-2.0
Commit
a177b2e4abe4
Source
PFR/Fibring.lean:120-145

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.33.0-rc1

Approx hom pfr

approx_hom_pfr

Project documentation

An approximate-homomorphism theorem for finite elementary abelian 22-groups. Let f:GGf:G\to G' and K>0K>0. If at least a proportion K1K^{-1} of pairs (x,y)G2(x,y)\in G^2 satisfy f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y), then there are an additive homomorphism φ:GG\varphi:G\to G' and a constant cGc\in G' such that f(x)=φ(x)+cf(x)=\varphi(x)+c for at least G/(2144K122)|G|/(2^{144}K^{122}) values of xx.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Better PFR conjecture

better_PFR_conjecture

Plain-language statement

If AF2nA \subset {\bf F}_2^n is finite non-empty with A+AKA|A+A| \leq K|A|, then there exists a subgroup HH of F2n{\bf F}_2^n with HA|H| \leq |A| such that AA can be covered by at most 2K92K^9 translates of HH.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Better PFR conjecture

better_PFR_conjecture'

Project documentation

Polynomial Freiman-Ruzsa theorem with exponent 99, without a finite ambient-group assumption. Let AA be a nonempty finite subset of an elementary abelian 22-group. If A+AKA|A+A|\le K|A|, then there are a finite subspace HH and a finite set cc such that Ac+HA\subseteq c+H, c<2K9|c|<2K^9, and HA|H|\le|A|.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record