Download data/lean/OAI/Combinatorics/BinaryEdit/FiniteSpectralTree.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.21 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/BinaryEdit/FiniteSpectralTree.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/BinaryEdit/FiniteSpectralTree.lean
-
curl -L -o FiniteSpectralTree.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/BinaryEdit/FiniteSpectralTree.lean
2.21 kB
| import OAI.Combinatorics.BinaryEdit.SparseActivity | |
| import OAI.Combinatorics.BinaryEdit.FiniteActivityBridge | |
| namespace OAI | |
| /-! | |
| # Finite-tree spectral obstruction | |
| The sparse/dense counting and Fourier-mass estimates give the spectral | |
| bound used in `prop:finite-lower` for the cyclic leaf coordinates and | |
| cheap translations. | |
| -/ | |
| noncomputable section | |
| namespace TreeEdit.BinaryLower.FiniteActivity | |
| open Classical | |
| open scoped BigOperators | |
| /-- The complete sparse/dense spectral estimate on a finite tree. For the | |
| manuscript instantiate `h=b=k`, `m=20*k`, and `C=(2*J/T)*M`. The conclusion | |
| then reproduces `eq:finite-root-upper` before the final numerical estimate. -/ | |
| theorem finite_tree_spectral_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) | |
| (H : AddChar A β β β) (hH : β Ο, 0 β€ H Ο) | |
| (shift : InternalNode (Fin m) h β Ο β A) (M C : β) | |
| (hleaf : β f (z : ZMod (Q f)), | |
| (β Ο, β1 - Ο (Ο f z)β ^ 2 * H Ο) β€ M / (m : β) ^ h) | |
| (hdetect : β v Ο, characterSparse w b v Ο β | |
| (Fintype.card Ο : β) β€ β s, β1 - Ο (shift v s)β ^ 2) | |
| (hcost : β v s, | |
| (β Ο, β1 - Ο (shift v s)β ^ 2 * H Ο) β€ C / (m : β) ^ (v.1 : β)) : | |
| (β Ο : AddChar A β, β1 - Ο (w [])β ^ 2 * H Ο) β€ | |
| 4 * ((h : β) * C + M / (2 * (b : β) ^ h)) := by | |
| classical | |
| apply TreeEdit.BinaryLower.TreeDistortion.FiniteMass.finite_spectral_root_bound Q Ο H (w []) | |
| (characterSparse w b) shift | |
| (fun v => C / (m : β) ^ (v.1 : β)) | |
| (fun _f => M / (m : β) ^ h) M ((h : β) * C) ((b : β) ^ h) | |
| Β· exact pow_pos (Nat.cast_pos.mpr hb) _ | |
| Β· exact hH | |
| Β· intro Ο hr hn | |
| exact character_dense_of_leaf_generators w b h (fun f => Ο f 1) Ο hgen hr hn | |
| Β· exact hleaf | |
| Β· exact le_of_eq (leaf_budget m h hm M) | |
| Β· exact hdetect | |
| Β· exact hcost | |
| Β· exact le_of_eq (internal_node_budget m h hm C) | |
| end TreeEdit.BinaryLower.FiniteActivity | |
| end | |
| end OAI | |