Tag Archives: surfaces

Connecting hyperbolic and half-translation surfaces, part II (math)

1 Mar

Last week we saw the standard definition for a hyperbolic surface.  You can tweak this standard definition to define all sorts of surfaces, and we tweaked it for a definition of half-translation surfaces.  Here are the two definitions:

  •  A hyperbolic surface is a topological space such that every point has a neighborhood chart from the hyperbolic plane and such that the transition maps are isometries.  
  • A half-translation surface is a topological space such that all but finitely many points* have a neighborhood chart from the Euclidean plane and such that the transition maps are combinations of translations and flips.  These finitely many points are called singularities.

Precision note: according to Wikipedia, we need to add the adjective “Hausdorff” to our topological space.  We won’t worry about this or give a precise definition of it; you can just know that Hausdorff has something to do with separating points in our space.

Half-translation spaces come with something nifty that occurs in Euclidean space.  You know how when you look at a piece of notebook paper, it has all these nice parallel lines on it for writing?  Or if you look at a big stack of paper, each sheet makes a line which is parallel to the hundreds of others?

This is from clip art panda.  How useful!

Mathematicians call that a foliation: each sheet of paper is called a leaf.  This is an intuitive definition; we’re not going to go into a technical definition for foliation.  Just know that Euclidean space comes with a foliation of all horizontal lines y=r, where is some real number.  Then since transition maps of half-translation spaces come from either straight translations or flips, the foliation carries over to the half-translation space (though orientation might have flipped, we don’t care about those in this application). 

halftrans3

All the slides are generously shared by Aaron Fenyes 

 

Notice in the picture in the lower left that there are a few points where the horizontal foliation doesn’t quite work.  Those are the singularities that show up in the definition of a half-translation surface (we need them if we want our surface to be anything besides an annulus).

halftrans4

At those singular points, we glue together patches of Euclidean space.  The orange color in this picture shows the path of the critical leaf as it winds all the way around the surface some number of times.

Last week we had those nify gifs to show us how to think about curvature as positive, negative, or zero.  Here’s the example of zero curvature, because the last arrow is the same as the first arrow:

zr1ms

We can actually get precise numbers instead of just signs for curvature.

zq4dx

curvaturenumber

Here the triangle encompasses -π/3 curvature.  Notice that it embeds straight down into the hyperbolic surface, so we see an actual triangle down in the lower left.  If we made this triangle bigger and bigger, eventually it’d wrap around the surface and we wouldn’t see a triangle, just a bunch of lines hinting at a triangle up in the hyperbolic plane.  That’s the next picture.

Curvature can range from -π to π.  Here’s an example of an extremely negatively curved triangle which has -π curvature:

idealtriangle

Such a triangle in hyperbolic space has all three corners on the boundary/at infinity.  This is called an ideal triangle.  So all ideal triangles encompass -π curvature.  You can see also how in the surface, we have a collection of lines whose preimage is the ideal triangle.

We can also use the same process to find curvature in other places.  For instance, if we make a little hexagon around a singularity of a half-translation surface, we can go around it with the same parallel transport process to figure out how much curvature the singularity contains.  We’ll make use of that horizontal foliation we saw earlier.

zw4zr

This looks very similar to our ideal triangle: the arrow starts off pointing up, and ends up pointing exactly the opposite direction.  So this singularity has -π curvature too, just like the ideal triangles.

Now for the math part!  Here’s the question: given a hyperbolic surface, how can we construct an associated half-translation surface?

Answer: we’ll use those foliations that we had before, as well as something called a geodesic lamination: this is when you take a closed subset of your surface, and give it a foliation.  So it’s like a foliation, only there’ll be holes in your surface where you didn’t define how the pages stack.  The first example of a geodesic lamination is a plain ol’ geodesic curve in your surface: the curve itself is a closed subset, and the foliation has exactly one leaf, the curve itself.  After this example they get real funky.

funkytown

You don’t even have to take me to funkytown; geodesic laminations are already there!

Given a book, we might want to know how many pages we’ve read once we stick our finger in somewhere.  Luckily there are page numbers, so we can subtract the page number we started at from the page number we’re standing at.  Similarly, given a foliation, we might want to have a measure on it, transverse to the leaves.  If we have one, it’s called a measured foliation.  These exist.

So let’s start with our hyperbolic surface, and choose a maximal measured geodesic lamination on it.  Maximal means that the holes are the smallest they could possibly be.  Turns out this means they’re the images of ideal triangles under the atlas.

lamination

Told you they were funky.

Also, there are only finitely many of these triangle-shaped holes down in the surface (we’re sweeping some math under the rug here).  Now we need to get from this surface to a half-translation surface.  We’ll keep that foliation given by the lamination, and we need to get rid of those complementary triangles somehow.  So the lamination’s foliation will become the horizontal foliation of the half-translation surface, and the ideal triangles will correspond to singular points.  We can’t just collapse the ideal triangles to singular points, because as we saw earlier, images of ideal triangles are really funky and wrap around the surface.  We need to find smaller triangles to turn into singular points.  Here’s the picture:

deflation

Upstairs, we made a new purple foliation (transverse to the lamination) of the complementary ideal triangles, by using arcs of circles perpendicular to the boundary circle (these circles are called horocycles).  So now we have teensier triangles in the middle of the ideal triangles, called orthic triangles.  To make a half-translation surface, we’ll quotient out the horocycles, which means that in each ideal triangle, we identify an entire purple arc with one point.

quotient

Quotienting out horocycles a.k.a. identifying the pink lines all as individual pink points.  That means each side of the orthic triangle is identified with a point, so the orthic triangle disappears.

In this way we get tripods from triangles.  The middles of these tripods are singular points of the half-translation surface.  The measure from the measured lamination gives a measure on the foliation of the half-translation surface.

But Euclidean space actually comes with horizontal and vertical distances defined (remember, half-translation surfaces locally look like Euclidean space).  So far we have a way to get one direction.  How do we get the transverse distance?  We use the fact that we chose a geodesic lamination of our hyperbolic surface.  Geodesics are curves of shortest length; in particular they have length.  So if I’m in my translation surface and moving along a leaf of the foliation, I can look back at where I was in the lamination of the hyperbolic surface and use that distance.  [There’s some rug math here too.]  So we’ve made neighborhoods in the half-translation surface look like Euclidean space.

So that’s that!  You can also go backwards from a half-translation surface to a hyperbolic surface by blowing up the singular points into ideal triangles.  [More math, especially when the singularities of the half-translation surface are messy or share critical leaves].  Aaron claims this is folklore, but a quick google search led me to this paper (in French) and this one by the same author who connects flat laminations (on half-translation surfaces) to the geodesic ones we see in hyperbolic surfaces in section 5.

*I lied about finitely many points.  You can have infinitely many singularities in a half-translation surface; they just have to be discrete (so you should be able to make a ball around each other disjoint from the others, even if the balls are different sizes).  Examples of discrete sets: integers, 2^x, x>0. Examples of not-discrete sets: rational numbers, 2^x, x<0.

Connecting hyperbolic and half-translation surfaces, part I (definitions)

24 Feb

I love talks that start with “I haven’t seen this written down explicitly anywhere, but…” because that means someone is about to explain some math folklore!  There are some statements floating around in mathland that specialists in those fields believe, so the rest of us believe them because the specialists said so, but no one knows a citation or a written proof for them.  That’s folklore.  Two weeks ago I gave a talk and someone asked a question (are RAAGS uniquely determined by their defining graphs?) and I said “probably, but I have no references for you.”  I found a reference a day later and emailed it to her, but the reference was way hard and had way more machinery than I was expecting.  The power of folklore!

Anyways, this series of posts will be based on a talk by a grad student at UT, Aaron Fenyes.  This was a great, great talk with lots of pretty slides, which Aaron has generously allowed me to put up here.  We’ll review curvature and surfaces, and then talk about how to go back and forth between two kinds of surfaces.

We’ve chatted about hyperbolic space v. Euclidean and spherical space before in terms of Euclid’s postulates, but let’s chat a bit about curvature. We say the Euclidean plane/real space has curvature 0, that hyperbolic space is negatively curved, and spherical space is positively curved.  There’s a nice way to see curvature: draw a triangle in your space (that old link also has some triangle conditions in it), and imagine standing at a point on that triangle and looking toward one corner of the triangle.  By “looking out” I mean your gaze should lie tangent to the triangle.  Remember:

Left: tangent; line hits circle at exactly one point. Center: not tangent, line hits circle at two points Right: not tangent, line doesn't hit circle

Left: tangent; line hits circle at exactly one point.
Center: not tangent, line hits circle at two points
Right: not tangent, line doesn’t hit circle

Now walk toward the corner you’re facing, and then walk down the second side of the triangle still facing that direction (so you’re sidestepping), and walk around the next corner (so you’re now walking backwards) and keep going until you end up where you started.  This is called parallel transport.  If your triangle was in Euclidean space, then you’re facing the same way you were when you started.

zr1ms

Gif!  Note the ending blue vector is identical to the beginning purple vector.  So we have curvature 0.

If your triangle was slim, then you might find yourself facing the opposite way that you started!  Or if your triangle isn’t that curved, you’ll find yourself facing a direction counterclockwise from your original one.

zq4dx

Aaron Fenyes made the pictures; I gif’d it!  My first gif!

curvaturesummary

This is the summary of the gif: you can see how the ending light blue vector is pointed away from the original purple vector

curvaturenumber

From the original to the new vector: it’s a pi/3 counter-clockwise turn.

Similarly, if your triangle was fat, you’ll end up facing a direction clockwise from your original.

zr2qp

Here’s the picture of just the first and last arrows:

scurv1

The green arrow is now clockwise from the red arrow, which means this has positive curvature.

So curvature is a way to measure how far clockwise you’ve turned after doing this parallel transport.

I love that description of curvature vs. the way I did it before, but they’re all good ways of seeing the same thing.  Next we need to review surfaces.  When we first met hyperbolic surfaces, we built them by gluing pairs of pants together, which themselves were stitched together from right angled hexagons which lived in hyperbolic space.  Redux:

Now if I take a little patch from my hyperbolic surface, I can trace back through one or two pairs of pants to find the original hexagon(s) in hyperbolic space where my patch came from.  So I have a map from hyperbolic space to my patch of hyperbolic surface, describing the metric and geometry around that patch.  This map is called a chart, and every point on a hyperbolic surface will have a chart associated with it, sending some part of hyperbolic space to a neighborhood of that point.

hypsurf1

Here Aaron picked a blue patch and an orange patch in the surface, and the picture shows their charts from the hyperbolic plane to the patches.

This picture might make you leery: what happens when images of charts overlap, like they do here?  The preimages in the hyperbolic plane are disjoint, but they map to the same yellow area in the surface.  We want to say there’s some reasonable relationship between the yellow preimage patches in the hyperbolic plane.  That relationship is the only one we know, isometry:

hypsurf2

There’s an isometry of the hyperbolic plane sending the orange patch to the new orange patch, so that the yellow parts overlap exactly.  

If we look only at the yellow patch, we can find another way to describe the map in the picture: first, do the blue chart sending the blue patch to the surface.  Then, do the inverse of the orange chart, which sends the orange surface patch to its preimage.  Restricted to the yellow overlap patch, this is the definition of a transition map.

So here’s another way to think of hyperbolic surfaces, instead of gluing hexagons together like before.  A hyperbolic surface is a topological space such that every point has a neighborhood chart from the hyperbolic plane and such that the transition maps are isometries.  

If you change where the chart is coming from, we can change the adjective before surface.  For instance, a flat surface is when the charts come from the Euclidean plane.  Now we’re going to define half translation surfaces, where the charts come from the Euclidean plane, but we have some more conditions on the transition maps.  The isometries of the Euclidean plane all come from a combination of translations and rotations.  Instead of allowing all isometries, we’ll only allow some of them:

halftrans1

In this picture you can see the orange and blue patches on the surface which come from the Euclidean plane.  Now we’re allowing translations and pi (180 degree) rotations only for our transition maps.  That’s why they’re called half-translation surfaces: charts from the Euclidean plane, and transition maps are translations plus half-rotations (flips).  As an aside, a translation surface is when we allow translations only, and no flips.

halftrans2

In the next post in this series, I’ll go through Aaron’s explanation of how we can go from hyperbolic surfaces to half-translation surfaces and back, and we’ll get to revisit our old friend the curve complex.  It’ll be fun!

Kissing numbers, current research in hyperbolic surfaces

30 Mar

I just got back from the fantastic Graduate Student Topology & Geometry Conference, where I gave a talk and also brought my baby.  I tried to google “bringing baby to academic conference” as I’ve seen one baby at a conference before (with his dad), and I knew this kid would be the only baby at ours.  But it was cold enough/uncomfortable enough that I just had him stay in the hotel with my mom, and I ran back during breaks to feed him.  Also, it was my first time being “heckled” by both of these two brother professors famous for “attacking” speakers- they happen to know just about everything and are also suckers for precision, which I am not (and should be).  But I got a lot of good feedback on my talk, and I’m generally a very capable speaker (though I was not as prepared as I would’ve liked, thanks to somebody who likes to interrupt me every five minutes…)  IMG_20150328_104129098Anyways, this is not about me, this is about my friend who gave one of the best talks of the conference and more importantly, her research.  This post is based on notes I took during her talk + skimming her paper (joint with her advisor) on which it is based.

Remember that we had our introduction to hyperbolic space.  This research is focused on hyperbolic surfaces, which are shapes that locally look like hyperbolic space- this means that if you look at one point on the surface and just a little area around it, you think you’re in hyperbolic space.  A good analogy is our world- we live on a sphere, but locally it looks like flat space.  If you didn’t know better, you’d think the earth is flat, based on your local data.  So how can we build a hyperbolic surface?

While hexagons in flat space always have angles that sum to 720 degrees, that’s not true in hyperbolic space.  In fact, you can make right angled hexagons, which means that every single corner has 90 degrees.  If you pick three lengths a,b,c>0 and assign these lengths to three sides of the hexagon like the picture, you’ll fully determine the hexagon- hyperbolic space is wacky!

happyhex

Now glue two copies of a hexagon together along those matching a,b,c sides.  You’ll have a funny shape with three holes in it, and those holes will have circumference 2a, 2b, 2c.  This is called a pair of pants in topology.

happypants

You can glue together a bunch of pants to form a hyperbolic surface, by gluing them together along holes with the same length.  Any hyperbolic surface, conversely, can be cut up into pairs of pants (this pants decomposition is not unique, as you can see below).

PANTS

You could also set one of those lengths equal to 0, so you’d get a right angled pentagon as one of the hexagon’s sides would collapse.  You can still do the pants thing here by gluing together copies of the pentagon, but instead of having a hole with circumference 2a like we had before, you’ll have a cusp that goes off to infinity- it’s like an infinite cone with finite volume.

winkcusp

Now we’ve built every hyperbolic surface (there are some more details, like how you glue together pants, but let’s just stick with this broad schematic for now). As long as the expression 2-2*(number of holes)-(number of cusps)<0, your surface is hyperbolic.  So, for instance, a sphere isn’t hyperbolic, because it has no holes and no cusps, so you get 2 which is not smaller than 0.  And a torus isn’t hyperbolic, because it only has one hole, so you get 2-1=1.  But all the surfaces in the pictures in this post are hyperbolic- try the formula out yourself!

One thing you can ask about a hyperbolic surface is: how long is its shortest essential curve?  By “essential,” we mean that it isn’t homotopic (this is a link to a previous post defining homotopy) to a cusp or a point.  This shortest curve is called the systole of the surface.  Systolic geometry is a whole area of study, as a side note.  But we’re interested in the question: how many systoles can a surface have?  This is called the kissing number of the surface.

A few notes: a “generic” surface has Kiss(S)=1, that is, there’s only one shortest curve if you happen to pick one “random” surface (scare quotes because no precise definitions).  And it’s relatively “easy” to make a surface with Kiss(S)=3*(number of holes)-3+(number of cusps).  Check for yourself that this number is exactly the number of curves in a pants decomposition of a surface.  Using some hyperbolic geometry you can prove that there won’t be any shorter curves if you make all of the pants curves very “short.”

So what Fanoni and Parlier do in their paper is come up with an upper bound on the kissing number of surfaces with cusps.  I won’t go into that, but I will try to explain part of a lemma they use on the way.

If your surface doesn’t have any cusps, then systoles can pairwise intersect at most once.  But if you do have cusps, then Fanoni & Parlier prove that your systoles can intersect at most twice (and they build examples of surfaces with cusps that have systoles that pairwise intersect twice).

First they show that two systoles which intersect at least twice can only intersect in the way pictured to the left below, and not as in the right:

This picture from the Fanoni-Parlier paper I did not make this!

This picture from the Fanoni-Parlier paper I did not make this!

This matters because it implies that two systoles which intersect at least twice must intersect an even number of times.  In particular, if two systoles intersect more than twice, then they intersect at least four times.

So assume for contradiction that two systoles and intersect more than twice.  So they intersect at least four times.  That means that there’s some intersection point somewhere such that the b-arcs coming out of it make up no more than half of the systole length (see picture below)

If the green arc is more than half the length of the circle, then the blue one is less than half the length of the circle

If the green arc is more than half the length of the circle, then the blue one is less than half the length of the circle.

So if you look at these short b-arcs, plus the path, and wiggle things around, you’ll see a four-holed sphere (two holes above” the curve, and two holes “below,” one of each inside a arc).

Left: a schematic of how a and b intersect.  Black dots represent holes or cusps.   Center: the short b arcs plus the full a path Right: the short b arcs plus the a path, after moving four dots to be holes of a 4-holed sphere

Left: a schematic of how a and b intersect. Black dots represent holes or cusps.
Center: the short b arcs plus the full a path
Right: the short b arcs plus the a path, after moving four dots to be holes of a 4-holed sphere

This four-holed sphere has a curve on it, determined by part of and the arcs, which is shorter than the original systoles.  This contradicts the definition of systole, so our premise must be wrong- two systoles can intersect at most twice.

This was proposition 3.2 in their paper- tomorrow I’m going to share propositions 3.1-3.3 with my advisor’s small seminar.  Hopefully I don’t get heckled too badly this time!

OOPS I ALMOST FORGOT: life update.  We bought a house and are moving to Austin, TX.  I’m still planning on finishing my Ph.D., just virtually.  [Up to a finite-index subgroup, obviously.  Bad math joke].  I’ll probably be flying up to Chicago every so often to meet with my advisor/eventually defend my thesis.  But yes, we’re driving in our minivan to Texas on Thursday.  So… we’ll see when we get the internet set up in the new house.  I’ll try not to make too long a break until my next post.

Introduction to the curve complex

21 Jan

This isn’t actually what I’m focusing on, but my friend Matt does his research with this thing.  I think it’s pretty cool so I’ll try to explain what it is.  P.S. I signed up for a class called “Explaining Science” this semester so hopefully my exposition will get clearer.  Or I just need to write more math posts and they will get better.

I’m going to chat with you about the curve complex, so first, let’s think about curves.

simple closed curve on a surface is a big ol’ loop (closed) that doesn’t cross itself (simple).  You can think of these as made of stretchy pieces of string.  Two curves are homotopic if you can push the string from one curve to form the other curve, without jumping across holes.

Red curves are homotopic to each other; blue curve is not

Red curves are homotopic to each other; blue curve is not

So for our example, no matter how you move it, the blue string won’t ever look like either of the red ones, because it’s “stuck” on the big hole in the middle, and no matter how you manipulate it, it has to get around that hole by going to the left half of the torus.  Versus the two red curves are homotopic, because you could suck in that big alien arm from the top red curve, and the little thumb wrapping around the bottom, and then you’d look like the bottom red loop.  We say the red curves are both representatives of the same homotopy class.

At first, it might be tempting to think there’s only two homotopy classes of loops on the torus: red ones, and blue ones.  But then you get green ones:

Green curve not homotopic to either the blue or red ones

Green curve not homotopic to either the blue or red ones

Our green guy wraps around the horizontal axis of our torus once, but it wraps around the vertical way four times.  It totally can’t be manipulated to look like either the red or the blue curves.  [Aside: knot theorists could call this a (4,1) torus knot, for obvious reasons, but since one of the numbers is a 1, the knot is trivial.  E.g. the green curve is just a loop if you took away the torus.  But if it was, say, a (4,2) knot, then it wouldn’t be trivial if you took away the torus.]

My point was this: there’s a whole bunch of homotopy classes of simple closed curves on this very simple surface.  And on any surface, there’s gonna be a whole bunch of homotopy classes of simple closed curves. (In fact, infinitely many.)

Instead of looking at the surface, we can look at those curves and talk about them.  But it’s pretty impossible to just look at a list of curves and say things about it, just like it’s way hard to look at a list of roads and figure out the best way to get from A to B.  What we need is a road map to show how these homotopy classes interact with each other.  And that road map is our curve complex.

So let’s make this map.  For each homotopy class, we form a vertex (like a city).  So in our example, we’re holding three vertices, say R, G, and B.  Then we draw an edge between vertices (like a road between cities) if the homotopy classes have some representatives that don’t intersect.

In our case, no matter how you draw them, all three of our curves intersect.  So they’re just three disjoint vertices in our curve complex.

Here’s a quick example of curves that do have disjoint representatives (image found here):

Disjoint curves

Here, the curves are disjoint, so in the curve complex, there’s an edge in between them.  Anytime we have classes that have representatives that are pairwise disjoint, we add an n-simplex.  So if we had three curves A,B,C so that A and B had pairwise disjoint representatives, B and C had pairwise disjoint representatives, etc., we’d have a triangle in our complex.  Note that these are representatives, so even if the B curve that is disjoint from A intersects C, we’re OK if there’s another curve homotopic to that B curve which is disjoint from C.

So this is the object that my friend Matt thinks about.  There’s a couple cool things to say about it, and I’ll do another post later about this paper I read, but here’s a few goodies:

The curve complex is locally infinite.  So if you’re standing in one city, and you look around, there are infinitely many roads heading out to other cities.  Another way of saying this is that there are infinitely many vertices that are distance 1 away from your vertex.

It’s “hard” to find curves far away from each other. If I give you a curve on a surface, you can probably draw a disjoint nontrivial curve; there’s so many distance 1 away.   In order for two curves to be distance two apart, they have to intersect, and there has to be a third curve disjoint from both of them.  In our picture above, a_1, b_1 intersect, and both are disjoint from a_2, so that’s okay too.

So for two curves to be bigger than distance 2 apart, there can’t be a third curve disjoint from both of them.  That means that if you had scissors and cut along one curve, and then cut all along the other, you’d end up with a pile of discs (so any curve disjoint from the first two would be trivial).  Another way is saying that these guys have to fill the surface.

We just did distance 1, 2, 3.  It gets harder from there.

But the curve complex has infinite diameter.  I don’t know this well enough to explain it here.  But it’s true: there are roads that have infinitely many cities hanging out on them in our map.

This seems like enough for now.  Curve complexes are pretty hip, and the paper I read was just submitted in October by Joan Birman and William Menasco.  This whole post is in the first paragraph of that paper, so I referred to this talk by Moon Duchin while writing.  There’s a standard way to cite references in math blog posts, just like people standardly write recipes at the end of baking blog posts.  I’ll get the hang of it.  I put in the reference for the second picture by it, but the first picture is an MS Painted version of this picture by Paul Bourke.  

Okay!  Math blog post 2, done!

%d bloggers like this: