Torsion free doubling
torsion_free_doubling
Plain-language statement
If G is torsion-free and X, Y are G-valued random variables then d[X; 2Y] ≤ 5d[X; Y].
Exact Lean statement
lemma torsion_free_doubling [FiniteRange X] [FiniteRange Y] (hX : Measurable X) (hY : Measurable Y)
[IsAddTorsionFree G] : d[X; μ # (Y + Y); μ'] ≤ 5 * d[X; μ # Y; μ']Formal artifact
Lean source
lemma torsion_free_doubling [FiniteRange X] [FiniteRange Y] (hX : Measurable X) (hY : Measurable Y) [IsAddTorsionFree G] : d[X; μ # (Y + Y); μ'] ≤ 5 * d[X; μ # Y; μ'] := by obtain ⟨A, mA, μA, X', Y'₁, Y'₂, hμA, h_indep, hX'_meas, hY'₁_meas, hY'₂_meas, hX'_ident, hY'₁_ident, hY'₂_ident, _, _, _⟩ := independent_copies3_nondep_finiteRange hX hY hY μ μ' μ' have h_meas (i : Fin 3) : Measurable (![X', Y'₁, Y'₂] i) := by fin_cases i <;> assumption have : H[⟨X', ⟨Y'₁ - Y'₂, X' - 2 • Y'₁⟩⟩; μA] = H[X; μ] + 2 * H[Y; μ'] := calc H[⟨X', ⟨Y'₁ - Y'₂, X' - 2 • Y'₁⟩⟩; μA] = H[⟨X', ⟨Y'₁, Y'₂⟩⟩; μA] := by let f : G × G × G → G × G × G := fun ⟨x, y₁, y₂⟩ ↦ (x, y₁ - y₂, x - 2 • y₁) change H[f ∘ ⟨X', ⟨Y'₁, Y'₂⟩⟩; μA] = _ refine entropy_comp_of_injective μA ?_ f ?_ · exact Measurable.prod hX'_meas <| Measurable.prod hY'₁_meas hY'₂_meas · simp +contextual [Function.Injective, f, smul_right_inj, forall_comm (α := _ - _ = _ - _)] _ = H[X; μ] + 2 * H[Y; μ'] := by have : IndepFun X' (prod Y'₁ Y'₂) μA := Indep.symm <| h_indep.indepFun_prodMk h_meas 1 2 0 (by decide) (by decide) rw [this.entropy_pair_eq_add hX'_meas (by exact Measurable.prod hY'₁_meas hY'₂_meas), IndepFun.entropy_pair_eq_add hY'₁_meas hY'₂_meas (h_indep.indepFun (show 1 ≠ 2 by decide)), hX'_ident.entropy_congr, hY'₁_ident.entropy_congr, hY'₂_ident.entropy_congr, two_mul] have : H[⟨X', X' - 2 • Y'₁⟩; μA] = H[X; μ] + H[Y; μ'] := calc H[⟨X', X' - 2 • Y'₁⟩; μA] = H[⟨X', Y'₁⟩; μA] := by let f : G × G → G × G := fun ⟨x, y₁⟩ ↦ (x, x - 2 • y₁) change H[f ∘ ⟨X', Y'₁⟩; μA] = _ apply entropy_comp_of_injective μA (by exact Measurable.prod hX'_meas hY'₁_meas) f · simp +contextual [Function.Injective, f, smul_right_inj] _ = H[X; μ] + H[Y; μ'] := by rw [IndepFun.entropy_pair_eq_add hX'_meas hY'₁_meas (h_indep.indepFun (show 0 ≠ 1 by decide)), hX'_ident.entropy_congr, hY'₁_ident.entropy_congr] let f : G × G → G × G := fun ⟨x, y⟩ ↦ (x, y - x) have hf : f.Injective := by simp +contextual [Function.Injective, f] have : H[⟨Y'₁ - Y'₂, X' - 2 • Y'₁⟩; μA] ≤ H[Y'₁ - Y'₂; μA] + H[X' - Y'₁ - Y'₂; μA] := calc H[⟨Y'₁ - Y'₂, X' - 2 • Y'₁⟩; μA] = H[f ∘ ⟨Y'₁ - Y'₂, X' - Y'₁ - Y'₂⟩; μA] := by change _ = H[⟨Y'₁ - Y'₂, X' - Y'₁ - Y'₂ - (Y'₁ - Y'₂)⟩; μA] rw [sub_sub_sub_cancel_right, ← sub_add_eq_sub_sub, two_nsmul] _ = H[⟨Y'₁ - Y'₂, X' - Y'₁ - Y'₂⟩; μA] := by refine entropy_comp_of_injective μA (Measurable.prod ?_ ?_) f hf · exact Measurable.sub hY'₁_meas hY'₂_meas · exact Measurable.sub (Measurable.sub hX'_meas hY'₁_meas) hY'₂_meas _ ≤ H[Y'₁ - Y'₂; μA] + H[X' - Y'₁ - Y'₂; μA] := entropy_pair_le_add (hY'₁_meas.sub hY'₂_meas) (hX'_meas.sub hY'₁_meas |>.sub hY'₂_meas) μA have : H[⟨X', ⟨Y'₁ - Y'₂, X' - 2 • Y'₁⟩⟩; μA] + H[X' - 2 • Y'₁; μA] ≤ H[⟨X', X' - 2 • Y'₁⟩; μA] + H[⟨Y'₁ - Y'₂, X' - 2 • Y'₁⟩; μA] := by have : FiniteRange (Y'₁ - Y'₂) := FiniteRange.sub Y'₁ Y'₂ have : FiniteRange (2 • Y'₁) := by change FiniteRange ((fun x ↦ 2 • x) ∘ Y'₁); infer_instance apply entropy_triple_add_entropy_le μA hX'_meas (Measurable.sub hY'₁_meas hY'₂_meas) exact Measurable.sub hX'_meas <| Measurable.const_smul hY'₁_meas 2 have : H[⟨Y'₁, ⟨Y'₂, X' - Y'₁ - Y'₂⟩⟩; μA] = H[X; μ] + 2 * H[Y; μ'] := calc H[⟨Y'₁, ⟨Y'₂, X' - Y'₁ - Y'₂⟩⟩; μA] = H[⟨Y'₁, ⟨Y'₂, X'⟩⟩; μA] := by let f : G × G × G → G × G × G := fun ⟨y₁, y₂, x⟩ ↦ (y₁, y₂, x - y₁ - y₂) change H[f ∘ ⟨Y'₁, ⟨Y'₂, X'⟩⟩; μA] = H[⟨Y'₁, ⟨Y'₂, X'⟩⟩; μA] refine entropy_comp_of_injective μA ?_ f ?_ · exact Measurable.prod hY'₁_meas <| Measurable.prod hY'₂_meas hX'_meas · simp +contextual [Function.Injective, f] _ = H[X; μ] + 2 * H[Y; μ'] := by have : IndepFun Y'₁ (prod Y'₂ X') μA := Indep.symm <| h_indep.indepFun_prodMk h_meas 2 0 1 (by decide) (by decide) rw [this.entropy_pair_eq_add hY'₁_meas (by exact Measurable.prod hY'₂_meas hX'_meas), IndepFun.entropy_pair_eq_add hY'₂_meas hX'_meas (h_indep.indepFun (show 2 ≠ 0 by decide)), hX'_ident.entropy_congr, hY'₁_ident.entropy_congr, hY'₂_ident.entropy_congr] group have : H[⟨Y'₁, X' - Y'₁ - Y'₂⟩; μA] = H[Y; μ'] + H[X' - Y'₂; μA] := calc H[⟨Y'₁, X' - Y'₁ - Y'₂⟩; μA] = H[f ∘ ⟨Y'₁, X' - Y'₂⟩; μA] := by rw [sub_right_comm]; rfl _ = H[⟨Y'₁, X' - Y'₂⟩; μA] := entropy_comp_of_injective μA (by exact Measurable.prod hY'₁_meas <| Measurable.sub hX'_meas hY'₂_meas) f hf _ = H[Y; μ'] + H[X' - Y'₂; μA] := by have : FiniteRange (X' - Y'₂) := FiniteRange.sub X' Y'₂ convert! IndepFun.entropy_pair_eq_add hY'₁_meas (hX'_meas.sub hY'₂_meas) <| h_indep.indepFun_sub_right h_meas 1 0 2 (by decide) (by decide) exact hY'₁_ident.entropy_congr.symm have : H[⟨Y'₂, X' - Y'₁ - Y'₂⟩; μA] = H[Y; μ'] + H[X' - Y'₁; μA] := calc H[⟨Y'₂, X' - Y'₁ - Y'₂⟩; μA] = H[f ∘ ⟨Y'₂, X' - Y'₁⟩; μA] := rfl _ = H[⟨Y'₂, X' - Y'₁⟩; μA] := entropy_comp_of_injective μA (by exact Measurable.prod hY'₂_meas <| Measurable.sub hX'_meas hY'₁_meas) f hf _ = H[Y; μ'] + H[X' - Y'₁; μA] := by have : FiniteRange (X' - Y'₁) := FiniteRange.sub X' Y'₁ convert! IndepFun.entropy_pair_eq_add hY'₂_meas (hX'_meas.sub hY'₁_meas) <| h_indep.indepFun_sub_right h_meas 2 0 1 (by decide) (by decide) exact hY'₂_ident.entropy_congr.symm have : H[⟨Y'₁, ⟨Y'₂, X' - Y'₁ - Y'₂⟩⟩; μA] + H[X' - Y'₁ - Y'₂; μA] ≤ H[⟨Y'₁, X' - Y'₁ - Y'₂⟩; μA] + H[⟨Y'₂, X' - Y'₁ - Y'₂⟩; μA] := by apply entropy_triple_add_entropy_le μA hY'₁_meas hY'₂_meas exact Measurable.sub (Measurable.sub hX'_meas hY'₁_meas) hY'₂_meas have : H[X' - Y'₁ - Y'₂; μA] ≤ 2 * d[X; μ # Y; μ'] + H[Y; μ'] := calc H[X' - Y'₁ - Y'₂; μA] ≤ H[X' - Y'₁; μA] + H[X' - Y'₂; μA] - H[X; μ] := by linarith _ = 2 * d[X; μ # Y; μ'] + H[Y; μ'] := by nth_rw 1 [two_mul, ← hX'_ident.rdist_congr hY'₁_ident, ← hX'_ident.rdist_congr hY'₂_ident] have h1 : d[X'; μA # Y'₁; μA] = H[X' - Y'₁; μA] - H[X'; μA] / 2 - H[Y'₁; μA] / 2 := (h_indep.indepFun (show 0 ≠ 1 by decide)).rdist_eq hX'_meas hY'₁_meas have h2 : d[X'; μA # Y'₂; μA] = H[X' - Y'₂; μA] - H[X'; μA] / 2 - H[Y'₂; μA] / 2 := (h_indep.indepFun (show 0 ≠ 2 by decide)).rdist_eq hX'_meas hY'₂_meas rw [h1, h2, hY'₁_ident.entropy_congr, hY'₂_ident.entropy_congr, hX'_ident.entropy_congr] group have : d[X; μ # 2 • Y; μ'] ≤ d[Y'₁; μA # Y'₂; μA] + (H[Y; μ'] - H[X; μ]) / 2 + 2 * d[X; μ # Y; μ'] := calc d[X; μ # 2 • Y; μ'] = H[X' - 2 • Y'₁; μA] - H[X; μ] / 2 - H[2 • Y; μ'] / 2 := by have h2Y_ident : IdentDistrib (2 • Y'₁) (2 • Y) (μ := μA) (ν := μ') := hY'₁_ident.comp <| .of_discrete (f := fun g ↦ 2 • g) have h2Y_indep : IndepFun X' (2 • Y'₁) (μ := μA) := (h_indep.indepFun (show 0 ≠ 1 by decide)).comp measurable_id (measurable_const_smul 2) rw [← hX'_ident.rdist_congr h2Y_ident, h2Y_indep.rdist_eq hX'_meas <| Measurable.const_smul hY'₁_meas 2, hX'_ident.entropy_congr, h2Y_ident.entropy_congr] _ ≤ H[Y'₁ - Y'₂; μA] + 2 * d[X; μ # Y; μ'] - H[X; μ] / 2 - H[2 • Y; μ'] / 2 := by linarith _ = d[Y'₁; μA # Y'₂; μA] + (H[Y; μ'] - H[X; μ]) / 2 + 2 * d[X; μ # Y; μ'] := by have H2Y : H[2 • Y; μ'] = H[Y; μ'] := by let f (g : G) := 2 • g exact entropy_comp_of_injective μ' hY f (fun _ _ ↦ by simp [f, smul_right_inj]) have : d[Y'₁; μA # Y'₂; μA] = H[Y'₁ - Y'₂; μA] - H[Y'₁; μA] / 2 - H[Y'₂; μA] / 2 := (h_indep.indepFun (show 1 ≠ 2 by decide)).rdist_eq hY'₁_meas hY'₂_meas rw [this, hY'₁_ident.entropy_congr, hY'₂_ident.entropy_congr, H2Y] group have : d[Y'₁; μA # Y'₂; μA] ≤ 2 * d[X; μ # Y; μ'] := by rw [two_mul] convert rdist_triangle hY'₁_meas hX'_meas hY'₂_meas (μ := μA) (μ' := μA) (μ'' := μA) · exact rdist_symm.trans (hY'₁_ident.rdist_congr hX'_ident).symm · exact (hX'_ident.rdist_congr hY'₂_ident).symm rw [← two_nsmul] linarith [abs_le.mp <| diff_ent_le_rdist hX hY (μ := μ) (μ' := μ')]- Project
- Polynomial Freiman-Ruzsa project
- License
- Apache-2.0
- Commit
- a177b2e4abe4
- Source
- PFR/WeakPFR.lean:92-208
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
Approx hom pfr
approx_hom_pfr
Project documentation
An approximate-homomorphism theorem for finite elementary abelian -groups. Let and . If at least a proportion of pairs satisfy , then there are an additive homomorphism and a constant such that for at least values of .
Source project: Polynomial Freiman-Ruzsa project
Person-level attribution pending.
Better PFR conjecture
better_PFR_conjecture
Plain-language statement
If is finite non-empty with , then there exists a subgroup of with such that can be covered by at most translates of .
Source project: Polynomial Freiman-Ruzsa project
Person-level attribution pending.
Better PFR conjecture
better_PFR_conjecture'
Project documentation
Polynomial Freiman-Ruzsa theorem with exponent , without a finite ambient-group assumption. Let be a nonempty finite subset of an elementary abelian -group. If , then there are a finite subspace and a finite set such that , , and .
Source project: Polynomial Freiman-Ruzsa project
Person-level attribution pending.