5/6 CAT(o) Cube Complexes
This is a modal window.
The media could not be loaded, either because the server or network failed or because the format is not supported.
Formal Metadata
| Title |
| |
| Title of Series | ||
| Part Number | 34 | |
| Number of Parts | 34 | |
| Author | ||
| Contributors | ||
| License | CC Attribution 3.0 Unported: You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor. | |
| Identifiers | 10.5446/46168 (DOI) | |
| Publisher | ||
| Release Date | ||
| Language |
Content Metadata
| Subject Area | ||
| Genre | ||
| Abstract |
|
5
6
7
8
10
12
14
17
18
23
24
25
26
27
28
29
30
31
32
33
00:00
GeometryComplex (psychology)CubeGroup theoryTheoryMusical ensembleSpacetimePartition (number theory)Set theorySubsetCubeGroup actionHypothesisComplex (psychology)CloningLecture/Conference
01:55
Point (geometry)Positional notationSpacetimeSet theoryMetrischer RaumPartition (number theory)Multiplication signMereologyAlgebraic structureObject (grammar)SubsetOrder (biology)Cue sportsModulformNumerical analysisLecture/Conference
05:10
ModulformLAN partyOrder (biology)CubeReflection (mathematics)Degree (graph theory)Partition (number theory)Process (computing)Vertex (graph theory)Function (mathematics)SpacetimeGroup actionFilm editing1 (number)HyperplaneElement (mathematics)Set theoryNormal (geometry)Dihedral groupPoint (geometry)Axiom of choiceComplex (psychology)Duality (mathematics)Condition numberRight angleMany-sorted logicSequenceLecture/Conference
14:21
LAN partyDifferent (Kate Ryan album)Term (mathematics)Set theoryPoint (geometry)SpacetimeCubeDuality (mathematics)AxiomComplex (psychology)Many-sorted logicAxiom of choiceRight angleSquare numberContrast (vision)ChainDirection (geometry)Network topologyMultiplication signLecture/Conference
23:32
CubeSpacetimeNormal (geometry)Conjugacy classPoint (geometry)Dimensional analysisMathematicsRight angleFinitismusSubgroupMusical ensembleAxiom of choiceGame theoryTerm (mathematics)Flow separationNetwork topology1 (number)Numerical analysisArc (geometry)Stability theoryHyperplaneComplex (psychology)Focus (optics)Neighbourhood (graph theory)Duality (mathematics)Lecture/Conference
27:24
Numerical analysisCubePhysical systemCanonical ensembleRight angleCorrespondence (mathematics)SpacetimeGoodness of fitSet theoryOrientation (vector space)AxiomDuality (mathematics)Axiom of choicePoint (geometry)Many-sorted logicComplex (psychology)Position operatorGame theoryMultiplication signLecture/Conference
34:20
Multiplication signFamilyGraph (mathematics)KodimensionSubgroupSubsetPairwise comparisonNeighbourhood (graph theory)ModulformGame theoryVertex (graph theory)Goodness of fitPhysical systemPoint (geometry)2 (number)SpacetimeFinitismusGroup actionCubeConnectivity (graph theory)Complex (psychology)Duality (mathematics)Limit of a function1 (number)OrbitRight angleDimensional analysisInfinityLecture/Conference
41:53
Generating set of a groupOrientation (vector space)Many-sorted logicFundamentalgruppeSurfaceDimensional analysisRight angleDiagonalGraph (mathematics)MereologySquare numberLecture/Conference
43:17
Group actionSubgroupNeighbourhood (graph theory)Connected spaceConnectivity (graph theory)CubeSpacetimeGraph (mathematics)DiagramComplex (psychology)Numerical analysisSet theoryInfinityPrice indexLimit (category theory)State of matterConjugacy classSupremumOrbitKodimensionMany-sorted logicEntire functionSubgraphTranslation (relic)HyperplaneStability theoryDuality (mathematics)Wave packetHeuristicPoint (geometry)GeodesicGame theoryFlow separationCompact spaceExterior algebraMereologyComplementarityCountingFilm editingRight angleFinitismusMathematicsLemma (mathematics)Reflection (mathematics)TrailDimensional analysisTheory of everythingMultiplication signKlein bottleGraph (mathematics)Closed setLecture/Conference
Transcript: English(auto-generated)
00:16
Thank you very much, and thank you again to the organizers for having me participate in this wonderful affair.
00:25
Enduro was concerned that my last lectures would be dry, but that will not be the case. So, let's get to it. First, let's talk about wall spaces. My goal today is to tell you how to get from a group to a cat zero cube complex,
00:45
and it's really, the main theme is going to be Mikhal Saagib's PhD thesis, which has been developed upon a lot in the last 20 years or so. So, wall spaces are coincidentally our notion that arose in Orsay, I believe,
01:04
because of Frédéric Paulin and Frédéric Haglond. So, a wall space is a set S with a collection script W of walls.
01:29
Each wall in our collection is a partition of S into two subsets.
01:55
We'll assume that the subsets are disjoint from each other.
02:03
And we will also assume that no two walls are the same partition for technical reasons, although a lot of what I'm going to describe has great flexibility to it, you'll see as we proceed. So, this definition, which is the most elegant form of the notion of wall space,
02:23
is suggestive of quite a lot of generalization that will become apparent as we proceed. So, we're also going to require that the number of walls separating any two points in S is finite.
02:44
So, this is the number of walls separating P and Q. A wall separates P and Q if P lies in one of the half spaces of the partition
03:07
and Q lies in the other half space of the partition. If you exchange the two parts, is it another wall? We're going to assume that each wall is a partition, so it's a collection of two subsets.
03:29
So, it's the same wall. The order doesn't matter, even though the notation suggests that it does. The order does not matter. It's not fixed, which is left, which is right? No, it's not. It's just the convenience of notation.
03:42
We'll assume that they're both non-empty, okay? Otherwise, it makes a little bit of a mess for certain subtle points, but don't worry about it. Okay, you missed me on one empty set, by the way, that I was wrong on last time. So, what's the picture is that the set is a set, some object maybe.
04:13
Maybe it has some additional structure to it, some geometry, maybe it's a metric space. Who knows? We will see. And then a bunch of walls.
04:27
Here's a yellow wall. So, look, I'm drawing the wall as if it were a wall, but we all are thinking, oh yeah, it's dividing it into a left half and a right half, or a half and another half. Never mind the order. And then there are other walls.
04:46
Here's a third one. I'm not going to be so generous with the chalk in the future, just this one time.
05:06
Okay, so here's a wall space. It has five walls, okay? And, you know, I guess if this really is going to be a partition, I suppose we would have to decide where the points on the, what I tend to call these walls, the yellow things, this yellow thing,
05:23
I tend to call that the wall, and you'll see why soon. But if you're being very careful about this definition and being faithful to the definition, you have to decide for these yellow points, are they going to be on this side or on that side? Okay, so choose a way.
05:40
This definition is flexible in that fashion, and it's actually quite a bit more flexible than that. So let's give some examples. So some examples that you're conscious of, perhaps. I mean, that was a perfectly good example over there.
06:04
But what if we took, if we're being very, very faithful to the definition, and we took the vertices of a cat zero cube complex,
06:24
and the walls correspond to the pairs of half spaces associated to the hyperplanes, right? So each hyperplane in the cat zero cube complex, when you just consider the vertices of the cat zero cube complex,
06:47
that hyperplane cuts the vertices into the ones that are in one of its minor half spaces and the vertices that are in the other minor half space. So the hyperplane gives you a wall.
07:03
I suppose another example that the two Frederiks were motivated by was, I'll just say, Coxeter group or Coxeter complex, and the walls are associated.
07:24
So that's going to be the set S is the Coxeter group, the elements of the Coxeter group. The walls will correspond to the reflection walls. So each reflection, when you have this Coxeter complex,
07:42
each reflection, or even if you imagine a Coxeter group acting in one of its usual ways, each reflection kind of gives you a wall. So you can cook up a wall space from that. If we were being really, maybe I'll be particular about this. So for instance, in a dihedral group of order,
08:15
so why should the, let's see, of order three or six, depending on who you are,
08:24
degree three I guess, so you can see three walls over here associated to three reflections.
08:46
And I personally, I'm not so picky about the idea that the walls should be an actual partition. I'm okay with them being just a union that is equal to S,
09:02
and I allow the two half spaces to kind of intersect along what I like to think of as the wall. And that's a workable definition for what we're going to do. And it's a little bit easier in a way because that way there is a thing that we actually call a wall if you actually manage to get the two half spaces to intersect.
09:22
But needless to say, over here, in the most elegant version of this definition, S would be these six points, the six vertices for instance, and we have our three walls. So now we talk about Sagiv's construction.
10:03
It is going to be a process which, this is going to be a construction, which takes input a wall space and gives output a cat zero cube complex,
10:42
which we call the dual to that wall space. So let me describe Sagiv's construction, and really what I'm going to be doing is I'm going to be describing the cubes of the cube complex. So the main thing is the idea of a zero cube.
11:02
That's the hardest thing over here. A zero cube in this output, in this dual cube complex, so maybe let me be a little formal here,
11:25
a zero cube of this dual cube complex is a choice of half space for each wall.
11:50
So what do I mean by choosing a half space? Well, if you've got yourself a wall, then you could say, I'm going to choose the left half space for the wall, or you could say I'm going to choose the right half space for the wall.
12:03
So you're going to need to choose a half space for each wall. And this choice is going to have to satisfy two conditions. The most important one is such that no two choices,
12:24
no two chosen half spaces, are disjoint. So what that means is that, heuristically, this picture is not allowed.
12:52
I've chosen a nice little communication device to put a little normal vector on your wall
13:01
to indicate what your chosen half space is. This is going to be a choice for each of these two walls, but it's problematic because this chosen half space, the yellow chosen half space, and the orange chosen half space are disjoint. And the other condition is a little bit, you can ignore it for now, but let me spell it out.
13:23
All but finitely many choices, all but finitely many chosen half spaces contain some particular, and hence any,
13:44
some fixed point little less zero. So here let's indicate the sort of behavior that we don't accept,
14:04
although it can fail in other ways. So here's our point S0 in our set, the underlying set of the wall space. And then maybe there's a sequence, it doesn't have to look quite like this, but that's the easiest way to get the idea across.
14:22
This is not allowed. So these are not allowed, forbidden.
14:42
S0 is one of the points, so my set S, probably it has a bunch of points. And you just choose some point, it doesn't matter which one, maybe this one, that's one of the points.
15:01
And then we require that, well maybe there's a few of the walls, a few of the half spaces in our zero cube, maybe a few of the half spaces won't contain S0, but almost all of them do. But the question is quantified,
15:21
do you say there exists S0 such that you also hold S0 equals? There exists for some fixed point, so you choose S0 ahead of time, and then, thank you, you choose S0 ahead of time, and then you want, and then it's also true because of this requirement over here
15:42
that it doesn't depend upon your choice. Okay? Okay. Yep, thank you. Okay, yes, please. How does two correspond to your picture? So it looks like your choice of half spaces, infinitely many of them don't contain that first point.
16:01
Right. So I don't like that. I like to draw the things that were not allowed. Okay, I see. Huh? Yes? So, and they don't have to be in this kind of descending chain. They could be, you know, they could be off in all sorts of different directions, right?
16:22
It could have been a forbidden picture which looked like this, et cetera. And our point is over here, but there's more and more walls that are...
16:42
That breaks one as well, right? Yes, it does. That's a great point. Who said that? Okay. So, I like this definition
17:01
because I like it that a zero cube is a lot, has a lot of stuff. So, I don't know, it's a lot of information. Now, we need to say what the one cubes are. We need to say what the one cubes are, and it's actually pretty simple from here.
17:22
I should really illustrate this. Let me say what the one cubes are and then I'm going to illustrate it. Excuse me. So, there's going to be a one cube. It's going to join two zero cubes
17:43
if they differ, if their associated choices differ on exactly one wall. Okay? So, I'm going to illustrate that in a second.
18:03
And then, we're basically done. You then, we've built the one skeleton, add an n cube for larger n whenever you see its n minus one skeleton is there.
18:31
So, you add higher cubes wherever you can, starting with the squares and then the three cubes and so forth.
18:41
Okay, so let's breathe. So, it turns out this is going to be cat zero. It's going to be simply connected and not positively curved. Let's breathe some life into it with a few examples. So, maybe the most traditional example is,
19:13
it goes back a few hundred years, maybe 150, something like that.
19:29
So, this is a situation where no two of the walls cross each other, so to speak. We say the two walls cross if all four possible intersections of their half spaces intersect,
19:42
have non-empty intersections. So, let me first draw the dual for you. Is there enough contrast between, what do you guys like, orange or red? Orange or red? Huh? I mean, I'm not talking about what you like.
20:03
What do you see better? Red. Okay, so this is, here's my wall space, my walls are the w's,
20:32
and my dual is this cube complex C. Okay, and let's look at one of the zero cubes and try to decide what,
20:46
let's look at one of the zero cubes and decide what choice of half space for each wall it's associated to.
21:01
Okay, so are you able to see the purple or not? Okay, so that's a nice one. We're simply orienting everything towards this point right here.
21:25
Okay, so it's very easy now to start imagining other zero cubes. And how do you know that, how do you know the axioms are satisfied? Well, this is not a concern because any two half spaces contain my big point.
21:41
So we're okay. And this one also. Let's now ask ourselves, well, what's the difference between the purple zero cube and the orange zero cube?
22:03
With the orange zero cube, everything is going to be the same except for one small difference. And the difference is right here.
22:23
I've taken this half space and I've flipped it so that it goes in that direction, right? Okay, so this one cube over here between the purple and orange zero cube is kind of associated specifically to this wall.
22:41
Okay, so now you see a one cube. Well, now you know the one skeleton. Although it's going to get more complicated. There weren't any higher cubes to add because we don't see their one skeleton.
23:01
It's a tree. It's actually, it's not the most traditional usage of the word dual but it's actually dual. I think it's dual. Here's a slightly more conventional dual. We're even more familiar with the usage of the term.
24:03
Okay, so here again, these are my walls. And I'm going to draw the dual. And it's actually going to be even more familiar than the case of the tree.
24:24
In this case, because there's something very simple about this type of wall space that I've drawn, each zero cube is actually going to correspond to a point in the complement of all of the yellow walls.
25:01
And I suppose we should play the same game. Let's choose, let's focus on a particular zero cube.
25:20
And it's again the case that it's associated to the choice of, it's associated to the choice where we're directing all these normal vectors are towards that zero cube. That type of zero cube is called the canonical zero cube.
25:43
So, and then, you know, if we flipped it over to this orange one, you know what the change is going to be. It's just that change right over there. So I'll just put the change that way. And if we flipped it to this green one,
26:06
then there'd be this change here. Right, green is not so good. Let's see what this does.
26:24
To check that those are the only zero cubes, of course it's a finite problem, but is there a way to do it without going over the possibilities? I don't know what that means. So you define what the zero cube is in terms of the choice of half spaces.
26:41
So you have some evidence, zero cubes correspond to the point zero. So maybe there's a surprise zero cube that we didn't see. Yeah, we're going to do that. We're going to do that. So maybe I should move forward. So in a way, all this picture is exhibiting, you're looking and you're seeing that you can flip this one, you can flip that one.
27:00
If you flip them both, you get here. You get to this white zero cube. If you flip this one, maybe the white one's more interesting. If you flip that wall, and you also flip this wall. And you leave all the other walls just like the purple zero cube wanted.
27:21
Then you get this zero cube. So we need to do a more exciting example. So I'm going to do that, because otherwise this isn't so interesting, because it's just like something that we all know about, we learned about when we were in high school, I guess. These little dual pictures. So what's a more interesting example?
28:04
So we already know the game, and we know about these canonical zero cubes, where you just orient all the walls towards some point, and that's going to satisfy the axioms. And we found seven, and maybe it's a good idea,
28:27
just this one time, to do this.
29:09
And what I'm going to do is let's call our walls the first, second, and third walls.
29:30
And actually let's direct them, let's make this choice, so that we're starting at this zero cube right over here.
29:44
Okay, that's going to be our sort of neutral choice. And now let's name all of the other zero cubes, because we can make a little naming system now. I suppose maybe you'll forgive me for calling neutral one, and let's name them one, one, one.
30:08
That's all of these, and forgive me for the number one being that. That just means neutral. So one, one, one, and let me proceed. One, one, zero, one, zero, zero,
30:22
one, zero, one, zero, zero, one, zero, one, one, zero, one, zero. So zero, one, zero, that's this guy right over here. That's zero, one, zero. And why is it called zero, one, zero?
30:41
Because we've flipped the first wall, we kept the second wall in its original position, so it hasn't changed, and we've flipped the third wall.
31:02
So you got from one, one, one to zero, one, zero by flipping two walls. Agreed? So now we see that there's another zero cube that we left out before, and that's zero, zero, zero.
31:20
We like zero, so that's the type of zero cube, a sort of secret zero cube that was hidden. And well, that corresponds to,
31:40
this is orange cube, it corresponds to reversing all three of these. And you look at these three orange chosen half spaces and you see that their triple intersection is empty. So the zero, zero, zero cube is not a,
32:07
what I call the canonical cube. So, excuse me? Canonical zero cube. Thank you.
32:21
I said what a canonical zero cube was, should I say it again? I'll put it over here. But it really belongs right after we defined what a zero cube and a one cube was, and we said what the cube complex was, it's an observation that zero cubes exist in the dual.
32:45
Just orient all half spaces, orient all walls towards a point of S.
33:08
And you'll get, let's name that point, little s, obtain a canonical zero cube Cs.
33:26
What was your question? No, if you cannot do this, if S is empty, there is no such canonical. If S is empty, there's no, OK, good. OK, you're fine. So, the truth is,
33:45
to give you a private confession now, I too love the empty set, and I normally don't even, it was just as a public service that I told you about the set S, because I only imagine the walls.
34:05
So I got a bunch of walls, and you can wonder what they mean even, but it never bothered me. And then I just make sure that I don't have two walls pointing away from each other, and I don't have certain terrible things. Actually the second type of terrible thing
34:21
doesn't bother me very much either, because it's something at infinity, which I'm actually quite happy with. And points in S, I never give them much consideration. OK, so,
34:42
oh my goodness, I'm super duper slow today. Exercises, well, aren't I at 9.15?
35:04
All right. Time flies when you're having fun. So, let's just call it an exercise that C is non-positively curved, and C is simply connected.
35:25
Both of these are actually easy. One of them I even put in the exercises, even though I'm sure it's one of the ones that you're not going to get up to because I put too many. And let's move forward. Let's discuss the notion of a
35:45
codimension one subgroup. So, I guess, let me sort of invite you to exercises. So, one of the things that I will ask
36:01
in our exercises is to compute the dual to a system of n families
36:20
of parallel walls in R2, for example. So, you can have some orange ones, some red ones. I'm imagining that each of these families is infinite,
36:41
so you get some nice wall space like this. I want you to figure out exactly what the dual cube complex looks like. You will be able to. Let's now talk about codimension one subgroups.
37:08
Yes? In the first two pictures, have you actually drawn all of the zerocubes that are named non-canonical zerocubes? In the first two pictures, there are no non-canonical zerocubes. So, exercise when
37:29
when w does not have three
37:41
pairwise crossing walls, there are no non-canonical yucks. Every zerocube is canonical.
38:15
Thank you. Where were you when I was writing, making my exercises? Huh? That's good.
38:21
So, and that's very well observed, and that somehow things get interesting as soon as you have a bit of a mess, and it's exciting because we love dual, because a dual means a secret, that there's a secret, and then we feel that we're in the game and other people don't know. So, if the secret gets exciting
38:40
as soon as you're starting off with a wall space that seems kind of tame, and there's a dual, and the dual is something gargantuan, something maybe could be infinite dimensional, and with a very, very rich
39:00
local complexity. So, that's actually what happens. So, let's see where these come from. So, I'm going to talk now about co-dimensional subgroups. Let G be a finitely generated group with Cayley graph epsilon.
39:30
A subgroup H of J is co-dimension one
39:45
if there exists r more than zero such that the Cayley graph
40:01
minus the r neighborhood of the subgroup, which is just a subset of the vertices of the Cayley graph, has at least two H orbits of components K
40:36
that are deep
40:44
in the sense that K is not contained
41:06
in any finite neighborhood of H. Okay, I need to,
41:20
it's a little bit of a mouthful. So, what you should be, let me spell out examples before we try to express the definition in a little bit more humane form because really we should be giving an incorrect definition which is more humane
41:42
and then we'll think about it a little more carefully. But just an example quickly to have in mind. Any copy of Zn in Zn plus one is co-dimension one.
42:08
Any cyclic subgroup in the fundamental group of a surface, of an orientable surface
42:24
is co-dimension one. So this is sort of suggesting the terminology. What's the picture? Well, let's first look at a very explicit example
42:46
of Z inside of Z squared. So here's the Cayley graph of Z squared and here's a cyclic subgroup,
43:11
maybe a nice diagonal cyclic subgroup. And the first part of this definition is, well, the subgroup
43:22
should cut the Cayley graph in half. It should cut the Cayley graph. It should coarsely cut it. We want the Cayley graph minus the neighborhood of the subgroup should have more than one component. That's the first thing that we want. So, well, I guess it already cut it right now.
43:44
Maybe this wasn't an exciting example. Maybe I'll... We'll leave it as it is. I'll change it here. Now, I chose a slightly... I chose an index two subgroup of the one that I had before.
44:03
So now my subgroup does not quite cut the Cayley graph. When you remove the subgroup from the Cayley graph, it doesn't cut it because you can still travel through. There's a little gap over here. But you could take a neighborhood, and so is it a closed neighborhood
44:20
or an open neighborhood? It doesn't really matter. The definitions don't really matter. Let's assume it's a closed neighborhood. And let's take a two-neighborhood. Let's take a two-neighborhood of this subgroup. What does it look like? One, two.
44:42
One, two. One, two.
45:01
I think that's what it looks like. And now, as you can see, this yellow neighborhood
45:21
of my subgroup... Here's my subgroup. So I have the Cayley graph, the Cayley graph of the group. I have my subgroup. I have the two-neighborhood
45:41
of the subgroup. And that yellow neighborhood cuts the Cayley graph into two... It cuts it into two components. But we want those components... There's two things that we want to say about the components.
46:00
One is that we want those components to be deep. We want those components to be non-trivial, to be sort of impressive. So the way to state that is to say that they get very, very far
46:22
from the subgroup. And that's the case over here. So these components are deep. The two white components that you see are deep. They go far from the subgroup. And the other thing that you see is that this is a little more subtle, has at least two h orbits of components.
46:44
So actually when you look at how the subgroup is acting on this situation over here, it's quite nice. There's actually only two h orbits, in fact.
47:00
The top white component and the bottom white component don't get exchanged by the action of the subgroup. Now, if this had been maybe a Klein bottle, this could have been the Cayley graph of a Klein bottle, for example, of a Klein bottle group, and maybe the subgroup might have been acting by a glide reflection,
47:21
then how many h orbits would there be then? If h were a glide reflection, there'd only be one, and it wouldn't count as a codimensional one subgroup. And if you look in the literature, you'll see people make mistakes about that, myself as well, many times, especially in the early literature on this topic.
47:42
The notion of codimensional one subgroup is a very old notion, but it kind of became really very important after Sagiv's work. So let's see how this is now related to to wall spaces. Oh, I should say this.
48:01
Here's an alternate and elegant alternate definition of codimension one is the following, comes from the following. h is codimension one
48:25
if and only if g is this finitely generated group with Cayley graph epsilon, h is codimension one if and only if the coset diagram, the coset graph, as people sometimes call it the Schreyer graph,
48:45
has more than one end. So if you have a graph,
49:03
the number of ends of the graph,
49:23
or having more than one end means that you can remove a compact subgraph
49:42
and get several infinite components and get more than one component which is deep in the sense that it's far
50:02
from this compact subset. So there's a way of defining the number of ends. This graph will have three ends. This graph over here, kind of train track, will have two ends, because you're kind of cutting just this one point, doesn't do anything, but cutting a little more,
50:20
you've got two ends over there, and so forth. On the other hand, this Cayley graph over here only has one end, because no matter what compact subgraph you remove, there'll only be one infinite, so if it's a locally finite graph, let's just stick to locally finite graph, there'll only be one infinite complementary component
50:41
when you remove a compact subset. So the number of ends is the maximal number or the largest number allowing infinity or the limit of the supremum of the number
51:02
of infinite complementary components as you remove larger and larger compact sets. Did you find uncountably many ends, if you define the space of n as the inverse limit? Yes. Then if they are all finite, but in some cases you could get a control set of ends.
51:21
Well, okay, I don't want to stop and think about that. So I think I'm going to continue, and then I'll talk to you about it. I'd love to talk to you about it afterwards. So what happens, to think about this lemma,
51:40
what's happening actually is that the neighborhood, when you think about what's going on with that lemma, the neighborhood that you're removing, the neighborhood of the subgroup that you're removing is going to correspond to this compact set that you're removing in the coset diagram. This is the graph that we're interested in.
52:00
We want to say that it has more than one end. So the neighborhood that you're removing, the neighborhood of your subgroup that you're removing is this compact set that you're removing from the coset diagram. And you want to have at least two infinite complementary components. Well, the complementary components
52:22
are going to correspond to the h orbits. The complementary components over here in the coset diagram are going to correspond to the h orbits of deep components. That we're interested in. OK, that's the sort of connection to this lemma, and I think it's a much more elegant way of stating it,
52:43
but maybe not always the way we think about it. So let's now conclude this by explaining how we're going to get
53:06
from a codimension-1 subgroup to a wall space. We already know how to get from a wall space to a ket-0 cube complex.
53:23
We've discussed a codimension-1 subgroup. Let's talk about how to get from a codimension-1 subgroup to a wall space. So what did Sagiv do?
53:40
The codimension-1 subgroup, so here's his construction, let H be codimension-1 subgroup,
54:04
choose R such that the R neighborhood of H has at least two h orbits of deep components,
54:21
so in particular it has some deep component K, and then let W be the wall where one part is K
54:44
and the other part is its complement. And then, I'll draw you a picture of all this in a second, let our collection of walls
55:00
just be the set of all translates of these partitions. So we obtain, so this is going to give us a wall space on G,
55:23
so S is going to be G, well I guess you can let S be the Cayley graph if you'd like as well, that's fine. This yields a wall space with a G action.
55:47
So not only do you get, so what will happen then is that you obtain a dual with an action by your group.
56:05
So this is the game. So the picture is the following, a very simple picture. Here's our Cayley graph, and here's our subgroup,
56:32
and it has a little neighborhood,
56:43
this little neighborhood which is cutting our Cayley graph up in an interesting and essential way. And then, well, we know that there's, looking over here, there's a way of deciding,
57:04
maybe choose K to be one of these, choose K to be one of the deep components, there's a lot of leeway when you're playing the game over here,
57:21
K would be one of these, and then the complement of K, so that's going to be left W, and then the complement of K, if you're being very particular about this, this might be right W over there, so that's the complement of K, and then if you course-ify your vision
57:42
and you're not so particular about this, then you might just say, okay, I got this wall over here, and there's this side and that side, that's my wall,
58:00
and then when you take that wall in the Cayley graph, so I'm just looking at it in a kind of more summary, heuristic fashion, and when I take that wall and I translate it around by the group action, that's that entire collection of translates of that wall, so there's going to be this one and this one and this one and this one,
58:22
and those are just translates, and probably translates of this wall are going to cross itself, so when you translate this wall, well, maybe it crosses itself, so you might get that one and that one over there and this one and so forth,
58:42
and now you have a whole bunch of walls, and the group is acting, permuting these walls around, and so the dual cube complex,
59:00
which we now know how to define, we're already prepared for that, is likewise going to get acted on, I think I switched my conventions,
59:23
but there's this dual cube complex, it's a very concrete example here, it looks like everything is canonical, but it's not usually so simple, but that's okay, it isn't really such a big deal either way. Well, this cube complex C is our goal,
59:44
and the action of the group on the wall space gives you an action of the group on C, so g acts on C. Alright, well, of course this...
01:00:00
This construction works with several codimension 1 subgroups. And many things about the setup
01:00:24
can be flexed a little bit. The one thing that you might consider, it's an interesting exercise. You know, why is the number of points separated
01:00:47
by walls finite? So you kind of imagine your points. It's pretty convincing that there'll be finitely many walls that separate P and Q,
01:01:03
because there'll be finitely many walls whose yellow neighborhoods even intersect this white arc, this white geodesic. So that's more or less the reason.
01:01:25
Another thing to note, and then I think I'll stop there, is that as you can maybe guess from the construction, the stabilizers of hyperplanes of the dual cube complex
01:01:59
are pretty much end up being commensurable with conjugates
01:02:17
of our codimensions 1 subgroup H. So I'll stop now.
01:02:23
And I have to stop. Yay.