File size: 6,245 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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
import Mathlib

namespace OAI



section

section

/-!
Finite complexes are standard barycentric realizations of finite abstract
simplicial complexes. Area-counted elementary edge homotopies encode the
usual triangular disk diagrams, allowing spurs and collapsed edges. Null edge
loops (equivalently closed lifts to the universal cover) are those admitting
such a disk, without any area bound. Asphericity is vanishing of all higher
homotopy groups of this finite polyhedron. The CAT conditions use the standard
squared-distance / hyperbolic-cosh comparison formulations.
-/

noncomputable section
open scoped Topology ContinuousMap

namespace HyperbolicObstruction

structure FiniteComplex where
  n : β„•
  complex : AbstractSimplicialComplex (Fin n)

namespace FiniteComplex

abbrev Vertex (K : FiniteComplex) := Fin K.n

def Carrier (K : FiniteComplex) :=
  {x : K.Vertex β†’ ℝ // (βˆ€ i, 0 ≀ x i) ∧ (βˆ‘ i, x i) = 1 ∧
    βˆƒ s ∈ K.complex.faces, βˆ€ i, i βˆ‰ s β†’ x i = 0}

instance (K : FiniteComplex) : TopologicalSpace K.Carrier :=
  inferInstanceAs (TopologicalSpace (Subtype _))

def Edge (K : FiniteComplex) (a b : K.Vertex) : Prop :=
  {a, b} ∈ K.complex.faces

def EdgePath (K : FiniteComplex) : List K.Vertex β†’ Prop
  | [] => False
  | [_] => True
  | a :: b :: t => K.Edge a b ∧ K.EdgePath (b :: t)

def Closed (K : FiniteComplex) (p : List K.Vertex) : Prop :=
  βˆƒ a t, p = a :: (t ++ [a]) ∨ p = [a]

/-- An elementary disk move. A noncollapsed triangular face costs one;
    a spur or a collapsed edge costs zero. Contexts are unchanged. -/
inductive DiskMove (K : FiniteComplex) : List K.Vertex β†’ List K.Vertex β†’ β„• β†’ Prop
  | stutter (l r) (a) :
      DiskMove K (l ++ [a, a] ++ r) (l ++ [a] ++ r) 0
  | spur (l r) (a b) (h : K.Edge a b) :
      DiskMove K (l ++ [a, b, a] ++ r) (l ++ [a] ++ r) 0
  | triangle (l r) (a b c) (h : {a, b, c} ∈ K.complex.faces)
      (hne : ({a, b, c} : Finset K.Vertex).card = 3) :
      DiskMove K (l ++ [a, b, c] ++ r) (l ++ [a, c] ++ r) 1

/-- A disk certificate obtained by elementary triangle attachments/removals,
    with spurs/collapses allowed. The index is the number of triangular faces. -/
inductive DiskHomotopy (K : FiniteComplex) : List K.Vertex β†’ List K.Vertex β†’ β„• β†’ Prop
  | refl (p) : DiskHomotopy K p p 0
  | move {p q n} : DiskMove K p q n β†’ DiskHomotopy K p q n
  | symm {p q n} : DiskHomotopy K p q n β†’ DiskHomotopy K q p n
  | trans {p q r m n} : DiskHomotopy K p q m β†’ DiskHomotopy K q r n β†’
      DiskHomotopy K p r (m + n)

def Disk (K : FiniteComplex) (p : List K.Vertex) (faces : β„•) : Prop :=
  βˆƒ a, K.DiskHomotopy p [a] faces

def LinearDiskFilling (K : FiniteComplex) (C : ℝ) : Prop :=
  βˆ€ p, K.EdgePath p β†’ K.Closed p β†’ (βˆƒ a, K.Disk p a) β†’
    βˆƒ a, K.Disk p a ∧ (a : ℝ) ≀ C * (p.length - 1 : β„•)

def Aspherical (K : FiniteComplex) (x : K.Carrier) : Prop :=
  βˆ€ n : β„•, Subsingleton (HomotopyGroup.Pi (n + 2) K.Carrier x)

end FiniteComplex

/-- A constant-speed metric segment, parametrized on [0,1]. -/
def IsSegment {X : Type*} [MetricSpace X] (Ξ³ : ℝ β†’ X) (x y : X) : Prop :=
  γ 0 = x ∧ γ 1 = y ∧
  βˆ€ s ∈ Set.Icc (0 : ℝ) 1, βˆ€ t ∈ Set.Icc (0 : ℝ) 1,
    dist (Ξ³ s) (Ξ³ t) = |s - t| * dist x y

def IsGeodesic (X : Type*) [MetricSpace X] : Prop :=
  βˆ€ x y : X, βˆƒ Ξ³, IsSegment Ξ³ x y

/-- The CN characterization of CAT(0), with whole metric segments. -/
def CATZero (X : Type*) [MetricSpace X] : Prop :=
  βˆ€ x y : X, βˆƒ Ξ³, IsSegment Ξ³ x y ∧
    βˆ€ z : X, βˆ€ t ∈ Set.Icc (0 : ℝ) 1,
      dist z (Ξ³ t) ^ 2 ≀ (1 - t) * dist z x ^ 2 + t * dist z y ^ 2 -
        t * (1 - t) * dist x y ^ 2

/-- The hyperbolic-cosh midpoint characterization of CAT(-1). -/
def CATNegOne (X : Type*) [MetricSpace X] : Prop :=
  βˆ€ x y : X, βˆƒ Ξ³, IsSegment Ξ³ x y ∧
    βˆ€ z : X, Real.cosh (dist z (Ξ³ (1 / 2))) ≀
      (Real.cosh (dist z x) + Real.cosh (dist z y)) /
        (2 * Real.cosh (dist x y / 2))

/-- A proper, cocompact isometric action of a discrete group. -/
structure GeometricAction (G X : Type*) [Group G] [MetricSpace X] where
  act : G β†’* (X ≃ᡒ X)
  proper : βˆ€ C : Set X, IsCompact C β†’
    {g : G | βˆƒ x ∈ C, act g x ∈ C}.Finite
  cocompact : βˆƒ C : Set X, IsCompact C ∧ βˆ€ x : X, βˆƒ g : G, βˆƒ y ∈ C, act g y = x

universe u

def NoGeometricCATZeroAction (G : Type*) [Group G] : Prop :=
  βˆ€ (X : Type u) (_ : MetricSpace X), Nonempty X β†’ ProperSpace X β†’ CompleteSpace X β†’
    CATZero X β†’ IsEmpty (GeometricAction G X)

def WordLength {G : Type*} [Group G] (S : Finset G) (g : G) : β„• :=
  sInf {n | βˆƒ w : List G, w.length = n ∧
    (βˆ€ a ∈ w, a ∈ S ∨ a⁻¹ ∈ S) ∧ w.prod = g}

def WordDistance {G : Type*} [Group G] (S : Finset G) (g h : G) : ℝ :=
  WordLength S (g⁻¹ * h)

/-- Four-point word hyperbolicity, for some finite generating set. -/
def WordHyperbolic (G : Type*) [Group G] : Prop :=
  βˆƒ S : Finset G, Subgroup.closure (S : Set G) = ⊀ ∧
    βˆƒ Ξ΄ : ℝ, 0 ≀ Ξ΄ ∧ βˆ€ a b c d : G,
      WordDistance S a c + WordDistance S b d ≀
        max (WordDistance S a b + WordDistance S c d)
          (WordDistance S a d + WordDistance S b c) + 2 * Ξ΄

/-- A metric on the given finite polyhedron, not on a different topology. -/
def CompatibleLocallyCATNegOne (K : FiniteComplex) : Prop :=
  βˆƒ m : MetricSpace K.Carrier,
    m.toUniformSpace.toTopologicalSpace = (inferInstance : TopologicalSpace K.Carrier) ∧
    (letI := m
     IsGeodesic K.Carrier ∧ βˆ€ x : K.Carrier, βˆƒ r : ℝ, 0 < r ∧
       CATNegOne (Metric.ball x r))

/-- A finite aspherical complex with hyperbolic fundamental group, no geometric CAT(0)
action, and no homotopy equivalent finite complex admitting a locally CAT(-1) metric. -/
def MainStatement : Prop :=
  βˆƒ K : FiniteComplex, βˆƒ x : K.Carrier, βˆƒ C : ℝ,
    ConnectedSpace K.Carrier ∧ K.Aspherical x ∧ 0 ≀ C ∧ K.LinearDiskFilling C ∧
    NoGeometricCATZeroAction.{u} (FundamentalGroup K.Carrier x) ∧
    WordHyperbolic (FundamentalGroup K.Carrier x) ∧
    βˆ€ L : FiniteComplex, Nonempty (K.Carrier ≃ₕ L.Carrier) β†’
      Β¬ CompatibleLocallyCATNegOne L


end HyperbolicObstruction


end
end
end

end OAI