Download data/lean/OAI/Combinatorics/BinaryEdit/FiniteL1Tree.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.53 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/BinaryEdit/FiniteL1Tree.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/BinaryEdit/FiniteL1Tree.lean
-
curl -L -o FiniteL1Tree.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/BinaryEdit/FiniteL1Tree.lean
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 | |