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

Sum of rdist eq

sum_of_rdist_eq

Plain-language statement

Let Y1,Y2,Y3Y_1,Y_2,Y_3 and Y4Y_4 be independent GG-valued random variables. Then d[Y1Y3;Y2Y4]+d[Y1Y1Y3;Y2Y2Y4]d[Y_1-Y_3; Y_2-Y_4] + d[Y_1|Y_1-Y_3; Y_2|Y_2-Y_4] +I[Y1Y2:Y2Y4Y1Y2Y3+Y4]=d[Y1;Y2]+d[Y3;Y4]. + I[Y_1-Y_2 : Y_2 - Y_4 | Y_1-Y_2-Y_3+Y_4] = d[Y_1; Y_2] + d[Y_3; Y_4].

Exact Lean statement

lemma sum_of_rdist_eq (Y : Fin 4 → Ω → G) (h_indep : iIndepFun Y μ)
  (h_meas : ∀ i, Measurable (Y i)) :
    d[Y 0; μ # Y 1; μ] + d[Y 2; μ # Y 3; μ]
      = d[(Y 0) - (Y 2); μ # (Y 1) - (Y 3); μ]
        + d[Y 0 | (Y 0) - (Y 2); μ # Y 1 | (Y 1) - (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 (Y : Fin 4  Ω  G) (h_indep : iIndepFun Y μ)  (h_meas :  i, Measurable (Y i)) :    d[Y 0; μ # Y 1; μ] + d[Y 2; μ # Y 3; μ]      = d[(Y 0) - (Y 2); μ # (Y 1) - (Y 3); μ]        + d[Y 0 | (Y 0) - (Y 2); μ # Y 1 | (Y 1) - (Y 3); μ]        + I[(Y 0) - (Y 1) : (Y 1) - (Y 3) | (Y 0) - (Y 1) - (Y 2) + (Y 3); μ] := by  let π : G × G →+ G := (AddMonoidHom.fst G G) - (AddMonoidHom.snd G G)  have hπ {W_1 W_2 : Ω  G} : π ∘ W_1, W_2 = W_1 - W_2 := rfl  let Z_1 : Ω  G × G := Y 0, Y 2  let Z_2 : Ω  G × G := Y 1, Y 3  have hZ : Z_1 - Z_2 = Y 0 - Y 1, Y 2 - Y 3 := rfl  have m1 : Measurable Z_1 := (h_meas 0).prodMk (h_meas 2)  have m2 : Measurable Z_2 := (h_meas 1).prodMk (h_meas 3)  have h_indep_0 : IndepFun (Y 0) (Y 1) μ := h_indep.indepFun (by decide)  have h_indep_2 : IndepFun (Y 2) (Y 3) μ := h_indep.indepFun (by decide)  have h_indep_Z : IndepFun Z_1 Z_2 μ := h_indep.indepFun_prodMk_prodMk h_meas    0 2 1 3 (by decide) (by decide) (by decide) (by decide)  have h_indep_sub : IndepFun (Y 0 - Y 1) (Y 2 - Y 3) μ :=    h_indep.indepFun_sub_sub h_meas 0 1 2 3 (by decide) (by decide) (by decide) (by decide)  have msub (i j : Fin 4) : Measurable (Y i - Y j) := (h_meas i).sub (h_meas j)  have h_add : d[Z_1; μ # Z_2; μ] = d[Y 0; μ # Y 1; μ] + d[Y 2; μ # Y 3; μ] := by    rw [h_indep_0.rdist_eq (h_meas 0) (h_meas 1), h_indep_2.rdist_eq (h_meas 2) (h_meas 3),      h_indep_Z.rdist_eq m1 m2, hZ,      (entropy_pair_eq_add (h_meas 0) (h_meas 2)).2 (h_indep.indepFun (by decide)),      (entropy_pair_eq_add (h_meas 1) (h_meas 3)).2 (h_indep.indepFun (by decide)),      (entropy_pair_eq_add (msub 0 1) (msub 2 3)).2 h_indep_sub]    ring_nf  rw [ h_add, rdist_of_indep_eq_sum_fibre π h_indep_Z m1 m2]  simp only [hπ, hZ]  rw [sum_of_rdist_eq_step_condRuzsaDist h_indep h_meas,    sum_of_rdist_eq_step_condMutualInfo h_meas]
Project
Polynomial Freiman-Ruzsa project
License
Apache-2.0
Commit
a177b2e4abe4
Source
PFR/Fibring.lean:153-183

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