Episode 40 - Ursula Whitcher

Evelyn Lamb: Hello, and welcome to my favorite theorem, a math podcasts where we ask mathematicians to tell us about their favorite theorems. I'm Evelyn Lamb. I'm a freelance math and science writer in Salt Lake City, Utah. And I am joined as usual by my co host Kevin. Can you introduce yourself?

Kevin Knudson: Sure. I'm still Kevin Knudson, professor of mathematics at the University of Florida. How are things going?

EL: All right. Yeah.

KK: Well, we just talked yesterday, so I doubt much has changed, right? Except I seem to have injured myself between yesterday today. I think it's a function of being—not 50, but not able to say that for much longer.

EL: Yeah, it happens.

KK: It does.

EL: Yeah. Well, hopefully, your podcasting muscles have not been injured.

KK: I just need a few fingers for that.

EL: Alright, so we are very happy today to welcome Ursula Whitcher to the show. Hi, can you tell us a little bit about yourself?

Ursula Whitcher: Hi, my name is Ursula. I am an associate editor at Mathematical Reviews, which, if you've ever used MathSciNet to look up a paper or check your Erdős number or any of those exciting things, there are actually 16 associate editors like me checking all the math that gets posted on MathSciNet and trying to make sure that it makes sense. I got my PhD at the University of Washington in algebraic geometry. I did a postdoc in California and spent a while as a professor at the University of Wisconsin Eau Claire, and then moved here to Ann Arbor where it's a little bit warmer, to start a job here.

EL: Ann Arbor being warmer is just kind of a scary proposition.

UW: It’s barely even snowing. It's kind of weird.

EL: Yeah. Well, and yeah, you mentioned Mathematical Reviews. I—before you got this job, I was not aware that, you know, there were, like, full time employees just of Mathematical Reviews, so that's kind of an interesting thing.

UW: Yeah, it's a really cool operation. We actually go back to sometime in probably the ‘40s.

KK: I think that’s right, yeah.

EL: Oh wow.

UW: So it used to be a paper operation where you could sign up and subscribe to the journal. And at some point, we moved entirely online.

KK: I’m old enough to remember in grad school, when you could get the year’s Math Reviews on CD ROM before MathSciNet was a thing. And you know, I remember pulling the old Math Reviews, physical copies, off the shelf to look up reviews.

UW: We actually have in the basement this set of file cards that our founder, who came from Germany around the Second World War, he had a collection of handwritten cards of all the potential reviewers and their possible interests. And we've still got that floating around. So there's a cool archival project.

KK: I’m ashamed to admit that I'm a lapsed reviewer. I used to review, and then I kind of got busy doing other things and the editors finally wised up and stopped sending me papers.

UW: I try to tell people to just be really picky and only accept the papers that you're really excited to read.

KK: I feel really terrible about this. So maybe I should come back. I owe an an apology to you and the other editors.

UW: Yeah, come back. And then just be really super, super picky and only take things that you are truly overjoyed to read. We don't mind. I—you know, I read apologies for my job for part of my day every day for not reviewing. So I’ve become sort of a connoisseur of the apology letter.

KK: Sure. So is part of your position also that you have some sort of visiting scholar deal at the University of Michigan? Does that come with this?

UW: Yeah, that is. So I get to hang out at the University of Michigan and go to math seminars and learn about all kinds of cool math and use the library card. I'm a really heavy user of my University of Michigan library card. So yeah.

EL: Those are excellent.

KK: It’s a great campus. That’s a great department, a lot of excellent people there.

EL: Yeah. So, what is your favorite theorem, or the favorite theorem you would like to talk about today?

UW: So I decided that I would talk about mirror theorems as a genre.

EL: Okay.

UW: I don't know that I have a single favorite mirror theorem, although I might have a favorite mirror theorem of the past year or two. But as this kind of class of theorems, these are a weird thing, because they run kind of backwards.

Like, typically there's this thing that happens where mathematicians are just hanging out and doing math because math is cool. And then at some point, somebody comes along and is like, “Oh, I see it practical use for this. And maybe I can spin it off into biology or physics or engineering or what have you.” Mirror theorems came the other way. They started with physical observation that there were two ways of phrasing of a theoretical physics idea about possible extra dimensions and string theory and gravity and all kinds of cool things. And then that physical duality, people chewed on and figured out how to turn it into precise mathematical statements. So there are lots of different precise mathematical statements encapsulating maybe something different about about the way these physical theories were phrased, or maybe building then, sort of chaining off of the mathematics and saying something that no longer directly relates to something you could state about a possible physical world. But there is still in like a neat mathematical relationship you wouldn't have figured out without having the underlying physical intuition.

EL: Yeah. And so this is, the general area is called mirror symmetry. And when I first heard that phrase, I assumed it was something about like group theory that was looking at, like, you know, more tangible, things that I would consider symmetric, like what it looks like when you look in a mirror. But that's not what it is, I learned.

UW: So I can tell you why it's called mirror symmetry, although it's kind of a silly reason. The first formulations of mirror symmetry, people were looking at these spaces called Calabi-Yau three-folds, which are—so there are three complex dimensions, six real dimensions, they could maybe be the extra dimensions of the universe, if you're doing string theory. And associated with a Calabi-Yau three-fold, you have a bunch of numbers that tell you about it’s topological information, sort of general stuff about what is this six dimensional shape looking like. And you can arrange those numbers in a diamond that's called the Hodge diamond. And then you can draw a little diagonal line through the Hodge diamond. And some of the mirror theorems predict that if I hand you one Calabi-Yau three-fold with a certain Hodge diamond, there should be somewhere out there in the universe another Calabi-Yau three-fold with another Hodge diamond. And if you flip across this diagonal axis, one is the Hodge diamonds should turn into the other Hodge diamond.

EL: Okay.

UW: So there is a mirror relationship there. And there is a really simple reflection there. But it's like you have to do a whole bunch of topology, and you have to do a whole bunch of geometry and you, like, convince yourself that Hodge diamonds are a thing. And then you have to somehow—like, once you've convinced yourself Hodge diamonds are a thing, you also have to convince yourself that you can go out there and find another space that has the right numbers in the diamond.

EL: So the mirror is, like, the very simplest thing about this. It’s this whole elaborate journey to get to the mirror.

UW: Yeah.

EL: Okay, interesting. I didn't actually know that that was where the mirror came from. So yeah. So can you tell us what these mirror theorems are here?

UW: Sure. So one version of it might be what I said, that given a Calabi-Yau manifold, with this information, that it has a mirror.

Or so then this diamond of information is telling you something about the way that the space changes. And there are different types of information that you could look at. You could look at how it changes algebraically, like if you wrote down an equation with some polynomials, and you changed those coefficients on the polynomials just a little bit, sort of how many different sorts of things, how many possible deformations of that sort could you have? That's one thing that you can measure using, like, one number in this diamond.

EL: Okay.

UW: And then you can also try to measure symplectic structure, which is a related more sort of physics-y information that happens over in a different part of the diamond. And so another type of mirror theorem, maybe a more precise type of mirror theorem, would say, okay, so these deformations measured by this Hodge number on this manifold are isomorphic in some sense to these other sorts of deformations measured by this other Hodge number on this other mirror manifold.

KK: Is there some trick for constructing these mirror manifolds if they exist?

UW: Yeah, there are. There are sort of recipes. And one of the games that people play with mirror symmetry is trying to figure out where the different recipes overlap, when you’ve, like, really found a new mirror construction, and when you’ve found just another way of looking at an old mirror construction. If I hand you one manifold, does it only have a unique mirror or does it have multiple mirrors?

KK: So my advisor tried to teach me Hodge theory once. And I can't even remember exactly what goes on, except there's some sort of bi-grading in the cohomology right?

UW: Right.

KK: And is that where this diamond shows up?

UW: Yeah, exactly. So you think back to when you first learned complex analysis, and there was, like, d/dz direction and there was the d/dz̅ direction.

KK: Right.

UW: And we're working in a setting where we can break up the cohomology really nicely and say, okay, these are the parts of my cohomology that come from a certain number of homomorphic d/dz kind of things. And these are the other pieces of cohomology that can be decomposed and look like, dz̅. And since it’s a Kähler manifold, everything fits together in a nice way.

KK: Right. Okay, there. That's all I needed to know, I think. That's it, you summarized it, you're done.

EL: So, I have a question. When you talk about like mirror theorems, I feel like some amount of mirror symmetry stuff is still conjectural—or “I feel like”—my brief perusal of Wikipedia on this indicates that there are some conjectures involved. And so how much of these theorems are that in different settings, these mirror relationships hold, and how much of them are small steps in this one big conjectural picture. Does that question make sense?

UW: Yeah. So I feel like we know a ton of stuff about Calabi-Yau three-folds that are realized in sort of the nice, natural ways that physicists first started writing down things about Calabi-Yau three-folds.

When you start getting more general on the mathematical side—for instance, there's a whole flavor of mirror symmetry that's called homological mirror symmetry that talks about derived categories and the Fuakaya category—a lot of that stuff has been very conjectural. And it's at the point where people are starting to write down specific theorems about specific classes of examples. And so that's maybe one of the most exciting parts of mirror symmetry right now.

And then there are also generalizations to broader classes of spaces, where it's not just Calabi-Yau three-folds where maybe you're allowing a more general kind of variety or relaxing things, or you're starting to look at, what if we went back to the physics language about potentials, instead of talking about actual geometric spaces? Those start having more conjectural flavor.

EL: Okay, so a lot of this is in the original thing, but then there are different settings where mirror symmetry might be taking place?

UW: Yeah.

EL: Okay. And I assume if you're such a connoisseur of mirror theorems, that this is related to your research also. What kinds of questions are you looking at in mirror symmetry?

UW: Yeah, so I spend some time just playing around with different mirror constructions and seeing if I can match them up, which is always a fun game, trying to see what you know. Lately, what I've been really excited about is taking the sort of classical old-fashioned hands-on mirror constructions where I can hand you a space, and I can take another space, and I can say these two things are mirror manifolds. And then seeing what knowing that tells me, maybe about number theory, about maybe doing something over a finite field in a setting that is less obviously geometry, but where maybe you can still exploit this idea that you have all of this extra structure that you know about because of the mirror and start trying to prove theorems that way.

EL: Oh, wow. I did not know there is this connection in number theory. This is like a whole new tunnel coming out here.

UW: Yeah, no, it's super awesome. We were able to make predictions about zeta functions of K3 surfaces. And in fact we have a theorem about a factor of as zeta function for Calabi-Yau manifolds of any dimensions. And it's a very specific kind of Calabi-Yau manifold, but it's so hard to prove anything about zeta functions! In part because if you're a connoisseur of zeta functions, you know they are controlled by the size of the cohomology, so once your cohomology starts getting really big, it’s really difficult to compute anything directly.

EL: So, like, how tangible are these? Like, here is a manifold and here is its mirror? Are there some manifolds you can really write down and, like, have a visual picture in your mind of what these things actually look like?

UW: Yeah, definitely. So I'm going to tell you about two mirror constructions. I think one of these is maybe more friendly to someone who likes geometry. And one of these is more friendly to someone who likes linear algebra.

EL: Okay.

UW: So the oldest, oldest mirror symmetry construction was, it's due to Greene and Plesser who were physicists. And they knew that they were looking for things with certain symmetries. So they took the diagonal quintic in projective four-space. I have to get to my dimensions right, because I actually often think about four dimensions instead of six.

So you're taking x5+y5+z5 plus, then, v5 and w5, because we ran out of letters, we had to loop around.

EL: Go back.

UW: Yeah. And you say, Okay, well, these are complex numbers, I could multiply any of them by a fifth route of unity, and I would have preserved my total space, right?

Except we're working in projective space, so I have to throw away one of my overall fifth roots of unity because if I multiply by the same fifth root of unity on every coordinate, that doesn't do anything. And then they wanted to maybe fit this into a family where they deformed by the product of all the variables. And if you want to have symmetries of that entire family, you should also make sure that the product of all of your roots of unity, I think multiplies to 1? So anyway, you throw out a couple of fifth roots of unity, because you have these other symmetries from your ambient space and things that you're interested in, and you end up with basically three fifths roots of unity that you can multiply by.

So I've got x5+y5+z5+v5+w5, and I'm modding out by z/5z3. Right? So I’m identifying all of these points in this space, right? I've just like got, like, 125 different things, and I’m shoving all these 125 different things together. So when I do that, this space—which was all nice and smooth and friendly, and it's named after Fermat, because Fermat was interested in equations like that—all of a sudden, I'd made it like, really stuck together and messy, and singular.

KK: Right.

UW: So I go in as a geometer, and I start blowing up, which is what algebraic geometers call this process of going in with your straw and your balloon, and blowing and smoothing out and making everything all nice and shiny again, right?

KK: Right.

UW: And when you do that, you've got a new space, and that's your mirror.

EL: Okay.

KK: So you blow up all the singularities?

UW: Yeah, your resolve the singularity.

KK: That’s a lot.

UW: Yeah. So what you had was, you had something which is floating around in P4. And because we picked a special example, it happens to have a lot of algebraic classes. But a thing in P4, the only algebraic piece you really know about it, in it, is, like, intersecting with a hyper plane.

So it has lots and lots of different ways you can vary all of its different complex parameters on only this one algebraic piece that you know about. And then when you go through this procedure, you end up with something which has very few algebraic ways to modify it. It actually naturally has only a one-parameter algebraic deformation space. But then there are all of these cool new classes that you know about, because you just blew up all of these things. So you're trading around the different types of information you have. You go from lots of deformations on one side to very few deformations on the other.

KK: Okay, so that was the geometry. What's the linear algebra one?

UW: Okay, so the linear algebra one is so much fun. Let's go back to that same space.

EL: I wish our listeners could see how big your smile is right now.

KK: That’s right. It’s really remarkable.

EL: It is truly amazing.

UW: Right. So we've got this polynomial, right, x5+y5+z5+w5+v5. And that thing I was telling you about finding the different fifth roots of unity that we could raise things to, that’s, like, a super tedious algebraic process, right, where you just sit down and you're like, gosh, I can raise different parts of the variables, like fifth roots of unity. And then I throw away some of my fifth roots of unity. So you start with that, the equation and the little algebraic rank that you want to get a group associated with it.

And then you convert your polynomial equation to a matrix. In this case, my matrix is just going to be like all fives down the diagonal.

KK: Okay.

UW: But you can do this more generally with other types of polynomials. The ones that work well for this procedure have all kinds of fancy names, like loops and chains of Fermat’s. So like Fermat’s is just the like different pure powers of variables. Loops would be if I did something like x5+y5+z5+…, and then I looped back around and used an x again.

EL: Okay.

UW: Or, sorry, it should have been like, x4y+y4z, and so on. So you can really see the looping about to happen.

And then chains are a similar thing. Anyway, so given one of these things, you can just read off the powers on your polynomial, and you can stick each one of those into a matrix. And then to get your mirror, you transpose the matrix.

EL: Oh, of course!

UW: And then you run this little crank, to tell you about an associated group.

EL: Okay.

UW: So getting which group goes with your transposed matrix, it's kind of a little bit more work. But I love the fact that you have this, like, huge, complicated physics thing with all this stuff, like the Hodge diamond, and then you're like, oh, and now we transpose a matrix! And, you know it’s a really great duality, right, because if you transpose the matrix again, you get back where you started.

KK: Sure.

EL: Right. Yeah. Well, and it seems like so many questions in math are, “How can we make this question into linear algebra?” It's just, like, one of the biggest hammers mathematicians have.

UW: Yeah.

EL: So another part of this podcast is that we ask our guest to pair their theorem, or in your case, you know, set of theorems, or flavor of theorems, with something. So what have you chosen as you're pairing?

UW: I decided that we should pair the mirror theorems with really fancy ramen.

EL: Okay. So yeah, tell me why.

UW: Okay. So really fancy ramen, like, the good Japanese-style, where you've simmered the broth down for hours and hours, and it's incredibly complex, not the kind that you just go buy in a packet, although that also has its use.

EL: Yeah, no, Top Ramen.

UW: Right. So it's complex. It has, like, a million different variants, right? You can get it with miso, you can get it spicy, you can put different things in it, you can decide whether you want an egg in it that gets a little bit melty or not, all of these different little choices that you get. And yeah, it seems like it's this really simple thing, it’s just noodle soup. And we all know what Top Ramen is. But there's so much more to it. The other reason is that I just personally, historically associate fancy ramen with mirror theorems. Because there was a special semester at the Fields Institute in Toronto, and Toronto has a bunch of amazing ramen. So a lot of the people who were there for that special semester grew to associate the whole thing with fancy ramen, to the point where one of my friends, who's an Italian mathematician, we were some other place in Canada, I think it was Ottawa, and she was like, “Well, why don't we just get ramen for lunch?” And I was like, “Sorry, it turns out that Canada is not a uniform source of amazing ramen.” That was special to Toronto.

KK: Yeah, Ottawa is more about the poutine, I think.

UW: Yeah, I mean, absolutely. There's great stuff in Ottawa. It just like, didn't have this beautiful ramen-mirror symmetry parents that we had all

EL: Right, I really liked this pairing. It works on multiple levels.

KK: Sure. It's personal, but it also works conceptually, it's really good. Yeah. Well, so how long have you been at Math Reviews?

UW: I think I'm in my third year.

KK: Okay.

KK: Do you enjoy it?

UW: I do. It’s a lot of fun.

KK: Is it a permanent gig? Or are these things time limited?

UW: Yeah, it's permanent. And in fact, we are hiring a number theorist. So if you know any number theorists out there who are really interested in, you know, precise editing of mathematics and reading about mathematics and cool stuff like that, tell them to look at our ad on Math Jobs. We're also hiring in analysis and math physics. And we've been hiring in combinatorics as well, although that was a faster hiring process.

EL: Yeah. And we also like to, you know, plug things that you're doing. I know, in addition to math, you have many other creative outlets, including some poetry, right, related to math?

UW: That’s right.

EL: Where can people find that? Ah, well, you can look at my website. Let's see, if you want the poetry you should look at my personal website, which is yarntheory.net.

There's one poem that was just up recently on JoAnne Growney’s blog.

EL: Yeah, that's right.

UW: And I have a poem that's coming out soon, soon, I’m not sure how soon in Journal of Humanistic Math. Yeah, it's a really goofy thing where I made up some form involving the group of units for the multiplicative group associated to the field of seven elements and then played around with that.

EL: I'm really, really looking forward to getting into that. Do you have a little bit of explanation of the mathematical structure in there?

UW: Just the very smallest. I mean, I think what I did was I listed, I found the generators of this group, and then I listed out where they would go as you generated them, and then I looked for the ones that seemed like they were repeating in an order that would make a cool poem structure.

EL: Okay, cool. Yeah. Well, thanks a lot for joining us. We'll be sure to share all that and hopefully people can find some of your work and enjoy it.

UW: Cool.

KK: Thanks, Ursula.

UW: Thanks so much for having me.[outro]

Episode 39 - Fawn Nguyen

Evelyn Lamb: Hello and welcome to My Favorite Theorem, a math podcast where we get mathematicians to tell us about theorems. I'm one of your hosts, Evelyn Lamb. I'm 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. It's Friday night.

EL: Yeah, yeah, I kind of did things in a weird order today. So there's this concert at the Utah Symphony that I wanted to go to, but I can't go tonight or tomorrow night, which are the only two nights they're doing it. But they had an open rehearsal today. So I went to a symphony concert this morning. And now I'm doing work tonight, so it's kind of a backwards day.

KK: Yeah. Well, I got up super early to meet with my financial advisor.

EL: Oh, aren’t you an adult?

KK: I do want to retire someday. I’ve got 20 years yet, but you know, now it's nighttime and my wife is watching Drag Race and I'm talking about math. So.

EL: Cool. Yeah.

KK: Life is good.

EL: Yes. Well, we're very happy today to have Fawn Nguyen on the show. Hi, Fawn. Could you tell us a little bit about yourself?

Fawn Nguyen: Hi, Evelyn. Hi, Kevin. I was was thinking, “How nerdy can we be? It’s Friday.”

So my name is Fawn Nguyen. I teach at Mesa Union School in Somis, California. And it's about 60 miles north of LA.

EL: Okay.

FN: 30 miles south of Santa Barbara. I teach—the school I'm at is a K-8, one-school district, of about 600 students. Of those 600, about 190 of them are in the junior high, 6-8, but it's a unique one-school district. So we're a family. It's nice. It's my 16th year there but 27th overall.

EL: Okay, and where did you teach before then?

FN: I was in Oregon. And I was actually a science teacher.

KK: Is your current place on the coast or a little more inland?

FN: Coast, yeah, about 10 miles from the coast. I think we have perfect weather, the best weather in the world. So.

KK: It’s beautiful there, it’s really—it’s hard to complain. Yeah.

FN: Yeah. It’s reflected in the mortgage, or rent.

EL: Yeah

KK: Right.

FN: Big time.

EL: So yeah, what theorem have you decided to share with us today?

FN: You mean, not everyone else chose the Pythagorean Theorem?

EL: It is a very good theorem.

FN: Yeah. I chose the Pythagorean Theorem. I have some reasons, actually five reasons.

KK: Five, good.

FN: I was thinking, yeah, that's a lot of reasons considering I don't have, you know, five reasons to do anything else! So I don't know, should I just talk about my reasons?

EL: Yeah, what’s your first reason?

FN: Jump right in?

EL: Well, actually, we should probably actually at least say what the Pythagorean theorem is. It's a very familiar theorem, and everyone should have heard about it in a middle school math class from a teacher as great as Fawn. But yeah, so could you summarize the theorem for us?

FN: Well, that's just it. Yeah, I chose it for one, it’s the first and most obvious reason, because I am at the middle school. And so this is a big one for us, if not the only one. And it's within my pay grade. I can wrap my head around this one. Yeah, it's one of our eighth grade Common Core standards. And the theorem states that when you have a right triangle, the sum of the squares of the two legs is equal to the square of the hypotenuse.

KK: Right.

FN: How did I do, Kevin?

KK: Well, yeah, that's perfect. In fact, today I was—it just so happens that today, I was looking through the 1847 Oliver Byrne edition of Euclid’s Elements, this sort of very famous one with the pictures where the colors, shapes, and all of that, and I just I happened to look at that theorem, and the proof of it, which is really very nice.

FN: Yeah. So it being you know, the middle school one for us, and also, when I talk about my students doing this theorem—I just want to make sure that you understand that I no longer teach eighth grade, though. This is the first year actually at Mesa, and I've been there 16 years, that I do not get eighth graders. I'm teaching sixth graders. So when I refer to the lessons, I just want to make sure that you understand these are my former students.

EL: Okay.

FN: Yeah. And once upon a time, we tracked our eighth graders at Mesa. So we had a geometry class for the eighth graders. And so of course, we studied the Pythaogrean theorem then.

KK: So you have reasons.

FN: I have reasons. So that was the first reason, it’s a big one because, yeah. The second reason is there are so many proofs for this theorem, right? It's mainly algebraic or geometric proofs, but it's more than any other theorem. So it's very well known. And, you know, if you ever Google, you get plenty of different proofs. And I had to look this up, but there was a book published in 1940 that already had a 370 proofs in it.

KK: Yeah.

FN: Yeah. Even one of our presidents, I don't know if you know this, but yeah, this is some little nice trivia for the students.

EL: Yeah.

FN: One of our presidents, Garfield, submitted a proof back in 18-something.

EL: Yeah.

FN: He used trapezoids to do that.

KK: He was still in Congress at the time, I think the story is that, you know, that he was in the House of Representatives. And like, it was sort of slow on the floor that day, and he figured out this proof, right.

FN: Yeah. And then people continue to submit, and the latest one that I know was just over a year ago, back in November 2017, was submitted. That's the latest one I know. Maybe there was one just submitted two hours ago, who knows? And his was rearranging the a-squared and b-squared, the smaller squares, into a parallelogram. So I thought that was interesting. Yeah. And what's interesting is Pythagoras, even though it's the Pythagorean Theorem, he was given credit for it, it was a known long before him. And I guess there's evidence to suggest that it was by developed by a Hindu mathematician around 800 BC.

EL: Okay.

FN: And Pythagoras was what? 500-something.

KK: Something like that.

EL: Yeah.

FN: Yeah, something like that. But he was the first, I guess he got credit, because he was the first to submit a proof. He wasn't just talking about it, I guess it was official, it was a formal proof. And his was rearrangement. And I think that's a diagram that a lot of us see. And the kids see it. It's the one where you got the big, the big c square in the middle with the four right triangles around it, four congruent right triangles. Yeah. And then just by rearranging that big c squared became two smaller squares, your a squared and b squared. Yeah.

EL: Yeah. And I think it was known by, or—you know, I'm not a math historian. And I don't want to make up too much history today. But I think it has been known by a lot of different people, even as far back as Egyptians and Babylonians and things, but maybe not presented as a mathematical theorem, in the same kind of way that we might think about theorems now. But yeah, I think this is one of these things that like pretty much every human culture kind of comes up with, figuring out that this is true, this relationship.

KK: Yeah, I think recently wasn’t it? Or last year? There's this Babylonian tablet. And I remember seeing on Twitter or something, there was some controversy about someone claimed that this proved that the the Babylonians knew, all kinds of stuff, but really—

EL: Well, they definitely knew Pythagorean triples.

KK: Yeah, they knew lots of triples. Maybe you wrote about this, Evelyn.

EL: I did write about it, but we won’t derail it this way. We can put a link to that. I’ll get too bothered.

FN: Now that you brought up Pythagorean triples, how many do you know? How many of those can you get the kids to figure out? Of course, including Einstein submitted a proof. And I thought it was funny that people consider Einstein’s proof to be the most elegant. And I'm thinking, “Well, duh, it’s Einstein.” Yeah. And I guess I would have to agree, because there were a lot of rearrangements in the proofs, but Einstein, you know, is like, “Yeah, I don't need no stinking rearrangement.” So he stayed with the right triangle. And what he did was draw in the altitude from the 90 degree angle to the hypotenuse, and used similar triangles. And so there was no rearrangement. He simply made the one triangle into—by drawing in that altitude, he got himself three similar triangles. And yeah, and then he drew squares off of the hypotenuse of each one of those triangles, and then wrote, you know, just wrote up an equation. Okay, now we're just going to divide everything by a factor. The one that was drawn, in you just divide out the triangle, then you just you end up with a squared plus b squared equals c squared. It's hard to do without the the image of it, but yeah.

EL: But yeah, it is really a lovely one.

FN: Yeah. And this is something I didn't know. And it was interesting. I didn't know this until I was teaching it to my eighth graders. And I learned that, I mean, normally, we just see those squares coming off of the right triangle. And then I guess one of the high school students—we were using Geometer’s Sketchpad at the time, and one of the high school students made an animated sketch of the Pythagorean theorem. And, you know, he was literally drawing Harry Potter coming off of the three sides. And you know, and I just, Oh, I said, yeah, yeah. You don't have to have squares as long as they’re similar figures, right, coming off the edges. That would be fine. So that was fun to do. Yeah. So I have my kids just draw circles so that they—just anything but a square coming off of the sides, you know, do other stuff.

EL: Well, now I’m trying to—my brain just went to Harry Potter-nuse.

KK: Boo.

EL: I’m sorry, I’m sorry.

FN: That’s a good one.

KK: So I have forgotten when I actually learned this in life. You know, it's one of those things that you internalize so much that you can't remember what stage of your education you actually learned it in. So this is this is an actual Common Core eighth grade standard?

FN: Yes, yes. In the eighth grade, yeah.

KK: I grew up before the Common Core, so I don't really remember when we learned this.

FN: I don't know. Yeah, prior to Common Core, I was teaching it in geometry. And I don't think it was—it wasn't in algebra, you know, prior to these things we had algebra and then geometry. So yeah.

My third reason—I’m actually keeping track, so that was the second, lots of proofs. So the third reason I love the Pythagorean theorem is one fine day it led me to ask one of the best questions I'd asked of my geometry students. I said to them, “I wonder if you know how to graph and irrational number on the number line.” I mean, the current eighth grade math standard is for the kids to approximate where an irrational numbers is on the number line. That's the extent of the standard. So I went further and just asked my kids to locate it exactly. You know, what the heck?

EL: Nice. Yeah.

FN: And I actually wrote a blog post about it, because it was one of those magical lessons where you didn't want the class to end. And so I titled the post with “The question was mine, but the answer was all his.” And so I just threw it out to the class, I began with just, “Hey, where can we find—how do you construct the square root of seven on the number line?” And so, you know, they did the usual struggle and just playing around with it, but one of the kids towards the end of class, he got it, he came up with a solution. And I think when I saw it, and heard him explain it, it made me tear up, because it's like, so beautiful. And I'm so glad I did, because it was not, you know, a standard at all. And it was just something at the spur of the moment. I wanted to know, because we'd been working a lot with the Pythagorean theorem. And, yeah, so what he did was he drew two concentric circles, one with radius three and one with radius four on the coordinate plane, and the center is at (0,0). If you can imagine two concentric circles. And then he drew in y=-3, a line y=-3. And then you drew a line perpendicular to that line, that horizontal line, so that it intersects the—right, perpendicular to the horizontal line at negative three. And it intersects the larger circle, the one with radius four.

KK: Yeah, okay.

FN: So eventually what he did was he created, yeah, so you would have a right triangle created with one of the corners at (0,0). And the triangle would have legs of—the hypotenuse would be, what, four, the hypotenuse is four. One of the legs is three, and the other leg must be √7.

EL: Oh.

KK: Oh, yeah, okay.

FN: Yeah, yeah. So it's just so beautiful.

EL: That is very clever!

FN: Yeah, it really was. So every time I think about the Pythagorean theorem, I think back on that lesson. The kids really tried. And then from √7, we tried other routes. And we had a great time and continued to the next day.

EL: Oh, nice. I really liked that. That brought a big smile to my face.

KK: Yeah.

FN: The fourth reason I love the Pythagorean theorem is it always makes me think of Fermat’s Last Theorem. You know, it looks familiar, similar enough, where it states that no three positive integers a, b, and c can satisfy the equation of an+bn=cn. So for any integer value of n greater than 2. So it works for the Pythagorean Theorem, but any integer, any exponent greater than two would work. So I love—whenever I can, I love the history of mathematics, and whatever, I try to bring that in with the kids. So I read the book on the Fermat’s Last Theorem, and I kind of bring it up into the students for them to realize, Oh, my gosh, this man, Andrew Wiles, who solved it—and it's, you know, it's an over 300 year old theorem. And yeah, for him to first learn about the theorem when he was 10, and then to spend his life devoted to it. I mean, I can't think of a more beautiful love story than that. And yeah, so bring that to the kids. And I actually showed them the first 10 minutes of the documentary by BBC on Andrew Wiles. And just right, when he tears up, and, you know, I cannot stop tearing up at the same time because it—I don't know, it's just, it's that kind of dedication and perseverance. It's magical, and it's what mathematicians do. And so, you know, hopefully that supports all this productive struggle, and just for the love for mathematics. So, kind of get all geeky on the kids.

EL: Yeah, that is a lovely documentary.

FN: Yeah. Yeah. It's beautiful. All right. My fifth and final reason for loving this theorem is Pythagoras himself. What a nut!

EL: Yeah, I was about to say, he was one weird dude.

FN: Yeah, yeah. So, I mean, he was a mathematician and philosopher, astronomer and who knows what else. And the whole mystery wrapped up in the Pythagorean school, right? He has all these students, devotees. I don't know, it's like a cult! It really is like a cult because they had a strict diet, their clothing, their behaviors are a certain way. They couldn't eat meat or beans, I heard.

EL: Yeah.

FN: Yeah. And something about farting. And they believed that each time you pass gas that part of your soul is gone.

EL: That’s pretty dire for a lot of us, I think.

FN: Yeah. And what's remarkable also was that, the very theorem that he's named, you know, that's where I guess one of his students—I don't remember his name—but apparently he discovered, you know, the hypotenuse of √2 on the simple 1x1 isosceles triangle, and √2 and what did that do to him. The story goes he was thrown overboard for speaking up. He said, hey, there might be this possibility. So that's always fun, right? Death and mathematics, right?

EL: Dire consequences. Give your students a good gory story to go with it.

FN: I always like that. Yeah. But it's the start of irrational numbers. And of course, the Greek geometry—that mathematics is continuous and not as discrete as they had thought.

EL: Well, and it is an interesting irony, then that the Pythagoras theorem is one really easy way to generate examples of irrational numbers, where you find rational sides and a whole lot of them give you irrational hypotenuses.

FN: Yes.

EL: And then, you know, this theorem is the downfall of this idea that all numbers must be rational.

FN: Right. And I mean, the whole cult, I mean, that revelation just completely, you know, turned their their belief upside down, turned the mathematical world at that time upside down. It jeopardized and just humiliated their thinking and their entire belief system. So I can just imagine at that time what that did. So I don't know if any modern story that has that kind of equivalent.

EL: Yeah, no one really based their religion on Fermat’s Last Theorem being untrue. Or something like this.

FN: Right, right. Exactly.

EL: Yeah. I like all of your reasons. And you've touched on some really great—like, I will definitely share some links to some of those proofs of the Pythagorean theorem you mentioned.

So another part of this podcast is that we ask our guests to pair their theorem with something. So what have you chosen for your pairing?

FN: I chose football.

KK; Okay, all right.

FN: I chose football. It's my love. I love all things football. And the reason I chose football is simply because of this one video. And I don't know if you've seen it. I don't know if anyone's mentioned it. But I think a lot of geometry teachers may have shown it. It's by Benjamin Watson doing a touchdown-saving tackle. So again, his name is Benjamin Watson. I don't know how many years ago this was, but he’s a tight end for the New England Patriots. So what happened was, he came out of nowhere. Well, there was an interception. So he came out of nowhere to stop a potential pick-six at the one-yard line.

EL: Oh, wow.

FN: I mean, it's the most beautiful thing! So yeah, so if you look at that clip, even the coach say something to remember for the rest—anybody who sees it, for the rest of their life just because he never gave up, obviously. But you know, the whole point is he ran the diagonal of the field is what happened.

KK: Okay.

EL: Yeah, so you’ve got the hypotenuse.

FN: You’ve got the hypotenuse going. The shortest distance is still that straight line, and he never gave up. Oh, I mean, this guy ran the whole way, 90 yards, whatever he needed from from the very one end to the other. No one saw Ben Watson coming, just because, we say literally out of nowhere. Didn’t expect it. And the camera, what's cool is, you know, the camera is just watching the runner, right, just following the runner. And so the camera didn’t see it until later. Later when they did film, yeah, they zoomed out and said, Oh, my God, that's where he was coming from, the other hypotenuse, I mean, the other end of the hypotenuse. Yeah. But I pair everything, every mathematics activity I do, I try to pair it with a nice Cabernet. How's that?

EL: Okay.

KK: Not during school, I hope.

FN: Absolutely not.

EL: Don’t share it with your students.

FN: I’m a one glass drinker anyway, I'm a very, very lightweight. I talk about drinking, but I'm a wuss, Asian flush. Yeah.

EL: Yeah. Well, so, I’m not really a football person. But my husband is a Patriots fan. And I must admit, I'm a little disappointed that you picked an example with the Patriots because he already has a big enough head about how good the Patriots are, and I take a lot of joy in them not doing well, which unfortunately doesn’t happen very much these days.

KK: Never happens.

EL: There are certain recent Super Bowls that I am not allowed to talk about.

FN: Oh, okay.

KK: I can think of one in particular.

EL: There are few. But I'll say no more. And now I'm just going to say it on this podcast that will be publicly available, and I'll instruct him not to listen to this episode.

FN: Yeah, now my new favorite team actually, pro—well, college is Ducks, of course, but pro would be Dallas Cowboys. Just because that’s the favorite team from my fiance. So we actually, yeah, for Christmas, this past Christmas, I gave him that gift. We flew to Dallas to watch a Cowboys game.

EL: Oh, wow. We might have been in Dallas around the same time. So I grew up in Dallas.

FN: Oh!

EL: And so if I were a football fan, that would be my team because I definitely have a strong association with Dallas Cowboys and my dad being in a good mood.

FN: There we go.

EL: And I grew up in in the Troy Aikman era, so luckily the Cowboys did well a lot.

FN: Well, they’re doing well this year, too. So this Saturday, big game, right? Is it? Yeah.

KK: I feel old. So when I was growing up, I used to, I loved pro football growing up, and I've sort of lost interest now. But growing up in the ‘70s, it was either you're a Cowboys fan or a Steelers fan. That was the big rivalry.

FN: Yeah.

KK: I was not a Cowboys fan, I’m sorry to say.

FN: I never was either until recently.

KK: I was born in Wisconsin, and my mother grew up there, so I’m contractually obligated to be a Green Bay fan. I mean, I’m not allowed to do anything else.

EL: Well, it's very good hearted, big hearted of you, Fawn, to support your fiance's team. I admire that. I, unfortunately, I'm not that good a person.

FN: I definitely benefit because yeah, the stadium. What an experience at AT&T Stadium. Amazing.

EL: Yeah, it is quite something. We went to a game for my late grandfather's birthday a few years before he passed away. My cousins, my husband and I, my dad and uncle a ton of people went to a game there. And that was our first game at that stadium. And yeah, that is quite an experience. I just, I don't even understand—like the screen that they've got so you can watch the game bigger than the game is like the biggest screen I've ever seen in my life. I don't even understand how it works.

FN: Same here, it’s huge. And yet somehow the camera, when you watch the game on television, that screen’s not there, and then you realize that it's really high up. Yeah.

KK: Cool. Well, we learned some stuff, right?

EL: Yeah.

KK: And this has been great fun.

EL: Yeah, we want to make sure to plug your stuff. So Fawn is active on Twitter. You can find her at—what is your handle?

FN: fawnpnguyen. So my middle initial, Fawn P Nguyen.

EL: And Nguyen is spelled N-G-U-Y-E-N?

FN: Very good. Yes.

EL: Okay. And you also have a blog? What's the title of that?

FN: fawnnguyen.com. It’s very original.

EL: But it's just lovely. You're writing on there is so lovely. And it, yeah, it's just such a human picture. Like you really, when you read that you really see the feeling you have for your students and everything, and it's really beautiful.

FN: Thank you. They are my love. And I just want to say, Evelyn, when you asked me to do this, I was freaking out, like oh my god, Evelyn the math queen. I mean, I was thinking God, can you ask me do something else like washing the windows? Make you some pho?

KK: Wait, we could have had pho?

FN: We could have had pho. Because this was terrifying. But you know, it's a joy. Pythagorean theorem, I can take on this one. Because it's just so much fun. I mean, I've been in the classroom for a long time, but I don't see myself leaving it anytime soon because yeah, I don't know what else I would be doing because this is my love. My love is to be with the kids.

KK: Well, bless you. It's hard work. My sister in law teaches eighth grade math in suburban Atlanta, and I know how hard she works, too. It's really—

FN: We’re really saints, I mean—

KK: You are. It’s a real challenge. And middle school especially, because, you know, the material is difficult enough, and then you're dealing with all these raging hormones. And it's really, it's a challenge.

EL: Well, thanks so much for joining us. I really enjoyed it.

KK: Thanks, Fawn.

FN: Thank you so much for asking me. It was a pleasure. Thank you so much.

[outro]

Episode 38 - Robert Ghrist

Kevin Knudson: Welcome to My Favorite Theorem, a podcast that starts with math and goes all kinds of weird places. 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. I’m a freelance math and science writer in Salt Lake City. Happy New Year, Kevin.

KK: And to you too, Evelyn. So this will happen, this will get out there in the public later. But today is January 1, 2019.

EL: Yes, it is.

KK: And Evelyn tells me that it was it's cold in Utah, and I have my air conditioning on.

EL: Yes.

KK: That seems about right.

EL: Yeah. Our high is supposed to be 20 today. And the low is 6 or 7. So we really, really don't have the air conditioner on.

KK: Yeah, it's going to be 82 here today in Gainesville. [For our listeners outside of the USA: temperatures are in Fahrenheit. Kevin does not live in a thermal vent.] I have flip flops on.

EL: Yeah. Yeah, I’m a little jealous.

KK: This is when it's not so bad to live in Florida, I’ve got to say.

EL: Yeah.

KK: Anyway, Well, today, we are pleased to welcome Robert Ghrist. Rob, you want to introduce yourself?

RG: Hello, this is Robert Ghrist.

KK: And say something about yourself a little, like who you are.

RG: Okay. All right, so I am a professor of mathematics and electrical and systems engineering at the University of Pennsylvania. This is in Philadelphia, Pennsylvania. I've been in this position at this wonderful school for a decade now. Previous to that I had tenured positions at University of Illinois in Urbana Champaign and Georgia Institute of Technology.

KK: So you've been around.

RG: A little bit.

EL: Oh, and so I was just wondering, so it that a joint appointment between two different departments, or is it all in the math department?

RG: This is a split appointment, not only between two different departments, but between two different schools.

EL: Oh, wow.

RG: The math appointment is in the School of Arts and Sciences, and the engineering appointment is in the School of Engineering. This is kind of a tricky sort of position to work out. This is one of the things that I love about the University of Pennsylvania is there are very low walls between the disciplines, and a sort of creative position like this is is very workable. And I love that.

KK: Yeah, and your undergraduate degree was actually in engineering, right?

RG: That’s correct I got turned on to math by my calculus professor, a swell guy by the name of Henry Wente, a geometer.

KK: Excellent. Well, I see you’re continuing the tradition. Well, we’ll talk about that later. And actually, you actually have an endowed chair name for someone rather famous, right?

RG: That’s true. The full title is The Andrea Mitchell PIK professor of mathematics, electrical and systems engineering. This is Andrea Mitchell from NBC News. She and her husband Alan Greenspan funded this position. Did not intend to hire me specifically, or a mathematician. I think she was rather surprised when the chair that she endowed wound up going to a mathematician, but there it is, we get along swell. She's great.

KK: Nice.

EL: Nice. That's really interesting.

KK: Yup. So, Rob, what is your favorite theorem?

RG: My favorite theorem is, I don't know. I don't know the name. I don't know that this theorem has a name, but I love this theorem. I use this theorem all the time in all the classes I teach, it seems. It's a, it's a funny thing about basically Taylor expansion, or Taylor series, but in an operator theoretic language. And the theorem, roughly speaking, goes like this: if you take the differentiation operator on functions, let's say just single input, single output functions, the kind of things you do in basic calculus class. Call the differentiation operator D. Consider the relationship between that operator and the shift operator. I’m going to call the shift operator E. This is the operator that takes a function f, and then just shifts the input by 1. So E(f(x)) is really— pardon me, E(x) is really f evaluated at x+1. We use shift—

EL: I need a pencil and paper.

RG: Yeah, I know, right? We use the shift operator all the time in signal processing, in all kinds of things in both mathematics and engineering. And here's the theorem, here's the theorem. There's this wonderful relationship between these two operators. And it's the following. If you exponentiate the differentiation operator, if you take e to the D, you get the shift operator.

KK: This is remarkable.

RG: What does this mean? What does this mean?

KK: Yeah, what does it mean? I actually did work this out once. So what our listeners don't know is that you and I actually had this conversation once in a bar in Philadelphia, and the audio quality was so bad, we're having to redo this.

EL: Yeah.

KK: So I went home, and I worked this out. And it's true, it does work out. But what does this mean, Rob? Sort of, you know, in a manifestation physically?

RG: Yeah, so let me back up. The first question that I ask students, when they show up in calculus class at my university is, is, what is e to the x? What does that even mean? What does that mean when x is an irrational number, or an imaginary number, or something like a square matrix, or an operator? And, of course, that takes us back to the the interpretation of exponentiation in terms of the Taylor series at zero, that I take that infinite series, and I use that to define what exponentiation means. And because things like operators, things like differentiations, or shifts, you can take powers of those by composition, by iteration, and you can rescale them. Then you can exponentiate them.

So I can talk about what it means to exponentiate the differentiation operator by taking first D to the 0, which of course, is the identity, the do-nothing operator, and then adding to it D, and then adding to that D squared divided by 2 factorial [n factorial is the product of the integers 1x2,…n], that's the second derivative, then D cubed divided by 3 factorial, that's the third derivative. If I can keep going, I’ve exponentiated the differentiation operator. And the theorem is that this is the shift operator in disguise. And the proof is one line. It's Taylor expansion. And there you go.

Now, this isn't your typical sort of my favorite theorem, in that I haven't listed all the hypotheses. I haven't been careful with anything at all. But one of the reasons that this is my favorite theorem is because it's so useful when I'm teaching calculus to students, when I'm teaching basic dynamical systems to students where, you know, in a more advanced class, yeah, we'd have a lot of hypotheses. And, oh, let's be careful. But when you're first starting out, first trying to figure out what is differentiation, what is exponentiation, this is a great little theorem.

EL: Yeah, this conceptual trip going between the Taylor series, or going between the idea of e to the x, or 2 to the x or something where we really have a, you know, a fairly good grasp of what exponentiation means in that case, if we, if we're talking about squares or something like that, and going then to the Taylor series, this very formal thing, I think that's a really hard conceptual shift. I know that was really hard for me.

RG: Agreed.

KK: Yeah. So I, I wonder, though, I mean, so what's a good application of this theorem, like, in a dynamics class, for example? Where does this pop up sort of naturally? And I can see that it works. And I also agree that this idea of—I start calculus there, too, by the way, when I say, you know, what does e to the .1 mean, what does that even mean?

RG: What does that even mean?

KK; Yeah, and that’s a good question that students have never really thought about. They’re just used to punching .1 into a calculator and hitting the e to the x key and calling it a day. So, but where would this actually show up in practice? Do you have a good example?

RG: Right. So when I teach dynamical systems, it's almost exclusively to engineering students. And they're really interested in getting to the practical applications, which is a great way to sneak in a bunch of interesting mathematics and really give them some good mathematics education. When doing dynamical systems from an applied point of view, stability is one of the most important things that you care about. And one of the big ideas that one has to ingest is that of stability criteria for, let's say, equilibria in a dynamical system. Now, there are two types of dynamical systems that people care about, depending on what notion of time you're using— continuous time or discrete time. Most books on the subject are written for one or the other type of system. I like to teach them both at once, but one of the challenges of doing that is that the stability criteria are are different, very different-looking. In continuous time, what characterizes a stable equilibrium is when you look at all of the eigenvalues of the linearization, the real parts are less than zero. When you move to a discrete time dynamical system, that is a mapping, then again, you're looking at eigenvalues of the linearization, but now you want the modulus to be less than 1. And I find that students always struggle with “Why is it different?” “Why is it this way here, and that way there?” And of course, of course, the reason is my favorite little theorem, because if I look at the evolution operator in continuous-time dynamics—that’s the derivative—versus the evolution operator in discrete-time dynamics—that is the shift, move forward one step in time—then if I want to know the relationship between the stability and, pardon me, the stable and unstable regions, it is exponentiation. If I exponentiate the left hand side of the complex plane, what do I get? I get the region in the plane with modulus less than 1.

KK: Right.

RG: I find that students have a real “aha” moment when they see that relationship, and when they can connect it to the relationship between the evolution operators.

EL: I’m having an “aha” moment about this right now, too. This isn't something I had really thought about before. So yeah, this is a really neat observation or theorem.

RG: Yeah, I never really see this written down in books.

KK: That’s—clearly now you should write a book.

RG: Another one?

KK: Well, we'll talk about how you spend your time in a little while here. But, no, Rob, I mean, so Rob has this—I don't know if it's famous, but well known—massive open online course through Coursera where he does calculus, and it's spectacular. If our listeners haven't seen it, is it on YouTube, Rob? Can you actually get it at YouTube now?

RG: Yes, yes. The the University of Pennsylvania has all the lectures posted on a YouTube channel.

KK: Well, I actually downloaded to my machine. I took the MOOC A few years ago, just for fun. And I passed! Remarkably.

RG: With flying colors, with flying colors.

KK: Yeah, I'm sure you graded my exam personally, Rob.

RG: Personally.

KK: And anyway, this is evidence for how lucky are students are, I think. Because, you know, you put so much time into this, and these these little “aha” moments. And the MOOC is full of these things. Just really remarkable stuff, especially that last chapter, which is so next level, the digital calculus stuff, which sort of reminds me of what we're talking about. Is there some connection there?

RG: Oh yes, it was creating that portion of the MOOC that really, really got me to do a deep dive into discrete analogs of continuous calculus, looking at the falling powers notation that is popular in computer science in Knuth’s work and others, thinking in terms of operators. Yeah, that portion of the MOOC really got me thinking a lot about these sorts of things.

KK: Yeah, I really can't recommend this highly enough. It’s really great.

EL: Yeah, so I have not had the benefit of this MOOC yet. So digital calculus, is that meaning, like, calculus for computers? Or what exactly is that? What does that mean?

RG: One of the things that I found students really got confused about in a basic single variable calculus class is, as soon as you hit sequences and series, their heads just explode because they get sequences and series confused with one another, and it all seems unmotivated. And why are we bothering with all these convergence tests? And where’d they come from? All this sort of thing.

EL: And why is it in a calculus class?

RG: Why is it even in a calculus class after all these derivatives and integrals? So the way that I teach it is when we get to sequences and series, you know, in the last quarter of the semester, I say, Okay, we've done calculus for functions with an analog input and an analog output. Now, we want to redo calculus for functions with a digital input and an analog output. And such functions we're going to call sequences. But I'm really just going to think of it as a function. How would you differentiate such a thing? How would you integrate such a thing? That leads one to think about finite differences, which leads to some some nice approaches to numerical methods. That leads one to looking at sums and numerical integration. And when you get to improper integrals over an unbounded domain? Well, that's series, and convergence tests matter.

KK: Yeah, it's super interesting. We will provide links to this. We’ll find the YouTube links and provide them.

EL: Yeah.

KK: So another fun part of this podcast, Rob, is that we ask our guests to pair their theorem with something, and I assume you're going to go with the same pairing from our conversation back in Philadelphia.

RG: Oh yes, that’s right.

KK: What is it?

RG: My work is fueled by a certain liquid beverage.

KK: Yeah.

RG: It’s not wine. It's not beer. It's not whiskey. It's not even coffee, although I drink a whole lot of coffee. What really gets me through to that next-level math is Monster. That's right. Monster Energy Drink, low carb if you please, because sugar is not so good for you. Monster, on the other hand, is pretty great for me, at any rate. I do not recommend it for people who are pregnant or have health problems, problems with hearts, anything like this, people under the age of 18, etc, etc. But for me, yeah, Monster.

KK: Yeah. There's lots of empties in your office, too like, up on the shelf there, which I'm sure have some significance.

RG: The wall of shame, that’s right. All those empty monster cans.

KK: See, I can't get into the energy drinks. I don't know. I mean, I know you're also fond of scotch. But does that does that help bring you down from the Monster, or is it…

RG: That’s a rare treat. That's a rare treat.

KK: Yeah, it should be. So when did your obsession with Monster start? Does this go back to grad school, or did it even exist when we were in grad school? Rob and I are roughly the same age. Were energy drinks a thing when we were in grad school? I don't remember.

RG: No, no. I didn't have them until, gosh, what is it, sometime within the past decade? I think it was when I was first working on that old calculus MOOC, like, what was that, six years ago? Six, seven years ago, is when I was doing that.

KK: Yup.

RG: That was difficult. That was difficult work. I had to make a lot of videos in a short amount of time. And, yup, the Monster was great. I would love to get some corporate sponsorship from them. You know, maybe, maybe try to pitch extreme math? I don't know. I don't think that's going to work.

KK: I don't know. I think it's a good angle, right? I mean, you know, they have this monster truck business, right? So there is this sort of whole extreme sports kind of thing. So why not? You know?

EL: Yeah, I'm sure they're just looking for a math podcast to sponsor. That's definitely next on their branding strategy.

KK: That’s right. Yeah. But not us. They should sponsor you, Rob. Because you're the true consumer.

RG: You know, fortune favors the bold. I'd be willing to hold up a can and say, “If you're not drinking Monster, you're only proving lemmas,” or something like that.

EL: You’ve thought this through. You've got their pitch already, or their slogan already made.

RG: That’s right. Yup.

KK: All right. Excellent. So we always like to give our guests a chance to to pitch their projects. Would you like to tell us about Calculus Blue?

RG: Oh, absolutely! This is—the thing that I am currently working on is a set of videos for multivariable calculus. I'm viewing this as something like a video text, a v-text instead of an e-text, where I have a bunch of videos explaining topics in multivariable calculus that are arranged in chapters. They’re broken up into small chunks, you know, roughly five minutes per video. These are up on my YouTube channel.There's another, I don't know, five or six hours worth of videos that are going to drop some time in the next week covering multivariate integration. This is a lot of fun. I'm having a ton of fun doing some 3d drawing, 3d animation. Multivariable calculus is just great for that kind of visualization. This semester, I'm going to use the videos to teach multivariable calculus at Penn in a flipped manner and experiment with how well that works. And then it'll be available for anyone to use.

KK; Yeah, I'm looking forward to these. I see the previews on Twitter, and they really are spectacular. How long does any one of those videos take you? It seems like, I mean, I know you've gotten really good at at the graphics packages that you need to create those things. But, you know, like a 10 minute video. How long does one of those things take to produce?

RG: I don't even want to say,

KK: Okay.

RG: I do not even want to say, no. I've been up since four o'clock this morning rendering video and compositing. Yeah, this is my day, pretty much. It's not easy. But it is worthwhile. Yeah.

KK: Well, I agree. I mean, I think, you know, so many of our colleagues, I think, kind of view calculus as this drudgery. But I still love teaching it. And I know you do, too.

RG: Absolutely.

KK: And I think it's important, because this is really a lot of what our job is, as academics, as professional mathematicians. Yes, we're proving theorems, all that stuff, that's great. But, you know, day in, day out, we're teaching undergraduates introductory mathematics. That's a lot of what we do. And I think it's really important to do it well.

EL: Well, and it can help, you know, bring people into math like it did for Rob.

KK: That’s right.

RG: Exactly. That's exactly right. Controversial opinion, but, you know, you get these people out there who say, oh, calculus, this is outdated, we don't need that anymore, just teach people data analysis or statistics. I think that's a colossal error. And that it's possible to take all of these classical ideas in calculus and just make them current, make them relevant, connect them to modern applications, and really reinvigorate the subject that you need to have a strong foundation in in order to proceed.

KK: Absolutely. And I, you know, I try to mix the two, I try to bring data into calculus and say, you know, look, engineering students, you’re mostly going to have data, but this stuff still applies. You know, calculus for me is a lot about approximation, right? That's what the whole Taylor Series business, that's what it's for.

RG: Definitely.

KK: And really trying to get students to understand that is one of my main goals. Well, this has been great fun. Thanks for taking time out from rendering video.

EL: Yeah, video rendering.

RG: Yes. I'm going to turn around and go right back to rendering as soon as we're done.

KK: That’s right, you basically have a professional quality studio in your in your basement, right?Is this how this works?

RG: This is how it works. Been renovating, oh, I don't know. It's about a year ago I started renovations and got a nice little studio up and running.

KK: Excellent. Do you have, like, foam on the walls and stuff like that?

RG: Yes, I'm touching the foam right now.

KK: All right. Yeah. So Evelyn I aren't that high-tech. We've just now gotten to the sort of like, multi-channel recording kind of thing.

RG: Ooh.

KK: Well, yeah, well, we're doing this now, right, where we’re each recording our own audio. I'm pleased with the results so far. Well, Rob, thanks again, and we appreciate your joining.

EL: Thanks for joining us.

RG: Thank you. It's been a pleasure chatting.

Episode 37 - Cynthia Flores

Evelyn Lamb: Hello and welcome to My Favorite Theorem, a podcast where we ask mathematicians to tell us about their favorite theorems. I'm Evelyn Lamb. I'm one of your hosts. I am a freelance math and science writer in Salt Lake City, Utah. Here's your other host.

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

All right. I am making some bread right now, and it smells really great in my house. So slightly torturous because I won't be able to eat it for a while.

KK: Sure. So I make my own pizza dough. But I always stop at bread. I never that extra step. I don't. I don't know why. Are you making baguettes? Are you doing the whole...

EL: No. I do it in the bread machine.

KK: Oh.

EL: Because I'm not going to make, yeah, I'm not going to knead and shape a loaf. So that's the compromise.

KK: Oh. That that's the fun part. So I've had a sourdough starter for, the same one for at least three or four years now. I've kept this thing going. And I make my own pizza crust, but I'm just lazy with bread. I don't eat a lot of bread.

EL: So yeah. And joining us to talk about--on BreadCast today--I'm very delighted to welcome Cynthia Flores. So hi. Tell us a little bit about yourself.

Cynthia Flores. Oh, thanks for having me on the show. I'm so grateful to join you today, Kevin and Evelyn. Well, I'm an assistant professor of mathematics and applied physics at California State University Channel Islands in the Department of Math and Physics. The main campus is not located on the Channel Islands.

EL: Oh, that's a bummer.

CF: It's actually located in Camarillo, California. It's one hour south of Santa Barbara, one hour north of downtown Los Angeles, roughly.

But the math department does get to have an annual research retreat at the research station located in the Santa Rosa Island. So that's kind of neat.

KK: Oh, how terrible for you.

EL: Yeah. That must be so beautiful.

KK: I was in Laguna Beach about a week and a half ago, which is, of course, further south from there, but still just spectacularly beautiful. Really nice.

CF: Yeah, I feel really fortunate to have the opportunity to stay in the Southern California area. I did my PhD at UC Santa Barbara, where I studied the intersections of mathematical physics, partial differential equations, and harmonic analysis and has motivated what I'm going to talk about today.

KK: Good, good, good.

EL: Yeah. Well, and Cynthia was on another podcast I host, the Lathisms podcast. And I really enjoyed talking with her then about the some of the research that she does. And she had some fun stories. So yeah, what is your favorite theorem? What do you want to share with us today?

CF: I'm glad you asked. I have several favorite theorems, and it was really hard to pick, and my students have heard me say repeatedly that my favorite theorem is the fundamental theorem of calculus.

EL: Great theorem.

KK: Sure.

CF: It's also a very, I find, intimidating theorem to talk about on this series, especially with so many creative individuals pairing their favorite theorems with awesome foods and activities. And so I just thought that one was maybe something to live up to. And I wanted to start with something that's a little closer to to my research area. So I found myself thinking of other favorites, and there was one in particular that does happen to lie at the intersection of my research area, which is mathematical physics, PDEs and harmonic analysis. And it's known as Heisenberg's Uncertainty Principle. That's how it's really known by the physics community. And in mathematics, it's most often referred to as Heisenberg's Uncertainty Inequality.

EL: Okay.

CF: So, is it familiar? I don't know.

EL: I feel like I've heard of it, but I don't--I feel like I've only heard of it from kind of the pop science point of view, not from the more technical point of view. So I'm very excited to learn more about it.

KK: So I actually have a story here. I taught a course in mathematics and literature a couple years back with a friend of mine in the in the foreign languages department. And we watched A Serious Man, this Coen Brothers movie, which, if you haven't seen is really interesting. But anyway, one of the things I made sure to talk about was Heisenberg's Uncertainty Principle, because that's sort of one of the themes, and of course now I forgotten what the inequality is. But I mean, I remember it involves Planck's constant, and there's some probability distribution, so let's hear it.

CF: Mm hmm. Yeah, yeah. So I was, I was like, this is what I'm going to pair it with. Like, I'm going to pair the conversation, like the mathematics description, physical description, with, basically I was thinking of pairing it with something Netflix and chill-like. I'm really glad that you brought that up, and I'll tell you more in a little bit about what I'm pairing it with. But first, I'll start mathematically. Mathematically, the theorem could be stated as follows. Given a function with sufficient regularity and decay assumptions, the L2 norm of the function is less than or equal to 2 over the dimension the function's defined on, multiplied by the product of the L2 norm of its first moment and the L2 norm of its gradient. And so mathematically, that's the inequality.

This wasn't stated this way by Heisenberg in the 1920s, which I believe he was recognized with a Nobel Prize for later on. Physically, Heisenberg described this in different ways it could be understood. Uncertainty might be understood as the lack of knowledge of a quantity taken by an observer, for example, or to the uncertainty due to experimental inaccuracy, or ambiguity in some definition, or statistical spread, as, as Kevin mentioned.

And actually, I'm going to recommend to the listeners to go to YouTube. There's a YouTuber named Veritasium, I'm not sure if I'm pronouncing that correctly.

EL: Oh, yeah, yeah.

CF: Yeah, he has a four minute demonstration of the original thought by Heisenberg and an experiment having to do with lasers that basically tells us it's impossible to simultaneously measure the position and momentum of a particle with infinite precision. The infinite precision part would be referring to something that we might call certainty. So in the experiment, that the YouTuber is recreating, a laser is shown through two plates that form a slit, and the split is becoming narrower and narrower. The laser is shone through the slit and then projected onto a screen. And as the slit is made narrower, the spot on the screen, as expected, is also becoming narrower and narrower. And at some point--you know, Veritasium does a really good job of creating this sort of like little "what's going to happen" excitement-- just when the slit seems to completely disappear and become infinitesimally small, the expectation might be that the that the laser projecting onto the screen would disappear too, but actually at a certain point, when the slit is so narrow, it's about to close, the spot on the screen becomes wider. We see spread. And this is because the photons of light have become so localized that the slit and their horizontal momentum has to become less well defined. And this is a demonstration of Heisenberg's Uncertainty Principle. And so according to Heisenberg--and this is from one of his manuscripts, and I wish I would have written down which one, I'm just going to read it-- "at the instant of time when the position is determined, that is, at the instant when the photon is scattered by the electron, the electron undergoes a discontinuous change in momentum, and this change is the greater the smaller the wavelength of the light employed, in other words, the more exact determination of the position. At the instant at which the position of the electron is known, its momentum, therefore, can be known only up to magnitudes which correspond to that discontinuous change; thus, the more precisely the position is determined, the less precisely the momentum is known, and conversely." And there's also, so momentum and position were sort of the original context in which Heisenberg's Uncertainty Principle was stated, mainly for quantum mechanics. The inequality theorem that I presented was really from an introductory book to nonlinear PDEs, which is really what I study, nonlinear dispersive PDEs specifically. So you could use a lot of Fourier transforms and stuff like that.

But it has multiple variations, one of which is Heisenberg's Uncertainty Principle of energy and time, which more or less is going to tell you the same thing, which is going to bring me to my pairing. Can I can I share my pairing?

KK: Sure.

CF: My pairing--I want to pair this with a Netflix and chill evening with friends who enjoy the Adult Swim animated show Rick and Morty.

KK: Okay.

CF: And an evening where you also have the opportunity to discuss sort of deep philosophical questions about uncertainty and chaos. And so really the show's on Hulu, so you could watch the show. I don't know if either one of you are familiar with the show.

KK: Oh, yeah. Yeah. I have a 19 year old son, how could I not be?

CF: And actually my students were the ones that brought this show and this specific episode to my attention, and I watched it, and so I'll see a little bit about the show. It's a bit, it's somewhat inspired by The Back to the Future movies. It's a comedy about total reckless and epic space adventures with lots of dark humor and a lot of almost real science. I mean, Rick is a mad scientist and Morty is in many ways opposite to Rick. Morty is Rick's grandson and sidekick. Rick uses a portal gun that he created. It allows him and Morty to travel to different realities where they go on some fun adventures. And there are several references to formulas and theorems describing our everyday life. And so particularly the season premiere of season two, Rick and Morty pays homage to Heisenberg's Uncertainty Principle as well as Schrodinger's cat paradox and includes a mathematical proof of Rick's impression of his grandkids.

I won't spoil what he proves about them. I'll let the reader, the listeners, go check that out. But basically season one ended with Rick freezing time for everyone except for him and his two grandkids Morty and Summer. In this premiere, Rick unfreezes time and causes a disturbance in their reference timeline, and any uncertainty introduced by the three individuals gets them removed entirely from time and causes a split in reality into multiple simultaneous realities. The entire episode is following Heisenberg's Uncertainty Principle for energy and time and alluding to the concept from the quantum world that chaos is found in the distribution of energy levels of certain atomic systems. So I'm going to back it up a little bit. We talked about Heisenberg's Uncertainty Principle in terms of momentum and position. Heisenberg's Uncertainty Principle for energy and time is for simultaneous measurements of energy and time, and specifically that the distribution of energy levels and uncertainty and its measurement is a metaphor to chaos within the system. So within a time interval, it's not possible to measure chaos precisely. There has to be uncertainty in the measure, so that the product of the uncertainty and energy and the uncertainty and the time remains larger than h over 4π, the Planck's constant. In other words, you cannot have both, you cannot simultaneously have both small uncertainty in both measurements. In other words, lots of certainty, right? You have small uncertainty, you have lots of certainty.

So you can't have that both happening. So less chaos leads to more uncertainty and vice versa. Less than certainty (or more certainty) leads to more chaos. And so this, you know, this episode, if you watch it, seems to present the common misconception that more uncertainty leads to more chaos. And this is where I've thought about this really hard and even tried to find someone who put it nicely, maybe on a video, I couldn't. But I think--this is just my opinion--I think the writers really got it right on this episode, because the moment that the timeline merges in the episode is the moment when the main character Rick has given up on his chances of fixing a broken tool he was counting on for fixing the timeline. So in fact, in this episode, he's shown doing something which is unlike him. He's shown praying and asking God, or his maker, for forgiveness, you know, as the timeline is, as all of these realities are collapsing. And in my opinion of Rick, this is the largest amount of uncertainty he's ever displayed throughout this series. And this happens right at the moment that he restores the timeline and therefore reduces the chaos. So I really think the writers got it right on that.

EL: That's really neat.

CF: Yeah, yeah, I loved it. And so for me, I also find this as a perfect time to, you know, hang out with friends, Netflix and chill it up, and then afterwards talk, you know. I would really like to challenge the listeners to observe this phenomenon in their real life. And for some people, it might be a stretch. But to some extent, I think we observe Heisenberg's Uncertainty Principle in our daily lives, like in the sense that the more sure that we are about something, or the more plan that we've made for something, the more likely were observe chaos, right? The more things we've gotten planned out, the more things that are actually likely to go wrong. I get to see this at the university, right, with so many young minds planning out their future. And I really see that the more certain a student feels about their plan, the more likely they're going to feel chaos in their life, if things don't go according to plan. So I really enjoy Heisenberg's Uncertainty Principle on so many levels, mathematically, physically, maybe even philosophically, and observing it in our real lives.

EL: Yeah, I really like the the metaphorical aspect you brought here. And if I can reveal how naive I am about Heisenberg's Uncertainty Principle, I didn't know that it was applicable in these different things other than just position and momentum. Maybe I'm the only one. But that's really interesting that there, so are there a lot of other places where this is also the case?

CF: Well, mathematically, it's just a function defined, for example, on Rn that has regularity and decay properties, and so that function's L2 norm--so the statement of the theorem is under those decay and regularity assumptions, that function's L2 norm has to remain less than or equal to 2 over n multiplied by the product of the L2 norm of the first moment of the function times the L2 norm of the gradient of the function. And so in some sense, we can view that as talking about momentum and position, and so that has applications to various physical systems, both momentum and position. But in some sense, whenever you have a gradient of a function, it can also relate to some system's energy. And so mathematically, I think we have the position to view this in a the more abstract way, whereas physically, you tend to only read about the the momentum and position version and less about the energy and time version. So that's why it took me a long time to think about did the writers of Rick and Morty get it right, because they're basically relying on, it seems they're giving the impression that uncertainty is leading to chaos. Because every time someone feels uncertainty, the timeline gets split and multiple, simultaneous versions of reality are going on at the same time, introducing more chaos into the system. And I kept thinking about it: "But mathematically, that's not what I learned, like what's happening?" And so I really think it's at the end where where Rick merges all the timelines together and basically reduces the chaos in the system. I really think that's the moment where we're seeing Heisenberg's Uncertainty Principle at play. We're seeing that in the moment where Rick was the least certain about himself and his abilities to fix this is the moment where the timeline were fixed. I really think someone had to be knowing about the energy and time version of Heisenberg's Uncertainty Principle.

KK: I need to go back and watch this. I've seen all the first two seasons, but I don't remember this one in particular. My son should be here. He could tell you all about it. We could be having this, oh yeah this yeah. It's a bit raw of a show, though, so listener warning, if you don't like obscenities and--

EL: Delicate ears beware.

KK: Really not politically correct humor very often. It's, you know, it's

CF: I agree.

KK: it's a little raw.

CF: Yeah.

KK: It's entertaining. But it's

CF: Yeah, it's definitely dark humor and lots of references to sci-fi horror. And, you know, some references are done well, some are just a little, I don't know.

KK: Yeah.

CF: But I definitely learned about this show from undergraduate students during a conference where we were, you know, stuck in a long commute. And students found themselves talking to me about all sorts of things. And they mentioned this episode where something was proven mathematically, and I'm a huge fan of Back to the Future, I hadn't watched--I only recently, you know, watched the show, even though it's been around for some time, apparently. And I'm a huge fan of Back to the Future. And they're telling me that there's mathematical proofs. And so I'm course I'm like, "Well, I'm gonna have to check out the mathematical proofs." Any mathematician that watches the show could see that the mathematical proof, I'm not sure that it's much of a mathematical proof.

So it got it got me to watch the episode. And once I was watching the episode, what really drew my attention was that I realized they're talking about chaos and uncertainty.

EL: So going back to the theorem itself, where did you encounter that the first time?

CF: First year grad school at UC Santa Barbara. And it's actually--I never told the professor who was teaching a course turned out to eventually go on and become my PhD advisor. And that first year that I was a graduate student at UC Santa Barbara, I was much more interested in differential geometry and topology than I was in analysis. And this was in one of our homework assignments sort of buried in there. And I don't remember exactly who, if it was the professor himself, or maybe one of his current graduate students, or a TA for the course, that explained that inequality and its physical relationship to chaos and uncertainty. And I'm pretty sure that the conversation with whoever it was, it was about chaos and uncertainty. And it wasn't about momentum and position, which I think would have turned me off at the time. But we were talking about this, relating it to uncertainty and measurements and chaos present in the system. And for me, since that moment, I think I've lived by this sort of mantra that if I plan things out, more things are going to go wrong the more planning that I do. But, you know, I kind of have to keep that in mind that I can only plan so much without introducing some chaos into the system. And so it made a huge impression on me. And I asked this professor who assigned this homework assignment, I'm sure it was the first semester, I mean, the first quarter, of graduate real analysis, if he had more reading for me to do. And he became my advisor, and I went into this area, mathematical physics, PDEs, and harmonic analysis. So it made a huge influence on me. And that's why I wanted to include it as my favorite theorem.

EL: Yeah, that's such a great story. It's like your superhero origin story, is this theorem.

KK: Yeah. So surely this L2 norm business, though, came after the fact. Like Heisenberg just sort of figured it out in the physics sense, and then some mathematician must have come up with the L2 norm business.

CF: Right. I actually think Heisenberg came up with it in the physical sense. There was someone who wrote down something mathematically, and I actually haven't gone--I should--I haven't gone through the literature to find out which mathematician wrote down the L2 norm statement of the inequality.

But in the book Introduction to Nonlinear Dispersive Equations by Felipe Linares and Gustavo Ponce-- Gustavo's my advisor--on page 60, it's Exercise 3.14. It proves Heisenberg's inequality and states it the way I've stated it here in this podcast, and it's a really neat analysis exercise. You know, you have to use the density of the Schwartz class functions, you use integration by parts. It's a really neat exercise and really helps you use those tools that PDE people use. And yeah, my advisor doesn't know how much that exercise influenced my decision to study the mathematical physics, PDEs, and harmonic analysis.

KK: Good, then now our listeners have an exercise, too. So,

EL: Yeah.

CF: That's right. Yeah. So my recommendations are watch Rick and Morty, try exercise 3.14 from Introduction to Nonlinear Dispersive Equations, and have a deep philosophical conversation about uncertainty and chaos with your good friends as you Netflix and chill it out.

EL: Nice. Yeah, wise words, definitely. Thanks a lot for joining us. I really need to brush up on some of my physics, I think, and think about this stuff.

CF: I'm happy to talk about it anytime you like. Thank you so much for the invitation. I've really enjoyed talking to you all.

KK: Thanks, Cynthia.

Episode 36 - Nikita Nikolaev & Beatriz Navarro Lameda

Kevin Knudson: Welcome to My Favorite Theorem, a special Valentine’s Day edition this year.

Evelyn Lamb: Yes.

KK: I’m one of your hosts, Kevin Knudson, professor of mathematics at the University of Florida. This is your other host.

EL: Hi. I’m Evelyn Lamb. I’m a math and science writer in Salt Lake City, Utah.

KK: How’s it going, Evelyn.

EL: It’s going okay. We got, we probably had 15 inches of snow in the past day and a half or so.

KK: Oh. It’s sunny and 80 in Florida, so I’m not going to rub it in. This is a Valentine’s Day edition. Are you and your spouse doing anything special?

EL: We’re not big Valentine’s Day people.

KK: So here’s the nerdy thing I did. So Ellen, my wife, is an artist, and she loves pens and pencils. There’s this great website called CW Pencil Enterprise, and they have a little kit where you can make a bouquet of pencils for your significant other, so this is what I did. Because we’ve been married for almost 27 years. I mean, we don’t have to have the big show anymore. So that’s our Valentine’s Day.

EL: Yeah, we’re not big Valentine’s Day people, but I got very excited about doing a Valentine’s Day episode of My Favorite Theorem because of the guests that we have. Will you introduce them?

KK: I know! We’re pleased to have Nikita Nikolaev and Beatriz Navarro, and they had some popular press. So why don’t you guys introduce yourselves and tell everybody about you?

Nikita Nikolaev: Hi. My name is Nikita. I’m a postdoctoral fellow at the University of Geneva in Switzerland. I study algebraic geometry of singular differential equations.

Beatriz Navarro Lameda: And I’m Beatriz. I’m currently a Ph.D. student at the University of Toronto, but I’m doing an exchange program at the University of Geneva, so that’s why we’re here together. And I’m studying probability, in particular directed polymers in random environments.

EL: Okay, cool! So that is actually applicable in some way.

BNL: Yes, it is.

EL: Oh, great!

KK: So why don’t we talk about this whole thing with the wedding? So we had this conversation before we started recording, but I’m sure our listeners would love to hear this. So what exactly happened at your wedding?

NN: Both of us being mathematicians, of course, we had almost everybody was either a mathematician or somehow mathematically related, most of our guests. So we decided to have a little bit of fun at the wedding, sprinkle a little bit of maths here and there. And one of the ideas was to, when the guests arrive at the dinner, in order for them to find which table they’re sitting at, they would have to solve a small mathematical problem. They would arrive at the venue there, and they would open their name card, and the name card would contain a first coordinate.

BNL: And a question.

NN: And a question. And the questions were very bespoke. It really depended on what we know their mathematical background to be. We had many people in my former research group, so I pulled questions from their papers or some of the talks they’ve given.

EL: This is so great! Yeah.

NN: And there were some people who are, maybe they’re not mathematicians, they’re engineers or chemists or something, and we would have questions which are more mathematically flavored rather than actual mathematical questions just to make everyone feel like they’re at a wedding of mathematicians.

EL: Right.

NN: So right. They had to find out two coordinates. All the tables were named after regular polyhedra, and they had to find out what their polyhedron of the night was.

EL: Okay.

NN: In order to do that, there was a matrix of polyhedra. Each one had two coordinates, and once you find out what the two coordinates are, you look at that matrix, and it gives you what polyhedron you’ve got. So as a guest, you would open the name card, and it would contain your first coordinate and a question and a multiple choice answer. And the answers were,

BNL: Usually it was one right answer and two crazy answers that had nothing to do with the question. Most of them were 2019 because that’s the year we got married, and then some other options. And then once you choose your answer, you would be directed to some other card that had a name of some mathematical term or some theorem, and that one would give you the second coordinate.

NN: So we made this cool what we called maths tree. We had several of these manzanita trees, and we put little cards on them with names, with these mathematical terms, with the answers, with people’s questions, and we just had this tree with cards hanging down, more than 100 cards hanging down. What I liked, in mathematicians it induced this kind of hunting instinct. You somehow look at this tree, and there are all these terms that you recognize, and you’ve seen before in your mathematical career, and you’re searching for that one that you know is the correct one.

BNL: And of course we wanted to make sure everyone found their table, so if they for any reason chose the wrong answer, they would also be directed to some card with a mathematical term. And when they opened it, it would say, “Oops, try again.” So that way you knew, okay, I just have to go and try again and find what the correct coordinate would be.

KK: This is amazing.

NN: And then to foolproof the whole thing, during the cocktail hour, they would do this kind of hunting for mathematical terminology, but then the doors would open into the dinner room, and just like most textbooks, when you open the back of the textbook, there’s the answer key, in the dinner room we had the answer key, which was a poster with everyone’s names

BNL: And their polyhedra

NN: And their polyhedron of the night.

EL: Yeah.

NN: So it was foolproof. I think some commentators on the internet were very concerned that some guests wouldn’t find their seat and starve to death.

EL: Leave hungry.

NN: No, it was all thought through completely.

KK: Some of the internet comments, people were just incredulous. Like, “I can’t believe these people forced their guests to do this!” They don’t understand, we would think this was incredible. This is amazing!

EL: Yeah! So delightfully nerdy and thoughtful. So, yeah, we’ve mentioned, this did end up on the internet in some way, which is how I heard about it, because I sadly was not invited to your wedding. (Since this is the first time I have looked at you at all.) So yeah, how did it end up making the rounds on some weird corner of the internet?

NN: So basically a couple of weeks before the wedding, I made a post on Facebook. It was a private Facebook post, just to my Facebook friends. You know, a Facebook friend is a very general notion.

EL: Right.

NN: I kind of briefly explained that all our guests are mathematicians, so we’re going to do this cool thing, we’re going to come up with mathematical questions, and one of my Facebook “friends,” a Facebook acquaintance, I later found out who it was, they didn’t like it so much, and they did a screengrab, and then they posted, with our names redacted and everything redacted, they made a post on Reddit which was like, “Maths shaming, look, these people are forcing their guests to solve a mathematical question to find their seat, maths shaming.”

BNL: It was in the “bridezilla” thread. “This crazy bride is forcing their guests to solve mathematical problems,” and how evil she is. Which, funny because Nikita was the one who wrote that Facebook post.

NN: I actually was the one.

BNL: So it was not a bridezilla, it’s what I like to call a Groom Kong.

NN: That’s right. So then this Reddit thread kind of got very popular, and later some newspaper in Australia picked it up, and then it just snowballed from there. Fox News, Daily Mail, yeah.

KK: Well, this is great. This is good, now you’ve had your 15 minutes of fame, and now life can get back to normal.

EL: Yeah.

KK: This is a great story. Okay, but this is a podcast about theorems, so what is your favorite theorem?

NN: Right, yeah. So we kind of actually thought long and hard about what theorem to choose. Like, what is our favorite theorem is such a difficult question, actually.

KK: Sure.

NN: It's kind of like, you know, what is your favorite music piece? And it's, I mean, it's so many variables. Depends on the day, right?

EL: Yeah.

NN: But we ended up deciding that we were going to choose the intermediate value theorem.

KK: Oh, nice.

NN: As our favorite theorem.

KK: Good.

BNL: So, yes, the intermediate value theorem is probably one of the first theorems that you learn when you go to university, right? Like calculus you start learning basic calculus, and it's one of the first theorems that you see. Well, what it says is that well, suppose you start with a continuous function f, and you look at some interval (a, b), so the function f sends a to f(a), b to f(b), and then you pick any value y that is between f(a) and f(b). And then you know that you will find a point c that is between a and b, such that f(c) equals y.

So it looks like an incredibly simple statement. Obvious.

KK: Sure.

BNL: Right, but it is a quite powerful statement. Most students believe it without proof. They don't need it. It's, yes, absolutely obvious. But, well, we have lots of things that we like about the theorem.

NN: Yeah, I mean, it feels incredibly simple and completely obvious. You look at it, and, you know, it's the only thing that could possibly be true. And the cool thing about it, of course, is that it represents kind of the essence of what we mean by continuous function.

KK: Sure.

EL: Yeah.

NN: In fact, actually, if you look at the history, before our modern formal definition of continuity, that was part of the property that was a required property that people used to use as part of the definition of continuity. In fact, actually, if you look at the history, before we formalize the definition of continuity, people were very confused about what a continuous function actually should mean. And many thought, erroneously, that this intermediate value property was equivalent to continuity. In some sense, it's what you would want to believe because it really is the property that more or less formalizes what we normally tell our students, that heuristically, a continuous function is one that if you want to draw it, you can draw it without taking off your pencil off of a piece of paper, and that's what the Intermediate Value Theorem, this intermediate value property, it represents that really.

But for all its simplicity and triviality, if you actually look at it properly, if you look at our modern definition of continuity using epsilon-delta, then it becomes not obvious at all.

BNL: Yes. So if you see epsilon, you look at the definition of continuity, and have epsilons, deltas, how is it possible that from this thing, you get such an obvious statement, like the intermediate value theorem? So what the intermediate value theorem is telling us is that, well, continuous functions do exactly what we want them to do. They are what we intuitively think of a continuous function. So in a sense, what the intermediate value theorem is doing for us is serving as a bridge between this formal definition that we encounter in university. So we start first year calculus, and then our professor gives us this epsilon-delta definition of continuity. And it's like, oh, but in high school, I learned that a continuous function is one that I can draw without lifting my pencil. Well, the intermediate value theorem is precisely that. It's connecting the two ideas, just in a very powerful way.

NN: Yeah. And also, you know, it cannot be overstated how useful it is. I mean, we use it all the time. As a geometer, of course, you know, you use some generalization of it, that continuous functions send connected sets to connected, and we use it all the time, absolutely, without thinking, we take it absolutely for granted.

BNL: So even if you do analysis, you are using it all the time, because you can see that the intermediate value theorem is also equivalent to the least upper bound property, so the completeness axiom of the real numbers. Which is quite incredible, to see that just having the intermediate value theorem could be equivalent to such a fundamental axiom for the real numbers, right? So it appears everywhere. It's surprising. We know, it's very easy, when you see the proof of the intermediate value theorem, you see that it is a consequence of this least upper bound property, but the converse is also true. So in a sense, we have that very powerful notion there.

KK: I don't think I knew the converse. So I'm a topologist, right? So to me, this is just a statement that the continuous image of a connected set is connected. But then, of course, the hard part is showing that the connected subsets of the real line are precisely the intervals, which I guess is where the least upper bound property comes in.

BNL: Yes, indeed, yes. Exactly yes.

KK: Okay. I haven't thought about analysis in a while. As it turns out, we're hiring several people this year. And, for some of them, we've asked them to do a teaching demonstration. And we want them all to do the same thing. And as it so happens, it's a calculus one demonstration about continuity and the intermediate value theorem.

BNL: Oh.

EL: Nice.

KK: So in the last month, I've seen, you know, 10 presentations about the intermediate value theorem. And I've come to really appreciate it as a result. My favorite application is, though, that you can use it to prove that you can always make any table level, or not level, but all four legs touch the ground at the same time.

BNL: Yes.

KK: Yeah, that's, that's great fun. The table won't be level necessarily, but all four feet will be on the ground, so it won't wobble.

BNL: Yes.

EL: Right.

NN: If only it were actually applied in classrooms, right?

KK: Right.

EL: Yeah.

NN: The first thing you always do when you come to, you sit at a desk somewhere, is to pull out a piece of paper to actually level it.

EL: Yeah. So was this a theorem that you immediately really appreciated? Or do you feel like your appreciation has grown as you have matured mathematically?

BNL: In my case, I definitely learned to appreciate it more and more as I matured mathematically. The first time I saw the theorem, it's like, "Okay, yes, interesting, very cool theorem." But I didn't realize at the moment how powerful that theorem was. Then as my mathematical learning continued, then I realized, "Oh, this is happening because of the intermediate value theorem. And this is also a consequence of it." So there's so many important things that are a consequence, of the intermediate value theorem. That really makes me appreciate it.

NN: Well, there's also somehow, I think this also comes with maturity, when you realize that some very, what appear to be very hard theorems, if you strip away all the complexity, you realize that they may be really just some clever application of the intermediate value theorem.

BNL: Like Sharkovskii's theorem, for example, is a theorem about periodic points of continuous functions. And it just introduces some new ordering in the natural numbers. And it tells you that if you have a periodic point of some period m, then you will have periodic points of any period that comes after m in that ordering. You can also look at the famous "period three implies chaos."

KK: Right.

BNL: A big component of it is period three implies all other periods. And the proof of it is really just a clever use of the intermediate value theorem. It's so interesting, that such an important and famous theorem is just a very kind of immediate--though, you know, it takes some work to get it--but you can definitely do it with just the Intermediate Value Theorem. And I actually like to present that theorem to students in high school because they can believe the Intermediate Value Theorem.

EL: Yeah.

BNL: That's something that if you tell someone, "This is true," no one is going to question it is definitely true.

KK: Sure.

BNL: And then you tell them, "Oh, using this thing that is obvious, we can also prove these other things." And I've actually done with high school students to, you know, prove Sharkovskii's theorem just starting from the fact that they believe the intermediate value theorem. So they can get to higher-level theorems just from something very simple. I think that's beautiful.

NN: Yeah, that's kind of a very astonishing thing, that from something so simple, and what looks obvious, you can get statements which really are not obvious at all, like what she just explained, Sharkovskii's theorem, that's kind of a mind blowing thing.

EL: Yeah, you're making a pretty good case, I must say.

KK: That's right.

EL: So when we started this podcast, our very first episode was Kevin and I just talking about our own favorite theorems. And I have already since re-, you know, one of our other guests has taken my loyalty elsewhere. And I think you're kind of dragging me. So I think, I think my theorem love is quite fickle, it turns out. I can be persuaded.

KK: You know, in the beginning of our conversation, you pointed out, you know, how does one choose a favorite theorem, right? And, and it's sort of like, your favorite theorem du jour. It has to be.

BNL: Exactly, yes.

EL: Yeah.

KK: All right, so what does one pair with the intermediate value theorem?

BNL: So we thought about it. And to continue with the Valentine's Day theme, we want to pair the intermediate value theorem with love in a relationship.

KK: Ah, okay, good.

BNL: The reason why we want to pair it with love is because when you love someone, it's completely obvious to you. You just know it's true, you know you love someone.

KK: That's true.

BNL: You just feel like there's no proof required. It's just, you know it, you love this person.

NN: It's the only thing that can possibly be true, there's no reason to prove it.

BNL: But also, just like any good theorem, you can also prove, you can provide a proof of love, right? You can show someone that you love them.

NN: Any good mathematical theorem can always be supplied with a very rigorous, detailed to whatever required level proof. And if you truly, really truly love someone, you can prove it. And if someone questions, any part of that proof, you can always supply more details and a more detailed explanation for why why you love that person. And that's why there's a similarity between the intermediate value theorem and love in a relationship.

EL: Yeah, well, I'm thinking of the poem now, "How do I love thee? Let me count the ways," This is a slightly mathematically-flavored poem.

KK: But I think there must be at least, you know, the, the continuity of the continuum ways, right? Or the cardinality of the continuum ways.

NN: Absolutely.

KK: That's an excellent pairing.

EL: Yeah.

BNL: We also thought that love is something that we feel, we take it as an obvious statement, and then from love, we can build so many other things, right? Like in the intermediate value theorem case, we start from a theorem that looks obvious, and using it, we can prove so many other theorems. So it's the same, right, in a relationship. You start from love, and then you can build so many other great things.

EL: Yeah, a marriage for example.

BNL and NN: For example, yes.

EL: Yeah. And a ridiculously amazing wedding game as part of that.

NN: There were some other mathematical tidbits in the wedding. So one of them I'll mention is our rings. Our wedding bands are actually Möbius bands.

KK: Oh, I see.

EL: Okay, very nice.

NN: We had to work with a jeweler. And there's a bit of a trick, because if you just take a wedding band, and you do the twist to make it a Möbius band, than the place where it twists would stick out too much.

EL: Yeah.

NN: So the idea is to try to squish it. And that, of course, is a bit challenging if you want to make a good-looking ring, so that was part of the problem to be solved.

EL: Yeah. Well, my wedding ring is also--it's not a Möbius band. But it's one that I helped design with a particular somewhat math-ish design.

KK: My wife and I are on our second set of wedding bands. The first ones, because we were, I was a graduate student and poor, we got silver ones. And silver doesn't last as long, so we're on our second ones. But the first ones were handmade, and they were, they had sort of like a similar to Evelyn's sort of little crossing thing. So they were a little bit mathy, too. I guess that's a thing that we do, right?

EL: Yeah.

NN: It's inevitable.

KK: Yeah, excellent.

KK: So we like to give our guests a chance to plug anything. Do you have any websites, books, wedding registries that you want to plug?

NN: Actually, in terms of the wedding registry, lots of our guests, of course, were asking. We didn't have a wedding registry because given the career of a postdoc, where you travel from place to place every few years, a wedding registry isn't the most practical thing. Yeah, difficult.

BNL: Yes. So we said, well, you can just give us anything you like, we'll have a box where you can leave envelopes. And some of our guests were very creative. They gave us, some of them decided to give us money. But the amounts they chose were very interesting, because they were, like, some integer times e or times π, or some combination. They wrote the number and then they explained how they came up with that number. And that was very interesting and sweet.

NN: Some of them didn't explain it. But we kind of understood. We cracked the code, essentially, except one. So one of our friends wrote us a check with a very strange number. And to this day,

BNL: We still don't know what the number is.

NN: We kept trying to guess what it could be. But no, I don't know. Maybe eventually I'll just have to ask. I'd like to know.

KK: Maybe it was just random.

NN: Maybe it was just random.

BNL: Yeah, I think one of the best gifts people gave us was their reaction right after seeing their card. In particular, there is a very nice story of a guest who really, really loved the way we set up everything and maybe you can tell us about that.

NN: Yeah, so we, at the dinner we would approach tables to say hi to some guests, and so this particular, he's actually Bea's teaching mentor.

BNL: So I'm very much into teaching. And he's the one who taught me most of the things I know.

NN: So we approached him, and, and he looked at us, and he pulled out the name card out of his breast pocket like, "This. This is the most beautiful thing I've ever seen. This is incredible. It's from my last paper, isn't it?" Yes. Yeah, that's right. He's like, "I have to send it to my collaborator. He's going to love it." And just seeing that reaction, him telling us how much he loved the card, just made all those hours that I and Bea spent reading through papers and trying to come up with some kind of, you know, short sounding question to be put into multiple choice, made all of that worthwhile.

EL: Yeah, I'm just imagining it. Like, usually you don't have to, like, cram for your wedding. But yeah, you've got all these papers you've got to read.

BNL: Yeah, we spent days going through everyone's papers and trying to find questions that were short enough to put in a small card and also easy to answer as a multiple choice question.

NN: Yeah, some were easy. So for example, my former PhD advisor came to our wedding, and I basically gave him a question from my thesis, you know, just to make sure he'd read it.

EL: Yeah.

NN: So when we approached him at the dinner and I said, "Oh, did you like the question?" and he just looked at me like, "Yeah, well I gave you that question two years ago!"

EL: Yeah

NN: So, yes, some questions were easy to come up with. Some questions were a bit more difficult. So we had a number of people from set theory, and neither of us are in set theory. I'd never, ever before opened a paper in set theory. It was all very, very new to me.

EL: Nice.

KK: Well, this has been great fun. Thanks for being such good sports on short notice.

EL: Yeah.

KK: Thank you for joining us.

BNL: Yeah.

EL: Yeah, really fun to talk to you about this. It's so much better than even the Reddit post and weird news stories led me to believe.

KK: Well, congratulations. it's fun meeting you guys. And let me tell you, it's fun being married for 27 years, too.

NN: We're looking forward to that.

KK: All right, take care.

NN: Thank you. Bye bye.

BNL: Bye.

Episode 35 - Nira Chamberlain

Kevin Knudson: Welcome to My Favorite Theorem, a podcast about mathematics, favorite theorems, and other random stuff that we never know what it’ll be. I’m one of your hosts, Kevin Knudson. I’m a professor of mathematics at the University of Florida. This is your other host.

Evelyn Lamb: Hi, I'm Evelyn Lamb. I'm a freelance math and science writer in Salt Lake City, Utah, where I forgot to turn on the heat when I first woke up this morning. I've got separate systems. So it is very cold in the basement here where I am recording.

KK: Well, yeah, it's cold in Florida this morning. It was, you know, in the mid-60s. It's very pleasant. I'm still in short sleeves. Our listeners can't see this, but I'm in short sleeves. Evelyn’s in a sweater. And our guest is in a jacket in his attic.

EL: Yes.

KK: So today we are happy to welcome Nira Chamberlain all the way from the UK. Can you tell everyone about yourself a little bit?

Nira Chamberlain: Yes, hello. My name is doctor Nira Chamberlain. I’m a professional mathematical modeler. I'm also the president-designate of the Institute of Mathematics and its Applications.

KK: Fantastic. So tell us about the IMA a little bit. So we have one of those here, but it's a different thing. So what is it?

NC: Right. I mean, the Institute of Mathematics and its Applications is a professional body of mathematicians, of professional mathematicians, and it's a learned society. It's been around since 1964. And it is actually to make sure that UK has a strong mathematical culture and look after the interest of mathematicians by industry, government and academia.

KK: Oh, that's great. Maybe we should have one of them here. So the IMA here is something else. It’s a mathematics institute. But maybe the US should have one of these. We have the AMS, right, the American Mathematical Society.

EL: Or SIAM might be more similar because it does applications, applied math.

KK: Yeah, maybe.

EL: Yeah, we’ve kind of got some.

NC: So we asked you on for lots of reasons. One is, you know, you're just sort of an interesting guy. Two, because you’re an applied mathematician, and we like to have applied mathematicians on as much as we can, Three you actually won something called the Great Internet Math-Off this summer, of which Evelyn was a participant.

EL: Yes. So he has been ruled—he’s not just an interesting guy, he has been officially ruled—the most interesting mathematician in the world…among people who were in the competition. The person who ran it always put this very long disclaimer asterisk, but I think Nira definitely has some claim on the title here. So, yeah. Do you want to talk a little bit about the big, Great Internet Math-Off?

NC: Yes, we have let's say an organization, a group of mathematicians that do a blog, Aperiodical, and they decided to start this competition called the big internet math-off. And it’s a as a knockout tournament, 16 mathematicians, and they put up something interesting about mathematics. It was put up on the internet, it was there for 48 hours, the general public would vote for what they found was their most favorite or most interesting, and the winner would progress to the next round, and it was four rounds all together. And if you reach to the final end, and you win it, you get the title “World's Most Interesting Mathematician.” And when I was invited, I thought, “Oh, isn't this really for those mathematicians that are pure mathematicians and those public communicators and those into puzzles? I mean, I'm a mathematical modeler, I’m in applied mathematics, so what am I really going to talk about?” And then when I saw that when I was actually introduced as the applied mathematician and everybody else was, let's say the public communicator, and here's the applied mathematician. It was almost like: then here's the villain—boo!

I thought, “Okay, there you go.” I’m thinking, “All right, what we're going to do is I'm actually going to stick to being an applied mathematician.” So three out of the four topics I actually introduced were about applied mathematics, and yes, the fourth topic was actually about the history of mathematics. And I was fortunate enough to get through each of the rounds and win the overall competition. It was very interesting and very good.

EL: Yeah, and I do wish — I think you look very interesting right now—I wish our listeners could see that you've got headphones on that make you look a little bit like a pilot, and behind you are these V-shaped beams, I guess in the attic, where I can totally imagine you, like, piloting some ship here, so you're really looking the part this morning, or this afternoon for you.

NC: Thank you very much indeed. I mean that’s what I call my mathematics attack room, which is the attic, and I have 200 math books behind me. And I’ve got three whiteboards in front of me, quite a number of computer screens. And I’ve got all my mathematical resources all in one place.

KK: Okay, so I just took a screenshot. So maybe with your permission, we’ll put this up somewhere.

So this is a podcast about theorems. So, Nira what is your favorite theorem?

NC: Okay, my favorite theorem is actually to do with the Lorenz equation, the Lorenz attractor. Now it was done in the 1960s by a meteorologist called Edward Lorenz. And what he wanted to do was to take a a partial differential equation, see if he could make some simplifications to it, and he came up with three nonlinear ordinary differential equations to actually look at, let's say, the convection and the movement, to see where we can actually use that to do some meteorological predictions. And then he got this set of equations, went to work solving it numerically, and then he decided, “Actually, I’d better restart my computer game because I've done something wrong.” So he went back, he restarted the computer, but he actually changed the initial conditions by a little bit. And then when he came back, he actually saw that the trajectory of the solution was different from what he had started with. When he went back and started checking, he actually saw that the initial conditions only changed by a little bit, and what was this? It was probably one of the first examples of the “butterfly effect.” The butterfly effect is saying that if, let's say, a butterfly flaps its wings, then that will prevent a hurricane going into Florida — topical.

KK: Yeah, it’s been a rough month.

NC: Yeah, or, if, let's say, another butterfly flaps its wings, then maybe another hurricane may go into Salt Lake City, for example. And this is, like I said, an example of chaotic behavior once you choose certain parameters now. The reason why I like this theorem so much is I was actually introduced to this topic when I was in my final year of my mathematics degree. And it probably was one of the introductions to the field of mathematical modeling, recognizing that when you actually model reality, mathematics is powerful, but also has its limitations. And you’re just trying to find that boundary between what can be done and what can't be done. Mathematical modeling has a part to play in that.

KK: Right. What's so interesting about meteorological modeling is that I've noticed that forecasts are really good for about two days.

NC: Yeah.

KK: So with modern computing power, I mean, of course, as you pointed out, everything is so sensitive to initial conditions, that if you have good initial data, you can get a good forecast for a couple of days, but I never believe them beyond that. It's not because the models are bad. It's because the computation is so precise now that the errors can propagate, and you sort of get these problems. Do you have any sense of how we might extend those models out better, or is it just a lost cause, is it hopeless?

NC: It's probably a lost cause. I agree with you to a certain extent. But it's a case of when we're dealing with, let’s say, meteorological equations, if they have chaotic behavior, if you put down initial conditions, and it's changed, you know, it's going out and it's changing, it just shows that, yeah, we may have good predictions to begin with, but as we go on into the future, those rounding errors will come, those differences will come. And it's almost like, let's use an analogy, let's say you go to whatever computer algebra software you have, and you get π, and let’s say you square root it 10 times, and then you raise it to a power 10 times, and then if you square root it 100 times and then you raise it to a power 100 times, and if you keep on repeating that, then actually, when you come back to the figure, you're thinking, “Is this actually π?” No, it's not. And also different calculator and different computer algebra softwares, you’ll see that they will have actually their difference. It’s that point where in terms of when we're doing, predicting a weather system, because of the chaotic behavior of the actual nonlinear differential equations, coupled with those rounding errors, it is very difficult to do that long-term weather forecast. So nobody can really say to me, “By the way, in five years’ time, on the 17th of June, the weather will be this.” That’s very much a nonsense.

KK: Sure, sure. Well, I guess orbital mechanics are that way too, right? I mean, the planetary orbits. I mean, we understand them, but we also can't predict anything in some sense.

NC: Yeah.

KK: Right, right. Living in Florida, I pay a lot of attention to hurricane models. And it's actually really fascinating to go to these various sites. So windy.com is a good one of these. They show the wind field over the whole planet if you want. And they'll also, when there are hurricanes, they have the separate models. So the European model actually turns out to be better than the American one a lot, which is sort of interesting because hurricanes affect us a lot more than— I mean the remnants get to the UK and all of that. But so you’re right, it's sort of interesting, the different implementations—the same equations, essentially, right, that underlie everything get built into different models. And then different computing systems have the different rounding error. And the models, they’re sort of, they're usually pretty close, but they do diverge. It's really very fascinating.

NC: Yeah, I mean, over in the United Kingdom, we had an interesting case in 1987 where the French meteorology office says, “By the way, people in the north of France, they should be aware that there's going to be a hurricane approaching.” While the British meteorologic office was saying, “Oh, there's no way that there's going to be a hurricane. There's no hurricane. Our model says there’s going to be no hurricane.” So the French are saying there’s going to be a hurricane. The British say there’s not going to be a hurricane. And guess what? The French were right and a hurricane hit the United Kingdom.

And because of that what they did is that now the Met Office, which is the main weather place in Britain, what they've done is they put quite a number of boats out in the Atlantic to measure, to come up with a much more accurate measure of the weather system so that they can actually feed their models, and they also use more powerful models because he equation itself remains the same, it’s the information that actually goes into it which is which is the difference, yeah? So in terms of what you said in the American models, it's all dependent on who you get the measurements from because you may not get exactly the measurement from the same boat. You may get it from a different boat, from different boats in a different location, different people. This is where you come to that human factor. Some people will say, “Oh, round it to this significant figure,” while someone else will say, “Round it to that significant figure,” and guess what? All of that actually affects your final results.

EL: Yeah, that matters.

NC: Yes.

KK: So do you do this kind of modeling yourself, or are you in other applications?

NC: Oh, I'm very much in other applications. I mean, I'm still very much a a mathematical modeler. I mean, my research now is to do with—to minimize the probability of artificial intelligence takeover. That’s what my current research I'm doing at Loughborough University.

EL: Well that, you know, the robots will have you first in the line or something in the robot uprising.

NC: Well, we talk about robots, but this is quite interesting. When we're talking about, let's say, artificial intelligence takeover, everybody thinks about the Hollywood Terminator matrix, I Robot, you know, robots marching down the street. But there are different types of AI takeovers, and some of them are much more subtle than that. For instance, one scenario is, let's say for instance, you have a company, and they decide to really upgrade their artificial intelligence, their machine learning, to a certain sense it's more advanced than their competition is. And by doing so, they actually put all their competitors out of business. And so what you have is you have this one company almost running the world economy. Now the question is, would that company make decisions (based on its AI), would they make decisions that are conducive with social cohesion? And you can't put your hand on your heart and say, “Absolutely, yes, because a machine, it’s largely, like, 1-0, it doesn't really care about the consequences of social cohesion. So henceforth, we can actually to a model of that, saying could we ever get to a situation where one company actually dominates all different industrial sectors and ends up, let’s say, running the world economy? And if that's the case, what can what strategies can we actually implement to try and minimize that risk?

EL: It sounds not entirely hypothetical.

KK: No, no. Well, you know, of course the conspiracy theorists types in the US would have you believe that this already exists, right? The Deep State and the Illuminati run everything, right?

EL: But getting back to the Lorenz system and everything, you were saying that this is one of the earliest examples of mathematical modeling you saw. Was it one of the things that inspired you to go that direction when you got your PhD?

NC: Yes, so I was doing that as part of my final year mathematics degree, and I thought, well, this whole idea that, you know, here’s applied mathematics, using mathematics in the real world, saying that there are problems that some people say it's impossible, you can't use mathematics. And you're just trying to push the boundaries of mathematics and say, “This is how we actually model reality.” It was one of the things that actually did inspire me, so Edward Lorenz actually inspire me, just saying, wait a minute, applied mathematics is not necessarily about: here’s a problem, here’s an equation, put the numbers in the right places, and here's a solution. It's about gaining that insight into the real world, learning more about the world around you learning more about the universe around you through through mathematics. And that's what inspired me.

KK: And it's very imprecise, but that's sort of what makes it intriguing, right? I mean, you have to come up with simplifying assumptions to even build a model, and then how much information can we extract from that?

NC: That’s one of the key things about mathematical modeling. I mean, you're looking at the world. The world is complex, full of uncertainty, and it’s messy. And you are making some simplifying assumptions, but the key thing is: do you make simplifying assumptions to an extent that it actually corrupts and compromises your solution, or do you make simplifying assumptions that say, “Actually, this gives me insight into how the world actually works.”? And recognizing which factors do you include, which factors do you exclude, and bring a model that is what I call useful.

KK: Right. That’s the art, right?

NC: Yeah, that's the art. That's the art of mathematical modeling.

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

NC: I chose to pair it with the Jamaican dish called ackee yam and saltfish[16:48] . Now the reason why is with ackee yam and saltfish, if you cook it right, it is delicious, but if you cook it wrong, the Ackee turns out to be poisonous and that’s a bit like the Lorenz equation.

KK: What is ackee? I don't think I know what this is.

NC: Okay. Ackee is actually a vegetable, but if you actually were to look at it, it looks like scrambled egg, but it's actually a vegetable. It's like a yellow vegetable.

EL: Huh.

KK: Interesting.

NC: And yam, it’s like an overgrown, very hard potato. It’s looks like a very overgrown, hard potato.

KK: Sure, yeah.

NC: And saltfish is just a Jamican saying for cod. Even though you could really say ackee yam and cod, they don't call it cod, they call it saltfish.

KK: Okay. All right. So I've never heard ackee.

EL: Yeah, me neither.

KK: I mean, I knew that yams, so in the United States, most people will call sweet potatoes yams, they’ll use those two words interchangeably. But of course, yams are distinct, and I think they can be poisonous if you don't cook them right, right? Or some varieties can. But so ackee is something separate from the yam.

NC: Yeah.

EL: Also poisonous if you don't cook it right.

NC: Absolutely.

KK: So can you actually access this in England, or do you have to go to Jamaica to get this?

NC: Yes, we can access this this in England because in England we have a large West Indian diaspora community.

KK: Sure, right.

NC: And also we do get lots of variety of foods from different countries around the world. So we can, it's relatively easy to to access ackee yam. And also we’ve got quite a number of Caribbean restaurants, so definitely there they are going to cook it right.

KK: So it's interesting, we have a Caribbean restaurant here in town in Gainesville, which of course we're not as far away as you are, but they don't try to poison us. The food is delicious.

EL: That you know of.

KK: Well that's right. I love eating there. The food is really spectacular. But this is interesting.

EL: And is this a family recipe? Do you have roots in in the West Indies, or…

NC: Yes, my parents were from from Jamaica. I still have relatives in Jamaica, and my wife’s descent is Jamaican. Now and again we do have that Caribbean meal. I thought, “Well, what shall I say as a food? I thought, “Well, should I go for the British fish and chips?” I thought, “No, let's go for ackee yam and saltfish.”

KK: Sure, well and actually I think your jacket looks like a Jamaican-influenced thing, right? With the black, green, and yellow, right?

NC: Yes, absolutely. And that's because it's quite cold in the in the attic. This is the same style of jacket as the Jamaican bobsled team, so I decided to wear it, as it’s quite cold up here.

EL: Yeah, Cool Runnings, the movie about that, was an integral part of my childhood. My brother and sister and I watched that movie a lot. So I’m curious about this ackee vegetable, like how sensitive are we talking for the dependence on initial conditions, the dependence on cooking this correctly to be safe? Is it pretty good, or do you have to be pretty careful?

NC: You have to be pretty good, you have to be pretty careful. As long as you follow the instructions you’re okay, but in this case, if you don't cook it long enough, you don't cook it at a high enough temperature, whatever you do, please do not eat it cold, do not eat it raw.

EL: Okay.

KK: Like actually it might kill you, or it just makes you really sick?

NC: It will make you really sick. I haven't heard— well let’s put it this way, I do not wish to carry out the experiments to see what would happen.

KK: Understood.

EL: Yes.

KK: Well this has been great fun. I've learned a lot.

EL: Yeah

KK: Thanks for joining us, Nira.

NC: Thank you very much indeed for inviting me.

Episode 34 - Skip Garibaldi

Kevin Knudson: Welcome to My Favorite Theorem, a podcast about mathematics, theorems, and, I don't know, just about anything else under the sun, apparently. I'm Kevin Knudson. I'm one of your hosts. I'm a professor of mathematics at the University of Florida. This is your other host.

Evelyn Lamb: Hi, I'm Evelyn lamb. I'm a freelance math and science writer based in Salt Lake City. So how are things going?

KK: It's homecoming weekend. We're recording this on a Friday, and for people who might not be familiar with Southeastern Conference football, it is an enormous thing here. And so today is is a university holiday. Campus is closed. In fact, the local schools are closed. There's a big parade that starts in about 20 minutes. My son marched in it for four years. So I've seen it. I don't need to go again.

EL: Yeah.

KK: I had brunch at the president's house this morning, you know. It's a big festive time. I hope it doesn't get rained out, though. It's looking kind of gross outside. How are things for you?

EL: All right. Yeah, thankfully, no parades going on near me. Far too much of a misanthrope to enjoy that. Things are fight here. My alarm clock-- we're also recording in the the week in between the last Sunday of October and the first Sunday of November.

KK: Right.

EL: In 2007, the US switched when it went away from Daylight Saving back to Standard Time to the first Sunday of November. But my alarm clock, which automatically adjusts, was manufactured before 2007.

KK: I have one of those too.

EL: Yeah, so it's constantly teasing me this week. Like, "Oh, wouldn't it be nice if it were only 7am now?" So yeah.

KK: All right. Well, yeah, first world problems, right?

EL: Yes. Very, very much.

KK: All right. So today, we are thrilled to have Skip Garibaldi join us. Skip, why don't you introduce yourself?

Skip Garibaldi: My name is Skip Garibaldi. I'm the director at the Center for Communications Research in La Jolla.

KK: You're from San Diego, aren't you?

SG: Well, I got my PhD there.

KK: Ish?

SG: Yeah, ish.

KK: Okay.

SG: So I actually grew up in Northern California. But once I went to San Diego to get my degree, I decided that that was really the place to be.

KK: Well, who can blame you, really?

EL: Yeah, a lot to love there.

KK: It's hard to argue with San Diego. Yeah. So you've been all over. For a while you're at the Institute for Pure and Applied Math at UCLA.

SG: Yeah, that was my job before I came to the Center for Communications Research. I was associate director there. That was an amazing experience. So their job is to host conferences and workshops which bring together mathematicians in areas where there's application, or maybe mathematicians with different kinds of mathematicians where the two groups don't really talk to each other. And so the fact that they have this vision of how to do that in an effective way is pretty amazing. So that was a great experience for me.

KK: Yeah, and you even got in the news for a while. Didn't you and a reporter, like, uncover some crime syndicate? What am I remembering?

SG: That's right. Somehow, I became known for writing things about the lottery. And so a reporter who was doing an investigative piece on lottery crime in Florida contacted me, and I worked closely with him and some other mathematicians, and some people got arrested. The FBI got involved and it was a big adventure.

KK: So Florida man got arrested. Never heard of that. That's so weird.

SG: There's a story about someone in Gainesville in the newspaper article. You could take a look.

KK: It wasn't me. It wasn't me, I promise.

EL: Whoever said math wasn't an exciting field?

KK: That's right.

Alright, so, you must have a favorite theorem, Skip, what is it?

SG: I do. So you know, I listened to some of your other podcasts. And I have to confess, my favorite theorem is a little bit different from what your other guests picked.

EL: Good. We like the the great range of things that we get on here.

SG: So my favorite theorem for this podcast answers a question that I had when I was young. It's not something that is part of my research today. It's never helped me prove another theorem. But it answers some question I had from being junior high. And so the way it goes, I'm going to call it the unknowability of irrational numbers.

So let me explain. When you're a kid, and you're in school, you probably had a number line on the wall in your classroom. And so it's just a line going left to right on the wall. And it's got some markings on it for your integers, your 0,1,2,3, your -1,-2,-3, maybe it has some rational numbers, like 1/2 and 3/4 marked, but there's all these other points on that number line. And we know some of them, like the square root of two or e. Those are irrational, they're decimals that when you write them down as a number-- like π is 3.14, we know that you can't really write it down that way because the decimal keeps on going, it never repeats. So wherever you stop writing, you still haven't quite captured π.

So what I wondered about was like, "Can we name all those points on the number line?

EL: Yeah.

SG: Are π and e and the square root of two special? Or can we get all of them? And it comes up because your teacher assigns you these math problems. And it's like "x^2+3x+5=0. Tell me what x is." And then you name the answer. And it's something involving a square root and division and addition, and you use the quadratic formula, and you get the answer.

So that's the question. How many of those irrational can you actually name? And the answer is, well, it's hard.

EL: Yeah.

SG: Right?

KK: Like weirdly, like a lot of them, but not many.

SG: Exactly!

EL: Yeah.

SG: So if we just think about it, what would it mean to name one of those numbers? It would mean that, well, you'd have to write down some symbols into a coherent math problem, or a sentence or something, like π is the circumference of a circle over a diameter. And when you think about that, well, there's only finitely many choices for that first letter and finitely many choices for that second letter. So it doesn't matter how many teachers there are, and students, or planets with people on them, or alternate universes with extra students. There's only so many of those numbers you can name. And in fact, there's countably many.

EL: Right.

KK: Right. Yeah. So are we talking about just the class of algebraic numbers? Or are we even thinking a little more expansively?

SG: Absolutely more expansive than that. So for your audience members with more sophisticated tastes, you know, maybe you want to talk about periods where you can talk about the value of any integral over some kind of geometric object.

KK: Oh, right. Okay.

SG: You still have to describe the object, and you have to describe the function that you're integrating. And you have to take the integral. So it's still a finite list of symbols. And once you end up in that realm, numbers that we can describe explicitly with our language, or with an alien language, you're stuck with only a countable number of things you can name precisely.

EL: Yeah.

KK: Well, yeah, that makes sense, I suppose.

SG: Yeah. And so, Kevin, you asked about algebraic numbers. There are other classes of numbers you can think about, which, the ones I'm talking about include all of those. You can talk about something called closed form numbers, which means, like, you can take roots of polynomials and take exp and log.

KK: Right.

SG: That doesn't change the setup. That doesn't give you anything more than what I'm talking about.

EL: Yeah. And just to back up a sec, algebraic numbers, basically, it's like roots of polynomials, and then doing, like, multiplication and division with them. That kind of thing. So, like, closed form, then you're expanding that a little bit, but still in a sort of countable way.

SG: Yes. Like, what kinds of numbers could you express precisely if you had a calculator with sort of infinite precision, right? You're going to start with an integer. You can take it square root, maybe you can take its sine, you know. You can think about those kinds of numbers. That's another notion, and you still end up with a countable list of numbers.

KK: Right. So this sounds like a logic problem.

SG: Yes, it does feel that way.

KK: Yeah.

SG: So, Kevin and Evelyn, I can already imagine what you're thinking. But let me say it for the benefit of the people for whom the word "countable" is maybe a new thing thing. It means that you can imagine there's a way to order these in a list so that it makes sense to talk about the next one. And if you march down that list, you'll eventually reach all of them. That's what it means. But the interesting thing is, if you think about the numbers on the number line, we know going back to Cantor in the 1800s that those are not countable. You use the so-called diagonalization argument, if you happen to have seen that.

KK: Right.

EL: Yeah. Which is just a beautiful, beautiful thing. Just, I have to put a plug in for diagonalization.

KK: Oh, it's wonderful.

SG: I've been thinking about it a lot in preparation for this podcast. I agree.

KK: Sure.

SG: So what that means is that that's the statement, these irrational numbers, you can't name all of them, because there are uncountably many of them, but only countably many numbers you can name.

It sort of has a hideous consequence that I want to mention. And it's why this is my favorite theorem. Because it says, it's not just that you can't name all of them. It's just much worse than that. So the reason I love this theorem is not just that it answers a question from my childhood. But it tells you something kind of shocking about the universe. So when you--if you could somehow magically pick a specific point on the number line, which you can't, because you know, there's--

KK: Right.

SG: You have finite resolution when you pick points in the real world. But pretend you could, then the statement is the chance that the number you picked was a number you could name precisely is very low. Exactly. It's essentially zero.

KK: Yeah.

SG: So the technical way to say this is that the countable subset of real numbers has Lebesgue measure zero.

KK: Right.

SG: So I was feeling a little awkward about using this as my theorem for your podcast, because, you know, the proof is not much. If you know about countable and uncountable, I just told you the whole proof. And you might ask, "What else can I prove using this fact?" And the answer is, I don't know. But we've just learned something about irrational numbers that I think some of your listeners haven't known before. And I think it's a little shocking.

EL: Yeah, yeah. Well, it sounds like I was maybe more of a late bloomer on thinking about this than you, because I remember being in grad school, and just feeling really frustrated one day. I was like, you know, transcendental numbers, the non-algebraic numbers are, you know, 100% of the number line, Lebesgue measure one, and I know like, three of them, essentially. I know, like, e, π, and natural log two. And, you know, really, two of them are already kind of, in a relationship with each other. They're both related to e or the natural log idea. It's just like, okay, 2π. Oh, that's kind of a cheap transcendental number.

Like there's, there's really not that much difference. I mean, I guess then, in a sense, I only know, like, one irrational number, which is square root of 2, like, any other roots of things are non-transcendental, and then I know the rationals, but yeah, it's just like, there are all these numbers, and I know so few of them.

SG: Yeah.

KK: Right. And these other these other things, of course, when you start dealing with infinite series, and you know, you realize that, say, the Sierpinski carpet has area zero, right? But it's uncountable, and you're like, wait a minute, this can't be right. I mean, this is, I think why Cantor was so ridiculed in his time, because it does just seem ridiculous. So you were sitting around in middle school just thinking about this, and your teacher led you down this path? Or was it much later that you figured this out?

SG: Well, I figured out the answer much later. But I worried about it a lot as a child. I used to worry about a lot of things like, your classic question is--if you really want to talk about things I worried about as a child--back in seventh grade, I was really troubled about .99999 with all the nines and whether or not that was one.

EL: Oh yeah.

SG: And I have a terrible story about my eighth grade education regarding that. But in the end, I discovered that they are they are actually equal.

KK: Well, if you make some assumptions, right? I mean, there are number systems, where they're not equal.

SG: Ah, yeah, I'd be happy--I'm not prepared to get into a detailed discussion of the hyperreals.

KK: Neither am I. But what's nice about that idea is that, of course, a lot depends on our assumptions. We we set up rules, and then with the rules that we're used to, .999 repeating is equal to one. But you know, mathematicians like sandboxes, right? Okay, let's go into this sandbox and throw out this rule and see what happens. And then you get non Euclidean geometry, right, or whatever.

SG: Right.

KK: Really beautiful stuff.

SG: I have an analogy for this statement about real numbers that I don't know if your listeners will find compelling or not, but I do, so I'm going to say it unless you stop me.

KK: Okay.

EL: Go for it.

SG: Exactly. So one of the things I find totally amazing about geology is that, you know, we can see rocks that are on the surface of the earth and inspect them, and we can drill down in mines, and we can look at some rocks down there. But fundamentally, most of the geology of the earth, we can't see directly. We've never seen the mantle, we're never going to see the core. And that's most Earth. So nonetheless, there's a lot of great science you can do indirectly by analyzing as an aggregate, by studying the way, earthquake waves propagate and so on. But we're not able to look at things directly. And I think that has an analogy here with the number line, where the rocks can see on the surface are the integers and rationals. You drill down, and you can find some gems or something, and there's your irrational numbers you can name, and then all the ones you'll never be able to name, no matter how hard you try, how much time there is, how many alternate universes filled with people there are, you'll never be able to name, somehow that's like the core because you can't ever actually get directly at them.

EL: Yeah. I like this analogy a lot, because I was just reading about Inge Lehmann who is the Danish seismologist (who I think of as an applied mathematician) who was one of the people who found these different seismic waves that showed that the inner core had the liquid part--or I guess the core had the liquid part and then the solid inner core. She determined that it couldn't all be uniform, basically by doing inverse problems where, like, "Oh, these waves would not have come from this." So that's very relevant to something I just read. Christiane Rousseau actually wrote a really cool article about Inge Lehmann.

SG: Yes, that's a great article.

EL: So yeah, people should look that up.

KK: I'll have to find this.

EL: great analogy. Yeah.

KK: So, we know now that this, this is a long time there for you. So that's another question we've already answered. So, okay, what does one pair with this unknowability?

SG: Ah, so I I think I'm going to have to pair it with one of my favorite TV shows, which is Twin Peaks.

EL: Okay.

SG: So I watch the show, I really enjoy it. But there's a lot of stuff in there that just is impossible to understand.

And you can go read the stuff the people wrote about it on the side, and you can understand a little bit of it. But you know, most of it's clearly never meant to be understood. You're supposed to enjoy it as an aggregate.

KK: That's true. So you and I are the same age, roughly. We were in college when Twin Peaks was a thing. Did you did you watch it then?

SG: No, I just remember that personal ads in the school paper saying, "Anyone who has a video recording of Twin Peaks last week, please tell me. I'll bring doughnuts."

EL: You grew up in a dark time.

SG: Before DVRs, yeah.

KK: That's right. Well, yeah. Before Facebook or anything like that. You had to put an ad in the paper for stuff like this, yeah.

EL: Yeah, I'm really, really understanding the angst of your generation now.

KK: You know what, I kind of preferred it. I kind of like not being reached. Cell phones are kind of a nuisance that way. Although I don't miss paying for phone calls. Remember that, staying up till 11 to not have to pay long distance?

SG: Yeah.

KK: Alright, so Twin Peaks. So you like pie.

SG: Yeah, clearly. And coffee.

KK: And coffee.

SG: And Snoqualmie.

KK: Very good.

SG: I don't know if you--

KK: Sure. I only sort of vaguely remember-- what I remember most about that show is just being frustrated by it, right? Sometimes you'd watch it and a lot would happen. It's like, "Wow, this is bizarre and weird, and David Lynch is a genius." And then there'd be other shows where nothing would happen.

SG: Yes.

KK: I mean, nothing! And, you know, also see Book II of Game of Thrones, for example, where nothing happens, right? Yeah. And David Lynch, of course, was sort of at his peak at that time.

SG: Right.

KK: All right. So Twin Peaks. That's a good pairing because you're right, you'll never figure that out. I think a lot of it was meant to be unknowable.

SG: Yes. Yeah. Have you seen season three of Twin Peaks? The one that was out recently?

KK: No, I don't have cable anymore.

SG: About halfway through that season, there's an episode that is intensely hard to watch because so little happened on it. And if you look at the list the viewership ratings for each episode, there's a steep drop-off in the series at that episode. So this is like the most unknowable part of the number line if you if you follow the analogy.

KK: Okay. All right. That's interesting. So I assume that these these knowable numbers are probably fairly evenly distributed. I guess the rationals are pretty evenly distributed. So yeah.

So So our listeners might wonder if there's some sort of weird distribution to these things, like the ones that you can't name, do they live in certain parts? And the answer is no, they live everywhere.

SG: Yes. That's absolutely right.

EL: I wonder, though, if you can kind of--I'm thinking of continued fraction representations, where there is an explicit definition of number that's well-approximable versus badly-approximable numbers. I guess those are approximable by rationales, not by finite operations or closed form. So maybe that's a bad analogy.

KK: Mm hmm.

SG: Well, if you or your listeners are interested in, thinking about this question some more, then you can Google closed-form number. There's a Wikipedia entry to get people started. And there are a couple of references in there to some really well-written articles on the subject, one by my friend Tim Chow, that was an American Mathematical Monthly, and another one by Borwein and Crandall that was in the Notices of the AMS that's for free on the internet.

EL: Oh, great.

KK: Okay, great. We'll link to those.

EL: And actually, here's, this question, I'm not sure, so I'll just say, is this the same as computable or is closed form a different thing from computable numbers?

SG: Yeah, that's a good question. So there's not a widely-agreed upon definition of the term closed form number. So that's already a question. And then I'm not sure what your definition of computable is.

EL: Me neither.

SG: Okay.

EL: No, I've just heard of the term computable. But yeah, I guess the nice thing is no matter how you define it, your theorem will still be true.

SG: That's right. Exactly.

EL: There's still only countable.

KK: And now we've found something else unknowable: are these the same thing?

SG: Those are really hard questions in general. Yeah. That's the main question plumbed in those articles and referred to is: if you define them in these different ways, how different are they?

EL: Oh, cool.

SG: If you take a particular number, does it sit in which set? Those kinds of questions. Yeah, those are really hard usually, much like you said, what are the transcendental numbers that are--are certain numbers transcendental or not can be a hard question to answer.

EL: Yeah, yeah, even if you think, "Oh yeah, this certainly has to be transcendental, it takes a while to actually prove it."

SG: Yes.

KK: Or maybe you can't. I wonder if some of those statements are even actually undecidable, but again, we don't know. All right, we're going down weird rabbit holes here. Maybe David Lynch could just do a show.

SG: That would be great.

KK: Yeah, there would just be a lot of mathematicians, and nothing would happen

SG: And maybe owls.

KK: And maybe owls. Well, this has been great fun. Thanks for joining us before you head off to work, Skip. Our listeners don't know that it's you know, well, it's now nine in the morning where you are. So thanks for joining us, and I hope your traffic isn't so bad in La Jolla today.

SG: Every day's a great day here. Thank you so much for having me.

KK: Yeah. Thanks, Skip.

Episode 33 - Michele Audin

Evelyn Lamb: Hello and welcome to My Favorite Theorem, a math podcast where we ask mathematicians what their favorite theorem is. I’m one of your hosts, Evelyn Lamb. I’m a freelance math and science writer in Salt Lake City, Utah. And this is your other host.

EL: I’m all right. It’s fall here, or hopefully getting to be fall soon.

KK: Never heard of it.

EL: Yeah. Florida doesn’t have that so much. But yeah, things are going well here. We had a major plumbing emergency earlier this month that is now solved.

KK: My big news is that I’m now the chair of the math department here at the university.

EL: Oh yes, that’s right.

KK: So my volume of email has increased substantially, but it’s and exciting time. We’re hiring more people, and I’m really looking forward to this new phase of my career. So good times.

EL: Great.

KK: But let’s talk about math.

EL: Yes, let’s talk about math. We’re very happy today to have Michèle Audin. Yeah, welcome, Michèle. Can you tell us a little bit about yourself?

Michèle Audin: Hello. I’m Michèle Audin. I used to be a mathematician. I’m retired now. But I was working on symplectic geometry, mainly, and I was interested also in the history of mathematics. More precisely, in the history of mathematicians.

EL: Yeah, and I came across you through, I was reading about Kovalevskaya, and I just loved your book about Kovalevskaya. It took me a little while to figure out what it was. It’s not a traditional biography. But I just loved it, and I was like, “I really want to talk to this person.” Yeah, I loved it.

MA: I wanted to write a book where there would be history and mathematics and literature also. Because she was a mathematician, but she was also a novelist. She wrote novels and things like that. I thought her mathematics were very beautiful. love her mathematics very much. But she was a very complete kind of person, so I wanted to have a book like that.

KK: So now I need to read this.

EL: Yeah. The English title is Remembering Sofya Kovalevskaya. Is that right?

MA: Yeah.

KK: I’ll look this up.

EL: Yeah. So, what is your favorite theorem.

MA: My favorite theorem today is Stokes’ formula.

EL: Oh, great!

KK: Oh, Stokes’ theorem. Great.

EL: Can you tell our listeners a little bit about it?

MA: Okay, so, it’s a theorem, okay. Why I love this theorem: Usually when you are a mathematician, you are forced to face the question, what is it useful for? Usually I’ll try to explain that I’m doing very pure mathematics and maybe it will be useful someday, but I don’t know when and for what. And this theorem is quite the opposite in some sense. It just appeared at the beginning of the 19th century as a theorem on hydrodynamics and electrostatics, some things like that. It was very applied mathematics at the very beginning. The theorem became, after one century, became a very abstract thing, the basis of abstract mathematics, like algebraic topology and things like that. So this just inverts the movement of what we are thinking usually about applied and pure mathematics. So that’s the reason why I like this theorem. Also the fact that it has many different aspects. I mean, it’s a formula, but you have a lot of different ways to write it with integrals, so that’s nice. It’s like a character in a novel.

KK: Yeah, so the general version, of course, is that the integral of, what, d-omega over the manifold is the same as the integral of omega over the boundary. But that’s not how we teach it to students.

MA: Yeah, sure. That’s how it became at the very end of the story. But at the very beginning of the story, it was not like that. It was three integrals with a very complicated thing. It is equal to something with a different number of integrals. There are a lot of derivatives and integrals. It’s quite complicated. At the very end, it became something very abstract and very beautiful.

KK: So I don’t know that I know my history. When we teach this to calculus students anymore, we show them Green’s theorem, and there are two versions of Green’s theorem that we show them, even though they’re the same. Then we show them something we call Stokes’ theorem, which is about surface integrals and then the integral around the boundary. And then there’s Gauss’s divergence theorem, which relates a triple integral to a surface integral. The fact that Gauss’s name is attached to that is probably false, right? Did Gauss do it first?

MA: Gauss had this theorem about the flux—do you say flux?

KK: Yeah.

MA: The flux of the electric—there are charges inside the surface, and you have the flux of the electric field. This was a theorem of Gauss at the very beginning. That was the first occurrence of the Stokes’ formula. Then there was this Ostrogradsky formula, which is related to water flowing from somewhere. So he just replaced the electric charges by water.

KK: Sort of the same difference, right? Electricity, water, whatever.

MA: Yes, it’s how you come to abstraction.

KK: That’s right.

MA: Then there was the Green theorem, then there is Stokes’ formula that Stokes never proved. There was this very beautiful history. And then in the 20th century, it became the basis for De Rahm theory. That’s very interesting, and moreover there were very interesting people working on that in the various countries in Europe. At the time mathematics were made in Europe, I’m sorry about that.

KK: Well, that’s how it was.

MA: And so there are many interesting mathematicians, many characters, different characters. So it's like it's like a novel. The main character is the formula, and the others are the mathematicians.

EL: Yeah. And so who are some of your favorite mathematicians from that story? Anyone that stands out to you?

MA: Okay, there are two of them: Ostrogradsky and Green. Do you know who was Green?

EL: I don't know about him as a person really.

MA: Yeah, really? Do you know, Kevin? No.

KK: No, I don't.

MA: Okay. So nobody knows, by the way. So he was he was just the son of a baker in Nottingham. And this baker became very rich and decided to buy a mill and then to put his son to be the miller. The son was Green. Nobody knows where he learned anything. He spent one year in primary school in Nottingham, and that’s it. And he was a member of some kind of, you know, there are books…it’s not a library, but morally it’s a library. Okay. And that’s it. And then appears a book, which is called, let me remember how it is called. It’s called An essay on the application of mathematical analysis to the theories of electricity and magnetism. And this appears in 1828.

EL: And this is just out of nowhere?

MA: Out of nowhere. And then the professors in Cambridge say, “Okay, it’s impossible. We have to bring here that guy.” So they take the miller from his mill and they put him in the University of Cambridge. So he was about, I don’t know, 30 or 40. and of course, it was not very convenient for the son of a baker to be a student with the sons of the gentlemen of England.

KK: Sure.

MA: Okay. So he didn't us stay there. He left, and then he died and nobody knew about that. There was this book, and that’s it.

KK: So he was he was 13 or 14 years old when he wrote this? [Ed. note: Kevin and Evelyn had misheard Dr. Audin. Green was about 35 when he wrote it. The joys of international video call reception!]

MA: Yeah. And then and then he died, and nobody knew except that—

KK: Wow.

MA: Wow. And then appears a guy called Thomson, Lord Kelvin later. This was a very young guy, and he decided to go to Paris to speak with a French mathematicians like Cauchy, Liouville. And then it was a very long trip, and he took with him a few books to read during the journey. And among these books was this Green book, and he was completely excited about that. And he arrived in Paris and decided to speak of this Green theorem and this work to everybody in Paris. There are letters and lots of documentation about that. And then this is how the Green formula appeared in the mathematics.

EL: Interesting! Yeah, I didn't know about that story at all. Thanks.

KK: It’s fascinating.

MA: Nobody knows. Yeah, that's very interesting.

KK: Isn’t what we know about Stokes’ theorem, wasn't it set as an exam problem at Cambridge?

MA: Yeah, exactly. So it began It began with a letter of Lord Kelvin to Stokes. They were very friendly together, on the same age and doing say mathematics and physics and they were very friendly together and and they were but they were not at the same at the same place of the world writing letters. And once Thomson, Kelvin, sent a letter to Stokes speaking of mathematics, and at the very end a postscript where he said: You know that this formula should be very interesting. And he writes something which is what we now know as the Stokes theorem.

And then the guy Stokes, he had to make a problem for an exam, and he gave this as an examination. You know, it was in Cambridge, they have to be very strong.

KK: Sure.

MA: And this is why it’s called the Stokes’ formula.

EL: Wow.

KK: Wow. Yeah ,I sort of knew that story. I didn't know exactly how it came to be. I knew somewhere in the back of my mind that it had been set as an exam problem.

MA: It’s written in a book of Maxwell.

KK: Okay.

EL: And so the second person you mentioned, I forget the name,

MA: Ostrogradsky. Well, I don’t know how to pronounce it in Russian, and even in English, but Ostrogradsky, something like that. So he was a student in mathematics in Ukraine at that time, which was Russia at that time, by the way. And he was passing his exams, and the among the examination topics there was religion. So he didn't go for that, so he was expelled from the university, and he decided to go to Paris. So it was in 1820, something like that. He went to Paris. He arrived there, and had no exams, and he knew nobody, and he made connections with a lot of people, especially with Cauchy, who was a was not a very nice guy, but he was very nice to Ostrogradsky.

And then he came back to Russia and he was the director of all the professors teaching mathematics in military schools in in Russia. So it was quite important. And he wrote books about differential calculus—what we call differential calculus in France but you call calculus in the U.S. He wrote a book like that, and for instance, because we were speaking of Kovalevskaya when she was a child, on the walls of her bedroom there were the sheets of the course of Ostrogradsky on the wall, and she read that when she was a little girl. She was very good in calculus.

This is another story, I’m sorry.

KK: No, this is the best part.

MA: And so, next question.

KK: Okay, so now I’ve got to know: What does one pair with Stokes’ theorem?

MA: Ah, a novel, of course.

EL: Of course!

KK: A novel. Which one?

MA: Okay, I wrote one, so I’m doing my own advertisement.

EL: Yeah, I was hoping we could talk about this. So yeah, tell us more about this novel.

MA: Okay, this is called Stokes’ Formula, a novel—La formule de Stokes, roman. I mean, the word “novel” is in the title. In this book I tell lots of stories about the mathematicians, but also about the about the formula itself, the theorem itself. How to say that? It’s not written like the historians of mathematics like, or want you to write. There are people speaking and dialogues and things like that. For instance, at the end of the book there is a first meeting of the Bourbaki mathematicians, the Boubaki group. They are in a restaurant, and they are having a small talk, like you have in a restaurant. There are six of them, and they order the food and they discuss mathematics. It looks like just small talk like that, but actually everything they say comes from the Bourbaki archives.

EL: Oh wow.

MA: Well, this is a way to write. And also this is a book. How to say that? I decided it would be very boring if the history of Stokes’ formula was told from a chronological point of view, so it doesn’t start at the beginning, and it does not end at the end of the story. All the chapters, the title is a date: first of January, second of January, and they are ordered according to the dates. So you have for instance, it starts with the first of January, and then you have first of February, and so on, until the end, which is in December, of course. But it’s not during the same year.

EL: Right.

MA: Well, the first of January is in 1862, and the fifth of January is in 1857, and so on. I was very, very fortunate, I was very happy, that the very end of the story is in December because the first Bourbaki meeting was in December, and I wanted to have the end there. Okay, so there are different stories, and they are told on different dates, but not using the chronology. And also in the book I explain what the formula means. You are comparing things inside the volume, and what happens on the surface face of the volume. I tried to explain the mathematics.

Also, in every chapter there is a formula, a different formula. I think it’s very important to show that formulas can be beautiful. And some are more beautiful than others. And the reader can just skip the formula, but look at it and just points out that it's beautiful, even if I don't understand it completely.

There were different constraints I used to write the book, and one of them was to have a formula, exactly one formula in every chapter.

EL; Yeah, and one of the reasons we wanted to talk to you—not just that I read your book about Kovalevskaya and kind of fell in love with it—but also because since leaving math academia, you've been doing a lot more literature, including being part of the Oulipo group, right, in France?

MA: Yes. You want me to explain what it is?

EL: Yeah, I don't really know what it is, so it'd be great if you could tell us a little more about that.

KK: Okay. It's a group—for mathematicians, I should say it’s a set—of writers and a few mathematicians. It was founded in 1960 by Raymond Queneau and François Le Lionnais. The idea is to the idea is to find constraints to write some literary texts. For instance, the most famous may be the novel by George Perec, La Disparition. It was translated in English with the title A Void, which is a rather long novel which doesn’t use the letter e. In French, it is really very difficult.

EL: Yeah.

MA: In English also, but in French even more.

EL: Oh, wow.

MA: Because you cannot use the feminine, for instance.

EL: Oh, right. That is kind of a problem.

MA: Okay, so some of the constraints have a mathematical background. For instance, this is not the case for La Disparition, but this is a case for for some other constraints, like I don't know, using permutations or graph theory to construct a text.

KK: I actually know a little about this. I taught a class in mathematics and literature a few years ago, and I did talk about Oulipo. We did some of these—there are these generators on the internet where you can, one rule is where you pick a number, say five, and you look at every noun and replace it by the one that is five entries later than that in the dictionary, for example. And there are websites that will, you feed it text, and it's a bit imperfect because it doesn't classify things as nouns properly sometimes, it's an interesting exercise. Or there was another one where—sonnets. So you would you would create sonnets. Sonnets have 14 lines, but you would do it sort of as an Exquisite Corpse, where you would write all these different lines for sonnets, and then you could remove them one at a time to get a really large number, I forget now however many you do so, yeah, things like that, right?

MA: Yeah, this is cent mille milliards, which is 10 to the 14.

KK: That’s right, yeah. So 10 different sonnets. But yeah, it’s really really interesting.

MA: The first example you gave then, which is called in French “X plus sept,” X plus seven, you do you start from a substantive, a noun, you take the seventh in a dictionary following it.

KK: That’s right.

MA: It depends on the dictionary you use, of course.

KK: Sure.

EL: Right.

MA: So that's what they did at the beginning, but now they're all different.

KK: Sure.

EL: Yeah, it's a really neat creative exercise to try to do that kind of constraint writing.

MA: That forms a constraint, the calendar constraint I used to in this book, is based on books by Michelle Grangaud, who is a poet from the Oulipo also, and she wrote Calendars, which were books of poetry. That's where the idea comes from.

EL: Yeah, and I assume this, your novel has been translated into English?

MA: Not yet.

EL: Oh, okay.

MA: Somebody told me she would do it, and she started, and I have no news now. I don’t know if she were thinking of a published or not. If she can do something, I will be very grateful.

EL: Yeah, so it’s a good reason to brush up your French, then, to read this novel.

And where can people find—is there writing work of yours that people can find on a website or something that has it all together?

MA: Okay, there is a website of the Oulipo, first of all, oulipo.net or something like that. Very easy to find.

KK: We’ll find it.

MA: Also, I have a webpage myself, but what I write is usually on the Oulipo site. I have also a site, a history site. It’s about history but not about mathematics. It’s about the Paris Commune in 1871. It has nothing to do with mathematics, but this is one of the things I am working on.

EL: Okay. Yeah, we'll share that with with people so they can find out more of this stuff.

MA: Thank you.

KK: Alright, this has been great fun. I learned a lot today. This is this is the best part of doing this podcast, actually, that Evelyn and I really learn all kinds of cool stuff and talk to interesting people. So we really appreciate you to appreciate you taking the time to talk to us today, and thanks for persevering through the technical difficulties.

MA: Yes. So we are finished? Okay. Goodbye.

EL: Bye.

Episode 32 - Anil Venkatesh

Evelyn Lamb: Hello, and welcome to my favorite theorem, a math podcast where we asked mathematicians to tell us about their favorite theorems. I'm one of your hosts, Evelyn Lamb. I'm 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. How you doing, Evelyn?

EL: I’m all right. I had a really weird dream last night where I couldn't read numbers. And I was like, trying to find the page numbers in this book. And I kept having to ask someone, "Oh, is this 370?" Because it looked like 311 to me. For some reason those are two of the numbers that like somehow, yeah, those numbers don't look the same. But yeah, it was so weird. I woke up, and I opened a book. And I was like, "Okay, good. I can read numbers. Life is ok." But yeah, it was a bit disorienting.

KK: That's weird. I’ve never had anything like that.

EL: So how about you?

KK: Well, I don't know. I was in California earlier this week, so I'm trying to readjust to Florida after what was really nice in California. It’s just gruesomely hot here and gross. But anyway, enough about that. Yeah.

EL: Yeah. So today, we're very happy to have Anil Venkatesh joining us. Hi, Anil, can you tell us a little bit about yourself?

Anil Venkatesh: Hi, Evelyn. Hi, Kevin. Yes, I am an applied mathematician. I teach at a school called Ferris State University in Michigan. And I am also a musician, I play soccer, and I’m the lead Content Developer for a commercial video game.

EL: Oh, wow. And I how I ran across your name is through the music connection. Because you sometimes give talks at the Joint Math Meetings and things like that. And I think I remember seeing one of your talks there. But I didn't know about the game developing. What game is that?

AV: It's called Star Sonata. And I'll plug it maybe at the end of the episode. But it actually relates because the theorem I'm going to talk about, well, I ran across it in my development work, actually.

EL: Oh, cool. So let's get right to it.

AV: Okay. Well, I'm going to talk about the Shapley value, which is due to Lloyd Shapley. The paper came out in 1953, and there's a theorem in that paper. It did not come to be known as the Shapley theorem, because that's a different theorem. But it's an amazing theorem, and I think the reason theorem didn't gain that much recognition is that the value that it kind of proved something about is what really took off.

So should I tell you a little bit about what the Shapley value is, and why it's cool?

KK: Yeah, let’s have it.

AV: Well, so actually, I picked up this book that came out in ’88, so quite a long time after the Shapley value was originally introduced. And this book is amazing. It's got like 15 chapters. And each chapter is a paper by some mathematician or economist talking about how they use the Shapley value. So it's just this thing that really caught on in a bunch of different disciplines. But it is an econ result, which is why I took a while to actually track it down once I came up with the math behind it.

EL: RIght.

AV: So putting this into context, in 1953 people were thinking a lot about diplomacy, they were thinking about the Cold War, or ensuing Cold War. And so here's a great application of the Shapley value. So you have the United Nations. It’s got in the Security Council, five permanent members who can veto resolutions and then 10 rotating members. So for a resolution to pass, I don't know if this is exactly how it works now, but at least when the paper was written, you needed nine out of 15 to vote in favor.

KK: That’s still correct.

AV: And of those nine, you needed all five of the permanent members. So you couldn’t have any of those vetoes. So you might ask, How powerful is it to have the veto? Can we quantify the negotiating strength of possessing a veto in this committee?

KK: Okay.

EL: Okay.

AV: Okay. And yes, you can with the Shapley value, and it comes down to, well, do you want to hazard a guess? Like, how many times better is it to have a veto?

KK: Like a million.

AV: It's a lot better. You know, I didn't really have a frame of reference for guessing. It's about 100.

EL: Yeah, I don't know… Oh, how much?

AV: A hundred.

KK: I was only off by four orders of magnitude! That’s pretty good.

AV: Yeah.

EL: Yeah, not bad.

AV: So the way the Shapley value carries this out is you imagine out of 100 percent, let's apportion pieces of that to each of the 15 members according to how much power they have in the committee.

KK: Okay.

AV: And so if it was 20% to each of the permanent members, there wouldn't be any left for the remaining 10 voting, right? In actuality, it's 19.6% to each of the five permanent members.

KK: Okay.

EL: Wow.

AV: And then that last sliver gets apportioned 10 ways to the rotating members. And that's how we come up with roughly 100 times more powerful with the veto.

EL: Okay.

AV: I will tell you how this value is computed, and I'll tell you about the theorem. But I'll give you one more example, which I thought was pretty neat and timely. So in the US, laws get made when the House of Representatives and the Senate both vote with the majority in favor of the bill, and then the President does not veto that bill.

KK: Yes.

AV: Or if the president vetoes, then we need a two-thirds majority in both houses to override that veto. So you could ask, well, if you think of it just as the House, the Senate and the President, how much of the negotiating power gets apportioned to each of those three bodies when it comes to finally creating a law? And if you apply the Shapley value, you get ratios of 5:5:2, which means the president alone has a one-sixth say in the creation of a law.

EL: Okay. Yeah, I was when you said that I was thinking, I mean, if you do the Security Council one, the people with vetoes had almost one fifth each, so I was thinking maybe like being one third of the things that could veto, it would be about a third for the president, but that seemed too high.

AV: Yes. So if the if the it was not possible to override the veto, then it would be a little bigger, right?

EL: Right, right. Okay.

AV: Yes. Now, if you actually break this down on the individual basis, so you might think, okay, well, the house gets 5 out of 12 of the power, but there are so many people in the house, so each individual person in the house doesn't have as much power, right?

KK: Yes

AV: When it breaks down that way, so going individual representative, individual senator and President, the ratio goes like 2 to 9 to 350.

EL: Okay.

AV: So the President actually has way more power than any one individual lawmaker.

KK: Well, that makes sense, right?

AV: Yes, it does. And so, yeah. The great thing about the Shapley value is that it's not telling you things you don't know exactly, but it's quantifying things. So we know precisely what the balance of power is. Of course, you've got to ask, “Okay, so this sounds like a like a fun trick. But how is it done anyway?”

EL: Yeah.

AV: The the principle behind the Shapley value is just, it’s beautiful in its simplicity. The theory is this—and actually when I tell you this, it's going to remind you of a lemma that's already been on this podcast.

EL: Okay.

AV: More than one actually, this just a very standard kind of technique. So imagine all the possible orderings of voters. So suppose they come in one at a time and cast their vote. Under how many of these arrangements is a particular person casting the pivotal vote? The more more frequently the more arrangements in which Person A casts the typical vote, the more power Person A is allotted.

EL: Okay.

AV: That's it. So we actually just take an average overall possible orderings of votes and basically count up however many of those orderings involve a particular person casting the pivotal vote, and that's how we that's how we derive this breakdown of power.

EL: So this is a lot like having everyone at a vertex and looking at symmetries of this object, which is kind of reminding me of Mohammed Omar's episode about Burnside’s lemma. I assume so that's the one that you were thinking about.

AV: Yes, that’s the one I was thinking about.

EL: But you said another one as well.

AV: The other one hasn’t actually been on this podcast yet. And I could have talked about this one instead. But the Cohen-Lenstra heuristics for the frequency of ideal class groups of imaginary quadratic extensions also involves an idea, now this one gets a little deeper. but essentially, if you dig into the Shapley value, you notice that the bigger the group is, the less power each person has in it. And yeah, so there are various other twists you can ask using the Shapley value. So in the Cohen-Lenstra heuristics, you essentially divide by the automorphisms of a group, you weight things inversely by the number of automorphisms they have. Anyway, that one also evoked because you take sort of an average across all the groups of the same size. So, I'm not claiming that there's some kind of categorical equivalence between the Cohen-Lenstra heuristics and the Shapley value, but this idea of averaging over an entire space comes up in a bunch of different branches of mathematics.

KK: Sure.

EL: Yeah. Very cool. So, we've got the Shapley value now, and what is the theorem?

AV: The theorem, and this is what makes it all really pop, the theorem is why people, why the Shapley value is so ubiquitous. There is no other logical apportionment of 100 percent than the Shapley value’s algorithm.

EL: Okay.

AV: There is no other sensible way to quantify the power of a person in the committee.

EL: Interesting.

KK: What’s the definition of sensible?

AV: I’ll give it to you, and and when you hear—this is how weak the the assumptions are that already gave you this theorem, and that's why it's amazing.

KK: Sure.

AV: Efficiency: you must apportion all hundred percent

KK: Okay.

AV: Of course. Symmetry: if you rename the people but you don't change their voting rules, the Shapley value is not affected by that kind of game.

KK: Sure.

AV: Null player: if a person has no voting power at all, they get zero percent.

KK: All right.

AV: Obviously. And finally, additivity. That one takes a little bit more thinking about, but it's nothing crazy. It's just saying, like, if there are two different votes happening, then your power in the total situation is the sum of your power in the one vote and your power on the other vote. If there's more than one game being played, basically, the Shapley value is additive over those games.

KK: That's the weirdest one, but yeah, okay.

AV: Yeah, I looked at it. I thought a little bit about what to say. And then honestly, if you dig into it, you realize it's just, like, not saying anything amazing. You have to think about this: the Sheppey value, it's a function, right? So we're working in the space of functions, and weird things can happen there. So this is just asserting you don't have any really wild and woolly functions. We're not considering that.

EL: Okay.

AV: So you just have these assumptions. And then there's only one. And the way they prove it is by construction. They basically write down a basis of functions, and they write down a formula using that basis, and there can only be one because it's from a basis, and then they prove that formula has the properties desired. It’s a really short paper, it's like a 10 page paper with four references. It's amazing.

EL: You said this is the 1953 paper by Shapley?

AV: Yes, by Shapley.

EL: Yeah, was there another author too, or just?

AV: No, Shapley collaborated with many people on related projects, but the original paper was just by him.

EL: Yeah. So I assume people have maybe looked at Shapley values of individual voters, like in the US or in an individual state or local election. We're recording this in election season, a little bit before the midterm elections.

KK: Yeah, can’t end soon enough here.

EL: Yeah, I guess. Oh, I guess actually, that wouldn't be that interesting, because it would just be, I mean, within a state or something. But I guess, the Shapley value of someone in one state versus another state might be a fairly interesting question.

AV: Oh, yes. But even the Shapley value for one person in a certain district or another district, this gets into gerrymandering, for sure.

KK: Right.

AV: I don't know to what extent people have thought about the Shapley value applied in this way. I imagine they have, although I haven't personally seen it mentioned, or anything that looks like it in the gerrymandering math groups that have been doing the work.

KK: No, I mean, I've been working with them a little bit, too. I mean, not really. And yeah, of course, it sort of gets to things like, you know, the Senate is sort of fundamentally undemocratic.

EL: Right.

KK: I mean, the individual senators kind of have a lot power. But you know, the voters in Wyoming have a lot more, you know, their vote counts more than than a voter and say, Florida.

EL: Right? Or the voter in Utah versus the voter in Florida.

AV: I'm thinking about within a specific state, if you look at the different districts. I mean, I read a little bit about this. And I see that they're, they're trying to resolve kind of the tension between the ability to cast a pivotal vote and the ability to be grouped with people who are like-minded. I don't know, it seems like, I wonder whether there's some extent to which they're reinventing the wheel, and we already have a way to quantify the ability to cast a pivotal vote. There's only one way to do it.

EL: Interesting.

AV: I don't know. Yeah, I'm not super informed on that. But it feels like it would apply.

KK: Yeah. So what drew you to this through this? I mean, okay. So fun fact: Anil and I actually had the same PhD advisor, albeit a couple of decades apart, and neither of us works in this area, really. So what drew you to this?

AV: Well, that's why I mentioned my game development background. So this game, Star Sonata, is one of those massively multiplayer online role-playing games. It actually was created back in 2004, when World of Warcraft had just started. And basically the genre of game had just been created. So that's why the game started the way it did. But it's kind of just an indie game that stuck around and had its loyal followers since then.

And I also played the game myself, but several years ago, I just kind of got involved in the development side. I think initially, they wanted—Well, I was kind of upset as a player, I felt they’d put some stuff in the game that didn't work that well. So I said, “Listen, why don't you just bring me on as a volunteer, and I'll do quality assurance for you.” But after some time, I started finding a niche for myself in the development team, because I have these quantitative skills that no one else on the team really had that background in. So a little later, I also noticed that I actually had pretty decent managing skills. So here I am, I'm now basically managing the developers of the game.

And one of my colleagues there asked me an interesting question. And he was kind of wrestling with it in a spreadsheet, and he didn't know how to do it. So the question is this, suppose you're going to let the player have like, six pieces of equipment, and each piece of equipment, let's say it increases their power in the game by a percent. Power could be like, you know, your ability to kill monsters or something.

EL: Yeah.

AV: So the thing is, each piece of equipment multiplicatively increases your power. So your overall power is given by some product, let's say (1+a)(1+b)(1+c), and so on. One letter for each piece of equipment. So you write down this product, you have to use the distributed property to work out the the final answer. And it looks like 1 plus the sum of those letters plus a bunch of cross-terms.

KK: So symmetric functions, right?

AV: Yes, exactly. So what his question was, “Okay, now that we're carrying all six of these pieces of equipment, how much of that total power is due to each piece of equipment?”

EL: Okay.

AV: How much did each item contribute to the overall power of the player? The reason we want to know this is if we create a new piece of equipment the player can obtain, and we put that in, and then suddenly we discover that everyone in the game is just using that, that's not good game design. It's boring, right? We want there to be some variety. So we need to know a way to quantify ahead of time whether that will happen, whether a new a new thing in the game is going to just become the only thing anyone cares about. And they'll eschew all alternatives. So he asked me, basically, how can I quantify whether this will happen? And I thought about it. And as you can tell, what this is asking about is the Shapley value in a special case where all the actors contribute multiplicatively to the to the total. And I didn't know that at the time because I'd never learned about the Shapley value. I didn't really learn much econ.

KK: Sure.

AV: So I just derived it, as it turns out, independently, in this in this special case. And it works out in a very beautiful formula involving essentially the harmonic means of all those letters. So reciprocals of sums of reciprocals. The idea there—and I mean, I can give a real simple example—Like, suppose you have two items. One of them increases your power by 20%, and one increases by 30%. So your overall power is 1.2 times 1.3. So what does that get to? 1.56 So of that of that 56% increase, 20% goes to the one item, 30 goes to the other, but 6% is left over. And how should that be aportioned?

EL: Right.

AV: Well, if you think about it, you might think, “Well, okay, the 30 percent should get the lion's share.” And maybe so, maybe so. But then there's a competing idea: because that 30% was pretty big, the 20 percent’s effect is amplified, right? So it's not, there's not an immediately obvious way to split it. But you can kind of do it in a principled fashion. So once I wrote this down, you know, I gave it to my colleague, he implemented it, it improved our ability to make the game fun. But then I also started wondering, like, look, this is, this is nice and all, but someone must have thought of this before, you know? So I don't actually remember now, how I came across it, whether I just found it or somebody sent it to me. But one way or another, I found the Shapley value on Wikipedia. I read about it, and I immediately recognized it as the generalization of what I'd done. So, yeah.

EL: Oh, yeah. Well, and this seems like the kind of thing that would come up in a lot of different settings, too. A friend of mine one time was talking about a problem where, you know, they had sold more units and also increased price, or something. And, you know, how do you allocate the value of the increased unit sales versus the increase price or something, which might might be a slightly different, the Shapley value might not apply completely there.

AV: No, it does.

EL: Okay.

AV: Yes, that’s called the Aumann-Shapley pricing rule.

EL: Okay, yeah.

AV: Yeah. So, questions of fair division and cost allocation are definitely applications of the Shapley value. So, yeah.

EL: Neat. Thanks.

KK: Very cool. The other fun part of this podcast is that we ask our guests to pair their theorem is something What have you chosen to pair this with?

AV: Well, like many your guests, I really struggled with this question.

KK: Good.

AV: And the first thing I thought of, which won't be my choice, was a pie because you have to, you know, fairly divide the pie. I told this to one of my friends, and I explained what the Shapley value was, and she was like, “No, that's, that's a terrible idea, because you want to divide the pie equally.” But the Shapley value is this prescription for dividing unequally but according some other principle. So it won't be a pie. So I actually decided this morning, it's going I'm going to pair it with a nice restaurant you go to with your friends, but then they don't let you split the bill.

KK: Ah.

EL: Okay. Yeah, so you have to figure out what numbers to write on the back of the receipt for them read your credit cards. Or for the added challenge, you could decide, like, given the available cash in each person's wallet? Can you do that?

AV: Oh, don't even get me started.

KK: This is the problem, right? Nobody has cash. So when you're trying to figure out how to how to split the bill…People think that mathematicians are really good at this kind of thing, and in my experience, when you go to a seminar dinner or whatever, nobody can figure out how to split the bill.

AV: If I'm out with a bunch of people, and we have to split a bill, let it not be mathematicians, that’s what I say. Let it be anyone else.

KK: Yeah, because some people want to be completely exact and each person ordered a certain thing and it cost as much and you pay that, then you divide the tip proportionally, all this stuff. Whereas I'm more, you know, especially the older I get, the less I care about five or $10 one or the other.

AV: Yeah, well, I find it's good if I go out with a bunch of people who are kind of scared of math, because then they just let me do it. You know, I become the benevolent dictator of the situation

KK: That’s happened to me too, yeah.

EL: So, I don't remember where what city Ferris State is in.

AV: Well, it's in a town of Big Rapids, which is a little the Grand Rapids, which is a little bit more well-known

EL: Slightly grander. So, yeah, you're the slightly lesser rapids?

AV: So, there are at least five rapids in Michigan, like five different places named something rapids.

KK: Sure.

EL: So do you have a Big Rapids restaurant in mind for this pairing?

AV: You know, they're all really nice about splitting the bills there. So I was thinking something maybe in New York City or Boston.

KK: College towns are pretty good about this. In fact, they'll let you hand them five cards, and they'll just deal with it.

AV: Yeah, totally.

KK: Yeah, yeah, very nice. So your rapids are big but Grand Rapids’ rapids are grander.

AV: They’re much grander. Don’t get me started about Elk Rapids. I don't know how to compare that to the other two.

KK: Elk Rapids?

EL: Yeah, Big, Elk, and Grand, not clear what order those go in. [I guess Iowa’s got the Cedar Rapids.]

AV: Yes. I don't remember the other two rapids, but I know identified them at some point.

EL: Well thank you so much for joining us

AV: Thanks for inviting me. It was great.

EL: Yeah, I learned something new today for sure.

KK: Math and a civics lesson, right?

EL: Yes. Everybody go vote. Although this episode will already be out. [Ed. note: Evelyn said this backwards. Voting occurred before the episode, not vice versa.] But get ready to vote in the next election!

KK: Yeah, well, it's never ending right? I mean, as soon as one elections over, they start talking about the next one. Thanks, Anil.

EL: All right, bye.

AV: Thank you.

[outro]

Episode 31 - Yen Duong

Evelyn Lamb: Welcome to My Favorite Theorem. I'm your host Evelyn lamb. I'm a freelance math and science writer based in Salt Lake City. Today I am by myself because I'm on location. I am in Washington DC right now for the Science Writers conference. That's the conference for the National Association of Science Writers and I'm really happy to be joined by Yen Duong, who is a also a science writer with a math background. So yeah, can you tell us a little bit about yourself?

Yen Duong: Yeah, so I am in Charlotte, North Carolina, and I work part time for North Carolina Health News. And the rest of my time, I am a freelance math and science writer like you.

EL: Yeah.

YD: And I just finished the AAAS Mass Media Fellowship this summer, and before that I got my Ph.D. at UIC in geometric group theory.

EL: Yeah, and the AAAS fellowship is the one, the way I started doing science writing as well. A lot of people, when you come to conferences like these, you find out a lot of people who are more senior in the field have also gone through this. So it's really great. The application deadline, I believe is in January. So we'll try to air this at a time when people can look into that and apply for it. But yeah, it's a great program that brings grad students in science, you know, math and other sciences, into newsrooms to learn a little bit about how the news gets made and how to report on science for a broader audience. So it was a great experience for me. It sounds like it was a great experience for you.

YD: Yeah, it's fantastic. It's 10 weeks, I think this coming year, the stipend will be $6,000. So that's great. It is paid. And for me, at least it jump started the rest of my career as a math and science writer.

EL: Yeah, definitely. And it’s nice to hear that it's being paid a little more. I lived in New York City for less than that. And that was difficult. Okay, so do you want to tell us about your favorite theorem?

YD: I've been listening to this podcast for a while. And it's like, okay, I'll do a really fancy one to be really impressive. And people will think I'm fancy. But I decided not to do that. Because I'm not that fancy. And I think it's silly to be that pretentious. So I'm going with one of the first theorems I learned, like as an undergrad, which was Ramsey theory, that the Ramsey number of R(3,3) equals six.

EL: Okay, great. So, yeah, tell us what a Ramsey number is.

YD: Okay, so this is from graph theory. And the idea of saying, R(3,3)=6, I’ll just do the whole spiel.

EL: Yeah, yeah. And please use your hands a lot. It's really helpful for the podcast medium when you’re—Yeah, I know. Like Ramsey theory. I’m, like, moving my hands all around to show you what everything is.

YD: I will attempt to not pen and paper and start drawing things. Luckily, we don't have any available, right now. Yeah. So the idea is that, let's say that you are trying to put together a committee of three people. And you either want all three people to pairwise know each other and have worked together before, or you want all three people to be relative strangers. What you don't want is one person in the middle and everyone talks to them. And then the other two people don't talk to each other. That's a bad committee. Yeah. So the question is, how many people do you need to look at to guarantee that you can find such a committee?

EL: Right, so how big is your pool going to be of people you're choosing?

YD: Exactly. So like, if I look at three people? Well, that's not great, because it's me, you and someone in the next room. And there you go. We don’t have a good committee. And if I look at 100 people, like okay, I'm pretty sure I can find this with 100 people. So what Ramsey theory does is use graph theory to answer this question. And so like I said, the giveaway was that the number is 6, and something that I really love about this theorem is that you can teach it to literal—I think I taught it to 10 year olds the summer.

EL: Nice.

YD: And it's just a really nice basic introduction to, in my opinion, the fun parts of math. These kids who are like, “Ugh, I have to memorize equations, and I hate doing this.” And then I start drawing pictures and I explain the pigeonhole principle, and like, “Oh, I get it, like, I can do this.” I’m like, “Yes, you can! Everyone can do math!”

EL: Yay. Yeah. So the, the proof for that is, is kind of like you, you take a hexagon, right? Or the vertices of a hexagon and try to build—what do you do to denote whether you have friends or strangers?

YD: So graph theory is when you have vertices, which are dots, and edges, which are lines in between dots, and you use it to describe data and information systems. So in this case, we can make each person a dot, so we'll put six dots on a piece of paper. I do not have paper. I am using my hands. So we’ll have six dots on a piece of paper, and we’ll draw a blue line for friends, and we can draw a red line for strangers. So now our question becomes, how many dots do I need to make either a red triangle or blue triangle. So if you have six dots, let's look at one person, and that person will be me. And I look out at this crowd of five people. So for at least three of those people, I will have the same color line going to them. So they might all be strangers, so I'll have five red lines, or one might be a stranger and four friends—one red and four blue—but in that case, I have three, at least three, blue ones. So I can just assume that one of them is blue. So we'll just say, “Okay, I’ve got three blue lines going out.” So now I look at those three friends of mine. And I look at the relationships that they have with each other. This is really hard without pen and paper.

EL: Yeah, but luckily, our listeners have all gotten out of pens, two colors of pens, and they are driving this at home. So it's fine.

YD: Excellent. Good job, listeners! So now you've got your three dots. And you've got three blue lines coming out of them to one common dot. So you've got four dots on your piece of paper. So if in between any of those three dots, I draw a blue line, we’ve got our blue triangle, and we're done. We've got our committee.

EL: Yeah.

YD: Therefore, if I want to make this a proof, I'd better draw red lines. Yeah, I should draw a red line. Yeah. So now I've got three dots. And I've got red lines. But now I have red lines between all three of them. And there's my committee. So that's it. That's the entire proof. You can do it in a podcast in a few minutes. You can teach it to 10 year olds. You can teach it to 60 year olds. And I love it because it's like the gateway drug of mathematics proofs.

EL: Yeah, it’s really fun. And yeah, you can just sit down at home and do this. And—spoiler alert: to do this for four, to get a committee of four people, it's a little harder to sit down at home and do this, right? Do you—I should have looked up

YD: Oh, the Erdos quote, right? Is that what you're talking about?

EL: Well, well, I you can do four. Yeah, there's an Erdos quote about I think getting to six. Or five.

YD: So the Erdos quote is, paraphrased: if aliens come to the earth, and they tell us that they're going to destroy us unless we calculate R(5,5), then we should get all of the greatest minds in the world together and try to calculate it and solve it. But if the aliens say that we should try to compute R(6,6), then we should just try to destroy the aliens first.

EL: Yeah, so I think R(4,4) is like something like 18. Like, it's doable. I mean, by a computer, I think, not by a person, unless you really like drawing very large graphs. But yeah, it's kind of amazing. The Ramsey numbers just grow so fast. And we've been saying R(3,3) or R(4,4), having the same number twice in those. There are also Ramsey numbers, right, where it’s not symmetric.

YD: Like R(2,3) or R(2,4), Okay, so well two is maybe not the greatest number for this. But yeah, you can do things where you say, Oh, I'm going to have either a complete—so I'll either have a triangle of red, or I'll have four dots in blue, and they'll all be connected to each other with blue lines, a complete graph on four dots or however many dots.

EL: Yeah. So they don't have to be the same number. Although, you know, usually the same number is sort of a nicer one to look at. So how did you learn this theorem?

YD: Let's see. So I learned this through—I’ll just tag another great program—Budapest semesters in mathematics.

EL: Nice

YD: From a combinatorics professor. So BSM is when college students in the U.S. and Canada can go to Budapest for a semester and learn math from people there and they hang out with all these others. It’s a nice study abroad program for math. So that's when I first learned it. But since then, I think I've taught it to just like a hundred people, hundreds of people. I tell it to people in coffee shops, I break it out at cocktail parties, it's just like, my like, math is fun, I promise! little theorem. I think I've blogged about it.

EL: So watch out. If you're in a room with Yen, you will likely be told about this theorem.

YD: Yeah, that's my cocktail party theorem, that and Cantor’s diagonalization.

EL: Yeah, well, and cocktail parties are a place where people often like, describe this theorem. Like, if you're having a party, and and you want to make sure that any [ed. note: Evelyn stated this wrong; there shouldn’t have been an “any”] three people are mutual acquaintances, or mutual strangers, although the committee one actually makes a lot more sense. Because like, who thinks through a cocktail party that way? It's just a little contrived, like, “Oh, I must make sure the graph theory of my cocktail party is correct.” Like, I know a lot of mathematicians, and I go to a lot of their parties, but even I have never been to a party where someone did that. So on this podcast, we also like to ask you to pair your theorem with something. And why have you chosen for R(3,3)?

YD: I thought really hard about it, by the way.

EL: Yes. This is a hard part.

YD: Yeah. So I decided on broccoli with cheese sauce.

EL: Okay. Tell us why.

YD: Because it is the gateway vegetable, just like this theorem is the gateway theorem.

EL: Okay.

YD: Yeah. Like, my kids sometimes eat broccoli with cheese sauce. And it's sort of like trying to introduce them to the wonderful world of Brussels sprouts and carrots and delicious things. I feel like the cheese sauce is sort of this veneer of applicability that I threw on with the committee thing.

EL: Oh, very nice. Yeah.

YD: Even with the situation of the committee, like no one has ever tried to make a committee of three people who’ve all worked together or three people who didn’t. But, you know, it makes it more palatable than just plain broccoli.

EL: Yeah, okay. Well, and honestly, I could kind of see that, right. Because, like, it can be really that third wheel feeling when you’re hanging out with two people who know each other better than, you know either of them or something. Yeah. So actually, I feel, yeah, if you were making a committee for something, I could see why you might want to do this. I feel like a lot of people are not so thoughtful about making their committees that they would actually be like, “Will the social dynamics of this committee be conducive to…?”

YD: This is why my husband and I don't host cocktail parties, because my way of doing it is like, let's just invite everyone we know. And he's like, no, but what if someone feels left out? And then he gets stuck in the graph theory of our cocktail party and then it doesn't happen.

EL: And he's not even a mathematician, right?

YD: Yeah.

EL: Should have been, turns out.

YD: Yes, that's true. Stupid computers.

EL: Yeah. So when you make broccoli with cheese sauce, how do you make it. Are you a broccoli steamer? Do you roast it?

YD: We're definitely, if it's going to have cheese sauce on it, you’ve got to steam it. But generally, we're more roasters because I prefer it rested with garlic and olive oil.

EL: Okay.

YD: So delicious. Broccoli with cheese sauce is really a last resort. It's like, man, the kids have not eaten anything green in like a week

EL: They need a vitamin.

YD: Let’s give them some broccoli.

EL: So one of our favorite recipes is roasted broccoli with this raisin vinaigrette thing. You put vinegar and raisins, and maybe some garlic, A couple other things in a blender.

YD: Wait, so you blend the raisins?

EL: Yeah, you make a gloppy sauce out of the raisins and everything. And I don't think you plump them first or anything. I mean, usually I kind of get in a hurry, and I’ll put them all in, the ingredients, and then go do something else, and then come back. So maybe they plump a little from the vinegar. But yeah, it makes like a pasty kind of thing. It kind of looks like olive tapenade. And I have actually accidentally mistaken the leftover sauce in the fridge for olive tapenade and have been a bit disappointed. You know, if you're expecting olives, and you’re eating raisins instead, you’re just not as happy. But yeah, it's a really good recipe. If you want to expand your broccoli horizons, maybe not as kid friendly.

YD: Actually, my kids do love raisins. So maybe if I put raisins on top of broccoli, they would like it more.

EL: Yeah, I think there's some cumin in it too, something? And we're talking about recipes, because both of us like to cook a lot. And in fact Yen's blog is called Baking and Math. And it's not like baking with math. Like, there's baking, and there's math.

YD: Yeah, it’s a disjoint union. It doesn’t make that much sense, but I'm still a big fan of it. And it's actually how we met.

EL: Yes.

YD: Yeah. Because you found me on the internet.

EL: Yeah, I found you on the internet. And it was when I was writing for the AMS Blog on Math Blogs. And I was like, this is a cool blog. And yeah, then we became internet friends. And then I realized a couple of years later like, I feel like I know this person, but we've never actually met. We met at Cornell, at the Cornell topology festival, and I was like, “Wow, you're tall!” I just realized I always think people are either shorter than I think or taller that I think unless they're exactly my height because I think my

YD: You expect everyone to be your height?

EL: Yeah, my default, the blank slate version is like, “Oh, this person is the same height as I am.” So yeah, I was like oh, you're taller than I am. And I expected you to be exactly my height because I have no imagination

YD: I’m trying to think if I was surprised by, maybe, no, I don't think you had blue hair, maybe you did? No.

EL: No, I probably had blond hair at that point, yeah.

YD: I remember we did acro yoga when we first met. That's a good thing to do when you first meet someone.

EL: Yeah.

YD: It was very scary. It wasn't leap of faith, but so is meeting a stranger on the internet.

EL: Yeah. But luckily we’re both great people.

YD: Yeah. I also signed up for that conference because you tweeted that you were going to go, and I though, “Oh, I might as well sign up and then I can meet you.”

EL: I should have asked for a commission from the festival, although they probably paid for your travel, so it'd be like a reverse commission. So people can find your writing at your blog Baking and Math. They can find you on Twitter, you’re yenergy. And where here can they find your your science and health writing?

YD: So I post a lot of my clips on my website, my professional website, so that's yenduong.com, and then I also write for North Carolina Health News if you're interested in exactly what it sounds like, North Carolina health news.

EL: Yeah I'm sure a lot of people are I read them and I'm not in North Carolina, but I have a body, so I am interested in health news.

YD: Yeah.

EL: So thanks a lot for joining me.

YD: Thanks for having me. It was super fun. Fun fact for podcast listeners: Evelyn and I did not know where to look during this conversation. We couldn’t tell, should we look at each other or at the recording device?

EL: Yeah, so we did some of both. All right. Bye.

YD: Bye.

Episode 30 - Katie Steckles

Evelyn Lamb: Hello and welcome to My Favorite Theorem. I’m your host Evelyn Lamb, and I’m 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. How are you doing, Evelyn?

EL: I’m all right. I had a lovely walk today. And there are, there’s a family of quail that is living in our bushes outside and they were parading around today, and I think they're going to have babies soon. And that's very wonderful.

KK: Speaking of babies, today is my son's birthday.

EL: Who’s not a baby anymore.

KK: He’s 19. Yeah, so still not the fun birthday, right? That's that's another two years out.

EL: Yes, in this country.

KK: In this country, yes. But our guest, however, doesn't understand this, right?

EL: Yes. Today we are very happy to have Katie Steckles from Manchester, England, United Kingdom. So hi, Katie. Can you tell us a little about yourself?

Katie Steckles: Hi. Well yeah I'm a mathematician, I guess. So I did a PhD in maths and I finished about seven years ago. And now my job is to work in public engagement. So I do events and do talks about maths and do workshops and talk about maths on YouTube and on the TV and on the radio and basically anywhere.

KK: That sounds awesome.

EL: Yeah, you’re all over the place.

KK: Yeah, that sounds like great fun, like no grading papers, right?

KS: A minimal amount of, yeah, I don’t think I’ve had to grade anything, no.

EL: Yeah, and you have some great YouTube videos. We’ll probably talk more about some of them later. Yeah. And and I have stayed at your apartment a few years ago, or your flat, in Manchester. Quite lovely. And yeah, it's great to have you on here and to talk with you again. So what is your favorite theorem?

KS: Okay, my favorite theorem is what's called the fold and cut theorem, which is a really, really nice piece of maths which, like the best bits of maths, is named exactly what it is. So it's about folding bits of paper and cutting them. So I first encountered this a couple years ago when I was trying to cut out a square. And I realize that's not a very difficult task, but I had a square drawn on a piece of paper and I needed to cut out just the square, and I also needed the outside bit paper to still be intact as well. So I realized I wasn't going to be able to just cut in from the edge. So I realized that if I folded up the bit of paper I could cut the square out without kind of cutting in from the side, and then I realized that if I folded it enough I could do that in one cut, one straight line would cut out the whole square. And I thought, “That’s kind of cool. I like that, that’s a nice little bit of maths.” And I showed this to another friend who’s also a mathematician, and he was basically like, “Isn't there a theorem about this?” I thought, “Ooh, maybe there is,” and I looked and the fold and cut theorem basically says that for any figure with straight line edges, you can always fold a piece of paper with that figure drawn on it so that you can cut out the whole thing with one cut, even if it's got more than one bit to it or a hole in it or anything like that. It's always possible with one cut, in theory.

EL: Yeah. So you discovered a special case of this theorem before even knowing this was a thing to mathematically investigate.

KS: Yeah, well, I was I was cutting out a square for math reasons, because that's everything I do. But I was actually trying to make a flexagon at the time, which as I'm sure you've all been there, but it was just because I needed this square hole. And I thought it was such a satisfying thing to see that it was possible in one cut. And my maths brain just suddenly went, “How can I extend this? Can I generalize this to other shapes?

KK: Sure.

KS: And it was just a nice kind of extension of that.

EL: Yeah. So I have a question for you. Did you, was your approach to go for the, like diagonal folds, or the folds that are parallel to the sides?

KS: Yeah, this is the thing. There are actually kind of two ways to do a square. So you can do, like, a vertical and a horizontal fold, and then you get something that needs two cuts, and then you can make one diagonal fold and just end up with the thing that you can do in one cut, but you can actually do it in two folds if you do two diagonal folds, but it's along the cut. I don't know what the payoff is there. It depends on how much time you want to spend cutting, I don't know.

EL: Okay.

KK: I was thinking as you're doing this, I've never—I know about this theorem, but I've never actually done it in practice, but never really tried, but I was as soon as you said the square, I started thinking, “Okay, what would I do here?” You know, and I immediately thought to sort of fold along the diagonals. But so in general, though, so you have some, you know, 75-sided figure, is there an algorithm for this?

KS: It’s pretty horrible, depending on how horrible the thing is. Like simple things are nice, symmetrical things are really nice, because youjust fold the whole thing off and then use, you know, just do the half of it. And so there are algorithms. So the proof is done by Eric Demaine and Martin Demaine. And they've essentially got, I think, at least two different algorithms for generating the full pattern given a particular shape. So I think one of them is based around what they call the straight skeleton, which is if you can imagine, you can shrink the shape in a very sort of linear way, so you shrink all of the edges down but keep them parallel to where they originally were, you’ll eventually get to kind of a skeleton shape in the middle of the shape, and that's sort of the basis of constructing all the fold lines. And it is sort of seems quite intuitive because if you think about, for example, the square, all your folds are going to need to either be bisecting an angle or perpendicular to a straight edge. Because if it bisects the angle, it puts one side of the shape on top of the other one. And if you go perpendicular to the edge, it’s going to put the edge straight on top of the edge. And I always kind of think about in terms of putting lines on top of where the lines are, because that's essentially what you're doing if you've got a thin enough bit of paper and a thick enough line, you can actually physically see it happening. So it's beautiful. And then the other method they have involves disks in each corner of the shape, I think, and you expand the disks until they're as big as they can be and touch the other disks. And that then gives you a structure to generate a fold pattern. But they have got algorithms. I haven't yet managed to find a simple enough implementation that you can just upload the picture to a website and it will tell you the whole pattern, which is a shame because I've come across some really difficult shapes that I would really like to be able to fold but haven't quite been able to do it by hand. I'm just going, “Ah, I could just put some maths on this and throw it in the computer program!” But I actually asked Eric Demaine because I was in email contact with him about this. And then the thing that happened was, there’s a TV show in the UK called Blue Peter. Their logo it's like a giant boat that’s called the Blue Peter. It's a big ship with about 20 sails on it. And they said we could talk about this nice piece of maths, and you could even maybe try and cut out our logo with one cut. And I said to myself, “Goodness me!” Because it's all curves as well, so I’d have to approximate it all by straight lines and then work out how to cut this whole thing, and I emailed Eric Demaine and I sent him the picture and asked him, “Like, do you have a program that you can use to just you know, take a figure, even if I send the shape the edge or whatever?” And in his reply, he was like, “Wow, well, that looks, no.”

I just love the fact that they asked me to do something that not even the mathematician that proved that it's possible for any shape was prepared to admit would be easy. And so yeah, I'm not sure if there is kind of a, I mean, I would love it. I’m not enough of a coder to be able to implement that kind of thing myself. I would love it if there was a way to, you know, put in a shape or word or picture and come up with a fold pattern. Yeah, no, I don't know if anyone's done that yet.

KK: Well, this is how mathematicians are, right? We just proved that a solution exists, you know, and then we walk away.

EL: And so I seem to remember you've done a video about this theorem. And one of the things you did in it was make a whole alphabet, making all of those out of one-cut shapes.

KS: Yeah, well, this was, I guess this is my kind of Everest in terms of this theorem. This is one of the reasons why I love it so much, because I put so much time into this as a thing. So essentially in the paper that Demaine and Demaine have written about this, they've got a little intro bit where they talk about applications at this theorem and times when it's been used. So I think it's maybe Harry Houdini used to do a five-pointed star with one car as part of his actual magic show. It was really impressive. And people watch me do it. And they go, “Wow, how do you do that?” Such a lovely little demo. They also mentioned in there that they heard of someone who could cut out any letter of the alphabet, and I saw that and thought, “Wow, that would be a really nice thing to be able to do!” You know, that would impress people because it's kind of like if you can do any shape, then the proof of that should be whatever shape you tell me, I can do. And of course, a mathematician would know that 26 things is not infinity things, but it's still quite a lot of things. It's an impressive demo. So I thought I would try and work that out. And I literally had to sit down and kind of draw out the shapes and kind of work out where all the bits went and how to fold them. And some are easy, some are nice ones to start off with, like I and C and L. As long as you’ve got a square sort of version of it, they're pretty easy to imagine what you’d do. And then they get more difficult. So S is horrible, because there’s no reflection symmetry at all. It's just rotation symmetry and you can't make any use of that at all. R is quite difficult, but not if you know how to do P, and P is quite difficult, but not if you know how to do F. And so it all kind of kind of builds gradually. And I worked out all of these patterns and and in fact, it was one of the reasons I was in communication with Eric Demaine. Because he'd seen the video and he said, “As well as being mathematicians, we collect fonts, like we just love different fonts, type faces, and we wondered if you could send us your fold patterns for your letters so that we can make a font out of them.”

EL: Oh wow.

KS: And I thought that was really nice, so they've got a list on their website of different fonts, and they’ve now got a fold-and-cut font which I’m credited for as well.

KK: Oh nice.

KS: So yeah, the video I did with Brady was for his channel Numberphile, which is as I understand it a hugely popular maths channel. I've done about five or six videos on there, and I've genuinely been recognized in the street.

EL: Oh wow. That’s amazing.

KS: I walked into a shop and the guy was like, “Are you Katie Steckles?” I said, “Yes?” Like, the customer service has gone way up in this place. And he said, “No, I’ve just been watching your video on YouTube.” It’s like, Oh, okay. So that was nice. So he asked me to come and do a few videos, and that was one of the things I want us to talk about. I said, “What do you want me to do? I mean, do you want me to spell out Numberphile or your name or whatever? Brady, who’s Australian, said, “No do, the whole alphabet.” His exact words were, “If you're going to be a bear, be a grizzly.” A very Australian thing to say, he was basically saying let's do the whole alphabet, it will be great. I think at that point it was early enough I wasn't 100 percent sure I would get them all right, but his kind of thing that he has about his videos is that they always write maths down on brown paper, so he had this big pile of brown paper there, and he cut it all into pieces for me, one for each letter. And it was such a wonderful kind of way to nod to that tradition of using brown paper. But I just sat there folding them all, and he filmed the whole thing, and he put it in as a time lapse, and then I cut each one, one cut on each bit of paper, and open them all up, and they all worked, so it was good. But it was this very long day crouched over a little table cutting out all of these letters. But people genuinely come and ask me about it because of that video, so that's quite nice.

EL: Yeah, well I think after I watched that video, I tried to do—I didn’t. H was was my kryptonite. I was trying to fold that, and I just at some point gave up. Like I kept having these long spindles coming out of the middle bar that I couldn't seem to get rid of.

KS: I think somewhere I have a photograph of all of my early attempts at the S. It’s just ridiculous. Like it's just a Frankenstein's monster parade of villains, just horrific shapes that don't even look like an S, and like how did I get this?

But it kind of gave me a learning process, and I think it was maybe just a few weeks of solidly playing around with things. I think I had one night in a hotel room while I was away working so that no one else around. I just spent the whole evening folding bits of paper. I don't know what the maid who cleaned the room the next day thought. The bin was full of bits of cut up paper. I've got like a big stacks of scrap paper at home that's like old printouts and things I don't need that I use for practicing the alphabet because I go through a lot of paper when I’m practicing.

KK: This is a really fun theorem. So you know, another thing we like to do on this podcast is ask our guests to pair their theorem with something. So what have we chosen to pair the fold-and-cut theorem with?

KS: Wow. So I know that you sometimes often pair things with foodstuffs, so I'm going to suggest that I would pair this with my husband's chili and cheddar waffles.

EL: Okay.

KS: And I’ll tell you why, so my reasoning is that I kind of feel like this is a really nice example, as a theorem, about kind of the way that maths works and the way the theorems work. So my husband's chili is a recipe that he's been working on for years. He comes from a family where they do a lot of cooking, and it was natural for him when he moved out to just have his own kind of recipes. His chili recipe is so good that we've taken his chili to parties and people have asked for the recipe. And I'm just like, there isn't one. It's not written down anywhere. It's just in his head. He has this recipe. And he's obviously worked really hard on on it and achieved this brilliant thing. And kind of the ability to do the alphabet, the ability to kind of make things using this theorem for me is my equivalent of that. It's my special skill I can show off to people with. Because, you know, I've put in that time and I've solved the problem. And one of my favorite things about maths is that it gives you that problem solving kind of brain, in that you will just keep working at something, you keep practicing until you get there. And then the reason why I’ve paired it with cheddar waffles is (a) because that is a delicious combo.

EL: That sounds amazing.

KK: Yeah.

KS: Yeah. As soon as we got a waffle maker, that was our first go at it, was “What can we put with this chili that will make it even better?” And I just found the recipe for cheddar waffles on the internet, because we don't have that, you know, we don't do that many waffles. We don’t really know how to make them. And but the fact that you can go online and just find a recipe for something, is a really nice kind of aspect of modern life.

This is one of the things about maths I appreciate is that once you prove the theory that kind of goes into a toolbox, and other people can then you know, look at that theorem and use it in whenever they're doing, and you kind of building your maths out of bits of things that other people have proved, and bits of things that you're proving, and it's sort of a nice analogy for that, I guess. So those are those are the two things about it. Now that we've got the fold-and-cut theorem, nobody needs to prove it again, and anyone can use it.

EL: Yeah. And I guess if it were a perfect analogy, in some ways, maybe the chili recipe is sort of like these algorithms for making them, they’re really—well maybe that’s not good because the algorithms seem really complicated and difficult. Here, it's more that the recipe is hidden in your husband's brain.

KK: Well, a lot of algorithms feel that way.

KS: It really is quite complex. So you get some more things out of the cupboards that I've never seen before and they all go back in again afterwards. There’s a lot to it that people don’t realize.

KK: It’s a black box. my chili recipe is a black box, too. I can't tell you what's in it I mean it’s probably not as good as your husband’s, though.

KS: It’s got roasted vegetables in it. Yeah, it's that's that's one of the main secrets if anyone's trying to recreate it. But then just a whole lot of other spices that only he can tell me

EL: My husband doesn't like soups with tomatoes in them very much. I mean sometimes he does. But I don't do chili very much. So yeah, I don't have a good chili recipe we have a friend who's allergic to onions and that's a nice excercise in, can you cook or modify your recipe and still have it taste like what it’s supposed to be? because without us yeah a lot of things that don't work and she must have a nightmare with it. Because like a lot of packaged foods, they've got it.

KK: Sure.

KS: They’ve got onion powder or stuff.

EL: Every restaurant.

KS: We made chili without, and it kind of works. It kind of works without onions. It was great. I think there was a bit more aubergine that went in and some new spices, just to give it a bit more oniony flavor, but it still works.

EL: Oh, nice. Yeah, cooking without onions is tough. Does it extend to to garlic—does it generalize to other things in the allium family?

KS: Yeah, it’s all alliums, so she can’t really have garlic either she can get away with a little bit of garlic, but not any reasonable amount. Yeah, it must be completely horrible. Actually it kind of reminds me of Eugenia Cheng, her first book was about maths and baking. But one of the really nice points that she makes about the analogy between recipes and maths, which we have apparently stumbled into is that, you know, understanding something in a maths sense means that you can take bits of it out and replace it with other things. You've got a particular problem and you go, “Okay, well, do we need to make this assumption, do we need this particular constraint? What happens if we relax this and then put something else in?” And that's how you explore kind of where you go with things. And if you relax a constraint and then find the solution, that maybe tell us something about the solution to the constraint problem, and things like that. So, you know, tweaking a recipe helps you to understand the recipe a bit more. And as long as you know roughly what goes in there and you've got something that is, you know, recognizably a chili, then, you know, it doesn't matter what you've changed, I guess.

KK: Yeah, so we also give our guests a chance to plug anything you're working on. You want to plug videos, websites, anything?

KS: Oh, I’m always working on a million different things. I guess probably the nicest thing for people to have a look at would be the Aperiodical, which is a website where I blog with two of my colleagues so we write— it's kind of a maths blog but aimed at the people who are already interested in maths, so it's one of the few things I do that is not an outreach project. Which is essentially it’s aimed at people who already are interested and want to find out what's going on, so we sometimes right like opinion pieces about things or, like, “Here’s a nice bit of maths I found,” and then sometimes we just write news. And there’s a surprising amount of maths news, it turns out. It's not just “They’ve discovered a new Mersenne prime again.” There are various other maths news stories that come up as well, so we write those up, and bits of competitions and puzzles and things as well and it's at aperiodical.com. And we get submissions. So if anyone else wants to write an article and have it go out on a blog that’s seen by, you know, a couple of thousand people a day or whatever, they’re welcome to send us stuff, and we’ll have a look at it.

EL: Yeah, it's a lovely blog, and you also organize and host the math blog carnival that is, like, every month a round-up of math blog posts and stuff like that.

KS: We sort of inherited that from whoever was running it before, the Carnival of Mathematics. Every month someone who has a maths blog takes it in turn to write a post, which is essentially just a bunch of blog posts that went out this month. And we have the submissions form and all the kind of machinery behind it is now hosted at Aperiodical and has been for a few years, so if you have a maths blog elsewhere, and you want to get an opportunity to put a post on your site that will be seen by a bunch of people because there's a bunch of people who just read it every month, then get in touch because we're always looking for hosts for future months. And essentially we just forward to your email address all the submissions that people put in during the month, and you can then write it up in kind of the first week of the next month.

EL: Yeah. And I always see something cool on there that I had missed during the month. So it's a nice resource.

KS: So one of the other non-outreach, I guess, maths things that I'm involved with is a thing called Maths Jam. Or in the U.S. the equivalent would be Math Jam. We do have both websites, basically. So I coordinate all the Math Jams in the world. So it's essentially a pub night for people who want to go and do maths in a pub with people. It's aimed at adults because a lot of kids already get a chance to go to math club at school and do maths puzzles and things in their classrooms, but adults who have finished school, finished university, don't often get that chance. So we basically go to the pub once a month or to a bar or restaurant somewhere that will allow us to sit around and drink do maths. And there are now I think, getting on for a hundred Maths Jams in the world. So we've got about 30 or 40 in the UK. And then they’re popping up all over. We just picked up one in Brazil, we’ve got three in Italy now, three in Belgium, and there are a few in the U.S. But what I'm going to say is that I’m very sad that we don't have more because I feel like it would be really nice if we had a whole load of U.S. jams. I think we've got more in Canada that we have in the USA, which interesting given the population sizes, or relative sizes.

EL: Right.

KS: I think Washington DC has just gone on hiatus because not enough people are coming along. So the organizer said, “I'm getting fed up of sitting in the pub on my own. No one else is coming. I'm just going to put it on hold for now.” And so if you live somewhere in the U.S. and you want to go meet with the people and do maths in an evening, essentially to start when you just need a couple of people you that know you can drag along with you to sit around the case no one else turns up. And we send out a sheet with some ideas of puzzles and things to do. And you can play games, chat about maths, and do whatever. People can bring stuff along. And all you need to do to organize it is choose a bar and send the email once a month. And those are the only requirements. And go to the pub once a month, but I think that's probably not a big ask if that's the kind of thing you're into. So if anyone is interested, you can email to katie@mathsjam.com and I can send you all the details of what's involved. You can have a look on the website, mathsjam.com, or math-jam.com, if you want to have a look at what there is already, what’s near you.

EL: Yeah, it'd be nice to have more in the U.S.

KS: Yeah, well, I get a lot out of it. Even though it's kind of sort of my job, but also I always meet people and chat through things and share ideas and people always go, “Oh, that reminds me of this other thing I saw,” and they show me something I've not seen before. And it's such a nice way to share things. But also just to know that everyone else in the room is totally sympathetic to maths and will be quite happy for you to chat on about some theorem or whatever and not think you’re weird. It’s quite nice.

EL: Well thanks a lot for joining us. I enjoyed talking about the fold-and-cut theorem. It makes me want to go back and pick up that alphabet again and try to conquer Mount H, that felled me the last time.

KS: I can send you send you a picture of my fold pattern for each, but I’m sure you would much rather work it out for yourself. It’s such a lovely puzzle. It's a really nice little challenge.

EL: Yeah, it’s fun.

Episode 29 - Mike Lawler

Kevin Knudson: Welcome to My Favorite Theorem. I’m Kevin Knudson, professor of mathematics at the university of Florida, and this is your other host.

EL: Hi. I’m Evelyn Lamb. I’m a freelance math and science writer in Salt Lake City, Utah.

KK: How’s it going, Evelyn?

EL: How are you today?

KK: I’m okay. I’m a little sleepy. So before I came to Florida, I was at Mississippi State University, and I still have a lot of good friends and colleagues there, and that basketball game last night. I don’t know if you guys saw it, but that last minute shot, last second shot that Notre Dame hit to win was just a crusher. I’m feeling bad for my old friends. But other than that, everything’s great. Nice sunny day.

EL: Yeah, it’s gray here, so I’m a little, I always have trouble getting moving on gray mornings.

KK: But you’ve got that nice big cup of tea, so you’re in good shape.

EL: Yes.

KK: That’s right. So today we are pleased to welcome Mike Lawler. Mike, why don’t you introduce yourself and tell everyone about yourself?

1:24 ML: Hi. I’m Mike Lawler. I work in the reinsurance division for Berkshire Hathaway studying large reinsurance deals. And I also spend a lot of my spare time doing math activities for kids, actually mostly my own kids.

KK: Yeah.

EL: Yeah.

KK: Yours is one of my favorite sites on the internet, actually. I love watching how you explain really complicated stuff to your kids. How old are they now? They’re not terribly old.

ML: They’re in eighth grade and sixth grade.

KK: But you’ve been doing this for quite a while.

ML: We started. Boy, it could have been 2011, maybe before that.

KK: Wow, right.

ML: I think all three of us on the podcast today, and probably everybody listening, loves math.

KK: One hopes.

ML: And I think there’s a lot of really exciting math that kids are really interested in when they see. It’s fun finding things that are interesting to mathematicians and trying to figure out ways to share them with kids.

EL: Yeah. Well I like, you always make videos of the things, so listening to your kids talking through what they’re thinking is really fun. Recently I watched one of the old ones, and I was like, “Oh my goodness! They’re just little babies there.” They’re so much bigger now. I don’t have kids of my own, so I don’t have that firsthand look at kids growing up the same way. They’re sweet kids, though.

ML: I have to say, one of the first, it wasn’t actually the first one we did, but it’s called Family Math 1, where we do the famous “How many times can you fold a piece of paper?” And, you know, they’re probably 4 and 6 at the time, or maybe 5 and 7, and yeah, it’s always fun to go back and watch that one.

EL: Yeah.

KK: I see videos of my son, he’s now 18, he’s off in college. When I see videos of him, he’s a musician, so when he was 10, figuring out how to play this little toy accordion we got him, I kind of get a little weepy. You know.

ML: It’s funny, I was picking him up somewhere the other day, and I confused him with a 20-year-old, my older son, and I just thought to myself: how did this happen?

KK: So, all right. Enough talking about kids, I guess. So, Mike, we asked you on to talk about your favorite theorem. So what is it?

ML: Well, it’s not quite a theorem, but it’s something that’s been very influential to me. Not in sharing math with kids, but in my own work. It comes from a paper from 1995 at a professor named Zvi Bodie at BU. And he was studying finance, and continues to study finance. And he published a paper showing that the cost of insurance for long holdings in the stock market actually increases with time. Specifically, if you want to buy insurance to guarantee your investments at least earn the risk-free rate, that cost of insurance goes up over time. And it just shocked me when I was just learning about finance, actually when I was just in grad school. And this paper has had a profound influence on me over the last 20 years. So that’s what I want to talk about today.

KK: Okay. I know hardly any of those words. I have my retirement accounts and all that, but like most good quantitatively-minded people, I just ignore them.

ML: Well, let’s take a simple example. Let’s just take actually the most simple example. Say you wanted to invest $100 in the stock market, and you thought, because you’ve read or you’ve heard that the stock market gives you good returns, you thought, “Well, in 10 years from now, I think I’ll probably have at least $150 in that account.” And you said, “Well, what I want to do is go out and buy some insurance that guarantees me that at least I’ll have that amount of money in the account. That’s the problem. That’s the math problem that Bodie studied.

KK: Right. So how does one price that insurance policy, I guess? So right, on the insurance side, how do they price that correctly, and on the consumer side, how do you know you’re getting a worthwhile insurance policy, I guess.

ML: Yeah, well this is kind of the fun of applied mathematics. So there’s a lot of theory behind this, and I think like a lot of good theories, it’s not named after the people who originally discovered that. So I think that’s important part of any theory. But then when you understand the theory, and you actually go into the financial markets, you have to start to ask yourself, “What parts of the theory apply here, and which ones don’t?” So the theory itself goes back to the early 1900s with a French mathematician and his Ph.D. thesis. His last name is Bachelier, and I’m probably butchering that. But then people began to study random processes, and Norbert Wiener studied those. And eventually all of that math came into economics, I think in the late 60s, early 1970s, and something called the Black-Scholes formula came to exist. The Black-Scholes formula is what people use to price this kind of insurance, sometimes called options. So that’s been around the financial markets since at least the early 1970s, so let’s call it 50 years now. And if you’re a consumer, I think you’d better be careful.

EL: Well I find, I don’t know a lot about financial math, but I’ve tried to read a few books about the financial crash, actually one of which you suggested to me, I think, All the Devils Are Here. And I find, even with my math background, it’s very confusing what they’re pricing and how they’re calculating these, how they’re batching all of these things. It just really seems like a black box that you’re just kind of hoping what’s in the box isn’t going to eat you.

ML: That’s a pretty good description. Yeah, Bethany MacLean’s book All the Devils Are Here is absolutely phenomenal, and Roger Lowenstein’s book, called When Genius Failed, is also an absolutely phenomenal book. You are absolutely right. The math is very heavy, and a lot of times, especially when you talk about the financial crisis, the math formulas get misused a little bit, and maybe are applied into situations where they might not necessarily apply.

KK: Really? Wall Street does that?

ML: So you really have to be careful. I think if you pull the original Black-Scholes paper, I think there are 7 or 8 assumptions that go into it. As long as these 7 or 8 things are true, then we can apply this theory. In theory we can apply the theory.

KK: Right.

ML: So when you go into the financial markets, a lot of times if you have that checklist of 7 things with you, you’re going to find maybe not all 7 are true. In fact, a lot of times, maybe you’re going to find not a single one of those things is true. And that is I think a problem that a lot of mathematicians have when they come into the markets, and they just think the theory applies directly, if you will.

KK: Right, and we’ve all taught enough students to know they’re not very good at checking assumptions, right? So if you have to check off a list of 6 or 7 things, then after the first couple, you’re like, “Eh, I think it’s fine.”

ML: Right. Maybe that seventh one really matters.

KK: Right.

EL: Yeah.

ML: Or maybe you’re in a situation where the theory sort of applies 95% of the time, but now you’re in that 5% situation where it really doesn’t apply.

KK: So should I buy investment insurance? I mean, I’ve never directly done such a thing.

ML: Well…

KK: I don’t know if it’s an option for me since I just have 401Ks, essentially.

ML: Well, it’s probably not a great idea to give investment advice over a podcast.

KK: Right, yeah, yeah.

ML: But from a mathematical point of view, the really interesting thing about Bodie’s paper is Black-Scholes is indeed a very complicated mathematical idea, but the the thing that Bodie found was a really natural question to ask about pricing this kind of insurance, ensuring that your portfolio would grow at the risk-free rate. In that situation, and you can see it in Bodie’s paper, the math simplifies tremendously. And I think that is a common theme across mathematics. When someone finds exactly the right way to look at a problem, all of a sudden the problem simplifies. And I’m sure you can probably give me 3 or 4 examples in your own fields where that is then the case.

KK: Sure. Well, I’m not going to, but yeah.

EL: So something when you told us that this was the theorem or quasi-theorem you were going to talk about, it got me wondering how much the financial world—I’ve been trying to think about how to phrase this question—but how much your natural tendencies as mathematicians actually carry over into finance. How much are you able to think about your work in finance and insurance as math questions and how much you really have to shift how you’re thinking about things to this more realistic point of view.

ML: I think it’s a great question because, you know, the assumptions and a lot of times the mathematical simplifications that allow you to solve these differential equations that stand behind the Black-Scholes theorem and generally stochastic processes, you know, you’re, that doesn’t translate perfectly to the real world. And you have to start asking questions like, “If this estimate is wrong, does it miss high? Does it miss low?” “In the 5% of the times it doesn’t work, do I lose all my money?

EL: Right.

ML: And so those, I can tell you as an undergrad I was also a physics major, and I spent a lot of time in the physics lab, and there’s not one single person who was ever in lab with me who misses me. I was a mathematician in the labs. But doing some of these physics experiments really teaches you that applying the theory directly, even in a lab situation, is very difficult.

KK: Right.

EL: Right. And your Ph.D. was in pure math, right?

ML: Right, it was sort of mathematical physics. In the late 90s, people were really excited about the Yang-Mills equations.

KK: Mirror symmetry.

ML: Work that Seiberg and Witten were doing. So I was interested in that.

EL: So your background is different from what you’re doing now.

ML: Oh, totally. You know, I, it’s kind of a hard story for me to tell, but I really loved math from the time I was in fifth grade all the way up through about my third year of graduate school.

EL: Yeah, I think that could be a painful story.

ML: I don’t know why, I really don’t know why, I just kind of lost interest in math then. I finished my Ph.D., and I even took an appointment at the University of Minnesota, but I just lost interest, and it was an odd feeling because from about fifth grade until—what grade is your third year of graduate school?

KK: Nineteenth.

ML: Nineteenth grade. I really got out of bed every morning thinking about math, and I sort of drifted away from it. But my kids have brought me back into it, so I’m actually really happy about that.

KK: Well that’s great. So, what have you chosen to pair with your quasi-theorem, we’re calling it?

ML: Well, you know, so for me, this paper of Bodie’s goes back, and it sort of opened a new world for me, and for the last 20 years I’ve been studying more about it and learning more about it and all these different things, so I got to thinking about a journey. I have books on my table right now about this paper. So the journey I want to highlight is—and I think a lot of people can understand who are outside of math—is an athletic journey. I’m going to bring up a woman named Anna Nazarov, who represents the United States on the national ultimate frisbee team, which is a sport I’ve been around. And four years ago, she made it almost to being on the national team and got cut in the last minute and wrote this very powerful essay about her feelings about getting cut and then turned around and worked hard and improved and won three world and national championships in the last four years as a result of that work.

KK: Wow.

ML: Yeah, you know, it’s hard to compare world championships to just your plain old work. I think people in math understand that you kind of roll up your sleeves and over a long period of time you come to understand mathematics, or you come to understand in this case how certain mathematics applies, and so I want to pair this with that kind of athletic journey, which I think, to the general public, people understand a little bit better.

EL: Yeah, so I played ultimate very recreationally in grad school. There was a math department pickup ultimate game every week, and playing with other math grad students is my speed in ultimate. I really miss it. When you, I can tell, follow ultimate, and I often read the links you post about ultimate frisbee, I’m like, oh, I kind of miss doing that. But a few years ago, I did get to, I happened to be in Vancouver at the same time that they were doing the world ultimate championships there and got to see a couple games there, and it’s really fun, and it’s been fun to follow the much-higher-level-than-math-grad-student ultimate playing thing through the things you’ve posted.

ML: Yeah, it’s neat to follow an amateur sport, or not as well-known a sport because the players work so hard, and they spend so much of their own money to travel all over the world. You know, I think a lot of people do that with math. Despite the topic of today’s conversation, most people aren’t going into math because of the money.

KK: Well this has been great fun. Thanks for joining us, Mike. Is there anything, we always want to give our guest a chance to plug anything. We already kind of plugged your website.

EL: We’ll put links to your blog in the show notes there, and your Twitter. But yeah, if there’s anything else you want to plug here, this is the time for it.

ML: No, that’s fine. If you want to follow Mike’s Math Page, it’s a lot of fun sharing math with kids. And like I said, I sort of lost interest in math in grad school, but sharing math with kids now is what gets me out of bed in the mornings.

KK: Great.

EL: Yeah.

KK: All right. Well, thanks again, Mike.

ML: Thank you.

Episode 28 - Chawne Kimber

Kevin Knudson: Welcome to My Favorite Theorem. I’m your cohost Kevin Knudson, professor of mathematics at the University of Florida. I am joined by cohost number 2.

Evelyn Lamb: I am Evelyn Lamb. I’m a freelance math and science writer in Salt Lake City. So how are you?

KK: I’m okay. And by the way, I did not mean to indicate that you are number 2 in this.

EL: Only alphabetically.

KK: That’s right. Yeah. Things are great. How are things in Salt Lake?

EL: Pretty good. I had a fantastic weekend. Basically spent the whole thing reading and singing, so yeah, it was great.

KK: Good for you.

EL: Yeah.

KK: I didn’t do much. I mopped the floors.

EL: That’s good too. My floors are dirty.

KK: That’s okay. Dirty floors, clean…something. So today we are pleased to have Chawne Kimber on the show. Chawne, do you want to introduce yourself?

Chawne Kimber: Sure. Hi, I’m a professor at Lafayette College. I got my Ph.D. a long time ago at University of Florida.

KK: Go Gators!

CK: Yay, woo-hoo. I work in lattice-ordered groups.

KK: Lattice-ordered groups, very cool. I should probably know what those are, but maybe we’ll find out what they are today. So yeah, let’s get into it. What’s your favorite theorem, Chawne?

CK: Okay, so maybe you don’t like this, but it’s a suite of theorems.

KK: Even better.

EL: Go for it.

CK: So, right, a lattice-ordered group is a group, to begin with, in which any two elements have a sup and an inf, so that gives you your lattice order. They’re torsion-free, so they’re, once you get past countable ones, they’re enormous groups to work with. So my favorite theorems are the representation theorems that allow you to prove stuff because they get unwieldy due to their size.

EL: Oh cool. One of my favorite classes in grad school was a representation class. I mean, I had a lot of trouble with it. It was just representations of finite groups, and those were still really out there, but it was a lot of fun. Really algebraic thinking.

CK: Well actually these representations allow you to translate problems from algebra to topology, so it’s pretty cool. The classical theorem is by Hahn in 1909. He proved the special cases that any totally ordered Archimedean group can be embedded as a subgroup of the reals, and it kind of makes sense that you should be able to do that.

KK: Sure.

CK: And then he said that any ordered abelian group, so not necessarily lattice-ordered, can be embedded in what’s called a lexicographical product of the reals. So we could get into what that is, but those are called Hahn groups. They’re just huge products of the reals that are ordered in dictionary order that only live on well-ordered sets. So this conjecture, it’s actually a theorem, but then there’s a conjecture that that theorem is actually equivalent to the axiom of choice.

KK: Wow.

EL: Oh wow.

CK: Right?

EL: Can we maybe back up a little bit, is it possible to, for me, I really like concrete examples, so maybe can you talk a little bit about a concrete example of one of these archimedean groups? I don’t know how concrete the concrete examples are.

CK: No, they’re just really weird ways of hacking at the reals, basically, so they’re just subgroups of the reals. Think of your favorite ones, and there you go, the ones that are archimedean. And as soon as you add two dimensions of ordering, it’s even more complex, right? So the classical example that I work with would be rings of continuous functions on a topological space, and then you can build really cool examples because we all understand continuous functions, so C(X), real-valued continuous functions on a Tychonoff space, so T-3 1/2, whatever.

KK: Metric space.

CK: The axioms so you have enough continuous functions. So Gillman and Jerison in the 1950s capitalized on a theorem from the 1930s by Gelfand and Kolmogorov that said that the maximal ideals of C(X), if you take them in the hull-kernel topology, are isomorphic to the Stone-Čech compactification of the space that you’re working on. And so if you have a compact space to begin with, then your space is isomorphic to your maximal ideals. So then, just build your favorite—so C(X) is lattice-ordered, if you take the pointwise ordering, and then since the reals have a natural order on then, you pick up your sups and infs pretty easily. So there you’re starting to touch some interesting examples of these groups. Have I convinced you, Evelyn?

EL: Yeah, yeah.

CK: Okay, good. So they’re huge. You have to have some complexity in order to be able to prove anything interesting about them. So then there the Hahn embedding is pretty obvious. You just take the images of the functions. There’s too much structure in a ring like that, so maybe you want to look at just an ordered group to get back to the Hahn environment. So how can you mimic Hahn in view of Gelfand-Kolmogorov? So can we get continuous functions as the representation of an ordered group? Because the lex products that Hahn was working with are intractable in a strong way. And so then you have to start finding units because you have to be able to define something called a maximal sub-object, so you want it to be maximal with respect to missing out on some kind of unit. And so then we get into a whole series of different embedding theorems that are trying to get you closer to being able to deal with the conjecture I mentioned before, that Hahn’s embedding theorem is equivalent to the axiom of choice.

EL: Yeah, I’m really fascinated by this conjecture. It kind of seems like it comes out of nowhere. Maybe we can say what the axiom of choice is and then, is there a way you can kind of explain how these might be related?

CK: Yes and no.

KK: Let’s start with the axiom of choice.

CK: Yeah, so the axiom of choice is equivalent to Zorn’s lemma, which says that maximal objects exist. So that’s the way that I deal with it. It allows me to say that maximal ideals exist, and if they didn’t exist, these theorems wouldn’t exist. You use this everywhere in order to prove Hahn’s theorem, so that’s why it’s assumed to be possibly equivalent. This isn’t the part that I work on. I’m not a logician.

KK: So many things are equivalent to the axiom of choice. For example, the Tychonoff product theorem, which is that the product of compact spaces is compact. That’s actually equivalent to the axiom of choice, which seems a bit odd. I was actually reading last night, so Eugenia Cheng has this book Beyond Infinity, her most recent book, good bedtime reading. I learned something last night about the axiom of choice, which is that you need the axiom of choice to prove that if you have two infinities, two countable infinities, you want to think [they’re the same], it’s countable somehow. If they come with an order, then fine, but if you have two, like imagine pairs of socks, like an infinite collection of pairs of socks, is that countable? Are the socks countable? It’s an interesting question, these weird slippery things with the axiom of choice and logic. They make my head hurt a little bit.

CK: Mine too.

EL: So yeah, you’re saying that looking at the axiom of choice from the Zorn’s lemma point of view, that’s where these maximal objects are coming in in the Hahn conjecture, right?

CK: Absolutely.

KK: That makes sense.

CK: That’s kind of why I drew the parallel with this theorem about C(X), these maximal ideals being equivalent to the space you’re on. Pretty cool.

KK: Right. Because even to get maximal ideals in an arbitrary ring, you really need Zorn’s lemma.

CK: Right. And there’s a whole enterprise of people working to see how far you can peel that back. I did take a small foray into trying to understand gradations of the axiom of choice, and that hurts your head, definitely.

KK: Right, countable axiom of choice, all these different flavors.

CK: Williams prime ideal theorem, right.

KK: Yeah, okay.

EL: So what drew you to these theorems, or what makes you really excited about them?

CK: Well, you know, as a super newbie mathematician back in the day, I was super excited to see that these disparate fields of algebra and topology that everyone had told me were totally different could be connected in a dictionary way. So a characteristic of a ring can be connected is equivalent to a characteristic on a topological space. So all kinds of problems can be stated in these two different realms. They seem like different questions, but they turn out to be equivalent. So if you just know the way to cross the bridge, then you can answer either question depending on which realm gives you the easier approach to the theorem.

KK: I like that interplay too. I’m a topologist, but I’m a very algebraic one for exactly that reason. I think there are so many interesting ideas out there where you really need the other discipline to solve it, or looking through that lens makes it a lot clearer somehow.

EL: And was this in graduate school that you saw these, or as a new professor?

CK: Definitely grad school. I was working on my master’s.

KK: So I wonder, what does one pair with this suite of theorems?

CK: It’s a very hard question, actually.

KK: That’s typical. Most people find this the more difficult part of the show.

CK: Yeah. I think that if you were to ask my Ph.D. advisor Jorge Martinez what he would pair, he is very much a wine lover and an opera lover. So it would be both. You’d probably see him taking a flask into Lincoln center while thinking about theorems. So he loved to go to Tuscany, so I assume that’s where you get chianti. I don’t know, I could be lying.

KK: You do, yeah.

CK: Yeah, so let’s go with a good chianti, although that might make me sound like Hannibal Lecter.

KK: No fava beans.

CK: So we’ve got a chianti, and maybe a good opera because it’s got to be both with him. It’s hard for me to say. So he comes up to New York to do an opera orgy, just watching two operas per day until he falls down. I sometimes join him for that, and the last one I went to was Così fan tutte, and so let’s go with that because that’s the one I remember.

EL: If I remember correctly—it’s been a while since I saw or listened to that opera—there are pairs of couples who end up in different configurations, and it’s one of these “I’ll trick you into falling in love with the other couple’s person” that almost seems like the pairs being topology and algebra, and switching back and forth. I don’t know, maybe I’m putting ideas in your mind here.

CK: Or sort of the graph of the different couplings, the ordered graph could be the underlying object here. You never know.

EL: An homage to your advisor here with this pairing.

CK: Yeah, let’s do that.

EL: Well I must admit I was kind of hoping that you might pair one of your own quilt creations here. So I actually ran into you through a quilting blog you have called completely cauchy. Do you mind talking to us a little bit about how you started quilting and what you do there because it’s so cool.

CK: Yeah. Of course I chose that name because Cauchy is my favorite mathematician, and as a nerd there would be no other quilt blog named after a dead mathematician. So I am a little mortified that when you google “Cauchy complete,” as many students do, mine is actually the first entry that comes up on google.

KK: Excellent.

CK: I don’t know what that means, but okay. So yeah, when I applied for tenure, which is kind of a hazing process no matter where you are, no matter how good of a faculty member you are, I really wanted to have control, and you don’t have control at that point. And so I started sewing for fun, late at night, at 1 am, after everything kind of felt done for the day. I never imagined that I’d be doing what I’m doing today, which is using quilting to confront issues of social justice in the United States, and they’ve been picked up by museums and other venues. It’s this whole side hustle out there that I kept quiet for a long, long time. And then once I got promoted to full professor I came out of the closet.

KK: Were you concerned that having a side hustle, so to speak, would compromise your career? Because it shouldn’t.

CK: Yeah, I think something so gender-specific as quilting, something you associate with grandmas. At the end of the day, the guys I work with, I must say half of my quilts have four-letter words on them, you know, the more interesting four-letter words, so as soon as my guys saw them, they were totally on board with this enterprise, so I didn’t really need to be into the closet, but I didn’t want anybody to ever say, “Oh, she should have proved one more theorem instead of making that quilt.”

EL: Yeah.

KK: It’s unfortunate that we feel that way, right? I think that’s true of all mathematicians, but I imagine it’s worse for women, this idea that you have to work twice as hard to prove you’re half as good or something like that?

CK: Do we need to mention I’m also a black woman? So that’s actually how I was raised, you need to do three times as much to be seen as half as good, and that’s the way that I’ve lived my life, and it’s not sustainable in any way.

KK: No, absolutely not.

EL: But yeah, they are really cool quilts, so everyone should look at completely cauchy, and that’s spelled cauchy. There’s a mathematician named Cauchy. I actually have another mathematician friend with a cat named Cauchy, or who had a cat named Cauchy. I think the cat has passed away. Yeah, and I actually sew as well. I’ve somehow never had the patience for quilting. It just feels somehow like too little. I like the more immediate gratification of making a whole panel of a skirt or something. You do really intricate little piecing there, which I admire very much, and I’m glad people like you do it so I don’t have to.

KK: Sure, but Evelyn, you don’t have to make it little.

CK: You don’t.

KK: I’m sure you’ve seen these Gee’s Bend quilts, right, they’re really nice big pieces, and that can have a very dramatic effect too. But yeah, the intricate work is really remarkable. My wife has done a little quilting, and she always gets tired of it because of the fine stuff, but then she’s a book artist. She sets lead typing in her printing press by hand, and that’s fine, but piecing together little pieces of cloth somehow doesn’t work.

CK: It seems more futile, you take a big piece of fabric and cut it into small pieces so that you can sew it back together. That is kind of dumb when you think about it.

KK: Well, but I don’t know, you’ve got this whole Banach-Tarski thing, maybe.

EL: Bring it back around to the axiom of choice again.

CK: You guys are good at this.

KK: It’s not our first podcast. Well this has been great fun. Anything else you want to promote?

CK: No, I’m good.

KK: Thanks for joining us, Chawne. This has really been interesting, and we appreciate you being on.

CK: Great. Thank you.

EL: Thanks.

Episode 27 - James Tanton

Kevin Knudson: Welcome to My Favorite Theorem. I’m one of your hosts, Kevin Knudson, professor of mathematics at the University of Florida, and here is your jet-lagged other host.

Evelyn Lamb: Hi, I’m Evelyn Lamb, a freelance math and science writer in Salt Lake City. I’m doing pretty well right now, but in a few hours when it’s about 5 pm here, I think I will be suffering a bit. I just got back from Europe yesterday.

KK: I’m sure you will, but that’s the whole trick, right? Just keep staying up. In a couple of weeks, I’m off to that part of the world. I’ll be jet-lagged for one of the ones we have coming up right after that. That should be fun. I’ll feel your pain soon enough, I’m sure.

EL: Yeah.

KK: So today we are pleased to welcome James Tanton. James, why don’t you introduce yourself and tell everyone about yourself?

James Tanton: Hello. First of all, thank you for having me. This is such a delight. So who am I? I’m James Tanton. I’m the mathematician-at-large for the Mathematical Association of America, which is a title I’m very proud of. It’s a title I never want to give up because who doesn’t want to be a mathematician-at-large, wreaking havoc wherever one steps? But my life is basically doing outreach in the world and promoting joyous thinking and doing of mathematics. I guess my background is somewhat strange. You can probably tell I have an accent. I grew up in Australia and came to the US 30 years ago for my Ph.D., which was grand, and I liked it so much here I am 30 years later. My career has been kind of strange. I was in the university world for close to 10 years, and then I decided I was really interested in the state of mathematics education at all levels, and I decided to become a high school teacher. So I did that for 10 years. Now my life is actually working with teachers and college professors all across the globe, usually talking about let’s make the mathematics our kids experience, whatever level they’re at, really, truly joyous and uplifting.

EL: Yeah, I’ve wondered what “mathematician-at-large” entails. I’ve seen that as your title. It sounds like a pretty fun gig.

JT: So I was the MAA mathematician-in-residence for a good long while. They were very kind to offer me that position. But then I’m married to a very famous geophysicist, and my life is really to follow her career. She was off to a position at ASU in Phoenix, and then off we moved to Phoenix four years ago. So I said to the folks at the MAA, “Well, thanks very much. I guess I’m not your mathematician-in-residence anymore,” and they said, “Why don’t you be our mathematician at large?” That’s how that title came up, and of course I so beautifully, graciously said yes because that’s spectacular.

KK: Yeah, that sounds like a Michael Pearson idea, that he would just go, “No, no, we really want to keep you.”

JT: It’s so flattering. I’m so honored. It’s great because, you know, actually, it’s the work I was going to do in any case. I feel compelled to bring joyous mathematics to the world.

KK: Right. Okay, so this podcast is about theorems. So why don’t you tell us what your favorite theorem is?

JT: Okay, well first of all, I don’t actually have a theorem, even though I think it should be elevated to the status of one. I want to talk about Sperner’s lemma. So a lemma means, like, an auxiliary result, a result people use to get to other big ideas, but you know what? I think it’s charming in and of itself. So Sperner’s lemma. This was invented slash discovered back in the 1920s by a German mathematician by the name of Emanuel[] Sperner, who was playing with some combinatorial thinking in Euclidean geometry and came up with this little result.

Let me describe to you in one way first, not really the way he did it, because then I can actually explain a proof as well of the result. Imagine you have a big rubber ball, just a nice clean rubber surface, and you’ve got a marker. I’m going to suggest you just put dots all over the surface of the rubber ball, lots of dots all over the place. Once you’ve done that to your satisfaction, start connecting pairs of dots with little line segments. They’ll be little circular arcs, and make triangles, so three dots together make a triangle. Do that all over the surface of the sphere. Grand. So now you’ve got a triangulated sphere, a surface of a sphere completely covered with triangles. Each triangle for sure has only three dots on it, one in each corner, so no dots in the middle of the edges, please. All right? That’s step one.

Step two, just for kicks, go around and just label some of those dots with the letter A, randomly, and do some other dots with the letter B, randomly, just some other dots with the letter C—why not?—until each dot has a label of some kind, A, B, or C. And then admire what you’ve done. I claim if you look at the various triangles you have, you have some labeled BBB, and some labeled BCA, and some labeled BBA, and whatever, but if you find one triangle that is fully labeled ABC, I bet if you kept looking, in fact I know you are guaranteed, to find another triangle that’s labeled ABC. Sperner’s lemma says on the surface of a sphere that if there’s one fully labeled triangle, there’s guaranteed to be at least another.

EL: Interesting! I don’t think I knew that, or at least I don’t know that formulation of Sperner’s lemma.

JT: And the reason I said it that way, I can now actually describe to you why that is true because doing it on the surface of a sphere is a bit easier than doing it on a plane. Would you like to hear my little proof?

KK: Let’s hear it.

EL: Sure!

JT: Of course the answer to that has to be yes, I know. So imagine that these are really chambers. Each triangle is a room in a floor design on the surface of a sphere. So you’re in a room, an ABC room around you. You’ve got three walls around you: an AB wall, a BC wall, and an AC wall. Great. I’m going to imagine that some of these walls are actually doors. I’m going to say that any wall that has an AB label on it is actually a door you can walk through. So you’re in an ABC room, and you currently have one door you can walk through. So walk through it! That will take you to another triangle room. This triangle room has at least one AB edge on it, because you just walked through it, and that third vertex will have to be an A, B, or C. If it’s a C, you’re kind of stuck because there are no other AB doors to walk through, in which case you just found another ABC room. Woo-hoo, done!

EL: Right.

JT: If it’s either A or B, then it gives you a second AB door to walk through, so walk through it. In fact, just keep walking through every AB door you come to. Either you’ll get stuck, and in fact the only place you can possibly get stuck is if there’s exactly one AB door, in which case it was an ABC triangle, and you found an ABC triangle. Or it has another door to walk through, and you keep going. Since there’s only a finite number of triangles, you can’t keep going on indefinitely. You must eventually get stuck. You must get stuck in an ABC room. So if you start in one ABC room, you’ll be sure to be led to another.

EL: Oh, okay, and you can’t go back into the room you started in.

KK: That was my question, yeah.

JT: Could you possibly return to a room you’ve previously visited? Yes, there’s a subtlety there. Let’s argue our way through that. So think about the first room that you could possibly—if you do revisit a room, think of the first room you re-enter. That means you must have gone through an AB door to get in. In fact, if you’ve gone through that room before, you must have already previously used that AB door to go into and out of it. That is, you’ve used that AB door twice already. That is, the room you just came from was a previously revisited room. You argue, oh, if I think this is the first room I’ve visited twice, then the room you just came from, you’re wrong. It was actually that room that you first visited twice. Oh, no, actually it was the one before that that you first visited twice. There can be no first room that you first visited twice. And the only way out of that paradox is there can be no room that you visit twice.

EL: Okay.

JT: That’s the mind-bendy part right there.

EL: I feel like I need a balloon right now and a bunch of markers.

JT: You know, it’s actually fun to do it, it really is. But balloons are awkward. In fact, the usual way that Sperner’s lemma is presented, I’ll even not do it in the usual way. Sperner did it on a triangle. I’ll do it on any polygon. This time, this we can actually do with markers, and it’s really fun to actually do it. So draw a great big polygon on a page and then triangulate it. Fill its interior with dots and then fill in edges so you’ve got all these triangles filling up the polygon. And then randomly label the dots A, B, or C in a random, haphazard way. Make sure that you have an odd number of AB doors on the outside edge of that polygon. If you do that, no matter what you do, you cannot escape creating somewhere on the interior a fully labeled ABC triangle. The reason is, you just do this thing. Walk from the outside of the polygon through an AB door, an outside AB door, go along on a journey. If you get stuck, bingo! You’re on an ABC triangle. Or you might be led out another AB door back to the big space again. But if you have an odd number of AB doors on the outside, you’re guaranteed to have at least one of those doors not leading outside, meaning you’ve been stuck on the inside. It’s guaranteed to lead to an ABC triangle in the middle of the polygon.

EL: Okay, and this does require that you use all three—is it a requirement that you use all three letters, or does the odd number of things…I don’t know if my question makes sense yet.

JT: There’s no rules on what you except on the outside, please give me an odd number of AB doors.

EL: Okay.

JT: And there’s nothing special about the letters A and B. You could do an odd number of BC doors or an odd number of AC doors.

EL: Right.

JT: What you do on the interior is up to you. Label them all A, I dare you, and you’ll still find an ABC triangle.

EL: Okay.

JT: Isn’t that crazy?

KK: Okay, so why did Sperner care?

JT: Why did Sperner care? Well he was just playing around with this geometry, but then people realized, as one of your previous guests mentioned, the fabulous Francis Su, that this leads to some topological results, for example, the Brouwer fixed-point theorem, which people care about, and you should listen to his podcast because he explains the Brouwer fixed-point theorem beautifully.

EL: Yes, and he did actually mention to us in emails and stuff that he is actually quite fond of Sperner’s lemma also, so I’m sure he’ll be happy to listen to this episode.

JT: In some cases, Sperner’s lemma is kind of special because people knew Brouwer’s fixed-point theorem before Sperner, but they had very abstract nonconstructive proofs of the theorem. Fixed points, when you crumple pieces of paper and throw them on top of themselves, fixed points exist, but you can know that and not know to find them. Sperner’s lemma, if you think about it, is giving you a way to possibly find those ABC triangles. Just start on the outside and follow paths in. So it gives you a kind of hope of finding where those fixed points might actually lie, so it’s a very sort of constructive type of thinking on this topological result that is proved abstractly.

One thing that Francis Su did not mention is the hairy ball theorem, which I think is a lovely little application of Sperner’s lemma, which goes back to the spheres. Spheres—in my mind, this is how I was first thinking about Sperner’s lemma. So I don’t know if you know the hairy ball theorem. If you take a tennis ball with the little fur, the little hairs at, ideally, every point of the sphere, but that’s not really possible. But we can imagine in our mind’s eye a hairy ball. If you try to comb those hairs flat, tangent to the surface all the way around—well, maybe there would be a little angle, something like that. But as long as you don’t do anything crazy, you know, it’s a nice, smooth, continuous vector field on the surface of the sphere, just these hairs, close hairs go towards the same direction, very smoothly, nothing abrupt going on, then you are forced to have a cowlick, that is, one hair that sticks straight up. That is, you are forced to have a tangent vector that is actually the zero vector. You can actually prove that with Sperner’s lemma.

EL: Wow.

JT: Yeah, and the way you do that is: choose one point, like the North Pole, and imagine a little magnet there, and you can imagine all the magnetic fields make these two circular, the magnetic field of a dipole, sorry, I have to think back to my physics days. So you’ve got these natural lines associated with that magnet all over the sphere, so I suggest just triangulate the sphere. Just draw lots of little triangles all over it. And then at each vertex of the triangle, you’ve got this vector field, and you’ve got these hairs all over the vector field. At any point on the triangle, look at the direction the hair is pointing compared to the direction of the magnetic field. And you can label that either A, B, or C by doing the following. Basically you’ve got 360 degrees of possible differences of directions between those things. So if it’s in one of the first 0-120 degrees of counterclockwise motion, label it A. If it’s between the 120 and 240 mark, label it B. If it’s between the 240 to 360 mark, label it C. There is a way to label that triangulation based on the direction of the hairs on the surface of the sphere. Bingo! So we’ve just now proved that in any triangulation, you can argue that you arrange things at the pole as an ABC triangle, there’s this little thing you can arrange, then there has to be some other ABC triangle somewhere on the sphere. That is, there’s a little small region where you’ve got three hairs trying to point in three different directions. And do finer and finer triangulations. You actually argue the only way out of that predicament is there’s got to be one hair that’s pointing three directions at the same time, that is, the zero vector.

KK: That’s very cool.

EL: Yeah.

JT: I just love these. These things feel so tangible. I just want to play with them with my hands and make it happen. And you can to some degree. Try to comb a fuzzy ball. You have a hard time. Or look at a guinea pig. They’re basically fuzzy balls, and they always have a cowlick. Always.

KK: Are there higher-dimensional generalizations of this? This feels very much two-dimensional, but I feel there’s an Euler characteristic lurking there somewhere.

JT: Absolutely you can do this in higher dimensions. This works in any dimension. For example, to make this three-dimensional, stack all these tetrahedra together. Take a polyhedron, triangulate it. If there’s an odd number of ABC faces on the outside, then there’s guaranteed to be some ABCD tetrahedron in the middle. And higher dimensions. And people of course play with all sorts of variations. For example, I’ll go back to two dimensions for a moment, back to triangles. If three different people create their own labeling scheme, so you’ve got lots of ABC triangles around the place, then there’s guaranteed to be one triangle in the middle, so if you chose one person’s label for the vertex, the second person’s for the second vertex, the third person’s label for the third vertex, according to their labels, which are all different, that’s an ABC triangle in this sort of mixed labeling scheme. So they call these permutation results of Sperner’s lemma and so forth. Just mind-bendy, and in higher dimensions.

EL: So was this a love at first sight kind of theorem for you? What were your early experiences with it?

JT: So when did I first encounter it? I guess when I studied the Brouwer fixed-point theorem, and when I saw this lemma in and of itself—and I saw it in the light of proving Brouwer’s fixed-point theorem—it just appealed to me. It felt hands-on, which I kind of love. It felt immediately accessible. I could do it and experience it and play with it. And it seemed quirky. I liked the quirky. For some reason it just appealed to me, so yes, it appealed to all my sensibilities. And I also have this thing I’ve discovered about me and my life, which is that I like this notion that I’m nothing in the universe, that the universe has these dictates. For example, if there’s one ABC triangle, there’s got to be another one. I mean, that’s a fact. It’s a universal fact that despite my humanness I can do nothing about it. ABC triangles just exist. And things like the “rope around the earth” puzzle: if you take a rope and wrap it around the Equator, add 10 feet around the rope and re-wrap, you’ve got 19 inches of space. What I love about that puzzle, if you do it on Mars 10 feet from its Equator, it’s 19 inches of space. Do it for Jupiter: it’s 19 inches of space. Do it for a planet the size of a pea: it’s 19 inches of space. You cannot escape 19 inches. That sort of thing appeals to me. What can I say?

KK: So you are a physicist?

JT: Don’t tell anyone. My first degree was actually in theoretical physics.

KK: So the other fun thing we do on this podcast is we ask our guest to pair their theorem, or lemma in this case, with something. So what have you chosen to pair Sperner’s lemma with?

JT: You know, I’m going with a good old Aussie pavlova.

EL: Excellent.

JT: And I’ve probably offended all the people from New Zealand because they claim it’s their pavlova. But Australians say it’s theirs, and I’ll go with that since I’m an Aussie. And why that, you might ask?

EL: Well first can we say what a pavlova is in case, so I only learned what this was a couple years ago, so I’m just assuming—I was one of the lucky people who learned about this in making one, which was delicious, so yeah.

JT: First of all, it’s the most delectable dessert devised my mankind, or invented, or discovered. I’m not sure if desserts are invented or discovered. That’s a good question there. So it’s a great big mount of meringue, you just build this huge blob of meringue, and you bake it for two hours and let it sit in the oven overnight so it becomes this hard, hard outer shell with a soft, gooey meringue center, and you just slather it with whipped cream and your favorite fresh fruits. And my favorite fruits for a pavlova are actually mango and blueberries together. That’s my dessert. But you know, well maybe to think of it, there are actually two reasons. I happen to know it was invented in the 1920s, the same time Sperner came up with this lemma, which is kind of nice. But any time I bake one—I bake these things, I really enjoy baking desserts—it kind of reminds me of a triangulated sphere because you’ve got this mound of meringue, and you bring it out of the oven, and it’s got this crust that’s all cracked up, and it kind of looks like a triangulation of a polyhedron of some kind. So it has that parallel I really like. So pavlovas bring as much joy to my life as these quirky Sperner’s lemma type results, so that’s my pairing.

EL: So they’re not, so I went to this Australia-themed potluck party a couple years ago, and I decided to bring this because I was looking for Australian foods, so I got this. I was pretty intimidated when I saw the pictures, but it’s actually, at least I found a recipe and it looked good, and it worked the first time, more or less. I think you can handle it.

JT: It is a showstopper, but it’s so easy to make. Don’t tell anyone, it’s ridiculously easy, and it looks spectacular.

KK: Yeah, meringues look like something, but really, you just have to be patient to whip the whites into something, and then that’s it. It works.

JT: Then you’re done. It kind of works. You can’t overcook it. You can undercook it, but then it’s just a goopy delicious mess.

KK: Right. So we also like to give our guests a chance to plug various things. I’m sure you’re excited to talk about the Global Math Project.

JT: Of course I’m going to talk about the Global Math Project. Oh my goodness. You know, when I mention I’m kind of a man on a mission to bring joyous, uplifting mathematics to the world, I’m kind of trying to live up to those words, which is kind of scary. But let me just say something marvelous, really marvelous and humbling, happened last October. We brought a particular piece of mathematics to the world, a team of seven of us, the Global Math Project team, not knowing what was going to happen. It was all volunteer, grassroots, next to no funding, we’re terrible at raising funding, it turns out. But it really was believing that teachers, given the opportunity to have a real joyous, genuine, human conversation about mathematics with their students, that’s actually classroom-relevant mathematics. Classroom mathematics is a portal to the same mystery, delight, intrigue, and wonder, they will. Teachers are our best advocates across the globe for espousing beautiful, joyous, uplifting mathematics. So we presented a piece of mathematics called Exploding Dots, and we invited teachers all around the globe to do that, to have just some experience on this topic with their students during Global Math Week last October, and they did. We had teachers from 170 different countries and territories, all of their own accord, reach out to about 1.77 million students just in this one week. Phenomenal. And this is school-relevant mathematics. So we’re doing it again! Why not?

EL: Oh, great!

JT: So this year, 10/10, we chose that date because it’s a universal date. No matter how you read it, it’s the tenth of October. We’re going to go up to 10 million students with the same story of Exploding Dots. So I invite you, please look up Global Math Project, go Google Exploding Dots. See what we’re bringing to the world. And on its own accord, in the last number of months, we’ve now reached 4.6 million students across the globe, so 10 million students sounds outlandish, but you know what? We might actually do this. And it’s just letting the mathematics, the true, joyous mathematics, simply shine for itself, just get out of its way. And you know what? It happens. Math can speak for itself. Welcome to Global Math Project.

EL: Yeah. We’ll include that in the show notes, for sure.

KK: In fact, this is June that we’re taping this, recording this. Taping? I’m dating myself. We’re recording this in June. So just this weekend Jim Propp had a very nice essay on his Mathematical Enchantments blog about this, about Exploding Dots. I’d seen some things about it, so I knew a little about it. It’s really very lovely, and as you say relevant.

JT: I’m glad you mentioned Jim Propp. I was about to give a shout out to him as well because he wrote a beautiful piece, and it’s this Mathematical Enchantments blog piece for June 2018. Worth having a look at. Absolutely. What I love about this, it really shows, I mean, Exploding Dots is the story of place value, as simple as that. But it really connects to how you write numbers, what you’re experiencing in the early grades. It explains, if you think of it in one particular way, all the grade school algorithms one learns, goes through all of high school polynomial algebra, which is just a repeat of grade five, but no one tends to tell people that. Why stop at finite things? Go to infinite things, go to infinite series and so forth, and start getting quirky. Not just playing with 10-1 machines with base 10 and 2-1 machines with base 2, start playing with 3-2 machines and discover base 1 1/2, start playing with 2-negative 1 machines and discover base -2, and you get to unsolved research questions. So here’s this one simple little story, just playing with dots in boxes, literally—like me playing with dots on a sphere; I seem to be obsessed with dots in my life—takes you on a journey from K through 5 through 8 through 12 to 16, and on, all in one astounding fell swoop. This is mathematics for you. Think deeply about elementary ideas, and well, it’s a portal to a universe of wonder.

KK: That’s why we’re all here, right?

JT: Indeed. So let’s help the world see that together, from the young’uns all the way up.

KK: All right. Well, this has been great fun. I knew Sperner’s lemma, sort of in the abstract, but I never really thought of it too closely. So I’m glad that I can now prove it, so thank you for that.

EL: Yeah, I’m going to sit down and make sure you’re not pulling my leg about that. I think the odd number of AB’s is key here.

JT: Absolutely. The odd number of AB outside edges is key.

EL: Right.

JT: Because you could walk through the door and out a door, so pairs of them could cancel each other out. So play with them.

EL: I bet if I start drawing, I’ve been restraining myself from going over here to the side.

JT: Well you know, sketches work so well on a podcast.

KK: That’s right.

JT: Absolutely, play. That’s all mathematics should be, an invitation to play. Go for it.

EL: Yeah, thanks a lot for being here.

JT: My pleasure. Thank you so much.

[outro]

Episode 26 - Erika Camacho

Evelyn Lamb: Hello and welcome to My Favorite Theorem, a podcast where we ask mathematicians to tell us about their favorite theorems. I’m your host Evelyn Lamb. I’m a freelance math and science writer in Salt Lake City, Utah. This is your other host.

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

EL: Great. I’m excited about a new project I’m working on that is appropriate to plug at the beginning of this, so I will. So I’ve been working on another podcast that will be coming out in the fall, may already be out by the time this episode is out. It’s with the folks at Lathisms, that’s L-A-T-H-I-S-M-S, which is a project to increase visibility and recognition of Hispanic and Latinx mathematicians. And our guest today is going to be a guest on that podcast too, so I’m very excited to introduce our guest, who is Erika Camacho. Hi, Erika. Can you tell us a little bit about yourself?

Erika Camacho. Sure. So I’m an associate professor at Arizona State University. My concentration is, well I’m a professor of applied mathematics, and my concentration is mathematical physiology, mainly focusing in the retina and modeling the retina and the deterioration of photoreceptors. And I’m in the west campus of Arizona State University, which is mainly focusing, it’s both a research and student focused institution, so it’s kind of like a hybrid between what you would call more of a research place and also a liberal arts education.

EL: Cool.

KK: Very nice. Which city is that in?

EC: We’re in Glendale, the west valley of Arizona, Phoenix greater area.

EL: I was in Arizona not too long ago, and the time zone is always interesting there because it’s exactly south of Utah, but I was there after Utah and most of the country went to daylight saving time, and most of Arizona doesn’t observe that, so it was kind of fun. I also went through part of the Navajo Nation there that does observe daylight saving time, so I changed time zones multiple times just driving straight north, which was kind of a fun thing.

EC: It is very confusing. Let’s say you have an event that you’re going to, and you’re driving to one where it’s say in some of the Navajo Nation, and you don’t realize that you might miss some of your event because of the time change. You’re just driving and you’re crossing the border where it changes to a different time zone. It takes a while to get adjusted to. I missed a flight one time for the same reason. I was not aware that Arizona didn’t observe daylight saving. Now I’m aware.

KK: I actually have a theory that someone could run a presidential campaign, and their sole platform is that they would get rid of daylight saving time, and they would win in a landslide.

EL: I mean, people have won on less.

KK: Clearly.

EL: So Erika, we invited you here not to chat about time zones or presidents but to chat about theorems. So what is your favorite theorem?

EC: Before I say my favorite theorem, like I said, I am an applied mathematician. So I focus on modeling. And in modeling, there’s a lot of complexities, a lot of different layers and levels where you’re trying to model things. So many of the systems you’re trying to develop as you create this model tend to be nonlinear models. Many times I’m looking at how different processes change over time. So many of the processes I work with are continuous. So I work with differential equations, and they tend to be nonlinear. Sometimes that’s where the complexity comes in, trying to analyze nonlinear systems, and the most accurate way, the way that we’re going to get the most insight into some of the behavior we’re looking for in terms of physiological systems that relate to the retina and retinal degeneration, one of the things that we’re really looking at is what happens in the long run? How is it that photoreceptors degenerate over time, and can we do something to stop the progression of blindness or the progression of certain diseases that would cause the photoreceptors to degenerate? So we’re really asking what are the long-term solutions of the system, and how did they evolve over time? So we’re looking for steady states. We’re looking for what is their stability and what are the changes in the processes or the mechanisms that govern those systems, which usually are defined by the parameters that end up actually leading to a change in the stability of the equilibria? And they could take the system to another equilibrium that is stable now. So in physiological terms, to another pathological state, or another state that we could hopefully do a few strategies to prevent blindness. So that’s the setting of where I come from, and when you asked me this question, what is my favorite theorem, it was hard because as applied mathematicians we utilize different theory. And all the theory is useful, and depending on what the question is, then the mathematics that are utilized are very different.

So I thought, “What is the theorem that is utilized the most in the case where we’re looking at nonlinear systems and we’re trying to analyze them? And one of the most powerful theorems out there, which is one that has almost become addicting, that you use it all the time, is the Hartman-Grobman theorem. I say addicting because it’s a very powerful theorem. It allows us to take a nonlinear system and in certain cases be able to analyze it and be able to get an accurate depiction of what’s happening around the equilibrium point, what is the qualitative behavior of the system, what are the solutions of the system, and what is their stability. Because you’re looking at, in most cases, a continuous system, you can map it and be able to kind of piece it together.

EL: So it’s been a long time since I took any differential equations. I’m a little embarrassed, or did any differential equations.

KK: Me too.

EL: So can you tell us a little more about the setting of this theorem?

EC: So the Hartman theorem, like I said, is a theorem that allows us to study dynamical systems in continuous time. It’s very powerful because it gives us an accurate portrayal of the flow, solutions of the nonlinear system in a neighborhood around a fixed point, the equilibrium, the steady state. So I’m going to be using fixed point, equilibrium, and steady state interchangeably. In some cases, and in the cases where it does help, is in the cases where the equilibrium that we’re looking at, the eigenvalues of the linearized system, or the nonlinear system that we’re looking at, actually has nonzero real part. In other words, we’re looking at hyperbolic equilibrium points. That’s when we could actually apply this system.

KK: Okay.

EC: This theorem, otherwise we cannot. That is, for certain cases? The standard technique is you look at your nonlinear system, you linearize it through a process, and you’re able to then shift your equilibrium point to the origin, and now you’re considering the linearized system, and that system, the Jacobian you obtain through the linearization has eigenvalues that have nonzero real part. Then you’re able to apply the Hartman theorem, which tells you that there is this homomorphism from the nonlinear system, the flow and the solutions of the nonlinear system, locally, to the actual linear system. And now everything that you get that you would normally be able to see analyzed in a linear system locally, you’re able to do it for the nonlinear system. So that’s where the powerful thing comes in. Like I said, the gist of it is that the solutions of the nonlinear system can actually be approximated by a linear system, but only in a neighborhood of the equilibrium point. And this is only in the case where we have hyperbolic equilibrium fixed points. But that is very powerful because that allows us to really get a handle on what’s going on locally in a neighborhood of the steady state. For us, we’re looking at, say, how certain diseases progress in the long run, where are we heading? Where is the patient heading, in terms of blindness? And it really allows us to be able to move in that direction in terms of understanding what is going on. And like I said, it’s powerful not just because it’s telling us about the stability, but it’s actually telling us the qualitative structure of the solution and the behavior, right, of your solutions, locally are the same in the linear case and the nonlinear case because of this topological equivalence.

KK: That’s pretty remarkable. But I guess the neighborhood might be pretty small, right?

EC: Right. The neighborhood is small.

KK: Sure.

EC: In nonlinear systems, you have plenty of different equilibrium points around those neighborhoods, right, but again remember that your solutions in the phase space are changing continuously, so you are able to kind of piece together what is going on, more or less, but for sure you know what’s going on in the long term behavior, you know what’s going on around that neighborhood, and for given initial conditions, which is really key in math applications because sometimes we’re asking what happens for different initial conditions. What are the steady states? What do the solutions look like in the long run? What do things look like, what is going on for different initial conditions?

KK: So if you’re modeling the retina, how many equations are we talking? How big are these systems?

EC: Well, that’s the thing. In the very most simplified case, where you’re able to divide the photoreceptors into the rods and cones, then you have two populations.

KK: Okay.

EC: And in one of the cases we’re looking at the flow of nutrients, so we are also considering the retinal pigment epithelium cells, which is another population, so you have three equations in that case. So that’s a more simplistic situation, but it’s a situation where we have been able to really get a sense of what’s going on in terms of degeneration in these two classes of photoreceptors that undergo a mutation. So one of the diseases I work on is retinitis pigmentosa, and the reason why that is a very complicated case that we haven’t been able to really get a handle on and be able to come up with better therapies and better ways of stopping degeneration of the photoreceptors—in fact there is no cure for stopping photoreceptors from degenerating—is because the mutation happens in the rods. The rods are the ones that are ill. Yet the cones die, which are perfectly healthy. And trying to understand how is it that the rods actually are communicating with the cones that ends up also killing them is an important part, and with a very simplistic model for an undiseased case, we were able to actually, before biologically this link was discovered, that in fact the photoreceptors produced this protein that is called the rod-derived cone viability factor, that helps the cone survive, and we were able to show that mathematically just by analyzing the equilibria and being able to look at different things in the long run, and the invariant spaces, and being able to show what we know just by basic biology of what happened to the rods and the cones and then realized that the communication had to be a one-way interaction from the rods to the cones. So that’s one of the models that we have. And then once we had that handled, we were able to introduce the disease and look at a four-dimensional system.

Now we’re looking internally at the metabolic process inside the cones because there’s a metabolic process. So the rods produce this protein. How is that protein taken by the rods, and what does it do once it’s inside the rods? For that we really need to look inside the metabolic process and the kinetics of the cones and also the rods. There, if you’re just considering the cones, you’re looking at 11-12 differential equations.

KK: Wow.

EL: Wow.

EC: With many parameters. So at that point we’re going to a much higher dimension. And that’s where we currently are. But that has given us a lot of insight, not just in how the rods help the cones but how is it that other processes are being influenced, getting affected? And again, where the Hartman-Grobman theorem applies is to autonomous systems, where time is not explicit in the equations.

EL: Okay.

KK: This is fascinating.

EL: Math gets this kind of rap for being really hard, but then you think, like, math is so much simpler than this biological system. Your rods being sick make your cones die!

EC: But I think the mathematics is essential. There’s a big cost in taking certain experiments to the lab, just to be able to understand what is going on. There’s a cost, there’s a time dependence, and math bypasses that. So once you have a mathematical model that is able to predict things. That’s why you start with things that are already known. Many times the first set of models that I create are models that show what we already know. They’re not giving any new insight. It’s just to show that the foundation is ready and we can build on it, now we can introduce some new things and be able to ask questions about things we don’t know. Because once we are able to do that, really it’s able to guide us to places, or at least indicate what kinds of lab studies and experiments should be run and what kinds of things should be focused on. And that’s one of the things we do. For example, one of the collaborators I work with is the Vision Institute of Paris, so the institute and the director there, and the director of genetics as well. And we have this collaboration where I think working together has really helped guide their experiments and their understanding of where they should be looking, just as they helped me really understand what are the types of systems we need to consider and what are the things that we can neglect, that we don’t have to really focus on? And I think that’s the thing, mathematics is really powerful to have in biological system, I think.

EL: Yeah.

EC: And my favorite theorem can be used to gain insight into photoreceptor degeneration in very complicated systems. Another thing that’s interesting about the Hartman-Grobman theorem is that one of the things that is really powerful is that you don’t have to find a solution, a solution to the nonlinear system, to get an understanding of what’s going on and get an insight into the qualitative behavior of those solutions. And I think that is really powerful. Do you have any questions?

EL: So, I mean, a lot. But something I always think is interesting about applied mathematicians is that often they end up working in really different application areas. So did you start out looking at retinas and that kind of biological system, or did you start out somewhere else in applied math and gradually move your way over there?

EC: So when I started in applied math, what I really liked was dynamical systems. Yes, the first project I worked on as a graduate student was actually looking at the cornea and how different light intensities affect the developing cornea. And for that I really had to learn about the physiology of the eye and the physiology of the retina. But then I did that for graduate school, and initially once I went out of graduate school, in my postdoc I was working on how different fanatic groups get formed.

EL: Oh wow, really different application.

EC: Which was in Los Alamos. I was looking at what are the sources of power that allow groups that can become terrorists, for example, to really become strong. What are the competing forces? So it was more a sociological application, but again using dynamical systems to try to understand it. Later on I moved on to a more general area of math biology, looking at other different systems and diseases, but then I went back through an undergraduate project in an REU. Usually the way I work with undergraduates is I make them be the ones that ask the question, that select the application. And I tell them, you have to go learn all about it because you have to come and teach me. And then from there I’m going to help you formulate the questions that can be put into a mathematical equation and that can be modeled somehow. And they were very interested, they wanted to do something with a PDE. And they thought, well, something with the retina. And they thought that retinitis pigmentosa would be perfect for modeling with a PDE and being able to analyze it that way. And then as I learned more about the disease, the interesting thing is that when the cones begin to die, like the rods are the ones that are sick, but when the cones begin to die, there is no spatial dependence anymore. They don’t die in a way that you can see this spatial dependence. It’s really more random, and it’s more dependent on the fact that there is this lack of protein that is not being synthesized by the rods anymore. Many times what happens is there is this first wave of death of photoreceptors where the rods die, and when most of then die, when 90 percent of them are gone, then the cones begin to die. And then there are all these other things about, yes, you can think about wakes and the velocity of them, but there is not this spatial dependence. Initially it is, but that’s when only the rods are dying. But when we are really interested in asking the questions about why the cones die, there’s not that case anymore.

KK: It’s sort of a uniformly distributed death pattern, as it were? What I love about this is, you know, here’s a problem that basically a second-year calculus student can understand in some sense. You have two populations. We teach them this all the time. You have two populations, and they’re interacting in some way. What’s the long-term behavior? But there are still so many sophisticated questions you can ask and complicated systems there. Yeah, I can see why your undergrads were interested in this, because they understood it immediately, at least that it could be applied. And then they brought this to you, and now you’re hopefully going to cure RP, right?

EC: Right, well another thing is that you can understand, and you can use math that is not very high-level to start to get your hands dirty. And for example, now that we’re looking at this multi-level layer where you’re looking at the molecular level and also at the cellular level, then you’re really asking about multi-scale questions and how can we better analyze the system when we have multiple scales, right? And then there are sometimes questions about delay. So the more focused and the more detailed the model becomes, the more difficult the mathematics becomes.

KK: Sure.

EC: And then there are also questions, for example, without the mathematics, there’s a lot of interesting mathematics going on, I’m sorry, I mean without the biology, that you could analyze with mathematics. We did a project like that with a collaborator where the parameter space was not really relevant biologically, but the mathematics was very interesting. We had all this different behavior. We had not just equilibrium points, but we had periodic solutions, torus, we had all of this, and what is going on? And a lot of this happened in a very small region, and it just became more of a mathematical kind of analysis rather than just a biological one.

EL: Yeah, very cool. So another part of this program is that we like to ask our guest to pair their theorem with something, you know, food, beverage, music art, anything like that. So have you chosen a pairing for the Hartman-Grobman theorem?

EC: I thought about it a lot, because like I said it’s such a powerful theorem, and I go back to the idea of it’s addicting. I think anyone who’s worked in dynamical systems in the nonlinear case in a continuous timeframe definitely utilizes this theorem. It comes to a point where we are doing it automatically. So I thought, what is something that I consider very addicting, yet it looks very simple, right? It’s elegant but simple. But once you have it, it’s addicting. And I could not think of anything else but the Tennessee whiskey cake. Have you ever had it?

KK: No.

EL: No, but it sounds dangerous.

EC: It is delicious. It’s funny, I don’t like whiskey, and I had it when I went to San Antonio to give a talk one time. I was like, well, okay, everyone wanted it, so I decided to go with it. I usually pick chocolate because that is my favorite.

EL: Yeah, that’s my go-to.

EC: I love chocolate. So I said, well, let me try it. It was the most delicious thing. Now I want to be able to bake it, make it. I had a piece, and I want more.

KK: So describe this cake a little bit. Obviously I get that it has bourbon in it.

EC: The way it’s served is it’s served warm, and it has vanilla ice cream. It has nuts, and it has this kind of butterscotch or sometimes chocolate sauce over it. And it’s very moist. It has those different layers. I also think, right, in terms of complexity, it has these different layers. In order to get a sense of the power of it, you have to kind of go through all the layers and have all of them in the same bite. And I feel like that with the Hartman theorem, right, that the power of it is really to apply it to something that has nonlinearity, that is really complex, and something that you know you might not be able to get a handle on the solutions analytically, but you still want to be able to say what is going on, what is the behavior, where are we heading? To somehow be able to infer what the solutions are through a different means, to be able to go around, and it gives you that kind of ability.

KK: And this is where whiskey helps.

EC: Well the whiskey’s the addicting part, right?

EL: So have you made this cake at all, or do you usually order it when you’re out?

EC: Usually I order it when I’m out. But I want to make it. So my mom’s birthday is coming up on August 3rd, and I’m going to try to make it. I was telling my husband, “We’re going to have to make it throughout the next few days because I’m pretty sure we’re going to go through a few trials.”

KK: Absolutely.

EC: I can never get it right.

EL: Even the mistakes will be rewarding, just like math.

KK: And again the whiskey helps.

EC: But that’s an interesting question. I thought, what can I pair it with? And the only thing I could think of was something that’s addicting or something that has multiple layers but that all of them have to be taken at once, that you’re allowed to look at all of them at once.

EL: This fits perfectly.

KK: Sounds great. Well I’ve learned a lot today. I’ve never thought about modeling the eye through populations of rods and cones, but now that you say it, I guess sure, of course. And now I have to look up Tennessee whiskey cake.

EL: Yeah, it’s really good. You should try it.

KK: I’m going to go do that.

EL: It’s almost lunch here, so you’re definitely making me hungry.

KK: Well thanks a lot for joining us.

EL: Thanks a lot for being here.

EC: Well thank you so much for having me here. I really enjoyed it.

Episode 25 - Holly Krieger

EL: Hello and welcome to My Favorite Theorem, a podcast where we ask mathematicians what their favorite theorem is. I’m your cohost Evelyn Lamb. I’m a freelance math and science writer in Salt Lake City, Utah. This is your other cohost.

KK: Hi, I’m Kevin Knudson, professor of mathematics at the University of Florida. How are you doing, Evelyn?

EL: I’m all right. How about you?

KK: Okay. So one of our former guests, who I won’t name, was giving a big lecture here at the colloquium series this week, so I got to meet that person in person.

EL: Oh, excellent.

KK: So I might even have a better picture for the webpage, for the post to say, hey, our hosts and guests can actually be in the same place at the same time.

EL: Yeah, that would be exciting. And one of these days, maybe you and I will meet in person, which I’m pretty sure we have not yet.

KK: Maybe. I know we haven’t. I keep threatening to come to Salt Lake City, but I don’t think Salt Lake can handle me. I have actually been there once. Wonderful town. It’s a great city.

EL: I like it. So today we are very glad to have Holly Krieger on the show. So Holly, would you like to tell us a little bit about yourself?

HK: Sure, I’d be happy to. Thanks for having me, first of all. So I am a lecturer at the University of Cambridge. I’m also a fellow at one of the constituent colleges of Cambridge, Murray Edwards College, and the kind of math I’m most interested in is complex dynamics and number theory. So I do a lot of studying of the Mandelbrot set and the arithmetic properties of these kinds of things and related questions.

EL: And I see you and I have the same poster of the Mandelbrot set. Mine is not actually hanging up yet. You have been better at getting the full experience by hanging it up, but I see that poster behind you.

HK: That’s right, the Mandelmap. It’s amazing, this poster. I just found it on Kickstarter, and then I sent it to a bunch of mathematician friends, and so occasionally I will go to someone to visit someone mathematically, and they have the same poster in their office. It’s very satisfying.

EL: Well, we have invited you here to ask you what your favorite theorem is. So what’s your favorite theorem?

HK: So here’s the thing: I shouldn’t be on this podcast because I don’t have a favorite theorem.

KK: No, no, no.

HK: I don’t have a favorite theorem, it’s true. Somehow I’m too much of a commitment-phobe, like I have a new favorite theorem every week or something like that. I can tell you this week’s favorite theorem.

EL: That’s good enough.

KK: That’s fine. Ours have probably changed too. Evelyn and I in Episode 0 stated our favorite theorems, and I’m pretty sure Evelyn might have changed her mind by now.

EL: Yeah, well, one of our other guests, Jeanne Clelland, made a pretty good case for the Gauss-Bonnet theorem.

KK: She really did.

EL: I think my allegiance has shifted.

HK: Maybe you can do a podcast retrospective, every 20 episodes or something, what are the hosts’ favorite theorems today?

KK: That’s a good idea, actually. Good.

HK: So, my favorite theorem for this week. I love this theorem because it is both mathematically sort of really heavy-hitting and also because it has this sort of delicious anti-establishment backstory to it. My favorite theorem this week is Brouwer’s fixed-point theorem.

KK: Nice.

HK: Maybe I should talk about it mathematically first, maybe the statement?

EL: Yeah.

HK: Okay. So I think the easiest way to state this is the way Brouwer would have thought about it, which is if you take a closed ball in Euclidean space, so you can think about an interval in the real line, that’s a closed ball in the one-dimensional Euclidean space, or you can think about a disc in two-dimensional space, or what we normally think of as a ball in three-dimensional space, and higher you don’t think about it because our brains don’t work that way. So if you take a closed ball in Euclidean space, and you take a continuous function from that closed ball to itself, that continuous function has to have a fixed point. In other words, a point that’s taken to itself by the function.

So that’s the statement of the theorem. Even just avoiding the word continuous, you can still state this theorem, which is that if you take a closed ball and morph it around and stretch it out and do crazy things to it, as long as you’re not tearing it apart, you’ll have a fixed point of your function.

KK: Or if you stir a cup of coffee, right?

HK: That’s right, so there’s this anecdote that what Brouwer was thinking about—I have no idea if this is accurate.

KK: Apocryphal stories are the best.

HK: Reading about him biographically, I almost feel like coffee would be too exciting for Brouwer. So I’m not actually sure about the accuracy of this story. So the story goes that he was stirring his coffee, and he noticed that there seemed to be a point at every point in time, a point where the coffee wasn’t moving despite the fact that he was stirring this thing. So that actually leads to one of the reasons I like this in terms of real-world applications. It’s a good—well, depending on who you hang out with, it’s a good—cocktail party theorem because if you’re making yourself a cocktail and you throw all the ingredients into your shaker and you start stirring them up, well, when you’re done stirring it, as long as you haven’t done anything crazy like disconnected the liquid inside of the shaker, then you’ve got to have some point in the liquid that’s returned to its original spot. And I think that’s a fun version of the coffee anecdote.

EL: But the cocktail would definitely be too exciting for Brouwer.

VN: I would be really surprised. He was a vegetarian, not that you can’t be a fun vegetarian. He was a vegetarian, and he was sort of a health nut in general, and that was back in a time—he proved this theorem in the early 1900s—back in a time when I don’t think that behavior was quite so common.

KK: It was more, like, on a commune. You’d go to some weird, well I shouldn’t say weird, you’d go to some rural place and hang out with other like-minded people.

HK: That’s right.

KK: And live this healthful lifestyle. You would eschew meat and sugar and all that stuff.

HK: Right, exactly. So the other way I like to describe this in terms of the real world, and I think this is a common way Brouwer himself actually described this, is that if you take a map, so take a map of somewhere that’s rectangularly shaped. You can either think the map itself is a rectangle, so whatever it pictures is a rectangle, or you can think of Colorado or something like that. If you take a map, and you’re in the place that’s indicated by the map, then there’s somewhere on the map that is precisely in the same point on the map as it is in the place. Namely, where you are. But you can get more specific than that. So those are two sort of nice ways to visualize this theorem.

One of the reasons I like it is that it basically touches every subfield of mathematics. It has implications for differential equations and almost any sort of applied mathematics that you might be interested in. Things like existence of equilibrium states and that kind of thing over to its generalizations, which touch on number theory and dynamical systems and these kinds of things through Lefschetz fixed-point theorem and trace formula and that kind of thing. So mathematically speaking, it’s sort of the precursor to the entire study of fixed-point theorems, which is maybe an underappreciated spine running through all of mathematics.

KK: Since you’re interested in dynamics, I can see why you might really be interested in this theorem.

HK: Yeah, that’s right. It comes up particularly in almost any kind of study of dynamical systems, where you’re interested in iteration, this comes up.

EL: I like to ask our guests if this was a love at first sight theorem or if it’s grown on you over time.

HK: That’s a good question. It’s definitely grown. I think when you first meet this thing, I mean let’s think about it a little bit. In one dimension, how do you think about this theorem? You think, well, I’ve got a map from, say, the unit interval to itself, right, which is a continuous map. I can draw its graph. And this is the statement essentially that that graph has to intersect the line y=x between 0 and 1.

KK: So it’s a consequence of the Intermediate Value Theorem.

HK: That’s right. This is one of those deals where we always tell the calc students, “Tilt your head,” and they always look at us like we’re crazy, but then they all do it and it works. I find this appealing because it’s sort of an intersection theoretic way to think about it, which is sort of the generalizations that I’m interested in. But I think that you don’t realize the scope of this kind of perspective viewing this as intersection, and how that sort of leads you into algebraic geometry versions of this theorem. You don’t realize that at first. Same with, you don’t realize the applications to Banach spaces at first, and equilibrium states at first, so understanding the breadth of this theorem is not something that happens right away. The other thing is that really why I like this theorem is the backstory. Can I tell you about the backstory?

KK: Absolutely.

HK: So Brouwer, you can already tell I kind of don’t like him, right? So Brouwer was a Dutch mathematician, and he was essentially the founder of a school of mathematical philosophy known as intuitionism. What these people think, or perhaps thought—I don’t know who among us is one of them at this point—what these people think is that essentially mathematics is a result of the creator of mathematics, that there is no mathematics independent of the person who is creating the mathematics. So weird consequences of this are things like not believing in the law of the excluded middle. So they think a thing is only true if you can prove it and only not true if you can provide a counterexample. So something that is an open problem, for example, they consider to be a counterexample, or whatever you want to say, to the law of the excluded middle. So it’s in some sense a time-dependent mathematical philosophy. It’s not that everything is either true or not in the system, but true or not or not yet.

EL: That’s interesting. I don’t know very much about this part of math history. I’ve sort of heard of the fact that you don’t have to necessarily accept the law of the excluded middle, but I hadn’t heard people talk about this time-dependent aspect of it. I guess this is before we get into Cantor and Gödel, or more Gödel and Cohen’s, incompleteness theorems, which kind of seem like that would be a whole other wrench into things.

HK: That’s right. So this does predate Gödel, but it’s after Cantor. This was basically a knee-jerk reaction to Cantor. So the reason why I’m sort of anti-this philosophy is that I view Cantor as a true revolutionary in mathematics.

KK: Absolutely.

HK: Maybe I’ll have a chance to say a little bit about the connection between the Brouwer fixed-point theorem and some of what he did, but Cantor sat back, or took a step back and said, “Here’s what the size of a set is, and I’m going to convince you that the real line and the real plane, this two-dimensional space, have the same size.” And everyone was so deeply unhappy with this that they founded schools of thought like intuitionism, essentially, which sort of forced you to exclude an argument like Cantor’s from being logically valid. And so anyone who was opposed to Cantor, I have a knee-jerk reaction to, and the reason I find this theorem so delicious, sort of appealing, is because it’s not constructivist. Brouwer’s fixed-point theorem doesn’t hand you the fixed point, which is what Brouwer says you should have to do if you’re actually proving something. He really believed, I mean, he worked on it from his thesis to his death, essentially, while he was active, he really believed in this philosophy of mathematics that you cannot say there exists a thing but I can’t ever tell you what it is. He thought you really had to hand over the mathematical object in order to convince somebody. And yet one of his most famous results fails to do exactly that. And the reason why is that his thesis advisor was like, “Hey, no one is going to listen to you unless you do some actual mathematics. So he put aside the philosophy for a few years, proved some nice theorems in topology, in sort of the formalist approach, and went back to mathematical philosophy.

KK: I did not know any of this. This whole time-dependent mathematics, now I can’t stop thinking about Slaughterhouse-5, right, you’ve read Slaughterhouse-5? The Tralfamadorians would tell us, you know, that it’s already all there. It’s encased in amber. They can see it all, so they know what theorems we’re going to discover later.

HK: That’s right.

KK: So what’s your favorite proof of this theorem?

HK: So I think my favorite proof of this theorem is probably not Brouwer’s. It’s probably an algebraic topology proof, essentially.

KK: I thought you’d go with the iteration proof, but okay.

HK: No, I don’t think so because what it’s really about to me, it really is a topological statement about the nonexistence of retractions. So let’s just talk about the disc, let’s do the two-dimensional version. So if you had, so first of all, it’s a proof by contradiction, which already Brouwer is not on board with, but let’s do it anyways. So if you had a function which was a continuous map of the closed unit disc to itself which had no fixed point, then you could define a new function which maps the closed disc to its boundary, the circle, in the following way. If you have a point inside the disc, you look at where its image is. It’s somewhere else, right, because there are no fixed points. So you can draw the ray from its image through that point in the plane. That ray will hit the unit circle exactly once. That’s the value you assign the point in this new function. This will give you a new map, which maps the closed unit disc to its boundary, so this map is a retraction, which means it acts as the identity on the unit circle, and it maps the entire disc continuously onto the boundary circle. And such a thing can never exist.

KK: You’ve torn a hole in the disc.

HK: You’ve torn a hole in the disc. It’s really believable, I mean, rather than a rigorous proof, think about the interval. Take every point in the interval and assign it a value of either 0 or 1. You obviously have to tear it to do it. It’s totally clear in your head. with the disc, maybe it’s not quite so obvious. Usually the cleanest proof of the non-existence of a retraction like this goes through algebraic topology and understanding what the fundamental groups of these two objects are.

KK: That’s the proof I was thinking of, being a topologist.

HK: You thought maybe I’d be dynamical about it?

KK: Well, you could just pick a point and iterate, and since it’s a complete metric space, it converges to some point, and that thing has to be fixed. But that’s also not constructive, right?

HK: It’s also not constructive. But there are approximate construction versions.

KK: Right.

HK: One more thing I like about this theorem, in terms of its implications, is it’s one more tool Brouwer used in his theorem proving the topological invariance of dimension, that dimension is a well-defined notion under homeomorphisms. In particular, you don’t have a homeomorphism, just stretching, continuous in both directions, from, like, R^n to R, n-dimensional Euclidean real space to the real line. This doesn’t sound earth-shattering to us now. I think we kind of take it for granted. But at the time, this was not so long after Cantor was like, “Oh, but there is actually an injection, right, from n-dimensional Euclidean space to the real line.” So it’s not that it was surprising, but it was sort of reassuring, I think, that if you impose continuity this kind of terrible behavior can’t happen.

KK: Right. In other words, you need additional structure to get your sense that the plane is bigger than the line.

HK: That’s right. Although even taking into account continuity, topology is weird sometimes. There are space-filling curves, so in other words, there are surjective maps from the real line, (well, let’s just stick to intervals) from the unit interval to any-dimensional box that you want. And so somehow that’s really counterintuitive to most people. So it’s not so obvious that maybe what you think of as the reverse, an injection of a large space into a small space, maybe that would be problematic. But thanks to Brouwer’s fixed-point theorem, it’s not.

KK: So what pairs well with Brouwer’s fixed-point theorem?

HK: Well, okay, it has to be a cocktail, right, because I chose the cocktail example and because cocktails are fun. And they’re anti-Brouwer, presumably, as we discussed. So for the overlap of the cocktail description and the map description that I gave of Brouwer’s fixed-point theorem, I’m going to go with a Manhattan.

EL: Okay.

KK: Is that your favorite cocktail?

HK: It’s one of my favorites. Also Manhattan is almost convex.

KK: Almost.

HK: Almost convex.

KK: So you’re a whiskey drinker?

HK: I am a whiskey drinker.

KK: All right. I don’t drink too much brown liquor because if I drink too much of it I’ll start fights.

HK: Fortunately being sort of small as a human has prevented me from starting too many fights. I just don’t think I would win.

EL: So in my household I am married to a dynamicist, so I’m a dynamicist-in-law, but I’m more of a geometer, and we have this joke that there are certain chores that I’m better at, like loading the dishwasher because I’m good at geometry and what shapes look like. My spouse is good at dynamics, and he is indeed our mixologist. So do you feel like your dynamical systems background gives you a key insight into making cocktails? It certainly seems to work with him.

HK: Definitely for the first cocktail. Subsequent cocktails, I don’t know.

KK: Well I’m going to happy hour tonight. Maybe I’ll get a Manhattan.

HK: Maybe you should talk about Brouwer’s fixed-point theorem.

KK: With my wife? Not so much.

HK: Doesn’t go over that well?

KK: Well, she would listen and understand, but she’s an artist. Cocktails and math, I don’t know, not so much for her.

HK: I don’t know, that just makes me think of, okay, wow, I’m really going to nerd it out. Do you guys ever watch Battlestar Galactica?

EL: I haven’t. It’s on my list.

KK: When I was a kid I watched the original.

HK: The new one. All right. This is for listeners who are BSG nerds. So there’s this drawing of this vortexy universe, this painting of the vortexy universe that features in the later, crappier seasons. Now that makes me think it’s kind of an illustration of Brouwer’s fixed-point theorem. So maybe you should tell your wife to try and paint Brouwer’s fixed-point theorem for you.

KK: Okay.

HK: Marital advice from me. Don’t take it.

KK: We’ve been married for almost 26 years. I think we’re okay. We’re hanging in all right. So we always like to give our guests a chance to plug anything they’ve been working on. You’ve been in a bunch of Numberphile videos, right?

HK: Yeah, that’s right, and there will be more in the future, so if anyone hasn’t checked out Numberphile, it’s this amazing YouTube channel where maths is essentially explained to the public. Mathematicians come, and they talk about some interesting piece of mathematics in what is really meant to be an accessible way. I’ve been a guest on there a couple of times, and it’s definitely worth checking out.

EL: Yeah, they’re great. Holly’s videos are great on there. I like Numberphile in general, but I have personally used your videos about the Mandelbrot set, the dynamics of it and stuff, when I’ve written about it, and some other related dynamical systems. They’ve helped me figure out some of the finer points that as not-a-dynamicist maybe don’t come completely naturally to me.

HK: Oh, that’s awesome.

EL: I’ve included them in a few of the posts I’ve done, like my post about the Mandelbrot set.

HK: That’s amazing. That’s good because I’ve used your blog a few times when I’ve tried to figure out things that people might be interested to know about mathematics and things that are accessible to write and talk about to people. So it goes both directions.

EL: Cool.

KK: It’s a mutual lovefest here.

EL: People can also find you on Twitter. I don’t remember actually what your handle is.

HK: It’s just my name, @hollykrieger.

EL: Thanks a lot for being on the show. It was a pleasure.

HK: Thanks so much for having me. It was great to talk to you guys.

KK: Thanks, Holly.

Episode 24 - Vidit Nanda

Kevin Knudson: Welcome to My Favorite Theorem! I’m your host Kevin Knudson, professor of mathematics at the University of Florida. And this is your other host.

Evelyn Lamb: Hi. I’m Evelyn Lamb. I’m a freelance math and science writer in Salt Lake City. So how’s it going, Kevin?

KK: It’s okay. Classes are almost over. I’ve got grades for 600 students I still need to upload. But, you know, it’s an Excel nightmare, but once we get done with that, it’s okay. Then my son comes home for Christmas on Saturday.

EL: Oh great. I don’t miss grading. I miss some things about teaching, but I don’t miss grading.

KK: No.

EL: I don’t envy this time of the semester.

KK: Certainly not for a 600-student calculus class. But you know, I had a good time. It’s still fun. Anyway, today we are pleased to welcome Vidit Nanda. Vidit, why don’t you introduce yourself and tell everyone about you?

Vidit Nanda: Hello. My name is Vidit Nanda. I’m a research fellow at the University of Oxford and the amazing new Alan Turing Institute in London. This year I’m a member at the School of Mathematics at the Institute for Advanced Study in Princeton. I’m very happy to be here. Thank you both for doing this. This is a wonderful project, and I’m very happy to be a part of it today.

KK: Yeah, we’re having a good time.

EL: Can you tell us a little more about the Alan Turing Institute? I think I’ve heard a little bit about it, but I guess I didn’t even know it was that new. I thought I had just never heard of it before.

VN: Right. So about three years ago, and maybe longer because it takes time to set these things up, the UK decided they needed a national data science center, and what they did was they collected proposals from universities, and the ones who are now, well, the original five universities that got together and contributed funds and professors and students to the Turing Institute were Oxford, Cambridge, Warwick, UCL, and Edinburgh. Now we have a space on what they call the first floor of the British Library, and we would call the second floor of the British Library. Half of that floor is called the Alan Turing Institute, and it’s kind of crazy. You enter the British Library, and there’s this stack of books that kind of looks like wallpaper. It’s too beautiful, you know, but it is real. It’s behind glass. And then you turn to the right, and it’s Las Vegas, you know. There’s a startup-looking data science center with people dressed exactly the way you think they are with the hoodies, you know. It’s sort of nuts. But there are two things I should tell everyone about the Alan Turing Institute who’s listening. The first one is that if you walk down a flight of steps, there’s a room called Treasures of the British Library. Turn left, and the first thing you see is a table with Da Vinci’s sketches right next to Michaelangelo’s letters with the first printing of Shakespeare. Those are the first things you see. So if you’re ever thinking about cutting a corner in a paper you’re writing, you go down to that room, you feel bad about yourself for ten minutes, and you rush back up the stairs, inspired and ready to work hard.

KK: Yeah. This sounds very cool.

EL: Wow, that’s amazing.

VN: That’s the first table. There’s other stuff there.

KK: Yeah, I’m still waiting on my invitation to visit you, by the way.

VN: It’s coming. It would help if I’m there.

KK: Sure, once you’re back. So, Vidit, what’s your favorite theorem?

VN: Well, this will not be a surprise to the two of you since you cheated and you made me tell you this in advance. And this took some time. My favorite theorem is Banach’s fixed point theorem, also called the contraction mapping principle. And the reason it’s my favorite theorem is it’s about functions that take a space to itself, so for example, a polynomial in a single variable takes real numbers to real numbers. You can have functions in two dimensions taking values in two dimensions, and so on. And it gives you a criterion for when this function has a fixed point, which is a point that’s sent to itself by the function.

One of the reasons it’s my favorite theorem—well, there are several—but it’s the first theorem I ever discovered. For the kids in the audience, if there are any, we used to have calculators. I promise. They looked like your iPhone, but they were much stupider. And one of the most fun things you could do with them was mash the square root button like you were in a video game. This is what we had for entertainment.

KK: I used to do this too.

VN: Take a large number, and you mash the square root button, and you get 1. And it worked every time.

KK: Right.

VN: And this is Banach’s fixed-point theorem. That’s my proof of Banach’s fixed-point theorem.

KK: That’s great. What’s the actual statement, though? Let’s be less loose.

VN: Right. The actual statement requires a little bit more work than having an old, beat-up calculator. The setup is kind of simple. You have a complete metric space, and by metric space you mean a space where points have a well-defined distance subject to natural axioms for what a distance is, and complete means if you have a sequence of points that are getting close to each other, they actually have a limit. They stop somewhere. If you have a function from such a complete metric space to itself so that when you apply the function to a pair of points, the images are closer together strictly than the original points were, so f(x) and f(y), the distance between them should be strictly less, some constant less than 1 times the distance between x and y. If this is true, then the function has a unique fixed point, and the amazing part about this theorem that I cannot stress highly enough is that the way to find this fixed point is you start anywhere you want, pick any initial point and keep hitting f, this is mashing the square root button, and very quickly, you converge to the actual fixed point. And when you hit the square root button, nothing changes, you just stay at 1.

KK: And it’s a unique fixed point?

VN: It’s a unique fixed point because wherever else you start, you reach that same place. So I’m an algebraic topologist by trade, and this is very much not an algebraic topology fixed-point theorem. The algebraic topology fixed-point theorem makes no assumptions on the function, like it should be bringing points closer together. It makes assumptions on the space where the function is taking its values. It says if the space is nice, maybe convex, maybe contractible, then there is a fixed point, no uniqueness and no recipe for converging to the fixed point.

KK: In fact, we recently had a guest who chose the Brouwer fixed-point theorem.

EL: Yeah.

VN: Yes, the Brouwer fixed-point theorem is one of my favorites, it’s one of the tools I use in my work a lot, but I always have this sort of analyst envy where their fixed-point theorem comes with a recipe for finding the actual fixed point.

KK: Right.

VN: Instead of an existence result.

KK: Yeah, we just wave our hands and say, “Yeah, yeah, yeah, if you didn’t have a fixed point there’d be some map on homology that couldn’t exist and blah blah blah.

VN: Right. And that’s sort of neat but sort of unsatisfying if what you actually care about are the fixed points.

EL: Yeah, so in some ways I kind of ended up more of an analyst because of this. I was really attracted to algebra and that kind of thing, and I felt like at some point I just couldn’t do anything. I felt like in analysis, at least I could get a bound on something, even if it was a really ugly bound, I could at least come in with my hands and play around in the dirt and eventually come up with something. This is probably showing that somehow my brain is more likely to succeed at analysis or something because I know there are people who get to algebra and they can do things, but I just felt like at some point it was this beautiful but untouchable thing, and analysis wasn’t so pretty, and I didn’t mind going and mucking it up.

KK: I had the opposite point of view. I never liked analysis. All those epsilons and deltas, and maybe it was a function of that first advanced calculus course, where you have to get at the end the thing you’re looking for is less than epsilon, not 14epsilon+3epsilon^2. It had to be less than epsilon. I was like, man, come on, this thing is small! Who cares? So I liked the squishiness of topology. I think that’s why I went there.

VN: I think with those epsilon arguments, I don’t know about you guys, but I always ended up doing it twice. You do it the first time and get some hideous function of epsilon, and then you feed back whatever you got to the beginning of the argument, dividing by whatever is necessary, and then it looks like, when you submit your solution, it looks like you were a genius the whole time, and you knew to choose this very awkward thing initially, and you change the argument.

KK: That’s mathematics, right, when you read a paper, it’s lovely. You don’t see all the ugly, horrifying ream of paper you used for the calculations to get it right, you know. I think that’s part of our problem as mathematicians from a PR point of view. We make it look so slick at the end, and people think, wait a minute, how did you do that? Like it’s magic.

VN: We’re very much writing for people next door in our buildings as opposed to people on the street. It helps sometimes, and it also bites us.

KK: This is where Evelyn’s so great, because she is writing for people on the street, and doing it very well.

EL: Well thank you. I didn’t intend this to come back around here, but I’ll take it. Anyway, getting back to our guest, so when did you first encounter this theorem, and was it something you were immediately really into, or did it take some more time?

VN: Actually, the first time I encountered this theorem in a semiformal setting, it just blazed by. I think this is where most people see it for the first time, is in a differential equations course. One of the things that’s so neat about this theorem is that it’s one of the things that guarantees you take f’(x), which equals some hideous expression of x, why should this have a solution, how long should it have a solution for, when is a solution unique? And this requires the hideous thing on the right side to satisfy the contraction mapping property. The existence and uniqueness of ordinary differential equations is the slickest, most famous application of the Banach fixed-point theorem.

KK: I’d never thought about it.

VN: And the analyst nods while Kevin stares off into space, wondering why this should be the case.

KK: No, no, you had a better differential equations course than I did. In our first diffeq’s course, we wouldn’t bring this up. This is too high-powered, right?

VN: It was sort of mentioned, this was at Georgia Tech. It was mentioned that this property holds, there was no proof, even though the proof is not difficult. It’s not so bad if you understand the Cauchy sequence, which not everyone in differential equations does. So we were not shown the proof, but there’s a contraction mapping principle. And then Wikipedia was in its infancy, so now I’m dating myself badly, but I did look it up then and then forgot about it. And then of course I saw it in graduate school all over the place.

KK: Hey, when I was in college, the internet didn’t exist.

VN: How did you get anything done?

KK: You went to the library.

EL: Did you use a card catalog?

KK: I’m a master of the card catalog.

EL: We had one at my elementary school library.

KK: Geez. So growing up in high school, we used to go to the main public library downtown where they had bound periodicals and so if you needed to do your report about, say, the assassination of John Kennedy, for example, you had to go and pull the old Newsweeks off the shelf from 1963. I don’t know, there’s something to that. There’s something to having to actually dig instead of just having it on your phone. But I don’t want to sound like an old curmudgeon either. The internet is great. Well, although wait a minute, the net neutrality vote is happening right now.

VN: It’s great while we speak. We don’t know what’s going to happen in 20 minutes.

KK: Maybe in the middle of this conversation we’re going to get throttled. So Vidit, part of the fun here is that we ask our guest to pair their theorem with something. So what have you chosen to pair the contraction theorem with?

VN: I’m certainly not going to suggest Plato like one of the recent guests. I have something very simple in mind. The reason I have something simple in mind is there’s an inevitability to this theorem, right? You will find the fixed point. So I wanted something inevitable and irresistible in some sense, so I want to pair it with pizza.

EL: Pizza is the best food. Hands down.

VN: Right. It is the best food, hands down. I’m imagining the sort of heathens’ way of eating pizza, right, you eat the edges and move in. I’ve seen people do this, and it’s sort of very disturbing to me. The edge is how you hold the damn thing in the first place. But if you imagine a pizza being eaten from the outside, that’s how I think of the contraction mapping, converging to the middle, the most delicious part of the pizza. I refuse to tell you what fraction of the last two weeks it took me to come up with this pairing. It’s disturbingly difficult.

KK: So you argue that the middle of the pizza is the most delicious part?

EL: Oh yeah.

KK: See, my dog would argue with you. She is obsessed with the crust. If we ever get a pizza, she’s just sitting there: “Wait, can I have the crust?”

EL: But the reason she gets the crust is because humans don’t find it the most delicious.

VN: If I want to eat bread, I’ll eat bread.

KK: I make my own pizza dough, so I make really good pizza crust. It’s worth eating. It’s not this vehicle. But you’re right. Yeah, sure.

EL: We’re going to press you now. What pizza toppings are we talking here? We really need specifics. It’s 9 am where I am, so I can’t have pizza now unless I made my own.

KK: You could. You can have it any time of the day.

EL: But I don’t think there’s a store open. I guess I could get a frozen pizza at the grocery store.

VN: Kevin would suggest having a quick-rise dough set up that, if you pour your yeast in it, it’ll be done in 20 minutes. I think, I’m not big into toppings, but it’s important to have good toppings. Maybe bufala mozzarella and a bit of basil, keep it simple. There’s going to be tomatoes in it, of course, some pizza sauce. But I don’t want to overload it with olives and peppers and sausage and all that.

EL: Okay. So you’re going simple. That’s what we do. We make our own pizza a lot, and a couple years ago we decided to just for fun buy the fancy canned tomatoes from Italy, the San Marzanos.

VN: The San Marzanos, yeah.

EL: Buy the good mozzarella. And since then, that’s all we do. We used to put a bunch of toppings on it all the time, and now it’s just, we don’t even make a sauce, we just squish the tomatoes onto the pizza. Then put the cheese on it, and then the basil, and it’s so good.

KK: I like to make, I assume you’ve both been to the Cheese Board in Berkeley?

EL: No, I haven’t. I hear about it all the time.

KK: It’s on Shattuck Ave in Berkeley, and they have the bakery. It’s a co-op. The bakery is scones—delicious scones, amazing scones—and bread and coffee and all that. And right next door is a pizza place, and they make one kind of pizza for the day, and that’s what you’re going to have. You’re going to have it because it’s delicious. Even the ones where you’re like “eh,” it’s amazing. The line goes down the block, and everybody’s in a good mood, there’s a jazz trio. Anyway, I got the cookbook, and that’s how I make my crust. There’s a sourdough crust, and then our favorite one is the zucchini-corn pizza.

EL: Really.

KK: It’s zucchinis, onions, and cheese, and then corn, and a little feta on top. And then you sprinkle some cilantro and a squeeze of lime juice.

VN: God, I’m so hungry right now.

KK: This is amazing. Yeah, it’s almost lunchtime. My wife and I are going to meet for lunch after this, so can we wrap this up?

EL: Hopefully you’re going to have pizza.

KK: We’re going to a new breakfast place, actually. I’ve got huevos rancheros on my mind.

VN: Excellent.

EL: That’s good too.

KK: Well this has been great fun, Vidit. Thanks for joining us.

VN: Thanks so much again for having me and for doing this. I’m looking forward to seeing who else you’ve managed to rope in to describe their favorite theorems.

KK: There are some good ones.

EL: We’re enjoying it.

KK: We’re having a good time.

VN: Wonderful. Thank you so much, and have fun.

EL: Nice talking to you.

KK: See you. Bye.

Episode 23 - Ingrid Daubechies

Evelyn Lamb: Hello and welcome to My Favorite Theorem. This is a podcast about math where we invite a mathematician in each episode to tell us about their favorite theorem. I’m one of your hosts, Evelyn Lamb. I’m 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. I’m excited about this one.

EL: Yes, I’m very excited. I’m too excited to do any banter. We’re coming up on our one-year anniversary, and we are very honored today to have a special guest. She is a professor at Duke. She has gotten a MacArthur Fellowship, won many prizes. I was just reading her Wikipedia page, and there are too many to list. So we are very happy to have Ingrid Daubechies on the show. Hi, Ingrid. Can you tell us a little bit about yourself?

Ingrid Daubechies: Hi, Evelyn and Kevin. Sure. I have just come back from spending several months in Belgium, in Brussels. I had arranged to have a sabbatical there to be close to and help set up arrangements for my very elderly parents. But I also was involved in a number of fun things, like the annual contest for high school students, to encourage them to major in mathematics once they get to college. And this is the year I turn 64, and because 64 is a much more special number than 60 for mathematicians, my students had arranged to organize some festivities, which we held in a conference center in my native village.

KK: That’s fantastic.

ID: A lot of fun. We had family and friends, we opted to have a family and friends activity instead of a conference where we tried to get the highest possible collection of big name marquee. I enjoyed it hugely. We had a big party in Belgium where I invited via Facebook everybody who ever crossed my timeline. There were people I went to high school with, there was a professor who taught me linear algebra.

KK: Oh, wow.

ID: So it was really a lot of fun.

KK: That’s fantastic.

EL: Yeah, and you have also been president of the International Mathematical Union. I meant to say that at the beginning and forgot. So that is also very exciting. I think while you were president, you probably don’t remember this, but I think we met at a conference, and I was trying to talk to you about something and was very anxious because my grandfather had just gone to the hospital, and I really couldn’t think about anything else. I remember how kind you were to me during that, and just, I think you were talking about your parents as well. And I was just thinking, wow, I’m talking to the president of the International Mathematical Union, and all I can think about is my grandpa, and she is being so nice to me.

ID: Well, of course. This is so important. We are people. We are connected to other people around us, and that is a big part of our life, even if we are mathematicians.

EL: But we have you on the show today to talk about theorems, so what is your favorite theorem?

ID: Well, I of course can’t say that I have one particular favorite theorem. There are so many beautiful theorems. Right now I have learned very recently, and I am ashamed to confess how recently, because it’s a theorem that many people learn in kindergarten, it’s a theorem called Tutte’s embedding theorem about graphs, meshes, in my case it’s a triangular mesh, and the fact that you can embed it, meaning defining a map to a polygon in the plane without having any of the vertices cross, so really an embedding of the whole graph, so every triangle on the complicated mesh that you have, it’s a disk-type mesh, meaning it has no holes, a boundary, lots of triangles, but you can think of it as a complicated thing, and you can embed it under certain conditions in a convex polygon in the plane, and I really, really, really love that. I visualize it by thinking of it as a complicated shape and applying a hair dryer to it to kind of, like Saran wrap, and a hair dryer will flatten it nicely, will try to flatten it, and I think the fact that you can always do it is great. And we’re using it for an interesting, actually we are extending it to mappings, the theorem is originally formulated for a convex polygon in the plane, you can always map to a convex polygon in the plane, and we are extending it to the case where you have a non-convex polygon because that’s what we need, and then we have certain conditions.

KK: Sure. Well, there have to be some conditions, right, because certainly not every graph, every mesh you would draw is planar.

ID: Yeah.

KK: What are those conditions?

ID: It has to be 3-connected, and you define a set of weights on it, on the edges, that ensure planarity. You define weights on the edges that are all positive. What happens is that once you have it in the polygon, you can write each one of the vertices as a convex combination of its neighbors.

KK: Yeah.

ID: And those define your weights. You have to have a set of weights on the edges on your original graph that will make that possible.

KK: Okay.

ID: So you define weights on the original graph that help you in the embedding. What happens is that the positive weights are then used for that convexity. So you have these positive weights, and you use them to make this embedding, and so it’s a theorem that doesn’t tell you only that it is planar, but it gives you a mechanism for building that map to the plane. That’s really the power of the theorem. So you start already with something that you know is planar and you build that map.

KK: Okay.

ID: It’s really powerful. It’s used a lot by people in computer graphics. They then can reason on that Tutte embedding in the plane to build other things and apply them back to the original mesh they had in 3-space for the complicated object they had. And that’s also what we’re trying to use it for. But we like the idea of going to non-convex polygons because that, for certain of the applications that we have, will give us much less deformation.

EL: So, is this related to, I know that you’ve done some work with art reconstruction, and actually in the back of the video here, I think I see some pictures of art that you have helped reconstruct. So is it related to that work?

ID: Actually, it isn’t, although if at some point we go to 3-D objects rather than the paintings we are doing now, it might become useful. But right now this collaboration is with biologists where we’re trying to, well we have been working for several years and we’re getting good results, we are quantifying similarity of morphological surfaces. So the people we work with are working on bones and teeth. They’re paleontologists. Well, they’re interested in evolutionary anthropology, but they work a lot with teeth and bones. And there’s a lot of domain knowledge they have because they’ve seen so many, and they remember things. But of course in order to do science with it, they need to quantify how many similar or dissimilar things are. And they have many methods to do that. And we are trying to work with them to try to automate some of these methods in ways that they find useful and ways that they seek. We’ve gotten very good results in this over the many years that we’ve worked with them. We’re very excited about recent progress we’ve made. In doing that, these surfaces already for their studies get scanned and triangulated. So they have these 3-d triangulations in space. When you work with these organs and muscles and all these things in biology, usually you have 3-d shapes, and in many instances you have them voxelized, meaning you have the 3-d thing. But because they work with fossils, which often they cannot borrow from the place where the fossil is, they work with casts of those in very high-quality resin. And as a result of that, when they bring the cast back, they have the surface very accurately, but they don’t have the 3-d structure. So we work with the surfaces, and that’s why we work with these 3-d meshes of surfaces. And we then have to quantify how close and similar or dissimilar things are. And not just the whole thing, but pieces of it. We have to find ways in which to segment these in biologically meaningful ways. The embedding theorem comes in useful.

But it’s been very interesting to try to build mathematically a structure that will embody a lot of how biologists work. Traditionally what they do is, because they know so much about the collection of things they study, is they find landmarks, so they have this whole collection. They see all these things have this particular thing in common. It looks different and so on. But this landmark point that we mark digitally on these scanned surfaces is the same point in all of them. And the other point is the same. So they mark landmarks, maybe 20 landmarks. And then you can use that to define a mapping. But they asked us, “could we possibly do this landmark-free at some point?” And many biologists scoffed at the idea. How could you do this? At the beginning, of course, we couldn’t. We could find distances that were not so different from theirs, but the landmarks were not in the right places. But we then started realizing, look, why do they have this immense knowledge? Because they have seen so many more than just 20 that they’re now studying.

So we realized this was something where we should look at many collections, and there we have found, with a student of mine who made a breakthrough, if you start from a mapping between, so you have many surfaces, and you have a first way of mapping one to the other and then defining a similarity or not, depending on how faithful the mapping is, all these mappings are kind of wrong, not quite right. But because you have a large collection, there are so many little mistakes that are made that if you have a way of looking at it all, you can view those mistakes as the errors in a data set, and you can try to cancel them out. You can try to separate the grains from the chaff to get the essence of what is in there. A little bit like students will learn when they have a mentor who tells them, no, that point is not really what you think, and so on. So that’s what we do now. We have large collections. We have initial mappings that are not perfect. And we use the fact that we have the large collection to define, then, from that large collection, using machine learning tools, a much better mapping. The biologists have been really impressed by how much better the mappings are once we do that. The wonderful thing is that we use this framework, of course we use machine learning tools, we use all these computer graphics and dealing with surfaces to be efficient. We frame it as a fiber bundle, and we learn. If you think of it, every single one, if you look at a large collection, every one differs by little bits. We want to learn the structure of this set of teeth. Every tooth is a 2-d surface, and similar teeth can map to each other, so they’re all fibers, and we have a connection. And we learn that connection. We have a very noisy version of the connection. But because we know it’s a connection, and because it’s a connection that should be flat because things can be brought back to their common ancestor, and so going from A to B and B to C, it should not matter in what order you go because all these mappings can go to the common ancestor, and so it should kind of commute, we can really get things out. We have been able to use that in order to build correspondences that biologists are now using for their statistical analysis.

KK: So differential geometry for biology.

ID: Yes. Discrete differential geometry, which if there is an oxymoron, that’s one.

KK: Wow.

ID: So we have a team that has a biologist, it has people who are differential geometers, we have a computational geometer, and he was telling me, “you know, for this particular piece of it, it would be really useful if we had a generalization of Tutte’s theorem to non-convex polygons,” and I said, “well, what’s Tutte’s theorem?” And so I learned it last week, and that’s why it’s today my favorite theorem.

EL: Oh wow, that’s really neat.

KK: So we’ll follow up with you next year and see what your favorite theorem is then.

EL: Yeah, it sounds like a really neat collaborative environment there where everybody has their own special knowledge that they’re bringing to the table.

ID: Yes, and actually I have found that to be very, very stimulating in my whole career. I like working with other people. I like when they give you challenges. I like feeling my brain at work, with working together with their different expertise. And, well, once you’ve seen a couple of these collaborations at work, you get a feel for how you jump-start that, how you manage to get people talking about the problems they have and kind of brainstorm until a few problems get isolated on which we really can start to get our teeth dug in and work on it. And that itself is a dynamic you have to learn. I’m sure there are social scientists who know much more about this. In my limited setting, I now have some experience in starting these things up, and so my students and postdocs participate. And some of them have become good at propagating. I’m very motivated by the fact that you can do applications of mathematics that are really nontrivial, and you can distill nontrivial problems out of what people think are mundane applications. But it takes some investing to get there. Because usually the people who have the applications—the biologists, in my case—they didn’t say, “we had this very particular fiber bundle problem.”

EL: Right.

ID: In fact, it’s my student who then realized we really had a fiber bundle, and that helped define a machine learning problem differently than it had been before. That then led to interesting results. So you need all the background, you need the sense of adventure of trying to build tools in that background that might be useful. And I’m convinced that for some of these tools that we build, when more pure mathematicians learn about them, they might distill things in their world from what we need. And this can lead to more pure mathematics ultimately.

KK: Sure, a big feedback loop.

ID: Yes, absolutely. That’s what I believe in very, very strongly. But part of my life is being open to when I hear about things, is there a meaningful mathematical way to frame this? Not just for the fun of it, but will it help?

EL: Yeah, well, as I mentioned, I was amazed by the way you’ve used math for this art reconstruction. I think I saw a talk or an article you wrote about, and it was just fascinating. Things that I never would have thought would be applicable to that sphere.

ID: Yeah, and again it’s the case that there’s a whole lot of knowledge we have that could be applicable, and in that particular case, I have found that it’s a wonderful way to get undergraduates involved because they at the same time learn these tools of image processing and small machine learning tools working on these wonderful images. I mean, how much cooler is it to work on the Ghent altar piece, or even less famous artwork, than to work on standards of image analysis. So that has been a lot of fun. And actually, as I was in Belgium, the first event of the week of celebration we had was an IP4AI, which is Image Processing for Art Investigation, workshop. It’s really over the last 10-15 years, as a community is taking off. We’re trying to have this series of workshops where we have people who are interested in image processing and the mathematics and the engineering of that talk to people who have concrete problems in art conservation or understand art history. We try to have these workshops in museums, and we had it at a museum in Ghent, and it again was very, very stimulating exhilarating.

KK: So another thing we like to do on this podcast is ask our guest to pair their favorite theorem with something. So I’m curious. What do you think pairs well with Tutte’s theorem?

ID: Well, I was already thinking of Saran wrap and the hair dryer, but…

KK: No, that’s perfect. Yeah.

ID: I think also—not for Tutte’s theorem, there I really think of Saran wrap and a hair dryer—but I also am using in some of the work in biology as well what people call diffusion, manifold learning through diffusion techniques. The idea is if you have a complicated world where you have many instances and some of them are very similar, and others are similar to them, and so on, but after you’ve moved 100 steps away, things look not similar at all anymore, and you’d like to learn the geometry of that whole collection.

KK: Right.

ID: Very often it’s given to you by zillions of parameters. I mean, like images, if you think of each pixel of the image as a variable, then you live in thousands, millions of dimensions. And you know that the whole collection of images is not something that fills that whole space. It’s a very thin, wispy set in there. You’d like to learn its geometry because if you learn its geometry, you can do much more with it. So one tool that was devised, I mean 10 years ago or so—it’s not deep learning, it’s not as recent as that—is manifold learning in which you say, well, in every neighborhood if you look at all the things that are similar to me, then I have a little flat disc, it’s close enough to flat that I can really approximate it as flat. And then I have another one, and so on, and I have two mental images for that. I have one mental image: this whole kind of crochet thing, where each one of it you make with a crochet. You cover the whole thing with doilies in a certain sense. You can knit it together, or crochet it together and get the more complex geometry. Another image I often have is sequins. Every little sequin is a little disc.

EL: Yeah.

ID: But it can make it much more complex. So many of my mental images and pairings, if you want, are hands-on, crafty things.

KK: Do you knit and crochet yourself?

ID: Yes, I do. I like making things. I use metaphors like that a lot when I teach calculus because it’s kind of obvious. I find I use almost no sports metaphors. Sports metaphors are big in teaching mathematics, but I use much more handicraft metaphors.

KK: So what else should we talk about? ID: One thing, actually, I was saying, I had such a lot of fun a couple of weeks ago when there was a celebration. The town in which I was born happens to have a fantastic new administrative building in which they have brought together all different services that used to be in different buildings in the town. The building was put together by fantastic architects, and it feels very mathematical. And it has beautiful shapes.

It’s in a mining town—I’m from a coal mining town—and so they have two hyperboloid shapes that they used to bring light down to the lower floors. That reminds people of the cooling towers of the coal mine. They have all these features in it that feel very mathematical. I told the mayor, I said, “Look, I’ll have this group of mathematicians, some of whom are very interested in outreach and education. We could, since there will be a party on Saturday and the conference only starts on Monday, we could on the Sunday have a brainstorming thing in which we try to design a clue-finding search through the building. We design mathematical little things in the building that fit with the whole design with the building. So you should have the interior designers as part of the workshop. I have no idea what will come out, but if something comes out, then we could find a little bit of money to realize it, and that could be something that adds another feature to the building.”

He loved the idea! I thought he was going to be…but he loved the idea. He talked to the person who runs the cafeteria about cooking a special meal for us. So we had a tagine because he was from Morocco. We wanted just sandwiches, but this man made this fantastic meal. We toured the building in the morning and in the afternoon we had brainstorming with local high school teachers and mathematicians and so on. We put them in three small groups, and they came up with three completely different ideas, which all sound really interesting. And then one of them said, “Why don’t we make it an activity that either a family could do, one after the idea, or a classroom could do? You’d typically have only an hour or an hour and a half, and the class would be too big, but you’d split the class into three groups, and each group does one of the activities. They all find a clue, and by putting the clues together, they find some kind of a treasure.”

KK: Oh, wow.

ID: So the ideas were great, and they link completely different things. One is more dynamical systems, one is actually embodying some group and graph theory (although we won’t call it that). And what I like, one of the goals was to find ideas that would require mathematical thinking but that were not linked to curriculum, so you’d start thinking, how would I even frame this? And so on, and trying to give stepwise progression in the problems so that they wouldn’t immediately have the full, complete difficult thing but would have to find ways of building tools that would get you there. They did excellent work. Now each team has a group leader that over email is working out details. We have committed to in a year working out all the details of texts and putting the materials together so it can actually be realized. That was the designers’ part. Can we make something like that not too expensive? They said, oh yeah, with foam and fabric. And I know they will do it.

A year from now I will see whether it all worked on that.

EL: So will you come to Salt Lake next and do that in my town?

ID: Do you have a great building in which it work?

EL: I’m trying to think.

ID: We’re linking it to a building.

EL: I’ll have to think about that.

KK: Well, we have a brand new science museum here in Gainesville. It’s called the Cade Museum. So Dr. Cade is the man who invented Gatorade, you know, the sports drink.

ID: Yes.

KK: And his family got together and built this wonderful new science museum. I haven’t been yet. It just opened a few months ago.

ID: Oh wow.

KK: I’m going to walk in there thinking about this idea.

ID: Yeah, and if you happen to be in Belgium, I can send you the location of this building, and you can have a look there.

KK: Okay. Sounds excellent. Well, this has been great, Ingrid. We really appreciate your taking your time to talk to us today.

ID: Well thank you.

KK: We’re really very honored.

ID: Well it’s great to have this podcast, the whole series.

KK: Yeah, we’re having a good time.

EL: We also want to thank our listeners for listening to us for a year. I’m just going to assume that everyone has listened religiously to every single episode. But yeah, it’s been a lot of fun to put this together for the past year, and we hope there will be many more.

ID: Yes, good luck with that.

KK: Thanks.

ID: Bye.

Episode 22 - Ken Ribet

Evelyn Lamb: Welcome to My Favorite Theorem, a podcast about math. I’m Evelyn Lamb, one of your cohosts, and I’m a freelance math and science writer in Salt Lake City, Utah.

Kevin Knudson: Hi, I’m Kevin Knudson, a professor of mathematics at the University of Florida. How are you doing, Evelyn? Happy New Year!

EL: Thanks. Our listeners listening sometime in the summer will really appreciate the sentiment. Things are good here. I promised myself I wouldn’t talk about the weather, so instead in the obligatory weird banter section, I will say that I just finished a sewing project, only slightly late, as a holiday gift for my spouse. So that was fun. I made some napkins. Most sewing projects are non-Euclidean geometry because bodies are not Euclidean.

KK: Sure.

EL: But this one was actually Euclidean geometry, which is a little easier.

KK: Well I’m freezing. No one ever believes this about Florida, but I’ve never been so cold in my life as I have been in Florida, with my 70-year-old, poorly insulated home, when highs are only in the 40s. It’s miserable.

EL: Yeah.

KK: But the beauty of Florida, of course, is that it ends. Next week it will be 75. I’m excited about this show. This is going to be a good one.

EL: Yes, so we should at this point introduce our guest. Today we are very happy to have Ken Ribet on the show. Ken, would you like to tell us a little bit about yourself?

Ken Ribet: Okay, I can tell you about myself professionally first. I’m a professor of mathematics at the University of California Berkeley, and I’ve been on the Berkeley campus since 1978, so we’re coming up on 40 years, although I’ve spent a lot of time in France and elsewhere in Europe and around the country. I am currently president of the American Mathematical Society, which is how a lot of people know me. I’m the husband of a mathematician. My wife is Lisa Goldberg. She does statistics and economics and mathematics, and she’s currently interested in particular in the statistics of sport. We have two daughters who are in their early twenties, and they were home for the holidays.

KK: Good. My son started college this year, and this was his first time home. My wife and I were super excited for him to come home. You don’t realize how much you’re going to miss them when they’re gone.

KR: Exactly.

EL: Hi, Mom! I didn’t go home this year for the holidays. I went home for Thanksgiving, but not for Christmas or New Year.

KK: Well, she missed you.

EL: Sorry, Mom.

KK: So, Ken, you gave us a list of something like five theorems that you were maybe going to call your favorite, which, it’s true, it’s like picking a favorite child. But what did you settle on? What’s your favorite theorem?

KR: Well, maybe I should say first that talking about one’s favorite theorem really is like talking about one’s favorite child, and some years ago I was interviewed for an undergraduate project by a Berkeley student, who asked me to choose my favorite prime number. I said, well, you really can’t do that because we love all our prime numbers, just like we love all our children, but then I ended up reciting a couple of them offhand, and they made their way into the publication that she prepared. One of them is the six-digit prime number 144169, which I encountered early in my research.

KK: That’s a good one.

KR: Another is 1234567891, which was discovered in the 1980s by a senior mathematician who was being shown a factorization program. And he just typed some 10-digit number into the program to see how it would factor it, and it turned out to be prime!

KK: Wow.

KR: This was kind of completely amazing. So it was a good anecdote, and that reminded me of prime numbers. I think that what I should cite as my favorite theorem today, for the purposes of this encounter, is a theorem about prime numbers. The prime numbers are the ones that can’t be factored, numbers bigger than 1. So for example 6 is not a prime number because it can be factored as 2x3, but 2 and 3 are prime numbers because they can’t be factored any further. And one of the oldest theorems in mathematics is the theorem that there are infinitely many prime numbers. The set of primes keeps going on to infinity, and I told one of my daughters yesterday that I would discuss this as a theorem. She was very surprised that it’s not, so to speak, obvious. And she said, why wouldn’t there be infinitely many prime numbers? And you can imagine an alternative reality in which the largest prime number had, say, 50,000 digits, and beyond that, there was nothing. So it is a statement that we want to prove. One of the interesting things about this theorem is that there are myriad of proofs that you can cite. The best one is due to Euclid from 2500 years ago.

Many people know that proof, and I could talk about it for a bit if you’d like, but there are several others, probably many others, and people say that it’s very good to have lots of proofs of this one theorem because the set of prime numbers is a set that we know a lot about, but not that much about. Primes are in some sense mysterious, and by having some alternative proofs of the fact that there are infinitely many primes, we could perhaps say we are gaining more and more insight into the set of prime numbers.

EL: Yeah, and if I understand correctly, you’ve spent a lot of your working life trying to understand the set of prime numbers better.

KR: Well, so that’s interesting. I call myself a number theorist, and number theory began with very, very simple problems, really enunciated by the ancient Greeks. Diophantus is a name that comes up frequently. And you could say that number theorists are engaged in trying to solve problems from antiquity, many of which remain as open problems.

KK: Right.

KR: Like most people in professional life, number theorists have become specialists, and all sorts of quote-on-quote technical tools have been developed to try to probe number theory. If you ask a number theorist on the ground, as CNN likes to say, what she’s working on, it’ll be some problem that sounds very technical, is probably hard to explain to a general listener, and has only a remote connection to the original problems that motivated the study. For me personally, one of the wonderful events that occurred in my professional life was the proof of Fermat’s last theorem in the mid-1990s because the proof uses highly technical tools that were developed with the idea that they might someday shed light on classical problems, and lo and behold, some problem that was then around 350 years old was solved using the techniques that had been developed principally in the last part of the 20th century.

KK: And if I remember right — I’m not a number theorist — were you the person who proved that the Taniyama-Weil conjecture implied Fermat’s Last Theorem?

KR: That’s right. The proof consists of several components, and I proved that something implies Fermat’s Last Theorem.

KK: Right.

KR: And then Andrew Wiles partially, with the help of Richard Taylor, proved that something. That something is the statement that elliptic curves (whatever they are) have a certain property called modularity, whatever that is.

EL: It’s not fair for you to try to sneak an extra theorem into this podcast. I know Kevin baited you into it, so you’ll get off here, but we need to circle back around. You mentioned Euclid’s proof of the infinitude of primes, and that’s probably the one most people are the most familiar with of these proofs. Do you want to outline that a little bit? Actually not too long ago, I was talking to the next door neighbors’ 11-year-old kid, he was interested in prime numbers, and the mom knows we’re mathematicians, so we were talking about it, and he was asking about what the biggest prime number was, and we talked about how one might figure out whether there was a biggest prime number.

KR: Yeah, well, in fact when people talk about the proof, often they talk about it in a very circular way. They start with the statement “suppose there were only finitely many primes,” and then this and this and this and this, but in fact, Euclid’s proof is perfectly direct and constructive. What Euclid’s proof does is, you could start with no primes at all, but let’s say we start with the prime 2. We add 1 to it, and we see what we get, and we get the number 3, which happens to be prime. So we have another prime. And then what we do is take 2 and multiply it by 3. 2 and 3 are the primes that we’ve listed, and we add 1 to that product. The product is 6, and we get 7. We look at 7 and say, what is the smallest prime number dividing 7? Well, 7 is already prime, so we take it, and there’s a very simple argument that when you do this repeatedly, you get primes that you’ve never seen before. So you start with 2, then you get 3, then you get 7. If you multiply 2x3x7, you get 6x7, which is 42. You add 1, and you get 43, which again happens to be prime. If you multiply 2x3x7x43 and add 1, you get a big number that I don’t recall offhand. You look for the prime factorization of it, and you find the smallest prime, and you get 13. You add 13 to the list. You have 2, 3, 7, 43, 13, and you keep on going. The sequence you get has its own Wikipedia page. It’s the Euclid-Mullin sequence, and it’s kind of remarkable that after you repeat this process around 50 times, you get to a number that is so large that you can’t figure out how to factor it. You can do a primality test and discover that it is not prime, but it’s a number analogous to the numbers that occur in cryptography, where you know the number is not prime, but you are unable to factor it using current technology and hardware. So the sequence is an infinite sequence by construction. But it ends, as far as Wikipedia is concerned, around the 51st term, I think it is, and then the page says that subsequent terms are not known explicitly.

EL: Interesting! It’s kind of surprising that it explodes that quickly and it doesn’t somehow give you all of the small prime numbers quickly.

KR: It doesn’t explode in the sense that it gets bigger and bigger. You have 43, and it drops back to 13, and if you look at the elements of the sequence on the page, which I haven’t done lately, you’ll see that the numbers go up and then down. There’s a conjecture, which was maybe made without too much evidence, that as you go to the sequence, you’ll get all prime numbers.

EL: Okay. I was about to ask that, if we knew if you would eventually get all of them, or end up with some subsequence of them.

KR: Well, the expectation, which as I say is not based on really hard evidence, is that you should be able to get everything.

KK: Sure. But is it clear that this sequence is actually infinite? How do we know we don’t get a bunch of repeats after a while?

KR: Well, because the principle of the proof is that if you have a prime that’s appeared on the list, it will not divide the product plus 1. It divides the product, but it doesn’t divide 1, so it can’t divide the new number. So when you take the product and you factor it, whatever you get will be a quote-on-quote new prime.

KK: So this is a more direct version of what I immediately thought of, the typical contradiction proof, where if you only had a finite number of primes, you take your product, add 1, and ask what divides it? Well, none of those primes divides it. Therefore, contradiction.

KR: Yes, it’s a direct proof. Completely algorithmic, recursive, and you generate an infinite set of primes.

KK: Okay. Now I buy it.

EL: I’m glad we did it the direct way. Because setting it up as a proof by contradiction when it doesn’t really need the contradiction, it’s a good way, when I’ve taught things like this in the past, this is a good way to get the proof, but you can kind of polish it up and make it a little prettier by taking out the contradiction step since it’s not really required.

KR: Right.

KK: And for your 11-year-old friend, contradiction isn’t what you want to do, right? You want a direct proof.

KR: Exactly. You want that friend to start computing.

KK: Are there other direct proofs? There must be.

KR: Well, another direct proof is to consider the numbers known as Fermat numbers. I’ll tell you what the Fermat numbers are. You take the powers of 2, so the powers of 2 are 1, 2, 4, 8, 16, 32, and so on. And you consider those as exponents. So you take 2 to those powers of 2. 2^1, 2^2, 2^4, and so on. To these numbers, you add the number 1. So you start with 2^0, which is 1, 2^1 is 2, and you add 1 and get 3. Then the next power of 2 is 2. You add 1 and you get 5. The next power of 2 is 4. 2^4 is 16. You add 1, and you get 17. The next power of 2 is 8. 2^8 is 256, and you add 1 and get 257. So you have this sequence, which is 3, 5, 17, 257, and the first elements of the sequence are prime numbers. 257 is a prime number. And it’s rather a famous gaffe of Fermat that he apparently claimed that all the numbers in the sequence were prime numbers, that you could just generate primes that way. But in fact, if you take the next one, it will not be prime, and I think all subsequent numbers that have been computed have been verified to be non-prime. So you get these Fermat numbers, a whole sequence of them, an infinite sequence of them, and it turns out that a very simple argument shows you that any two different numbers in the sequence have no common factor at all. And so, for example, if you take 257 and, say, the 19th Fermat number, that pair of numbers will have no common factor. So since 257 happens to be prime, you could say 257 doesn’t divide the 19th Fermat number. But the 19th Fermat number is a big number. It’s divisible by some prime. And you can take the sequence of numbers and for each element of the sequence, take the smallest prime divisor, and then you get a sequence of primes, and that’s a infinite sequence of primes. The primes are all different because none of the numbers have a common factor.

KK: That’s nice. I like that proof.

EL: Nice! It’s kind of like killing a mosquito with a sledgehammer. It’s a big sequence of these somewhat complicated numbers, but there’s something very fun about that. Probably not fun to try to kill mosquitoes with a sledgehammer. Don’t try that at home.

KK: You might need it in Florida. We have pretty big ones.

KR: I can tell you yet a third proof of the theorem if you think we have time.

KK: Sure!

KR: This proof I learned about, and it’s an exercise in a textbook that’s one of my all-time favorite books to read. It’s called A Classical Introduction to [Modern] Number Theory by Kenneth Irleand and Michael Rosen. When I was an undergraduate at Brown, Ireland and Rosen were two of my professors, and Ken Ireland passed away, unfortunately, about 25 years ago, but Mike Rosen is still at Brown University and is still teaching. They have as an exercise in their book a proof due to a mathematician at Kansas State, I think it was, named Eckford Cohen, and he published a paper in the American Mathematical Monthly in 1969. And the proof is very simple. I’ll tell you the gist of it. It’s a proof by contradiction. What you do is you take for the different numbers n, you take the geometric mean of the first n numbers. What that means is you take the numbers 1, 2, 3, you multiply them together, and in the case of 3, you take the cube root of that number. We could even do that for 2, you take 1 and 2 and multiply them together and take the square root, 1.42. And these numbers that you get are smaller than the averages of the numbers. For example, the square root of 2 is less than 1.5, and the cube root of 6, of 1x2x3, is less than 2, which is the average of 1, 2, and 3. But nevertheless these numbers get pretty big, and you can show using high school mathematics that these numbers approach infinity, they get bigger and bigger. You can show, using an argument by contradiction, that if there were only finitely many primes, these numbers would not get bigger and bigger, they would stop and be all less than some number, depending on the primes that you could list out.

EL: Huh, that’s really cool.

KK: I like that.

KR: That’s kind of an amazing proof, and you see that it has absolutely nothing to do with the two proofs I told you about before.

KK: Sure.

EL: Yeah.

KK: Well that’s what’s so nice about number theory. It’s such a rich field. You can ask these seemingly simple questions and prove them 10 different ways, or not prove them at all.

KR: That’s right. When number theory began, I think it was a real collection of miscellany. People would study equations one by one, and they’d observe facts and record them for later use, and there didn’t seem to be a lot of order to the garden. And the mathematicians who tried to introduce the conceptual techniques in the last part of the 20th century, Carl Ludwig Siegel, André Weil, Jean-Pierre Serre, and so on, these people tried to make everything be viewed from a systematic perspective. But nonetheless if you look down at the fine grain, you’ll see there are lots of special cases and lots of interesting phenomena. And there are lots of facts that you couldn’t predict just by flying at 30,000 feet and trying to make everything be orderly.

EL: So, I think now it’s pairing time. So on the show, we like to ask our mathematicians to pair their theorem with something—food, beverage, music, art, whatever your fancy is. What have you chosen to pair with the infinitude of primes?

KR: Well, this is interesting. Just as I’ve told you three proofs of this theorem, I’d like to discuss a number of possible pairings. Would that be okay?

KK: Sure. Not infinitely many, though.

KR: Not infinitely many.

EL: Yeah, one for each prime.

KR: One thing is that prime numbers are often associated with music in some way, and in fact there is a book by Marcus du Sautoy, which is called The Music of the Primes. So perhaps I could say that the subject could be paired with his book. Another thing I thought of was the question of algorithmic recursive music. You see, we had a recursive description of a sequence coming from Euclid’s method, and yesterday I did a Google search on recursive music, and I got lots of hits. Another thing that occurred to me is the word prime, because I like wine a lot and because I’ve spent a lot of time in France, it reminds me of the phrase vin primeur. So you probably know that in November there is a day when the Beaujolais nouveau is released all around the world, and people drink the wine of the year, a very fresh young wine with lots of flavor, low alcohol, and no tannin, and in France, the general category of new wines is called vin primeur. It sounds like prime wines. In fact, if you walk around in Paris in November or December and you try to buy vin primeur, you’ll see that there are many others, many in addition to the Beaujolais nouveau. We could pair this theorem with maybe a Côtes du Rhône primeur or something like that.

But finally, I wanted to settle on one thing, and a few days ago, maybe a week ago, someone told me that in 2017, actually just about a year ago, a woman named Maggie Roche passed away. She was one of three sisters who performed music in the 70s and 80s, and I’m sure beyond. The music group was called the Roches. And the Roches were a fantastic hit, R-O-C-H-E, and they are viewed as the predecessors for, for example, the Indigo Girls, and a number of groups who now perform. They would stand up, three women with guitars. They had wonderful harmonies, very simple songs, and they would weave their voices in and out. And I knew about their music when it first came out and found myself by accident in a record store in Berkeley the first year I was teaching, which was 1978-79, long ago, and the three Roches were there signing record albums. These were vinyl albums at the time, and they had big record jackets with room for signatures, and I went up to Maggie and started talking to her. I think I spoke to her for 10 or 15 minutes. It was just kind of an electrifying experience. I just felt somehow like I had bonded with someone whom I never expected to see again, and never did see again. I bought one or two of the albums and got their signatures. I no longer have the albums. I think I left them in France. But she made a big impression on me. So if I wanted to pair one piece of music with this discussion, it would be a piece by the Roches. There are lots of them on Youtube. One called the Hammond Song, is especially beautiful, and I will officially declare that I am pairing the infinitude of primes with the Hammond Song by the Roches.

EL: Okay, I’ll have to listen to that. I’m not familiar with them, so it sounds like a good thing to listen to once we hang up here.

KK: We’ll link it in the show notes, too, so everyone can see it.

EL: That sounds like a lot of fun. It’s always a cool experience to feel like you’re connecting with someone like that. I went to a King’s Singers concert one time a few years ago and got a CD signed, and how warm and friendly people can be sometimes even though they’re very busy and very fancy and everything.

KR: I’ve been around a long time, and people don’t appreciate the fact that until the last decade or two, people who performed publicly were quite accessible. You could just go up to people before concerts or after concerts and chat with them, and they really enjoyed chatting with the public. Now there’s so much emphasis on security that it’s very hard to actually be face to face with someone whose work you admire.

KK: Well this has been fun. I learned some new proofs today.

KR: Fun for me too.

EL: Thanks a lot for being on the show.

KR: It’s my great pleasure, and I love talking to you, and I love talking about the mathematics. Happy New Year to everyone.

[outro]

Episode 21 - Jana Rodriguez Hertz

Evelyn Lamb: Hello and welcome to My Favorite Theorem. I’m one of your hosts, Evelyn Lamb. I’m 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. How are you doing, Evelyn?

EL: I’m all right. I’m excited because we’re trying a different recording setup today, and a few of our recent episodes, I’ve had a few connection problems, so I’m hoping that everything goes well, and I’ve probably jinxed myself by saying that.

KK: No, no, it’s going to be fine. Positive thinking.

EL: Yeah, I’m hoping that the blips that our listeners may have heard in recent episodes won’t be happening. How about you? Are you doing well?

KK: I’m fine. Spring break is next week, and we’ve had the air conditioning on this week. This is the absurdity of my life. It’s February, and the air conditioning is on. But it’s okay. It’s nice. My son is coming home for spring break, so we’re excited.

EL: Great. We’re very happy today to have Jana Rodriguez-Hertz on the show. So, Jana, would you like to tell us a little bit about yourself?

Jana Rodriguez-Hertz: Hi, thank you so much. I’m originally from Argentina, I have lived in Uruguay for 20 years, and now I live in China, in Shenzhen.

EL: Yeah, that’s quite a big change. When we were first talking, first emailing, I mean, you were in Uruguay then, you’re back in China now. What took you out there?

JRH: Well, we got a nice job offer, and we thought we’d like to try. We said, why not, and we went here. It’s nice. It’s a totally different culture, but I’m liking it so far.

KK: What part of China are you in, which university?

JRH: In Southern University of Science and Technology in Shenzhen. It’s in Shenzhen. Shenzhen is in mainland China in front of Hong Kong, right in front of Hong Kong.

KK: Okay. That’s very far south.

EL: I guess February weather isn’t too bad over there.

JRH: It’s still winter, but it’s not too bad.

EL: Of course, that will be very relevant to our listeners when they hear this in a few months. We’re glad to have you here. Can you tell us about your favorite theorem?

JRH: Well, you know, I live in China now, and every noon I see a dynamical process that looks like the theorem I want to talk to you about, which is the dynamical properties of Smale’s horseshoe. Here it goes. You know, at the canteen of my university, there is a cook that makes noodles.

EL: Oh, nice.

JRH: He takes the dough and stretches it and folds it without mixing, and stretches it and folds it again, until the strips are so thin that they’re ready to be noodles, and then he cuts the dough. Well, this procedure can be described as a chaotic dynamical system, which is the Smale’s horseshoe.

KK: Okay.

JRH: So I want to talk to you about this. But we will do it in a mathematical model so it is more precise. So suppose that the cook has a piece of dough in a square mold, say of side 1. Then the cook stretches the dough so it becomes three times longer in the vertical sense but 1/3 of its original width in the horizontal sense. Then he folds it and puts the dough again in the square mold, making a horseshoe form. So the lower third of the square is converted into a rectangle of height 1 and width 1/3 and will be placed on the left side of the mold. The middle third of the square is going to be bent and will go outside the mold and will be cut. The upper third will be converted to another rectangle of height 1 and width 1/3 and will be put upside down in the right side of the mold. Do you get it?

KK: Yeah.

JRH: Now in the mold there will be two connected components of dough, one in the left third of the square and one in the right third of the square, and the middle third will be empty. In this way, we have obtained a map from a subset of the square into another subset of the square. And each time this map is applied, that is, each time we stretch and fold the dough, and cut the bent part, it’s called a forward iteration. So in the first forward iteration of the square, we obtain two rectangles of width 1/3 and height 1. Now in the second forward iteration of the square, we obtain four rectangles of width 1/9 and height 1. Two rectangles are contained in the left third, two rectangles in the right third. These are four noodles in total.

Counting from left to right, we will see one noodle of width 1/9, one gap of width 1/9, a second noodle of width 1/9, a gap of 1/3, and two more noodles of width 1/9 separated by a gap of width 1/9. Is that okay?

KK: Yes.

JRH: So if we iterate n times, we will obtain 2n noodles of width (1/3)n. And if we let the number of iterations go to infinity, that is, if we stretch and fold infinitely many times, cutting each time the bent part, we will obtain a Cantor set of vertical noodles.

KK: Yes.

EL: Right. So as you were saying the ninths with these gaps, and this 1/3, I was thinking, huh, this sounds awfully familiar.

KK: Yeah, yeah.

EL: We’ll include a picture of the Cantor set in the show notes for people to look at.

JRH: When we iterate forward, in the limit we will obtain a Cantor set of noodles. We can also iterate backwards. And what is that? We want to know for each point in the square, that is, for each flour particle of the dough in the mold, where it was before the cook stretched vertically and folded the dough the first time, where it came from. Now we recall that the forward iteration was to stretch in the vertical sense and fold it, so if we zoom back and put it backwards, we will obtain that the backward sense the cook has squeezed in the vertical sense and stretched in the horizontal sense and folded, okay?

EL: Yes.

JRH: Each time we iterate backwards, we stretch in the horizontal sense and fold it and put it in that sense. In this way, the left vertical rectangle is converted into the lower rectangle, the lower third rectangle. And the right side rectangle, the vertical rectangle, is converted into the upper third rectangle, and the bent part is cut. If we iterate backwards, now we will get in the first backward iteration four horizontal rectangles of width 1/9 and the gaps, and if we let the iterations go to infinity, we will obtain a Cantor set of horizontal noodles.

When we iterate forward and consider only what’s left in the mold, we start with two horizontal rectangles and finish with two vertical rectangles. When we iterate backwards we start with two vertical rectangles and finish with two horizontal rectangles. Now we want to consider the particles that stay forever in the mold, that is, the points so that all of the forward iterates and all the backwards iterates stay in the square. This will be the product of two middle-thirds Cantor set. It will look more like grated cheese than noodles.

KK: Right.

JRH: This set will be called the invariant set.

KK: Although they’re not pointwise fixed, they just stay inside the set.

JRH: That’s right. They stay inside the square. In fact, not only will they be not fixed, they will have a chaotic behavior. That is what I want to tell you about.

KK: Okay.

JRH: This is one of the simplest models of an invertible map that is chaotic. So what is chaotic dynamics anyways? There is no universally accepted definition about that. But one that is more or less accepted is one that has three properties. These properties are that periodic points are dense, it is topologically mixing, and it has sensitivity to initial conditions. And let me explain a little bit about this.

A periodic point is a particle of flour that has a trajectory that comes back exactly to the position where it started. This is a periodic point. What does it mean that they are dense? As close as you wish from any point you get one of these.

Topologically mixing you can imagine that means that the dough gets completely mixed, so if you take any two small squares and iterate one of them, it will get completely mixed with the other one forever. From one iteration on, you will get dough from the first rectangle in the second rectangle, always. That means topologically mixing.

I would like to focus on the sensitivity to initial conditions because this is the essence of chaos.

EL: Yeah, that’s kind of what you think of for the idea of chaos. So yeah, can you talk a little about that?

JRH: Yeah. This means that any two particles of flour, no matter how close they are, they will get uniformly separated by the dynamics. in fact, they will be 1/3 apart for some forward or backward iterate. Let me explain this because it is not difficult. Remember that we had the lower third rectangle? Call this lower third rectangle 0, and the upper third rectangle 1. Then we will see that for some forward or backward iterate, any two different particles will be in different horizontal rectangles. One will be in 1, and the other one will be in the 0 rectangle. How is that? If two particles are at different heights, than either they are already in different rectangles, so we are done, or else they are in the same rectangle. But if they are in the same rectangle, the cook stretches the vertical distance by 3. Every time they are in the same horizontal rectangle, their vertical distance is stretched by 3, so they cannot stay forever in the same rectangle unless they are at the same height.

KK: Sure.

JRH: If they are at different heights, they will get eventually separated. On the other hand, if they are in the same vertical rectangle but at different x-coordinates, if we iterate backwards, the cook will stretch the dough in the horizontal sense, so the horizontal distance will be tripled. Each time they are in the same vertical rectangle, they cannot be forever in the same vertical rectangle unless they are in the same, unless their horizontal distance is 0. But if they are in different positions, then either their horizontal distance is positive or the vertical distance is positive. So in some iterate, they will be 1/3 apart. Not only that, if they are in two different vertical rectangles, then in the next backwards iterate, they are in different horizontal rectangles. So we can state that any two different particles for some iterate will be in different horizontal rectangles, no matter how close they are. So that’s something I like very much because each particle is defined by its trajectory.

EL: Right, so you can tell exactly what you are by where you’ve been.

JRH: Yeah, two particles are defined by what they have done and what they will do. That allows something that is very interesting in this type of chaotic dynamics, which is symbolic dynamics. Now you know that any two points in some iterate will have distinct horizontal rectangles, so you can code any particle by its position in the horizontal rectangles. If one particle is in the beginning in the 0 rectangle, you will assign to them a sequence so that its zero position is 0, a double infinite sequence. If the first iterate is in the rectangle 1, then in the first position you will put a 1. In this way you can code any particle by a bi-infinite sequence of zeroes and ones. So in dynamics this is called conjugation. You can conjugate the horseshoe map with a sequence of bi-infinite sequences. This means that you can code the dynamics. Anything that happens in the set of bi-infinite sequences, happens in the horseshoe and vice versa. This is very interesting because you will find particles that describe any trajectory that you wish because you can write any sequence of zeroes and ones as you wish. You will have all Shakespeare coded in the horseshoe map, all of Donald Trump’s tweets will be there too.

KK: Let’s hope not. Sad!

JRH: Everything will be there.

EL: History of the world, for better and worse.

KK: What about Borges’s Library of Babel? It’s in there too, right?

JRH: If you can code it with zeroes and ones, it’s there.

EL: Yeah, that’s really cool. So where did you first run into this theorem?

JRH: When I was a graduate student, I ran into chaos, and I first ran into a baby model of this, which is the tent map. A tent map is in the interval, and that was very cool. Unlike this model, it’s coded by one-sided sequences. And later on, I went to IMPA [Instituto de Matemática Pura e Aplicada] in Rio de Janeiro, and I learned that Smale, the author of this example, had produced this example while being at IMPA in Rio.

KK: Right.

JRH: It was cool. I learned a little more about dynamics, about hyperbolic dynamics, and in fact, now I’m working in partially hyperbolic dynamics, which is very much related to this, so that is why I like it so much.

KK: Yeah, one of my colleagues spends a lot of time in Brazil, and he’s still studying the tent map. It’s remarkable, I mean, it’s such a simple model, and it’s remarkable what we still don’t know about it. And this is even more complicated, it’s a 2-d version.

EL: So part of this show is asking our guests to pair their theorem with something. I have an idea of what you might have chosen to pair with your theorem, but can you tell us what you’ve chosen?

JRH: Yeah, I like this sensitivity to initial conditions because you are defined by your trajectory. That’s pretty cool. For instance, if you consider humans as particles in a system, actually nowadays in Shenzhen, it is only me who was born in Argentina, lived in Uruguay, and lives in Shenzhen.

EL: Oh wow.

JRH: This is a city of 20 million people. But I am defined by my trajectory. And I’m sure any one of you are defined by your trajectory. If you look at a couple of things in your life, you will discover that you are the only person in the world who has done that. That is something I like. You’re defined, either by what you’ve done, or what you will do.

EL: Your path in life. It’s interesting that you go there because when I was talking to Ami Radunskaya, who also chose a theorem in dynamics, she also talked about how her theorem related to this idea of your path in life, so that’s a fun idea.

JRH: I like it.

KK: Of course, I was thinking about taffy-pulling the whole time you were describing the horseshoe map. You’ve seen these machines that pull taffy, I think they’re patented, and everything’s getting mixed up.

EL: Yeah.

JRH: All of this mixing is what makes us unique.

EL: So you can enjoy this theorem while pondering your life’s path and maybe over a bowl of noodles with some taffy for dessert.

KK: This has been fun. I’d never really thought too much about the horseshoe map. I knew it as this classical example, and I always heard it was so complicated that Smale decided to give up on dynamics, and I’m sure that’s false. I know that’s false. He’s a brilliant man.

JRH: Actually, he’s coming to a conference we’re organizing this year.

EL: Oh, neat.

KK: He’s still doing amazingly interesting stuff. I work in topological data analysis, and he’s been working in that area lately. He’s just a brilliant guy. The Fields Medal was not wasted on him, for sure.

EL: Well thanks a lot for taking the time to talk to us. I really enjoyed talking with you.

JRH: Thank you for inviting me.

[outro]