Kevin Knudson: Welcome to My Favorite Theorem, the math podcast with no quiz at the end. I'm Kevin Knudson, professor of mathematics at the University of Florida, and I am joined today as always by my fabulous co-host.

Evelyn Lamb: Well, thank you. I'm Evelyn Lamb, a freelance math and science writer in Salt Lake City. And anyone who's on this Zoom, which is only us and our guest, can see that I am bragging with my Zoom background right now. We just got back from a trip to southern Utah, and I took possibly the best picture I've ever taken in my life. And 95% of the credit goes to the clouds because they just — above these red rock hoodoos outside of Bryce Canyon, I turned around and looked at it while we were hiking, and I was like, Oh, my gosh, I have to capture this.

KK: It is quite the picture.

EL: My little iPhone managed.

KK: Yeah. Well, they're pretty good now. Yeah. Anyway, so yeah, I'm getting ready to — I have three trips in the next three weeks. So lots and lots of travel, and I'm gonna make sure I mask up and hopefully I don't come home with COVID, but we'll see.

EL: Yes.

KK: Anyway. So today, we are pleased to welcome Matthew Kahle. Matt, why don’t you introduce yourself?

Matthew Kahle: Hi, everyone. Thanks for having me, Kevin and Evelyn. I'm a mathematician here at The Ohio State University in Columbus, Ohio. I've been here for 11 or 12 years now, and before that, I spent a good part of my life in the western United States. So those clouds look familiar to me, Evelyn. I miss the Colorado sky sometimes.

EL: Yeah, just amazing here.

KK: You did your degree in Seattle, right?

MK: I did. I did my PhD at the University of Washington.

KK: Yep. Yep.

EL: Great. And what is your general research field?

MK: I work a little bit between fields. My main interests are topology, combinatorics, and also probability and statistical physics. And I think I usually feel most comfortable, or maybe I should say most excited mathematically, when there's sort of more than one thing going on, or when it's in the intersection of more than one field.

KK: Yeah, lots of randomness in your work. He’s got this very cool stuff with random topology. And I remember, some paper you had few years ago, I remember really sort of blew my mind, where you had some, you're just computing homology of these random simplicial complexes, and, like, some four- or five-complex had torsion of order, you know, I don't know, 10 to the 12th, or some crazy torsion coefficient. Yeah.

MK: Yeah. So we were really surprised by this too, and we still don't really have any way to prove it, or really understand it very deeply. Kevin was mentioning some experimental work I did with some collaborators a few years ago. But yeah, that is the gist of a lot of what I think about, is random topology, which I sometimes try to sum up as the study of random shapes. And one of the original motivations for this was as sort of a null hypothesis for topological data analysis, that if you want to do statistical methods — if you want to use topological and geometric methods, and statistics and data science, you need a probabilistic foundation. But one of the things we've discovered over the last 15 years or so is that these random shapes are interesting for their own sake as well. And sometimes they have very interesting, even bizarre, properties, where we don't even know how to construct shapes that have these properties at all, but they're they are there. And we know they exist, because of the probabilistic method. Yeah.

EL: So let me be the very naive person who asks, like, how do you, I guess, come up with — like, what do you randomize about shapes? Or you know, if I think about, I don't know, randomly drawing from from some sort of, I don't know, bucket of properties, is it that or is it… Just what is random? What quantity or quality is being randomized?

MK: Right. So a lot of the random shapes or spaces that I've studied have have been on the combinatorial or discrete side. So for example, there are lots of different types of random simplicial complex that people have studied by now. And typically, you have just some probability distribution, some way of making a random simplicial complex on n vertices. And n can be anything, but then the yoga of the subject is that typically n goes to infinity. And then we're interested in sort of the asymptotic properties as your random shape grows. So one of the early motivations, or early inspirations, for the subject of random, simplicial complexes was random graph theory. So you can create random networks various ways, and people have been studying that for for a bit longer, probably at least 60 years or so now, with new models and new interesting ideas coming along all the time. For example, there was originally the Erdős–Rényi model of random graph where the edges all have equal probability, and they're all independent. This is a beautiful model mathematically, and it's been studied extensively. We really know lots and lots about that model of random graph now, although surprisingly, people can continue to discover new things about it as well. But in today's world, some people have studied other models of random graphs that they say may have made better model real world networks, for example, social networks, or what we see in epidemiology, and so on. The Erdős–Rényi model is something that's tractable, and that we can prove deep math theorems about, but it might not be the best model for real world networks. But, you know, I think of the random simplicial complexes that I study sometimes as just higher-dimensional versions of random graphs.

EL: Okay.

MK: So as well as as well as vertices and edges, we can have higher-dimensional cells in there, and and that starts to sort of enrich the space. It's not just one-dimensional now, it could be two-dimensional, or it could be any dimension.

EL: So you might not know. You've got some large number n, and you might not know what dimension this random — you’re, like ,attaching with edges with some sort of probability between any two things. And so you might not know what dimension your simplicial complex is going to be until after you randomly assign all of these edges and faces and, you know, and n- whatever the word is for that, n-things. [Editor’s note: it’s n-simplex.]

MK: Yeah, absolutely. That's right. It could be that the dimension of the random simplicial complex is itself a random variable. And you know, that we don't ahead of time even know what the dimension of it is.

EL: Cool!

KK: So there's lots to do here. This is why Matt has lots of students and lots of lots of good projects to work on. But anyway, we invited you on not just to talk about this really interesting mathematics, but to find out what your favorite theorem is. So what is it?

MK: Okay, so I've been thinking about this. Well, I have to admit, I think I asked myself this just knowing of your podcast in case I ever got invited on. And then I've been thinking about it since you invited me. I would say my favorite math theorem, probably the one I've thought about the most, the one maybe that affects me the most, is Euler’s polyhedral formula, which is V−E+F=2. Right? So let's just start out saying, well, you know, what do we mean by this? I think my understanding of the history of it is that it was something that as far as we know, the Greeks didn't observe even though they were interested in convex polyhedra. And sometimes people consider the classification of the perfect Platonic solids is one of the peak contributions of Euclid’s Elements. But we don't know that they recognized this pattern that Euler noticed thousands of years later. If you take any convex polyhedron, a cube or an icosahedron, or a pyramid, a bi-pyramid, any kind of three dimensional polyhedral shape that you can imagine that's convex, V, the vertices is the sort of number of corners of the shape and E is the number of edges. And then F is the faces. It always is the case that V−E+F=2. So Euler noticed this. And it's not clear if he gave a rigorous proof or not. I don't even know if he felt like anything needed to be proved, maybe it was obvious to him. And nowadays, we have many, many beautiful proofs of this fact. But one of the things that strikes me about it is that, it’s sort of in hindsight, is that this is just sort of the tip of a very big iceberg. There's a much more general fact that we are just kind of getting our first glimpses of, and nowadays, we would think of this as not just a phenomenon about convex polyhedron, 3-dimensional space, that it’s just a general phenomenon in algebraic topology, or you can say =more generally, in homological algebra. It's just sort of a feature of nature somehow.

KK: Right, right.

EL: I think something that I really enjoy about this fact is you can present it at first as a theorem or as a fact. But then this fact kind of leads you to this new definition that you can observe about all sorts of different shapes, you know, this number that is the vertices minus the edges plus the faces, hopefully, I got it in the right order, yes. Then you can assign that, you know, you can say, like, what does, you know, if you've got a torus, like a polyhedral torus, or, you know, a higher-genus object or a higher-dimensional thing, you can sort of use this, and so it's like a fact becomes a definition or a new thing to observe.

MK: That’s right. Are you saying, for example, you know, we have the Euler characteristic is an invariant of a space?

EL: Right.

MK: And that might, if you're introduced to a new topological space, that might be one of the first things you might like to know about it. And so yeah, it becomes its own invariant. It’s a way of telling some different spaces apart, for example.

EL: Yeah. So do you have a favorite proof of this favorite theorem?

MK: I do. I present it and the graduate combinatorics and graph theory course when I teach this course. So already, we're looking at a little bit more general formulation than what Euler looked at. We don't just have a convex polyhedron in 3-dimensional space, what we have is a connected planar graph. So we have some kind of network with nodes and connections between them, and it's one that you can draw on the plane without any of the edges or connections crossing. And in this case, the faces now are just going to be the connected components, or the regions, in the complement of the graph that then comes with an embedding into the plane. And then V is the number of vertices of the graph, and E is the number of edges. So V−E+F=2 in this case, so for for just any connected planar graph, this might seem totally unrelated, but it's actually a more general version than what we just saw with convex polyhedra because you could take any convex polyhedron and unwrap it, or stereographically project it into the plane and get a planar graph. But planar graphs could have lots of other features. So when I present this in class, I tend to give three or four different proofs of it. There's a beautiful proof that I've heard attributed to John Conway, where he says something about, like, letting in the ocean or something. So your graph is connected, but there may be some cycles in it. And anytime you have cycles, the Jordan curve theorem tells us there's an inside and outside. So John Conway wants to let the ocean in. The ocean is the sea, is the outside of the graph, let it in until it touches. So what he's saying is if there's any cycle, delete one edge from it, and so what this does is it reduces the number of edges by one because you deleted an edge, but it also reduces the number of faces by one because that two regions that were inside and outside of that cycle are now the same region, so V−E+F has stayed the same.

KK: Right.

MK: And then eventually, you've just got a tree. There's no more cycles left, but your graph is still connected, so it must be a tree. And we know that every finite tree with at least two vertices has a leaf, has a vertex of degree one. And again, you can prune away that, and then you've reduced the number of vertices by one and the number of edges by one. And V−E+F is again not changed. So at the very, very end, we're just left with a single vertex in the plane. There's one vertex and there's one region, which is everything except that vertex. So at the very end, V−E+F=2. But through all those steps, we know that it never changed. So it must have been V−E+F, it must have been 2 at the very beginning. So I love that proof.

EL: Yeah.

MK: There's another proof that I think I like even better, which is that you consider the dual graph and a spanning tree. You pick a spanning tree on the original graph and a spanning tree and a dual graph at the same time.

EL: So the dual graph being where you replace, you swap vertices and faces.

KK: Yes. For every face there’s a vertex and you join two when the two faces share an edge.

MK: That’s right, exactly. So one thing that's tricky about that is that now the dual of even just a nice planar graph might be a multi-graph. So just imagine a triangle in the plane. The dual graph has two vertices, one inside the triangle and one outside, but there's three edges connecting those two vertices, because there's three edges in the original graph. And the edges in the dual graph have to correspond to edges in the original graph, and that's important. They cross them transversely. So then you choose a spanning tree on each one, and you and you realize that — you count the number of edges in each and you somehow — now I'm getting a little stuck remembering the proof, but the punch line is in the original graph, I guess the number of edges is V−1. And then the dual graph, the spanning tree, the number of edges is F−1. And these have to be in correspondence. So you just immediately just write down V−1=, sorry, no, I don't remember exactly how that the end of that proof goes. But there was something about it I liked. It seemed like the other proofs, you're kind of doing induction on either the number of vertices or the number of edges or the number of faces, and that you have to make some arbitrary choices. And this proof by duality doesn't use any induction and doesn't require any choices. It just kind of comes for free. And you sort of immediately see where the 2 comes from, because there's a V−1 on one side and an F−1 on the other side, so the 2 just sort of pops out immediately from the proof. There’s — I think it’s Eppstein? — some mathematician collects proofs of Euler’s polyhedra formula on his website, and he has at least 10 or 20 different proofs. And when you read them all, some of them start to remind you of each other, and who knows what counts as the same proof or different proofs.

KK: Sure.

MK: But there are some neat contributions in there. One of them he attributes to Bill Thurston in the middle of some very influential notes that Thurston had in differential geometry. And he's talking, he's giving his own proof, I think, that the Euler characteristic of a differential manifold really is an invariant of the manifold, for a smooth manifold, let’s say. You could triangulate it, and then the Euler formula, the Euler characteristic, you could just say is the alternating sum of the faces of every dimension. But why doesn't that depend on which triangulation you pick? And Thurston gave a really beautiful kind of almost physical argument with, like, moving charges around. I like to show the class this one also. At that point, we leave — I don't know how to make that proof work for planar graphs, but it works beautifully for polyhedra, for convex polyhedra, like what Euler first noticed. And apparently, it works also for higher dimensional manifolds, too, although I've never gone through that proof carefully.

KK: Yeah. Right. Well, the proof that you said might be attributed to Conway is sort of the one that I always knew, and I never heard it attributed to him, but that's good. It's sort of nice. You can explain that one to just about anybody right? You just sort of imagine plugging away an edge and a face at the same time basically, yeah.

EL: Yeah. A proof that proof that is of something that is so visual, but you can really understand over a podcast, is a special proof. Because I do think that it doesn't take a whole lot of you know, imagination, to be able to follow this audially.

KK: Audially, is that a new word?

EL: There is a real word that is embedded in that word. Aurally, that’s the real word I was trying to say.

KK: Yeah, so is this sort of a love at first sight theorem? I think I first learned this theorem in the context of graph theory.

MK: I think for me, too.

KK: And then I became a topologist kind of later. And then of course, now I think of it as, oh, it's the alternating sum of the Betti numbers, but that those two quantities are equal is an interesting theorem in its own right.

MK: Right. Yeah. So I was trying to think about this. When did I learn about this theorem? And I think I first learned it in graph theory also. But then I know now that it's much more general, and I don't even know if I ever remember anyone telling me that specifically in a class or reading it in a particular book or paper. I think this to me, maybe part of what I like about the Euler formula is that I feel like my understanding of it has just deepened over time, and that there’s kind of a series of small revelations. At some point, I started thinking of it as the alternating sum of the Betti numbers, and things like that. And since I like the combinatorial side of topology, and have simplicial complexes or cell complexes, also the alternating sum of the number of faces of each dimension. But then even in the last couple of years, my understanding has continued to develop because now I think, you know, well, you could just have a chain complex, and all you know is the dimensions of the vector spaces, but it makes sense to ask what's the homology of the chain complex, so they're the Betti numbers again, and again, the alternating sum of the Betty numbers now is the alternating sum of the dimensions of the vector spaces of your chain complex. But I think I probably first saw, you know, the graph theory version of it, maybe in an undergrad or a first graduate combinatorics course.

KK: All right. So the other thing on this podcast is we like to ask our guest to pair their theorem with something. So what have you chosen to pair Euler’s formula with?

MK: Well, you know, I've been stumped by this. But you know, thanks for the warning that I am going to get asked this question. So I had a little time to think about it, and I'm not totally stumped on the spot. But the thing that keeps coming to mind the most when I ask myself that question is some of Bach's music. Johann Sebastian Bach is really known for his four-part harmonies and for counterpoint, and it feels a little bit like this: You're listening to a beautiful piece of — it could be anything, you know: a fugue on an organ, or four-part harmonies that were written for choral music or something like that. And when you listen to it, you can listen to a recording of it two or three times and each time pick out a different voice to follow along. And there are just these independent melodies, harmonies that he's somehow weaving together. You can also just relax and just let the whole thing wash over you. And honestly, that's most often how I listen to music. But it's completely fascinating to just hone in on one particular thread. And so I think a lot of people feel like Bach's music has maybe a mathematical feeling to it, or that it's mathematically perfect or precise. So you could say that Bach, pairs with mathematics already, but the reason I want to try to connect it with the Euler formula that I like as my favorite theorem is that there are these sort of different layers. And just the same way you can kind of listen for one voice, and then tune your ear and listen to a different voice and emphasize that, I feel like this is one of these areas, of one of these kinds of mathematical phenomena, that’s just sitting there in, you know, platonic space, or wherever it lives. And you can look at it. So if you look at it from the topological point of view, it's the alternating sum of the Betti numbers, the number of holes in each dimension. But if you look at it through a combinatorial lens, then it's the alternating sum of the number of faces of each dimension. Or you can just step back and it's just its own thing. It's just an invariant of the space, the Euler characteristic, and these just happen to be different ways to compute it. But it has that feeling to me that you can look at it different ways. But you're really always looking at the same thing. Just we're putting on different glasses or looking at it through different lenses, and so it reminds me of that sort of, I don't know, counterpoint and music or something.

EL: Yeah. Oh, I love this pairing! I'm also, I play viola and I sing, and when you get to a point when you’ve learned a piece that you've learned it enough that you don't have to be just concentrating on, like, am I singing the right note at the right time, but you can actually start hearing like, oh, I didn't originally hear that the parallel that the bass and the soprano line has right here, or the way we come in and then the altos come in and something like that. I've been singing a lot of, you know, things that have these fugal sections in them, which is — I haven't actually sung much Bach recently, but similar things — and I just love that pairing and how seeing the same thing, or singing the same music over and over again, you hear something different every time. You know, just a little easter egg that you didn't pick up the first 20 times you practiced this piece, and then now you hear and you say, oh, next time I really want to make sure that I, you know, do that crescendo with the tenors just perfectly or something. I love that.

KK: Yeah, so I see the edge of a keyboard there in your Zoom, Matt. Do you play?

MK: A little bit. I mean, nothing to write home about, but it's something I enjoy. I took it back up during the pandemic as a hobby. And I've been practicing a little bit. This over here, I have a little portable keyboard, and then I have an electric piano out in the living room. But I've been practicing music with one of my friends. We get together, like, once a week and and just play some cover songs. And I like what you're saying, Evelyn, about hearing different things. Even, you know, we'll be playing some song by REM or somebody that I've known, I don't know, it seems like my whole life, it’s very familiar. But once we start to play it, once we start to sing it, then I hear all kinds of different things in it that just listening to the same recording that I've listened to before all of a sudden, I'm like, wait, Mike Mills is actually doing some really interesting harmonizing and this track, and not only is he harmonizing, like singing different notes, than what Michael Stipe is singing, he’s actually singing different words. He's saying something in that song I never even noticed he was saying. So anyway, music and mathematics, I think that's probably another big thing that they have in common, is that, you know, a little bit can go a long way, and even just entry-level, you can already start to appreciate the beauty of it, but that it's sort of almost inexhaustible how deep it goes and that you can always, there's always more to learn. There's there's always more to notice.

EL: Yeah, with Bach specifically, you know, as a viola student, I think I started playing the Bach cello suites, an octave up on the viola, I was probably 10 or 11 years old? And it's like, I will still play those same suites that I started learning when I was in fifth grade. And it's like, it always has something to teach me. It's something that I can always get something more out of.

KK: Yeah. I think we can all agree that that Mike Mills is REM’s secret weapon. I took up the guitar about 10 years ago, so I'm terrible, and I play alone. But it's still something that I enjoy to do. It's certainly, it's a good way to exercise your — what was it Leibniz said? That music is the pleasure the brain derives from counting without knowing that it's counting?

EL: Oh, yeah. That’s a good little quote, to file away for us math-musician-type people.

KK: That’s right. All right, well, so we always like to give our guests a chance to plug anything. Where can we find you on the interwebs?

MK: Yeah, I don't have anything particular to plug, but you can find, you know, all my mathematical work on my professional webpage, matthewkahle.org. There's links to all my papers and everything there. And, you know, if my friend and I get our REM cover band off the off the ground, we’ll keep you posted.

EL: All of our Columbus area listeners can find you.

KK: I can play rhythm guitar on some of the tracks if you need somebody.

MK: All right. We'll have to all get together if you come out and visit in Columbus.

KK: Well this has been great fun.

EL: Thanks so much for joining us.

MK: Thanks for having me today.

[outro]

On this episode, we were delighted to talk with Matthew Kahle of the Ohio State University about Euler's polyhedral formula, also known as V−E+F=2. Here are some links you might find useful as you listen to the episode.
Kahle's website
His paper about torsion in homology groups of random simplicial complexes
The Erdős–Rényi model of random graphs
Euclid's Elements, book 13, is devoted to the classification of Platonic solids. Also found herestarting on page 438.
The Jordan curve theorem has made a previous appearance on the podcast in our episode with Susan D'Agostino.
David Eppstein's website with 21 different proofs of Euler's formula. Thurston's proof is here.

Kevin Knudson: Welcome to My Favorite Theorem, the math podcast with no quiz at the end. I'm Kevin Knutson, professor of mathematics at the University of Florida. And today I am flying solo while I am at Texas Christian University in Fort Worth, where I'm serving as the Green Honors Chair for the week. And I've been given some talks and meeting the fine folks here at TCU. And today, I have the pleasure to talk with some of their students. And they're going to tell us about their favorite theorems and what they pair well with. And we're just going to jump right in. So my first guest is Aaryan. Can you introduce yourself?

Aaryan Dehade: My name is Aaryan. I'm a sophomore computer science major at TCU, and I'm from India. And I've chosen to go with the fundamental theorem of calculus.

KK: Okay. The fundamental calculus.

AD: Yeah.

KK: Okay, so now there are two parts of the fundamental theorem of calculus. Do you have a favorite part?

AD: So that's what I like about it. Honestly, I can't choose a favorite part because one of the parts is very important, and the other is interesting.

KK: Yes.

AD: So the first part, basically, it tells us the relationship between the integral and derivative. The second part tells us — like, basically, you can use that second part supply and to get solutions for questions in calculus. Does that makes sense?

KK: Sure.

AD: So what I like about this theorem is that it's not like other theorems where it has two parts. So it's kind of interesting how everything in calculus is based off of these two theorems. And if you didn't know what the relationship between the derivative and the integral was, probably you wouldn't be able to do anything with mathematics with it.

KK: Sure, maybe. Yeah. So you said one part was useful, and one part was interesting. Which part do you think is interesting?

AD: I feel like the first part is interesting, because it's almost intuitive. Like, you know that should happen, like the relationship between integrals and derivatives should be, like, one is an inverse of the other. And that is intuitive. So it's almost given. And it's interesting that we have to say that.

KK: Really, you think that’s intuitive? I mean, I’m not — I don’t know, when I first learned the fundamental theorem, I thought it was kind of shocking that somehow this this thing, this integral, which is sort of defined as in terms of these Riemann sums, somehow that went, you know, if you let x be the upper limit there, and you differentiate that function, you get your original function back. That’s intuitive? That’s amazing.

AD: Yeah, basically what it is, it's just an area of a rectangle. So I just thought of it as just decreasing the width of the rectangles, and then you get smaller and smaller rectangles, so you get the area. And then if you take the function at that point…that’s what I think.

KK: You’re cleverer than I am. I was just kind of dim, I guess, and I didn't think it was so intuitive. I mean, I saw the proof and believed it. But then, yeah, then the second part is how you actually evaluate integrals.

AD: Yeah, so that's what you use to calculate the area between two points.

KK: Yeah. Although I guess the problem is, right. So the theorem says that, you know, if you want to find the, the integral, the value of this definite integral, all you have to do — and our listeners can't see me doing the scare quotes — “all” you have to do is find an antiderivative of the function. Right?

AD: Right.

KK: Yeah. And then you spend all of Calc II learning how to find antiderivatives.

AD: Yeah.

KK: And even then, if I hand you an arbitrary function, you can't even do it, right? Like that's the sort of disappointing part of that theorem, is that most functions, you can't find a closed form antiderivative for. And so what do you do? But you’re a computer science major. You know what you do, right? You do it numerically, right?

AD: Yeah.

KK: Okay. Very cool. So you've known this theorem for quite some time, I guess.

AD: Yeah, I've done it since high school.

KK: So you love the theorem.

AD: I really, yeah, I do. Because when I was in high school, I used to sit at my dining table and study because I wanted to have some snacks at the same time.

KK: Sure. As we all do.

AD: I would just spend hours just doing sums on integrals, or basically just integrals. That was difficult at that point.

KK: Sure.

AD: And yeah, it was interesting, because I got used to that at some point. And then it got easier. And I just started liking the satisfaction of being able to do this. That was fun.

KK: Cool. All right. So on this podcast, we also like to ask our guests to pair their theorem or something. So what pairs well with the fundamental theorem?

AD: So as I said, I used to sit at the dining table and have snacks. And there's this really, really popular biscuit in India called Parle-G. And I used to have that with tea while doing my sums. So that was the highlight of it, that's why I used to look forward to studying, just for those biscuits.

KK: Okay, so I assume there's an Indian market in town somewhere, right? Can you get these?

AD: Yeah, I do have them in my dorm right now. Yeah. I have them every day.

KK: All right. So what are these called again?

AD: Parle-G.

KK: Parle-G. Okay. So I'll have to go to the Indian market when I get back home and see if I can find these because I am always on the lookout for a good new biscuit.

AD: Yeah, they’re amazing. Okay, so you should you should know, our very first episode of this podcast, aur guest, who was Amie Wilkinson, who is on the faculty at University of Chicago, chose the fundamental theorem as her favorite theorem. So you're in very good company, because she's a phenomenal mathematician. And okay, thanks.

AD: Awesome. Thanks so much.

KK: All right, up next, we have Toan. So why don't you tell us about yourself and what your favorite theorem is?

Duc Toan Nguyen: Okay. My name is Duc Toan Nguyen. People usually call me Toan. I’m an international student from Vietnam, and I'm a sophomore majoring in math and computer science

KK: Okay, great. So, favorite theorem. What’ve you got?

DTN: Yeah. So as my peer Aaryan, he chose the fundamental theorem of calculus, right?

KK: Yes.

DTN: But I want to bring another fundamental theorem in analysis, which is the mean value theorem.

KK: Oh, okay. So I have a theory, okay. I call the mean value theorem, the real fundamental theorem of calculus.

DTN: Yeah, me too!

KK: So why do you like it so much?

DTN: Yeah, I think I have the same idea with you of why it is called the real fundamental theorem. I think, because to prove the fundamental theorem of calculus, you need the mean value theorem.

KK: You absolutely do.

DTN: Also for analysis, the most popular and common tool in calculus, which is a derivative test, also has the mean value theorem behind it.

KK: That's right. Yeah, that's right.

DTN: So when I first so I first approached the mean value theorem when I was in high school. I took the Math Olympiad in Vietnam. So I had to prepare for that, and there is a section about that.

KK: Okay.

DTN: So it's called the Lagrange Theorem, it was kind of very fancy. Yeah. And it usually applies to — so you know, in the exam, we had some of the problems related to the continuous version, and f(a) minus f(b), something like that. Most of time, we used the mean value theorem. So yeah, it was kind of cool at the time, but I really enjoyed that until last semester, I took real analysis. So I could see the whole process was using the mean value theorem. That's why it can be taught in one lecture or one unit. Even today, this semester, I’m taking multivariate analysis. And it's also a very fundamental thing in proof, everything from differentiability on. It also even has a mean value theorem in it higher-dimensional space.

KK: So maybe we should remind our listeners what the mean value theorem actually says,

DTN: Oh, okay. So, let f be a function defined on an interval [a,b], so that f is continuous on the closed interval [a,b] and differentiable on the open interval (a,b). So the theorem say that there exists a point c between a and b that is not is not inclusive so that f(b)−f(a) is equal to f’(c)(b−a). So I think the mean value theorem, the name comes from the quantity f(b)−f(a) divided by (b−a).

KK: Yeah. Right. So the average rate of change over the interval is equal somewhere to the instantaneous rate.

DTN: Yeah.

KK: Yeah, that's right. That's how you prove the fundamental theorem, too, because it's just a telescoping sum when you write it out correctly. And the mean value theorem sort of pushes everything away, and then you're done.

DTN: Yeah, that's also my favorite part. Because it can tell you the relationship between the integral of functions and their derivatives.

KK: Right, right. So what do you want to pair with your theorem, what pairs with the mean value theorem?

DTN: Yeah, I want to pair with something really weird. Which is a phone with FaceTime. Okay, so I'm here. I study. I'm far from my home. My home is in Vietnam, which is on the other side of the Earth.

KK: Almost exactly opposite, right?

DTN: Actually it takes 20 hours from this time to my country time. So it's actually like, opposite, it's more. So yeah, and the FaceTime, why? Because through FaceTime, I can see what people in my home are doing and they also [can see me]. So it's kind of a bridge or relationship that connects what I'm doing here and what my family is doing there. And, you know, my family is always wants the best for me and hopes everything is good for me here. And me too. So that's a very meaningful thing for me.

KK: Yeah. That's great. And I'm glad that technology exists. When I was in college, the internet didn't exist. So you know, I had to call people on the phone and phone calls to Vietnam, I imagine, would be — I can't imagine what that would cost. It was expensive enough to call my girlfriend who lived four hours away.

DTN: It’s kind of more romantic. And you can give them a love letter.

KK: We wrote letters too. All right. Well, Toan, thanks so much. That was great.

DTN: Yeah. Thank you.

KK: Up next, we have Maiyu Diaz. You can introduce yourself.

Maiyu Diaz: My name is Maiyu Diaz. I'm a second-year graduate student here at the department of mathematics at TCU.

KK: Cool, and you have the best shirt. You win the shirt contest today.

MD: Oh, thank you.

KK: I’m actually kind of wishing you would like give me that shirt. [Editor’s note: How dare you say that and not send us a picture?!] All right, so you’re a second-year grad student here in the math department. Okay, great. And so yeah, so what your favorite theorem?

MD: So my favorite theorem is — I don't see it really formally presented, but Stirling's formula where n factorial can be approximated by n^n e^−n times square root of 2πn.

KK: Yes.

MD: That is my favorite theorem.

KK: Yeah. So that’s a really interesting approximation for factorials. So okay, where did you come across this?

MD: I first came across this, I want to say, when I was first studying the factorial back in grade school, and it was just more of like, looking up on a Wikipedia page, which was something that I really relied on when it came to writing essays for my English classes. And when I found out that it could also be used as a resource for mathematics as well, I thought, oh, factorial, let's learn interesting things about this. And that's where I found an example about Stirling's formula, under that. It wasn’t until much later that I was able to understand how that was derived, and there were a variety of proofs for proving Stirling's formula. One of them relies on probability distributions, which are looking at how the factorial works. And then there's another way of finagling a little bit with the integral formula for n factorial that comes from the gamma function, and that's another way of deriving Stirling's formula.

KK: Do you have a favorite proof of your favorite theorem?

MD: I do, but it's a very uncommon proof.

KK: Okay.

MD: The proof relies on a contour integral involving the derivative of the Riemann zeta function.

KK: Oh! I don't know if I know this proof, but what contour do you use?

MD: So you're going to go ahead and do a contour that is on the half strip, so you're just going to fix a number like σ and since the derivative of the Riemann zeta function, you just want to pick a σ just a little bit to the right of where it converges. So real part greater than one, and that's going to be a line integral from σ − i infinity to σ + i infinity, okay? And what you want to do is that you kind of want to start pushing that back a little bit so you can start picking up the residues of the derivative of the zeta function. You’re going to go ahead and possibly the non trivial zeros you could possibly hit, though. You’re definitely going to hit the pole at s=1. That's where the n log n minus n term comes from, when you look at the log of n factorial.

KK: Right, okay, sure.

MD: You keep pushing that more, and then you're going to be picking up the rest of the terms from the Stirling’s formula as well. It's pretty interesting.

KK: Yeah. All right. I haven't seen this proof. That's very cool. Yeah, okay. Cool. All right. So what do you think pairs well with Stirling's formula?

MD: I am going to say chicken tikka masala.

KK: Chicken Tikka Masala. Okay. I do like chicken tikka masala. What in particular makes you want to link those two things together?

MD: So Stirling's formula, I would say is a little bit spicy. And I underestimated it at first.

KK: Right.

MD: Because that was just something I would not have been — I just, if you’d asked me if the formula was intuitive, it’s just like, absolutely not. Where's where does this e term come from? Where does the square root of two pi come from?

KK: Sure.

MD: It’s not until you start familiarizing with the proof more. It's like, okay, at this point, it's not that I'm used to that, I’ve just seen this too many times.

kk: Sure. Sure. Yeah.

MD: But I want to say it’s spicy because of a paper, a PhD thesis, that was published in 2014 by Matthew Lamoureux, whose advisor is Keith Conrad, who wrote a paper on Stirling's formula, just devoting a series of notes on it, you can see all the things he has compiled and I like reading through his notes. And this PhD thesis, he was looking at a generalization of the factorial, which is the factorial for number fields. So instead of looking at the derivative of the zeta function, what it was looking at was a modification of the derivative of the Dedekind zeta function because they had a function defined over number fields. And that's the same technique as well. You want to keep pushing it along the line, be able to pick up non-zeros, possible poles, and it just more or less the same outline as well, and spicy because number one, there is a ton of information coming about the factorial just from the location of zeros and poles of these zeta functions. I was like, Whoa, this is some pretty advanced stuff. I don’t want to be messing with this. But then it's also really delicious because one, I think chicken tikka masala is very delicious.

KK: It is. Agreed.

MD: But also delicious in the context of these formulas, because the approximation formula for factorials is reliant on the poles and zeros of these zeta functions. So it's like, whatever I want to know about on the left side over here, the approximation for the factorials I'm looking at, all I’ve got to know is the information about the zeros and poles of these zeta functions.

KK: Right.

MD: That’s the spicy and delicious part.

KK: Very cool. All right. That's a good pairing. I like that. Cool. Thanks, Maiyu.

MD: Thank you.

KK: Up next, we have Hope Sage. Why don’t you introduce yourself?

Hope Sage: Hey, I'm Hope. I'm a junior physics major at TCU.

KK: Cool.

HS: My favorite theorem is Bell's theorem.

KK: Okay, I don't think I know this theorem.

HS: Okay. It’s kind of Physics-y. It's from quantum mechanics. And John Bell wrote it as a response to the EPR [Einstein-Poldosky-Rosen] paper, which is kind of a famous paper in quantum physics, where it talks about how quantum physics is probably incomplete, and there's probably some hidden variable that's underlying it. And Bell uses this inequality to calculate the probabilities based on what you would expect classically. So if the quantum particles are not entangled, then you would get this expected probability. And then he shows that experimental results kind of conflict with that. And so the underlying assumption is that from that, local realism isn't a thing. So then the universe is like, super wacky.

KK: I think we knew that, right?

HS: Yeah.

KK: So okay, so Alright, so my quantum mechanics is — well, calling it rusty would be, like, an insult to rusty things. So the probability of what? The state that a particle is in?

HS: Yeah, so whenever you have two entangled particles, one might be spin up, one might be spin down, okay? And you can run an experiment. They have a beam splitter and two detectors, and you measure the different states. It's kind of a traditional example. And the probabilities depend on the angle that everything is situated at. So you have nine, and then you were to take all those probabilities, he basically proves this inequality that just shows that mathematically, it can't be possible for there to be hidden variables, which means that things are paired and they would have to be, like, communicating at faster than the speed of light, which doesn't happen. So then there are all these theories about what could theoretically be the underlying nature of the universe from that okay, in different interpretations.

KK: Okay. So which is your favorite interpretation of what might be going wrong here? Or right, whatever the right word is.

HS: There’s this interpretation kind of extended from this called the many worlds interpretation of quantum mechanics. I don't know if I’d necessarily say it is the most likely to be correct. But I think it's the most fun one. It's also fun because you can read cool science fiction books about it. Like, every action you take, there's a different universe, different paths. I think it's kind of fun.

KK: Sure, right. So so right, so like, right now, what we're doing, we could, like, split into any number of paths. And there are all these weird different outcomes that could happen, depending on whether or not some quantum state is what it is or not.

HS: Yeah, basically. One of my favorite books is Dark Matter. It's by Blake Crouch. And it's about, like, every action that you take, there’s a different universe. And then there's infinitely many possibilities based on every single decision you make, which is kind of interesting, because every decision that you make does create a different next possible decision.

KK: Sure.

HS: But yeah.

KK: Okay. Well, all right, so our minds are getting blown. All right, what pairs well with this theorem?

Well, sometimes it's called “spooky action at a distance” and so I was going to go with Halloween candy. Because spooky.

KK: Yeah, yeah. All right. Okay, so what what's your favorite Halloween candy though?

HS: Probably Reese’s.

KK: What? Okay, I have strong Reese’s opinions. So which, like the full size or the miniatures or what?

HS: Okay, a Reese's Peanut Butter Cup, but the dark chocolate version.

KK: Okay. All right. I can respect that. I am team miniature. I think that's the correct ratio of chocolate to peanut butter. But the dark, I get it, I understand. Okay. All right. That was great. Thanks, Hope. Jonah, why don’t you introduce yourself?

Jonah Morgan: All right. Well, I'm Jonah Morgan. I'm a freshman engineering major here at TCU, and my favorite theorem is Gödel’s incompleteness theorem.

KK: Gödel’s incompleteness theorems. So that's more than one theorem. All right, so let's remind our listeners what what at least one of them is.

JM: Sure. So the first one: The first of Gödel’s incompleteness theorems is effectively any — I'll call it interesting, okay — any sufficiently interesting or complex set of axioms, it fundamentally has theorems or statements that cannot be proven, but which are true.

KK: Cannot be proven inside the system, right?

JM: Yeah, cannot be proven inside the system. Right.

KK: And okay, you hedged around, but I think “sufficiently complicated” just means, like, you can do arithmetic.

JM: Yeah, you can add numbers. Because if you just can't do anything, then well, you can’t say anything.

KK: Okay. Yeah. So that's the first one. What's the second one? I think I don't even remember the second one.

JM: So the second one was, I think — I'll make some background. I just think background’s kind of fun to know.

KK: Sure.

JM: His first theorem kind of says, Okay, well, if you have a set of axioms, you can have effectively a statement that says this statement cannot be proven by the axioms. So if you have that statement, then well, if that statement is true, then it's a true statement within the system that cannot be proven by the axioms. But if it's false, then it is a statement which cannot be proven. Or it is a false statement, which cannot be proven. I'm a little rusty on that aspect of it. But effectively, the idea is, so there's this weird statement that you can have in any system, which makes it he says incomplete, where incomplete is the word for it. But then, so mathematicians are like, “Okay, well, we want to prove things. And you gave one example, it's a bit of a weird example. I don't want to prove that a statement is unprovable.” So then he has a second theorem that says, well, also there are true statements which are unprovable which we cannot prove or unprovable.

KK: Yes.

JM: And so that's the second theorem. And that's like, okay, so you can spend your life working on a theorem or working on a problem, and then you can't even know whether or not you can know the answer to this problem within within the set of axioms that you're working with.

KK: Right. So it's hopeless, in some sense. Yeah. You can't fix this issue.

JM: No. It’s — some people say math is broken. But really, it just incomplete. There are certain things —

KK: Yeah, I mean, I think it caused a crisis amongst certain elements of the mathematical community, but I'm with you, I just sort of view it as, well, okay, so there are unprovable statements. It doesn't mean the bridges that we build are going to fall down,

JM: Right. Everything we have proven still stands. You can still prove a lot of things.

KK: All right, still lots more to prove. Where did you come across this?

JM: I think some time in grade school, middle school, high school, I got really into just watching videos about mathematics. And at first they were just little conjectures and little fun things and then Gödel’s Incompleteness Theorem stuck out because it's like, I was diving into the world of math for the first time. And there are so many things that you can prove, and even these, like, crazy things that I never thought were provable, or like things that are so complex. Fermat’s last theorem took 300 years to be proven.

KK: Right.

JM: And I don't understand any part of that proof, to be honest with you.

KK: Same.

JM: But we did it. And it took a long time, but sort of my idea after seeing all of this was that, well, anything can be proven if you have a sufficiently — or maybe we're not smart enough to find the proof, but everything should be provable. Mathematics, it’s a language, you should be able to explain things in that language. And then Gödel’s incompleteness theorem says no. And also, there are things that you just — it kind of changes your perspective on that.

KK: Right.

JM: And so then you get questions like, well, you know, the Riemann zeta hypothesis, one of the most famous unsolved hypotheses. And a lot of people see this and they're like, Oh, well, does this mean that this this million dollar problem, one of the millennium problems, could just be unsolvable? And we can't even know that it's unsolvable? And I think that was the first thing I looked up when I heard about this theorem. And something that was even more interesting to me was that if the Riemann zeta hypothesis is false, it’s provably false. Because it is equivalent to saying that there exists some number on the real part one half line, yeah. So you can write an algorithm, and given infinite time, you will find sure if there is one, you will find it. So it is provably false, which also means that proving that the Riemann zeta hypothesis cannot be proven means that it must be true.

KK: Okay. Yeah.

JM: So I can't give you the formal explanation on that. I don't know what it is. But the general idea is that you can prove that something is true by proving that you cannot prove it.

KK: Yeah, that's a little mind-twisting. But I can see why this would appeal to you, as you’re coming into your own intellectual being sort of state and moving out of being a kid. Yeah, that's really great. Okay, so. So what do you think pairs well with the incompleteness theorems?

JM: So, this isn't sponsored, but GrubHub, or Uber Eats or whatever.

KK: Okay.

JM: Because, occasionally, I order food there. It's easy, it's convenient. Most of the time, you get what you ordered. And sometimes your driver takes a nugget and you don’t — and, you know, that's gone. And sometimes he just doesn't show up at the door, and you're left wondering, where's the stuff that I paid my money for? And I think the feeling is similar there that you can you can pay for something, like you can spend your time working on this theorem, and it just unprovable, and you'll never know where it went or where it goes. And also you can pay for your food and just have no idea where.

KK: Yeah, well, that's a good pairing right there.

JM: Thank you.

KK: Thanks a lot, Jonah.

JM: Thank you.

KK: All right, up next, we have Anna Long. Anna?

Anna Long: Yeah, so my name is Anna. I'm a senior math and French double major. Actually.

KK: Nice!

AL: I’ll stick with English for you.

KK: Je ne parle pas bien le français.

AL: Tres bien!

KK: So I can say I don't speak the language really well in several languages.

AL: Well, that’s all you really need.

KK: That’s right. It was only that and “toilette,” you know, yeah.

AL: Yeah, so my favorite theorem I picked is the invertible matrix theorem from linear algebra.

KK: Okay.

AL: And it's really a pretty big theorem. It's 24 equivalent statements for a square matrix, that'll call A. So just a few of my favorite little statements in there. So obviously, we have that the matrix is invertible, that the columns then form a linearly independent set. So there's always a solution. And then that, for it to equal zero, it's only the trivial solution, that your vector is zero. That it has n pivot positions, or that it has full rank. And then that the linear map is both one-to-one and onto, and that the determinant is nonzero and that zero is not an eigenvalue.

KK: Right. And that's only, like, six of the equivalent conditions. So yeah, if you open up a linear algebra book, there will usually be at some point, some page where they list all these, I had forgotten there were 24. I can probably — so I'm teaching our senior-level analysis course this year. And part of it, we do some stuff with operator theory, and they remind, in our text that we wrote ourselves, they use of 11 of the equivalent conditions, but not all of them. So yeah, I can't imagine. I don't even think I know what some of the other ones are. I'm sure I would if you told me.

AL: A lot of them are, like, jumbled together. So, like, n pivot positions and full rank I've seen defined as two different things, but they’re really the same. But essentially, because of the theorem, they're all the same.

KK: Yeah. So yeah. So why do you love this theorem so much?

AL: I just love it because it's so useful. I’ve had two linear algebra classes now, and it just makes life so much easier trying to prove that any various things in class. So yeah, it's just great being able to find the easiest statement and prove that one, and then you just know all of them are true.

KK: Right. Yeah, I do like those things when, like, 50 things are equivalent. that's really nice. Yeah. Okay. So I guess you learned this in your linear algebra course. You had a second linear algebra course? What’s the second one?

AL: I’m in applied linear algebra right now.

KK: Okay. All right. So you're doing, like, singular values and things like that?

AL: Yes, we are.

KK: Okay. All right. So that's super useful stuff. Linear algebra, of course, I think is one of those things that we don't teach enough of. And basically, any problem in math comes down to either making some estimate, like analysis, or some linear algebra problem, it seems to me. so yeah, the more you learn, the more you know, then the better off you'll be. So you're a senior. What’s next for you?

AL: Graduate school.

KK: In what? In French?

AL: No. In math. Yeah. So I haven't decided on a school yet, but I'm looking at PhD programs in applied or computational math.

KK: Excellent. That’s great. Well, good luck to you. So what pairs well with this theorem?

AL: Yeah, so I picked chicken tortilla soup, mostly because it's my favorite soup. But you kind of have all sorts of different things piled in there. You've got your spices, you've got your chicken, you got your, you know, pieces of tortilla, you've got maybe chives or your different little vegetables in there. So you have a whole bunch of things that may or may not look very similar or different to each other. But you get one scoop of it, and you have the whole thing. So it's kind of like a 24-for-one deal.

KK: It’s like 24 equivalent soups in one.

AL: Right!

KK: Okay. Very cool. Yeah. So are you from Texas?

AL: I’m from Oklahoma.

KK: Okay. So this region, yeah, that sort of makes sense. That’s a popular sort of soup. Yeah. Okay. All right. Excellent. Well, thanks so much, Anna, that was great.

AL: Thank you.

KK: Up next, we have Matthew Bolding. Matthew, welcome!

Matthew Bolding: Hey there. Thank you. Yeah. So my name is Matthew. I am a senior dual degree student for mathematics and computer science, and I'm from around here as well.

KK: Okay. Cool. All right. So what's your favorite theorem?

MB: My favorite theorem today, or really, I guess all time, is the four color theorem.

KK: The four color theorem. Oh boy. Okay.

MB: Are you familiar?

KK: Oh, yeah, I am. So there's a lot to be said about this theorem. So yeah, tell us what it is, and then we'll unpack it.

MB: Sure. So I suppose in the most dry mathematical language, the four color theorem states that the chromatic number for a graph, for a simple planar graph specifically, is no more than four. And I guess there are some things to unpack there.

KK: Yes. Right.

MB: So a planar graph is a graph that can be constructed, drawn, if you will, such that no two edges cross one another. And a simple graph is one that does not have any self loops. And I guess the other part of it is, what's a chromatic number, right? And so a chromatic number is essentially the smallest k for which the graph is k-colorable. And then that also takes us down the rabbit hole with what is k-colorable? So a k-coloring of a graph is an assignment of at most k colors to the vertices of the graph in such a way so that no two adjacent vertices are the same color.

KK: Right? Okay. So most people might know this in terms of maps.

MB: Yes, that is correct. That actually what got me interested in it. It seems so deceivingly simple, I guess, you know, four colors, all you need are really at most four colors. You could do it in three or two, depending on on the map or graph.

KK: Sure.

MB: But, you know, you can ask people, what do you think? How many colors you think you might need to color this graph under these conditions and constraints? Oh, six, seven? No, you only need four.

KK: Right.

MB: And although I'm no cartographer, you know, I've never really colored a map maybe since pre-K, I think it is just so interesting, and sort of out of the blue, that you only need four colors. And with that, I also think it is really interesting that the proof that the chromatic number is no more than four hasn't been proved by humans, by hand.

KK: Right.

MB: And we've had to rely on computers to facilitate that proof. And being a computer science, or within the computer science field to study, I think that's really, really interesting.

KK: I thought that was part of part of your motivation here. I mean, so although, yeah, recently there, some people announced a proof by hand of the four color theorem. And it's wrong.

MB: Really?

KK: So I mean, anybody who's tried to prove this thing just by hand has come up short. And, you know, so the question of the maps, right? So, for a map, it's like, you know, you don't want two states that share a border to be colored the same, you know, and you can draw examples where you need four, but it's interesting that you can always do it with four, but then it does turn into a graph or a question, because how do you how do you create a graph out of this? Well, you stick a vertex for each state, and you join them if they share a border, and now you've converted it to a graph theory question. So that's how they come along.

MB: Exactly. And actually, I found this, or was presented this theorem in graph theory last spring. And I mean, I really — of course, with a computer science background, I mean, I just, you know, jumped in headfirst. I thought it was the coolest class. You know, it maybe doesn't have the same rigor as, like, really analysis or something.

KK: Oh no, it’s hard.

MB: Well, don't get me wrong. There are some difficult concepts. You know, I guess, with a computer science mindset, you know, I mean, of course, not every topic, you know, had roots in computer science, but maybe with Huffman encoding, or shortest path algorithms, you know, it was just so interesting and fascinating.

KK: Yeah, graph theory stuff is vital in computer science. I mean, it's everywhere, and having good algorithms for that is really important. You know, decision trees and all these kinds of things that you need to know. Cool. All right. So, yeah, but it's true that the first proof was given in, what, 1976?

MB: Around there.

KK: And yeah, and basically, it reduces to some couple hundred special cases that you just check. And then you get a computer to check it. And yeah, so for mathematicians, that's unsatisfying, right? We would just like a nice clean, wordy proof that works instead of relying on computer code. But I mean, I'm okay with it personally.

MB: I am too, but according to the Wikipedia page for this theorem, there are still many doubters. I guess we just have to prove it by hands.

KK: I guess. So that's how it goes. All right. So what pairs well with the four-color theorem?

MB: I really struggled trying to think about something that went along with this, but I landed on something that you could actually, you know, show the four color theorem with, and that would be Skittles.

KK: Okay.

MB: You know, you could lay them out all flat, you know, make it a planar collection of Skittles, basically. you could arrange the Skittles in such a way that no adjacent Skittles share the same color. Of course, there are more than four colors in a Skittle pack.

KK: Right.

MB: I would think it's been a while since I've had Skittles.

KK: Yeah, too sweet. Although, so the five color theorem is really not so hard to prove. Apparently, I've been told. I think I may have even read the five color theorem proof. It's not so bad. But four is tricky.

MB: I looked back at my graph theory notes, and we worked from a chromatic number no greater than six to five. And then we sort of just had a blank, you know, statement. Well, you can prove that the chromatic number is no more than four. But right, the ones for five and six aren't, too, too — I mean, compared to having to do it on a computer.

KK: Right. Right. Compared to people, you know, not necessarily believing the computer proof, right? Yeah. Yeah. We’re convinced about five, so we’re good. All right. Well, Matthew, that was great. Thank you.

MB: Thank you.

KK: All right, up next we have Brandon Isensee. Brandon?

Brandon Isensee: I'm Brandon Isensee. I'm a math major at TCU. I'm a senior. I'll be graduating this semester.

KK: What’s next?

BI: Grad school at Rice University.

KK: In math?

BI: Yeah. Computational and applied mathematics.

KK: Okay, that’s That’s great. It’s a terrific university. You're going to have a great time there. Well, I mean, grad school is what it is. It's fun and work and all those things. But it will really a great experience. All right. So, what’s your favorite theorem?

BI: So my favorite theorem is called Sharkovskii's theorem.

KK: Sharkovskii's theorem?

BI: Yes.

KK: Okay.

BI: Have you heard of it?

KK: I have. But let's tell our listeners.

BI: So kind of the theoretical way of saying it is that the theorem relates to discrete equations that are in, it’s one-dimensional discrete equation, so you only have one variable, and if a certain period exists — if a certain periodic orbit exists — that implies the existence of other periodic orbits. And if there's a three-cycle in particular, that implies the existence of all the other cycles

KK: Yes.

BI: And so that's more of the theoretical way of saying it. But if we put this in more concrete terms, if you have an equation that models a population over time, and it's discrete time, so it's years 0, 1, 2, 3, etc. So this equation tells you the population values for each year, right? And say there's a population growth parameter within this equation that you can vary, so we'll call it K. And this parameter tells you how fast the population is growing. And so say your growth parameter is two. And for this growth parameter, no matter which population value you choose, your population ends up oscillating between three different values across time.

KK: Right.

BI: So that's the long term behavior. So as time goes on, your population oscillates between, say, four individuals, five individuals, six individuals, and it keeps repeating. So it's 4, 5, 6, 4, 5, 6, 4, 5, 6. So if that's the case, then that implies that there is a four-cycle. So maybe it's 8, 9, 10, 11, there's a five-cycle, there's a six-cycle, there’s a 1-million-cycle, all the other cycles exist.

KK: Right.

BI: And so it's quite interesting, because when you look at particular examples of equations, like the discrete logistic map, and you look at where the three-cycle exists, you only see that three-cycle. So you may be wondering why? Why am I only seeing that three-cycle and not the four-cycle or the five-cycle? That's because Sharkovskii's theorem tells you that these cycles exist, but doesn't tell you whether or not they're stable. And so when you see the three cycle, it's stable, because that's where your populations are oscillating between. But when it's unstable, well those unstable cycles repel the population values away from them, and it ends up settling at that three cycle. So it's almost like there's an infinite number of fixed points, if I'm understanding this correctly. It’s like there's an infinite number of fixed points where you see the three-cycle, but all of them are unstable, except for the three-cycle, because that's what you're seeing on the graph.

KK: Right. Yeah. So sometimes this theorem is stated as “period three implies chaos.” Right?

BI: Right. So there, so there was actually like a difference between those two. So Sharkovskii's theorem is the one that's stronger, because that tells you exactly which periods imply the existence of other periods.

KK: Yes, right.

BI: And so period three, that relates to the three-period, right, the three-period implies everything, but Sharkovskii's theorem tells you exactly which periods imply the existence of others.

KK: Yeah. And if I remember right, he puts some weird order on the natural numbers.

BI: Yes. So the order the order is, if you're doing this in rows, the first row is your odd numbers, so 3,5,7…. Your second row is your odd numbers times two. And then the next row is your odd numbers times two to the second power.

KK: Sure. Right.

BI: So it's odd numbers times powers of twos. It’s very interesting. It took me some time to understand the order, but now I get it.

KK: And then, like, one is at the end or something, right?

BI: Yeah. Your two-cycles and such, you know, your periods of twos are all the way at the bottom.

KK: And then this is very important for discrete dynamics, right? It's just kind of the whole story. That's very cool. It's very, very cool. All right, so what do you think pairs well, with Sharkovskii's theorem?

BI: So maybe it's very a superficial connection.

KK: That doesn’t matter.

BI: There's a story with Alan Turing. He's the mathematician — for those that don't know, he solved the Enigma code during World War Two, the Germany Enigma code, and because of that, I forget the exact estimates, but it's like at least a million lives were saved because of that in, like, two years.

KK: It was vitally important.

BI: That shortened the war by two years. And so there's a story with Alan Turing where he rode his bicycle, and after a certain number of revolutions of the bike wheels, the bike chain would fall off. But instead of him just fixing it, he would just count the number of revolutions as he's riding the bike, and right before the bike chain would fall, he’d get off the bike and he would just put the bike chain back on.

KK: I wonder if that’s true.

BI: I suppose so.

KK: It’s a good story either way. Yeah. Okay. That's that's a good pairing. Excellent. Thanks.

BI: Thank you.

KK: All right, and our last willing volunteer today — I think they were all willing — is Julia Goldman.

Julia Goldman: Hi. Yeah, I'm Julia. I'm in my first year of grad school here at TCU.

KK: In math?

JG: Yes.

KK: Okay. How do you like it so far?

JG: I like it so far.

KK: Math’s pretty cool.

JG: I think so.

KK: All right. So what's your favorite theorem?

JG: So my favorite theorem today is Brouwer’s fixed point theorem.

KK: Brouwer! All right, good. Finally a topology theorem. Good.

JG: So last week, I was trying to come up with a theorem talk about, and one of my professors suggested this one. And when I was going online, and reading it and learning about it, I was looking at all these proofs of it that seem fairly technical, and I’d probably want to take a topology class to really get into it.

KK: Sure, right.

JG: But the theorem itself is, I think, very understandable. And I came across so many of these cute little fun real world examples that make the theorem pretty explainable to anyone of any math background, and I really appreciated that aspect of it is approachable.

KK: Okay, so what's the theorem? Let’s remind everyone.

JG: Oh yeah. The theorem is for any continuous function of a convex compact set onto itself, there's going to be at least one fixed point.

KK: Right. One point that doesn't move.

JG: Exactly. I think that’s really fun. There’s a couple examples. Like if I had a map of Fort Worth right now, and I laid it on the floor, there would be at least one point on that map lying directly on top of the point it's supposed to represent.

KK: That’s right.

JG: That’s kind of fun.

KK: Yeah. That's a good example.

JG: Then my other favorite example is a cup of tea. You stir the cup of tea. When you're done stirring, there’s going to be one little bit of your tea that's in the same spot as when you started stirring.

KK: That’s right. Okay. Are you a tea drinker or a coffee drinker?

JG: A little bit of both. Maybe it's because I'm not a topologist, but I read that example, and I just thought, I feel like I could stir my tea enough.

KK: Sure.

JG: But Brouwer says I'm wrong.

KK: That’s right. That's right. Okay. So maybe you don't know enough topology to prove this yet? Did you find a favorite proof that sort of made sense to you?

JG: Not a favorite. I just glanced over it.

KK: Right. So the algebraic topology proof involves, like, something with the homotopy groups, or homology groups and things like that. So that's kind of weird. There are sort of analysis-type proofs. So we just talked about dynamical systems a little bit. So if you just pick any point, and you start iterating the function, right? Just keep pushing it around, then eventually it will converge to a fixed point. Well, some subsequence of it will, because you're in a compact set. So that sort of analysis thing. So that's another way to think about it. But yeah, this is a popular theorem among topologists. You know, we all really dig this theorem a lot. It's probably one of our favorite examples. It is a fan favorite. Absolutely. Yeah. Okay, good. I like the map example, too, because that's really illustrative. Okay. So what do you think pairs well with Brouwer’s fixed point theorem?

JG: Well, I wanted to pair my favorite theorem with my current favorite TV show, which I'm only a little bit embarrassed to say is a reality show called Love Island.

KK: Okay. I've heard of it. I have not watched it.

JG: I think they must have some topologists on set there because I think the show itself is kind of an example of a theorem if you stretch some definitions a little bit.

KK: Okay. Let’s hear it.

JG: So if you're unfamiliar with the show, it’s a dating show. The very first episode, all the participants are put into couples. And then there’s, like, 65 episodes of just, like, fighting and breaking up and getting into other couples, whatever. From the seasons I've seen, at the end of the show, there's always at least one couple that ends up back in their original pairing.

KK: Right.

JG: So thinking of the participants as our convex set, and all the show drama as a function, then there’s your example of the theorem.

KK: Yeah, it's funny how there are always two people who were like, you know, we were we were right all along.

JG: Exactly.

KK: Do they do it randomly? I’m sure the producers don’t actually do it randomly.

JG: I mean, they kind of mix it up. They let the girls choose the first time, or the boys.

KK: All right. Okay. Well, I’ll have to check this out.

JG: Great show. Highly recommended.

KK: Okay. All right. Excellent. Okay, well, thanks, Julia.

JG: Thank you so much.

[outro]

In another Very Special Epsiode of My Favorite Theorem, Kevin had the privilege of asking a group of nine TCU students about their favorite theorems. We loved the variety of theorems and pairings they picked! Below are some links to more information about their favorites.

Aaryan Dehade led off with the fundamental theorem of calculus.

Duc Toan Nguyen's favorite is the mean value theorem, which some would argue is the real fundamental theorem of calculus. It was also a hit with our past guests Amie Wilkinson and Aris Winger.

Maiyu Diaz shared Stirling's formula for approximating factorials.

Hope Sage chose Bell's theorem from physics, which was a response to a paper by Einstein, Podolsky, and Rosen.

Jonah Morgan shared his love for Gödel's incompleteness theorems, which also came up when we talked with math students from CSULA last year.

Anna Long chose the invertible matrix theorem, a behemoth of a theorem that gives scads of ways to show that a matrix is invertible.

Matthew Bolding highlighted the four-color theorem. 

Brandon Isensee chose Sharkovskii's theorem, which was also the favorite of past guest Kimberly Ayers.

Julia Goldman finished out the episode with a perennial MFT favorite, the Brouwer fixed point theorem. We have talked about it on past episodes, most recently with Priyam Patel. See if you agree with Julia that it is the mathematics underlying the TV show Love Island!

Evelyn Lamb: Hello, and welcome to My Favorite Theorem, the math podcast with no quiz at the end. I'm Evelyn Lamb, one of your co-hosts, coming to you from snowy Salt Lake City, Utah, where I feel like I've said that the past few times we've been taping. Which is great, because we really need the water. It is beautiful today, and I am ever so grateful that the life of a freelance writer does not require me to drive in conditions like this, especially as someone who grew up in Texas where conditions like this did not exist, and so I am extremely unconfident in snow and ice. So yeah, coming to you from the opposite side of the weather spectrum is our other host.

Kevin Knudson: I’m Kevin Knudson, professor of mathematics at the University of Florida. It's true. It's the opposite end of the spectrum, but hey, you know, I was putting up my Christmas tree the week before last and I was sweating. So this is my reality.

EL: Yeah.

KK: It’s hard to get in the mood, you know, you put on the Christmas music and you you get the tree out of the attic. And then I'm in, like, shorts and a t-shirt and sweating.

EL: You can sympathize with Australians, who have to deal with that every single year.

KK: That’s right. That's right. Yeah. So anyway, we're looking forward to a nice holiday. My son's going to come home after Boxing Day because he has a part time job at a bookstore in Vancouver and his boss said no one gets Boxing Day off.

EL: Yeah, that's that's a thing in some places.

KK: In the Commonwealth. I think it's a big thing. Right? So yeah, he'll be home on the 28th. So we're looking forward to that. But anyway, anyway, this will be after this will be after the holidays when people hear this anyway. So they'll go, gee, I wonder how that went?

EL: Yeah. Waiting with bated breath for updates about your son’s Boxing Day experience.

KK: That’s right. That's right.

Yes. Well, today we are very happy to have on the show Cihan Bahran, coming to us from I don't know what kind of weather. So yeah, could you introduce yourself and tell us about the local conditions?

Cihan Bahran: Yeah. Thanks for having me. I am joining you from Ankara, Turkey, which is the capital of Turkey in the middle. So it's a continental climate, I would say. But it has been rather mild. We haven't had any snow yet or really anything that close to freezing temperature. So yeah, it's chilly, but yeah, I like it.

EL: Yeah. And so what what kind of math are you interested in

CB: Right. So I am interested in representation theory, especially with functorial methods, and I am doing a postdoc here about that at this at this time. So actually, maybe I'm at a little bit of a disadvantage in that the theorem I will share is not necessarily directly from my expertise, so I'm not really, maybe on top of the literature or the methods, but I thought I would pick that because I find it really interesting.

EL: Sometimes, honestly, that could be a little better, because we are also not experts in that.

KK: That’s right. Yeah.

EL: But yeah, and you run a Twitter account, and I meant to look up the exact — is it called some theorems?

CB: Yeah, it's called some some theorems. The username is something like Cihan posts theorems [Editor’s note: It’s @CihanPostsThms] Okay, let me talk about that a bit. So I guess it goes back to maybe 2020 or something, not this account, so that was the pandemic time and for me, maybe psychologically a difficult time that I was seeking out somewhere to connect with the math world. And I found initially a Facebook page called Theorems. And it is it is still running, I guess. But I started posting there. And I had a lot of, like, some bits of knowledge about some interesting theorems that I would, like, share with my friends. And it became like, I was almost daily posting, like the group became dominated by my posts, to the point that people started asking, like, what are you really doing, et cetera. And then maybe since last year, I've been more on Twitter, and I posted some of these on my personal Twitter account. But then for some reasons, I had to make my personal account private. And at some point, I thought I might repost these things that I have had collected, because that group in Facebook was actually a private group, not everyone can see it before joining. And I thought I would post those on Twitter, and I find it, like, when it gets some responses, it's like a dopamine hit for me.

KK: Sure.

CB: And I was actually almost aggressively posting in the summer because I had all this sort of backlog. And at this point in time, I have posted most of the past stuff, and I post much less regularly. When I see something interesting, I post them to the to that account. And I suppose how that's how I am maybe known in math Twitter-verse.

EL: Yeah. And so as a person with with much knowledge and love for theorems, what is your favorite favorite zero?

CB: Okay, so I don't know if it's my favorite, but at least for this episode of My Favorite Theorem, the theorem I would like to share is the so-called — well, so there's this problem, and the theorem says that this is algorithmically undecidable. So what's the problem? The problem is called matrix mortality.

EL: Which is a really an inviting name.

KK: It’s a great name, right? It sounds like a video game or something. Yeah.

CB: Yeah. So, in the most general sense it asks, so the input is a finite list of square matrices of the same size. And the the the decision problem is whether a product of these things in some order, possibly with repetitions, could be ever zero or not. So, if an algorithm would say yes or no to each such collection. And I think at first this was shown to be undecidable for already 3 × 3 matrices in the 70s. And then there were some further developments as to because of course, if I give you one matrix, then matrix mortality becomes is this matrix nilpotent, and you can determine that by the characteristic polynomial, so that is decidable. So how few, how short can the list get and remain undecidable? I think for 3 × 3 matrices, it has been shown in 2014 or so that six 3 × 3 matrices, the problem is undecidable. So like A, B, C, D, E, F, F, that’s six 3 × 3 matrices. So that's like, what, like 54 entries of integers? These are all integer matrices, by the way.

KK: Okay. I was going to ask that.

CB: Snd then the question is, is some product ever zero or not? There can be no algorithm answering that for every possible input. And if you make the, if we allow the matrices to be a bit bigger, there is a version which says that when you make the size 15 × 15, it is undecidable for even two matrices. So just, like, two matrices of size 15, A and B, the decision problem, is ever a sequence of A's and B's equal to the zero matrix? And such an algorithm cannot exist, it's undecidable. It's rather striking.

EL: Yeah, I guess — I'm actually a little more upset about the six, 3 × 3 than the two 15 × 15’s. Because honestly, I just imagined trying to write down the entries of a 15 × 15 matrix, and I give up maybe 30% of the way through, I'll just, okay, whatever.

CB: Well, there is still a gap in knowledge. So let me talk a bit about what's known. For I think, two, 2 × 2 matrices, just two of them, it has been maybe recently shown that that is decidable. So but when the list is, when you have three or more matrices, I believe open. Also, I believe it's still open, whether if you're given, like, five, 3 × 3 or four the lowest boundary we know is six, although from from the development, you might — I would guess that it will remain undecidable for even two 3 × 3 matrices. But that's, I think, unknown at the moment.

KK: So once you show that it's undecidable for a certain, so for six, 3 × 3’s is undecidable, so that means it's undecidable for six of any size larger than 3 × 3, correct?

CB: Yeah.

KK: Because it sort of stabilizes, right? You can put those inside of the next size up by just sticking a one down on the lower corner with a block.

CB: Exactly, you can even you can even pad them by zeros, right?

KK: Sure. Sure.

CB: The mortality problem will not change once you've artificially made your 6 × 6 matrices into 10 × 10 matrices by writing zeros everywhere else.

KK: I see. So the question is for a fixed n, can you what's the minimal number k for which it's undecidable? Right?

CB: Yeah. So there are two parameters, how many matrices and the size of the matrices.

EL: But I guess there's a chance that it's three for 2 × 2 and two for everything else.

CB: Maybe. If I were to bet, I might bet that 2 × 2 is special and would be decidable always, and like the 3 × 3 introduces — but that's just a hunch. I don't really know much about how these things are done, because, like — I mean, I did look a bit to the into the two 2 × 2 matrices, and the algorithm is by computing some some eigenvalues or such, and I and 2 × 2 is so small that I would guess that is enough information somehow, but I don’t know.

KK: Now, I'm just thinking about this, right? This is sort of different from — so I would think of this in terms of the group generated by these matrices, but that's not at all what you're doing, right?

CB: Yeah, it's more like a monoid because it becomes zero. Also, I would like to, for people who know about the word problem, this this reminds people of the word problem for groups. And there is, of course, a relationship, but I would object to the argument that, “Oh, because the word problem is undecidable, that’s not so surprising.” And my objection is that we can always multiply the matrices. A specific instance is always decidable. We can just multiply them and see. For the word problem, there are even specific instances, which remain, like, is deciding whether a word is trivial can be made into a specific presentation and remain undecidable already there. It’s not like because you have maybe relations between the words, you don't know how to change your word into something. But with matrices, we can always, we can multiply like multiplications doable. But when you when we allow, is there ever zero among arbitrarily long multiplication that that is where the problem is. I think the word problem, the problem arises earlier than that.

KK: And that direct analogy with the word problem, you'd be looking for products where you get the identity, right, as opposed to zero. So I guess you don't want any of these matrices to be invertible. It's allowable, I imagine. But but if you have an invertible one, that’s not going to help.

CB: Yeah, I mean, the invertible ones, you can always — I guess, well…

KK: I don't know, though, maybe you need a permutation matrix to make some product work out correctly? I don't know. This is an interesting question. I like this question.

EL: Yeah.

KK: We’re not going to try to solve it on the spot.

CB: I’m not sure. Like, my first thought is that you can probably even, like, throw the invertible ones out. But now I'm not so sure. Maybe they might help in some way of arranging the zeros.

KK: So where did you come across this theorem? This is an interesting result.

CB: Yeah, well, undecidable problems always have fascinated me, and I guess I might have been looking at some of these, maybe it was, I don't know where I came across it. Maybe it was some survey paper of undecidable problems, or maybe a Math Overflow question. I'm not sure. But yeah, somewhere along those lines.

EL: But it's a nice one that's maybe a little more accessible to most people who have taken, you know, a few upper-level math classes than some of the undecidability things, which are just like, Okay, I need to climb this whole mountain to even understand this. You know, we all take linear algebra at some point, you know, if you're a math major or something, and so it's very concrete, you can immediately understand what it is if you’ve seen matrices.

CB: I agree. The description is rather elementary. You don't need to introduce Turing machines and halting arrays or some abstract presentations of groups and such. It's rather — the operations are ones that, as you said, any linear algebra student has seen before, but somehow the problem is already like, not even difficult, it's impossible in some sense.

EL: It is always really interesting to see, like, what are the limits, not just of our knowledge, but of what we can know about our possible knowledge.

KK: Right. Yeah. So the other thing we do on this podcast is we invite our guests to pair their theorem with something. So what pairs with this theorem that doesn't really have a name, but we'll call it the undecidability matrix theorem or something?

CB: Yeah, okay. So I'm not really a food person, so I didn't think of a food. What this — I would say that it pairs well with a decent table tennis service. Because it — there’s some, like, it’s not a killer service but decent, so you can have a decent back and forth, as we have just had, as to like, how small you can make it, how bad is it, that sort of thing. So that's what it reminds me of.

KK: Yeah. All right.

EL: Do you do you play table tennis?

CB: I like table tennis. I don't play as much as I would like to, but occasionally I do play it, and I like playing it.

KK: I’m much better on the Wii than I am in real life. The Wii table tennis is really fun.

CB: Ah, okay.

KK: In real life, not so much. I mean, I like it, but I'm not very good.

CB: I also heard people play on VR online. You can even like see a table.

KK: It’s not quite the same.

EL: I have not played since I was probably in sixth grade or something, when I think I was pretty capable of beating all of my opponents, who were my younger siblings. So, you know, at that age, you’ve kind of got just some advantage by being a little older. And so I tried to take advantage of that whenever I could, as the oldest sibling. You know, I really, we played two-on-one basketball sometimes, and I always kicked their butts at that because, you know, I was way taller. It helped a lot. I couldn't really play but like, against someone four or five years younger…

KK: My problem with all racket sports is that I played a lot of tennis when I was in high school. And so I play all racket sports like tennis. So you know, with big swings, so that doesn't work in table tennis. I's a much faster, yeah, just shorter.

CB: Much more of a wrist play than the whole arm.

KK: That’s right. Yeah. And racquetball is the same way. Like, I want the ball at my waist. I don't want to be reaching down to my ankles. I'm too tall. I can't get there. You know. So all these things were a challenge for me.

EL: Yeah, well, I do really like this pairing, because just like this theorem is sort of this meta- about, not just a specific case of matrices, but like, what we can know in general, given, you know, any set of information, your pairing was not just about the theorem, but was also about our discussion of the theorem.

CB: Yeah.

EL: So I think this was this was very elegant. I appreciate that.

CB: Thank you. I also like that we still have a gap in knowledge. I think that as, I don't know, like, teachers, we introduce — I remember being as a student, that that would really pique my interest, like, when teachers discover, you know, this is not known. And I think it offers a different landscape versus a completely furnished theory.

EL: Yeah, well, I know, when I was in college, I liked my math classes, but I didn't understand that math was still this active area of research. I was very naive about that kind of thing, and even now, you know, you've run into people who don't know what math research means. It's like, well, we know how to add and multiply numbers. We know how to do all of these things. Like, what else can there be to know? and this is something that doesn't take as much — you know, it's one of those examples that you can give.

CB: Right.

EL: You know, it has a lower, or, you know, a more basic way that you can enter this and like, understand, Oh, we're still trying to figure out this kind of thing. And so, I like that.

KK: Yeah.

CB: Also another thing I like, it's a bit upsetting that this is not decidable. I like those sorts of results. Actually, my account in Twitter has been referred to “the account that posts cursed math facts.” A lot of people say that, and that was not my intention, but it kind of fits with that.

EL: Yeah, well, that's very true because yeah, when I first saw it, I was just like, well, how can we not just, you know, just try all the ways to multiply it. At least in theory, you could do that, but not if it's arbitrarily long.

CB: Yeah.

EL: You're allowed to have as many as you like. Okay, if it was just one copy of each one, well, that's trivial. I mean, not trivial to actually do it, but it's trivial to know how to do it. But it's kind of funny that once you allow yourself multiple copies, it's just like, everything goes out the window.

CB: Yeah.

KK: All right. So you've already plugged your your popular Twitter account. We like to give our guests a chance to let us know where we might I find you online or anything else you're you're you're trying to promote or anything like that. It’s okay if you don’t.

CB: There’s my account. It’s called some theorems. So I think I can just put that in Twitter.

KK: Well for now.

CB: Yeah. I think I won’t add more to that.

KK: Okay. Well, Cihan, this has been great.

EL: Thanks so much for joining us.

CB: Yeah. Thank you for having me.

[outro]

On this episode, we were excited to talk with Cihan Bahran about the undecidability of the matrix mortality problem. Here are some related links you might enjoy:
Bahran's website and Twitter account, where he posts "cursed math facts"
The 2014 paper establishing the undecidability of the matrix mortality problem for, among other cases, six 3 × 3 matrices
The word problem in group theory

We recorded this episode before the devastating earthquake in Turkey and Syria. Our hearts go out to all who have been affected. If you would like to contribute to relief efforts, Doctors Without Bordersand Ahbap Derneği are two organizations doing work in the area.

Evelyn Lamb: Hello and welcome to My Favorite Theorem, the math podcasts with no quiz at the end. I'm your host Evelyn Lamb. I'm a freelance math and science writer in Salt Lake City, Utah. And this is your other host.

Kevin Knudson: I’m Kevin Knudson, professor of mathematics at the University of Florida. How's it going?

EL: All right. I got to take an overnight Amtrak trip last weekend, my first time, so that was pretty fun. Went from Salt Lake to Sacramento and got to see lots of beautiful Nevada and California landscapes on the way.

KK: Yeah, I did an overnight Amtrak once and it was less fun. It was from Jackson, Mississippi to Chicago. And — which, I mean, it's, you know, it's all night, right? So you don't really see anything. And it's remarkable how many times have to pull over for the freight trains, right?

EL: Yeah.

KK: This is how American rail is really different from European rail. You're at the mercy of all the freight, but that's okay. Anyway, yeah.

EL: I guess, today, living on the only portion of Amtrak's corridor for which they actually own the tracks, is our guest, Juliette Bruce. At least I hope I'm correct, that that's where you're living. Otherwise, that was a weird introduction. So please tell us a little bit about yourself.

Juliette Bruce: Thank you so much for the introduction. I'm Juliette Bruce, as you said, and I am a postdoc at Brown University. So in fact, I am in the northeast along the Acela Express corridor. In fact, I've never taken that Amtrak corridor, I've only taken the very slow ones that you were talking about, but I hope to take it soon.

EL: Yes. Find yourself someplace to go between New York, DC, Boston, I guess to Boston, you don't really need the Acela. It's already pretty close.

KK: You can walk to Boston.

EL: If you're really dedicated.

JB: It’s a pretty far walk.

EL: Yes. So I guess this isn't the train cast. This is a math podcast. So, so yeah. What are your mathematical interests at Brown?

JB: Yeah, so my area of math is kind of in the intersection of algebraic geometry and commutative algebra, which is all about studying the interaction between this algebra, coming from kind of the symbolic equations we get when we write down systems of polynomial equations, and the kind of geometry we can look at when we study the zero set of those equations. So we can look at the simultaneous solutions to the system of polynomials, and that's some lovely geometric object. And alternatively, we can look at these symbols we write on our paper, and somehow, in some point in math, we learned that we can do lovely things, like finding the roots of a quadratic polynomial by graphing them on our graphing calculator pictorially, or we learn we can use symbols and write down things like the quadratic formula, and magically they give the same answer. A lot of my research is sometimes a generalization of this fact that there's two different ways to study the solutions to a system of polynomial equations.

EL: Right. I must admit, I'm pretty naive about algebraic geometry, but there is this kind of magic in it, which is — you know, like, in, what, seventh or eighth grade or something, you start learning to graph the zeros of polynomials. Maybe you might not use that exact language for it, but you start to understand that you can intersect two different polynomial equations and find these intersection points and stuff like that. And yet, this is also like cutting edge math, you know, just add a few variables, or bump up the powers of the the numbers that you're using. And suddenly, this is stuff that, you know, people are getting PhDs in. I's kind of kind of cool,

KK: Right? Or work over a finite field, whatever those are. Yeah.

JB: I mean, I always find it fascinating with just how many different areas algebraic geometry has touched in mathematics and in the world. It seems to start from such a lovely and beautiful, simple idea that we learn in, you know, middle school or high school, and just kind of grows exponentially. And it turns out, it's actually a very deep idea that maybe we don't always appreciate when we first see it. I know I certainly did not.

EL: Yeah.

KK: All right.

EL: So then what is your favorite theorem?

JB: So my favorite theorem, or the theorem I want to talk about today, I know it as Petri’s theorem. I know some people know it as the Babbage-Enriques-Noether-Petri theorem. I'm not sure exactly on the correct attribution here, so I'll stick with Petri’s thereom and apologize to Babbage, Noether, and Enriques, who maybe want the appropriate attribution here. And this is a theorem from classical algebraic geometry, which means from the 19th century, and it's about understanding the interaction between thinking about systems of solutions of polynomial equations abstractly, and how we can realize that abstract solution set concretely as solutions to an honest-to-God set of polynomial equations that we could write down and describing what those polynomials might look like.

KK: Okay.

JB: And so the statement of the theorem, I'll state the theorem, and then we'll walk through it, maybe. And you can ask questions, because I know when it’s stated, it's a little bit of a mouthful and a little scary, is that if I have a curve that is non-hyperelliptic, and I embed it via the canonical embedding, then the image of the canonical embedding is cut out by quadratics unless the curve is trigonal, meaning it admits a three-to-one map to the Riemann sphere, or it's a curve in the plane of degree five. So that's the statement of the theorem. That's a mouthful, I know, to get through.

KK: Yeah, sure. Right.

EL: That’s interesting. So, you know, as I already confessed, this is outside of maybe my, my mathematical comfort zone a little bit. And how, how should I think about these exceptions? Like how exceptional are the exceptions? Is it, like, a lot of things? Or just a couple of little things that and otherwise, everything falls under this umbrella?

JB: Yeah, so that's a fabulous question. And so I gave — there are two exceptions to this theorem, right? If a curve admits a three-to-one map to Riemann sphere, so there's a map that goes to the Riemann sphere, that kind of every preimage has three points, it kind of looks like a sheet wrapped up three times around the sphere. Or it's a very specific curve in the plane of degree five. And so these exceptions, there's an infinite number of them. But it turns out if you think about them correctly, it's kind of a small proportion, or it's not most curves that will satisfy this. So this is somehow saying, with these few exceptions aside, we can actually understand the image of what's called the canonical bundle. So maybe I should say, what is actually going on here. It's something a little deep. So kind of the starting point of algebraic geometry is that we want — I said, we want to study the solution sets of polynomial equations. Well, it turns out that that's how the field started. But pretty quickly, people realized, well, this is some geometric space, it's a set of points. And instead of looking at the solution set to a particular set of polynomial equations, we can kind of abstract this away and forget the polynomial equations together and just think about what possible sets of solutions could I have, and think about that kind of abstractly in the ether. There's no polynomial in sight, we can just say, oh, you know, this is a solution set to some system of polynomial equations. We don't know which. And it's a lovely theorem that, you know, if we're talking about curves, it turns out algebraic geometers have this very weird convention that curves would look to people like us, like a two-dimensional surface. This is because I like to work over the complex numbers. So my polynomials have solutions and the complex plane is two-dimensional. So we have this weird terminology. So abstractly, a curve, if it's smooth and has to satisfy some other conditions, just looks like a closed surface, possibly with some holes in it. So we'd have a genus g surface. So if you've seen a doughnut, or a torus, that's just an algebraic curve of genus one. And if you seen a sphere, that's just an abstract algebraic curve of genus zero. And the beauty of these is that somehow, if we take these objects, we can realize them in space, we can put them into some large, complex space, or some large projective space, and once we've done that, you can ask, well, I know there is some set of polynomials that cut the space out, we have this algebraic variety. It's a system where we know it's by definition, a solution set to some polynomials. And you could ask what polynomials actually cut it out under this realization in space. And often, there are many different realizations. So for example, you could look at the parabola, a very simple example. We can look at the parabola, x2−y=0. This gives us the normal parabola going through the origin. It’s realized in space. But we can also abstractly think about just kind of the parabola floating around, no coordinate system at all. And we could also realize that same parabola in space by just, you know, shifting it up or down the y-axis and moving it around, and the polynomials that cut it out when I start moving it around, we learn, are different, right? We learn how to do transforms, we knew somehow, like (x−1)2−y=0 gives a different solution set, but it looks the same in the plane, just moved around. So you could ask, when I put my abstract curves in space, what are the polynomials that actually cut this thing out? And so those are kind of the input to the theorem, is these abstract curves. And we put them into space. And what are they cut out by? So that's kind of the input. And the theorem is answering that question, what are they cut out by? What are they defined by?

KK: Right. So are you assuming you're starting with a plane curve? Or?

JB: No, so this curve doesn't have to be in the plane, although it's kind of just this abstract notion of a curve, so it’s somehow, just in general, a kind of smooth looking surface that's compact and has g holes, so maybe like a 2-holed torus or a 3-holed torus. It's kind of some very weird donut-looking shapes, essentially, is what the curve goes in, what is the input of this theorem?

KK: Right. And you mentioned something called the canonical embedding. So that might require a little terminology.

JB: Exactly. So what do I mean by the canonical embedding? Defining it exactly is complicated. And it's not something I would want to try to do on this podcast.

EL: Especially with audio.

JB: Especially with audio. But instead, let me just kind of give this notion. I said, you know, if we're looking at perhaps standard parabolas in the plane, there's a lot of different ways we could put it in the plane. We could put it through the origin, we could put it so like the vertex is at (1,1) or (2,1), or we could do all these things, and there isn't, doesn't seem to necessarily be a natural best choice for how we put a parabola in the plane.

EL: Right. It feels very arbitrary.

JB: It’s very arbitrary. And when we change our arbitrary choice, we change the set of polynomials that define the parabola in the plane. It turns out that when we're kind of working in a slightly more abstract setting, where instead of looking at parabolas in the plane, but we're looking at these two-dimensional surfaces, which are what algebraic geometers will think of as curves, because we're looking at the complex set of points, there’s an almost canonical way to put them into some kind of space. And that's called the canonical embedding. It kind of arises by looking at ways you can kind of differentiate on your surface. It comes from looking at what are known as differentials on your surface. And I won't say anything more than that, other than to say somehow, it's this beautiful fact that was developed by people in the 19th century that there exists such a thing that allows you to transport these abstract curves into different spaces in a way that has beautiful properties. And somehow, it's a great tool for studying curves.

EL: Not quite sure if this is the right question asked, but you know, you have this input to this theorem, and then it tells you something about like, you know, what polynomials can be your solutions? How specific is it? Like, would it output something that, you know, we would have recognized as a polynomial in seventh grade? Or does it output something that maybe has a little more technical machinery behind it?

JB: This is an absolutely fantastic question. This is a fantastic question. So, right, as you're saying, the input is I input this abstract surface abstract Riemann surface of genus g that satisfies some properties and the output of the theorem and saying if it doesn't satisfy, if it doesn't fall into these two exceptional collections, which are relatively small when it comes to lists of exceptions, then we know that the defining equations are degree two. And you might ask, well, does the proof actually give — like what are the polynomials? Can you actually write them down? And in part, the version of Petri’s theorem I know, in fact, gives you those polynomials in some sense. There are some choices that have to be made, and those choices kind of arise from some technicalities about defining exactly what is the canonical embedding. There are some choices there. But once you've made those choices, Petri’s theorem actually comes down and says we can write down an honest set of degree two polynomials in a lot of variables now. The number of variables is the number of holes on my surface, is the genus of my surface. So it's a lot of variables. But we can write down an honest set of equations that cut this out. And this is this beautiful thing that takes an extremely abstract thing, you know, this curve that's abstract sitting in our mind, and realize it in space, and it outputs a list of polynomial equations.

EL: Okay, wow.

KK: So okay, so now I'm thinking about elliptic curves in particular. So you mentioned there's just one variable. So that's a torus. Right? You can you can actually write this with one variable?

JB: Yes. Yeah. So if you're looking at elliptic curves,

KK: But I always think of elliptic curves as being, like, y2=x3 plus some change, right? That's not degree two, is it?

JB: That’s not degree two. Right. And you're calling me on a on a little technical point that I swept away in the beginning, which is that I said — when I said theorems carefully, I said that if our curve is non-hyperelliptic, right, and it happens, that elliptic curves will kind of not be in a case where the canonical embedding is, in fact, an embedding. Somehow you can talk about what that map might be, and for an elliptic curve, that map would take your elliptic curve and map it all to a single point.

KK: Yeah, that's a bummer.

JB: And that's a bummer. So sadly, elliptic curves, it doesn't quite work. So it is this interesting issue where if we're looking at abstract curves of small genus, so like elliptic curves are doughnuts of genus one, so there's one hole, or if we're looking at curves of genus two, so there's donuts with two holes, this theorem doesn't really apply, because those curves are extra special. And in fact, that's some of the beauty of things like elliptic curves. But once we're looking at more higher genuses, like genus three or four, and so on, you start to see very interesting things. So for example, if you take a genus three curve, and it satisfies this property being non-hyperelliptic, whatever that means, you can realize this curve in the projective plane, which is kind of a three-dimensional object cut out by some polynomials of degree four.

KK: So I mean, is this this love at first sight? Like, did you, you know, as a student read this in, is this in Hartshorne somewhere, or is it somewhere else and just fall in love?

JB: Yeah, so this is a great question. And it's actually as far as I'm aware of, not in Hartshorne, which is kind of a weird thing, because Hartshorne is notoriously quite comprehensive.

KK: Sure.

JB: But all the players are in Hartshorne. And in fact, the lead-up to kind of this theorem is in Hartshorne. And so the build up to this is to get to this theorem, you spend a lot of time in this fairly hard textbook, and you get to the end, and all of a sudden, they say, let's look at curves. And you think, wow, that's pretty simple. I've spent a year and a half, two years of my life learning all this complicated machinery and now you're going to tell me we're doing the simplest case. And you start looking at them and you see these beautiful things where all of a sudden, you built this machinery that lets you compute these equations in specific cases, so say small genus. And later on, you can read this amazing theorem of Petri and see that there's actually a full argument there, of how you can write down these polynomials, and it's kind of this beautiful synergy of all the things you learned coming together in one.

EL: I mean, I guess you've kind of answered this a little already, but what do you think draws you to this theorem so much that makes you love it?

JB: Yeah. So what draws me to this theorem, I think, is a number of different things. So (a) is this beautiful combination, or culmination, of learning so much, so many of these kind of complicated tools that don't seem closely related to the spirit of algebraic geometry, which is again, studying polynomial equations and their solution sets. But also, its has this amazingly surprising thing, which is that somehow if I take this abstract curve, and I take some realization of it in space and I ask for the equations that cut it out, those equations should really depend on how I put it into space. You know, if I put them into space a different way, I'll get different equations. And what this theorem is saying is that since these exceptions to this theorem don't depend on how I put it into space, those things only depend on the actual curve itself in its abstract form, that somehow, there's this beautiful thing that sometimes when you put things into space in the correct way, and you look at their defining equation, that's telling you something very, very special about not just that particular realization of your curve, but kind of the abstract, ethereal curve that lives kind of off in our imagination.

KK: So part two, we like our guests to pair their theorem with something. So what pairs well with Petri’s theorem?

JB: Yeah, so the thing that I thought of when I was thinking what pairs well with Petri’s theorem, is I was thinking about how, when I first started to see the, you know, glimpses of this theorem, it was Chapter Four of Hartshorne, so partway through this huge book that I had spent, you know, multiple years trying to get to that point. And all of a sudden, you get there and you see this beautiful vista of mathematics, these beautiful examples, that use all the tools you’ve got, and there was no easier path there. And it made me think of another one of my favorite hobbies, which is mountain climbing, or mountaineering. And how, you know, oftentimes you have to slog through these very tedious, long, hard, difficult and exhausting things, exhausting work, not always the most enjoyable — sometimes you're tired, sometimes your legs hurt, sometimes you're just kind of looking around and saying, wow, this is kind of a dusty desert, this isn't very pretty. But all of a sudden, if you put in that work, you get to this vista, and you see kind of the beauty of the world around you. And to me you get to this theorem, and you see the beauty of algebraic geometry, and kind of the essence of why you did what you did why you put in that work.

EL: Yeah, so what are some of your favorite vistas or mountains that you've gotten to climb?

JB: Yeah, that's a great question. So I have lived in California with my partner for a while and so a lot of the things I've liked to climb and do are kind of in the Sierra Nevada range or the Cascades, and not all of these ones I've actually fully summited, but I think things like looking off from Mount Shasta in Northern California has a beautiful view where you see the changing from how it's beautiful green forest around the mountain where it's snowy to this dry browner desert as you move off into kind of Northern California. There's some beautiful vistas out near Lake Tahoe and you kind of climb these peaks and get to the top and all of a sudden you can see this absolutely gorgeous lake spread out in this beautiful forest with peaks kind of circling it as a rim.

EL: That does sound amazing. As you can see, but our listeners can I've got my Zoom background is from a hike I did recently where — I must say this hike is basically beautiful the entire time. So there, there wasn't so much slogging, but you know, it was covered in aspens and the evergreens and things and just, you know, you do sometimes come around this curve, and suddenly you can see the Salt Lake valley, below where before it had just been trees, and there is something really special about that.

KK: Yeah, absolutely. I'm an East Coast kid. So Appalachians, which is still of course very beautiful, but different vibes. All right. So we'd like to give our guests a chance to plug anything they're doing where can we find you on on the intertubes?

JB: That’s a great question. I guess I would say I have a professional website. Google my name, you'll find it. Of course I’m also on Twitter for who knows how long.

EL: Limited time offer.

JB: A limited time offer, potentially, also under my name. And you know, otherwise I'm happy to respond to emails or things like that. And I'll just plug as a final thing, you can't reach me this way, but I am the president of Spectra, the association for LGBTQ+ mathematicians. So I'm also very heavily involved and happy to talk, and, you know, look at that sort of work. So if you're interested in LGBTQ+ mathematicians, I'd plug looking up Spectra and the work we've been doing there.

EL: Yeah. And did they just kind of recently, sort of — I got the feeling maybe it was a little more of an amorphous organization, and now it's sort of coalescing into something that has has a little more structure. I've tried to make an algebraic geometry analogy here and it’s just not working. But yeah, this is relatively recent, right? So are you the first president of Spectra?

JB: Yeah, so that's absolutely right. Spectra has kind of a long and amorphous history, coming from kind of a lot of grass roots activism in the ‘90s, through the 2000s. And it's existed in some form, at least with a website for, you know, a number of years. But in the last few years, we've really been trying to grow and formalize and expand our reach and the ability of support we're able to give LGBTQ+ mathematicians. Part of this includes kind of creating a formal board structure, and we did that over a number of years, going to effect this last year, and I was lucky enough to be chosen by the previous board members to be the inaugural president for this year. So I've been lucky to kind of take the reins and guide the organization through its first kind of formal year this year, although building upon all the amazing work a number of extremely dedicated and thoughtful people have done many years previously.

EL: Yeah, and I think it really has been maybe a lifeline, or really as a place that, you know — young LGBTQ mathematicians have maybe sometimes felt isolated where they are, and able to be like, is there anyone else like me? And, like, of course, there are a lot of people like you. And it's been a place that people can find, and I think that's really special.

JB: Yeah, that's exactly the goal. One of the goals we have is trying to make sure people see other visible LGBTQ mathematicians and see people they might be able to aspire to and reach out to or seek advice from or support from. So that's been one of our goals of formalizing and trying to increase our presence.

EL: Well, that's great. Yeah, check out Spectra. And yeah, send Juliette an email, you know, about anything related to that.

KK: Or algebraic geometry, or mountaineering.

JB: Or mountaineering. Yeah.

KK: All right. Well, this has been great fun. Thanks for joining us, Juliette.

JB: Yeah, thank you so much for having me. It's been a pleasure. I've really enjoyed listening to your podcast prior to this. So I really appreciate the opportunity to tell you some hopefully coherent words about my favorite theorem.

EL: Yes, thank you. I just love all the different perspectives we get by talking with so many different people here.

KK: Yeah, that's the best part. All right. Take care.

[outro]

On this episode, we were happy to talk with Juliette Bruce, a mathematician at Brown University, about Petri's theorem. Here are some links you might enjoy as you listen to the episode.
Her website and Twitter profile
The canonical bundle and Petri's theorem on Wikipedia
Robin Hartshorne's (in)famous Algebraic Geometry textbook
Spectra, the association for LGBTQ+ mathematicians

Kevin Knudson: Welcome to My Favorite Theorem, the math podcast with no quiz at the end. I'm Kevin Knudson, professor of mathematics at the University of Florida and I am joined as always by my fabulous other host, co-host? I don't know,

Evelyn Lamb: Co-host. It’s a host but going in the opposite direction.

KK: That’s right. We reverse the arrows. Haha, math joke.

EL: Yes, I'm Evelyn Lamb, a freelance math and science writer in Salt Lake City, Utah. Actually just got back to Salt Lake from a wonderful trip this past week where I got to meet two new additions to my family, ages three months and three weeks. So that was, that was pretty fun, to hold one of the tiniest babies I've ever held. So yeah, very nice little fall trip to take. And now I'm back here and talking about math.

KK: Yeah, well, last Friday night, I drove two hours over to Ponte Vedra, which is sort of near Jacksonville, by myself to a concert. So this is where I am in life. So I went to see Bob Mould, who many people may or may not know, but he was — Yeah, Christopher's shaking his head yeah. He was at Hüsker Dü and then Sugar. He's been doing solo albums forever. And I've been a fan for going on 40 years, which is also weird to say. Had a great time, though. By myself, that's great. This is what one does in his 50s I suppose. Anyway, not as exciting as holding a newborn but, but still pretty good. So anyway, hey, let's talk math. So today, we are pleased to welcome Christopher Danielson to the show. Why don’t you tell us about yourself.

Christopher Danielson: Yeah, I am coming to you from St. Paul, Minnesota.

KK: Nice.

CD: Bob Mould, also a fellow Minnesotan. [Ed. note: Bob Mould is actually from upstate New York.]

KK: He went to McAllister, right. Yeah.

CD: Nice. Right up the street from where I'm standing right now. I work a day job at Desmos Classroom, which is now part of Amplify, designing — working with a number of colleagues to design math curricula. We are currently working on an Algebra I curriculum, about to wrap that up, and moving on to Geometry. And then on the side, I have many projects, some of which will come up in our work today. But I think I understand that you two are familiar with the Talking Math With Your Kids blog that grew into then a large-scale playful annual family math event at the Minnesota State Fair called Math on a Stick.

KK: Cool.

CD: And I also am Executive Director at a small nonprofit that seeks to create playful, informal math experiences for children and families in the same spirit as the work we do at Math on a Stick, but designed for a variety of other sorts of spaces. That nonprofit is called Public Math.

KK: Very cool.

EL: So I'm probably doing that thing where I generalize from a small number of examples. One of my best friends in grad school was from Minnesota, and just loved the State Fair. So I think that Minnesotans just have it this special relationship with the State Fair. And so I did — I am really interested in hearing more about how you do Math on a Stick at the Minnesota State Fair.

CD: Yeah. Should I pick that up right now? Or is there more on the agenda?

EL: Yeah, that would be great!

KK: No, go ahead.

CD: Yeah, so the Minnesota State Fair, it's the second largest state fair in the country behind only of course, Texas.

EL: Where I am from.

CD: Oh, nice. Texas lasts for a month. Ours is 12 days. 12 days of fun ending Labor Day is one of the mottos. The other is the great Minnesota get-together. The location of the fairgrounds is especially convenient for large attendance. The fairgrounds are right, sort of on the border between Minneapolis and St. Paul. And they have been, for probably the past 20 years, have been working on developing some educational and family friendly spaces, out of a perception that it is expensive to go to the fair, which is true, but then once you're in that there isn't much to do besides look at animals and buy a bunch of food.

EL: On a stick.

CD: Yeah, on a stick. So they’ve been working on that. And that led to a lovely literacy space called the alphabet forest that is about 12 years old now. And the first time I sat down there, it was their fifth year and was like the sky, the clouds parted and the angels sang, and I was like, I’ve got to figure out how to build a math version of this. And so together with some organizational support from the Minnesota Council of Teachers of Mathematics and a bunch of expertise from folks that I know through the blog work and through my work in math education, put together a pitch, and after many very boring meetings, it became a thing. So we've got about 15 to 20, different mathematical, playful, creative math activities, everything from a big table full of tiling turtles, to a set of numbered stepping stones that you just see kids jumping up and down happily counting, counting by twos, creating all sorts of fun things to do with. We have a different visiting mathematician or mathematical artist every day, each of the 12 days and they bring whatever sort of hands-on thing they're into. Sometimes that's sort of the standard stuff with, like, Mobius strips and hexaflexagons, and sometimes it is new and new and delightful, creative things that the world has never seen before. So yeah, Math on a Stick, come on out and play with us. 12 days of fun ending Labor Day, always starts on a Thursday, runs through a full week, two weekends and then ends on Monday.

EL: Yeah, that does sound like a neat thing. Sometimes I go to the farmers market here or something like that, and I just think, like, where are there opportunities to kind of create, like you said, these playful, you know, a non-classroom math experience for people?

CD: Yeah, my, one of my Public Math colleagues has a project called Math Anywhere, Molly Daley. She's in Vancouver, Washington, and also does some stuff across the river in Portland, Oregon. And farmers markets are one of the more successful spaces for her. So she'll pay for, for a booth, she has grant money, she'll pay for a booth and just set up a much smaller version of Math on a Stick stuff, as well as some other stuff that she's designed or harvested from other places, but three or four activities, and yeah, delightful times ensue. However, I had a recent experience at the Mall of America, largest shopping complex, also here in the Twin Cities. And it was really interesting, because the way that kids’ families move through the Mall of America is wildly different from how they move through the state fair. So just an invitation to a big STEM/STEAM carnival. And we brought some — one of our favorite things is called a pattern machine or punchy buttons, a nine by nine grid of punchy buttons that you can drop pictures on. And each button is clicky and on a ballpoint pen. So we bought a bunch of those. And then we also had the mega pattern machine, which is just thousands of buttons from all these machines smashed together to make a nice big floor space. But the way that kids come into Math on a Stick is that there’s, like, this long elastic band between parents and children at the fair, not in the super crowded spaces in the fair, but in the less crowded spaces. And so often kids will see those stepping stones that, by the way, start at zero, and then continue on to 23. Yeah, so they'll start on the zero, and they'll lead the way into the space, like we deliberately set up those stepping stones to that the edge of this outdoor space. And by the time kids get to 23, now they're surrounded by eggs that they can put into — little plastic eggs they can put into large egg crates, and tiling turtles and pattern machines and all sorts of fun things to do. And families will sort of follow along behind. At the mall, there’s none of that. There's none of that. Families move in really tight units. There's no, like ,a child leading the family into a space, which is just a really interesting dynamic. And having been out in Portland a couple of weeks ago with Molly when she was at one of the farmers markets, it felt very much more like the fair. A mom or a dad might be much more likely to say, okay, sweetie, you keep playing with these turtles, I'm going to hop over there and buy some apples and I’ll be back in two minutes. They kind of keep their eye on them and everything, but that that elastic band is much longer. Nobody ever says, okay, sweetie, you know, their four year old, I'm going to I'm going to just hop across to, you know, the department store over here, you keep playing with something in the hallway. So Public Math is our project where we're trying to think about how do you design for those kinds of spaces? What would have been a better design than the one we had for something like them our time at the Mall of America?

EL: Yeah. Interesting different kinds of math problems to solve. Different optimization.

KK: That’s right. Yeah. All right. So this podcast does have a name, though. So presumably, you have a favorite theorem. So you want to tell us what it is?

CD: I do! And it is — Yeah, my favorite theorem is, I'll state it simply. And then I guess we get to talk about like, why it’s my favorite and things?

KK: Yeah, sure.

EL: Yeah.

CD: It doesn't have a name. I feel like maybe, maybe it should have — maybe it has a name. Maybe you'll know a name for well,

EL: We’ll brainstorm about it.

CD: But yeah, let me state it simply, which is that the vertices in a polygon are in one to one correspondence with the sides of the polygon. So for example, the three-sided polygon has three vertices. Is there a name for this?

EL: So, yeah, well…

CD: The polygon theorem or something?

EL: I don't know. Yeah, that’s

KK: I mean, a polygon is just a cyclic graph. There must be some graph theory name or something.

EL: I kind of you know, this has a little bit of an interesting linguistic thing, right? Because we call polygons a little bit differently at different sizes, like we call it we talk about triangles not trigons, or trilaterals. When we talk about quadrilaterals, like I think I have heard quadrangle, that must be the tipping point. Then we get to pentagon, so I guess that's not lateral or angle.

KK: That’s just gon. Then it’s gon after five.

CD: But gons are angles. So you are counting —

EL: Okay, is that the Greek word for for angle, and angle is Latin?

CD: So goniometer is the is the thing that you can use to measure your range of motion. I'm gesturing, so that's great on a podcast.

KK: We do it all the time.

CD: Like in your arm or knee? Yeah. So yeah, gon is angle.

EL: Okay. Learn something new.

CD: So it's only the quadrilaterals whose sides you count. Everything else, you count the angles. And, by the way, we also have elided the fact that the vertices and the angles themselves are in one to one correspondence, right? That’s also, maybe a corollary perhaps.

EL: Yeah. Okay. So maybe I'm playing devil's advocate a little bit here. But why is it a theorem that the angles and sides are in one to one correspondence? Why is it not obvious, other than the fact that, like, I've experienced these shapes my entire life and have never experienced one that did not have this property?

CD: Yeah! So I learned that this was a theorem, and its necessity, by working with five-year-olds. So I wrote a book called Which One Doesn't Belong, which was an adaptation, both of the Sesame Street routine, but also playing on some of the routines that I had seen other people playing around with. But for me, the thing that was novel about which one doesn't belong, was that when my children were small, all the shapes books that they had an opportunity to encounter were wildly simplistic. There would be, you know, a triangle page, and then there'd be a square page, and then a rectangle page, and never a square, never a square on the rectangle page. That's confusing for kids. And all of the triangles would be equilateral and oriented on one of their sides, all the hexagons were regular, and again, sitting by their sides, or maybe if they're feeling a little wild, straight up and down balanced on a vertex. But orientation isn't a thing, like, there's all this work that we know is important to come to understand a mathematical idea that just doesn't get doesn't happen in books that get published for young children, even though if you've ever been around four or five or six year old children, they can think about complex relationships, they can think about complex ideas. But somehow we don't understand or value that when we're creating books for kids. So Which One Doesn't Belong was my way of producing, taking ideas that other people had had and condensing them down into what I thought of as a shapes book that was more worthy of children's minds.

EL: I just want to insert that it is a really fun book. I don't remember when or how I obtained a copy. But I have enjoyed going through it myself, and I probably should have asked permission, but I actually used it as an inspiration for one of the pages in this page-a-day calendar I put together a couple of years ago, where I made just one where, you know, it's a bunch of shapes that all have slightly different properties, and you know, you decide which one doesn't belong.

CD: By the way, I’ll give you a little tip before explaining again, why this theorem is important. If you ever try to design a “which one doesn't belong” set, what you want to do is think about whatever your domain is, so say it's shapes, you want to think about four properties of shapes, and then cover up the first one, and design one that has these three, but doesn't have the first one. And then cover up the next one, design one that has those three, but doesn't have this one. And by the time you're done, you'll either realize that your set of four properties is more intertwined than you had originally thought, and now you’ve got to go back and revise, or you'll have a set where you know for sure that there's at least one reason for each not to belong. But then extra, an important key to this is that you have to be open to the possibility that some kid will see a reason for a shape to not belong that wasn't the reason you'd intended. Right?

EL: Yeah.

CD: this isn't a game of “guess which of the four is right.” But it's also not a game of “guess what was in my head when I designed the set.” Instead, we want to offer up something that we know is rich, and then be open to learning from the kids. So I made this book. I was trying to shop it around to get it published, but also needed to, you know, test drive it with children. So I went on what I called my Twin Cities shapes tour. And visited, I think it was three different elementary schools per week for four or five weeks. So I got into just a ton of different situations, worked with kids, kindergarteners, through, like, fourth graders, all in classrooms, like 20 minute bits, and we just had a ball. And frequently, I would hear from kids, like, one kid would say, you know, that shape doesn't belong because it has three sides and the others have four. The opening page of the book is a triangle, and then there are three rhombuses of various types and orientations. So a kid would say that one doesn't belong, because it has the wrong number of sides, right? It has three sides, the others have four. And then somebody else would talk about some other shape. And then another kid would say that one doesn't belong, because it has three corners, and the others have four corners. And in my mind, the first, like, 12 times I heard this from children, I thought to myself, yeah, you're not listening. Some other kid just said that. Didn't say it out loud, kept it to myself. But it was after about the 12th time that I heard it that I said, “Wait a minute. Wait a minute, you heard you heard when this kid over here said said different number of sides?” And they'd be like, “Yeah, and I said different number of angles.” And so it was at that point that I realized that — they’re kindergarteners, right? They haven’t — I know that they haven't seen any good shapes books, right? So they haven't had the opportunity to consider the relationship between the number of sides and the number of angles. And in my adult mind, I had this idea that it was obvious, which is so true of mathematics, like always, right? That if there's something that we ourselves have internalized and experienced for a large number of years, even if it was hard for us to learn at the beginning, we've probably forgotten about that.

KK: Right.

EL: Yeah.

CD: So yes, that's our that's our theorem. And that's why it's important. It's the thing that you actually do have to learn, it isn't obvious when you're first exploring these mathematical objects. I imagine that's true for those who are studying combinatorics. So we were talking about graph theory earlier. Lots of results that feel obvious in retrospect, because you use them all the time, so much that they're sort of internalized, and you don't even think about them anymore. But there is some some point where that thing had to be learned.

KK: So I'm sitting here trying to think of a proof of this theorem. And of course, the dumbest one that just popped in my head is to use the Euler characteristic.

EL: Is that what the five- and six-year-olds do?

KK: I love using sledgehammers to drive nails! Okay, so all right, this is a theorem; it must have a proof. So let's, let's construct one that doesn’t require Euler characteristic.

CD: Yeah, well, I feel like I would start with a line segment that a line segment has two vertices, right? And then every time — so then now I'm going to add another line segment to get what I remember formally being a polygonal curve, right, made up of straight line segments. And when I add another line segment, now I add a segment and a vertex. So I’m always going to have an extra vertex. Until such time that I come back around.

EL: Yeah, and you add a segment and no vertices.

KK: This is exactly the Euler characteristic proof, just in reverse.

EL: Yeah, it's funny, because my mind actually, I think, basically was the dual of what you said, where I swapped out, so instead of that, I was thinking, when you start with an angle, you've got two line segments, and the vertex, and then I was actually kind of thinking, like, the number of angles you have, they each have two segments, but to connect them, you overlap the two. So you divide by two.

KK: Right, so the number of angles is the number of lines.

EL: Yeah, Little, it may be maybe slightly different, but similar sort of idea.

Yeah. Okay. So it's interesting that children see this as two different facts. Children are more literal, right? I mean, in my experience, one of my favorite stories about my son was we were at open house for eighth grade. And he walks in and his soon-to-be math teacher says, “Do you know what eight times seven is?” And he said, “Yes.” Right?

EL: Yeah.

KK: I mean, she was expecting him to say 56. But children will just give you the most literal answer that you can ever imagine. Yeah. So, okay, well, we usually ask if this is a love at first sight sort of theorem. But I don't know. Maybe that's not the right question here. Although maybe it was for you. I don't know.

CD: Well love at first noticing, right?

EL: Yeah.

CD: For me, the noticing that this thing that I had interpreted as being — these two statements that I interpreted as just being equivalent and repetitious of each other, noticing that that was a thing that required learning, and that these kids were absolutely listening to each other. And it gives me an opportunity as a teacher, right? I'm only in there for 20 minutes or so, but it gives me an opportunity to say, “Wait a minute, is that gonna always be true?” The generality is that this one had three sides and three corners? And these all have four and four. Is that always true? Can we imagine a polygon that has some different number of sides and corners?

EL: And what do kids conclude about that? Or do they have, like, ways that they reason about why they have to be the same? Or do they develop pathological shapes that don't have this property?

CD: Yeah, I haven't had time to dig into that in in depth with a group of students. I've had a lot of sort of related experiences. But yeah, I don't know. That would be super fun to to step in. Posed as an offhand question, kids absolutely will both think that it is probably, be willing to believe that it is true, and there will also be kids who will imagine that maybe there is some shape that they just haven't had a chance to meet yet that isn’t. Of course what that investigation with kindergarteners, that's going to get you into a lot of a lot of really interesting kinds of conversations, because they don't have polygon yet as a defined category of mathematical objects. So we're going to have to start to think about whether a circle is a polygon or whether curvy sides count as sides.

EL: Or if you’ve got, like, a square with a handle on it that's just a line segment, what’s that?

KK: Very cool.

CD: But yeah, that kind of, you know, monster creation, from Lakatos’s Proofs and Refutations, that kind of potential counterexample, and then dealing with whether the counterexample is really a counterexample, that kind of stuff goes on at all levels of mathematics, for sure.

EL: All right. I like this. It is not a theorem I have thought about as a theorem ever in my entire life.

KK: Right. Well, I think I see why you love it. Because it actually it's more of a meta-result than the actual theorem. The theorem itself is less important than kind of the questions that it can trigger. And to get kids thinking about things in an interesting way.

CD: But it’s definitely not a Postulate. Like if we're in Euclid, it’s not a postulate, nor an axiom.

KK: No, it isn't. It’s a theorem.

CD: And there are certainly lots of results about triangles in which we know there are three sides, and so there are also three angles, because it was a triangle. Yeah. So if you don't have it, if you get rid of it — like, we can say it's not important, but if you get rid of it, there's a lot of geometry you're not going to be able to do.

KK: Oh, okay. So right. So now instead of non-Euclidean, we might have sort of non-polygonal geometry. So we don't insist that our polygons have the equal numbers of sides and corners.

CD: Yeah, I was just imagining a world in which the theorem is an undecided result, or that we can’t count on. So anything, any place that we assume it, we've got to work around it or prove it again.

EL: Or we can only use theorems about angles.

KK: All right. So the other part of this podcast is we ask our guests to pair their favorite theorem with something. So what pairs well with this?

CD: I have two pairings.

KK: Okay, good. Good.

CD: I don’t know if that counts.

EL: Yes.

CD: Or we need a new word for a pairing.

EL: Yeah. No, that's great.

CD: Yeah. So I'm going to pair it first with a claim and then with an admonition. The admonition is related to what we've already been discussing. But the claim is, it's going to be controversial here, I imagine claim is that a diamond is a shape.

EL: Okay.

KK: A 2-d diamond or a 3-d diamond?

CD: Oh, yeah. So I'm still in plane geometry. Surely there is some corollary for 3-d geometry. But yeah, I got my start in math education teaching seventh and eighth grade. And I used to, when I was a seventh and eighth grade teacher, mid 90s, I was in a camp that is still still very active in which if a child says diamond, I say again, “No, no sweetie, rhombus, you mean rhombus.” Like we call it, we're sophisticated mathematicians, we don't use the word diamond. But again, through working with the kindergarten kids, I came to understand that they don’t — like, diamond and rhombus are absolutely not the same thing to them. So if we treat mathematics as a human construction, right, then the mathematical ideas that a five-year-old has are worth testing and exploring. And one of those ideas that they have is that orientation of the shapes matters, right?

EL: Yeah, I was wondering.

CD: A square standing on its corner is a diamond, a rhombus standing on a vertex is a diamond. But also, if you cut the top off that rhombus, you now have a pentagon. Still a diamond. It's got a vertical line of symmetry, still a diamond.

EL: Right, right.

CD: So not only is there not a correspondence, because rhombus is a thing that doesn't depend on orientation while diamond does, but also that not every diamond has to have four sides in the way that a rhombus does. They don't have to be equal sides. You can you can stretch it. So you've got short sides and long sides.

EL: Yeah, I was wondering if a kite is a diamond.

CD: Yeah, absolutely. Kites are diamonds. And so the thing that I would be very excited about would be a world in which instead of we as math teachers saying, “No, no, sweetie, that's not diamond, you mean rhombus. Diamond isn't the word we use, it doesn't really count.” That it instead be a place where we press on that in all the ways that we press on mathematical ideas and try to get at definitions. Right? So now we're going to make a whole bunch of different examples. Draw me a diamond that looks different from anybody else's diamond. And we create this category. And so I think the best understanding I have of a definition of diamond that would satisfy most kindergarteners, it’s something that has to have a vertical line of symmetry. And it has to be convex. So darts are not diamonds. And somewhere between four and probably, like, eight sides. Triangles are never diamonds. Never, never, never. But four or five.

EL: And it has to have a vertex on the bottom.

CD: Yes, a vertical line symmetry that goes through the vertex at the bottom.

EL: Oh, yeah.

KK: Yep.

CD: Okay, excellent. So that's my claim: a diamond has a shape and therefore worthy of investigation rather than of dismissal.

EL: I’ll buy that.

KK: The admonition?

CD: Sure. The admonition is stop showing children only the special case.

KK: I seem to remember a Twitter like, like you were…

CD: I started yelling at a publisher

KK: You were you were hot about this on Twitter.

CD: Yes. Okay. It’s a really interesting — I think the thing you're remembering was actually almost the reverse, which is something I alluded to earlier, the thing that there's never a square on the rectangle page. So I went to a public library, doing some research on children's books for some work that I'm doing and happened — of course, was in the shape section and happened to see this book about rectangles. Like literally its title is Rectangles. This is a book all about rectangles, it has no other purpose. And I pick it up and just, like, want there to be a witness to this — but of course, there wasn’t — of my predicting, there's not going to be a single square in this in this rectangle book. And I flip through the pages and of course there isn't. So it's just one of these small sort of regional publishers that publishes educational titles for libraries and school libraries and whatnot.

KK: Right.

CD: But I DM them on Twitter to say, hey, maybe we could liven this up a little bit. And they said, Well, no, according to state standards, you know, we're responding to state standards, blah, blah, blah.

EL: Oh no.

CD: I was like, Oh, that's really interesting. I'd love to see the standard that says that you can't say a square is a rectangle. What they came back with was a Texas standard at kindergarten that says at kindergarten, you are supposed to be studying special examples of shapes such as squares being special rectangles. And this publisher was publishing a book for four-year-olds. And so because it was a pre-K title, they couldn't put the kindergarten standard in. It wouldn’t be well-aligned.

KK: Don’t let them get ahead.

EL: Yeah, it would be too advanced to know that a square is a rectangle.

CD: And we have this idea that we can't provide, again, we can't provide complex ideas. We can't give kids interesting things to think about, or conundrums or puzzles. So yeah, admonition isn't quite that, right? My admonition is stop showing them only the special case, but also please, let's show them the special case and help them integrate the special case with the general one. But yeah, all the shapes books with the triangles that are on their bases. And yeah, you know, it's like if we were teaching kids about even numbers and the only even number we showed them was 2, end of story. It seems like maybe we need a little more.

EL: I’m kind of wondering, you know, if, like, guerrilla math person with like square stickers, like going into all the shapes books, putting them in the rectangle pages…

CD: That would be a fabulous public math project.

KK: It really would. That's good. All right. So we like to give our guests a chance to plug themselves and things they're doing. Where can we find you on the line? Where can we purchase your wares? You have excellent wares for sale.

CD: Yeah, thank you. So Talking Math With Your Kids is the blog and also the online store where tiling turtles and pentagons, hexagon puzzles for small children that have widely varying examples of hexagons, are all available there. The Twitter feed is trianglemancsd. Unfortunately, triangleman was already taken by the time I got to Twitter like 12 years ago, and so I had to tack my initials CSD Christopher Scott Danielson.

KK: But not by They Might Be Giants. So who took triangleman?

CD: Yeah, I don't know, some guy who never uses it. I think he lives in Florida. Never tweets.

KK: Sure.

CD: And yeah, by all rights, it should have been turned over to me long ago. But yes, the Twitter handle is in honor of both They Might Be Giants and my love of shapes and geometry. Okay. So that's the Twitter feed. Yeah, and public-math.org for some of the projects, we're up to over there, but you can get to it all through the through the Twitter.

KK: Okay.

EL: Yeah, thanks.

KK: Excellent. Thanks for joining us and for making us think about the fact that it's a theorem. That's, yeah, that's useful.

CD: Truly a pleasure. Thanks for having me on.

[outro]

On this episode, we had the pleasure of talking with Christopher Danielson, who works for Desmos and is involved with several programs to help kids have rich, creative mathematical experiences. Here are a few links you might find useful after you listen.
Danielson's Twitter account
Talking Math With Your Kids
Math on a Stick
Public Math
Math Anywhere
Evelyn's Page-a-Day math calendar, which takes inspiration for August 8's page from Danielson's book Which One Doesn't Belong?

Evelyn Lamb: Hello and welcome to My Favorite Theorem, the math podcast with no quiz at the end. My name is Evelyn Lamb. I'm a freelance math and science writer in beautiful Salt Lake City, Utah, where fall is just gorgeous and everyone who's on this recording, which means no one listening to it, gets to see this cute zoom background I have from this fall hike I did recently with this mountain goat, like, posing for me in the back. It kind of looks like a bodybuilder, honestly, like really beefy. But yeah, super cute mountain goat. So yeah, that really helpful for everyone at home. Here is our other host.

Kevin Knudson: I’m Kevin Knudson, a professor of mathematics at the University of Florida on the internet, they would call him an absolute unit, right?

EL: Definitely. At least they would have five years ago. Who knows these days?

KK: Shows how out of touch I am. That's right. Yeah, here we are. Yeah, it's actually lovely in Gainesville. Like I've got short sleeves on, but it's like 75 and sunny and just everything you want it to be.

EL: Perfect.

KK: And tomorrow, tomorrow's homecoming at the university, which means that it's closed — this is bizarre — for a parade. But as it happens, tomorrow is also my birthday.

EL: Wow!

KK: So I get the day off, and it’s unclear what I'm going to do yet.

EL: Well, just having a day off to lie in bed as long as he want, you know, drink your your coffee at a leisurely pace.

KK: Absolutely.

EL: It’ll be great. Yeah, and we are recording this shortly after Hurricane Ian. And so you're here, so you made it through okay. I actually don't know my Florida geography well enough to remember where Gainesville is.

KK: Gainesville is north central. And weirdly, this cold front sort of pushed just south of town right before. It was about 65 degrees for three or four days, which is freakish. The hurricane, of course, took its very destructive path entering around Fort Myers, went across over Orlando, then to the Atlantic side. We got about a half inch of rain. It was — I mean, we were expecting, like, 10 inches, and then that that weird path happened. Of course, a lot of a lot of our students, you know, their homes have just been devastated. It's a rough time, but you know, the governor and the President are at least putting aside their differences temporarily and making some good progress. Well, we'll see. It's gonna be a long rebuild down there.

EL: Yeah.

KK: And it's a beautiful part of the state, and I feel bad for everyone down there.

EL: Definitely.

KK: But yeah, it's not the first time, you know?

EL: Yeah. Well, yeah, I hope it it continues to progress on the cleanup and everything. And today, shifting gears entirely, we are very excited to have Kimberly Ayers on the show. Welcome, Kimberly, would you like to tell us a little bit about yourself?

Kimberly Ayers: Hi, thank you. Yeah, I'm super excited to be here. And happy early birthday, Kevin.

KK: Thanks.

KA: So I am an assistant professor in the math department at California State University San Marcos, which is about half an hour north of San Diego, so for those of you who are less familiar with California geography, and my research is in dynamical systems and ergodic theory.

KK: Cool.

EL: Nice. And I said “shifting gears” because I know you're also a biking enthusiast like I am.

KA: I am. Yes. I love to get out on my bike. And California weather is — San Diego weather, it’s hard to be outside. So I’m a big bike fan.

EL: Yeah, I — the other day, someone on a local social media thread was posting like, you know, “We shouldn't have good bike infrastructure in Salt Lake because, you know, we're not San Diego, so there's so little time that you can bike here.” And I was like, well, first of all, that's just not true. But you do live that dream of the, like, San Diego biking weather all year.

KA: Yeah, it’s — I can't complain about it.

KK: Sure. Well, it doesn't really snow that much in Salt Lake right. I mean, it hits the mountains. But yeah, I mean, so when I was a postdoc in Chicago, I cycled a lot, but come November I was finished, right?

EL: Yeah, because the roads just never get all the way clear, but here it's dry enough that they do get cleared. And so — you know, I am not an especially hardy person. But, you know, if you’ve got some layers on and the ice is off the road, it's actually doable.

KK: It’s not a problem.

EL: I discovered. I mean, this was a pandemic discovery because I grew up in Texas, and I would just put my bike away in, like, November here, but decided I mental health-wise that I really needed that during especially the height of that covid winter — our first covid winter. Anyway, lovely to have, I guess three people who enjoy biking on this show, but we are not here to talk about biking. We are here to talk about Kimberly's favorite theorem. So yeah, what is that?

KA: So my favorite theorem is a theorem called Sharkovskii's theorem, which is a pretty famous theorem in dynamics. To back up a little bit, when I talk about dynamics, right now I'm talking about discrete dynamical systems, where the idea is if you have a function that has the same domain and codomain, you can think about compositions of that function with itself, right? You can take successive compositions over and over again. And so as a dynamicist, I'm interested in looking at these sequences, like if I start with the point x in my domain, and then I apply f, so I get f(x), and then apply f again, get f(f(x)), and then f(f(f(x))), and so on and so forth, right? This is a sequence. And so we can ask questions about sequences, right? We can ask, like, do they converge? Or maybe if they don't converge, do they have a convergent subsequence? Do they ever repeat themselves, and that repeating themselves is actually what Sharkovskii’s theorem is all about. So Sharkovskii's theorem is about continuous functions on the real line. So it's important to say that there is at the moment, no, like higher dimensional-analog to Sharkovskii’s theorem. This only applies to one-dimensional functions. But Sharkovskii’s theorem says, okay, so we have to take a really weird ordering on the natural numbers. So we're going to start with all of the odd numbers except for 1. So starting at three, we'll take all the odd numbers in a row, so 3, 5, 7, 9, 11, so on and so forth. And then, once you're “done” with all the odd numbers, yes, then you'll consider 2×3, 2×5, 2×7. And again, all of those, right, and then 22×3, 22×5, taking higher powers of to multiplied by 3, 5, 7,.… And then again, once you're “done” with all of those, the only numbers that you haven't included are the powers of 2, so then you take all of the powers of 2 in descending order, until you get back to 1. So it's not a well-ordering, right? You have to kind of wrap your mind around this fact of like, once you're “done” with the odd numbers, then…

EL: Yeah, right.

KA: But it is a total ordering.

EL: Yeah, so you can take any two numbers, you can tell, like, which one is before the other one.

KA: Exactly.

KK: Right.

EL: But you can't say this one is 17th. Well, you can actually say which one is 17th in the series, but, like, a number that isn't an odd number, you can’t say what position it has.

KA: Exactly, exactly. If I were to count, like, the natural numbers in their usual ordering, you know that eventually, you're going to get— like, if you asked me are you eventually going to hit 571? Yes, I will. Right. But if I were to try to do this with the with Sharkovskii ordering, that’s not going to happen, right? So it's kind of weird that there's a minimal and a maximal element in the Sharkovskii ordering. So I haven't told you the punchline yet.

EL: Yeah, we’re just wrapping our head around.

KA: But yeah, exactly, right. So we start by taking this really strange ordering on the natural numbers. And then what Sharkovskii’s theorem says is if you have a period — so I guess I didn't quite define which way which the ordering goes, but let's say that 3 is the maximal element and 1 is the minimal element. So Sharkovskii’s theorem says that if you have a period N orbit for some discrete mapping on the real numbers, then for every M that's less than N, you also have a periodic orbit of that period. So, for instance, if you have a period 2 orbit, you have to have a period 1 orbit, which is what we just call a fixed point, right? If you have period 64, then you also have a period 32, 16, 8, 4, 2, 1, etcetera, and probably most excitingly, is that if you have a period 3 orbit, then you are guaranteed to have periodic orbits of any other period.

KK: Right.

KA: So sometimes people talk about Sharkovskii’s theorem, and what they say is period 3 implies chaos.

EL: Yeah.

KA: Now, I haven't told you what chaos is. And I kind of joke, actually, that chaos in the dynamics community is sort of a bit of a chaotic concept in and of itself. Because there is no really one universally accepted definition of chaos. There's several different types of chaos. There's what we call like Devaney chaos or Li–Yorke chaos. But this definition of chaos, which I believe is Li–Yorke, says that in order to have what we call chaos, you need periodic orbits of all periods. So there's that period 3 gives you that condition, you also need an orbit that is going to be dense in your space. So an orbit that kind of fills up your entire space. And then you need this other thing, which is probably the most famous aspect of chaos theory, which is the sensitive dependence on initial conditions, otherwise sometimes termed the butterfly effect, which basically says that if you have two points, no matter how close together, your initial points are, if you apply f enough times, their sequences, their orbits eventually grow some distance apart from each other, no matter how close together, they start. So there's essentially like no room for error if you have a chaotic system.

KK: Right, right.

KA: Sothat's why once you have period 3, you're guaranteed at least one of the requirements for a chaotic system, right? So my students asked me the other day, they were like, what's your favorite number? And I was like, Oh, that's a really hard question to answer.

KK: Three!

KA: But I think it has to be three because of this, like, you see a period 3 orbit, you kind of automatically get excited, because those are, like, pretty rare. So that is, yeah, I guess I have to say that three is my favorite number

EL: So we get a favorite number for free on this episode.

KA: A favorite number and a favorite theorem!

EL: Okay, so I want — I'm dragging a little bit this morning. And so having a little trouble with, you know, putting these things together. So what I mean, so we have this weird order on the natural numbers. Like sure, I'll let you do that. Can't really stop you. So what kind of — what is our f? What? What kinds of dynamical systems are we talking about here?

KA: Yeah, so let's talk about a couple of famous examples. So oftentimes, I'm talking, I've been talking about functions on the real line, but I guess really dynamicists really like studying functions on compact sets. Because if you have compactness, you're guaranteed things have convergent subsequences. So so we get what we call this limit behavior. So a lot of dynamicists study functions on, like, the closed unit interval. And so some examples are what's called the logistic map, which is a quadratic function. So it's some parameter R times x times 1−x. So it looks like an upside down parabola, right, it intersects the x-axis at 0 and 1. And then in order to make sure that you map back to things in between the 0 and 1 interval, we're going to require that R be between 0 and 4, right?

KK: Right.

KA: If R is bigger than 4, then the top of that parabola bumps up above 1, and, and there are actually cool things that you can study with that as well. But I'll talk about that another day.

KK: Oh, the bifurcation diagrams. That's what you want to talk about. Right?

KA: Yeah, once you vary that, so that's the cool thing, is like as you vary this parameter R, if you start at 0, and then kind of think about what happens is you increase R a little bit, you see these periodic orbits appear in exactly the order that Sharkovskii tells you, they're going to happen. So you start with a fixed point, so that's your period 1 orbit, right? And then I believe it as once R gets above 3, that's when that period 2 orbit shows up, right? And then if you bump up R a little bit more, then you see a period 4 orbit appear, and then a period 8, and we call this a period doubling cascade. And then, of course, as you can imagine, there's only finite room for R, right, we only consider up to 4, but there's infinitely many kinds of periodic orbits that have to appear, so they have to start coming at you faster and faster and faster. And then once R gets above — I want to say it's roughly 3.87, and it's only a number that we've sort of gotten that numerically, unfortunately — then you enter what we call the chaotic regime, which means that period 3 orbit shows up. And then we know we have out there somewhere periodic orbits of all periods. So people might be familiar with this bifurcation diagram, which shows kind of like, where the periodic orbits appear. And it starts off, like on the left hand side, looking pretty simple and smooth. But as you go to the right hand side, it gets more, like, fractally looking. And that's because, once again, those periodic orbits have to show up more and more and more quickly, right, as R increases in value. It’s very cool.

EL: You are just blowing my mind, that there isn't just, like, what I thought was going to happen here was like, we would only get these powers of 2 ones. And then you're going to tell me a different dynamical system later that would have — but like, because it makes sense, it somehow makes sense to be like, at 3, we get this, at, you know, 3 1/2, we get this, at 3 3/4, we get that and, like, the fact that, that like, we some at some point do shift to this period 3 place?

KA: Right!

EL: And we can't even know what the number is? I’m sorry!

KK: And these functions are so simple, right? It's just a quadratic. It's a tent map, basically. Right?

KA: I know! It blows my mind every time I think about it. Yeah, so okay, so you're seeing the beauty in this theorem now. Like, just how cool it is. And I guess I'm gonna, you know, shift gears, pun completely intended there, once again, because not only is the statement of the theorem really cool, but the proof of the theorem is really incredibly beautiful. And so I'm going to do my best to explain it without being able to draw anything. But let's talk specifically about the period 3 implies periodic orbits of every other period, that kind of statement right there. So let's suppose that you have a period 3 orbit, so you've got three points on the real line, call them a, b, and c, such that f(a)=b, f(b)=c, f(c)=a, so they go in this cycle, right? You can label — so that's going to partition, at least between those, into two different intervals, right? So let's say that you have a, b, and c arranged from left to right. And I'm going to, for purposes, it's going to be a little bit weird. But there's a reason I'm going to call I1, the interval between b and c, and I2 the interval between a and b. So what you see happening, then, is that because of continuity, that interval I1, when you when you think of what it maps to under f, it has to cover that entire interval of I1 and I2, right? And also I2 maps to something that at least contains I1. Right? And so you've got this, I'm gesturing a lot with my hands, which I realize nobody can see.

KK: We do this all the time.

EL: Just to slow it down a little.

KA: Yeah.

EL: So the I2 has to cover I1, it’s kind of obvious-ish if you've drawn this like I have.

KA: Right, because you think about where the endpoints go.

EL: So yeah. Can we slow down on this I1 thing?

KA: Yes. So remember, b goes to c and c goes back around to a. v

EL: C goes to a. Okay.

KA: Right? So if you think about what I1 does, is it kind of flips upside down, and then maybe kind of stretches and comes back around, right? And so once again, I'm assuming that f is a continuous function, so you're guaranteed fixed points when you map an interval to itself, right if you have a continuous function. And so since I kind of have this structure, what I'm going to do is I'm going to draw a graph, a directed graph, where my two vertices are going to represent I1 and I2. And then the way that you can kind of visualize this is that I1 has a loop that maps, because you think about I1 kind of covers itself. Right? There's an edge that goes from I1 to I2, because we said that I1 covers I2, and then there's also an edge that goes from I2 to I1. Okay?

KK: So you’ve got a directed loop in this graph.

EL: Yeah, a lollipop.

KA: Exactly. And now the really cool thing is you can create closed paths of any length in that graph, right, just by starting at I2, going up to I1, and going around, I1 as many times as you need and then coming back to I2. Right? And that — traversing along that graph is essentially what tells you about what the periodic orbits are doing. There's some analysis here, when you think about intervals mapping to themselves and guaranteeing fixed points. And so we say a periodic orbit sort of follows this loop if it kind of travels between these intervals, and then comes back to itself.

EL: Yeah, so you've got like some other theorem kind of sitting in the background saying, like, some interval along this has to — or sorry, some point in this interval, has to do this precise thing.

KA: Exactly. And you can prove that via, I think it's a result of the intermediate value theorem, because your function is continuous.

KK: Brouwer fixed point theorem, essentially.

KA: Right, exactly. You're essentially applying that and then you're just walking along this graph, and all you need to do is make sure that you start and end at the same point, in order to get that periodic-ness. And so then the punch line is that once you have this graph, now I can create, you know, a path, a closed path, of any length that I want, just from the existence of that period 3 orbit.

KK: Yeah. Okay.

KA: And so I really love that,— you know, I'm not a graph theorist. For a long time, I was calling closed paths loops, and my graph theorist friends got really mad at me, told me I had to stop doing that. So now I'm like, okay, closed paths. But I love that it builds — you look at the structure of the graph, and you kind of just read it off from there. And so the proof of the entire Sharkovskii’s theorem basically constructs these graphs with these intervals, and looks at which intervals map to each other, and then you draw the edges as they are needed. And then you, again, you just read off, like, what length closed paths can you get from this. And it’s so cool.

EL: Yeah, there's something so appealing about this, because, you know, you see this, and you're like, oh, man, I'm going to have to find a fixed point. Okay. Is it going to be, like, 3/4 of b plus? Like five? But no, you just have to lose all of this.

KA: You don't need to find it. You just know it's there yet?

EL: You can almost forget the whole dynamical system!

KA: Exactly.

EL: The whole actually nitty gritty details of what's happening with this dynamical system and just say, like, oh, look, I made my little lollipop.

KA: You just take all that information, and you put it in the graph, and then you can kind of almost forget about the dynamical system and just look at the graph.

KK: Well, until you want to actually find this the orbit, right? I mean…

KA: Yeah, well, sure. And that is a much more challenging question, right? Because these orbits are often what we call unstable, which means that other orbits don't converge to them. And so in order to find them, you kind of have to start, like, exactly on top of them, right? And that's very hard to do.

KK: Right, because because of the chaos business?

KA: Exactly, exactly. There’s zero room for error, literally.

EL: And so was this a love at first sight kind of theorem for you?

KA: Oh, absolutely. Once I learned it in grad school, I was just really taken away with — I started by being really captivated by this ordering on the naturals, because I never thought to, like, rearrange the natural numbers — you know, the usual ordering seemed good enough to me. But like, oh, we can rearrange in this ordering, like, maybe is — sorry, my dog is groaning behind me. I hope that that's coming through. We can take this different ordering, and it still like, makes sense. I can still compare any two natural numbers. But it just completely like violates my intuition. And then I saw the proof and I was like, oh, that's just beautiful. Taking all of this information and reducing it down to this directed graph and then just reading off the graph is just so cool to me.

EL: Yeah, so I've kind of maybe opening Pandora's box here, but, so we just did the period 3 implies the all other periods kind of thing. So I — so is the proof, if you wanted to show that, like, period 7 implies period 9 or something, do you do the same kind of thing?

KA: It’s the same idea. Yeah, you draw again, you, you think about a period seven orbit, you label the intervals in a very specific way, and you have to be a bit careful about the way that you label the intervals to make sure which intervals are going to cover which ones. And then again, you draw the graph, and then you can just read things off the graph.

EL: Okay.

KA: So that's exactly how it works. And so there is kind of a generalized graph that has structure that's a little bit too difficult for me to explain right now. But, you know, we'll say, like, take an arbitrary natural number k, we can generally describe the structure of what that graph is going to look like, and then we can describe what the lengths of the closed paths are going to be.

KK: Right, right.

EL: Yeah. Okay. So cool. So, like I said earlier, well, before we started recording, I've heard this “period three applies chaos,” it’s such a great tagline and stuff. And I always nod, like, yeah, yeah, it totally implies chaos. You know, I have looked at this a little bit, but I'm really happy to get to know a little more about what this theorem of actually means so I don't have to just pretend I actually understand what’s going on anymore.

KA: Yeah, it is a really cool, like you said tagline to this theorem. It's very punchy, and succinct.

EL: Yes.

KK: Yeah. Very cool. So okay, now, I’ve got to know. So the other part of this podcast is, we ask our guests to pair their theorem with something. So what what pairs well with, with Sharkovskii’s theorem.

KA: Okay, so I gave this a lot of thought. And I think I came up with a really great pairing. I don't know if you have all ever watched taffy pulling videos?

KK: Absolutely.

EL: Yeah, I actually wrote an article.

KK: Right. I remember this.

EL: Yeah. Dynamical systems in taffy pulling at one point.

KA: Yeah, so I will say I don't personally particularly enjoy taffy. I think it's sweet and sticky and makes my teeth feel kind of weird. But I could watch videos of taffy being pulled for hours. So the idea, and I you know, I don't make candy. So I don't necessarily know what I'm talking about. But my understanding is, they have this big mass of sugar that they've boiled. And they need to basically aerate it, they need to introduce air into it somehow. And so you can do this either on a machine or by hand. But basically, the taffy has to be stretched and then folded back on itself and stretched and folded back. And they just do this over and over and over again. And I think about like, well, that's exactly what we're talking about doing with the unit interval when we talk about a continuous function on the unit interval. We're kind of deforming the unit interval somehow and then putting it back on top of itself. And then just doing that over and over and over and over again.

KK: Right? Yeah, so.

KA: Go ahead, Kevin.

KK: No, I was just going to say, this reminds me, so Evelyn, I think had this diagram of the taffy pulling machine in your article, right? It is really fascinating. That's how these sort of it's 3 things. Yeah. 3 shows up everywhere, right?

KA: Yeah, and now again, I don't know anything about this, but I wonder if that's intentional. And what's also really cool is sometimes they'll put, if they’re going to dye the Taffy a certain color, they put a little bit of coloring just somewhere on the taffy, and then as the taffy gets pulled, that color works its way through the entire thing. And I like to think of that as an analogue to the dense orbit: you start in a very concentrated little area, but slowly this dye works its way throughout the entire the entire mass of candy.

KK: No, I think that's actually an excellent analogy. That's exactly what's happening. And so I wonder if — the inventor didn't know this theorem, of course. But somehow taffy pullers intuitively knew that 3 would do the trick.

KA: Three is the one that would work.

KK: Two’s not enough to just going to do what we want, but just sort of flip it over itself, but three will really you know, yeah, braid it at least.

EL: Yeah, it's cool. It was so long ago at this point that I wrote that that I can't remember the punchline of my article. I might need to go find find my article and read it again. Be like, oh, that person really wrote so well! But yeah, that's fun, and actually as a kid I loved taffy. But as an adult with, you know, various tooth and jaw problems, it's not the very friendliest candy.

KA: No, it's not. But at least you can watch videos of taffy being pulled without having to actually eat it.

EL: That really is the fun part.

KA: And actually, there’s one more thing that I should tell you about Sharkovskii, that is very cool about it. There's this thing that's called the — maybe this is not quite correct what they call it, but they call it the converse Sharkovskii — which says that, so we have this ordering on the natural numbers. There is, for every tail of that ordering, there is going to be a continuous function that has exactly periods of those exact — periodic orbits of those exact periods.

EL: And, like, none before it.

KA: And none before it, every single one. So it's kind of like this sharp, you know, it goes both ways.

KK: So for every natural number, there is a dynamical system that has that many of that order, but then everything less than that in the Sharkovskii ordering, but nothing before.

KA: Exactly, but nothing that came before. So it goes both ways, in a way, right.

KK: So there's something with an orbit of order 57, but not 55.

KA: Exactly. Exactly.

KK: All right. Interesting.

KA: So I think that's also a very cool result.

KK: Dynamics is hard!

KA: Yeah, it is. And I feel like I'm constantly having to, like, I feel like my spatial sense is never very good. But maybe it's gotten better over the course of me studying dynamics more. I’m, like, constantly having to turn things around in my brain and, like, fold things over. And yeah, I love it a lot.

KK: So we also like to give our guests a chance to plug anything. Where can we find you on the worldwide intertubes?

KA: So I am on Twitter. My handle is @kimdayers. Some other cool projects going on is I've gotten I've been doing a fair amount with LGBTQ people in STEM. And so I did an interview over the summer talking to this organization called LGBT Tech, and you can find that on YouTube, just talking about my experience as a mathematician and my identity as a queer woman. And so that's something that I'm very passionate about. And you know, if anybody ever wants to talk more about that, they're welcome to reach out to me on Twitter.

EL: Nice.

KK: Excellent.

EL: Yeah, we'll include a link to that in the show notes. Check those out. Yeah. Thanks for joining us.

KK: Yeah, this has been great. Really great.

KA: Thank you so much. This was a lot of fun.

KK: Good. Take care.

[outro]

On this episode, we were happy to have Kimberly Ayers of California State University San Marcos on the podcast to talk about Sharkovskii's theorem. Here are some links you might enjoy perusing after you listen to the episode.
Ayers' website and Twitter account
Her interview with LGBT Tech
Tien-Yien Li and James A. Yorke's article Period Three Implies Chaos
Our "flash favorite theorem" episode, where Michelle Manes also professed her love of Sharkovskii's theorem
Evelyn's Smithsonian article about the mathematics of taffy pullers

Kevin Knudson: Welcome to My Favorite Theorem, the math podcast with no quiz at the end. I'm Kevin Knudson, professor of mathematics at the University of Florida, and here is your other host.

Evelyn Lamb: Hi, I'm Evelyn Lamb, a freelance math and science writer in Salt Lake City, Utah, trying to rehydrate myself after taking a long bike ride yesterday in the Utah desert in July, basically.

KK: That’s not cool. Okay, so here's my here's my story. So the last 10 days of June, my wife and I were out in Vancouver visiting our son. And it was lovely. It was, you know, 65 degrees every day, and we took a side trip to Banff. And which, if you've never been, I cannot recommend enough expect ACULA really beautiful. We had a wonderful time. We took the redeye Wednesday night back from Seattle to Orlando. Thursday morning. I had a sore throat for a couple of days.

EL: Uh oh.

KK: Yeah. I took a COVID test and it was negative. Okay, but I still don't feel great. Thursday I didn’t feel good. Friday morning I'm feeling worse. Take another COVID test. Guess what?

EL: It got you?

KK: It got me. I had a good run. It was two and a half years. But anyway, so

EL: This is a podcast from quarantine, although it's exactly the same as all our other podcasts because we’re always on Zoom anyway.

KK: Yeah, so anyway, here I am. So if I sound a little froggy, that’s why. I'm feeling a lot better and so is Ellen, but yeah, it's been a rough few days in the Knudson house. And it's 100 degrees here and miserable.

EL: Right? Yeah. A little less conducive to fun.

KK: Yeah, yeah. But enough of my petty problem problems, which — look, you know, everybody, if you're not vaccinated, get vaccinated, right? I'm of an age where I can be double boosted. And you know, I just, I got a bad cold. That's it. So get your shots, people. There, enough political — anyway. It shouldn't be political, but somehow it is. So today, we are pleased to welcome Philip Ording to the show. Phillip, why don't you introduce yourself?

Philip Ording: Hi, thank you, Kevin. Thanks, Evelyn, for having me on the show. Yeah, I am a mathematician and a writer and I teach at Sarah Lawrence College in Westchester, New York state. It's not as hot here right now. It was over the weekend.

EL: You’ve got your moments up there, I’m sure. It can be very oppressive.

KK: Yep.

PO: And if you hear some some child background noise, that's because COVID got the summer camp up here. My son came back from upstate Catskills camp, because they had to shut it down after a week.

KK: That’s a bummer.

EL: Oh, man. Yeah, that's rough. Well, we have invited you on the show to talk about your favorite theorem. But first, I wanted to sort of digress to a theorem that you have written about quite extensively.

KK: A lot!

EL: That apparently is not your favorite theorem. But I wanted to invite you on here because of this amazing book 99 Variations on a Proof that came out a few years ago, and I read it, you know, last year, or something, and I kept thinking, “Oh, I should invite him on here.” And it's 99 proofs of a theorem — maybe we might not even call it a theorem, a statement.

PO: It’s generous to call it a theorem.

EL: Yeah, that about the roots of a cubic polynomial, one particular cubic polynomial, and you just talk about it, you have 99 different ways to prove that the roots of this polynomial are 1 or 4. Sorry, a little minor spoiler for this book. I think you’ll still be able to enjoy it. So yeah, can you talk about that? Like the how you had the idea to write this book and kind of maybe tell us about some of the styles of proof or styles of presentation that you've included in here?

PO: Yeah, sure. Thanks for bringing that up. And the, the book, yeah, it’s not my favorite theorem. I chose it almost at random. And the book is really about everything around it. So I was interested in whether or not you could fill a book by thinking about the expressive material of mathematics outside of the content, or almost parallel to the content. I had a friend in grad school who said that he — he said this, I think, over drinks, but with gravitas — that he thought that the thing that mathematics had over other subjects was that it has so much content; you know, if you make one statement in mathematics, it's the kind of thing that not only is very condensed, and is probably the result of a long, long track to study, but it's also something you can return to a lot. So I was interested whether or not even a very humble equation and solution, something that anybody who has been exposed to math would recognize as mathematics, would be able to support that kind of an investigation of something — mathematicians don't talk about style that much. I think philosophers maybe are starting to talk about it more recently — and just carry it through the things that I like about math, the things I don't like, the history, and some of the folklore as well. So the titles are kind of the style for each of those chapters. And they range from things like “Psychedelic” to “Medieval” to “A proof that's found in a book.” And everything in between. So there are proofs from school, from graduate school, from college. There are person different languages. There are proofs that are linguistic, I guess, you could say, that draw attention to the particular notations, or the sound, that the proof reads as. Yeah. And it was a lot of fun. It kind of was a project that once it started, it took over and had a life of its own, which was probably what what got me to the very end of it, even though it was a long project.

EL: Yeah, a long time to be thinking about one cubic equation. I was flipping through today, and I did you know, towards the back, you have a mondegreen, which is one of those kind of misheard lyrics sort of things. “Their omelet: eggs, beer, eel” is the the first line of it. So you know, “their omelet” instead of “theorem: Let”

KK: Yeah. Yeah.

EL: And I read through it. This is one, you just have to concentrate so hard to read it and try to figure out the math version of it, but yeah, so you got, yeah, so many different ways to roll over this equation. So yeah, I hope people will check that out. It's a lot of fun.

PO: That was a that particular proof was a lot of fun to work on. I had some students helping me in the summer, and we just turned over the language of one of the simplest proofs in the book from a mathematical point of view. I think it comes from a kind of sleight of hand that could easily be misunderstood if somebody wasn't paying attention. And I remember when I was in college, I had a friend who said that she liked math, and she'd taken some courses but gave up after a calculus course in which she couldn't understand what the professor was saying. And all she remembers is this professor would get very excited and say “Knees the baby, knees the baby.” And she didn't have any idea what that meant, but she knew it was important. And so I tried to think of things that sounded very similar.

KK: Yeah.

PO: And I think it's an experience that everybody has, at some point, you're sitting in a talk and you kind of are reading the person's emotions as much as you're reading, you're listening, to that particular details of the techniques that are used, and there's often things that are lost in that channel. So it was fun to make fun of that phenomenon that I think most people who have studied mathematics at a certain level have experienced.

KK: What’s knees the baby? I can't figure it out.

PO: I still don't know. If anyone figures it out.

EL: Listener submissions.

PO: Multivariable calculus

KK: Okay, well, anyway, that’s, okay. We’ll try to figure it out offline.

EL: We’ll try not try to be thinking about that the whole time we’re recording this.

KK: That’s right. Okay, so you've told us what isn't your favorite theorem. You do have an actual favorite theorem. Why don’t you tell us about it?

PO: I do. And I love this question, because it’s, to me, it's very appealing. It's also very challenging. It's not the first time, actually, somebody asked me for my favorite theorem. The first time it wasn't for a podcast, it was for bathroom. I had a friend, some family friends, that had remodeled their apartment and they thought that this bathroom they had designed, it was like black paint or wallpaper inside. And they thought it would be fun to have their mathematician friend make a theorem or some kind of statement of gravitas in the bathroom. Or maybe they just thought it would go well with the marble sink or something. I'm not sure. But I thought about it for a long time. And I thought, okay, you know, is this going to be like something that is, I think, the most important piece of mathematics? Or is it going to be something really personally meaningful? Or maybe, like, I was in a bathroom at a bar once downtown and some, I think it was a grad student at NYU maybe, had done, like, the de Rham cohomology sequences, and I thought that looked cool. Maybe it should just be graffiti. But yeah, I sort of never got around to it, because I felt like I didn't really attach that much meaning to particular theorems. But anyway, what I came up with is something that's instead of a theorem, it's an idea. So it's called the Erlangen program.

KK: Okay.

PO: And it's credited to Felix Klein, German mathematician, 19th century. And a program — yes, so it's kind of a project or an assessment of the state of mathematics at the time, but also a direction forward. So to say what it is, it's, I reread the Erlangen program, which is a lecture that he prepared, actually. It’s named after the university that he was going to be teaching at, a professor. And actually, there are no theorems in it. The thing that's maybe closest is a statement that says that if you want to learn about geometry, you can find everything that you want to know by studying the motions of geometric objects in that space. So what does that mean, to give some example — Have you heard of this, by the way? I don’t —

EL: I definitely knew the name. I could not have told you. The first thing of what it actually was.

KK: I think it's actually been a remarkably influential idea for the last 150 years, right? I mean, I think it's driven a lot of of what happened in the 20th century.

PO: I think so. My background is in geometry and topology. So I might, you know, I might be biased.

KK: Yeah, me too.

PO: Yeah, so, I mean, to give an example, if you wanted to understand, say, points in the plane, the idea is that you can understand points just as well as anything that you might do with, say, intersections of lines, or coordinates, or quadrants, or distance, by just studying, say, rotations of the plane that fix that point. Or collections of rotations that fix a set of points. Or if you wanted to study line geometry in the plane, you could study, well, I don't know if this qualifies as a motion, but the transformation takes every point on one side of the line to the point reflected across the line. So just studying reflections in the plane that fix axes, you can really express everything you'd want to know about lines in the plane. And just to give some sense of, you know, why is this interesting, and not just a complication, so if you wanted to have — say you had two reflections, and you compose them, so you reflect across your first line, and then you reflect across the second line — and that's two operations, you can you can combine them, you're going to get something back — the result is going to be a rotation about — if there's a point where those lines meet, when lines typically do — you're going to get a rotation about that point. And when I first sort of started to get this idea, and use it, it's sort of a yoga, you get used to it after a while, of going back and forth between the world of geometric objects and the world of the structure of motions, or the group of motions. I loved it, and it was very useful, and it seemed like it joined together areas of my brain that were were divided before. So I think that's why it’s my favorite, but I could say more than that too.

EL: Yeah, so where did you first encounter it?

PO: I think it was in my senior year in undergraduate, I was given a project by my senior thesis advisor, wonderful professor and Troels Jørgensen, and he cut his teeth studying hyperbolic geometry. So one of the things that I think is really amazing — and this was maybe Klein's motivation for introducing the Erlangen program — is that if you have many different geometries, so if you've been introduced to the idea that there isn't an absolute singular geometry out there, what we call now Euclidean geometry, that used to be just geometry, and now there are non Euclidean geometries or even wilder things, like topology that we don't call a geometry, exactly, then you might want to know, how are you going to do anything in those weird spaces? And if you have the Erlangen program, it's telling you, as long as you can understand the structure of the transformations, which we think of as generalization, or restriction of congruence. So congruence is the word we usually use for those motions of the plane that that fix them, that preserve them. Okay, so what I had to do is understand something about the hyperbolic, the non-Euclidean analog of a pyramid, tetrahedron is the term. And so tetrahedra are kind of, like, the dumbest of the platonic solids, I mean, maybe it's got four sides, four corners, it's a good shape for a die if you want to have just four options, because it's so symmetric. But when you go into the this world of negatively curved space, you can study tetrahedra that are formed by points that are at infinity, meaning that you don't see, actually, a finite object in front of you, you just see these sets of lines that are going off into space. But it turns out, they bound a finite volume, which is very, very bizarre. And if you want to understand anything about them, you're kind of left scratching your head, if you're just going to be limited to the tools of Euclidean geometry, measuring things like area and volume in the traditional way. It turns out that if you take that idea of, okay, I'm not going to think about the tetrahedron as made up of lines, I'm going to think of it as constituted by rotations in that space, it turns out, you can write down those rotations, that whole set, quite easily using once you've gotten used to using some matrix algebra, so kind of higher dimensional generalization of the regular algebra on the real numbers. And that — so combining those kinds of representatives of lines, you can just go to town computing things, and you can compute intersections, just like I said, with these compositions of reflections in planes, instead of say, instead of Euclidean planes, now hyperbolic planes. So that's a long answer to where I first encountered it. And yeah, I wouldn't have known really how to approach the problem I was assigned if I hadn't had those tools.

KK: Sure. Yeah. I mean, trying to think about the actual geometry of 3d hyperbolic space is sort of weird, right? I mean, like you say, you can't see it. You can, but you can't, and you might draw it, but you have to remember the metric is different and the distances don't look — things that look finite aren’t. And, yeah, it's a very bizarre feeling to try to move into that space.

EL: I love those representations of hyperbolic space. I mean, they're stunning. And they produce some of the most interesting kinds of ornaments out there. But it is hard to know where to start when you're just looking at these dazzling representations or models. And I guess, the other thing that I was made to understand was that this Erlangen program is a little bit like a Rosetta Stone, because it's not only telling you how you can work within any given geometry, by studying its associated group of transformations, but if you know that a geometry has among its transformations a subset or a subgroup that has this kind of coherence, then that becomes sort of a sub-geometry. And you can relate them. And I think this was going back to Klein, when he was up to — they had all these great methods in projective geometry, one of the kind of early alternatives to Euclid, and they were able to use those to study and relate geometries one to another in this kind of zoo that exploded in the 19th century.

EL: Yeah, and that's, you know, thinking about, I guess, when most of us go to grad school in math, you know, one of the powerful things that we do is see this relationship between the algebra, you know, group actions, and geometric objects in some way. And so, this is building from that connection, I guess, from the Erlangen program. Is that somewhat right?

PO: Exactly. Yeah. I mean, there are other connections between geometry and algebra, right? I mean, we learn with Descartes, and once we start plugging in coordinates for points, and then writing out lowly cubic equations for expressing pictures of curves. So, you know, I think that when — you know, the process of learning math is usually, even though math seems like a very strict discipline, it has its own subfields. And those subfields don't always work together in obvious ways. So we tend to teach them in by these isolated textbooks, you know, algebra, or group theory, and analysis and geometry, and so forth, or calculus. And I think Klein was very much a synthesizer. And I like this idea. As was William Thurston, who was the person setting out programs for geometry when I was a grad student, and I think we're still untying some of the things that that he that he set out.

EL: Definitely.

KK: Yep. All right. So another thing we do on this podcast is we invite our guests to pair their theorem, or in this case program, with something. What do you think pairs well with the Erlangen program?

PO: Oh, yeah. Okay. So, yeah, this is something I thought about. And along the lines of the question of your favorite theorem, I went to a kind of personal, like, trying to think about, taking this question very sincerely. Because I like the idea that there might be a connection between our personal taste and the things that we do. I mean, it's a high bar for mathematics, I guess, because we're working with abstract things. But there's a piece of sculpture that I would pair with this theorem that's in the Museum of Modern Art. It's by a sculptor, it’s a postmodern piece by Richard Serra. He’s an American sculptor. From 1967, I think. And it doesn’t — it sits on the floor, it doesn't have a pedestal. And it's not much to — you might you might step on it by accident, if you didn't, if there wasn't a cord around it or something, but it's a rectangular piece of rubber, like black vulcanized rubber. And it looks a little bit like, it has a graceful form, it rises in the middle and then descends to the floor. It looks like maybe like a cowl over a monk at vespers or something, I don't know. Or like the hills on the screen, the green screen behind Evelyn of Utah. And the name of the piece kind of says it all. It's called “To Lift.” And it's part of a series that that he made. I think he was inspired first by dancers that he was seeing, choreographers at the time, in downtown Manhattan. But the idea, he made this this kind of Erlangen program for himself that was called the verb list. And it starts out, like, to crease, to fold, to roll, to twist, to torque. And he made pieces for many of these that kind of instantiate this verb by applying it very simply to material. So it's not — a lot of them are I think were rubber, but others are lead or steel. Later on, he got into more. And yeah, so the thing about the Erlangen program, besides its connective properties between different disciplines, I really like the way that it takes things that I've thought of as more solid, geometric objects, concrete things, and then trades them with verbs, with actions or motions or transformations. So it makes geometry much more dynamic, anyway in my way previously of thinking of it as this static world that you kind of enter and measure things. Instead, it's this world where you have all of these permutations of the space that you're looking at. And you kind of play. I think of it as more playful. But that's the sense I got from, I had a chance to work as a grad student in Richard Serra’s studio. And it's very serious business. I don't want to pretend like it's kindergarten, but sometimes it has that feeling of like, this is a proposition, can we make a form that embodies this movement, or this daily kind of task or transformation? And he made videos around that same time, “Hand Catching Lead,” and they're very simple, but they just act on you in a way because you start imagining your own participation with the material world around you in this way. So that would be my pairing.

EL: Yeah, well, your description I haven't, you know, I'll look it up later, to see if I can find a picture of the sculpture. But your description, you know, it sounds like you had a sheet of rubber on the ground and just lifted it up. And it does sound like the simplest thing. I'm sure it wasn't the simplest thing to actually make something that that gives you that feeling. But yeah, I guess that there's that — when you see it, you immediately understand what the aim was. And it's funny, when you're listing that these other verbs that that he did, so many of them also have mathematical things that you can almost imagine a textbook that's telling you, like, Okay, this is what a Dehn twist is, and shows you a simple example of that. This is what something with torsion is or this, I don't remember exactly, all the words, but even “lift” has a mathematical meaning as well. And so these choreographic and artistic things, also connecting to the these mathematical ideas we have.

PO: I love those those suggestive verbs and those little diagrams in kind of combinatorial, or cut and paste topology. Yeah, definitely.

KK: So you mentioned that you worked in the sculptor’s studio as a graduate student. How did that come about?

PO: Oh, yeah, that's right. So it was kind of one of those “only in New York” moments. I think his studio manager reached out to the tutoring email at Columbia University where I was a graduate student. And I think they were kind of stuck with the communication between the studio and the engineers that make the large-scale sculpture that that Serra's known for most widely today. So there was some kind of communication breakdown there. And they thought, you know, we're not understanding what the engineers are telling us about what is not possible, and what is possible. And it had gone, it had left the converse the bounds of what was engineering-ly, possible, like, it was actually what was formally possible. So at that point, you know, this was in the early 2000s, he was already working at a very sophisticated level, in the sense that, to make some of the large-scale forms, they were using cutting-edge architectural design and engineering tools. And once they had a design, they could send it out, and people would sort of develop it to a point where it would be stable, rigorous, and so forth, pass the test. So yeah, when I saw that, I jumped on it because I've kind of always been interested in places where mathematics might speak to the arts. And had at that point already, I think I was tutoring a professor in the architecture department. And his name is Peter Macapia. And he was, he became a very good friend, but he also kind of, once he knew I was going to go try to meet Serra, he gave me a bit of a crash course on why Serra might be interested to talk to a geometer or mathematician. And so I don't know if that's the reason that I was asked and invited to work in the studio, because I had done a little homework? It might have just been that — sometimes I would joke that I was a math therapist, a geometric therapist. I would listen to the things that they were trying to do and ask them why they talked about them the way they did. And often I think they came up with their own solutions. But certainly it was a formative experience for me. And part of the reason I wrote the variations was to see if there was a way to take seriously reversing the direction from instead of applying math to art, to see if I could borrow some of the ideas of art-making to do math.

EL: Yeah, that is such a great opportunity you had as a grad student, even, to get to do that kind of thing. And yeah, it’s, I think both of us, a lot of people love that murky boundary between math and art and the ways that, you know, we can apply the very — I guess, I think of math often as a theoretical art, we're doing a similar kind of thing. I mean, I know this isn't original, but it's the similar kinds of thing. We've got aesthetics, we've got rules of our discipline, and like, we apply it to abstract objects, and using that to apply it to concrete objects after that is very cool.

KK: Yeah.

EL: Thanks. I'm looking forward to looking up that sculpture. Yeah, after we get off the call.

KK: All right. So we've talked about your book, we always like to give our guests a chance to plug anything else, or where we might find you on the worldwide web or anything like that.

PO: Oh, sure. Yeah. The book came out in paperback last fall, so you can find it even more affordably priced, I would say, from Princeton University Press. I want to plug my friend's book. I don't know if you've had Jessica Wynne on.

KK: No.

PO: She’s a photographer that made a beautiful book called Do Not Erase.

KK: I have this book.

PO: Yeah. Okay. Yeah. So she was going to ask me to make a board and for her to photograph and I wrote — I used the maximum word count, I think — to write a little bit about my senior thesis advisor Troels. So if you want to page through that, but the book is amazing, and there are many celebrated mathematicians boards in there. So that's fun. I think your listeners would enjoy that if they haven't seen it already.

EL: Yeah. We'll put a link to that in the show notes. Yeah, thank you for joining us. I really enjoyed getting to talk to you and think more about that connection between math and art.

KK: Yep.

PO: Thank you for having me. It's been really fun to talk to you.

KK: Yeah. Thanks, Philip, it’s been great.

[outro]

In this episode, we talked with Philip Ording, a mathematician at Sarah Lawrence College, about the Erlangen program. Attached are some related resources you might enjoy.
Ording's website
The website for his book, 99 Variations on a Proof
John Baez's links related to the Erlangen program, including Klein's original paper on the topic
Royce Nelson's page about 3-dimensional hyperbolic geometry
Jessica Wynne's book Do Not Erase about mathematicians and their chalkboards

Evelyn Lamb: Hello and welcome to My Favorite Theorem, the math podcast with no quiz at the end. I like how we're always besmirching other math podcasts, which as far as I know, also don't have quizzes at the end. I am your host Evelyn lamb. I am a freelance math and science writer in Salt Lake City, Utah. And this is your other host.

Kevin Knudson: Hi, I'm Kevin Knudson, professor of mathematics at the University of Florida. Okay, full confession. I don't listen to other podcasts, so I don't know if they have quizzes at the end or not.

EL: Shame. They probably don't. I mean, how would you even administer that?

KK: That’s right. That's right. Yeah. Yeah. We don't need to find this out.

EL: Yeah. Well, we are, we should, we should just get right.

KK: Let’s do it. Yeah.

EL: We are very happy today to invite Daina Taimina onto the show. So Daina, please introduce yourself, tell us a little bit about yourself, and we'll get started.

Daina Taimina: Hello. Thank you for inviting me. And, actually, I didn't prepare much to tell about myself. Because usually, I tell my students, you know, just search for me on the internet. That knows more about me than myself.

EL: Maybe even some of it’s true.

DT: Maybe, yes. Sometimes it's true. Yeah. So well, okay. Well, I was teaching about 20 years, I was teaching mathematics at the University of Latvia. And at about the same time, I was teaching in Cornell, where I, now I have stopped teaching. And I officially count as a retired, so it means I have free time to do whatever I want.

KK: Nice.

DT: Yes. And then sometimes, well, it has been now for 25 years, I have crocheted hyperbolic planes. And I guess that's what people know most. Because sometimes I am introduced on people. “Oh, yeah.” And then this person who is introducing me says, “You know, she's the one with hyperbolic planes.” “Oh, yeah! Yes, yes, I know that!” Okay, I guess that's my other name.

EL: Yeah. And our in your multitalented our listeners can't see it, but when we were saying hi we saw that you have some of your very own paintings in the background on Zoom, where I'm seeing right now, and they look very lovely. So you do art in addition to crochet and math?

DT: Actually, that was before, and I and the reason why I was doing I was doing art, is I signed up for a watercolor lessons because I knew that I'm very bad at art. Because when I was in school, I was told I can do anything but that. And at that time in Cornell, I was teaching students who were very afraid of maths, and most most of them were actually architecture art students or music students, and I really wanted to experience how it is to take some subject where you are told, and you believe all your life, that you are bad and you can’t do it. So I did it. And so yes, that was interesting experience.

EL: Well, and it looks like with some practice, you gained skills. Amazing how that works.

KK: I did that to actually about a year ago. I cannot draw. I'm terrible. So maybe we have the same issues here.

DT: Yes, yes. Yes, exactly.

KK: And I took it I took like a just a two hour drawing workshop online where we draw birds, and I actually drew something that looked like a bird at the end. So you know, it can be done.

DT: Yes, because this is what you what you learn, is that — and then I was explaining to my students, too —I brought in one of my paintings, and I said, it's actually, what I realize is that it was things which I knew. I knew, well, perspective. I knew how to do composition from photography, you know, just like doing some photography. And all I needed was, you know, I did need some technical skills, and that is the same in math. You do need to learn some technical skills, and then you can then you can get on, so it's not that different.

EL: Yeah, that's a great, a great lesson to learn and to help share with your students like, “Hey, we're all learning various things. I have this background, you have this background, but we can all improve in various areas of our lives.”

KK: Yeah.

EL: Well, the name of this podcast is My Favorite Theorem. So, what is your favorite theorem?

DT: Well, as I told you, my favorite theorem is Desargues’ theorem. Yes, and then, well, actually it started with some more ancient theorem, which was Pappus’s theorem. And it was somewhere, I think I was in middle schoo, and I was reading something in a math history, and I read that there is this ancient theorem, where if you are having two lines, and then you choose three points on each of them and those lines are non-parallel. Well, if they parallel than they are, that’s a very simple case. But if you have like two lines at some kind of angle, and then you choose, and then you then you connect in pairs points from these lines, and you always have three points which are on the same line. And I know like I was just like, that's — okay, I'm so old that at that time, there was no Geometry Sketchpad or any of these programs, there was no computer. So I just kept drawing these lines and finding those points, then it was just amazing. And then of course, I was like, “Oh, what else is there?” And that's when I discovered this, this Desargues’ theorem, which said, okay, if two triangles are situated so that three lines joining their corresponding vertices all meet at a single point, then the points of intersection of the two triangles’ corresponding sides, if those intersection points exist, all lie on one line. I couldn't — I read it, and I couldn't believe that. So again, I took a pencil and took a straightedge and I started to draw, like, various ways, and it was really finding these points and having them and, and then later learning that the converse of this Desargues’ theorem is also true, and then that’s a converse, theorem, that's also a dual theorem. So it was just so fascinating. So that was something, like, different from the geometry, you know, like, exactly the geometry we were having going to school, and so that's kind of led to perspective. And yes, I was just like, really it was fascinating.

EL: Yeah, this is one that has come up a few times for me in things I've read, or people I've talked to in the past few years. But yeah, I loved geometry for a long time, and this is not a theorem that I was exposed to, in most of my geometry education.

KK: Yeah.

DT: And it's very interesting that you can you can prove this theorem using another ancient theorem, Menelaus’s theorem — okay, I'm not going to talk about that — but that sounds very algebraic, because that uses uses proportions, and it's totally in Euclidean geometry. But I like the way how Desargues himself saw, and he actually was thinking about it in three dimensions, and then it's simple. When you are cutting, like, a triangular pyramid with two planes, and then it's just totally obvious.

EL: Okay, I'll have to sit down and try to visualize that a little better.

KK: Right, isn't the simplest proof, don't you use three, you have to go into 3d and then it sort of, like you say, sort of becomes obvious?

DT: Exactly, yes, yes. Yes. That's one of those. Yeah, that's one of those cases, and that was so great! You know, you just jump out, and then it's obvious. And then it's also, the other thing is, if you are having — so you know, like you can imagine that you are having a book, or though now you're having a point, and then you are projecting a triangle, and then all you do is, you imagine that those lines, that it stretches, and then all you do is you open it up in one plane. And there's the theorem.

KK: There’s the proof. Yep, I wish our listeners could have just seen that.

DT: I don't know how to describe.

KK: So this actually came up for you in school in Latvia? Like, your instructor actually taught?

DT: No, I believe I was reading something from Martin Gardner, or something outside, but I did have a wonderful geometry teacher.

EL: So you were interested in math very early in your education?

DT: It was just one of my easiest subjects. I was interested more in literature and languages. That's what you are saying, you know, like an art. Math, it’s just something that comes by nothing. It’s just simple, just seeing things.

KK: I mean, well, so Evelyn, maybe you had this experience. I mean, I became a mathematician because I was always good at math, right? It was the thing that I could easily do. And so it's sort of interesting that it was sort of the easy thing you could do, but you liked something else more?

DT: Yes, that’s true. Yeah.

EL: Yeah. I I had sort of a similar experience to you Daina, I think, where I was, you know,“good at math” — good at arithmetic, basically — in elementary school. And I liked the proofs in geometry, although I didn't understand that those were “real math” also. I thought it was just a diversion.

KK: The two-column proofs?

EL: Yeah, I liked the logic part of it. You're working it through, but I thought arithmetic was real math. And so yeah, I wasn't as interested in that. I was more interested in — I really liked science, but I did a lot of music also and stuff. But eventually, it wasn't until college, that I really kind of fell in love with it, and decided to devote my life to it in at least some form.

KK: Including podcasts at this point. So yeah.

DT: Well, you've been successful.

KK: Sure. So, have you used this at all? I mean, Is this a theorem that you use in your own in your own mathematical work? Or is it just something that you just love?

DT: No, I this is something which I love. Yes. Because, ya know, it’s — well, using it in teaching, you know, and sometimes I have used it talking in schools, you know, you go meet students and show them something, like, here are some fun and some beautiful things. But no, also I was teaching history of mathematics for many years, too. And I loved that Desargues himself, he never published his theorem. It was it was published by his student, Abraham Bosse. And I think he mentions exactly that Desargues had this three-dimensional proof. But also there was an interesting thing: When Desargues — he belonged to Mersenne’s circle circle, and that is the same circle where there were also Descartes and Pascal. And there was all this mathematical writing and just that exchanging of ideas, so that's fun. I was trying to find out, I know there was a some, in discrete mathematics, there is this 10-line configuration, and then that can be used to solve some problem. And I remember there was some sports problem, but I didn't remember like, you know, just precisely what. It’s interesting.

And then the other thing which I like, about this, not only this perspective, but that you can exchange points with lines and lines with points.

EL: Yeah.

DT: Yeah, so in some ways, maybe this is why I was getting more interested in mathematics, like what's beyond what we learned in school. This was this was like, I guess a very first example that I found that is something more about math, you know, more fun than you'll learn in school — which I wouldn't say that I was bored, but still, that there was something more.

EL: Yeah, well, and you mentioned exchanging points for lines, which, I always feel like I've sort of pulled one over on someone if you could do that kind of duality thing. And you know, move intersections of lines to a different line, and then the points intersect at where the lines were, something like that, and so yeah, that's always very satisfying, I think. So part of this podcast is that we ask our guests to pair their theorem with something the way you might pair food and wine or food and your favorite jazz CD or something like that. I’m not appealing to the youths if I say CDs. I don't know if Gen Z knows what that is.

DT: Yeah, it's like floppy disks.

KK: You have to say vinyl now.

EL: Or Spotify. But anyway, what have you chosen to pair with this theorem?

DT: With travel.

KK: Okay, yeah.

DT: So for me like it is exactly because you can change these points and lines. And then if we go back to that, what I was talking about ,projecting the triangle through that one point. And that's what I was imagining if I was that point, and then I'm looking on someplace on this first triangle. but when I travel, it really expands what I'm seeing when I get to that second triangle and see it in reality, and then I can go back. And that would be like, exchanging, so that would be this duality. From that place, now I can see myself differently.

EL: Oh, I love that.

KK: This is a very thoughtful pairing.

EL: Yeah. And where are some of your favorite places that you've traveled?

DT: Well, there are places like, I always like to travel to Sicily. So this is a very, very significant place for me, because that's where I met my husband, and then we had returned back there, and it's never too much to go back there. So I liked that, well, we managed to travel, and I liked my travel to South Africa. And actually, what I like in my travels is to meet people. And I think that's what those those big triangles when you project is, you meet the people and you talk with people, and I don't travel like without some purpose. And mostly it can be like really meeting people and doing some workshop or talk, and then of course learning about the place where I am.

EL: Yeah. And I always love how you learn both that the way you're used to doing things isn't the only way to do things, and that there are similarities across cultures, that we're all kind of the same in some way. So they're kind of those two contrasting ideas, but maybe they're dualistic in some way as well.

DT: Yeah, it’s like one of the things, since I was in Europe, and I have been knitting a lot. And I come here, and I see that there is another way of knitting, and I'm just staring and it’s just so totally different. But at the end, well, we get we get to same thing.

EL: Yeah, well, and since you bring that up, I did want to mention, as you said, you might be best known in the math community for your hyperbolic crocheting. And I know that Desargues’s theorem is from Euclidean geometry, not hyperbolic. But I would love to talk a little bit about kind of where hyperbolic crochet came from and how you got the idea to do that. Everyone loves it.

DT: No, I'm glad. It's just because I had to teach hyperbolic geometry, and, well, it happened. It's like this. So it’s summer, so in a month, it's 25 years since I crocheted my very first plane. And I'm really surprised people are still interested in that. And then it's kind of now a usual thing. It’s also like with Desargues’s theorem, you go into 3-d and then the hyperbolic plane, you can see only in 3d, because if you if you project then those are maps, like on in 2-d, but in 3-d and then particularly, you can just touch it. And you can do a tactile exploration. My main purpose was exactly for my students, so that they could touch and explore it. Because I saw a paper model, which was done, but one thing is to glue a paper model, which I did, but then once you fold it, for the next class, you have to do it again. And it was like, okay, no, I need something more durable. Yeah, so it was really for teaching. And then it's interesting that this hyperbolic plane started to teach me. When I got suddenly, unexpectedly for me, invited for the first art show, you know, now I had to learn, okay, what does that mean? So finding colors and ways to express, so and it has been going on and on.

KK: So, my wife actually crocheted me one once. So she, she can crochet really well, and it is remarkable to hold that thing in your hand. You can sort of begin to really understand how distances work in this weird, floppy, hyperbolic plane. It's really beautiful.

DT: Yeah, because it's another way to get our knowledge, because we need to feel it. It's not like when you are reading — well, okay, if you are an experienced cook, you can read a cookbook and taste a recipe, you know, like field tasting. But actually the best is that you try to cook it, and then you taste and then, you know, like, that's when you really learned about it.

EL: Yeah, and I think in my experience making hyperbolic crocheted planes, one of the the lessons, the math lessons I learned the most from it is just exponential growth is even more than you think. Because I think the first one I made, I started with something like 10 stitches, and I did it, maybe it was a five to four increase ratio. And, you know, five or six rows down, I was like, am I ever going to finish this row? Even as, you know, five to four to me, it doesn't seem like a big number. Like it's just barely above one. But if you, you know, multiply it by itself a few times, it takes a while.

DT: My hope is when the pandemic started, and then people were told that this virus is spreading exponentially, I hope that at least those who had crocheted hyperbolic plane instantly knew what it is what it means.

EL: Yeah.

KK: And then, of course, this also spawned this whole, like hyperbolic crochet reefs that they would do. So our librarians here actually organized an exhibition, they put it in the this display window in the front of the library. They got people to crochet coral, but it's still the same basic thing that you you came up with.

DT: well, it just it came like that, it all came up. So yes, it's actually that came up when — that was from my very first lecture to the general audience. And I was just thinking, Okay, well, one thing is to show the mathematical object, but then I need something, you know, in real life, too. And I remember that before that, first off, that's when I really was finding, like, lettuce leaves. And it was finding like, some curly things, and that gave an idea to see, you know, like, okay, here we go. It’s in a nature and then that just span us by not just the spin off. Idea. Yeah.

EL: Yeah. And I have to put in an advertisement for your book. Is it Crocheting Adventures in the hyperbolic plane? Is that the title?

DT: With.

EL: With hyperbolic planes.

DT: Crocheting Adventures with Hyperbolic Planes. Yes. And then there is another one, Experiencing Geometry, 4thedition, is open source. And there are a lot of hyperbolic planes in that one, too. It's on Project Euclid. And yeah, that’s open source. That was my husband's wish, that it would be open source. So that's — when I finished this fourth edition, that’s it.

EL: Yeah, and I just can't recommend — I haven't looked, I think I've looked at Experiencing Geometry, but not spent as much time with it as the crocheting one because around the time I, you know, a friend gave me a little crochet kit (not because of math at all, just because like, Oh, you like crafty things, you might like this), I happened to see your book. So it’s, like, this confluence, and your book has more than just making a plane. There are a lot of other interesting math ideas that you put in there. So I just can't can't recommend it enough. And it won an award for weirdest title, didn't it?

DT: Yeah, yes. Well, of course, that that's when — it was the strangest book title, the Diagram Prize — that went around the world. Of course, two years later, when I got an Euler Prize, which is much more serious, from the Mathematical Association of America, that press wasn't interested at all.

EL: Yeah, you know, the strangest title, I guess is a little little more headline-grabbing or something like that. But yeah, yeah. Anyway, I know we sort of went on a diversion from triangles, but I'm glad we got to talk about the hyperbolic crochet a bit because really, I think, so many people have had positive experiences with math and with experiencing geometry in a different way than just looking at a flat on a piece of paper thanks to you.

DT: Thank you.

EL: So, we've plugged your book, but we do like to give our guests a chance to share anything else that they'd like to share, other resources or websites or anything like that for people to, to look at?

DT: Well, when the book came out, I started to write a blog which is called hyperbolic-crochet.blogspot.com. But I'm not very good at keeping it up, so I’m not sure how many people are reading.

KK: Is anybody?

DT: But there is still lots of material and trying to answer a set of questions. And then of course, as I said, on the Project Euclid forum, it's on Project Euclid, look for Experiencing Geometry. So that is my newest book, which I’ve finished. And yeah, so as I said, a lot of interesting geometric things, too. If you are interested in geometry, that would be a good thing to look up, particularly for teachers, because I added one of the appendices, suggestions from various geometry projects, which you can do in class. Because those were questions people were sending me, like, okay, so what can we do in class and what can be some fun things we can do? So yes, I was trying to help. I hope it's helpful.

EL: Yeah. Wonderful.

KK: All right.

EL: Well, thank you so much for joining us. I was really glad to get to talk with you.

DT: Okay, thank you.

[outro]

On this episode of My Favorite Theorem, we were pleased to talk with Daina Taimina, recently retired from Cornell University, about Desargues's theorem. Here are some links you might find interesting after you listen.

Her website, blog, and Twitter account
Desargues's theorem on Wikipedia
Our episode with Annalisa Crannell, who also loves Desargues's theorem
Taimina's book Crocheting Adventures with Hyperbolic Planes, which won the Diagram Prize for oddest book title and the Euler Prize from the Mathematical Association of America
Experiencing Geometry by Taimina and David Henderson on Project Euclid

Evelyn Lamb: Hello, and welcome to My Favorite Theorem, the math podcast with no quiz at the end. I'm Evelyn lamb, one of your hosts. I'm a freelance math and science writer in Salt Lake City, Utah, currently enjoying very beautiful spring mountains, which my guest and my cohost can see behind me in my Zoom background. And this is my co host.

Kevin Knudson: Hi, I’m Kevin Knudson, professor of mathematics at the University of Florida. My wife and I are off to California this weekend. So, you know, she's she's a book artist, and there's a there's a big biannual, every two years is biannual, right? Or is that semiannual?

EL: Maybe?

KK: Who knows?

EL: Biennial is also a word. Maybe they’re the same word? [Editor’s note: dictionary.com says biannual can mean the same thing as biennial (every two years) or semiannual (twice a year). The Oxford English Dictionary, on the other hand, says biannual means twice a year and biennial means every two years.]

KK: Every two years. Except that this two years is this two years is three years, because two years ago was, well, anyway.

EL: Right.

KK: So yeah, so it's called CODEX, and she is exhibiting there, and I am tagging along because I like Berkeley.

EL: Fun!

KK: And we're going to do stupid things like spend too much for a meal at Chez Panisse.

EL: That sounds great.

KK: Yeah, we're really looking forward to it. So anyway, but let's talk math.

EL: Yes. And we are excited today to be talking with Tien Chih. Tien, would you like to introduce yourself?

Tien Chih: Hi, my name is Tien Chih, and I'm currently an assistant professor of mathematics at Montana State University Billings, which is a comprehensive teaching school in the middle of Montana. But later on this fall, I will be joining the faculty of Oxford College at Emory University. Oxford is college separate from the main campus of Emory that's a small liberal arts spin off, so students can do a small liberal arts experience with the first two years of their undergraduate degree at Emory and then go to the main campus to finish, so I'm really excited for that.

KK: Yeah. And that's that that's a little bit outside of town, right? So Emory itself is in Decatur, correct? And the Oxford College is where? I know it's not right there.

TC: Oxford, Georgia, about a half hour or 45 minutes or so east, I think.

KK: Okay. Nice.

EL: Yeah. Well, I am excited that we got you while you're still in Montana, because I just love having guests who are also in the Mountain Time Zone because that they don't think I'm, you know, a layabout because I never want to do anything before 11am.

KK: This is a common problem we have.

EL: Yeah, I am excited, I'll be going to Glacier, or I'm working on planning a trip to Glacier National Park for this summer, which I know isn't actually that close to Billings, because Montana is enormous. But I think it will be very beautiful. Some of the pictures that you post sometimes are really beautiful with the scenery up there in Montana. I'm sure, maybe you're a little behind us on the spring timeline, but similar mountain beauty.

TC: Yeah, I went to graduate school, actually at the University of Montana in Missoula, which is much closer to Glacier. So while I was a grad student I managed to go up there a couple of times, and you're in for a really good time this summer.

EL: Yeah, I'm excited.

KK: Excellent.

EL: Yeah, well, let's dive into the math. What math would you like to talk about today?

TC: Okay, so my favorite theorem is not exactly a theorem, or is a theorem, depending on your point of view. But my favorite math concept that I'm going to talk about today is mathematical induction. There are a couple of reasons why I chose this. One is that I am a combinatorialist/graph theorist. In our field, we don't have a lot of big foundational theorems or theories. In our line of research, we tend not to build skyscrapers, we tend to sprawl. And so because of that there aren't like these big foundation things, so it's hard to point at, like, one theorem and say this is a key theorem in our discipline, but the idea of induction is always present in our work, and especially in my work. Another reason I like induction is because I do a lot of math outreach kind of things. I'm involved in the Math Circle community quite heavily. I run a student circle here at MSU Billings. And mathematical induction is one of those things that almost all students, even children, intuitively understand. The actual mechanisms and formal logic, of course, is not something most people are familiar with. But this idea of if you have something that's true, and you know, you can do this thing, and it's still true, that this means that it just keeps being true, that’s something that students inherently just grasp right away, especially if you compare it with visuals. So I think there's a lot of concepts in math that are like this, that are technically kind of difficult results to articulate, but intuitively, everyone already understands them to some extent.

KK: Right.

EL: Yeah. And you mentioned visuals. So what are some of the visuals you might use to describe induction?

TC: So one of the classic induction proofs that you would give as an example or an exercise in an intro to proofs class is the proof that the sum of the first n odds is n squared. And very often with as presented, that's done with the usual algebra, and the flip, and then the 2k+1 and all of that. But you can easily show that if you take a square, and you take a two by two square, you have to draw a one by one by one extra L around the original square to get the two by two square. And then you get the three by three square by drawing a two by two by one L around the two by two square. And then you just say, Okay, you keep doing that, right. And most students or people without formal mathematical training will recognize, oh yeah, that just keeps happening. But the “keeps happening” is induction, right? That's what we don't say out loud, but that's inherently in this reasoning.

KK: That’s a good visual, because as you say, the algebra — I mean, so when we teach our sort of intro to proofs course, this is where students really get their first taste of induction. And I think it's kind of cold, right? So you say, okay, yeah, so it works for the base case: check. You know, so 1=1. All right, we understand that. And then you say, assume it's true for k and then show it's true for k+1. And I think students learn this mechanically, but I'm never sure that they really grasp what's going on.

EL: Yeah, well, and you if you've learned it by manipulating, you know, like k+1, and, you know, multiply that out to square it or something, that sometimes does remove you from actually thinking about the concepts. I mean, it's an important way to be able to work, but if you have pennies that you're arranging on a desk, or cards, or something in a square, that can be a lot more like, yeah, look what's happening. Here's the next odd number, here we go. Yeah. So just maybe to back up for a moment. Maybe we should actually, state, you know, what induction is? Because it is I mean, it as you said, it's an idea that a lot of people will intuitively feel is correct, but might not have have actually seen as you know, this like packaged, you know, with a little definition bow on the top kind of thing.

TC: Right. So the idea of induction is you need two prerequisites. One is a statement, at least one typically integer value for which that statement is true. So you have a statement, let's say capital P, at an integer k, and we verify that P(k) is true. And then we couple that with an argument that shows that anytime something is true for, say, an n, it must also be true for n+1. So P(n) implies P(n+1), then starting at k, the statement is true for all n greater than or equal to k, so for k and then k+1, and then the implication gives you k+2, and so on. And then you keep going.

KK: And so the visual that I sometimes use with students is you know, it's imagine you have an infinite line of dominoes. If you knock down the first one, they're all going to fall down, right? Which isn't exactly correct, but it's a reasonable visual.

EL: There’s this TV show — not to derail totally, but I'm about to — I think, I don't remember if it's called Domino Wars, or Domino Masters, or something like that it [Editor’s note: It is called Domino Masters, and mathematician Danica McKellar is one of the hosts]. We were in a hotel room flipping through channels, and we saw this and they make these domino things, and in fact, sometimes not all the dominoes fall down when you push the first domino because there's some sort of problem in the the domino line of implications there. But in mathematics, the dominoes are all set up at you know, just the right distance or angle that they do fall down.

KK: Ideal dominoes, right?

EL: Yes.

TC: Although sometimes the dominoes, you can find arguments that that end up skipping a step in some of the dominoes. And so I don't know if you've ever seen these induction, like non-proofs. But I give this one as a challenge to my discrete math students: All cows have the same color.

KK: Yes.

TC: Yes.

EL: I don't think I — so this sounds familiar, but I don't remember what it is.

KK: Well, I’ll let Tien tell us, but I have a story about this. So when I was an undergrad at Virginia Tech and MAA members almost universally heard of Bud Brown, who was very well-known among the MAA community and really entertaining and won the Polya award several times for the things he wrote. And this was his standard joke about induction. He used horses instead of cows. But yeah, let us let us hear the theorem that all cows are the same color.

TC: So let's prove via induction that all cows are the same color. So we start with a base case, n=1, and we say, all right, if we have one cow it’s the same color as itself, ergo for a size of set n=1, all cows are the same color. And then, all right, we assume that it’s true for a set of size k and say, all right, so let's take a set of k+1 cows. Well, by induction, we know the first k cows are the same color. And by induction, we also know the last k cows have the same color. And so ergo the k−1 cows in the overlap, they're also the same color. And more importantly, the first cow has to be the same color as the k−1. The last cow must also be the same color as the k−1. So all k+1 cows are the same color, right?

EL: Yeah. Convinced me.

KK: Sure.

EL: We only see one color of cow.

KK: Right? But you know, for Bud’s joke, it was somehow he made this work where it's like, well, that's a horse of a different color. And now the trick, of course, is to get your students to understand why that proof doesn't work. Because it seems convincing. Right?

TC: Yes.

KK: It feels pretty good. So why don't you explain to our readers why it doesn't work.

TC: So it is a true statement at a certain point that this first cow — in a sense, a true statement that the first call has to be the same color as the middle k−1, as does the last cow. But of course, if k is 1 as in the base case, then that’s zero cows, so it's vacuously true. So the first and the second cow are not not the same color as the middle k−1. But that’s not useful information. So this is what what pops into my — visually, how I interpret this, is as that missing domino, right? We actually took away the second domino, right, the n=2 case, and so because that domino is missing, that induction obviously does not carry through and we have more than one color of cow on this planet.

KK: Yeah. And what's fun about induction is you never stop using it. So you know, you're a combinatorialist, you're clearly going to use it all the time. I'm teaching graduate algebraic topology this term and just maybe two weeks ago, I used induction. I was computing the cohomology of the Eilenberg-MacLane spaces of type K(Z,n). And it's a double induction, because you know case 1 and so you pull yourself from something odd to something even. And then it's a different argument for something even to something odd. So, it just never stops.

EL: So I guess I'm going to betray my naivety about like what combinatorialists do, but as a combinatorialist are you kind of mostly using like the regular induction, not transfinite or you know, some spicier flavor of induction. I don't know, do you have to induction — I’m even forgetting, there are a few different ones that you know go for, like different types of sets. So rather than the integers, you can do induction on real numbers, right, if you set things up right. But are you basically just doing it on the integers mostly? That's the only place I would want to do it.

TC: Yeah. Don't feel bad if you don't know what combinatorialists are doing. Most of us don't know what each other are doing. Right? Again, the sprawl that we talked about. Yes. So in my case, I try not to even deal with infinite things that aren't countable. I have to for some of my constructions, but I would prefer not to have to do anything uncountable. And so yeah, I'm only doing, me in particular, I'm only doing induction on integers. I'm certain if you define graphs on uncountable sets, or this sort of thing, then it would make sense possibly to invoke Zorn's lemma or those other kinds of induction-ish things, but that's not what I do.

EL: So well, the base version is powerful enough, I mean, I don't want to besmirch the fine name of induction. So you know, of course, this is important in your work. My big experience, really learning about induction in my first heavy-duty proofs class in college was a transformative moment, for me, in really being able to work with axioms and stuff. So it's also really important to me, maybe from a pedagogical — I mean, I was the one being pedagog’d at — but, you know, from a pedagogical point of view, I think it is also really important. Do you find that too? Is this a really important moment for your students?

TC: I think so. I think — again, like I said, the idea of induction is something that’s inherent in us, I think, but it's like this idea that you're able to keep doing something. And so when I cover induction, I kind of also use it as maybe one of the first examples where you try to you try to formalize what your intuition told you to do anyway. And there is often a tendency I notice when teaching entrance to proofs type classes that because the idea of writing proofs is such a new thing, that somehow, it's totally like — when they write these proofs, they want to use a lot of jargon, and symbols and theorems maybe that they learn. And it sometimes can get away from their actual understanding of what it is they're trying to prove. So when we start with induction, it’s like, look, you tell me why this is true without trying to prove it, just tell me why it's true. And our goal is to turn that into math, and then also clean up any loose bits or cases or whatever, along the way. But that's really what we're trying to do. So if we're trying to improve that, you know, again, the sum of the first n odds is n squared. It's like, all right, why is that? Tell me why I keep adding these rows, and it still keeps being a square. Okay, now what we need to do is just make that concrete. And that's such an important skill throughout, right, because you can't reasonably prove anything unless you have some idea of why this thing might be true. And then all we're trying to do with the formal writing is just say that. Say exactly what you're thinking, but very, very, very, very carefully.

KK: Yeah. So another thing we like to do on this podcast is ask our guests to pair their theorem with something. So what pairs well with induction?

TC: Let’s see if there's a couple of different pairings I could go with.

KK: You’re allowed more than one.

TC: Okay, sure.

EL: And if you have one, and then you have n of them, you're allowed to have n+1 of them.

TC: I don't think I want to go through the gamut of naturals. So when I first learned induction, I was an undergraduate, and I think I was drinking a lot of whiskey at the time.

KK: That sounds illegal, but we’ll allow it.

TC: And so that's one possible pairing. In the math outreach stuff that I do, back when we used to have it in person, I would often buy little granola bars and little single-serving bags of chips for the students to snack on while we're working on this stuff. And so that's a pairing I would give for working with induction with middle school students, which is the target audience for our circle here. And then, in my current work now as a grownup mathematician, I am making a lot of homemade noodles recently. And I’ve been really enjoying them. And so maybe that's what I would pair for for the induction that I'm doing right now in my own stuff.

EL: I like that. I mean, I would like to try your homemade noodles also. That’s always a lot of work, I think, to to make those at home. But yeah, I like the potato chips idea a lot too. Because, of course, there's the Lay's slogan. I don't know if it's still in their branding, “You can't eat just one.”

KK: Yep.

EL: Which works really well. Plus, for me personally, every potato chip tastes like one more potato chip.

KK: That’s right. Yeah, it truly is. You have wide and then you have to have another one. Forever.

EL: Yeah, but noodles. Noodles, I think are good too. Because, like, it’s hard to count the number of noodles there are. Plus delicious. Is there a noodle dish that isn’t delicious?

KK: What do you do with your noodles? How do you prepare them?

TC: So far I've stir-fried them and I've also made a beef noodle soup with them. Which are both excellent. And they're actually much easier to make than I would have thought.

KK: Do you have one of those pasta maker things where you crank them out? Or?

TC: No, I just roll them into a rectangular-ish sheet. And then I just dust it and fold it up and then

KK: You just cut it?

TC: Cut it with a knife.

KK: Okay, excellent.

TC: Yeah. So they come out a little thick, but I do prefer it that way anyway, so that works for me.

KK: All right. So I think Evelyn I already looking up flights to Billings.

EL: I’ll just drive. Yeah, I could be there—

KK: You’ll “just” drive? I mean, look.

EL: I'll be there in eight hours. I don't know how long it is from where I am.

KK: It’s got to be more than that.

TC: I’m closer to one of you now, but in a few months, I will be closer to the other one.

KK: That’s right. It’s like five hour to Atlanta.

EL: Yeah, well, this has been great. I really glad that we've we got to talk about induction which really has deserved an episode of My Favorite Theorem for quite a while. Would you like to let people know how to find you online or any anything you're involved in that you'd like to plug to make sure people know about it, anything like that?

TC: You can find me on Twitter at @TienChihMath.

EL: We’ll include a link to that.

TC: As you both know, I am a co-organizer for the online seminar Talk Math With Your Friends, which has collaborated with this podcast previously in the past for a live taping. And I don't have too much going on right now. Again, I'm in that very odd phase where I'm in between things, but I am very involved, like I said, in math outreach, in teaching, undergraduate research, that sort of thing, a very teaching-focused kind of career. And so I'm certain that I will have things along those lines happening soon in the future, once I get settled at my new position, so I'm really looking forward to all that.

KK: Alright, sounds great. Well, Tien, thanks for joining us.

TC: Thank you for having me. It was a blast.

[outro]

In this episode, we talked with Tien Chih, who will soon be starting a position at Emory University's Oxford College, about mathematical induction. Here are some links you might enjoy with the episode.
Chih's website and Twitter profile
Talk Math With Your Friends, the online math colloquium series he co-organizes (and with which My Favorite Theorem has collaborated!)
A wikipedia page dedicated to the proof by induction of the statement that all horses are the same color
Domino Masters, a TV show about dominoes

Kevin Knudson: Welcome to my favorite theorem, a math podcast with no quiz at the end. I'm Kevin Knudson, professor of mathematics at the University of Florida, and I am joined by your other co-host person.

Evelyn Lamb: Hi, I am Evelyn Lamb, a freelance math and science writer in Salt Lake City, Utah. And I was actually thinking we should have a quiz at the end of this one.

KK: We really should.

EL: It’s just so jam-packed. There's gonna be so many different things floating around. So, like, be prepared…actually don't because we haven't prepared a quiz for you, so we don’t want you to be disappointed.

KK: I’ll start writing the quiz now. Yeah, today we have an interesting new experiment that we're going to try. So Mike Krebs from Cal State University in Los Angeles reached out to us with an idea. Mike, why don't you just introduce yourself and explain?

Mike Krebs: Hi, my name is Mike Krebs. I'm a professor of mathematics at California State University Los Angeles. Graduation is tomorrow, and I think our students have had enough of quizzes, so thank you for passing on the quiz. Yeah, I listen to a lot of podcasts, and my origin story of finding your podcast is sometimes to find a new one, I will go to Wikipedia and click the “random article” button, and then whatever comes up, search to find a podcast on that.

KK: Okay.

MK: I found various things that way like the story of Sylvia Weiner, an octogenarian marathon runner, and so on and so forth. And then one time, I clicked “random article,” and up came a page on differential geometry of surfaces.

KK: Okay.

MK: And one Google Search later, I started screaming at my laptop, “There’s a podcast called My Favorite Theorem!” So, yeah, I discovered that at the time I was teaching, this past semester, a capstone course for our math majors, in which students select a topic and then have to write about it and present about it. And I said, “Oh, I wonder if the good folks at my favorite theorem would be interested in doing something like that with students.” So I recruited some students from that class, as well as a bunch of other students from our university. And here we are now.

KK: All right.

EL: That’s amazing. And so you're mostly graduating seniors about to graduate and you're spending the morning before your graduation with us? I feel so honored.

KK: I really do. This is something else. Yeah.

EL: Well, let's get to it.

KK: We have nine students. And so as Mike pointed out, there are nine factorial or 362,880 possibilities here. And we have chosen one of those orders.

EL: Yes. You know, if you so choose, you can always divide this into tracks and listen to them in every possible order and then get back to us and tell us what the optimal order would have been. But for now, it's the order in which they appeared on my Zoom screen. So our first guest today is Pablo Martinez Gutierrez. Great to have you. Would you like to say a little bit about yourself and let us know your favorite theorem?

Pablo Martinez Gutierrez: Hi, thank you for having me on the show. Yes, I'm Pablo. I'm currently a math undergraduate at Cal State LA, hoping to complete my Bachelor's, not this semester, but hopefully next fall next semester. And my favorite theorem that I'm covering for today is Euler’s formula and Euler’s identity. It's something that I got exposed to back in Professor Krebs’s class when I took his class for differential equations. He was teaching us about second order linear homogeneous differential equations. And in one class session, he introduced the topic of Euler’s formula and identity as a side gem. And I was like, “Oh my goodness, this thing is so incredibly beautiful.” The way that I learned it in his class was he introduced the mathematical expression ex as a Taylor series, and he expanded it out as a series. And then when plugging in eix, then you spat out that series and because of the i, something interesting happens where it starts to be, you could split it up into two individual, or two smaller series, so to speak, of cosine, and i sine x. So you would have the expression eix equal to cosine x plus i sine x. And that to me just seemed that for me, it was like I was gobsmacked. It was just baffling. It was incredible.

EL: Yeah, everything just falls out after that, right?

PMG: Yeah, you're seeing all these terms that come from math, you have e, that comes from compounded interest back when you're learning about it in algebra, you have sine and cosine, that are coming in from the unit circle and trig. And then you have i from complex numbers. So all those just coming in together is is like mind-boggling, right? And then if that wasn't amazing in and of itself, something interesting and amazing, even more amazing, happens when you plug in π for x, right? So you have eiπ is equal to cosine π plus i sine π. And so the cosine π just becomes negative one. And the i sine π becomes zero, which just goes away. So then you have eiπ equal to negative one. And then if you add one to both sides, you get eiπ+1 is equal to zero. And that's just — when I saw it, I was in awe. And I was just like, how do these things align and assemble so beautifully and neatly and concisely? It doesn't seem like, it seems crazy that it would happen that way.

EL: I have an unpopular, or possibly controversial opinion about this, which is, it's cooler to leave it with the minus one on the other side, instead of doing the plus one equals zero. Don't cancel me for my controversial Euler formula takes, but I’ve just got to put that out there.

KK: My favorite part about complex exponentials like this is that you can forget all of those sum formulas, right? Like, if you want to know the cosine of three theta, you just use the complex exponential. It makes your life so much simpler. So that's my fun thing. Okay, this is a really beautiful fact. So what have you chosen to pair with this fact?

PMG: So my pairing for this formula and identity is this. I don't know if anyone's seen the Stephen Hawking movie Theory of Everything. The ending scene of that movie has this musical score that I like to listen to, that evokes a similar feeling of elegance and beauty, and awe about the universe, which is the same feeling I get from this identity and formula. It's called the Arrival of the Birds by the Cinematic Orchestra and the London Metropolitan Orchestra. You can give it a listen on YouTube. And any you as you listen to it, it elicits that feeling of awe.

EL: Yeah, listen to it while you do some complex integrals, maybe. I like it. Yeah. Thank you.

KK: All right.

PMG: Thank you.

EL: Yes, well, the bar has been set high. But yeah, we will see — no, I won’t pit anyone against each other. Our next guest is Holly Kim. So yes, Holly, if you'd like to tell us about yourself, and tell us your favorite theorem.

Holly Kim: Hi. So my name is Holly. And I'm currently a grad student at Cal State Los Angeles. And I'm not graduating this semester, so I still have about, like a year or year and a half before I graduate. But I'm happy to be here. So thank you for having me on the show as well.

KK: Absolutely.

HK: My favorite theorem is currently Ore’s theorem from graph theory, which states that for a given graph that’s simple and finite, and for two vertices that are distinct and non-adjacent, if the sum of the degrees of those two vertices is greater than or equal to the total number of vertices of your graph, then the graph is Hamiltonian, meaning you can find a Hamiltonian cycle, meaning you can find a spanning cycle that reaches every vertex once it's in the graph. So that one is my favorite. And it's interesting because I was not a math person when I got my bachelor's. So when I took my first proof-based course, the professor quickly mentioned Hamiltonian graphs. And I had not seen graph theory, I think in that form, at least, ever. So it was really interesting at that time. And he had made a joke about like, “It's not the Hamilton that they made the musical about.” And around that time, I thought that was so funny because I was also listening to Hamilton the musical, or had started listening to it, even though it had been out for a while by the time I'd taken that course. But it just sort of stuck with me, and I thought Hamiltonian graphs, and Hamilton the musical, they’re just sort of like, every time I thought about it, I thought, oh, how fun and how interesting and how funny Hamiltonian graphs are. And then what makes them even more interesting is that unlike Eulerian graphs, where you can tell a graph is Eulerian quickly by looking at the — you know, it's if and only if every vertex has an even degree. So then you know that graph is definitely learning. The Hamiltonian graphs don't have sort of a defining characteristic, like Eulerian graphs. So Hamiltonian graphs are sort of elusive, like there are some theorems that will work for certain families, or types of graphs, but nothing that quite, I think, captures, yes, for sure every graph — or this graph is Hamiltonian if and only if these conditions are satisfied. So it's not been discovered or found out yet. So that's my current favorite theorem.

KK: I don't know this theorem. So this is sort of interesting, right? So it basically says that if you have two vertices in the graph that have enough edges out of them, basically, you're guaranteed a Hamiltonian cycle. That's just, that's pretty remarkable, actually.

HK: Yeah, and the proof has like a funny — it's like a proof by contradiction, but there are certain edges, like you cannot have, as you construct this proof, otherwise, you will end up having a Hamiltonian cycle. So it's like, you’ve got to have just enough, but not too many, or where you actually end up with another, like a Hamiltonian cycle kind of embedded in, in your graph. And so it's very fun. The converse is of course not true. You can see, the other direction would not.

EL: I'm sitting here trying to doodle myself a graph and see, but I think I think I need to do it a little bigger graph, because there weren't enough vertices in this one. And I can't doodle and talk at the same time.

KK: I can’t either. What’s that about?

EL: So yeah, no multitasking for me.

KK: So what pairs well, with this theorem?

HK: Well, it might be on the nose, but I'm going to do it anyway. I paired it with Hamilton the musical. And I've mentioned it before, but beyond just, it being a good soundtrack to listen to with just about everything, I thought, well, certainly, there must be a deeper connection I can draw between the musical and Hamiltonian graphs. And if you listen to the musical, a motif of it is that oh, Alexander Hamilton is just like never satisfied in terms of his goals and ambitions always wants to do more. And he's never at a point where he's like, Oh, I'm, I'm good. And I don't need to keep going. Just based on the musical. And I kind of thought that Hamiltonian graphs, they aren’t personifications of Alexander Hamilton, but that you know, there is nothing that quite satisfies them at this time, or at least as a whole, like Hamiltonian graphs as a whole. So, there is nothing that that would satisfy like, oh yeah, for sure, I am a Hamiltonian graph if these conditions are met. And so that was my connection. And if you want to go further, that symbol, like the iconic logo of Hamilton, or the Hamiltonian graph of Hamilton the musical, there is a star, which is isomorphic to a C5, a five-cycle, so my pairing was Hamilton the musical.

EL: I like that. Well, just in case you have not seen it, there is an excellent parody of it. (singing) William Rowan Hamilton (end singing) of the the Alexander Hamilton song, done by, I'm forgetting the name of the YouTube channel [Editor’s note: it’s A Cappella Science]. I think it's it's run by a guy called Tim Blais, B-L-A-I-S. So, yeah, check that out. I was actually, I was trying to write a parody, I just would always get in my head that (singing) William Rowan Hamilton (end singing).

HK: That’s so funny.

EL: Then I discovered some other person did it already. But they've got a bunch of people coming in. They've got, like, someone playing Emmy Noether, and a few other math contemporaries. So yes, definitely check that out. We'll include a link to that in the show notes. Yes, excellent. We're doing great here.

KK: Yeah. Who’s next?

EL: So thank you, Holly. Bryce Van Ross, welcome to the podcast!

BVR: Hi, thanks for having me. Excited to be here. I guess I'll introduce myself.

EL: Yes, please do.

BVR: My name is Bryce. Come tomorrow, I'll be a master's graduate in math from Cal State LA. So I'm pretty excited about that.

KK: Congratulations!

BVR: Thank you. Yeah, so the theorem today, I like learning a lot and learning new things. So in the process of choosing a theorem was like, find something new. I found the Hales–Jewett theorem, I believe that's how it's pronounced. The general idea is it's a combinatorial theorem, usually applied to game theory, and you start off with two positive integers, N and C. N would correspond to, for example, like a grid, right, like how many columns or how many rows you have in a grid, and C would correspond to the amount of players alternating in some game. So, the Hales–Jewett Theorem states that for any two positive integers N and C, there will exist some H-dimensional cube corresponding to that N and C. So by cube I mean, like an N by N by N by N H-many times, grid. Now, more than that, that theorem says that corresponding to that cube, there has to exist some, at least one, row, column, or diagonal that is all of the same color, which is pretty impressive. Yeah. And a great way to conceptualize that is, for example, like generalizing the notion of Tic-Tac-Toe, where you have a bunch of like Tic-Tac-Toe, grids as faces of some very big cube. This theorem tells us that, at some point, you're going to find a very long line that's either a row, a column or a diagonal where someone wins, guaranteeing that also someone loses. So that's the theorem I picked.

KK: Wow, okay.

EL: Yeah, so what what kind of — so you gave the example of Tic-Tac-Toe. I must admit I'm fairly ignorant in game theory. It's like, I sort of get, I like the part where you're like, Oh, you've got an N-dimensional, or H-dimensional cube. It’s the part where it's actually the games, that’s why I don't know that much about game theory. Because like, I'm a little bored by my that kind of thing. So what other kinds of games can show up in this?

BVR: Yeah, I'm also unfamiliar with game theory, never even like read a book on game theory or taking a course, but from my understanding, you could extend it towards notions are familiar games like Connect 4, any turn-based game such that it requires somebody satisfying a line of something of the same color.

EL: I know Game Theorists always have these super tricksy ways of like, oh, yeah, a chess game you could just make into this or, you know, Nim you can represent by this or, you know, any game you want, whether it's like a real game, like chess, or a math game like Nim. Yeah. Sorry, hashtag not all math games. But yeah, that's interesting. So you just kind of stumbled on this theorem in a some sort of curiosity rabbit hole?

BVR: Lots of googling at 2am. And Wiki-ing at 2 am.

KK: That's what happens. This sort of reminds me of Sperner’s lemma, right, where you try to, if you're coloring the vertices, you start coloring vertices, then you have to get a triangle with all the same color vertices. I wonder if it's sort of related to that in some way. Or maybe — I'm a topologist, so I’m always trying to think of ways to just turn this into a topology question. It feels like it should be one. But anyway, yeah, all right, so this is a good theorem. What pairs with it well?

BVR: Yeah, so I was trying to think of something where audiences can very much relate to. I'm a big fan of games and media. And I think several people in the world last year, watched the show Squid Game. And season two is upcoming. So Squid Game that's my pairing. The reason why it's my pairing is not just because game is in the title there, but also because for those familiar having seen season one, at certain points in the game, I think it was with marbles or something, they were like, oh, make your own game using these marbles. And I was like, if I were to like change up and impose my own ideas of season two, what if a player gets to choose a game, any game and make it and compete against any number of players. I think that the Hales–Jewett theorem is ideal because everyone would be intimidated by a giant cube of Tic-Tac-Toe. But if you know the theorem, then technically you have an advantage because you know, hey, someone's got to win and ideally, it's you.

KK: Okay.

EL: I must admit, I am too much of a weenie to watch Squid Game.

KK: Yeah, I never watched it either.

EL: From just — from even the SNL sketch that was based on Squid Game, I was like, Nope, not gonna watch that one. It looks too scary for me.

KK: Yeah, my wife really doesn't like anything violent. So we're watching a couple of things right now that there is some violence and she has to you look away. It's just really pretty rough. But I know it’s very popular.

EL: Our very brave listeners, I think, will enjoy that pairing.

KK: Okay, excellent.

EL: Well thank you. Oh, and Bryce, I know that you wanted to share an exhibit that you've got up right now.

KK: That’s right.

BVR: Yeah. Yeah. So I really value, for example, like the themes of this podcast, to give an opportunity for people of any background to get a different perspective on math. And I like that for a variety of topics within STEM. So I work as a library archivist at Cal State LA, and I'm developing a STEM exhibit for all faculty, students, etc, to just visit and change their minds. So there are going to be interesting math related artifacts, as well as just unconventional things. You're going to see, like, dinosaur bones and whatnot. And it will be debuting in the fall. So just wanted to give a hype for anyone interested, they could reach out to Cal State LA Special Collections and Archives to find out more, and it'll be open for everyone.

EL: Awesome. Yeah. I hope our LA-based listeners will check that out.

KK: Sounds very cool.

EL: Okay, thank you, Alvin. Alvin Lew? Would you like to join us? Sorry, I don't want to introduce people differently. Yes, please introduce yourself and let us know about your favorite theorem.

Alvin Lew: Hello, everyone. I'm very glad to be here. I'm Alvin I'm currently a third-year computer science major and math minor. Not directly just in math, but I've been doing machine learning research and kind of being at the intersection of two different subjects there. And so today, I'd like to share not so much a theorem, but I guess the actual theorem is that the cardinality of the real numbers is greater than the cardinality of natural numbers. And specifically, I really, really enjoyed the proof of Cantor's diagonalization.

KK: Class.

AL: And so I don't know, has anyone played the game in elementary school where each person is trying to come up with a bigger number?

KK: Sure.

EL: Yeah.

AL: And then someone would play the trump card of infinity, you know.

EL: And then infinity plus one.

AL: But I think what people don't realize is that there are actually different levels of infinity. And I remember watching a TED Talk video back in middle school, and my mind was so blown by the fact that there could be an infinity greater than a different one. And so having taken a more formal class last semester, talking about Cantor's diagonalization, I think it's such a beautiful proof, because it's so easy for even non-math majors to understand. And it just goes something like: suppose you can list everything out so that you can match each natural number to a real number. And what you'll find is that the real number you can write out as an infinite decimal, so a number with infinite decimal places. And so you just write all of them out, you pair each of them up. And what you ended up doing is you take one of the digits from every single real number, and then you create a new number based on that by changing up all the digits, and you'll find a contradiction that you actually didn't list out that number. And so just that very simple idea there leads to actually quite a few paradoxes. I think there's like a Hilbert hotel paradox if anyone's heard of that, and some other ones, but something so simple like that, just one idea, and it opens the kind of, you know, mathematics world where there's different levels of infinity. And for a normal person who's not too involved in math, I think it's actually very interesting that it's accessible. It's a simple idea that anyone can go ahead and check out.

EL: Yeah, yeah, that such a great one. And I remember that is the one when I was in undergrad, when I saw that and finally understood it, it was it was one of those like, mind blown kind of moments for me, a very special place in my heart.

KK: Yeah, yeah. And then you want all these other weird things like, you know, like the cantor set is also uncountable. It's kind of the same argument. Yeah, it definitely blows blows everyone's mind the first time. And but the second time, sometimes too.

EL: I’ll just think about it every once in a while be like, is that really true? Do I just need to add that number to the list? And then I'll fix everything.

KK: Well, yeah, it doesn't. You can you can prove that too. But you know, I saw some Twitter thread the other day, that was always trying to argue that there's some models out there where the or the reals are countable, you know, like, you can change your rules and get different answers. But I don't like that. I like my real numbers to be what I think they are. Right? Although, who knows what they are really. Anyway.

EL: So what what is your pairing for?

AL: So I was really actually thinking quite hard about how to match some concept of infinity with real life. And so I think some people might have heard the analogy of, like, you put a box in a box in a box or whatever. And so to me, that's actually very hard to actually even imagine, right? Because in real life, you could never actually make an infinitely small box. It's not practical. Theoretically, it's possible. So what I was thinking is I pulled the old mathematician trick and pair it with alphabets. Because mathematicians, every time we struggle to match numbers to something, we just slap a variable. We take the Greek alphabet, we take everything. And in terms of uncountable and countable infinities, we actually take from the Hebrew alphabet, right, the Aleph and the Bet characters to represent the two different sets. And so I decided, you know, by pairing it with different languages, I figure, if we ever do come up with infinitely, or more more discoveries like that, we can just slap another letter on it and hope it pairs up. And we'll have a new method of explaining something without without the numbers with the more general letter from from a random alphabet.

EL: I like that. Yeah, I've seen, you know, the Latin alphabet, the Greek, Hebrew, and Cyrillic. But yeah, we need to just the next time when one of you comes up with with some new concept that just needs you know, Greek letters are not sufficient for the amazement of this, we need to start using other alphabet.

KK: Oh, yeah. How about like those Southeast Asian ones? Like the like the Thai alphabet? That’s really beautiful and completely different. Right?

EL: Yeah, we’ve got a lot of options.

KK: We do.

EL: New goal. I like it. Thank you, Alvin. Very good. Okay, next up, we have Judith Landau. Judith, please tell us about yourself and share your favorite theorem.

Judith Landau: Well, thank you for having me. My name is Judith Landau, thank you for introducing me. I'm also graduating as an undergrad in math tomorrow.

KK: Congratulations!

JL: Thank you. And I'll be moving on to an interdisciplinary biology program, as a Ph. D. program. And I've been doing some research modeling biological systems. So my favorite theorem is actually the fundamental theorem of Markov chains, which is from the field of probability theory and statistics. And I'm very interested in Markov chains, because they are a way of modeling systems based off of probability instead of deterministically. So instead of saying we know what's going to happen next, we're going to say it's based off of probability. Markov chains can be represented by a directed graph. So a set of vertices with edges that are directed pointing to a specific vertex in one direction or the other. The outgoing edges of each vertex are actually, the that's the probability — sorry, the random variable associated with that vertex. So each vertex has its own random variable, its own probability distribution that tells you how likely you are to go to any other vertex, and so in a very simple weather model for down here in Southern California where we could only might only consider sunny, rainy and cloudy days, no snowy days, those could be our three vertices or our three states. And we could talk about the probability of moving between them from day to day. And so the fundamental theorem of Markov chains can be stated in many different ways. There are long ways and short ways to state theorem. But the simple way to state it is that an aperiodic irreducible Markov chain has a stationary distribution. So an aperiodic Markov chain for our sunny rainy cloudy model would basically mean that the chain is set up so that there is no regular period for any of those states. So there is no regular period between the sunny days, cloudy days, or rainy days. And the irreducibility just means that there is some path, directed path, obviously, between every vertex in that directed graph for this Markov chain, so you're able to reach every vertex from any other in some number of steps. And the stationary distribution: basically, for the Markov chain, if I were to give you a longer version of the theorem, the longer version of a theorem says that the stationary distribution for the Markov chain is actually the long-term probabilities of ending up on any given state. So in my example, sunny, rainy and cloudy. My pairing, if I can move on to that, is actually in biology. It's kind of a pun, because my pairing is proteins. Proteins are actually chains themselves, they’re chains of amino acids. And so since there's this dependency going on in Markov chains, where the next day's weather is dependent on today's weather, and that's a really characteristic idea in Markov chains is that there's this dependency from one state to the next, proteins, the order of those amino acids, is dependent on a gene, because genes are what code for proteins.

KK: Okay.

EL: I love that pairing. That's very nice. It it kind of makes me wonder, like if — I do not know anything about biology, the last biology class I took was in, probably you weren’t born yet.

KK: Ninth grade.

EL: But it makes me wonder like, are there things where like, it's a little more likely that you'll have a tryptophan after a lysine, than something else?

JL: Yes, we actually study that in bioinformatics heavily, what amino acids are more likely to be next to each other and things?

EL: Oh, cool! I’d never thought about that. But it's kind of like, of course there's going to be some sort of tendency, because it would be extremely improbable that it would all be exactly equal all the time.

KK: Right.

JL: And according to our theories, in biology, it's all related to the structure of that protein and how that structure will affect the function of the protein. And that's why proteins evolve as they do.

EL: That is so cool. Well, thank you for sharing that theorem and that biology connection, and I'm so glad that you are going on to study this more.

KK: Yeah, that's very cool. Yeah. Good luck.

JL: You too.

EL: All right. Next up, we've got Kevin Alfaro. So yes, welcome. Please let us know about yourself. And I see that you've got the Golden Gate Bridge behind you in your Zoom background. Are you from the Bay Area?

Kevin Alfaro: No, it’s just my favorite bridge.

EL: It’s a good bridge.

KK: I mean, I've stood in that spot and taken that picture. I think I think a lot of us have, right?

KA: Yeah. Thank you for having me. It's a pleasure to be here. I'm Kevin and I'm majoring in math at Cal State Los Angeles. And for my theorem, it's actually Archimedes’ theorem on his approximation of pi. So I'm going to be taking us back a couple thousand years.

EL: Yeah, I love it. I love the variety.

KA: Yeah, I'm a big daydreamer. So this is all something I could daydream about all day. And so what he was trying to do, he was trying to approximate pi. And what he did was since it’s included using a circle, he placed the hexagon inside the circle. And this hexagon had already included the radius of the circle as one of its sides. And this is because the hexagon is made of six equilateral triangles. So each side ends up being the same, and each side also corresponds to the radius. So he uses this to calculate the circumference of the hexagon. And since it’s inside the circle, he knows it has to be smaller than the circumference of the circle. So he, he knows that the circumference of the hexagon is 6R since it's six radiuses each, each part of the triangles. So already has a bound on that. He knows that it has to be greater than 6R. So now what he does is a series of calculations to try to get a bound. He tries to squeeze pi in two hexagons, a hexagon outside of the circle and a hexagon inside of the circle. So he knows that that circle has to be between these two hexagons. But the way he does it is so so laborious. Yeah, so for the for each of these. So he starts with the first hexagon, right? And it's a six-piece hexagon. So he has to build that up each time, he has to create a longer hexagon that corresponds to the actual circle. So he has to cut up each arc in half. And he does that. So he cuts every one in half, and he creates a midpoint. So he has to do the Pythagorean theorem for each one. And yeah, so he's just doing it like every day. So if you guys have like, a couple of days of free time, you guys could do this yourself.

KK: And you didn't have algebra either, right? I mean, he didn't actually have algebra. So he was — and these numbers didn't even exist to him like square root of two or whatever.

EL: Yeah, it’s amazing. I’m trying to remember, is the last level, was it, like, a 96-gon, or a polygon with 96 sides or 100-something sides?

KK: I think that's how far he got. Yeah, yeah.

EL: And it's just like, I immediately give up on hearing that. And I've got a little calculator in my phone that I carry in my pocket all the time. And like, I've just like, I've noped right out of doing that. But yeah, it's amazing. Yeah. So is that called the method of exhaustion, which I think is perfectly named?

KA: Yeah.

EL: Yeah, it’s so amazing to think about 1000s of years ago, the people like like Archimedes, and other people like having, having the wherewithal, the persistence, to go through and be like, Well, I don't have a calculator, and I don't know what pi is yet, so I guess I'm just going to, you know, figure out the length of this 96-sided polygon. I don't have anything to do for the next week. So did you first encounter this theorem? Or this idea?

KA: I actually got this from a really great book. It's called Infinite Powers by Steven Strogatz. So I recommend reading that book to anyone listening. It is good. Yeah.

EL: And so yes, what is your pairing with Archimedes exhaustive proof of — or exhaustive approximation of pi.

KA: My pairing is actually more of an abstract pairing. And it's more of an idea, because I think around the context of math around this time, too, and the context is always changing. And around this time, it was, it was more like a spiritual level of math, like people were more into it. And it was more spiritual. So then if we connect it to now, and how advanced math is, and we know what Archimedes was doing, since he could never find out the numerical value of pi, since it's an irrational number. And he couldn't do that back then. But he still knew that it was between two fractions, between 3+10/71, and 3+10/72, I believe. And that's all he needed to know. So he knew that it was between two numbers, but he can never really find out what exactly this number was. And I think that really speaks a lot about what math is, or what people do, in terms of knowing what we don't know. So in this time, he knew that he didn't know, which is a lot what, what's happening on today. And I think that's just a cycle of what we do for maths or for anything, really. We try to get to the point where we know that we don't know, and then we're done.

EL: That can be such a difficult part of basically anything in life. This whole pandemic thing we've been living through, like knowing what we do and don't know about what's happening with that has been such a challenge. It's like, oh, that really affects my life in a way that maybe knowing the exact value of pi doesn’t.

KK: Right.

EL: But yeah, it's so hard. And sometimes you think you know what, you know, what you don't know, and you don't realize what you don't know. So yeah, I like that kind of, from the very concrete polygons to this sort of abstract. Thank you, Kevin.

KA: Thank you.

KK: That’s a good one.

EL: All right. Next up, welcome to the show, Francisco Leon. Would you like to tell us a little bit about yourself and share your favorite theorem? Yeah,

FL: Thank you for the welcome. Tomorrow, along with Bryce, I'm graduating from Cal State LA through the master's program, so I'm really excited about that.

KK: Congratulations.

FL: Yeah, thank you. Yeah. Today, I want to mention, when I was asked, what's my favorite theorem, at the time, I really had one on mine from my topology class. I’ll state the theorem now. It says a topological space is regular if and only if for every element in the set and open set containing the element, that there exists another open set that also contains elements whose closure is in the first mentioned set. So maybe to label some of this, to get a better visualization, so we have some element, say P. And then say, some open set that contains it, U. Now in between P and U, this alternate characterization of regularity says there's going to have to exist another open set V, that also contains P inside of U whose closure is also inside of U. So it goes, maybe nested: P, V-closure, V, and then U.

KK: Yup.

FL: And that's equivalent for regularity. And you know, at first, this was a homework assignment from the class. And one of the key tools to do this problem is to understand that if you illustrate an element in open set, so you draw it ,right, you kind of draw a little point P, and a dashed circle around an open set, that's going to be equivalent to having P outside that complement. So you can draw P outside of a box and a box, just kind of know that, since of the complement of open sets are closed, that's why it's represented as a box, to be able to comfortably go between those two perspectives of the same situation, I found difficult to get at the time. And so, you know, I fostered an appreciation for this theorem because it made me resolve that difficulty. So it led me to some trains of thoughts that were really interesting for me at the time. And it's been a while since a theorem held my attention for so long. So just to share some lines of thoughts I was having when working through this exercise: okay, I was like, how do I go from being an element in this open set to being outside its complement? I started imagining myself inside of a room, just as the element would be inside the open set. And I'm like, how do I push the walls of this room so that suddenly the outside is contained inside these walls, right? Because you want to go from being inside the open set to being outside the complement. So how can I move this boundary, so that the outside is contained? I felt like I couldn't do it. I look outside, and I know the universe is huge. How can I push the walls of this room to contain everything else outside and suddenly be the one outside? So I had great difficulty. And then as I would think about this problem and look outside, I would see the window. And then I realized that the illustration of the element inside the open set, you know, when you have that point P and those dashed lines around it, those dashed lines aren't necessarily representative of a border, it's really representative of a window, because what you do at the illustration, is you look at what's within those dashed lines to see the elements. You are really looking into the set to see what's inside of it. So what I really needed was a window in this room for me to be able to understand the outside. So now if I reimagine the situation, I'm in a room, which is representative of the open set, and there's some element in here. What I need is a window so that I can see what's on the outside. And then if I change my perspective, if I pass through the window and then turn back around, then I see through the window, the element inside the room. And now I have the outside perspective that I want it. So now I see the element inside the room. So now I'm seeing the complement of the open set. And that really helped me change that perspective from being inside the open set to being outside the complement, which is a closed set. And then I was able to do that exercise pretty straightforwardly, but I was really struggling before that. And I never really think about theorems as visually as I just described, so that's why I really appreciate this theorem and that's why it's one of my current favorites.

KK: You know, when I was an undergrad, I was always going to be a math major. That was always what I was going to do. But that class, point-set topology, is when I really fell in love. I mean, I was already planning to go to graduate school, but my professor for that, Peter Fletcher, who passed away a couple of years ago, really put me on this path to being a topologist. I didn't know what I was going to do until I actually hit that. And of course, you know, that flavor of topology is pretty well settled and has been for quite a while. But it's still really beautiful to think about these basic properties of topological spaces. And I love your visual description of this sort of thing, like regular spaces. You know, I haven't thought about them in a long time, but I think you really nailed it right there. So nice. Yeah.

EL: And I like, I like seeing that little glimpse into how you were thinking this through, even if that isn't what you wrote down in your proof in the end. But it seeing — so often, when we read math, we don't, we don't see those little glimpses of how the person actually thought about it. We see the cleaned up version that, you know, is presentable for professional company or something, but I really liked seeing that. So what what is your pairing for this theorem?

FL: Oh, yeah, so I'm thinking maybe a hot apple pie, just because we typically do place it on a windowsill to cool down and I just figured that this theorem is cooler with a window.

KK: That’s good.

EL: And yeah, who can argue with a nice warm slice of apple? It's delicious. Yeah. Excellent. Well, thank you so much.

FL: Thank you guys.

EL: All right. Next up, we have Marlene Enriquez. Marlene, would you like to introduce yourself and tell us about your favorite theorem?

Marlene Enriquez: Yes. So hi, my name is Marlene, and my favorite theorem has to be the ham sandwich theorem.

KK: Yes!

EL: You've got company there with Kevin.

KK: So in episode zero, Evelyn and I had our favorite theorems. That was mine. Here we go. All right.

EL: So please tell us what you like about it.

ME: What I like about it is just, it's the first time that I encountered a theorem that really didn't have an exact answer to how to solve it. So the idea of basically having a line cut something and split it into equal volumes, per se. So when I first read it, I was like, oh, that sounds cool. When I read it some more. I was like, oh, no, this is really interesting. And it's actually the the theorem that I used to write the my research paper for my senior seminar class with Dr. Krebs. So the theorem, when I read it, I read it like this is like, you have a sandwich made out of bread, ham, and another piece of bread and like, they don't have to be exactly aligned. Or even touching each other. But there exists, a line, or a cut, a straight cut that will split the bread, ham, and the other piece of bread in equal volumes. And then when I saw that, like, wait, you don't really have to be next to each other, or like on top of each other, or even in the same room as each other? And you can still be cut and split into equal volumes? I was like, Oh, wow. I can read more about this, it’s pretty remarkable.

EL: Yeah, it can be the sloppiest made ham sandwich ever, and it’ll still work.

KK: Like you can have one slice of bread in Los Angeles. I have one here in Gainesville and a piece of ham could be in Salt Lake with Evelyn, and there is — it will take a big knife — there is a big knife that can cut them in half. That's right.

EL: Where did you first see this theorem?

ME: I was actually searching for a topic for my paper and I was online Google searching, every time at 2am, it always happens. And I kind of stumbled upon it. And I think I saw a YouTube video and I was like, Oh, this is interesting. Then I clicked to another one. I'm like, okay, this is very interesting. And then I just started searching and searching and reading and yeah

EL: Excellent. Yeah, I guess this podcast brought to you by the time 2am: the perfect time to be just finding weird math stuff to learn about.

KK: So what's what pairs with a ham sandwich there?

ME: Well, it's not on the nose, not a ham sandwich. But actually, when I was typing my paper, I was in my living room, and I have siblings. And they were fighting over a chocolate bar. They were saying, oh, like, let's split it equally. And they're like, No, you got the bigger piece or you got the bigger piece. And just the idea of sharing. Even when you go out with friends, you split the bill and stuff like that. That kind of just kind of brought it to, like, that's kind of like this ham sandwich. But like, in like, money, or a chocolate bar, who got the biggest piece, right?

KK: That’s a hard problem, actually, the whole equal division problem is extremely difficult. As I'm sure you found out with your siblings already over a chocolate bar.

EL: The answer is probably just giving up all earthly desires.

KK: Yeah. Right. The Buddha, the Buddhists understand.

EL: Well, thank you so much Marlene. And our final guest is Daniel Argueta. Thank you for joining us. And please tell us a little bit about yourself and your favorite theorem.

Daniel Argueta: Well, thank you, Kevin, and Evelyn, for having me and Evelyn, don't worry, you said my last name correctly. So I'm also graduating tomorrow. I'm getting my bachelor's in math.

KK: Congratulations.

DA: It’s a big thing. I’m first gen. So when Dr. Krebs approached me about this, I was like, What am I going to talk about? What's my favorite theorem? And when I was doing research for our capstone class, I actually stumbled across you guys’ podcast. And the one, I think it was episode 17 with Dr. Naomi Joshi or something like that.

EL: Nalini.

KK: Nalini Joshi.

DA: And it was the Mittag Leffler theorem. And that theorem was just way too complicated for me. Dr. Krebs helped me bring it down a little bit. And I stumbled across the infinite product convergence theorem. And I was like, okay, maybe that’s what I’m going to talk about. I wrote a whole paper on that. And then I thought about it and I was like, you know what, that's not my favorite theorem. So I started doing some googling, and I came across the headline “The theorem shook math to its core.” So maybe that might give you guys some ideas as to where I'm going to. And I'm actually doing I'm going to talk about Kurt Gödel’s, incompleteness theorems.

KK: Oh, yeah.

EL: Okay, yes, is a great way. I’d just like to say, of all the however many thousands of possibilities, I like that, at least that this one was at the end, to sort of be like, okay, we talked about all this math that we can do. Now let's finish it off with: Oh, yeah, we can't do math. That's probably not the best summary of the Incompleteness Theorems. So why don't you tell us about the incompleteness theorem?

DA: Well, what Gödel pretty much set out to prove, everybody at the time was trying to prove that math is perfect. And they were trying to say, hey, math is perfect. They were trying to find like this theory of everything, and Gödel’s all like, hmm, I don't know about that. And so pretty much what his proof did, and not to get super technical or anything, was he showed that in any formal system, there are certain truth statements about the system that can not be proven by said system. So a way to think of this is our classic logical problems with the knights and the knaves. In this case, you only need the knight, where you have a knight in shining armor who can only tell you the truth. So so you ask yourself, what is a sentence that this knight cannot say if he can only tell the truth? And one sentence is: I cannot say that sentence. You know, because if he can say the sentence, then it's true. But if he can't say the sentence, then you know, it's not gonna work. So I just really like this theorem, because to me, you know, we usually tend to think of math as perfect. It's, a lot of people call it the universal language, because math across everywhere is perfect. But to me, it's super interesting that the fact that we don't know everything about it, and we will never know everything about it. So that's why I really like this theorem. And it actually brings me to my pairing, which is — I know usually you guys do food on the on the podcast, but in this case, my pairing is our Final Frontier, which is space. I think I think it super coincides with it. Because, you know, we're going to always keep discovering more and more about space as our technology advances. But at the same time, our universe is ever-expanding. So will we ever completely know everything about space? There's so much to learn and discover, and the same can be said for math. And that's my favorite theorem.

EL: Excellent. I love that. Yeah, it's almost like okay, yeah, math is like, perfect, and you can do everything. Just don't look too hard. This incompleteness theorem stuff is just saying, oh, yeah, you think you could do calculus? Just don't look too hard.

KK: Right, right. Yeah. Well that’s everybody.

EL: This has been so fun. I’m so optimistic about the future of math right now. And biology. And whatever else you all do.

KK: And machine learning, and whatever it is yes.

EL: Yeah. Good luck to all of you in your next steps. It’s so appropriate that we got to do this right before many of you are graduating and, you know, taking those next steps. So thank you so much for sharing part of your, Monday morning with us.

KK: And thanks to your professor, Mike, for reaching out to us and making this happen.

MK: Well thank you for hosting everybody. This is great.

EL: Yes. I don't know if you all want to unmute it and do a goodbye. I don't know. How do you end a podcast with 12 people? (I just did multiplication there.)

KK: Is there a CSULA kind of cheer? Like I'm at the University of Florida so it'd be like a Go Gators kind of thing. They’re looking at me like, no, we don’t do that.

EL: Math majors might not be the best choice for for you know, knowing all the sports things, not to invoke any stereotypes.

KK: I know every word of the Virginia Tech fight song.

EL: Well, it may not be universal.

KK: Maybe not. All right. Well, you’re all unmuted. Maybe say goodbye.

(General chaos of 12 unmuted people on Zoom.)

[outro]

In this Very Special Episode of My Favorite Theorem, we were excited to welcome nine students from California State University Los Angeles, along with their professor Mike Krebs. Each student shared their favorite theorem and a pairing with us. Below are some links to more information about their favorites.

Pablo Martinez Gutierrez talked about Euler's formula and identity, which connect trigonometric functions with the complex exponential.

Holly Kim told us about Ore's theorem about Hamiltonians in graph theory. Check out A Capella Science's Hamilton parody video!
Bryce Van Ross shared the Hales–Jewett theorem from game theory.

Alvin Lew chose Cantor's diagonalization proof of the uncountability of the reals, which was also a favorite of our previous guest Adriana Salerno.

Judith Landau shared the fundamental theorem of Markov chains, which relates to her work in bioinformatics.
Kevin Alfaro talked about Archimedes' approximation of pi.

Francisco Leon chose a theorem from point-set topology about regular spaces.
Marlene Enriquez chose Kevin's favorite, the ham sandwich theorem.
Daniel Argueta finished off the episode with Gödel's incompleteness theorems.