Abstract
We will discuss Helly graphs and injective metric spaces: basic definitions, elementary properties, simple examples. We will focus on nonpositive curvature features, such as local properties, bicombings and classification of isometries. We will present numerous groups acting geometrically by isometries on such spaces, such as hyperbolic groups, braid groups, mapping class groups and lattices in Lie groups.
Talk
The notes to the talk can be found here.
Teaser:
- Are hyperbolic groups CAT(0)? Open!
- Are braid groups CAT(0)? Open!
- Are CAT(0) groups biautomatic? No!
Well we don’t know the answers to the first two but we know:
- Hyperbolic groups are Helly
- Braids are Helly
- Helly groups are biautomatic.
I Definition
Definition
is a Hyperconvex space if some complex things are fulfilled.
Remark: If is geodesic, then is hyperconvex if balls in satisfy the Helly property, i.e. pairwise intersecting balls globally intersect.
Definition
is an Injective metric space if for all matrix spaces, any 1-Lipschitz map extends to a 1-Lipschitz map .
Finally an explanation for injective spaces!
Definition
is an absolute 1-Lipschitz retract if for every isometric embedding , there exists a 1-Lipshitz retraction (?)
Theorem
is hyperconvex iff. is injective iff. absolute -Lipschitzretract.
Example
- is hyperconvex, it is injective
- is not injective
- is injective
Exercise:
- Disprove hyperconvexity in .
- products of injective spaces are injective.
- Complete -trees are injective.
- Any finite-dimensional CAT(0) cube complex
Proposition
For any set , is injective.
Proposition
Any injective metric space is Contractible space and Geodesic space and Complete space
Example
Complete -trees are injective.
Definition
A connected graph is a Helly graph if pairwise intersecting balls globally intersect.
Example
- A line is Helly
- Trees are Helly
- Complete graphs are Helly
3. Group actions
Definition
A group is called injective or Helly group if it acts properly and cocompactly by isometries on an Injective metric space or Helly graph.
We have Helly implies injective.
Example
- Free abelian groups are Helly (act on )
- Free groups are Helly (act on trees)
- Hyperbolic group are Helly (Act on hyperbolic spaces)
- Braid group (and FC type Artin group and Garside group) are Helly
- Cocompact lattices in are Helly
- Cocompact lattices in are injective.
- Mapping class groups act properly and coboundedly on an injective space. This makes them injective.
- for is not injective. (Outer automorphisms of free group)
Some properties
If is Helly
- has type
- is a Biautomatic group
II Hulls
1. Injective Hull
Why are there so many groups acting on injective metric spaces?
Theorem
Any metric space embeds isometrically in a unique minimal injective metric space, its Injective hull .
We describe the explicit model for the injective hull . Let be all function from to where the sum of the images if bigger then the distance of the preimage. Now we construct as a minimal version of .
Example
Let be the space of two points with distance . Then will become the segment between and .
We draw how the injective hull look like for points or points or points.
We study with the hexagonal norm (the norm, where the norm ball is a hexagon). This is isometric to . But what is the injective hull of the Hyperbolic plane.
2. Helly Hull
Theorem
Any connected graph embeds isometrically in a unique minimal Helly graph, the Helly graph .
Theorem
connected graph, then . Meaning, we throw away all non-integer points.
Example
A square is a simple graph that is not Helly. To make it Helly, we can add diagonal or else we would shorten the distance of diagonals. Instead we enter a central vertex and connect to the corners. Same for the pentagon.
3. Orthosimplices
Definition
The standard -orthosimplex is the simplex in with ordered vertices The orthocomplex metric is the ordered -matrix. I can’t read the rest :/
Definition
In a graph a … clique is a complexe subgraph which is an intersection of balls.
Theorem
a Helly graph, the poset of cliques. Then is -isometric to
This gives a recipe to describe the injective hull of a graph. Under some assumtion we can use .
Theorem (Long)
Let be a hyperbolic locally finite graph. Then is at distance from and is locally finite.
As a corollary hyperbolic graphs are Helly.
3. Taming the injective hull
Theorem
Let be a hyperbolic graph. Then is hyperbolic and the embedding of in is dense.
Definition
A connected graph has stable intervals if all geodesic intervals from a vertex fellow travel to any two adjacent vertices . (Meaning the geodesic paths are contained in a -neighbourhood for a global )
Example
- Helly graphs
- Median graphs
- Hyperbolic graphs
Theorem
be a locally finite connected graph with stable intervals. Then is locally finite.
Corollary
Let be a Hyperbolic group. a Cayley-Graph. Then the action of on is cocompact.
III NPC Properties
1. Bicombing
Definition
A (conical, geodesic) Bicombing on a metric space is a map such that.
- Between any two points there exists a constant speed geodesic parametrised by
- Any pair of geodesics between four points metrically curve towards another, not away from another.
Theorem (Long)
Any injective metric space admits an -inv. equivariant bicombing.
Corollary
Injective group have quadratic Dehn-Funktion.
This is not hyperbolic. But it is interesting
2. Fixed points
Theorem (Long)
injective space and acting on with bounded orbits. Then the fixed point set is non empty and the set of fixed points is injective.
3. Local to global
Definition
A connected graph is -Helly if pairwise intersecting balls of radius 1 globally intersect.
Theorem
connected graph is Helly if
- Some complex of is simply connected
- is -Helly
Theorem
A metric space is injective iff
- is simply connected
- is locally injective