math / data /lean /OAI /Combinatorics /BinaryEdit /FiniteL1Tree.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
2.53 kB
import OAI.Combinatorics.BinaryEdit.FiniteSpectralTree
import OAI.Combinatorics.BinaryEdit.FiniteDisplacement
import OAI.Combinatorics.BinaryEdit.FiniteNumeric
namespace OAI
/-!
# Actual ℓ₁ maps and the finite-tree obstruction
The finite-group displacement identity yields the finite-tree root estimate
from geometric bounds on the concrete translations.
-/
noncomputable section
namespace TreeEdit.BinaryLower.FiniteActivity
open Classical
open scoped BigOperators
/-- Leaf periods, sparse-character detection and translation-cost bounds
imply the root averaged-distance estimate for arbitrary maps into ℓ₁. -/
theorem finite_tree_l1_mean_bound {A Οƒ : Type*}
[AddCommGroup A] [Fintype A] [Fintype Οƒ] [Nonempty Οƒ]
(m b h : β„•) (hm : m β‰  0) (hb : 0 < b)
(w : List (Fin m) β†’ A)
(Q : (Fin h β†’ Fin m) β†’ β„•) [βˆ€ f, NeZero (Q f)]
(Ο† : βˆ€ f, ZMod (Q f) β†’+ A)
(hgen : βˆ€ f : Fin h β†’ Fin m, w (List.ofFn f) = Ο† f 1)
(F : A β†’ RealL1)
(shift : InternalNode (Fin m) h β†’ Οƒ β†’ A) (M C : ℝ)
(hleaf : βˆ€ f (z : ZMod (Q f)) x,
β€–F (x + Ο† f z) - F xβ€– ≀ M / (m : ℝ) ^ h)
(hdetect : βˆ€ v Ο‡, characterSparse w b v Ο‡ β†’
(Fintype.card Οƒ : ℝ) ≀ βˆ‘ s, β€–1 - Ο‡ (shift v s)β€– ^ 2)
(hcost : βˆ€ v s x,
β€–F (x + shift v s) - F xβ€– ≀ C / (m : ℝ) ^ (v.1 : β„•)) :
(𝔼 x : A, β€–F (x + w []) - F xβ€–) ≀
4 * ((h : ℝ) * C + M / (2 * (b : ℝ) ^ h)) := by
classical
obtain ⟨H, hH, hFourier⟩ := finite_group_displacement F
rw [hFourier]
apply finite_tree_spectral_bound m b h hm hb w Q Ο† hgen H hH shift M C
Β· intro f z
rw [← hFourier]
exact Finset.expect_le Finset.univ_nonempty (fun x _ => hleaf f z x)
Β· exact hdetect
Β· intro v s
rw [← hFourier]
exact Finset.expect_le Finset.univ_nonempty (fun x _ => hcost v s x)
/-- Parameter normalization gives the root estimate with the absolute
constant 34. -/
theorem source_mean_bound34 {A : Type*} [AddCommGroup A] [Fintype A]
(F : A β†’ RealL1) (root : A) {k : β„•} {M : ℝ}
(hk : 1 ≀ k) (hM : 0 ≀ M)
(hroot : (𝔼 x : A, β€–F (x + root) - F xβ€–) ≀
4 * ((k : ℝ) * ((2 * (4 * (k : ℝ) ^ (10 * k)) /
(k : ℝ) ^ (20 * k)) * M) + M / (2 * (k : ℝ) ^ k))) :
(𝔼 x : A, β€–F (x + root) - F xβ€–) ≀ 34 * M / (k : ℝ) ^ k := by
apply TreeEdit.BinaryLower.FiniteNumeric.finite_root_bound hk hM
convert hroot using 1
ring
end TreeEdit.BinaryLower.FiniteActivity
end
end OAI