math / data /lean /OAI /Combinatorics /EditDistance /PrimeDisplacement.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6.02 kB
import OAI.Combinatorics.EditDistance.FourierAverages
import OAI.Combinatorics.EditDistance.Cuts
namespace OAI
/-!
# Prime-product displacement for absolutely summable maps
-/
namespace EditFourier
open scoped BigOperators
open Finset EditAverage
noncomputable def variation {G E : Type*} [AddCommGroup G] [Fintype G]
[NormedAddCommGroup E] (H : G β†’ E) (l : G) : ℝ :=
avg (fun z => β€–H (z + l) - H zβ€–)
section CutTransport
variable {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
lemma quadraticVariation_cut (A : Finset G) (l : G) :
quadraticVariation (fun z => (EditCuts.cut A z : β„‚)) l =
variation (EditCuts.cut A) l := by
unfold quadraticVariation variation avg
congr 1
apply sum_congr rfl
intro z _
by_cases hz : z ∈ A <;> by_cases hzl : z + l ∈ A <;>
simp [EditCuts.cut, hz, hzl]
lemma variation_cut_decomposition (H : G β†’ EditCuts.RealL1) (c : Finset G β†’ ℝ)
(hd : βˆ€ x y, β€–H x - H yβ€– = βˆ‘ A : Finset G, c A * |EditCuts.cut A x - EditCuts.cut A y|)
(l : G) : variation H l = βˆ‘ A : Finset G, c A * variation (EditCuts.cut A) l := by
simp_rw [variation, hd, avg_sum, avg_mul, Real.norm_eq_abs]
end CutTransport
section PrimeProductL1
variable {J : Type*} [Fintype J] [DecidableEq J]
variable (p : J β†’ β„•) [βˆ€ j, NeZero (p j)]
variable {G : Type*} [AddCommGroup G] [Fintype G]
theorem prime_product_displacement
(hcop : Pairwise (fun i j => (p i).Coprime (p j)))
(B : ℝ) (hB : 1 ≀ B) (hpB : βˆ€ j, (p j : ℝ) ≀ B)
(h : β„•) (hh : 0 < h) (Ο† : (βˆ€ j, ZMod (p j)) β†’+ G)
(H : G β†’ EditCuts.RealL1) (i : J) (u : ZMod (p i)) :
variation H (Ο† (Pi.single i u)) ≀
B ^ (2 * h) * variation H (Ο† 1) + (2 / (h : ℝ)) *
βˆ‘ j, avg (fun a : ZMod (p j) => variation H (Ο† (Pi.single j a))) := by
classical
have hcut (A : Finset G) :
variation (EditCuts.cut A) (Ο† (Pi.single i u)) ≀
B ^ (2 * h) * variation (EditCuts.cut A) (Ο† 1) + (2 / (h : ℝ)) *
βˆ‘ j, avg (fun a : ZMod (p j) => variation (EditCuts.cut A) (Ο† (Pi.single j a))) := by
simpa only [quadraticVariation_cut] using group_quadratic_comparison p hcop B hB hpB h hh Ο†
(fun z => (EditCuts.cut A z : β„‚)) i u
obtain ⟨c, hc, _, _, hd⟩ := EditCuts.l1_decomposition H
simp_rw [variation_cut_decomposition H c hd]
calc
_ ≀ βˆ‘ A : Finset G, c A *
(B ^ (2 * h) * variation (EditCuts.cut A) (Ο† 1) + (2 / (h : ℝ)) *
βˆ‘ j, avg (fun a : ZMod (p j) => variation (EditCuts.cut A) (Ο† (Pi.single j a)))) := by
apply sum_le_sum
intro A _
exact mul_le_mul_of_nonneg_left (hcut A) (hc A)
_ = _ := by
simp_rw [mul_add, sum_add_distrib, avg_sum, avg_mul]
congr 1
Β· simp_rw [mul_left_comm _ (B ^ (2 * h)), ← mul_sum]
Β· simp_rw [mul_left_comm _ (2 / (h : ℝ)), ← mul_sum, mul_sum]
rw [sum_comm]
end PrimeProductL1
end EditFourier
namespace EditFourier
open scoped BigOperators
open Finset EditAverage
def torsionHom {G : Type*} [AddCommGroup G] (p : β„•) (v : G) (hv : p β€’ v = 0) :
ZMod p β†’+ G :=
ZMod.lift p ⟨{ toFun := fun z : β„€ => z β€’ v
map_zero' := zero_zsmul v
map_add' := fun x y => add_zsmul v x y }, by simpa using hv⟩
lemma torsionHom_natCast {G : Type*} [AddCommGroup G] (p : β„•) (v : G) (hv : p β€’ v = 0)
(a : β„•) : torsionHom p v hv (a : ZMod p) = a β€’ v := by
simpa [torsionHom] using ZMod.lift_coe p
(⟨{ toFun := fun z : β„€ => z β€’ v
map_zero' := zero_zsmul v
map_add' := fun x y => add_zsmul v x y }, by simpa using hv⟩) (a : β„€)
lemma torsionHom_apply {G : Type*} [AddCommGroup G] (p : β„•) [NeZero p]
(v : G) (hv : p β€’ v = 0) (a : ZMod p) : torsionHom p v hv a = a.val β€’ v := by
rw [← torsionHom_natCast p v hv a.val, ZMod.natCast_zmod_val]
section Vectors
variable {J G : Type*} [Fintype J] [DecidableEq J] [AddCommGroup G]
variable (p : J β†’ β„•) (v : J β†’ G) (hv : βˆ€ j, p j β€’ v j = 0)
def vectorHom : (βˆ€ j, ZMod (p j)) β†’+ G where
toFun a := βˆ‘ j, torsionHom (p j) (v j) (hv j) (a j)
map_zero' := by simp
map_add' a b := by simp [map_add, Finset.sum_add_distrib]
lemma vectorHom_single (i : J) (a : ZMod (p i)) :
vectorHom p v hv (Pi.single i a) = torsionHom (p i) (v i) (hv i) a := by
classical
simp only [vectorHom, AddMonoidHom.coe_mk, ZeroHom.coe_mk]
rw [Finset.sum_eq_single i]
Β· simp
Β· intro j _ hj
simp [Pi.single_eq_of_ne hj]
Β· simp
omit [DecidableEq J] in
lemma vectorHom_one : vectorHom p v hv 1 = βˆ‘ j, v j := by
change (βˆ‘ j, torsionHom (p j) (v j) (hv j) 1) = _
apply Finset.sum_congr rfl
intro j _
simpa using torsionHom_natCast (p j) (v j) (hv j) 1
variable [Fintype G] [βˆ€ j, NeZero (p j)]
include hv
theorem vector_displacement
(hcop : Pairwise (fun i j => (p i).Coprime (p j)))
(B : ℝ) (hB : 1 ≀ B) (hpB : βˆ€ j, (p j : ℝ) ≀ B)
(h : β„•) (hh : 0 < h) (H : G β†’ EditCuts.RealL1) (i : J) (u : ZMod (p i)) :
variation H (u.val β€’ v i) ≀ B ^ (2 * h) * variation H (βˆ‘ j, v j) +
(2 / (h : ℝ)) * βˆ‘ j, avg (fun a : ZMod (p j) => variation H (a.val β€’ v j)) := by
simpa only [vectorHom_single, vectorHom_one, torsionHom_apply] using
prime_product_displacement p hcop B hB hpB h hh (vectorHom p v hv) H i u
theorem prime_vector_displacement (hp : βˆ€ j, (p j).Prime) (hinj : Function.Injective p)
(P : ℝ) (hP : 1 ≀ 2 * P) (hpP : βˆ€ j, (p j : ℝ) ≀ 2 * P)
(h : β„•) (hh : 0 < h) (H : G β†’ EditCuts.RealL1) (i : J) (u : ZMod (p i)) :
variation H (u.val β€’ v i) ≀ (2 * P) ^ (2 * h) * variation H (βˆ‘ j, v j) +
(2 / (h : ℝ)) * βˆ‘ j, avg (fun a : ZMod (p j) => variation H (a.val β€’ v j)) := by
apply vector_displacement p v hv (fun i j hij => ?_) (2 * P) hP hpP h hh H i u
exact (hp i).coprime_iff_not_dvd.mpr (fun hd =>
hij (hinj ((Nat.dvd_prime (hp j)).mp hd |>.resolve_left (hp i).ne_one)))
end Vectors
end EditFourier
end OAI