File size: 2,211 Bytes
4a56cd6
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
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