File size: 3,025 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
62
63
64
import Mathlib
import OAI.Probability.CriticalPercolation.Classification.RelativeClassification
import OAI.Probability.CriticalPercolation.Growth.GraphRelativeGrowth
import OAI.Probability.CriticalPercolation.GraphTopology.CommensurableClosure
import OAI.Probability.CriticalPercolation.Classification.DiscreteWeakGromovBridge
import OAI.Probability.CriticalPercolation.GraphGeometry.GraphQuotientPolynomial

namespace OAI

section
noncomputable section
open Set Function Topology
open scoped Classical Pointwise

namespace CriticalPercolation.GraphTopology
variable {X : Type*} (Ξ“ : SimpleGraph X)

theorem compact_open_normal_of_sparse_polynomial
    [TopologicalSpace X] [DiscreteTopology X]
    (hc : Ξ“.Connected) (hl : βˆ€ x, (Ξ“.neighborSet x).Finite)
    (ht : βˆ€ u v, βˆƒ g : Ξ“ ≃g Ξ“, g u=v) (o : X) (d : β„•)
    (hpoly : βˆ€ R : β„•, βˆƒ nβ‰₯R, (reachBall Ξ“ o n).ncard≀n^d) :
    let _ : TopologicalSpace (Ξ“ ≃g Ξ“) := autTopology Ξ“
    βˆƒ H : Subgroup (Ξ“ ≃g Ξ“), H.Normal ∧ IsCompact (H:Set (Ξ“ ≃g Ξ“)) ∧ IsOpen (H:Set (Ξ“ ≃g Ξ“)) := by
  let _ : TopologicalSpace (Ξ“ ≃g Ξ“) := autTopology Ξ“
  let K := vertexStabilizer Ξ“ o
  let S := displacement Ξ“ o 1
  have h1 : (1:Ξ“ ≃g Ξ“)∈S := one_mem_displacement Ξ“ o 1
  have hi : S⁻¹=S := by ext g; exact displacement_inv Ξ“
  have hgen : Subgroup.closure S=⊀ := displacement_generates Ξ“ hc ht o
  obtain ⟨N,hNn,hNb,hNi⟩ := RelativeGrowth.bounded_normal_commensurable d
    (Ξ“ ≃g Ξ“) K S h1 hi hgen (vertexStabilizer_bounded Ξ“ o) (displacement_relativeDegree Ξ“ hl o d hpoly)
  let := hNn
  let H := N.topologicalClosure
  have hHn : H.Normal := Subgroup.is_normal_topologicalClosure N
  have hcH : IsCompact (H:Set (Ξ“ ≃g Ξ“)) := by
    obtain ⟨n,hn⟩ := hNb
    have hNs : (N:Set (Ξ“ ≃g Ξ“))βŠ†displacement Ξ“ o n := hn.trans (displacement_pow_subset Ξ“ o n)
    apply (compact_displacement Ξ“ hc hl o n).of_isClosed_subset N.isClosed_topologicalClosure
    exact closure_minimal hNs (isClosed_eval_mem Ξ“ o _)
  have hoH : IsOpen (H:Set (Ξ“ ≃g Ξ“)) :=
    RelativeGrowth.topologicalClosure_open_of_relIndex K N (open_stabilizer Ξ“ o) hNi
  exact ⟨H,hHn,hcH,hoH⟩

theorem compact_open_virtually_nilpotent_quotient_of_sparse_polynomial
    (hc : Ξ“.Connected) (hl : βˆ€ x, (Ξ“.neighborSet x).Finite)
    (ht : βˆ€ u v, βˆƒ g : Ξ“ ≃g Ξ“, g u=v) (o : X) (d : β„•)
    (hpoly : βˆ€ R : β„•, βˆƒ nβ‰₯R, (reachBall Ξ“ o n).ncard≀n^d) :
    HasCompactOpenVirtuallyNilpotentQuotient Ξ“ := by
  let _ : TopologicalSpace X := βŠ₯
  let _ : DiscreteTopology X := ⟨rfl⟩
  let _ : TopologicalSpace (Ξ“ ≃g Ξ“) := autTopology Ξ“
  obtain ⟨H,hHn,hcH,hoH⟩ := compact_open_normal_of_sparse_polynomial Ξ“ hc hl ht o d hpoly
  let := hHn
  have hg := quotient_sparse_polynomial_word_growth Ξ“ hc hl ht o d hpoly H hoH
  obtain ⟨N,hNn,hNi⟩ := CompactQuotient.virtuallyNilpotent_of_sparse_word_growth hg
  exact ⟨H,hHn,hcH,hoH,N,hNn,hNi.index_ne_zero⟩

end CriticalPercolation.GraphTopology
end
end

end OAI