TryShadowing
Shadow YouTube. Nói tiếng Anh.
Trang chủ
Khám phá
Chép chính tả
NEW
Thư viện
vi
0
ngày
Đăng nhập
Terence Tao: Hardest Proble… — Lex Fridman luyện shadowing | TryShadowing
TryShadowing
Shadow YouTube. Nói tiếng Anh.
Trang chủ
Khám phá
Chép chính tả
NEW
Thư viện
vi
0
ngày
Đăng nhập
Trang chủ
Khám phá
Lex Fridman
Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI | Lex Fridman Podcast #472
Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI | Lex Fridman Podcast #472
Lex Fridman
·
3:14:34 · 14 thg 6, 2025
Bắt đầu học
0:00
0:00
Ghi âm
×1
1x
VI
EN
JA
KO
ZH
FR
PT
TH
IT
DE
IPA
Chấm điểm phát âm chưa hỗ trợ trên trình duyệt này — bạn vẫn ghi âm & nghe lại được.
The
following
is
a
conversation
with
Terrence
Tao.
Đang dịch…
Bật Ghi âm để được thu giọng và chấm điểm
Thông minh
Karaoke
Câu gốc
Câu
1
/4274
0:00
The following is a conversation with Terrence Tao.
0:03
Widely considered to be one of the greatest mathematicians in history.
0:08
Often referred to as the Mozart
0:10
of math, he won the Fields Medal and the Breakthrough Prize in mathematics
0:16
and has contributed groundbreaking
0:17
work to a truly astonishing
0:19
range of fields in mathematics and physics.
0:24
This was a huge honor for me for many reasons,
0:27
including the humility and kindness
0:30
that Terry showed to me
0:32
throughout all our interactions.
0:34
It means the world.
0:36
This is the Lex Freedman podcast.
0:38
To support it, please check out our sponsors in the description
0:42
or at And now,
0:45
dear friends, here's Terren
0:50
What was the first
0:51
really difficult research level math problem that you encountered?
0:55
One that gave you pause maybe.
0:57
Well, I mean in your undergraduate
1:00
um education, you learn about the really hard impossible
1:02
problems like the reman hypothesis,
1:05
the twin primes conjecture.
1:06
You can make problems arbitrarily difficult.
1:08
That's not really a problem.
1:09
In fact, there's even problems that we know to be unsolvable.
1:12
What's really interesting are the problems just at the on the boundary between what
1:15
we can do relatively easily and what are hopeless.
1:18
Um but what are problems where like
1:21
existing techniques can do like 90%
1:23
of the job and then you just need that remaining 10%.
1:26
Um I think as a PhD student the CA problem certainly caught my eye
1:31
and it just got solved actually.
1:32
It's a problem I've worked on a lot in my early research.
1:35
Historically it came from a little puzzle by the Japanese
1:38
mathematician Soji Kaya uh in like 1918 or so.
1:42
Um, so the puzzle is that you you you
1:45
have um a needle
1:47
um in on the plane.
1:49
Um think like like a like driving like on on on a road something
1:53
and you you want it to execute a U-turn.
1:55
You want to turn the needle around.
1:56
Um but you want to do it in as little space as possible.
2:00
So you want to use as little area
2:02
in order to turn it around.
2:04
So um but the needle is infinitely maneuverable.
2:07
So you can imagine just spinning it around its um as a unit needle.
2:11
You can spin it around its center.
2:13
Um, and I think, um, that gives you a disc of of area, I
2:15
think pi over four.
2:17
Um, or you can do a three-point U-turn, which is what they we teach
2:20
people in in the driving schools to do.
2:22
Uh, and that actually takes area pi over 8.
2:25
So, it's it's a little bit more efficient than um a rotation.
2:28
And so, for a while, people thought that was the most efficient
2:30
uh way to turn things around.
2:31
But, Mazikovich uh showed that in fact, you could actually
2:35
uh turn the needle around using as little area as you wanted.
2:38
So 0001 there was some really fancy multi-
2:42
um u back and forth U-turn thing that you could you could do
2:46
that that you could turn a needle around and in so doing it would
2:49
pass through every intermediate direction.
2:50
Is this in the two dimensional plane?
2:52
This is in the two dimensional plane. Yeah.
2:53
So we understand everything in two dimensions.
2:56
So the next question is what happens in three dimensions.
2:58
So suppose like the Hubble space telescope is tube in space
3:02
and you want to observe every single star in the universe.
3:05
So you want to rotate the telescope to reach every single direction.
3:08
And here's unrealistic part.
3:09
Suppose that space is at a premium, which it totally is not.
3:12
Uh you want to occupy as little volume as possible
3:15
in order to rotate your your needle around in order to see every single
3:18
star in the sky.
3:19
Um how small a volume do you need to do that?
3:23
And so you can modify basic construction.
3:26
And so if your telescope has zero thickness,
3:28
then you can use as little volume as you need.
3:30
That's a simple modification of the two dimensional construction.
3:33
But the question is that if your telescope is not zero thickness but but
3:36
just very very thin
3:38
some thickness delta what is the minimum volume
3:41
needed to be able to see every single
3:43
direction as a function of delta.
3:45
So as delta gets smaller as you need gets thinner the volume should go
3:49
down but but how fast does it go down?
3:52
Um and the conjecture was that it goes down very very slowly
3:56
um like logarithmically um
3:58
uh roughly speaking and that was proved after a lot of work.
4:02
So this seems like a puzzle.
4:04
Why is it interesting?
4:05
So it turns out to be surprisingly
4:06
connected to a lot of problems in partial differential equations, in number theory, in geometry, comics.
4:12
For example, in in wave propagation,
4:14
you splash some some water around um you create water waves and they they
4:17
travel in various directions.
4:18
Um but waves exhibit both
4:21
both particle and wave type behavior.
4:23
So you can have what's called a wave packet, which is like a a
4:26
very localized wave that is localized in space and moving a certain direction in time.
4:30
And so if you plot it in both space and time,
4:32
it occupies a region which looks like a tube.
4:36
And so what can happen is that you can have a wave which initially
4:39
is very dispersed but it all comes it all focuses at a single point later in time.
4:44
Like you can imagine dropping a pebble into a pond and ripples spread out.
4:47
But then if you time reverse that that
4:50
um that scenario and the equations of wave motion are time reversible.
4:53
You can imagine ripples that are converging
4:55
um to a single point and then a big splash occurs
4:59
um maybe even a
5:01
Um and so it's possible to do that.
5:04
Uh and geometrically what's going on is that there's always s of light rays.
5:07
Um so like if if if this wave represents light for example
5:11
um you can imagine this wave as a superp position of photons
5:13
um all traveling at the speed of light.
5:16
They all travel on these light rays and they're all focusing at this one point.
5:19
So you can have a very dispersed wave
5:21
focus into a very concentrated
5:23
wave at one point in space and time, but then it defocuses
5:26
again and it separates.
5:28
But potentially if the conjecture had a negative solution.
5:31
So what that meant is that there's there's a very efficient way to pack
5:34
um tubes pointing different directions into a very very narrow region of of of very narrow volume.
5:41
Then you would also be able to create waves
5:42
that start out some there'll be some arrangement of waves that start out very
5:46
very dispersed but they would concentrate
5:48
not just at a single point but
5:50
um um there'll be a large
5:53
um there'll be a lot of concentrations
5:54
in space and time
5:56
and uh um and you could create what's called a blowup where these waves
6:01
their amplitude becomes so great that the laws of physics that they're governed by
6:04
are no longer wave equations but something more complicated and nonlinear.
6:08
Um and so in mathematical physics we care a lot about whether certain equations
6:11
in in wave equations are stable or not whether they can create um these singularities.
6:16
There's a famous unsolved problem called the Navia Stokes regularity problem.
6:19
So the Navia Stokes equations
6:21
equations that govern the fluid flow for incompressible fluids like water.
6:25
The question asks if you start with a smooth velocity field of water
6:28
can it ever concentrate
6:30
so much that like the velocity becomes infinite at some point that's called a singularity.
6:34
We don't see that
6:36
um in real life.
6:37
You know, if you splash around water on the bathtub, it won't explode on you.
6:41
Um or or have
6:43
have water leaving at the speed of light, I think.
6:45
But potentially, it is possible.
6:47
Um and in fact, in recent years, the the consensus
6:52
has has drifted towards the uh
6:54
the belief that uh that in fact for certain very special
6:58
initial configurations of of say water that singularities can form.
7:03
But people have not yet been able to uh to actually establish this.
7:06
The clay foundation has these seven millennium prize problems
7:09
has a million dollar prize for solving one of these problems that this is one of them.
7:12
Of these seven only one of them has been solved
7:15
the point conjecture by Pelman.
7:18
So the Ka conjecture is not directly directly related to the Navis Stokes problem
7:23
but understanding it would help us
7:26
understand some aspects of things like wave concentration
7:29
which would indirectly probably help us understand the Navis problem better.
7:32
Can you speak to the neighbors?
7:34
So the existence and smoothness
7:36
like you said millennial prize problem
7:38
right you've made a lot of progress on this one in 2016
7:41
you published a paper finite time blow up for an averaged
7:44
threedimensional navia stoke equation
7:47
right so we're trying to figure out if this thing usually doesn't blow up
7:52
right but can we say for sure it never blows up right yeah so
7:57
yeah that is literally the the million- dollar question yeah so this is what
8:00
distinguishes mathematicians from pretty much everybody else like it
8:04
If something holds 99.99%
8:06
of the time, um that's good enough for most,
8:09
you know, uh for
8:10
for most things, but
8:12
mathematicians are one of the few people who really care about whether
8:15
every like 100% really 100% of all
8:18
um situations are covered by by
8:20
um yeah, so most fluid
8:22
most of the time
8:23
um water that does not blow up.
8:25
But could you design a very special initial state that does this?
8:29
And maybe we should say that this is a this is a set of
8:31
equations that govern in the field of fluid dynamics.
8:35
Trying to understand how fluid behaves and it's actually
8:37
turns out to be a really comp you know fluid is
8:40
yeah extremely complicated thing to try to model. Yeah.
8:43
So it has practical importance.
8:44
So this clay price problem concerns what's called the incompressible
8:46
navio stokes which governs things like water.
8:49
There's something called the compressible navio stokes which governs things like air.
8:52
And that's particularly important for weather prediction.
8:54
Weather prediction it does a lot of computational fluid dynamics.
8:56
A lot of it is actually just trying to solve the ny stokes equations
8:59
as best they can.
9:01
Um also gathering a lot of data so that they can get they can
9:04
in initialize the equation.
9:05
There's a lot of moving parts.
9:07
So it's very important practically.
9:09
Why is it difficult to prove general
9:12
things about the set of equations
9:15
like it not not blowing up?
9:17
Short answer is Maxwell's demon.
9:19
Um so exos demon is a concept in thermodynamics
9:22
like if you have a box of two gases and oxygen and hydrogen
9:25
uh and maybe you start with all the oxygen one side and nitrogen the
9:28
other side but there's no barrier between them right then they will mix
9:31
um and they should stay mixed right there there's no reason why they should
9:35
unmix but in principle because of all the collisions between them there could be
9:39
some sort of weird conspiracy
9:40
that that um like maybe there's a microscopic
9:42
demon called Maxwell's demon that will
9:44
um every time a oxygen and nitrogen atom collide
9:47
they will bounce off in such a way that the oxygen sort of drifts
9:49
onto one side and then goes to the other
9:51
and uh you could have an extremely improbable configuration emerge.
9:55
Uh which we never see.
9:57
Um and and we statistically
9:59
it's extremely unlikely but
10:02
mathematically it's possible that this can happen and we can't rule it out.
10:05
Um and this is a situation that shows up a lot in mathematics.
10:09
Um a basic example is the digits of pi
10:12
3.14159 and so forth.
10:14
The digits look like they have no pattern and we believe they have no pattern.
10:18
On the long term, you should see as many ones and twos and threes
10:20
as fours and fives and sixes.
10:22
There should be no preference
10:24
in the digits of pi to favor let's say 7 over 8.
10:27
Um, but maybe there's some demon in the digits of pi that that like
10:32
every time you compute more digits, it sort of biases
10:34
one digit to another.
10:36
Um, and this is a conspiracy
10:38
that should not happen.
10:39
There's no reason it should happen, but
10:42
um there's there's there's no way to prove it.
10:44
uh with our current technology. Okay.
10:46
So getting back to Nabia Stokes,
10:48
a fluid has a certain amount of energy and because a fluid is in
10:51
motion, the energy gets transported around
10:53
and water is also viscous.
10:55
So if the energy is spread out
10:57
over many different locations,
10:58
the natural viscosity of the fluid will just damp out the energy and will
11:02
it will go to zero.
11:03
Um and this is what happens
11:05
um in um uh when we actually
11:08
experiment with water like
11:09
you splash around there.
11:10
there's some turbulence and waves and so forth.
11:12
But eventually it it settles down and and and the the lower the amplitude,
11:16
the smaller the velocity, the the more calm it gets.
11:19
Um but potentially there is some sort of a demon that keeps pushing
11:23
the uh the energy of the fluid into a smaller and smaller scale and
11:27
it will move faster and faster and at faster speeds the effective viscosity is relatively less.
11:31
And so it could happen that that it it creates a some sort of
11:35
um um what's called a self similar blowup scenario where you know um the
11:39
energy of fluid starts off at some
11:41
um large scale and then it all
11:43
sort of um transfers it energy into a smaller
11:47
um region of of of the fluid which then at a much faster rate
11:50
um moves into um an even smaller
11:53
region and so forth.
11:54
Um and and each time it does this uh it takes maybe half as
11:58
as long as as the previous one and then
12:01
you you could you could actually
12:02
uh converge to all the energy
12:05
concentrating in one point
12:06
in a finite amount of time.
12:08
Um and that that's uh that scenario is called finite blow up.
12:13
Um so in practice this doesn't happen.
12:15
Um so water is what's called turbulent.
12:18
Um so it is true that um if you have a big eddy of
12:21
water it will tend to break up into smaller eddies
12:24
but it won't transfer all the the energy from one big eddy into one smaller eddy.
12:27
It will transfer into maybe three or four and then those must split up
12:30
into maybe three or four small edies of their own and so the energy
12:33
gets dispersed to the point where the viscosity
12:35
can can then keep that thing under control.
12:38
Um but if it can somehow
12:40
um concentrate um all the energy
12:43
keep it all together
12:44
um and do it fast enough that the viscous effects
12:47
don't have enough time to calm everything down then this blob can occur.
12:51
So there were papers who had claimed that oh you just need to take
12:54
into account conservation energy and just carefully
12:57
use the viscosity and you can keep everything under control for not just Navia
13:00
Stokes but for many many types of equations like this
13:03
and so in the past there have been many attempts to try to obtain
13:05
what's called global regularity for Navio Stokes which is the opposite of final time
13:09
blow up that velocity say smooth
13:11
and it all failed there was always some sign error or some subtle mistake
13:14
and and it couldn't be salvaged.
13:17
Um so what I was interested in doing
13:20
was trying to explain why we were not able to
13:23
disprove um planet time blow up.
13:26
I couldn't do it for the actual equations of fluids which were too complicated.
13:29
But if I could average the equations of motion of naval
13:32
basically if if um if I could turn off certain types of of
13:36
ways in which water interacts and only keep the ones that I want.
13:39
Um, so in particular,
13:41
um, if, um, if there's a fluid and it could transfer energy
13:44
from a large Eddie into this small Eddie or this other small Eddie, I
13:48
would turn off the
13:50
energy channel that would transfer energy to this this one and and direct it
13:53
only into um, this smaller
13:56
Eddie while still preserving the law of conservation of energy.
13:58
So you're trying to make it blow up. Yeah. Yeah.
14:00
So I I I
14:01
basically engineer um, a blow up by changing the laws of physics, which is
14:05
one thing that mathematicians
14:06
are allowed to do.
14:07
We can change the equation.
14:08
How does that help you get closer to the proof of something? Right?
14:11
So, it provides what's called an obstruction in mathematics.
14:14
Um, so, so what I did was that uh basically if I turned off
14:18
the um certain parts of the equation, so
14:20
which usually when you turn off certain interactions
14:23
make it less nonlinear,
14:24
it makes it more regular and less likely to blow up.
14:27
But I found that by turning off a very well-designed
14:30
set of of of of
14:32
interactions, I could force all the energy to blow in finite time.
14:36
So what that means is that if you wanted to prove
14:39
um global regularity for Navia Stokes
14:42
um for the actual equation
14:44
you had you must use some
14:46
feature of the true equation which which my artificial equation
14:50
um does not satisfy.
14:52
So it it rules out certain um certain approaches.
14:55
So um the thing about math is is it's not just about finding
14:59
you know taking a technique that is going to work and applying it but
15:02
you you need to not take the techniques that don't work.
15:05
Um and for the problems that are really hard, often there are dozens of
15:09
ways that you might think might apply
15:12
to solve the problem.
15:13
But uh it's only after a lot of experience that you realize there's no
15:16
way that these methods are going to work.
15:18
So having these counter examples for nearby problems
15:21
um kind of rules out
15:22
um uh it saves you a lot of time because you you're not wasting
15:27
um energy on on things that you now know cannot possibly ever work.
15:30
How deeply connected is it to that specific problem of fluid dynamics
15:34
or just some more general intuition you build up about mathematics? Right. Yeah.
15:38
So the key phenomenon that
15:40
uh my my technique exploits is what's called superc criticality.
15:44
So in partial differential equations often these equations are like a tugof-war between different forces.
15:49
So in Navia Stokes there's the dissipation
15:52
um force coming from viscosity
15:54
and it's very well understood. It's linear.
15:56
It calms things down.
15:57
If if viscosity was all there was, then then nothing bad would ever happen.
16:01
Um but there's also transport
16:03
um that that energy
16:05
from in one location of space can get transported because the fluid is in
16:08
motion to to other locations.
16:10
Um and that's a nonlinear
16:11
effect and that causes all the all the problems.
16:14
Um so there are these two competing
16:16
terms in the Davis
16:18
equation the dissipation term and the transport term.
16:20
If the dissipation term dominates, if it's if it's large, then basically you get regularity.
16:24
And if um if the transport term dominates,
16:27
then uh then we don't know what's going on.
16:29
It's a very nonlinear situation. It's unpredictable. It's turbulent.
16:32
So sometimes these forces are in balance at small scales, but not in balance
16:36
at large scales or or vice versa.
16:39
Um so Navis Stokes is what's called supercritical.
16:41
So at at smaller and smaller scales,
16:43
the transport terms are much stronger than the viscosity terms.
16:46
So the viscosity are the things that calm things down.
16:49
Um and so this is um
16:52
um this is why the problem is hard in two dimensions.
16:55
So the Soviet mathematician
16:56
ladish skaya she in the 60s shows in two dimensions there is no blow
17:00
up and in two dimensions the nav
17:03
equations is what's called critical the effect of transport and the effect of viscosity
17:06
about the same strength even at very very small scales
17:09
and we have a lot of technology to handle critical and also subcritical
17:12
equations and proof um regularity
17:14
but for superc critical equations it was not clear what was going on
17:18
and I did a lot of work and then there's been a lot of
17:21
follow-up showing that for many other types of superc critical equations you
17:25
create all kinds of blow up examples.
17:27
Once the nonlinear effects
17:28
dominate the linear effects at small scales, you can have all kinds of bad things happen.
17:32
So this is sort of one of the main insights
17:34
of this this line of work is that superc criticality
17:37
versus criticality and subcriticality.
17:39
This this makes a big difference.
17:41
I mean that's a key qualitative
17:43
feature that distinguishes some equations for being sort of nice and predictable and you
17:46
know like like planetary motion and I mean there are certain equations that that
17:50
you can predict for millions of years
17:52
and or thousands at least.
17:54
Again, it's not really a problem, but but
17:55
there's a reason why we can't predict the weather past 2 weeks
17:59
into the future because it's a super critical equation.
18:01
Lots of really strange things are going on at very fine scales.
18:04
So, whenever there is
18:06
some huge source of
18:09
yeah, that can create a huge problem for predicting
18:12
what's going to happen. Yeah.
18:13
And if the nonlinearity
18:14
is somehow more and more featured and interesting at at small scales.
18:18
Um I mean there's there's many equations that are nonlinear but um
18:21
in in many equations you can approximate things by the bulk.
18:24
Um so for example planetary motion
18:26
you know if you want to understand the orbit of the moon or Mars
18:29
or something you don't really need the micro structure of
18:32
like the seismology of the moon or or like exactly how the mass is distributed.
18:37
um you just basically you can almost approximate these planets by point masses
18:40
and just the aggregate behavior is important
18:44
um but if you want to model a fluid
18:46
um like like the weather
18:47
you can't just say in Los Angeles the temperature is this the wind speed
18:50
is this for super critical equations the finance confirmation is is really important if
18:54
we can just linger on the narto's
18:56
uh equations a little bit
18:58
so you've suggested maybe you can describe
19:01
it that one of the ways to
19:03
uh solve it or to negatively resolve it would be to
19:09
sort of to construct a liquid a kind of liquid computer, right?
19:13
And then show that the halting problem from computation
19:15
theory has consequences for fluid dynamics.
19:18
So uh show it in that way.
19:21
Can you describe this this Yeah.
19:23
So this came out of of this work of constructing
19:25
this this this average equation that that blew up.
19:27
Um so one um
19:30
as as part of how I had to do this.
19:32
So there this naive way to do it.
19:33
You you just keep
19:35
pushing um um every time you you get energy at one scale you you
19:39
push it immediately to the next scale as as fast as possible.
19:42
This is sort of the naive way to to to to force blow up.
19:45
Um it turns out in five and high dimensions this works.
19:48
Um but in three dimensions there was this funny phenomenon that I discovered
19:51
that if you if you keep
19:53
if if you change the laws of physics you just always keep trying to
19:57
push um the energy into smaller smaller scales.
20:00
Um what happens is that the energy starts getting
20:02
spread out into multi
20:03
many scales at once.
20:04
Um so that you you have energy at one scale you're pushing it into
20:08
the next scale and then
20:10
um as soon as it enters that scale you also push it to the
20:12
next scale but there's still some energy left over from the previous scale.
20:16
um you're trying to do everything at once.
20:17
Um and this spreads out the energy too much.
20:20
Um and then it turns out that that
20:22
um it makes it vulnerable for viscosity
20:24
to come in and actually just damp out everything.
20:27
So um so it turns out this this direct bush doesn't doesn't actually work.
20:31
There was a separate paper by some other authors that actually showed this
20:34
um in three dimensions.
20:35
Um so what I needed was to program a delay.
20:39
Um so kind of like air locks.
20:41
So um I needed an equation which would start with a fluid
20:45
doing something at one scale.
20:47
It would push this energy into the next scale but it would
20:50
stay there until all the energy from the from the larger scale got transferred
20:55
and only after you pushed all the energy in then you sort of open
20:58
the next gate and and then you you push that in as well.
21:01
So um by doing that it kind of the energy inches forward scale by
21:04
scale in such a way that it's always um localized at one scale at a time.
21:08
Um and then it can resist the effects of viscosity because it's not dispersed.
21:12
Um so in order to make that happen
21:15
um yeah I had to construct a rather complicated nonlinearity.
21:19
Um and it was basically like
21:21
um you know like was constructed like electronic circuit.
21:25
So I I actually thank my wife for this because she was trained as a electrical engineer.
21:29
Um and um you know he talked about um
21:32
uh you know he had to design circuits and so forth.
21:35
And you know if if you want a circuit that does a certain thing
21:37
like maybe have a light that that flashes on and then turns off and
21:40
then on and then off.
21:41
You can build it from from more primitive components you know capacitors and resistors
21:45
and so forth and you have to build a diagram
21:47
and you um and these diagrams you can you can sort of follow your
21:51
eyeballs and say oh yeah the the current will build up here and then
21:54
it will stop and then it will do that.
21:56
So I knew how to build the analog of basic electronic components, you know,
21:59
like resistors and capacitors and so forth.
22:01
And and I would I would stack them together
22:03
um in in such a way that that I would create something that would
22:06
open one gate and then there'll be a clock that would and then once
22:09
the clock hits a certain threshold it would close it
22:11
kind of a rude Goldberg type machine but described mathematically
22:14
and this ended up working.
22:16
So what I realized is that if you could pull the same thing off
22:19
for the actual equations.
22:20
So if the equations of water
22:22
support a computation so um
22:25
like if you can imagine kind of a steampunk but really water punk uh
22:28
type of thing where
22:29
um you know so modern computers are electronic
22:32
you know they they they're powered by by electrons
22:35
passing through very tiny wires and interacting with other electrons and so forth.
22:39
But instead of electrons, you can imagine these pulses
22:42
of of water moving at certain velocity
22:45
and maybe it's they're two different configurations
22:47
corresponding to a bit being up or down.
22:50
Probably if you had two of these moving bodies of water collide,
22:54
it would come out with some new configuration which is which would be something
22:58
like an ANDgate or orgate.
22:59
you know that if the the the output would depend in a very predictable
23:02
way on on the inputs
23:04
and like you could chain these together and maybe create a touring machine
23:08
and and then you could you have computers
23:10
which are made completely out of water
23:13
um and if you have computers then maybe you can do robotics
23:16
so I you know hydraulics and so forth um
23:19
and so you could create some
23:21
machine which is basically
23:23
a fluid analog what's called a vonomian
23:25
machine so vonomian proposed
23:28
if you want to colonize Mars.
23:29
The sheer cost of transporting
23:31
people machines to Mars is just ridiculous.
23:33
But if you could transport one machine to Mars
23:36
and this machine had the ability to mine the planet, create some more materials
23:39
to smelt them and build
23:41
more copies of the same machine.
23:44
Um, then you could colonize a whole planet um over time.
23:48
Um, so uh if you could build a fluid machine,
23:52
which uh yeah, so it's it's it's a it's a robot. Okay.
23:56
And what it would do it its purpose in life, it's programmed so that
24:00
it would create a smaller version of itself in some sort of cold state.
24:03
It wouldn't start just yet.
24:05
Once it's ready, the big robot configuration water would transfer all his energy into
24:09
the smaller configuration and then power down. Okay?
24:11
And then like I clean itself up.
24:13
And then what's left is this newest state which would then turn on and
24:16
do the same thing but smaller and faster.
24:19
And then the equation has a certain scaling symmetry.
24:21
Once you do that, it can just keep iterating.
24:23
So this in principle would create a blow up uh for the actual Navia
24:27
Stokes and this is what I managed to accomplish for this average Navia Stokes.
24:30
So it provided the sort of road map
24:32
to solve the problem.
24:33
Now this is uh
24:35
a pipe dream because
24:37
uh there are so many things that are missing for this to actually be a reality.
24:40
Um so um I I I
24:42
can't create these basic logic gates.
24:44
Um I I don't I don't have these in these
24:47
special configurations of water.
24:48
Um, I mean there's candidates there things called vortex rings that might possibly work
24:52
but um um but also you know
24:56
analog computing is really
24:57
nasty um compared to digital computing.
24:59
I mean because there's always errors
25:01
um you you have to you have to do a lot of error correction along the way.
25:05
I don't know how to completely power down the big machine so that it
25:08
doesn't interfere with the the running of the smaller machine
25:10
but everything in principle
25:12
can happen like it doesn't contradict any of the laws of physics.
25:15
Um so it's sort of evidence
25:17
that this thing is possible.
25:19
Um there are other groups who are
25:21
now pursuing ways to make navis blow up which are nowhere near as ridiculously complicated as this.
25:27
Um um they they actually are pursuing much
25:31
closer to the the direct self similar model which can
25:34
it doesn't quite work as is but there could be some simpler
25:38
scheme than what I just described to make this work.
25:40
There is a real leap of genius here
25:43
to go from Navia Stokes to this touring machine.
25:46
So it goes from what the
25:48
self similar blob scenario that you're trying to get the smaller and smaller blob
25:53
to now having a liquid
25:56
toying machine gets smaller and smaller and smaller
25:59
and somehow seeing how that
26:02
could be used to say something about a blowup.
26:06
I mean that's a big leap. So there's precedent.
26:09
I mean um so the the thing about mathematics
26:12
is that it's really good at um
26:14
spotting connections between what you think of what you might think of as completely different um problems.
26:19
Um but if if the mathematical form is the same you you can you
26:22
you can you can draw a connection
26:24
um so um there's a lot of work previously on what called cellular automator
26:29
um the most famous of which is Conway's game of life.
26:32
there's this infinite discrete grid
26:33
and at any given time the grid is either occupied by a cell or
26:36
it's empty and there's a very simple rule that uh tells you how these cells evolve.
26:40
So sometimes cells live and sometimes they die.
26:42
Um and this um you know um when I was a a student it
26:46
was a very popular screen saver to actually just have these these animations
26:50
going and and they look very chaotic.
26:52
In fact they look a little bit like turbulent float sometimes.
26:54
But at some point
26:55
people discovered more and more interesting structures within this game of life.
26:58
Um so for example they discovered this thing called a glider.
27:00
So a glider is a very tiny configuration of like four or five cells
27:03
which evolves and it just moves at a certain direction and that's like this
27:07
this vortex rings this
27:09
um yeah so this is an analogy
27:11
the game of life is kind of like a discrete
27:12
equation and and um
27:15
the flu navis is a continuous equation but mathematically
27:18
they have some similar features
27:20
um and um so over time people discovered
27:24
more and more interesting things you could build within
27:27
the game of life.
27:27
The game life is a very simple system.
27:29
It only has like three or four rules
27:30
um to to do it, but but you can design all kinds of interesting configurations inside it.
27:34
Um there's something called a glider gun that does nothing to spit out gliders
27:37
one at a one one at a time.
27:39
Um and then after
27:42
a lot of effort,
27:43
people managed to to create
27:45
um and gates and or gates for gliders.
27:48
Like there's this massive ridiculous structure which if you if a if
27:52
you have a stream of gliders
27:54
um coming in here and a stream of gliders coming in here
27:56
then you may produce a stream of gliders coming out.
27:58
If so maybe if both of of the um
28:01
streams um have gliders then there'll be an output
28:05
stream but if only one of them does then nothing comes out. Mhm.
28:07
So they could build something like that.
28:10
And once you could build
28:12
and um these basic gates then
28:15
just from software engineering
28:17
you can build almost anything.
28:18
Um you can build a touring machine.
28:20
I mean it's like an enormous steampunk type things. They look ridiculous.
28:24
But then people also generated self-replicating
28:27
objects in the game of life.
28:29
A massive machine a bon machine which over a huge period of time and
28:33
it always look like glider guns inside doing these very steampunk calculations.
28:36
it would create another version of itself which could replicate. It's so incredible.
28:42
A lot of this was like community crowdsourced
28:43
by like amateur mathematicians actually.
28:46
Um so I knew about that that that work and so that is part
28:50
of what inspired me to propose the same thing with Navia Stokes.
28:53
Um which is a much
28:55
as I said analog is much worse than digital like it's going to be
28:59
um you can't just directly take the constructions in the game of life and plunk them in.
29:03
But again it just it shows it's possible.
29:06
You know, there's a kind of
29:07
emergence that happens with these cellular automa. Local rules.
29:13
Maybe it's similar to fluids. I don't know.
29:16
But local rules operating
29:19
at scale can create these incredibly complex dynamic structures.
29:25
Do you think any of that is amendable
29:27
to mathematical Do we have the tools to say something profound about that?
29:33
The thing is you can get this emerg in very complicated structures but only
29:36
with very carefully prepared initial conditions. Yeah.
29:39
So so these these these glider guns and and gates and and so forth
29:43
machines if you just plunk down randomly
29:45
some cells and you and
29:47
you will not see any of these.
29:48
Um and that's the analogous situation with Navia Stokes again you know that that
29:53
with with typical initial conditions you you will not have any of this weird computation going on.
29:58
Um but basically through engineering
30:01
you know by by by
30:02
specially designing things in a very special way you can make clever constructions.
30:07
I wonder if it's possible to prove the sort of the negative of like
30:11
basically prove that only through engineering
30:13
can you ever create something interesting.
30:16
This this is a recurring challenge in mathematics that um
30:19
I call it the dichotomy between structure and randomness.
30:22
That most objects that you can generate in mathematics are random.
30:25
They look like rand like the digits of pi.
30:27
Well, we believe is a good example.
30:29
Um, but there's a very small number of things that have patterns.
30:32
Um, but um, now you can prove something has a pattern by just constructing,
30:36
you know, like if something has a simple pattern and you have a proof
30:38
that it it does something like repeat itself every so often.
30:41
You can do that.
30:42
But um, and you you can prove that that for example, you can you
30:46
can prove that most sequences of of digits have no pattern.
30:49
Um, so like if you just pick digits randomly, there's something called low large numbers.
30:52
It tells you you're going to get as many ones as as twos
30:55
in the long run.
30:56
Um but um we have a lot fewer tools to to to if I
31:01
give you a specific pattern like the digits of pi
31:04
how can I show that this doesn't have some weird pattern to it.
31:07
Some other work that I spend a lot of time on is to prove
31:10
what are called structure theorems or inverse theorems
31:12
that give tests for when something is is very structured.
31:15
So some functions are what's called additive like if you have a function that
31:19
maps natural numbers with natural numbers.
31:20
So maybe um you know two maps to four three maps to six and so forth.
31:25
um some functions what's called additive which means that if you add
31:28
if you add two inputs together the output gets gets added as well
31:31
uh for example multiplying by a constant if you multiply a number by 10
31:34
um if you if you multiply a plus b by 10 that's the same
31:38
as multiplying a by 10 and b by 10 and then adding them together
31:41
so some um functions are additive
31:44
some are kind of additive but not completely additive
31:47
um so for example if I take a number
31:49
n I multiply by the square root of two
31:52
and I take the integer part of that So 10 by square of two
31:55
is like 14 point something.
31:56
So 10 up to 14.
31:58
Um 20 up to 28.
32:00
Um so in that case additively is true then.
32:03
So 10 + 10 is 20 and 14 + 14 is 28.
32:06
But because of this rounding
32:08
sometimes there's roundoff errors and and sometimes when you um
32:11
add a plus b this function doesn't quite give you the sum of of
32:14
the two individual outputs but the sum plus minus one.
32:17
Um so it's almost additive but not quite additive.
32:20
Um so there's a lot of useful
32:23
results in mathematics and I've worked a lot on developing things like this to
32:26
the effect that if if a function exhibits some structure like this
32:29
then um it's basically
32:32
there's a reason for why it's true and the reason is because there's there's
32:34
some other nearby function which is actually
32:37
um completely structured which is explaining
32:40
this sort of partial pattern that you have.
32:43
Um and so if you have these so inverse theorems it um it creates
32:46
this sort of dichotomy that they either
32:49
the objects that you study are either
32:51
have no structure at all or they are somehow related to something that is structured.
32:55
Um and in either way in either
32:57
um in either case you can make progress.
33:00
Um a good example of this is that there's this old theorem in mathematics
33:04
called sim theorem proven in the 1970s.
33:07
It concerns trying to find a certain type of pattern in a set of numbers.
33:10
the patterns that have make progression
33:11
things like 3 five and seven or or or 10
33:14
15 and 20 andreli
33:17
proved that um any set of of numbers that are sufficiently big
33:21
um what's called positive density
33:23
has um arithmetic progressions in it of of any length you wish
33:27
um so for example
33:28
um the odd numbers have a set of density 1/2
33:31
um and they contain arithmetic progressions of any length
33:34
um so in that case it's obvious because the the
33:36
odd numbers are really really structured
33:38
I can just take
33:39
11 13 15 17 I just I can I can easily find arithmetic progressions
33:43
in in in that set.
33:45
Um but um zerminism
33:47
also applies to random sets.
33:48
If I take the set of odd numbers and I flip a coin
33:52
um and for each number and I only keep
33:55
the numbers which for which I got a heads
33:57
okay so I just flip coins.
33:58
I just randomly take out half the numbers I keep one half.
34:01
So that's a set that has no no patterns at all.
34:04
But just from random fluctuations,
34:06
you will still get a lot of um
34:08
um of arithmetic progressions in that set.
34:10
Can you prove there's arithmetic
34:14
progressions of arbitrary length within a random? Yes.
34:18
Um have you heard of the infinite monkey theorem?
34:20
Usually mathematicians give boring names to theorists, but occasionally they they give colorful names. Yes.
34:24
The popular version of the infinite monkey theorem is that if you have an
34:27
infinite number of monkeys
34:28
in a room with each with a typewriter
34:30
they type out uh text randomly
34:33
almost surely one of them is going to generate the entire screw of Hamlet
34:36
or any other finite string of text.
34:38
Uh it will just take some time
34:39
quite a lot of time actually but if you have an infinite number then it happens.
34:43
Um so um basically the the
34:46
if you take an infinite
34:48
string of of digits or whatever
34:50
um eventually any finite pattern you wish will emerge.
34:53
Um it may take a long time
34:55
but it will eventually happen.
34:57
Um in particular arithmetic progressions of any length will eventually happen. Okay.
35:00
But you need that but you need an extremely long random sequence for this to happen.
35:04
I suppose that's intuitive. It's just infinity. Yeah.
35:08
Infinity absorbs a lot of sins. Yeah.
35:11
How are we humans supposed to deal with infinity?
35:14
Well, you can think of infinity as as as just an abstraction
35:17
of um a finite number for which you you do not have a bound
35:21
for um that uh you know I mean so nothing in real life is truly infinite.
35:26
Um but you know you can
35:29
um you know you can ask yourself questions like you know what if I
35:32
had as much money as I wanted you know or what if I could
35:34
go as fast as I wanted
35:36
and a way in which mathematicians
35:38
formalize that is mathematics has found a formalism to idealize
35:41
instead of something being extremely large or extremely small to actually be exactly infinite or zero.
35:46
Um and often the the mathematics becomes a lot cleaner
35:49
when you do that.
35:50
I mean in physics we we joke about uh assuming spherical cows.
35:55
um you know like
35:56
real world problems have got all kinds of real world effects but you can
35:58
idealize send certain things to infinity send certain things to zero
36:03
um and um and the mathematics becomes a lot simpler to work with there.
36:06
I wonder how often
36:10
using infinity uh forces us to deviate from
36:15
um the physics of reality. Yeah.
36:17
So there's a lot of pitfalls.
36:18
Um so you know we we spend a lot of time in undergraduate
36:21
math classes teaching analysis.
36:23
Um and analysis is often about how to take limits and and and and
36:27
whether you you know so for example
36:29
a plus b is always b plus a.
36:30
Um so when you have a finite number of terms you add them you
36:33
can swap them and there there's no problem.
36:35
But when you have infinite number of terms there these sort of shell games
36:38
you can play where you can have a series which converges to one value
36:41
but you rearrange it and it suddenly converges to another value.
36:44
And so you can make mistakes.
36:46
You have to know what you're doing when you allow infinity.
36:48
Um you have to introduce these epsilons and deltas and and
36:52
this there's a certain type of way of reasoning
36:54
that helps you avoid mistakes.
36:56
Um in more recent years
36:59
um people have started taking results that are true in infinite
37:03
limits and what's called finetizing them.
37:06
Um so you know that something's true eventually
37:09
but um you don't know when.
37:10
Now give me a rate. Okay.
37:11
Okay, so it's such a if I have don't have an infinite number of
37:14
monkeys but but a large finite number of monkeys,
37:17
how long do I have to wait for H to come out?
37:19
Um and that's a more quantitative question.
37:22
Um and this is something that you can you can um attack by purely
37:26
finite methods and you can use your finite intuition.
37:29
Um and in this case it turns out to be exponential
37:31
in the length of the text that you're you're trying to generate.
37:34
Um so um and so this is why you never see the monkeys create Hamilton.
37:39
you can maybe see them create a four-letter word, but nothing that big.
37:42
And so I personally find once you finitize
37:44
an infinite statement, it's it does become much more intuitive
37:48
and it's no longer so so weird.
37:51
Um so even if you're working with infinity, it's good to finitize
37:54
so that you can have some intuition. Yeah.
37:57
The downside is that the finite groups are just much much messier
38:00
and and uh yeah.
38:02
So so the infinite ones are found first usually like decades earlier
38:05
and then later on people finize them.
38:07
So since we mentioned a lot of math and a lot of physics
38:10
uh what is the difference between mathematics
38:12
and physics as disciplines
38:14
as ways of understanding
38:16
of seeing the world
38:17
maybe we can throw in engineering in there you mentioned your wife is an
38:20
engineer give it new perspective on circuits
38:22
right so this different way of looking at the world given that you've done
38:26
mathematical physics so you you've you've worn all the hats
38:30
right so I think science in general is interaction between three things
38:33
um there's the real world
38:36
um there's is what we observe of the reward, our observations
38:39
and then our mental models
38:41
as to how we think the world works.
38:44
Um so um we can't directly access reality. Okay.
38:48
Uh all we have are the observations
38:50
which are incomplete and they they have errors.
38:53
Um and um there are many many cases where we would um
38:57
uh we want to know for example what is the weather like tomorrow and we
39:00
don't yet have the observation we'd like to a prediction.
39:03
Um and then we have these simplified models sometimes
39:06
making unrealistic assumptions you know spherical cow type things.
39:09
Those are the mathematical models.
39:11
Mathematics is concerned with the models.
39:13
Science collects the observations
39:15
and it proposes the models that might explain these observations.
39:20
What mathematics does we we stay within the model and we ask what are
39:24
the consequences of that model?
39:25
what observations would what predictions would the model make of the of future observations
39:31
um or past observations
39:32
does it fit observed data
39:34
um so there's definitely a symbiosis
39:37
um it's ma I guess mathematics is is unusual among other disciplines is that
39:43
we start from hypothesis
39:45
like the axims of a model and ask what conclusions
39:48
come up from that that model
39:50
um in almost any other discipline
39:52
uh you start with the conclusions you know I want to do this
39:54
I want to build a bridge, you know, I I want to to make money.
39:57
I want to do this. Okay.
39:58
And then you you you
40:00
find the path to get there.
40:02
Um a lot there there's a lot less sort of speculation about suppose I
40:06
did this, what would happen?
40:08
Um you know, planning and and and modeling
40:11
um uh speculative fiction maybe is one other place.
40:15
Uh but uh that's about it actually.
40:17
Most of things we do in life is conclusions driven including physics and science.
40:20
You I mean they want to know you know where is this asteroid going to go?
40:23
What was what what is the weather going to be tomorrow?
40:25
Um but um Bathe
40:28
also has this other direction
40:29
of of going from the uh the axioms.
40:32
What do you think there is this tension in physics between theory and experiment? Mhm.
40:37
What do you think is the more powerful way of discovering
40:39
truly novel ideas about reality?
40:42
Well, you need both top down and bottom up.
40:44
Um yeah, it's it's a real interaction between all these things.
40:47
So over time the observations
40:49
and the theory and the modeling should both get closer to reality.
40:53
But initially and it is I mean this is
40:57
um this is always the case.
40:58
You know they're always far apart to begin with.
41:00
Um but you need one to figure out
41:03
where to push the other you know.
41:04
So um if your model is predicting anomalies
41:07
um that are not picked up by experiment
41:09
that tells experimenters where to look
41:11
you know um to to to to
41:13
find more data to refine the models.
41:16
Um yeah so it it it goes it goes back and forth.
41:19
Um within mathematics itself there's there's also a theory and experimental component.
41:24
It's just that until very recently
41:26
theory has dominated almost completely like 99% of mathematics is theoretical mathematics
41:31
and there's a very tiny amount of experimental mathematics.
41:34
Um I mean people do do it you know like if they want to
41:38
study prime numbers or whatever they can just generate large data sets and with
41:41
a so once we had computers
41:43
um we be to do it a little bit.
41:45
Um although even before
41:47
well like Gaus for example
41:49
he discovered he conjectured the most basic theorem in in number theory to call
41:52
the prime number theorem
41:53
which predicts how many primes that up to a million up to a trillion.
41:56
It's not an obvious question
41:58
and basically what he did was that he computed
42:01
I mean mostly um by himself but also hired human computers
42:06
um people who whose professional job it was to do arithmetic
42:09
um to compute the first 100,000
42:11
tribes or something and made tables and made a prediction
42:14
um that was an early example of experimental
42:18
um but until very recently it was not
42:21
um yeah I mean theoretical mathematics was just much more successful I mean because
42:25
doing complicated mathematical computations
42:27
is uh was just not not feasible until very recently.
42:31
Uh and even nowadays, you know, even though we have powerful computers, only some
42:34
mathematical things can be um explored numerically.
42:37
There's something called the comatorial explosion.
42:39
If you want us to study, for example, Zodius
42:41
the you want to study all possible subsets of the numbers 1 to a,000.
42:44
There's only 1,000 numbers.
42:45
How bad could it be?
42:46
It turns out the number of different subsets of of 1 to a,000 is
42:49
2 to the^ 1,000
42:50
which is way bigger than than
42:52
that any computer can currently can can in fact anybody ever will ever um enumerate.
42:57
Um so you have you have to be um there are certain math problems
43:02
that very quickly become just
43:04
intractable to attack by direct brute force computation.
43:07
Uh chess is another um famous example.
43:10
The number of chess positions
43:12
uh we can't get a computer to fully explore.
43:16
But now we have AI
43:17
um um we have tools to explore this space not with 100% guarantees of
43:22
success but with experiment
43:24
you know so like
43:26
um we can empirically
43:27
solve chess now for example
43:30
we have we have
43:31
very very good AIs that that can you know they don't explore every single
43:34
position in in the game tree but they have found some very good approximation
43:38
um and people are using actually these chess engines
43:40
to make uh to do experimental
43:42
chess um that they're revisiting
43:45
old chess theories about, oh, you know, when you this type of opening, you
43:48
know, this is a good, this is a good type of move, this is
43:50
not, and they can use these chess engines to actually refine
43:53
in some case overturn
43:54
um um conventional wisdom about chess.
43:58
And I do hope that uh that mathematics will will
44:01
have a larger experimental component in the future
44:03
perhaps powered by AI.
44:05
We'll of course talk about that but in the case of chess
44:08
and there's a similar thing in mathematics
44:10
that I don't believe it's providing a kind of
44:14
formal explanation of the different positions.
44:17
It's just saying which position is better or not that you can intuit it
44:20
as a human being and then from that we humans can construct
44:24
a theory of the matter.
44:27
You've mentioned the Plato's cave allegory. Mhm.
44:30
So in case people don't know,
44:32
it's where people are observing
44:35
shadows of reality, not reality itself,
44:38
and they believe what they're observing to be reality.
44:41
Is that in some sense what mathematicians
44:43
and maybe all humans are doing is
44:46
um looking at shadows of reality?
44:51
Is it possible for us to truly access reality?
44:55
Well, there these three onlogical things.
44:58
there's actual reality, there's our observations
45:00
and our our models.
45:03
Um, and technically they are distinct and I think they will always be distinct.
45:07
Um, but they can get closer um over time.
45:12
Um, you know, so
45:14
um and the process of getting closer
45:17
often means that you you have to discard your initial intuitions.
45:21
Um so um like astronomy
45:24
provides great examples you know like you know like
45:26
you an initial model of the world is is flat because it looks flat
45:30
you know and um
45:32
and that it's and it's big you know and the rest of the universe
45:34
the skies is not you know like the sun for example looks really tiny
45:37
um and so you start off with a model which is actually really far
45:40
from reality um but it fits kind of the observations that you have um you
45:44
know so you know so things look good you know but but over time
45:47
as you make more and more observations
45:48
bring it closer to to reality Okay.
45:50
Um the model gets dragged along with it and so over time we had
45:53
to realize that the earth was round that it spins.
45:56
It goes around the solar system.
45:57
Solar system goes around the galaxy and so on and so forth.
46:00
And the guys universe is expanding
46:03
the expansion itself expanding
46:04
accelerating and in fact very recently in this year.
46:07
So this uh even the acceleration
46:09
of the universe itself is
46:10
this evidence that this non-constant
46:12
and uh the explanation behind why that is it's catching up.
46:17
Um it's catching up.
46:18
I mean it's still you know the dark matter or dark energy this this kind of thing.
46:22
We have we have a model that sort of explains that fits the data really well.
46:25
It just has a few parameters
46:27
that um you have to specify.
46:29
Um but so you know people say that's fudge factors you know with with
46:32
enough fudge factors you can explain anything.
46:34
Um but uh the mathematical point
46:37
of the model is that um you want to have fewer parameters in your
46:41
model than data points in your observational set.
46:43
So if you have a model with 10 parameters that explains 10 10 observations
46:46
that is a completely useless model.
46:48
It's what's called overfitted.
46:50
But like if you have a model with you know two parameters and it
46:53
explains a trillion observations which is basically
46:56
uh so yeah the the the dark matter model I think has like 14
46:59
parameters and it explains pabytes of data
47:02
um that that that the astronomers have.
47:05
Um you can think of of a theory like one way to think about
47:08
um physical math theory
47:11
theory is it's a compression of of the universe
47:14
um and data compression.
47:15
So you know you have these pabytes of observations
47:18
you'd like to compress it to a model which you can describe in five
47:21
pages and specify a certain number of parameters and if it can fit to
47:25
reasonable accuracy you know almost all of your observations.
47:29
I mean the more compression that you make the better your theory.
47:32
In fact, one of the great surprises of our universe
47:34
and of everything in it is that it's compressible at all.
47:38
It's the unreasonable effectiveness of mathematics.
47:40
Yeah, Einstein had a quote like that.
47:41
The the most incomprehensible
47:43
thing about the universe is that it is comprehensible, right?
47:45
And not just comprehensible.
47:47
You can do an equation like E= MC².
47:49
There is actually a some mathematical
47:51
possible explanation for that.
47:53
Um, so there's this phenomenon in mathematics called universality.
47:56
So many complex systems at the macro scale are coming out of lots of
48:00
tiny interactions at the macro scale
48:02
and normally because of the common form of explosion you would think that
48:05
uh the macros scale equations must be like infinitely exponentially more complicated
48:09
than than the uh the microscale
48:11
ones and they are if you want to solve them completely exactly like if
48:15
you want to model
48:17
um all the atoms in a box of of air
48:20
that's like Avagadro's number is humongous right there's a huge number of particles
48:24
if you actually have to track each one it'll be ridiculous.
48:26
this but certain laws emerge at the microscopic
48:30
scale that almost don't depend on what's going on at the micros scale or
48:33
only depend on a very small number of parameters.
48:35
So if you want to model a gas
48:37
um of you know
48:39
quintilion particles in a box you just need to know it temperature and pressure
48:42
and volume and a few parameters like five or six
48:45
and it models almost everything you
48:48
need need to know about these
48:49
10 to 23 or whatever particles.
48:52
Um so we we have um
48:56
we we don't understand universality
48:58
anywhere near as we would like mathematically
49:00
but there are much simpler toy models
49:02
where we do um have a good understanding of why univers universality occurs.
49:05
Um um most basic one is is the central limit theorem that explains why
49:09
the bell curve shows up everywhere in nature that
49:12
so many things are distributed by what's called a Gaussian distribution famous bell curve.
49:16
There's now even a meme with this curve and even the meme applies
49:20
broadly universality to the meme. Yeah.
49:23
Yes, you can go meta if you like.
49:25
But there are many many
49:26
processes for example you can take lots and lots of independent
49:29
um random variables and average them together
49:31
um uh in in various ways.
49:34
you take a simple average or more complicated average and we can prove in
49:37
various cases that that these these bell curves these gaussians
49:40
emerge and it is a satisfying satisfying explanation.
49:43
Um sometimes they don't.
49:45
Um so so if you have many different inputs and they're all correlated in
49:48
some systemic way then you can get something very far from a bow curve show up.
49:52
Uh and this is also important to know when this system fails.
49:55
So universality is not a
49:57
100% reliable thing to rely on that um um
50:01
the global financial crisis was a a famous example of this.
50:04
Uh people thought that uh um mortgage
50:07
defaults um had this sort of um Gaussian type behavior that that if you
50:12
if you ask if a population of of of uh you know
50:15
100,000 Americans with mortgages
50:18
ask what what proportion of them would default on the mortgages.
50:20
Um if everything was decorated
50:22
it would be an asset bell curve and and like you can you can
50:24
manage risk with options and derivatives and so forth
50:27
and um and it there's a very beautiful theory
50:30
um but if there are systemic shocks
50:32
in the economy uh that can push everybody to default at the same time
50:36
that's very non-gian behavior
50:38
um and uh this wasn't fully accounted for
50:41
in 2008 now I think there's some more awareness that this is systemic risk
50:46
is actually a much bigger issue and
50:49
uh just because the model is pretty
50:51
uh and nice uh it may not match reality. Right.
50:54
So, so the mathematics of working out what models do is really important.
50:59
Um, but um also
51:02
the science of validating when the models
51:04
fit reality and when they don't.
51:06
Um, I mean that you need both.
51:08
Um, and but mathematics
51:10
can help because it it can
51:12
for example these central limit theorems it tells you that if you have certain
51:14
aums like like non-correlation
51:17
that if all the inputs were not correlated to each other
51:19
um then you have this kind of behavior things are fine.
51:22
it it tells you where to look for weaknesses in the model.
51:25
So if you have a mathematical understanding of central limit theorem
51:29
and someone proposes use these Gaussian
51:31
copy or whatever to to model
51:33
um default risk um
51:36
if you're mathematically um trained you would say okay but what if this systemic
51:39
correlation between all your inputs and so then
51:42
then you can ask the economists you know how how how much of a
51:45
risk is that um and then you can you can you can go look for that.
51:48
So there's always this this this
51:50
synergy between science and and mathematics.
51:52
A little bit on the topic of universality. Mhm.
51:56
You're known and celebrated
51:58
for working across an incredible
52:00
breadth of mathematics reminiscent of Hilbert a century ago.
52:03
In fact, the great Fields Medal
52:06
winning mathematician Tim Gow has said that you are
52:10
the closest thing we get to Hilbert.
52:14
He's a colleague of yours. Oh yeah. Good friend.
52:16
But anyway, so you are known for this ability to go both deep and broad in mathematics.
52:22
So you're the perfect person to ask,
52:24
do you think there are threads
52:26
that connect all the disparate areas of mathematics?
52:30
Is there a kind of deep underlying
52:32
structure uh to all of mathematics?
52:36
There's certainly a lot of connecting threads.
52:38
Um and a lot of the progress of mathematics
52:41
has can be represented
52:43
by taking by stories of two fields of mathematics that were previously not connected and finding connections.
52:49
Um an ancient example is
52:52
um geometry and number theory you know.
52:54
So so in the times of the ancient Greeks
52:56
these were considered different subjects.
52:58
Um I mean mathematicians worked on both.
53:00
You know you could
53:02
work both on on geometry most famously but also on numbers.
53:05
Um but they were not really considered related.
53:08
Um I mean a little bit like you know you could say that that
53:12
this length was five times this length because you could take five copies of
53:14
this length and so forth.
53:16
But it wasn't until Deart
53:17
who really realized that who developed
53:20
analytic geometry that you can
53:22
you can parameterize the plane a geometric object by
53:25
um by two real numbers.
53:26
Every point can be
53:27
and so geometric problems can be turned into into problems about numbers.
53:32
Um and the the
53:35
today this feels almost
53:36
trivial like like there's there's there's no content to this like of course
53:40
uh you you know um a plane is xx and y and because that's
53:44
what we teach and it's internalized.
53:46
Um but it was an important
53:48
development that these these two fields were unified.
53:52
Um and this process has just gone on throughout mathematics over and over again.
53:56
algebra and geometry were separated and now we have a student algebraic geometry that
53:59
connects them and over and over again
54:01
and that's certainly the type of mathematics that that I enjoy the most.
54:05
So I think there's sort of different styles to being a mathematician.
54:08
I think hedgehogs and fox
54:10
a fox knows many things a little bit but a hedgehog knows one thing very very well.
54:14
Um and in mathematics
54:15
there's definitely both hedgehogs and foxes.
54:17
Um and then there's people who are
54:19
kind of uh who can play both roles.
54:21
Um and I think like ideal collaboration
54:24
between mathematicians involves a very
54:26
you need some diversity
54:28
like um a fox working with many hedgehogs or or vice versa.
54:32
So yeah but I identify
54:34
mostly as a fox
54:36
certainly I I like
54:38
uh arbitrage somehow you like like
54:41
um learning how one field works learning the tricks of that field and then
54:44
going to another field which
54:46
people don't think is related but I can I can adapt the tricks.
54:49
So see the connections between the fields. Yeah.
54:52
So there are other mathematicians who are far deeper than I am.
54:55
Like who really they're really hedgehogs.
54:57
They they know everything about one field and they're much faster and and and
55:02
more effective in that field.
55:03
But I can I can give them these extra tools.
55:05
I mean you said that you can be both the hedgehog and and the
55:08
fox depending on the context
55:10
depending on the collaboration.
55:11
So what can you if it's at all possible
55:14
speak to the difference between those two ways of thinking about a problem?
55:18
say you're encountering a new problem,
55:20
you know, searching for the connections
55:23
versus like very singular focus.
55:26
I'm much more comfortable with with the uh
55:29
the uh the fox paradigm. Yeah.
55:31
So, um yeah, I I like looking for analogies, narratives.
55:36
Um I I spend a lot of time if there's a result I see
55:40
in one field and I like the result, it's a cool result, but I
55:42
don't like the proof.
55:43
like it uses types of mathematics that I'm not super familiar with.
55:47
Um I often try to reprove it myself using the tools that I favor.
55:52
Um often my proof is worse.
55:54
Um but um by the exercise of doing so
55:58
um I can say oh now I can see what the other proof was trying to do.
56:01
Um and from that I can get some understanding of of the tools that
56:06
are used in in that field.
56:07
So it's very exploratory,
56:09
very doing crazy things in crazy fields and like reinventing the wheel a lot. Yeah.
56:14
Whereas the hedgehog style
56:16
is uh I think much more scholarly,
56:18
you know, you you you're very knowledge based.
56:20
You you you you
56:21
stay up to speed on like all the developments in this field.
56:23
You you know all the history.
56:25
Um you have a very good understanding of of exactly the strengths and weaknesses
56:28
of of each particular uh technique.
56:31
Um yeah uh I think you you rely a lot more on sort of
56:35
calculation than sort of trying to find narratives.
56:38
Um so yeah I mean I can do that too but uh there are
56:42
other people who are extremely good at that.
56:44
Let's step back and
56:45
uh uh maybe look at the
56:48
the a bit of a
56:50
romanticized version of mathematics. Mhm.
56:53
So, uh I think you've said that early on in your life,
56:58
uh math was more like a puzzle solving activity when you were uh young.
57:03
When did you first encounter a problem
57:05
or proof where you realize math can
57:08
have a kind of elegance and beauty to it?
57:14
That's a good question.
57:15
Um when I came to graduate school uh in Princeton,
57:18
um so John Conway was there at the time.
57:20
He he passed away a few years ago.
57:22
But uh I remember one of the very first research talks I I went
57:25
to was a talk by Conway on what he called extreme proof.
57:28
So Conway had just had this this amazing way of of thinking about all
57:31
kinds of things in in a way that you would normally think of.
57:34
So um he thought of proofs themselves as occupying some sort of space, you know.
57:38
So, so um if you want to prove
57:40
something, let's say that there's infinitely many primes, okay, you avoid different proofs, but
57:44
you could you could rank them in different axes like some proofs are elegant,
57:47
some are long, some proofs are are
57:49
um elementary and so forth.
57:51
Um and so there's this cloud.
57:53
So the space of all proofs
57:54
itself has some sort of shape.
57:57
Um and so he was interested in in extreme points of this shape like
58:01
out of all all these proofs what is one that is the shortest at
58:04
the the extent of every everything else or or the most elementary or or whatever.
58:08
Um and so he gave some examples of well-known
58:12
theorems and then he would give what he thought was was the extreme proof
58:15
um in these different aspects.
58:17
Um and I I just found that really eye opening
58:20
um that that um you know
58:23
it's not just getting a proof for a result was interesting but
58:27
but once you have that proof you know trying to to
58:30
uh to optimize it in various ways.
58:33
Um that that proof
58:35
um uh proofing itself had some craftsmanship to it.
58:39
Um it it certainly informed my writing style.
58:42
Um but you know like when you do your your math assignments and as
58:45
undergraduate your homework and so forth, you you're sort of encouraged to just write
58:49
down any proof that works, okay, and hand it in and get a get
58:52
as long as it gets a tick mark, you you move on.
58:54
Um but if you want your your
58:57
results to actually be influential and be read by people, um it can't just be correct.
59:01
It should also um
59:03
be a pleasure to read, you know, um motivated
59:06
um be adaptable to to generalize to other um things.
59:09
Um it's the same in many other disciplines like like coding.
59:12
It's a there's a lot of analogies between math and coding.
59:15
I like analogies if you haven't noticed.
59:17
Um but um you know like you can code something spaghetti code that works
59:21
for a certain task and it's quick and dirty and it works.
59:25
But uh there's lots of good principles for for
59:27
um writing code well so that other people can use it build upon it
59:31
and so on and has fewer bugs and whatever.
59:33
Um and there's similar things with mathemat mathematics.
59:37
So yeah the first of all there's so many beautiful things there and and
59:42
is one of the great minds
59:44
uh in mathematics ever and computer science.
59:47
Uh just even considering the space of proofs. Yeah.
59:50
and saying, "Okay, what does this space look like
59:54
and what are the extremes?"
59:56
Uh, like you mentioned, coding as an analogy is interesting
59:59
because there's also this activity called the code golf. Oh, yeah. Yeah. Yeah.
60:02
Which I also find beautiful and fun
60:06
where people use different programming languages to try to write the shortest possible program
60:10
that accomplishes a particular tasks.
60:12
Then I believe there's even competitions on this. Yeah.
60:15
And uh it's also a nice way to stress test
60:19
not just the sort of the programs or in this case the proofs but
60:25
also the different languages
60:27
maybe that's the different notation
60:28
or whatever to use to to accomplish a different task.
60:31
Yeah, you learn a lot.
60:32
I mean it may seem like a frivolous exercise
60:34
but it can generate
60:36
all these insights which if you didn't have this artificial
60:39
um objective to to to
60:41
pursue you might not see.
60:43
What to you is the most beautiful
60:45
or elegant equation in mathematics?
60:48
I mean one of the things that people often look to in in
60:51
beauty is the simplicity.
60:53
So if you look at E=
60:55
MC² so when when a few concepts
60:58
come together that's why the oiler
61:00
identity is often considered
61:02
uh the most beautiful equation in mathematics.
61:05
Do you do you find beauty in that one and the oil identity? Yeah.
61:08
Well, as I said, I mean, what I find most appealing is is connections
61:11
between different things that
61:13
um so the if
61:15
ei= minus one um
61:17
so yeah people oh uses all the fundamental constants okay that that's I mean
61:21
that's cute um but but to me
61:24
so the exponential function was interested by oil to measure exponential growth you know
61:28
so compound interest or decay
61:30
anything which is continuously growing continuously decreasing
61:33
growth and decay or dilation
61:35
or contraction is modeled by the exponential function
61:38
Um whereas pi uh comes around from circles and rotation right if you want
61:42
to rotate a needle for example
61:44
180° you need to rotate by pi radians
61:46
and i complex numbers represents the swing between imagine axis of a 90°
61:51
rotation so a change in direction so
61:54
the x function represents
61:56
growth and decay in the direction where you really are
61:59
um when you stick an i in the exponential
62:02
it now it's it's instead of motion in the same direction
62:05
as your current position it's the motion has right angles to composition.
62:09
So rotation um and then so e e pi equ= minus 1 tells you
62:13
that if you rotate
62:15
for time pi you end up at the other direction.
62:17
So it unifies geometry
62:19
through dilation and exponential growth or dynamics
62:22
through this act of of complexification
62:24
rotation by by i.
62:25
So it connects together
62:26
all these tools mathematics. Yeah. Yeah.
62:29
dynamic structure and complex and complex and um the complex numbers they all
62:33
considered almost yeah they were all next door neighbors in mathematics
62:36
because of this identity.
62:37
Do do you think the thing you mentioned is cute the the the
62:40
collision of notations from these disperate
62:44
Um it's just a frivolous
62:46
side effect or do you think there is legitimate
62:48
like value in when the notation
62:50
all the our old friends come together night?
62:54
Well, it's it's it's
62:55
confirmation that you have the right concepts.
62:57
Um so when you first study anything
63:00
um you you have to measure things and give them names.
63:03
Um and initially sometimes your because your your model is again too far off
63:08
from reality you give the wrong things the best names
63:11
and you only find out later what's what's really important physicists
63:15
can do this sometimes I mean but it turns out okay so actually with
63:18
physics okay so E= MC²
63:20
okay so one of the the big things was the E right so
63:24
when when Aristotle first came up with his laws of of motion and then
63:27
and then um Galileo or Newton and so forth
63:30
you know they saw the things they could they could measure they could measure
63:32
mass and acceleration and force and so forth and so Newtonian mechanics for example
63:37
F= ma was the famous
63:39
Newton second law of motion so those were the the primary objects so they
63:42
gave them the central building in the theory
63:44
it was only later after people started analyzing
63:47
these equations that there always seemed to be these quantities that were conserved
63:50
um so momentum and energy
63:53
um uh and it's not obvious
63:56
that things happen energy like it's not something you can directly measure the same
63:59
way you can measure mass and and and velocity
64:01
so forth but over time people realize is that this was actually a really fundamental concept.
64:05
Hamilton eventually in 19th century reformulated
64:08
Newton's laws of physics into what's called Hamiltonian
64:10
mechanics where the energy which is now called the Hamiltonian
64:13
was the dominant object
64:15
once you know how to measure the Hamiltonian of any system.
64:18
You can describe completely the dynamics like what happens to to all the states
64:21
like it's um it it really was a central
64:24
actor which was not obvious initially.
64:27
Um and this uh helped actually
64:30
uh this change of perspective really helped when quantum mechanics came along.
64:34
Uh because um the early
64:37
physicists who studied quantum mechanics, they had a lot of trouble
64:40
trying to adapt their Newtonian
64:42
thinking because everything was a particle and so forth to to to quantum mechanics,
64:47
you know, because I think because it was a wave.
64:48
It just looked really really weird.
64:50
Um like you ask what is the quantum version of F equals MA?
64:53
And it's really really hard to to give an answer to that.
64:56
Um but it turns out that the Hamiltonian
64:58
which was so um secretly
65:00
behind the scenes in classical mechanics
65:03
also is the key
65:05
uh object in um um in quantum mechanics that there's there's also an object called Hamiltonian.
65:09
It's a different type of object.
65:10
It's what's called an operator rather than than a function.
65:12
But um and um but again once you specify it you specify the entire dynamics.
65:17
So there's something called Shingers equation
65:18
that tells you exactly how quantum systems evolve once you have a Hamiltonian.
65:23
So side by side they look completely different objects you know like so one
65:27
involves particles one involves waves
65:29
and so forth but with this centrality
65:31
you could start actually transferring
65:33
a lot of intuition and facts from classical mechanics to quantum
65:37
For example, in classical mechanics, there's this thing called ner's theorem.
65:40
Every time there's a symmetry in a physical system, there is a conservation law.
65:44
So the laws of physics are translation invariant.
65:46
Like if I move 10 steps to the left, I experience the same laws
65:48
of physics as if I was here.
65:50
And that corresponds to conservation momentum.
65:53
Um if I turn around by by some angle
65:56
again, I experience the same laws of physics.
65:57
This corresponds to conservation angular momentum.
66:00
If I wait for 10 minutes,
66:01
um I still have the same laws of physics.
66:03
Um so this time translation variance.
66:05
this corresponds to the low conservation of energy.
66:07
Um, so there's this fundamental connection between symmetry and conservation.
66:12
Um, and that's also true in quantum mechanics.
66:14
Even though the equations are completely different, but because they're both coming from the
66:18
Hamiltonian, the Hamiltonian controls everything.
66:20
Um, every time the Hamiltonian has a symmetry,
66:22
the equations will will have a conservation law.
66:24
Um, so it's it's it's it's
66:27
once you have the right language,
66:29
it actually makes things um
66:30
a lot a lot cleaner.
66:32
One of the problems why we can't unify quantum mechanics and general relativity yet we
66:36
haven't figured out what the fundamental objects are like for example
66:39
we have to give up the notion of space and time being these almost
66:41
uklidian type spaces and there has to be
66:44
um you know and you know we kind of know that at very tiny
66:48
scales um there's going to be quite fluctuations
66:50
of space space-time foam
66:52
um and trying to to use cartigian coord xyz
66:55
is going to be it's it's just it's it's a non-starter
66:57
but we don't know how to
66:59
what to replace it with
67:01
um We don't actually have the mathematical
67:04
um um concepts the analog Hamiltonian
67:07
that sort of organized everything.
67:09
Does your gut say that there is a theory of everything.
67:11
So this is even possible
67:13
to unify to find this language
67:16
that unifies general relativity and quantum mechanics. I believe so.
67:20
I mean the history of physics has been out of unification
67:23
much like mathematics um over the years.
67:25
You know electricity and magnetism
67:26
were separate theories and then Maxwell unified them.
67:28
you know, Newton unified the the motions of the heavens with the motions on
67:32
of objects on the earth and so forth.
67:34
So, it should happen.
67:36
It's just that the um
67:38
u again to go back to this model of the observations and and theory.
67:42
Part of our problem is that physics is a victim's own success
67:44
that our two big theories of of of
67:47
physics general relativity and quantum mechanics are so are so good now that together
67:52
they cover 99.9% of sort of all the observations we can make.
67:56
Um, and you have to like either go to extremely insane particle accelerations
67:59
or or the early universe or or or things that are really hard to
68:02
measure um in order to get any deviation
68:05
from either of these two theories
68:07
to the point where you can actually figure out how to how to combine them together.
68:11
Um, but I have faith that we, you know, we've we've
68:14
been doing this for centuries and we've made progress before.
68:17
There's no reason why we should stop.
68:18
Do you think it will be a mathematician
68:21
that develops uh theory of everything?
68:24
What often happens is that
68:26
when the physicists need
68:28
uh um some of mathematics, there's often some precursor
68:32
that the mathematicians um worked out earlier.
68:35
So when Einstein started realizing that space was curved,
68:38
he went to some mathematician and asked
68:41
is there is there some theory of curved space that the mathematicians already came
68:44
up with that could be useful and he said oh yeah there's I think
68:47
Reman came up with something
68:49
um and so yeah Reman had developed
68:51
remmaning geometry um which is precisely
68:53
you know a theory of spaces that occurred in various general ways which
68:58
turned out to be almost exactly what was needed um for Einstein's theory.
69:01
This is going back to Dwick's unreasonable effectiveness of mathematics.
69:04
I think the theories that work well to explain the universe
69:07
tend to also involve the same mathematical objects that work well to solve mathematical problems.
69:12
Ultimately, they're just sort of both ways of organizing
69:14
data um in in in useful ways.
69:17
It just feels like you might need to go some weird
69:20
land that's very hard to
69:22
to intuit it like you know you have like string theory.
69:25
Yeah, that that's that was that was a leading candidate for many decades.
69:27
It's I think it's slowly
69:29
falling out of fashion because it's it's not matching experiment.
69:33
So one of the big challenges of course like you said
69:36
is experiment is very tough. Yes.
69:38
Because of the how effective both theories are.
69:42
But the other is like
69:44
just you know you're talking about
69:47
you're not just deviating from spaceime.
69:49
You're going into like some crazy number of dimensions.
69:52
You're doing all kinds of weird stuff that
69:54
to us we've gone so far from this flat earth that we started at
69:58
like now we're just it's it's very hard to use our limited
70:03
ape descendants of uh
70:05
uh cognition to intuitit
70:08
what that reality really is like.
70:10
This is why analogies are so important, you know.
70:12
I mean, so yeah,
70:13
the round earth is not intuitive
70:15
because we're stuck on it, but you know, but
70:18
you know, but round objects in general, we have pretty good intuition over
70:21
uh and we have intuition about light works and so forth.
70:23
And like it's it's actually a good exercise to actually work out how eclipses
70:26
and phases of of the sun and the moon and so forth can be
70:29
really easily explained by by by by
70:32
round earth and round moon,
70:34
you know, um and models.
70:36
Um and and you can just take you know a basketball and a golf
70:39
ball and and and a light source and actually
70:42
do these things yourself.
70:43
Um so the intuition is there.
70:45
Um but yeah you have to transfer it.
70:47
That is a big leap intellectually
70:49
for us to go from flat to round earth
70:51
because you know our life is mostly lived in flat land. Yeah.
70:55
To load that information and we all like take it for granted.
70:58
We take so many things for granted
71:00
because science has established a lot of evidence for this kind of thing.
71:04
But you know, we're on a round rock. Yeah. Flying through space. Yeah. Yeah.
71:10
And it's a big leap and you have to take a chain of those
71:13
leaps the more and more and more we progress. Right. Yeah.
71:16
So modern science is maybe again a victim of its own success is that
71:20
you know in order to be more accurate it has to to move further
71:23
and further away from your initial intuition.
71:24
And so um for someone who hasn't gone through the whole process of science
71:28
education it looks more more suspicious because of that.
71:31
So, you know, we we need we need more grounding.
71:34
I mean, I I think um I mean, you know, there are there are
71:36
scientists who do excellent outreach.
71:38
Um but there's this there this there's there there's lots of science things that you
71:41
can do at home.
71:42
There's lots of YouTube videos.
71:43
I did a YouTube video recent of Grant Sanderson.
71:45
We talked about this earlier that uh you know how the ancient Greeks were
71:49
able to measure things like the distance to the moon, distance to the earth,
71:51
and you know, using
71:52
techniques that you you could also replicate yourself.
71:55
Um it doesn't all have to be like fancy
71:57
space telescopes and and very intimidating mathematics.
72:01
Yeah, that's uh I highly recommend that.
72:03
I believe you give a lecture and you also
72:05
did an incredible video with Grant.
72:07
It's a beautiful experience to try to put yourself in the mind of a
72:10
person from that time. Mhm.
72:13
Shrouded in mystery, right?
72:15
You know, you're like on this planet, you don't know the shape of it,
72:19
the size of it.
72:20
You see some stars, you see some you see some things and you try
72:23
to like localize yourself in this world. Yeah. Yeah.
72:25
And try to make some kind of general statements about distance to places.
72:29
Change your perspective is really important.
72:31
You say travel bordens the mind.
72:32
This is intellectual travel.
72:33
You know put yourself in the mind of the ancient Greeks or or
72:36
some other person some other time period.
72:39
Make hypothesis spherical cows
72:40
whatever you know speculate.
72:43
Um and you know this is this is what mathematicians
72:46
do and some what artists do actually.
72:48
It's just incredible that given the extreme constraints,
72:51
you could still say very powerful things.
72:53
That's why it's inspiring looking back in history.
72:56
How much can be
72:57
figured out right when you don't have much
73:00
to figure out stuff like if you propose axioms
73:02
then the mathematics lets you follow those a to their conclusions and sometimes you
73:06
can get quite a quite a long way from
73:08
you know initial hypothesis.
73:10
If we can stay in the land of the weird, you mentioned general relativity.
73:13
You've uh you've contributed
73:15
uh to the mathematical
73:16
understanding of Einstein's field equations.
73:18
Can you explain this work
73:20
and from a sort of mathematical
73:22
standpoint uh what aspects
73:26
of general relativity are intriguing
73:28
to you, challenging to you?
73:31
I have worked on some equations.
73:33
There's something called the the wave maps equation or the sigma field model which
73:37
is not quite the equation of
73:39
space-time gravity itself but of certain fields that might
73:43
exist on top of spaceime.
73:45
Um so Einstein's equations of relativity
73:48
just describes space and time itself.
73:50
Um but then there's other fields that live on top of that.
73:52
There's the electromagnetic field.
73:54
Um there's control fields
73:56
and there's this whole hierarchy of different equations
73:59
of which Einstein is considered one of the most nonlinear and difficult.
74:02
But relatively low in the hierarchy was this thing called the wave maps equation.
74:06
So it's a wave which at any given point
74:08
uh is fixed to be like on a sphere.
74:11
Um so uh I can think of a bunch of arrows
74:14
in space and time and and the arrows pointing in in different directions.
74:18
Um but they propagate like waves.
74:20
If you wiggle an arrow it was it will propagate
74:22
and make all the arrows move kind of like
74:25
sheets of wheat in the wheat field.
74:27
And I was interested in the global regularity problem again for this question like
74:31
is it possible for for all the energy here to collect at a point.
74:35
So the equation I considered was actually what's called a critical equation where it's
74:38
actually the behavior at all scales is roughly the same.
74:41
Um and I was able barely to show that
74:44
um that you couldn't actually force a scenario where all the energy concentrated at
74:48
one point that the energy had to disperse a little bit and the moment
74:51
it dis little bit it it would it would stay regular. Yeah.
74:54
This was back in 2000.
74:56
That was part of why I got interested in narrows afterwards actually. Yeah.
74:59
So I developed some techniques to
75:01
um solve that problem.
75:02
So part of it is it was um this problem is really nonlinear
75:06
uh because of the curvature of the sphere.
75:08
Um this there was a certain nonlinear effect which
75:11
was a non-perturbative effect.
75:12
It was when you sort of looked at it normally it looked larger than
75:15
the linear effects of the wave equation.
75:18
Um and so it was hard to to keep things under control
75:21
even when the energy was small.
75:23
But I developed what's called a gauge transformation.
75:25
So the equation is kind of like an evolution of of of
75:28
heaves of wheat and and they're all bending back and forth and so there's
75:31
a lot of motion.
75:33
Um but like if you imagine like stabilizing the flow by attaching little cameras
75:37
at different points in space which are trying to move in a way that
75:40
captures most of the motion
75:42
and under this stabilized
75:44
flow the flow becomes a lot more linear.
75:46
I discovered a way to
75:48
transform the the equation
75:50
to reduce the amount of of nonlinear effects.
75:52
Um and then I was able to to to to solve the equation.
75:56
I found this transformation
75:57
while visiting my aunt in Australia
75:59
and I was trying to understand the dynamics of all these fields and I
76:02
I couldn't do it with pen and paper.
76:04
Um and I had not enough facility of computers to do any computer simulations.
76:08
So I ended up
76:09
closing my eyes being on on the floor and just imagining myself to actually
76:12
be this vector field and rolling around to try to to see how to
76:16
change coordinates in such a way that somehow things in all directions would behave
76:20
in a reasonably linear fashion.
76:22
And yeah, my aunt walked in on me while I was doing that and
76:25
she was asking what do I what am I doing doing this?
76:28
It's complicated is the answer. Yeah. Yeah.
76:30
And you know, okay, fine.
76:31
You know, you're a young man.
76:32
I don't ask questions.
76:34
I I I have to ask about the
76:36
you know um how do you approach solving difficult problems?
76:40
What if it's possible
76:44
to go inside your mind when you're thinking?
76:47
Are you visualizing in your mind the mathematical
76:51
objects symbols maybe what are you visualizing
76:54
in your mind usually when you're thinking
76:57
um a lot of pen and paper
76:58
one thing you pick up as a mathematician is sort of uh I call
77:01
it cheating strategically um
77:04
so u the the beauty of mathematics is that is that you get to
77:07
change the rule change the problem change the rules as you wish
77:10
this you don't get to do this for any other field like you know
77:13
if if you're an engineer and someone says build a bridge over this this
77:17
You can't say I want to build this up bridge over here instead or
77:19
I want to build out of paper in instead of steel.
77:21
Um but a mathematician you can you can do whatever you want.
77:24
Um it's it's like
77:28
trying to solve a computer game where you can there's unlimited cheat codes available.
77:32
Uh and so you know you you can you can set this.
77:35
So there's a dimension that's too large.
77:38
I'll set it to one.
77:38
I'd solve the one dimension problem first.
77:40
So there's a main term and an error term.
77:42
I'm going to make a spherical car assumption.
77:44
I'll assume the error term is zero.
77:45
And so the way you should solve these problems is is not in sort
77:48
of this iron man mode where you make things maximally difficult.
77:51
Um but actually the way you should you should approach
77:55
any reasonable math problem is that you
77:57
if if there are 10 things that are making your life difficult.
78:00
Find a version of the problem that turns off nine of the difficulties but
78:02
only keeps one of them.
78:03
Um and so that
78:05
um and then that just
78:07
so you you you install nine cheats. Okay.
78:09
You install 10 cheats then then the game is trivial.
78:11
You saw nine cheats,
78:12
you solve one problem that that
78:14
that teaches you how how to deal with that particular difficulty
78:16
and then you turn that one off and you turn someone else something else
78:19
else on and then you solve that one and after you you know how
78:22
to solve the 10 problems 10 difficulties separately
78:24
then you have to start merging them a few at a time.
78:27
Um I I as a kid I watched a lot of these Hong Kong action movies.
78:31
Um it's from a culture.
78:34
Um and uh one thing is that every time there was a fight scene,
78:37
you know, so maybe the the hero will get swarmed by a hundred
78:40
bad guy goons or whatever.
78:42
But it would always be choreographed so that he'd always be only fighting one
78:45
person at a time and then he would defeat that person and move on
78:47
and and because of that he could he could defeat all of them, right?
78:51
But whereas if they had fought a bit more intelligently
78:53
and just swarmed the guy at once, uh it would make for much
78:57
much worse um cinema, but uh
79:00
but they would win.
79:02
Are you usually uh pen and paper?
79:04
Are you working uh with computer and latte?
79:08
I'm mostly pen and paper actually.
79:09
So in my office, I have four giant blackboards.
79:12
Um and sometimes I just have to write everything I know about the problem
79:15
on the four blackboards and then sit my couch and just sort of see the whole thing.
79:20
Is it all symbols like notation or is there some drawings?
79:23
Oh, there's a lot of drawing and a lot of bespoke
79:25
doodles that that only make sense to me.
79:28
Um I mean and and
79:30
the beauty of blackboard is you erase and
79:32
it's it's very organic thing.
79:34
Um I'm beginning to use more and more computers.
79:36
Um partly because AI makes it much easier to do simple coding things that
79:41
you know if I wanted to plot a function
79:43
before which is moderately complicated as some iteration or something you know I'd have
79:46
to to remember how to set up a Python program and and and and
79:48
and how does a for loop work and and and debug it and it would
79:52
take two hours and so forth and and now I can do it in
79:55
10 15 minutes is much
79:57
um yeah I'm using more and more uh computers to do simple explorations.
80:01
Let's talk about AI
80:02
a little bit if we could.
80:04
So um maybe a good entry point is just talking about
80:08
computer assisted proofs in general.
80:10
Can you describe the lean
80:12
formal proof programming language and
80:15
how it can help as a proof assistant and maybe
80:19
how you started using it
80:22
and how uh it has helped you.
80:25
So um we is a computer language
80:28
um much like sort of standard languages like Python and C and so forth
80:32
except that in most languages the focus is on producing executable code.
80:37
Lines of code do things you know they they flip bits or or they
80:40
make a robot move or or they they deliver you text on the internet or something.
80:44
Um so lean is a language that can also do that.
80:47
Uh it can also be run as a standard
80:49
traditional language but it can also produce certificates.
80:52
So a software like like Python might do a computation and give you that
80:56
the answer is seven.
80:57
Okay, that does a sum of 3+ 4 is equal to 7
80:59
but uh lean can produce not just the answer but but a proof that
81:04
how it got the the answer of seven as 3+ 4
81:07
and all the steps
81:08
involved in in so
81:11
it creates these more complicated objects not just statements but statements with proofs attached to them.
81:16
um and um every line of code is just a way of p piecing together
81:20
previous statements to to create new ones.
81:22
So the idea is not new.
81:23
These things are are called proof assistants and so they provide languages for which
81:27
you you can create quite complicated
81:29
um intricate mathematical proofs and
81:32
um they produce these certificates that that give a 100%
81:35
um guarantee that your arguments are correct
81:38
if you trust the compiler of
81:40
but they made the compiler really small
81:42
and you can there are several different compilers available for the same for
81:45
um can you give people some intuition about the the
81:47
difference between writing on pen and paper
81:50
versus using lean programming
81:52
language How hard is it to statement?
81:56
So lean a lot of mathematicians were involved in the design of lean.
81:59
So it's it's designed so that
82:02
individual lines of code
82:03
resemble individual lines of mathematical argument like you might want to introduce a variable.
82:08
You want want to prove a contradiction.
82:09
You you um there are various standard things that you can do and and
82:13
it's it's written so ideally it should like a one correspondence.
82:16
In practice, it isn't because lean is like explaining a proof to an extremely
82:21
pedantic colleague who will will point out okay did you really mean this like
82:25
what what happens if this is zero? Okay.
82:27
Um did you how do you justify this?
82:29
Um so lean has a lot of automation in it um to try to
82:33
to uh to be less annoying.
82:35
Um so for example
82:37
um every mathematical object has to come with a type like if I if
82:39
I talk about X
82:41
is X a real number or
82:42
um a natural number or or a function or something
82:46
um if you write things informally
82:49
um it's up in terms of context
82:51
you say you know um clearly x is equal to
82:54
let x be the sum of y and z and y and z were
82:56
already real numbers so x should also be a real number
82:59
um so lean can do a lot of that um but every so often
83:02
it it says wait a minute
83:03
can you tell me more about what this object is
83:06
uh what type of object it is.
83:07
You see, you have to think more
83:09
um at a philosophical level.
83:11
Well, not just sort of computations
83:13
you're doing, but sort of what each object actually
83:15
um is in some sense.
83:17
Is he using something like LLMs
83:19
to do uh the type inference or like you mention the real number?
83:23
It's it's using much more traditional what's called good old fashioned AI.
83:26
Yeah, you can represent all these things as trees and there's always algorithm to
83:29
match one tree to another tree.
83:30
So it's actually doable to figure out if something
83:33
is a a real number or a natural number. Yeah.
83:36
Every object sort of comes with a history of where it came from and
83:39
you can you can kind of trace. Oh, I see.
83:41
Um yeah, so it's it's designed for reliability.
83:44
So uh modern AIs are not used in
83:47
it's a disjoint technology.
83:48
People are beginning to use AIS on top of lean.
83:50
So when a mathematician tries to program
83:53
um a proof in lean
83:54
um often there's a step okay now I want to use
83:57
um the fundamental thing of calculus say okay to do the next step
84:00
so the lean developers have built this this massive project called methal liib
84:05
a collection of tens of thousands of useful facts
84:07
about mathematical objects and somewhere in there is the fundamental theme of calculus
84:12
but you need to find it so a lot the bottleneck now is actually
84:15
lema search you know there's a tool that that you know is
84:18
in there somewhere and you need to find it um and so you can
84:22
there are various search engines specialized for math loop that you can do um
84:25
but there's now these large language models
84:27
that you can say
84:28
um I need the fundamental
84:29
calculus at this point and it say okay uh um uh for example um
84:32
when I code I have GitHub copilot
84:34
installed as a plugin to my IDE
84:37
and it scans my text and it sees what I need says you know
84:41
I might even type here okay now I need to use the final thing
84:43
with calculus okay and then it might suggest okay try this and like maybe
84:47
25% of the time it works exactly and then another
84:50
10 15% of the time it doesn't quite work but it it's close enough
84:53
that I can say oh if I just change it here and here it
84:55
it will work and then like half the time it gives me complete rubbish
84:58
um so but people are beginning to use AI a little bit on top
85:02
um mostly on the level of basically fancy autocomplete
85:06
um but uh you can type half of one line of a proof and
85:09
it will find it will tell you yeah but a fancy especially
85:12
fancy with the sort of capital letter F is uh
85:16
uh removes some of the friction
85:18
mathematician might feel when they move from pen and paper to formalizing. Yes. Yeah.
85:24
So, right now I estimate that the effort time and effort taken to formalize
85:27
a proof is about 10 times the amount taken to to write it out. Yeah.
85:31
So, it's doable, but
85:33
uh you don't it's it's annoying.
85:36
But doesn't it like kill the whole vibe of being a mathematician? Yeah.
85:39
So, I mean having a pedantic coworker, right? Yeah.
85:43
If if that was the only aspect of it. Okay. But um Okay.
85:46
there there are some there's some case it was actually more pleasant to do things formally.
85:50
So there was there was a theorem I formalized and there was a certain
85:52
constant 12 um that that came out at um in the final statement and
85:56
so this 12 had to be carried all through the proof
85:59
um and like everything had to be checked that it goes all the
86:02
all these other numbers had to be consistent with this final number 12
86:05
and so we wrote a paper through this theorem with this number 12 and
86:08
then a few weeks later someone said oh we can actually improve this 12
86:10
to an 11 by reworking
86:12
some of these steps
86:13
and when this happens with pen and paper um like every time you change
86:16
a parameter you have to check line by line that every single line of
86:19
your proof still works and there can be subtle things that you didn't quite realize.
86:23
Some properties on the number 12 that you didn't even realize that you were taking advantage of.
86:26
So a proof can break down at a subtle place.
86:28
Um so we had formalized the proof with this constant 12
86:32
and then when this this new paper came out uh we said okay let's
86:34
so that took like 3 weeks to formalize
86:37
and and like 20 people to formalize this this this original proof.
86:40
I said oh but now now let's let's
86:42
um uh uh let's update the 12 to 11.
86:45
And what you can do with lean is that you just in your headline
86:48
theorem you you change a 12 to 11.
86:50
You run the compiler
86:51
and like of the thousands of lines of code you have
86:54
90% of them still work and there's a couple that are lined in red.
86:57
Now I can't justify this these steps but it it immediately isolates which steps
87:00
you need to change
87:01
but you can skip over everything which which works just fine.
87:04
Um, and if you program things correctly,
87:06
um, with sort of good programming practices,
87:08
most of your lines will not be read.
87:10
Um, and there'll just be a few places
87:12
where you, I mean, if if you don't hard code your constants, but you
87:15
sort of, uh, um,
87:17
um, you use smart tactics and so forth.
87:19
Yeah, you can localize
87:21
um, the things you need to change to to a very small
87:23
um, period of time.
87:24
So like within a day or two, we had updated our proof
87:27
to this is very quick process.
87:29
You um, you make a change, there are 10 things now that don't work.
87:33
for each one you make a change and now there's five more things that
87:35
don't work but but the process converges
87:37
much more smoothly than with pen and paper.
87:40
So that's for writing are you able to read it like if somebody else
87:43
sends a proof are you able to like
87:44
how what's what's the uh versus paper and
87:48
yeah so the proofs are longer
87:49
but each individual piece is easier to read.
87:53
So, um, if you take a math paper and you jump to page 27
87:56
and you look at paragraph 6
87:58
and you have a line of of of
88:00
text of math, I often can't read it
88:03
immediately because it assumes various definitions which I have to to go back and
88:07
and maybe 10 pages earlier this was defined
88:10
and this um the proof is scattered all over the place and you basically
88:12
are forced to read fairly sequentially.
88:14
Um, it's it's not like say a novel where like you know in theory
88:18
you could you open up a novel halfway through and start reading.
88:21
there's a lot of context.
88:22
But when a proven lean, if you put your cursor on a line of
88:25
code, every single object there, you can hover over it and it would it
88:28
would say what it is, where it came from,
88:30
where stuff is justified.
88:31
You can trace things back
88:32
much easier than sort of flipping through a math paper.
88:34
So, one thing that lean really enables is actually collaborating on proofs at a
88:39
really atomic scale that you really couldn't do in the past.
88:42
So traditionally with pen and paper
88:44
um when you want to collaborate with another mathematician
88:46
um either you do it as a blackboard where you um you can really
88:49
interact but if you're doing it sort of by email or something
88:52
um basically yeah you have to segment it say I'm going to I'm going
88:55
to finish section three you do section four
88:58
but uh you can't really sort of work on the same thing
89:01
collaboratively at the same time
89:03
but with lean you can be trying to formalize some portion of the proof and
89:06
say I got stuck at line 67
89:08
here I need to prove this thing but it it doesn't quite work here
89:10
is like the three lines of code I'm having trouble with.
89:13
Um, but because all the context is there, someone else can say, "Oh, okay.
89:16
I recognize what you need to do.
89:17
You need to to apply this trick or this tool
89:20
and you can do extremely atomic level conversations.
89:23
So, because of lean, I can collaborate,
89:25
you know, with dozens of people across the world, most of whom I don't
89:28
have never met in person.
89:29
Um, and I may not know actually even whether they're um how reliable they
89:34
are in in in
89:35
their um um in in the process,
89:37
but lean gives me a certificate of of of trust.
89:40
Um, so I can do I can do trustless mathematics.
89:43
So there's so many interesting questions there's.
89:45
So one, you're you're known for
89:48
being a great collaborator.
89:50
So what is the right way to approach
89:54
solving a difficult problem in mathematics?
89:56
When you're collaborating, are you doing a divide and conquer
90:00
type of thing or are you brains are you focusing on a particular part and you're brainstorming?
90:05
There's always a brainstorming process first. Yeah.
90:08
So math research projects sort of by their nature
90:11
when you start you don't really know how to do the problem.
90:14
Um it's not like an engineering project where somehow the theory has been established
90:17
for decades and it's it's implementation is the main difficulty.
90:21
You have to figure out even what is the right path.
90:23
So so this is what I said about about cheating first you know
90:26
um it's like um
90:28
to go back to the bridge building analogy you know so first assume you
90:30
have infinite budget and and like unlimited amounts of of of workforce and so forth.
90:34
Now can you can you build this bridge? Okay. Okay.
90:37
now have infinite budget but only finite workforce right now can you do that
90:40
and so forth um
90:42
so uh I mean of course you know no
90:44
engineer can actually do this like I say they have fixed
90:47
requirements yes there's this sort of jam sessions always at the beginning where
90:50
you try all kinds of crazy things and you you make all these assumptions
90:54
that are unrealistic but you plan to fix later
90:56
um and you try to see if there's even some
91:00
skeleton of an approach that might work
91:01
um and then hopefully that breaks up the problem into
91:05
smaller sub problems which you don't know how to do but then you uh
91:08
you focus on on sub ones and sometimes different collaborators
91:12
are better at at working on on certain things.
91:14
Um so one of my themes I'm known for is a theorem of Ben
91:18
Green which called the green tower theorem.
91:19
Um it's a statement that the primes contain arithmetic progressions of any length.
91:23
So it was a modification of this theoret
91:26
and the way we collaborated was that Ben had already proven a similar result
91:30
for progressions of length three.
91:32
Um he showed that sets like the primes contain lots and lots of progressions of length three.
91:36
Um even and even
91:38
um subsets of the prime certain subsets do
91:40
um but his techniques only worked for
91:43
um for length three progressions.
91:44
They didn't work for longer progressions.
91:46
Um but I had these techniques coming from agotic theory which is something that
91:49
I had been playing with and and uh I knew better than Ben at the time.
91:53
Um and so um if I could justify certain randomness properties of some set
91:58
relating to primes like there there's a certain
92:00
technical condition which if I could
92:03
have it if if Ben could supply me this fact I could I could
92:06
conclude the theorem but I what I asked was a really difficult question in
92:10
number theory which um he said there's no way we can prove this can
92:14
so he said can you
92:15
prove your part of the theorem using a weaker hypothesis that I have a
92:18
chance to prove it and he proposed
92:20
something which he could prove but it was too weak for me
92:22
I can't use this.
92:24
Um, so there's this there was this conversation going back and forth.
92:27
Um, so different cheats to Yeah. Yeah.
92:30
I want to cheat more, he wants to cheat less.
92:32
But eventually we found a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
92:35
a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a property
92:35
which a he could prove and b I could use
92:38
um and then we we could prove our view
92:40
and um yeah so
92:42
there's there's a there all kinds of dynamics
92:44
you know I mean it's
92:46
every every um collaboration has a has a has some story
92:50
no two are the same.
92:51
And then on on the flip side of that like you mentioned with lean
92:54
programming now that's almost like a different story because you can do
92:58
you can create I think you've mentioned a kind of a
93:02
right for a problem and then you can really do a divide and conquer
93:07
with lean where you're
93:09
working on separate parts
93:11
right and they're using the computer system
93:13
proof checker essentially to make sure that everything is correct along the way. Yeah.
93:17
So it makes everything compatible and uh yeah and trustable.
93:20
Um yeah so currently
93:22
only a few mathematical
93:24
projects can be cut up in this way at the current state of the art
93:27
most of the lean activity is on formalizing boos that have already been proven
93:30
by humans a math paper
93:32
basically is a boop a blueprint in a sense it is taking a a
93:36
difficult statement like big theorem and breaking up into
93:38
100 little lemas um
93:41
but often not all written with enough detail that each one can be sort of directly formalized.
93:46
A blueprint is like a really pedantically
93:48
written version of a
93:50
paper where every step
93:51
is explained as to as much detail as as as possible
93:55
and trying to make each step kind of self-contained
93:58
um and or depending on only a very specific number of of previous statements
94:02
that been proven so that each node of this
94:05
blueprint graph that gets generated can be tackled independently
94:08
of of the others
94:09
and you don't even need to know how the whole thing works.
94:11
Um so it's like a modern supply chain you know like if you want
94:14
to create an iPhone or or some other complicated object
94:17
um no one person can can build up um a single object but you
94:20
can a specialist who who just if they're given some widgets from some other
94:24
company they can combine them together to form a slightly bigger widget.
94:27
I think that's a really exciting possibility
94:29
because you can have
94:30
if you can find problems that could be
94:34
broken down this way then you can have you know thousands of contributors right distributed.
94:39
So I told you before about the split between theoretical and experimental mathematics and
94:43
right now most mathematics is theoretical and when you type it it's experimental.
94:46
I think the platform that lean and and other software tools
94:49
so um GitHub and things like that um
94:52
allow they will allow
94:54
experimental mathematics to be to scale up
94:56
um to a much greater degree than we can do now.
94:58
So right now if you want to
95:00
um um do any mathematical exploration
95:04
of some mathematical pattern or something you need some code to write out the
95:07
pattern and I mean sometimes there are some computer algebra packages that help but
95:10
often it's just one mathematician
95:12
coding lots and lots of Python or whatever
95:15
and because coding is such an errorprone activity
95:17
it's not practical to allow other people to collaborate with you on writing modules
95:21
for your code because if one of the modules has a bug in it
95:24
the whole thing is unreliable.
95:26
Um, so it's these are uh so you get these bespoke
95:30
uh spaghetti code that written by not not professional programmers but by mathematicians
95:35
you know and they're clunky and and and
95:37
slow and um and so because of that it's it's hard to to really
95:42
massproduce experimental results um
95:45
but um yeah but I think with lean I mean so I'm already starting
95:50
some projects where we are
95:51
not just experimenting with data but experimenting with proofs.
95:54
So I have this project called the equation theories project.
95:57
Basically we generated about 22 million little problems in abstract algebra.
96:00
Maybe should back up and tell you what what the project is. Okay.
96:03
So abstract algebra studies operations like multiplication
96:06
and addition and the abstract properties. Okay.
96:08
So multiplication for example is commutive.
96:10
X * Y is always Y * X at least for numbers.
96:12
Um and it's also associative.
96:15
X * Y * Z is the same as X * Y * Z.
96:18
Um so um these operations obey some laws
96:22
that don't obey others.
96:23
For example, x * x is not always equal to x.
96:25
So that law is not always true.
96:27
So given any any operation,
96:29
it obeys some laws and not others.
96:31
Um, and so we generated about 4,000 of these possible laws of algebra that
96:36
certain operations can satisfy.
96:37
And our question is which laws imply which other ones?
96:40
Um, so for example,
96:42
does commutivity imply associativity?
96:45
And the answer is no because it turns out you can describe an operation
96:47
which obeys the commitive law but doesn't obey the associative law.
96:49
So by producing an example
96:51
you can you can show that commitivity
96:53
does not imply associativity
96:54
but some other laws do imply other laws by substitution and so forth and
96:58
you can write down some some algebraic proof.
97:00
So we look at all the pairs between these 4,000 laws and this
97:03
22 million of these pairs
97:05
and for each pair we ask does this law imply this um law?
97:09
If so give a give u give a proof.
97:10
If not give a counter example. Mhm.
97:12
Um so 22 million problems
97:14
each one of which you could give to
97:16
like an undergraduate algebra student and they had a decent chance of solving the problem.
97:20
Although there are a few
97:21
of these 22 million there like 100 or so that are really quite hard. Okay.
97:24
But a lot are easy
97:26
and the project was just to to work out to determine the entire graph
97:29
like like which ones imply which other ones.
97:31
That's an incredible project by the way.
97:33
Such a good idea.
97:34
Such a good test of the very thing we've been talking about at a scale that's remarkable. Yeah.
97:38
So it would not have been feasible.
97:39
Yeah, I mean the state-of-the-art
97:41
in the literature was like, you know, 15 equations and sort of how they apply.
97:44
That's sort of at the limit of what a human repentant paper can do.
97:47
So, so you need to scale it up.
97:49
So, you need to crowdsource,
97:51
but you also need to trust
97:52
all the um I mean
97:55
no one person can check 22 million of these proofs.
97:58
You needed to be computerized
98:00
and so it only became possible with with lean.
98:02
Um we were hoping to use a lot of AI as well.
98:05
Um so the project is almost complete.
98:07
Um so of these 22 million
98:09
all but two had been settled.
98:11
Um wow and uh well actually and of those two we have a pen
98:14
and paper proof of the two uh and we we're formalizing it.
98:17
In fact I was this morning I was working on finishing it.
98:21
Um so we're almost done on this um
98:23
incredible is yeah fantastic.
98:25
How many people were able to get about 50
98:27
um which in mathematics is is considered a huge number.
98:30
It's a huge number. That's crazy. Yeah.
98:33
So we kind of have a paper with 50 authors
98:35
uh and a big appendex of who contribute to what.
98:38
Here's an interesting question.
98:39
Now to maybe speak even more generally about it.
98:42
When you have this pool of people,
98:45
is there a way to uh organize
98:47
the contributions by level of expertise of the people of the contributors?
98:51
Now okay, uh I'm asking you a lot of pthead
98:55
questions here, but I I'm imagining a bunch of humans
98:57
and maybe in the future some AIS.
99:00
Can there be like an ELO
99:02
rating type of situation
99:03
where like a gamification of this?
99:07
The beauty of of these lean projects is is that automatically you get all
99:10
this data, you know, so like like everything has to be uploaded for this
99:12
GitHub and GitHub tracks who contributed what.
99:15
Um so you could generate statistics
99:18
from at any at any later point in time.
99:20
You can say oh this person contributed this many this many lines of code or whatever.
99:24
I mean these are very crude metrics.
99:25
Um I would I would definitely not want this to become like you know
99:28
part of your tenure review or something.
99:30
Uh um but um I mean I think already in in in
99:34
enterprise computing right people do use some of these metrics
99:38
as part of of the assessment of of
99:40
performance of a of an employee.
99:42
Um again this is a direction which is a bit scary for academics to go down.
99:46
We we don't like metrics
99:48
so much and yet
99:50
academics use metrics they just use old ones. Number of papers. Yeah. Yeah. It's true.
99:58
It's true that Yeah.
99:58
I mean um it feels like this is a metric
100:01
while flawed is is going in the more in the right direction. Right. Yeah.
100:06
It's an interesting at least it's a very interesting metric. Yeah.
100:09
I think it's interesting to study.
100:10
I mean I I think you can you can do studies of of whether these are better predictors.
100:14
Um there's this problem called good heart's law.
100:16
If a statistic is actually used to incentivize
100:18
performance, it becomes gained.
100:20
Um and then it is no longer a useful measure. Oh, humans always. Yeah. Yeah. I know. It's rational.
100:26
So what we've done for this project is is self-report.
100:29
So um there are actually standard categories
100:32
um from the sciences of what types of contributions people give.
100:35
So there's there's concept and validation
100:37
and resources and and and and
100:39
coding and so forth.
100:40
Um, so we we we there's a standard list of troll or so categories.
100:44
Um, and we just ask each contributor to there's a big matrix of all
100:48
the of all the authors in all the categories just to tick the boxes
100:50
where they think that they contributed.
100:52
Um, and just give a rough idea you know like oh so you did
100:55
some coding and and
100:57
uh and you provided some compute but you didn't do any of the pen
101:00
and paper verification or whatever.
101:02
And I think that that works out traditionally mathematicians
101:05
just order alphabetically by surname.
101:07
So we don't have this tradition as in the sciences of you know lead
101:10
author and second author and so forth like which we're proud of you know
101:13
we make all the authors equal status but it doesn't quite scale to this
101:18
size so a decade ago I was involved in these things called polymath
101:21
projects it was the crowd sourcing mathematics but without the lean component
101:25
so it was limited by you needed a human moderator to actually check that
101:28
all the contributions coming in were actually valid and and this was a huge
101:32
bottleneck actually um but still we had projects that were you know 10 or so.
101:38
But we had decided at the time
101:40
um not to try to decide who did what
101:43
um but to have a single pseudonym.
101:46
So we created this fictional
101:47
character called DHJ Polymath
101:49
in the spirit of Bwaki.
101:50
Baki is is the pseudonym for
101:53
a famous group of mathematicians in the 20th century.
101:56
But um and so the paper was a authored under the pseudonym.
101:58
So none of us got the author credit.
102:00
Um this actually turned out to be
102:03
not so great for a couple of reasons.
102:04
So, so one is that if you actually wanted to
102:07
be considered for tenure or whatever,
102:09
you could not use
102:10
this paper in your
102:12
uh uh as your submitted as one of your publications
102:14
because it wasn't you didn't have the formal author credit.
102:17
Um um but the other thing that we've
102:20
recognized much later is that when people referred to these projects,
102:25
they naturally refer to the most famous person who was involved in the project.
102:28
Oh, so this was Tim Gow's P project.
102:30
This was ter project
102:32
and not mention the the other 19 or whatever people that were involved. Yeah.
102:37
So we're trying something different this time around where
102:39
we have everyone's an author.
102:41
Um but we will have an an appendix with this matrix
102:44
and we'll see how that works.
102:45
I mean uh so both projects are incredible just the fact that you're involved
102:49
in such huge collaborations.
102:50
But I think I saw a talk from Kevin Buzzard about uh the lean
102:54
programming language just a few years ago and he was saying that uh this
102:57
might be the future of mathematics.
103:00
And so it's also exciting that you're embracing
103:02
uh one of the greatest mathematicians
103:05
in in the world embracing this
103:07
what seems like the paving of the future of mathematics.
103:12
Um so I have to ask you here about
103:15
the integration of AI into this whole process.
103:19
So deep mind's alpha proof
103:21
was trained using reinforcement
103:22
learning on both failed and successful formal
103:26
lean proofs of IMO problems.
103:28
So this is sort of
103:30
highlevel high school oh very high level yes very high level high school level mathematics problems.
103:36
What do you think about the system and
103:37
maybe what is the gap between this system
103:40
that is able to prove the high school level problems
103:43
uh versus gradual level uh problems.
103:47
Yeah, the difficulty increases exponentially
103:49
with the the number of steps involved in the proof.
103:52
It's a commentatorial explosion, right?
103:54
So the thing with large language models is is that they make mistakes.
103:58
And so if a proof has got 20 steps
104:00
and your model has a 10% failure rate um at each step
104:03
um of of going in the wrong direction like
104:06
u it's just extremely unlikely to actually
104:08
um reach the end.
104:09
Actually uh just to take a small tangent here
104:13
is how hard is the problem of mapping
104:16
from natural language to the formal program?
104:19
Oh yeah it's extremely hard actually.
104:20
Um natural language you know it's very fault tolerant.
104:24
Um like you can make a few minor grammatical errors and a speaker in
104:26
the second language can get some idea of what you're saying.
104:29
Um yeah but but formal language yeah you if you get one little thing
104:33
wrong um like the whole thing is is is nonsense.
104:37
um even formal to formal is is is very hard.
104:39
There there are different incompatible
104:41
um uh proofist languages.
104:43
Uh there's lean but also coaul and Isabel and so forth and actually even
104:46
converting from a formal language to formal language
104:49
um is is an unsolved basically unsolved problem. That is fascinating. Okay.
104:53
So uh but once you have an informal
104:58
they're using um their RL train model.
105:02
So some something akin to alpha zero that they used to go
105:06
to then try to come up with poos they also have a model I
105:09
believe it's a separate model for geometric
105:11
problems so what impresses you about the system and
105:15
um what do you think is
105:17
the gap yeah we talked earlier about things that are amazing over time become
105:21
kind of normalized um
105:23
so yeah now somehow it's oh of course geometry is a silver problem
105:27
right that's true that's true I mean it's still beautiful
105:29
yeah these are great works it shows what's possible I mean um it's it
105:34
um the approach doesn't scale currently is yeah 3 days of Google's survey
105:38
server time to solve one
105:40
high school math problem.
105:41
This is not a scalable uh prospect.
105:44
Um especially with the exponential
105:46
increase in um as as the complexity um increases.
105:49
We should mention that they got a silver medal performance
105:52
the equivalent of I mean yeah equivalent of a silver
105:55
so first of all they took way more time than was
105:57
allotted um and they had this assistance where where the humans started helped by
106:01
by formalizing um but
106:03
uh also they they're giving us those full marks for the solution
106:06
which I guess is formally verified.
106:08
So I guess that that's that's fair.
106:09
Um yeah um there there are efforts there was there will be a proposal
106:15
at some point to actually have an an AI math olympiate
106:18
where at the same time as the human contestants
106:21
get the the actual
106:23
Olympia um problems AIS will also be given the same problems
106:27
with the same time period
106:29
um and the outputs will have to be graded by the same judges
106:32
um um and which means that will have be written in natural language
106:36
rather than formal language.
106:37
Oh I hope that happens.
106:38
I hope that this IMO it happens.
106:40
I hope I hope next one it won't happen this IMO
106:43
the performance is not good enough in in the time period and and uh
106:47
um but there are smaller competitions
106:49
um there are competitions where the the answer is a is a number rather
106:53
than a long form proof
106:55
um and that's that's
106:57
um AI are actually a lot better at
106:59
um problems where there's a specific numerical answer
107:02
um because it's it's easy to to to
107:05
uh to reinforce do reinforcement learning on it.
107:06
Yeah, you got the right answer, you got the wrong answer.
107:09
It's it's a very clear signal.
107:10
But a long form proof either has to be formal and then
107:14
the lean can give it a thumbs up, thumbs down, or it's informal.
107:17
Um, but then you need a human to grade it
107:19
to tell uh and if you're trying to do
107:22
billions of of reinforcement
107:23
learning um you know um um runs,
107:26
you're not you can't hire enough humans to uh to grade those.
107:30
um it's already hard enough for for the last language
107:32
to do reinforcement learning on on just the regular text that that people get.
107:37
But now if you actually hire people not just give thumbs up, thumbs down,
107:40
but actually check the the output mathematically.
107:43
Yeah, that's too expensive.
107:45
So if we uh just explore this possible future,
107:50
what what what is the thing that humans do that's most special
107:53
in um in mathematics?
107:55
So that you could see AI
107:58
uh not cracking for a while.
108:00
So inventing new theories.
108:02
So coming up with new conjectures
108:04
versus uh proving the conjectures, right?
108:08
Building new abstractions, new representations,
108:11
maybe uh an AI turn style with
108:14
seeing new connections between disparate fields.
108:17
It's a good question.
108:18
Um I think the nature of what mathematicians do over time has changed a lot.
108:22
um you know um so a thousand years ago mathematicians
108:25
had to compute the date of Easter
108:27
uh and there was really complicated
108:29
uh calculations you know but it's all automated been automated for centuries
108:33
we don't need that anymore
108:34
you know they used to navigate to do spherical navigation spherical trigonometry to navigate
108:38
how to get from from
108:39
um the old world to the new or
108:42
very complicated calculations again we've been automated
108:44
um you know even a lot of undergraduate mathematics
108:48
even before AI um like wolf from alpha for example
108:51
It's not a language model, but it can solve a lot of undergraduate level math tasks.
108:55
So on the computational side, verifying
108:57
routine things like having a a problem and
109:00
um and say here's a problem in partial equations.
109:02
Could you solve it using any of the 20 standard techniques?
109:05
Um and they say yes, I've tried all 20 and here are the 100
109:09
different permutations and and here's my results.
109:11
Um and that type of thing I think it will work very well.
109:14
um type of scaling to once you solve one
109:17
problem to to make the AI attack 100 adjacent problems.
109:21
Um the things that
109:23
humans do still Yeah.
109:26
So so where the AI really struggles right now
109:29
um is knowing when it's made a wrong turn.
109:31
Um that it can say, "Oh, I'm going to solve this problem.
109:34
I'm going to split up this problem into
109:36
um into these two cases.
109:37
I'm going to try this technique."
109:39
And um sometimes if you're lucky and it's a simple problem, it's the right
109:43
technique and you solve the problem and sometimes it it will get
109:45
it will have a problem
109:47
it would propose an approach which is just complete nonsense.
109:49
Um and but like it looks like a proof.
109:53
Um so this is one
109:54
annoying thing about LM generated mathematics.
109:58
So um yeah we we we've had human generated mathematics as very low quality
110:02
um uh like you know submissions people who don't have the formal training and so forth.
110:06
But if a human proof is bad, you can tell it's bad pretty quickly.
110:10
It makes really basic mistakes.
110:12
But the AI generated proofs, they can look superficially flawless.
110:17
Uh and that's partly because that's what the reinforcement
110:19
learning has actually trained them to do, right?
110:20
To to make things to to produce text that looks like
110:24
um what is correct, which for many applications is good enough.
110:27
Um uh so the errors often really subtle and then when you spot them, they're really stupid.
110:32
Um like you know
110:34
like no human would have actually made that mistake.
110:35
Yeah, it's actually really frustrating in the programming context because I I program a
110:39
lot and yeah, when a human makes
110:42
when lowquality code, there's something called code smell, right?
110:46
You can you can tell you can tell immediately
110:48
like, okay, there's signs.
110:50
But with with a generate code
110:52
of and then you're right
110:54
eventually you find an obvious
110:56
dumb thing that just looks like good code. Yeah.
111:00
So, um it's very tricky to and frustrating for some reason to Yeah. to work. Yeah.
111:05
So the sense of smell.
111:06
Okay, there you go.
111:07
This is this is one thing that humans have.
111:09
Um and there's a metaphorical
111:11
mathematical smell that uh
111:15
this we it's not clear how to get the AI to duplicate that eventually.
111:19
Um I mean so
111:21
the way um Alpha Zero and so forth make progress on go and and
111:25
chess and so forth is is in some sense they have developed a sense
111:28
of smell for go and chess positions
111:30
you know that that this position is good for white is good for black.
111:33
um they can't initiate why.
111:35
Um but just having that that sense of smell lets them strategize.
111:40
So if AIs gain that ability to sort of a sense of viability of
111:44
certain proof strategies say so so you can say
111:46
I'm going to try to break up this problem into two small subtasks
111:50
and they can say well this looks
111:52
good two tasks look like they're simpler tasks than than your main task and
111:56
they still got a good chance of being true.
111:58
Um so this is good to try or no you've you made the problem
112:00
worse because each of the two sub problems is actually harder than your original
112:04
problem which is actually what normally happens if you try a random
112:07
uh thing to try normally actually it's very easy to transform a problem into even harder problem. Mhm.
112:12
Very rarely do you problem transport a simpler problem.
112:15
Um yeah so if they can pick up a sense of smell then
112:19
they could maybe start
112:21
competing with human level mathematicians.
112:24
So, this is a hard question, but not competing, but collaborating. Yeah.
112:28
If Okay, If I gave you an oracle
112:33
that was able to do some aspect of what you do, and you could
112:36
just collaborate with it. Yeah. Yeah.
112:37
What would that oracle
112:38
What would you like that oracle to be able to do?
112:41
Would you like it to uh maybe be a verifier? Like check Mhm.
112:46
Do the codes like you're Yes.
112:49
uh professor to this is the correct this is a good this is a promising fruitful direction. Yeah. Yeah. Yeah.
112:55
Or or would you like it to
112:58
uh generate possible proofs and then you see which one is the right one?
113:03
Um or would you like it to maybe generate
113:06
different representation different totally different ways of seeing this problem?
113:10
Yeah, I think all of the above.
113:12
Um a lot of it is we don't know how to use these tools
113:15
because it's a paradigm that
113:16
is not um yeah we have not had in the past systems that are
113:22
competent enough to understand complex instructions. Mhm.
113:25
Um that can work at massive scale
113:28
but are also unreliable.
113:30
Uh like it's it's an interesting
113:32
uh bit unreliable in subtle ways while we while providing sufficiently good output.
113:37
Um it's a interesting combination.
113:40
um you know I mean you have you have like graduate students that you
113:43
work with who kind of like this but not at scale
113:47
um you know and and and
113:48
we have previous software tools that
113:50
um can work at scale but but very narrow
113:53
um so we have to figure out how to how to use um
113:57
I mean um so Tim C actually
113:59
imagine he actually foresaw
114:01
like in in 2000
114:02
he was envisioning what mathematics would look like in
114:05
in actually two and a half
114:08
and that's funny yeah He he wrote in his in in his article
114:11
like a a a hypothetical
114:13
conversation between a mathematical assistant of the future
114:16
um and himself you know trying to solve a problem
114:18
and they would have have a conversation that
114:21
sometimes the human would would propose an idea and the AI would would
114:24
evaluate it and sometimes the AI would propose an idea
114:27
um and u and sometimes that computation was required and a would just go
114:30
and say okay I've checked the 100 cases needed here
114:33
or um the first
114:36
you you said this is true for all n I've checked for n up
114:38
to 100 um and it looks good so far or hang on there's a
114:41
problem at n equals 46
114:43
you so just a free form conversation
114:45
where you don't know in advance
114:47
where things are going to go but just based on on
114:50
I think ideas get proposed on both sides calculations get proposed on both sides
114:53
I've had conversations with AI
114:55
where I say okay let's we're going to collaborate to solve this math problem
114:58
and it's a problem that I already know the solution to
115:00
so I I try to prompt it okay so here's the problem I suggest
115:03
using this tool and then you'll find this this lovely argument using a totally
115:06
different tool which eventually goes you know, into the weeds and say, "No, no, no.
115:10
If I using this, okay, and it might start using this and then it'll
115:12
go back to the tool that I wanted to to before."
115:14
Um, and like you have to keep railroading
115:17
it um onto the path you want.
115:18
And like I I could eventually
115:20
force it to give the proof I wanted.
115:22
Um, but it was like hurting cats
115:25
um like and the amount of personal effort I had to take to not
115:28
just sort of prompt it, but also check it output because it like a
115:31
lot of what it looked like was going to work.
115:32
I know there's a problem on online 17
115:34
and basically arguing with it.
115:37
um like it was more exhausting
115:39
than doing it unassisted.
115:41
So like it but that's the current state of the art.
115:44
I wonder if there's
115:45
there's a phase shift that happens
115:47
to where it's no longer
115:49
feels like hurting cats and
115:52
maybe it'll surprise us how quickly that comes.
115:54
I I believe so.
115:55
Um so in formalization
115:57
I I mentioned before that it takes 10 times longer to formalize a proof
116:00
than to write it by hand
116:01
with these modern AI tools is
116:03
and also just better tooling
116:05
um the lean um
116:07
um developers are doing a great job
116:09
adding more and more features and making it user friendly.
116:12
It's going up from 9 to 8 to 7.
116:14
Okay, no big deal.
116:15
But one day it will drop below one.
116:18
Um and that's a phase shift
116:20
because suddenly um it makes sense
116:23
when you write a paper to to write it in lean first
116:27
or through a conversation with AI who is generally
116:29
um on the fly with you
116:31
and it becomes natural for journals to accept
116:34
you know maybe they'll offer
116:35
expedite refereeing you know if if a paper has already been formalized in in
116:39
lean um they'll just ask the referee to comment on on the
116:43
significance of the results and how it connects to literature
116:46
and not worry so much about the correctness.
116:48
um because that's been certified.
116:50
Um papers are getting longer and longer in mathematics and actually it's harder and
116:53
harder to get good refereeing
116:55
for um the really long ones unless they're really important.
116:58
It is actually an issue which and the formalization is coming in at just
117:01
the right time for this to be
117:03
and the easier and easier to guess because of the tooling and all the
117:06
other factors then you're going to see much more
117:08
like math lib will grow potentially exponentially.
117:13
It's a it's a it's a virtuous uh cycle. Okay.
117:16
I mean one facet of this type that happened in the past was the adoption of latte.
117:20
So so latte is this type seting language that all mians use now.
117:23
So in the past people use all kinds of word processors
117:25
and typewriters and whatever but at some point latte became easier to use than
117:30
all other competitors and that people just switched you know within a few years
117:34
like it was just a dramatic um pay shift.
117:37
It's a wild out there question, but what
117:41
what year how far away are we from
117:45
a uh AI system being a collaborator
117:50
on a proof that wins the Fields medal. So that level. Okay.
117:55
Um well, it depends on the level of collaboration.
117:58
I mean, no, like it deserves
117:59
to be to get the Fields Medal.
118:01
like so half and half already like I I can imagine if it was
118:05
a winning paper having
118:07
some AI systems in writing it you know uh just you know like the
118:10
order complete alone is already I I use it like it speeds up my
118:13
my own writing um
118:15
um like you know you you can have a theorem
118:18
you have a proof and the proof has three cases
118:19
and I I write down the proof of the first case and the autocomplete just
118:22
suggests all right now now here's how the proof of second case could work and
118:25
like it was exactly correct that was great saved me like 5 10 minutes
118:28
of uh of typing
118:30
but in that case The AI system doesn't get the Fields medal. No.
118:34
Uh are we talking
118:38
20 years, 50 years, 100 years?
118:41
What do you think? Okay.
118:42
So I I gave a prediction in print.
118:44
So by 2026, which is now next year, um
118:47
there will be math collaborations,
118:50
you know, where the AI,
118:51
so not Fields Medal winning, but but like actual research level math
118:54
like published ideas that
118:56
in part generated by AI.
118:58
Um maybe not the ideas but at least uh some of the computations
119:01
um um the verifications. Yeah.
119:03
I mean has that already happened?
119:05
Has that already happened? Yeah.
119:06
There are there are problems that
119:08
were solved uh by a complicated
119:11
process conversing with AI to propose things and the human goes and tries it
119:15
and the contract doesn't work
119:17
but it might propose a different idea.
119:20
Um it it's it's hard to disentangle exactly.
119:23
Um there are certainly
119:25
math results which could only have been accomplished because there was a math method
119:29
human mathematician and an AI involved.
119:31
Um but it's hard to sort of disentangle credit.
119:36
Um I mean these tools
119:40
they they do not
119:41
uh replicate all the skills needed to do mathematics
119:44
but they can replicate sort of some non-trivial
119:46
percentage of them you know 30 40%.
119:48
they can fill in gaps.
119:50
Um, you know, so,
119:51
uh, coding is is is a is a good example, you know.
119:54
So, I I um
119:56
um it's annoying for me to code in Python.
119:58
I'm not I'm not a native
120:00
um I'm not a professional um programmer.
120:02
Um, but um the with AI that the the
120:06
friction cost of of doing it is is is much reduced.
120:09
Uh so it it fills in that gap for me.
120:11
Um AI is getting quite good at literature review.
120:15
Um I mean there's still a problem with um hallucinating
120:18
you know the references that don't exist.
120:20
Um but this I think is a civil war problem
120:23
if you train in the right way and so forth
120:25
you can you can and um and verify
120:28
um you know using the internet
120:29
um you know um you should in a few years get to the point
120:33
where you you have a
120:35
a lema that you need and uh we say has anyone proven this lema
120:38
before and it will do basically a fancy web search AI assistant and say
120:42
yeah yeah there are these
120:43
six papers where something similar has happened and
120:46
I mean it you can ask it right now and it'll give you six
120:48
papers of which maybe one is is legitimate and relevant.
120:51
One exists but is not relevant and four are hallucinated.
120:54
Um it has a non-zero
120:56
success rate right now, but
120:58
uh it's there's so much garbage.
121:00
Uh so much the signal to noise ratio is so poor that it's it's
121:03
um it's most helpful when you already somewhat know the literature.
121:08
Um and you just need to be prompted to be reminded
121:11
of a paper that was already subconsciously in your memory versus helping you discover
121:15
new you were not even aware of but is the correct citation.
121:19
Yeah, that's yeah, that it can sometimes do.
121:22
But but when it does, it's it's buried in in a list of options
121:25
for which the other that are bad. Yeah.
121:26
I mean, being able to automatically
121:28
generate a related work section that is correct. Yeah.
121:32
That's actually a beautiful thing that might be another phase shift because it assigns credit correctly. Yeah. It does.
121:38
It breaks you out of the silos of Yeah. Yeah. Yeah. thought, you know. Yeah.
121:42
No, there's a big hump to overcome right now.
121:45
I mean, it's it's like self-driving cars, you know.
121:48
the the safety margin has to be really high
121:50
for it to be um
121:52
uh to be feasible.
121:53
So yeah, so there's a last mile problem
121:55
um with a lot of AI applications
121:57
um that uh you know they can develop tools that work 20%
122:01
80% of the time
122:03
but it's still not good enough
122:05
um and in fact even worse than good some ways.
122:08
I mean another way of asking the Fields metal question is
122:11
what year do you think
122:13
you'll wake up and be like real surprised?
122:16
you read the headline, the news of something happened
122:19
that AI did like
122:21
you know real breakthrough
122:23
something it doesn't you know like feels metal
122:25
even hypothesis it could be like really just
122:29
this alpha zero moment with go that kind of thing right
122:32
um yeah this this decade I can I can see it like making a
122:38
between two unrelated two two things that people thought was unrelated
122:42
oh interesting generating a conjecture
122:44
that's a beautiful conjecture Yeah.
122:46
And and actually has a
122:47
real chance of being correct and and and meaningful and um
122:50
because that's actually kind of
122:52
doable I suppose but the word of the data is Yeah.
122:56
No, that would be truly amazing.
122:58
Um the current models struggle a lot.
123:00
I mean so um a version of this is um I mean the physicists
123:03
have a dream of getting the AI to discover new new laws of physics.
123:07
Um you know the the dream is you just feed it all this data. Okay.
123:12
and and this is here's a new patent that we didn't see before
123:15
but it actually even struggle the current state of the art even struggles to discover
123:18
old laws of physics
123:20
um from the data
123:22
uh or if it does
123:23
there's a big concern contamination
123:25
that that it did it only because like somewhere in this training data it
123:28
some new um you know boils law or whatever ball you're trying to to
123:32
to reconstruct um part of it is that we don't have the right type
123:37
of training data for this um
123:38
yeah so for laws of physics like we we don't have like a million
123:41
different universes with a million infant laws of nature.
123:44
Um and um like
123:48
a lot of what we're missing in math is actually the negative space of
123:51
so we have published things of things that people have been able to prove
123:55
um and conjectures that ended up being verified
123:57
um or maybe counter examples produced but
124:00
um we don't have data on on
124:02
things that were proposed and they're kind of a good thing to try
124:05
but then people quickly realized that it was the wrong conjecture and then they
124:09
they said oh but we we should actually change
124:12
um our claim to modify it in this way to actually make it more plausible.
124:15
Um there's this there's a trial and error process
124:17
which is a real integral part of
124:20
human mathematical discovery which
124:21
we don't record cuz it's embarrassing.
124:23
Uh we make mistakes and and we only like to publish our wins.
124:27
Um and uh the AI has no access to this data to train on.
124:32
Um I sometimes joke that basically
124:35
AI has to go through um
124:37
grad school and actually you know go to grad courses, do the assignments, go
124:41
to office hours, make mistakes,
124:43
um get advice on how to correct the mistakes
124:46
and learn from that.
124:47
Let me uh ask you if I may about uh Gregori Pearlman. Mhm.
124:53
You mentioned that you try to be careful in your work
124:56
and not let a problem completely consume you.
124:59
just you really fall in love with the problem and really cannot rest until you solve it.
125:03
But you also hasted to add that sometimes this approach actually can be very successful.
125:08
An example you gave is Gregoria
125:10
Pearlman who proved the
125:11
point conjecture and did so by working alone
125:15
for 7 years with basically
125:18
little contact with the outside world.
125:20
Can you explain this
125:23
one millennial prize problem that's been solved point
125:26
conjecture and maybe speak to the journey that
125:29
Gagora Pearlman's been on. All right.
125:31
So it's it's a question about curb spaces.
125:34
Earth is a good example.
125:35
So you can think of a 2D surface
125:37
in being round could maybe be a Taurus with a hole in it or
125:40
it can have many holes
125:41
and there there are many different topologies
125:44
up priori that that a surface could have.
125:46
um even if you assume that it's it's bounded and and uh and smooth and so forth.
125:50
So we have figured out how to classify surfaces as a first approximation
125:54
everything is determined by something called the genus how many holes it has.
125:56
So a sphere has genus 0 a donut has genus one and so forth
126:00
and one way you can tell these surfaces apart probably the sphere has which
126:03
is called simply connected if you take any closed loop
126:06
on the sphere like a big closed little rope you can contract it
126:10
to a point and while staying on the surface
126:12
and the sphere has this property but a taurus doesn't
126:15
if on a taurus
126:16
and you take a rope that goes around say the the outer diameter
126:19
taurus there's no way it can't get through the hole there's no way to
126:23
to contract it to a point
126:25
so it turns out that the this the sphere is the only
126:28
surface with this property of contractability
126:30
up to like continuous deformationations of the sphere.
126:32
So um things that I want to call topologically
126:35
um equivalent of the sphere.
126:36
So point asked the same question in higher dimensions.
126:39
Um so this it becomes hard to visualize
126:41
because um surface you can think of as embedded in three dimensions but a
126:45
curved free space we don't have good intuition of 4D space to to to
126:49
live and and there are also 3D spaces that can't even fit into four dimensions.
126:53
you need five or six or or higher.
126:55
But anyway, uh mathematically
126:56
you can still pose this question that if you have a bounded
126:59
threedimensional space now which is also has this simply connected property that every loop can be contracted.
127:04
Can you turn it into a threedimensional version of a sphere?
127:07
And so this is the point conjecture.
127:09
Weirdly in higher dimensions four and five it was actually easier.
127:12
So uh it was solved first in higher dimensions.
127:14
There's somehow more room to do the deformation.
127:16
It's easier to to to move things around to a sphere.
127:20
But three was really hard.
127:22
So people tried many approaches.
127:24
There sort of commentary approaches where you chop up the the
127:26
surface into little triangles or or tetrahedra
127:29
and you you just try to argue based on how the faces interact each other.
127:32
Um there were um algebraic approaches.
127:36
There's there's various algebraic objects
127:38
like things called the fundamental group that you can attach to these
127:40
homology and coology and and and
127:42
all these very fancy tools.
127:44
Um they also didn't quite work.
127:46
Um but Richard Hamilton's
127:48
proposed a um partial differential equations approach.
127:52
So you take um you take
127:54
so the problem is that you so you have this object which is so
127:57
secretly is a sphere
127:58
but it's given to you in a in a really
128:01
um in in a weird way.
128:03
So like like think of a ball that's been kind of crumpled up and
128:05
twisted and it's not obvious that it's a ball.
128:08
Um but um like if you if you have some sort of surface which
128:11
is which is a deformed
128:13
sphere, you could um
128:16
u you could for example think of it as a surface of a balloon.
128:18
You could try to inflate it.
128:19
You you blow it up.
128:21
Um and naturally as you fill it with air
128:24
um the the wrinkles will sort of smooth out and it will turn into
128:27
um um a nice round sphere.
128:29
Um unless of course it was a Taurus or something in which case it
128:31
would get stuck at some point like if you instead of Taurus
128:34
it would there'll be a point in the middle when the inner ring shrinks
128:36
to zero you get you get a singularity
128:38
and you can't blow up any further.
128:40
You can't flow any further.
128:41
So he created this flow which is called Richie flow
128:44
which is a way of taking an arbitrary surface or or space and smoothing
128:48
it out to make it rounder and rounder to make it look like a sphere.
128:51
And he wanted to show that that either
128:54
uh this process would give you a sphere or it would create a singularity.
128:57
Um actually very much like how PDS either they have global regularity or finite
129:01
blow like basically it's almost exactly the same thing. It's all connected.
129:05
Um and so and and he showed that for two dimensions two dimensional services
129:09
surfaces um if you started simply connected
129:12
no singularities ever formed
129:13
um you never ran into trouble and you could flow and it would give
129:16
you a sphere and it so he he got a new proof of the
129:19
two dimensional result but by the way that's a beautiful explanation of reach flow
129:22
and its application in this context
129:24
how difficult is the mathematics
129:25
here like for the 2D case is it yeah these are quite sophisticated
129:29
equations on par with the Einstein equations
129:32
slightly simpler but um
129:34
Um yeah but but they were considered
129:37
hard nonlinear equations to solve
129:39
um and there's lots of special tricks in 2D that that that helped
129:42
but in 3D the problem was that uh this equation was actually super critical
129:47
the same problems as Nabia Stokes
129:48
as you blow up um maybe the curvature could get constraint in finer smaller
129:52
smaller regions and it
129:54
um it looked more and more nonlinear
129:56
and things just look worse and worse
129:58
and there could be all kinds of singularities that showed up.
130:01
um some singularities um like if there's these things called neck pinches
130:05
where where the uh the surface sort of creates
130:08
behaves like like a like a a barbell
130:10
and it it pinches at a point.
130:12
Some some singularities are simple enough that you can sort of see what to do next.
130:15
You just make a snip and then you can turn one surface into two
130:17
and evol them separately.
130:18
But there was there was a the
130:20
prospect that there's some really nasty like knotted singularities
130:23
showed up that you you couldn't
130:25
see how to um resolve in any way
130:28
that you couldn't do any surgery to.
130:30
Um so you need to classify all the singularities
130:33
like what are all the possible ways that things can go wrong.
130:35
Um so what Pearlman
130:37
did was first of all he he made the problem he turned the problem
130:40
a super critical problem to a critical problem.
130:42
Um I said before about how um the invention of the of of energy
130:46
the Hamiltonian like really clarified um Newtonian mechanics.
130:51
Um uh so he introduced
130:53
something which is now called permanence reduced volume and permanence entropy.
130:56
He introduced new quantities kind of like energy
130:59
that look the same at every single scale
131:01
and turned the problem into a critical one where the nonlinearities
131:04
actually suddenly looked a lot less scary than they did before.
131:07
Um and then he had to solve he still had to analyze the singularities
131:10
of this critical problem.
131:12
uh and that itself was a problem similar to this wake up thing I
131:14
worked on actually um so on the on the level of difficulty of that.
131:18
So he managed to classify all the singularities
131:20
of this problem and show how to apply surgery to each of these and
131:23
through that was able to to resolve the point Cray conjecture.
131:27
um quite like a lot of really ambitious steps
131:30
um and like like nothing that a large language model today for example could
131:34
I mean um at best
131:36
uh I could imagine
131:37
model proposing this idea as one of hundreds
131:40
of different things to try
131:42
um but the other 99 would be complete dead ends but you'd only find
131:45
out after months of work
131:47
he must have had some
131:48
sense that this was the right track to pursue because
131:51
you know I it takes years to get them from A to B
131:54
so you've done like you said Actually you see even strictly mathematically
131:57
but more broadly in terms of the process he's done
132:03
similarly difficult things what what can you infer from the process he was going
132:08
through because he was doing it alone
132:10
what are some low points in a process like that when you start to
132:13
like you've mentioned hardship
132:15
like uh AI doesn't know
132:17
when it's failing what happens to you you're sitting in your office when you
132:21
realize the thing you did
132:23
for the last few days maybe weeks weeks. Yeah. Is a failure.
132:27
Well, for me, I switch to different problem.
132:29
Uh so, uh as said, I'm I'm a fox.
132:32
I'm not a hedgehog.
132:33
But you legitimately that is a break that you can take is is to
132:36
step away and look at a different problem.
132:37
Yeah, you can modify the problem too.
132:39
Um I mean um yeah, you can ask some cheat if if there's a
132:43
specific thing that's blocking you that this
132:45
um some bad case keeps showing up that that that for which your tool doesn't
132:50
work, you can just assume by fiat this this bad case doesn't occur.
132:53
So you you do some magical thinking
132:56
um for the but but but strategically
132:58
okay for the point to see if the rest of the argument goes through
133:01
um if there's multiple problems
133:03
uh with with with your approach then maybe you just give up okay but
133:06
if this is the only problem that you know but everything else checks out
133:09
then it's still worth fighting
133:11
um so yeah you have to do some some sort of forward reconnaissance
133:15
sometimes to uh you know and that is sometimes
133:18
productive to assume like okay we'll figure it out
133:21
oh yeah yeah eventually um
133:23
Sometimes actually it's even productive to make mistakes.
133:25
So um one of the
133:27
I mean um there was a project which actually
133:30
u we won some prizes for actually four other people.
133:34
Um we worked on this PD problem again actually this blow of regularity type problem.
133:38
Um and it was considered very hard.
133:40
Um Sean Bain who was another field methodist who worked on a special case
133:45
of this but he could not solve the general case.
133:48
Um and we worked on this problem for two months and we found we
133:51
thought we solved it.
133:51
We we had this this cute argument that if everything fit and we were
133:55
excited uh we were planning celebrationally
133:57
um to all get together and have champagne or something.
134:00
Um and we started writing it up.
134:02
Um and one of one of us, not me actually, but another co-author
134:06
said, "Oh, um in this in this lema here, we
134:09
um we have to estimate these 13 terms that that show up in this expansion."
134:13
And we estimate 12 of them, but in our notes, I can't find the
134:15
estimation of the 13th.
134:16
Can you can someone supply that?
134:18
And I said, "Sure, I'll look at this."
134:19
and actually yeah we didn't cover we completely omitted this term and this term
134:23
turned out to be worse than the other 12 terms put together
134:26
um in fact we could not estimate this term
134:28
um and we tried for a few more months and all different permutations
134:31
and there was always this one thing one term that we could not control
134:35
um and so like
134:36
um this was very frustrating
134:39
um but because we had already invested
134:41
months and months of effort into this already
134:43
um we stuck at this we we tried increasingly desperate things and and crazy
134:47
things um and after two is we found an approach which was actually somewhat different
134:52
by quite a bit from our initial
134:53
um strategy which did actually didn't generate these problematic
134:57
terms and and and actually solve the problem.
134:59
So we we solve a problem after 2 years
135:01
but if we hadn't had that initial false dawn of nearly solving a problem
135:05
we would have given up by month two or something and and worked on an easier problem.
135:09
Um yeah if we had known it would take two years
135:12
not sure we would have started the project.
135:15
Yeah sometimes actually having the incorrect
135:17
you know it's like Columbus
135:19
New incorrect version of measurement of the size of the earth.
135:23
He thought he was going to find a new trade route to India
135:26
or at least that was how he sold it in his perspectus.
135:29
I mean it could be that he actually secretly knew but just on the psychological element.
135:35
Do you have like
135:36
emotional or like self-doubt
135:40
that just overwhelms you moments like that?
135:41
You know, because this stuff it feels like
135:44
math is is so
135:48
that like it can break you when you like invest so much yourself in
135:52
the problem and then it turns out wrong.
135:54
You could start to
135:56
similar way chess has broken some people. Yeah.
135:59
Um I I think different
136:02
mathematicians have different levels of emotional investment in what they do.
136:05
I mean I think for some people it's just a job.
136:07
you know you you have a problem and if it doesn't work out you
136:09
you you go on the next one.
136:11
Um yeah so the fact that you can always move on to another problem
136:16
um it reduces the emotional connection.
136:19
I mean there are cases you know so there are certain problems that are
136:23
what I call back diseases where where where
136:26
just latch on to that one problem and they spend
136:28
years and years thinking about nothing but that one problem and
136:32
um you know maybe
136:33
their career suffers and so forth
136:35
but okay this big win this will you know once I
136:38
once I finish this problem I
136:40
will make up for all the years of of of
136:43
lost opportunity but that's that's
136:46
I mean occasionally occasionally it works But I I
136:50
um I really don't recommend it
136:52
for people without the the right fortitude. Yeah.
136:55
So I I've never been super invested in any one problem.
136:58
Um one thing that helps is that we don't need to call our problems in advance.
137:02
Uh um well uh when we do grant proposals
137:06
we s say we we will study this set of problems.
137:08
But even then we don't promise
137:11
definitely by 5 years I will supply a proof of all these things.
137:14
you know, or um
137:15
you promise to make some progress or discover some interesting phenomena.
137:19
Uh and maybe you don't solve the problem, but you find some related problem
137:22
that you you can say something new about and that's that's a much more feasible task.
137:27
But I'm sure for you there's problems like this.
137:29
You have you have
137:31
um made so much progress towards the hardest problems in the history of mathematics.
137:38
So is there is there a problem that just haunts you?
137:42
It sits there in the dark corners, you know, twin prime conjecture, reman hypothesis, global conjecture.
137:48
Twin prime that sounds again.
137:51
So, I mean, the problem is like a reman hypothesis,
137:53
those are so far out of reach.
137:54
Why do you think so? Yeah.
137:56
there's no even viable strate like even if I
137:59
activate all my all the cheats that I know of
138:01
in this problem like it there's just still no way to get me to
138:05
be um like it's
138:07
um I think it needs a breakthrough in another area of mathematics
138:12
to happen first and for someone to recognize that it that would be a
138:15
useful thing to transport into this problem.
138:18
So we we should maybe step back for a little bit and just talk about prime numbers. Okay.
138:23
So they're often referred to as the atoms of mathematics.
138:26
Can you just speak to
138:28
the structure that these
138:29
uh atoms the natural numbers have two basic operations attached to them? Addition and multiplication.
138:35
Um so if you want to generate the natural numbers, you can do one of two things.
138:39
You can just start with one and add one to itself over and over
138:41
again and that generates you the natural numbers.
138:42
So additively they're very easy to generate 1 2 3 4 5.
138:46
Or you can take the prime if you want to generate multiplicatively
138:48
you can take all the prime numbers 2 3 57 and multiply them all together.
138:52
um and together that gives you all the the natural numbers except maybe for one.
138:57
So there these two separate ways of thinking about
138:59
the natural numbers from an additive point of view and point of view.
139:03
Um and separately they're not so bad.
139:05
Um so like any question about
139:08
that only was addition is relatively easy to solve
139:11
and any question that only was multiplication
139:13
is easy to solve.
139:15
Um but what has been frustrating is that you combine the two together.
139:18
Um and suddenly you get this extremely rich I mean we know that there
139:23
are statements in number theory that are actually as undecidable.
139:25
There are certain polomials
139:27
in some number of variables.
139:28
You know is there a solution in the natural numbers and the answer depends
139:30
on on an undecidable
139:32
statement um like like whether
139:34
um the aims of of mathematics are consistent or not.
139:37
Um but um yeah but even this the simplest problems that combine
139:43
something multiplicative such as the primes with something additive such as shifting by two
139:47
uh separately we understand both of them well but if you ask when you
139:50
shift the prime by two do you can you get a how often can
139:54
you get another prime
139:55
we it's been amazingly
139:57
hard to relate the two and we should say that the twin prime conjecture
140:01
is just that it posits that there are infinitely
140:04
many pairs of prime numbers that differ by do. Yes.
140:07
Now the interesting thing is
140:10
that you have been very successful
140:12
at pushing forward the field in answering these complicated
140:15
questions uh of this variety like you mentioned the green tile theorem.
140:21
It proves that prime numbers contain arithmetic
140:23
progressions of any length, right?
140:25
Which is mind-blowing that you can prove something like that, right? Yeah.
140:28
So, what we've realized because of this this this type of of research is that
140:32
there's different patterns have different levels of uh indestructibility.
140:37
Um so, so what makes the twin prime problem hard is that if you
140:41
take all the primes in the world, you know, 3, 5, 7,
140:44
11, so forth, there are some twins in there.
140:46
11 and 13 is a twin prime pair of twin primes and so forth.
140:49
But you could easily if you wanted to
140:52
um redact the primes to get rid of to get rid of the um
140:56
these twins like the twins they show up and they're infinitely many of them
141:00
but they're actually reasonably sparse.
141:01
Um not there there's not I mean initially there's quite a few but once
141:05
you got to the millions the trillions
141:06
they become rarer and rarer
141:08
and you could actually
141:09
just you know if if someone was given access to the database of primes
141:12
you just edit out a a few primes here and there they could make
141:15
the trim pan conjure false by just removing like
141:18
01% of the primes.
141:19
or something um just well well chosen to
141:22
to um to do this.
141:24
And so you could present
141:26
a censored database of the primes which passes all of the statistical tests of the primes.
141:32
You know that it it obeys things like the paralle theorem and and other
141:34
texts about the primes
141:36
but doesn't contain any true primes anymore.
141:38
Um and this is a real obstacle
141:40
for the twin prime conjecture.
141:41
It means that any
141:43
proof strategy to actually find twin primes
141:46
in the ecto primes
141:47
must fail when applied to these slightly edited primes.
141:52
And so it must be some very
141:54
um subtle delicate feature of the primes
141:57
that you can't just get from like like aggregate statistical analysis. Okay.
142:01
So that's all yeah
142:03
on the other hand
142:04
progressions has turned out to be much more robust.
142:07
um like you can take the primes and you can eliminate 99%
142:09
of the primes actually
142:11
you know and you can take take any 99%
142:13
you want and uh it turns out and
142:15
another thing we prove is that you still get arithmetic progressions
142:18
um arithmetic progressions are much you know they're like cockroaches
142:21
of arbitrary length yes
142:24
that's crazy I mean so so this
142:27
for for people who don't know arithmetic progressions is a sequence of numbers that
142:31
differ by some fixed amount
142:32
yeah but it's again like it's infinite monkey type phenomenon
142:35
for any fixed length of your set.
142:37
You don't get arbitrary as progressions.
142:39
You only get quite short progressions.
142:40
But you're saying twin prime is not an infinite monkey phenomena.
142:44
I mean, it's a very subtle monkey.
142:46
It's still an infinite monkey phenomen. Yeah.
142:49
If the primes were really genuinely
142:51
random, if the primes were generated by monkeys,
142:53
um then yes, in fact, the infinite monkey theorem would Oh, but you're saying
142:57
that twin prime is it doesn't
143:01
you can't use the same tools
143:02
like the it doesn't appear random almost.
143:05
Well, we don't know.
143:06
Yeah, we we we we
143:07
believe the prior behave like a random set.
143:10
And so the reason why we care about the trim conjecture is is a
143:13
test case for whether we can genuinely
143:16
confidently say with with 0%
143:17
chance of error that the primes behave like a random set. Okay. Random. Yeah.
143:22
Random versions of the primes we know contain twins.
143:24
Um at least with with 100% probability
143:27
or probably tending to 100% as you go out further and further. Um yeah.
143:32
So the primes we believe that they're random.
143:34
Um the reason why arithmetic progressions are indestructible
143:37
is that regardless of whether you
143:40
looks random or looks
143:41
um structured like periodic
143:43
in both cases um arithmetic regressions appear
143:46
but for different reasons.
143:48
Um and this is basically all the ways in which the
143:50
there are many proofs of of these sort of arithmetic region epithems and they're
143:54
all proven by some sort of dichotomy
143:56
where your set is either structured or random and in both cases
143:59
you can say something and then you put the two together.
144:01
Um but in twin primes if if the primes are random then
144:05
you're happy you win.
144:06
But if your primes are structured they could be structured in in a specific
144:10
way that eliminates the twin the twins.
144:13
Uh and we can't rule out that one conspiracy
144:15
and yet you were able to make a
144:18
as I understand progress on the Kupal version. Right. Yeah.
144:22
So um the one funny thing about conspiracies
144:24
is that any one conspiracy theory is really hard to disprove
144:27
that you know if if you believe the water is won by lizards
144:30
you say here's some evidence that that it it's not run by lizards well
144:33
that that evidence was planted by the lizards. Yeah. Right.
144:36
You may have encountered
144:37
this kind of phenomen. Yeah.
144:38
So like like um a pure like there's there's almost no way to
144:43
um definitively rule out a con and the same is true in mathematics
144:46
that a con is to
144:48
solely devote devoted to learning twin primes you know like it would you have
144:51
to also infiltrate other areas of mathematics to sort of but but like it
144:55
could be made consistent at least as far as we know
144:57
but there's a weird phenomenon that you can make one
145:00
um one conspiracy rule out other conspiracies
145:04
so you know if the if the world is is run by lizardist it
145:06
can't also be run by Right. Right.
145:09
So one unreasonable thing is is is is hard to dispute but but more
145:12
than one there are there are tools.
145:14
Um so yeah so for example we we know there's infinitely many primes that
145:18
are um no two which are um so there infinite pair of primes which
145:22
differ by at most
145:23
um 246 actually is is a is the current.
145:26
So there's like a bound
145:27
yes on the right.
145:29
So like there's twin primes
145:31
this thing called cousin primes that differ by by four.
145:34
Um there's called sexy primes that differ by six.
145:36
Uh, what are sexy primes?
145:38
Primes that differ by six.
145:39
The name is much less the concept is much less exciting than the name suggests. Got it.
145:43
Um, so you can make a conspiracy rule out one of these,
145:47
but like once you have like 50 of them, it turns out that you
145:49
can't rule out all of them at once.
145:51
It just it requires too much
145:53
energy somehow in this conspiracy space.
145:55
How do you do the bound part?
145:57
How do you how do you develop a bound for the difference between the
146:00
prize that okay so um that there's an infinite number of so it's ultimately
146:04
based on what's called the pigeon hole principle
146:06
um so the pigeon hole principle
146:08
uh it's a statement that if you have a number of pigeons and they
146:10
all have to go into into pigeon holes and you have more pigeons than
146:13
pigeon holes then one of the pigeon holes has to have at least two pigeons
146:16
in so there has to be two pigeons that that are close together.
146:19
So for instance if you have 100 numbers and they all range from one
146:22
to a thousand um
146:24
two of them have to be at most 10 apart. Mhm.
146:26
because you can divide up the numbers one to 100 into 100 pigeon holes.
146:30
Let's let's say you have if you have 101 numbers 100 one numbers then
146:33
two of them have to be distance less than 10 apart because two of
146:36
them have to belong to the same pigeon hole.
146:38
So it's a basic
146:40
um basic feature of uh a basic principle in mathematics.
146:44
Um so it doesn't quite work with the primes directly because the primes get
146:47
sparer and sparser as you go out
146:50
that fewer and fewer numbers are prime.
146:52
But it turns out that
146:53
there's a way to assign weights to the to to numbers like um so
146:57
there are numbers that are kind of almost prime
147:00
but they're not they they don't have no factors at all other than themselves
147:03
in one but they have very few factors.
147:06
Um and it turns out that we understand almost primes a lot better than primes.
147:10
Um and so for example it was known for a long time that there
147:13
were twin almost primes.
147:15
This has been worked out.
147:16
So almost primes are something we can't understand.
147:18
So you can actually restrict attention to
147:21
a a suitable set of almost primes
147:24
and uh whereas the primes are very sparse
147:28
overall relative to the almost primes actually
147:31
are much less sparse.
147:32
They make um you can set up a set of almost primes where the
147:34
primes have density like say 1%.
147:36
Um and that gives you a shot at proving
147:39
by applying some sort of original principle that that those pairs of primes are
147:42
just only 100 100 apart.
147:44
But in order to with the twin pan conjecture you need to get the
147:47
density of primes inside the also size up to up to a first of 50%.
147:50
Um once you get up to 50% you will get twin primes.
147:53
But uh unfortunately there are barriers.
147:55
Um we know that that no matter what kind of good set of almost
147:59
primes you pick the density primes can never get above 50%.
148:02
It's called the parody barrier.
148:04
Um and I would love to find yes.
148:06
So one of my long-term dreams is to find a way to breach that
148:08
barrier because it would open up not only the trip conjecture
148:11
the go back conjecture
148:12
and many other problems in number theory
148:14
are currently blocked because our current techniques would require
148:18
improve going beyond this theoretical um parody barriers.
148:21
It's like it's like pulling past the speed of light. Yeah.
148:24
So we just say a twin prime conjecture
148:26
one of the biggest problems in the history of mathematics
148:28
go by conjecture also
148:30
um they feel like nextdoor neighbors.
148:33
Uh has there been days when you felt you saw the path? Oh yeah.
148:38
Um um yeah uh sometimes you try something and it it works super well.
148:42
Um you you again
148:44
again the sense of methac smell uh we talked about earlier
148:47
uh you learn from experience
148:49
when things are going too well
148:52
because there are certain difficulties that you sort of have to encounter.
148:55
Um um I think the way a
148:58
colleague might put it is that um you know like if if you are
149:01
on the streets in New York and you put in a blindfold and you
149:04
put in a car and and um after some hours
149:07
um you the blindfold's off and you're in Beijing.
149:09
Um you know I mean that was too easy somehow like like there was
149:13
no ocean being crossed.
149:15
Even if you don't know exactly what how
149:17
what what was done
149:19
you're suspecting that that something wasn't right.
149:21
But is that still in the back of your head to
149:24
do you return to these to the prime do you return to the prime
149:27
numbers every once in a while to see yeah when I have nothing better
149:30
to do which is less and less
149:32
tired which is I get busy with so many things these days but yeah
149:35
when I have free time and I'm not and I'm too frustrated to to
149:38
work on my sort of real research projects and I also don't want to
149:42
do my administrative stuff I don't want to do some errands for my family
149:45
um I can play with these these things
149:48
um for fun uh and usually you get nowhere Yeah, you have you have
149:51
to learn to just say okay fine once again nothing happened
149:55
I I will move on.
149:56
Um yeah very occasionally one of these problems I actually solved
150:00
or sometimes as you say you think you solved it and then
150:03
you're euphoric for maybe 15 minutes and then you think I should check this
150:07
because this is too easy too good to be true and it usually is.
150:11
What's your gut say about when
150:13
these problems would be
150:14
uh solved when prime and go back?
150:16
Prime I think we'll
150:18
keep getting keep getting more partial results.
150:20
Um it does need
150:23
at least one this parody barrier is is the biggest remaining obstacle.
150:27
Um there are simpler versions of the conjecture where we are getting really close.
150:31
Um so I think we will in 10 years we will have
150:36
many more much closer results.
150:38
May not have the whole thing.
150:40
Um yeah so trens
150:41
is somewhat close reman hypothesis
150:44
I have no I mean it has to happen by accident I think
150:47
so the reman hypothesis
150:48
is a kind of more general
150:50
conjecture about the distribution of prime numbers right yeah it's it's
150:54
states are sort of viewed multiplicatively
150:55
like for questions only involving multiplication
150:57
no addition the primes really do behave
151:00
as randomly as as you could hope
151:02
so there's a phenomenon in probability called square root cancellation
151:05
that um you know like if you want to poll say America
151:09
upon on on some issue.
151:10
Um, and you you ask one or two voters and you may have sampled
151:14
a bad sample and then you get you get a really imprecise
151:17
um measurement of of the
151:19
full average, but if you sample more and more people, the accuracy
151:22
gets better and better and it actually improves like the square root
151:26
of the number of people you you sample.
151:28
So yeah, if you sample
151:30
a thousand people, you can get like a 2 3% margin of error.
151:33
So in the same sense if you measure the primes in a certain multiplicative
151:36
sense there's a certain
151:37
type of statistic you can measure and it's called the reman's data function and
151:40
it fluctuates up and down
151:42
but in some sense um as you keep averaging more and more if you
151:46
sample and more and more the fluctuation should go down as if they were
151:48
random and there's a very precise way to quantify that and the reman hypothesis
151:52
is a very elegant
151:53
way that captures this
151:55
but um as with many others in mathematics we have very few tools to
151:59
show that something really genuinely behaves
152:02
like really random And this is actually not just a little bit random but
152:05
it's it's asking that it behaves as random as it actually random set this
152:09
this square root cancellation
152:11
and we know actually because of things related to the parity problem actually that
152:15
most of us usual techniques cannot hope
152:18
to settle this question.
152:19
Um the proof has to come out of left field.
152:22
Um yeah but uh what that is
152:27
yeah no one has any serious proposal.
152:29
Um yeah and and there's there's various ways to sort of as I said
152:32
you can modify the primes a little bit and you can destroy the human hypothesis.
152:36
Um so like it has to be very delicate.
152:39
You can't apply something that has huge margins of error.
152:42
It has to just barely work.
152:44
Um and like um there's like all these pits
152:47
pitfalls that you have like dodge very adeptly.
152:50
The prime numbers are just fascinating. Yeah. Yeah.
152:53
What what to you is um
152:55
most mysterious about the prime numbers.
152:59
So that's a good question.
153:01
So like conjecturally we have a good model of them.
153:03
I mean like as I said I mean
153:05
they have certain patterns like the primes are usually odd for instance
153:08
but apart from this of obvious patterns they behave very randomly and just assuming
153:11
that they behave so there's something called the crema random model of the primes
153:15
that that after a certain point primes just behave like a random set.
153:19
Um and there's various
153:20
slight modifications this model but this has been a very good model.
153:23
It matches the numeric.
153:25
It tells us what to predict.
153:26
Like I can tell you with complete certainty the truth is true.
153:29
Uh the random model gives overwhelming
153:31
odds it is true.
153:32
I just can't prove it.
153:33
Most of our mathematics
153:34
is optimized for solving things with patterns in them.
153:38
Um and the primes have this anti-attern
153:42
um as do almost everything really.
153:45
But we can't prove that. Yeah.
153:48
I guess it's not mysterious that the prize be
153:50
kind of random because there no reason for them to be
153:53
um uh to have any kind of secret pattern
153:57
but what is mysterious is what is the mechanism that really
154:00
forces the randomness to happen.
154:02
Uh and this is just absent.
154:04
Another incredibly surprisingly difficult
154:07
problem is the colots's conjecture. Oh yes.
154:10
simple to state, beautiful to visualize
154:14
in its simplicity and yet extremely
154:17
uh difficult to solve and yet you have been able to make progress.
154:20
Uh Paular said about the coloss conjecture that mathematics
154:25
may not be ready for such problems.
154:28
Others have stated that it is an extraordinarily
154:31
difficult problem completely out of reach this is in 2010
154:34
out of reach of present- day mathematics
154:36
and yet you have made some progress.
154:38
Why is it so difficult to make?
154:40
Can you actually even explain what it is? Oh, yeah.
154:42
So, it's it's it's a problem that you can explain.
154:44
Um yeah, it um it helps with some
154:47
um visual aids, but yeah, so you take any natural number like say 13.
154:52
And you apply the the following procedure to it.
154:54
So, if it's even, you divide it by two
154:56
and if it's odd, you multiply by three and add one.
154:59
So, even numbers get smaller, odd numbers get bigger.
155:02
So, 13 will become 40 because 13 * 3 is 39.
155:05
Add one, you get 40.
155:06
So, it's a simple process for odd numbers and even numbers.
155:09
They're both very easy operations.
155:11
And then you put it together.
155:12
It's still reasonably simple.
155:14
Um, but then you ask what happens when you iterate it.
155:16
You take the output that you just got and feed it back in.
155:19
So, 13 becomes 40.
155:21
40 is now even divide by 2 is 20.
155:23
20 is still even divide by 10 2 10
155:25
5 and then 5 * 3 + 1 is 16.
155:28
And then 8 4 2 1.
155:30
So, uh, and then from 1 it goes 1 4 2 1 421. It cycles forever.
155:34
So this sequence I just described
155:36
um yeah 13 40 20 10 so these are also called hailstone sequences
155:41
because there's an oversimplified
155:42
model of of hailstone formation yeah which is not actually quite correct but it's
155:46
so somehow taught to high school students as a first approximation
155:49
is that um like a a little nugget of ice gets gets an ice
155:53
crystal forms in a cloud and it it goes up and down because of
155:57
the wind and sometimes
155:59
when it's cold it get acquires
156:00
a bit more mass and maybe it melts a little bit and this process
156:03
of going up down
156:05
creates this s of partially melted ice which event
156:07
hell stone and eventually it falls out the earth.
156:10
So the conjecture is that no matter how high
156:12
you start up like you take a number which is in the millions or
156:15
billions you go this process that that goes up if you're odd and down
156:19
if you're even eventually
156:20
um goes down to to earth all the time no matter where you start
156:24
with this very simple algorithm
156:26
you end up at one
156:27
and you might climb for a while right yeah so
156:30
yeah if you plot it um these sequences
156:32
they look like brownie in motion um they look like the stock market you
156:35
know they just go up and down in a in a seemingly random pattern
156:39
and in Usually that's what happens
156:41
that that if you plug in a random number, you can actually prove at
156:43
least initially that it would look like um random walk.
156:47
Um and that's actually a random walk with a downward drift.
156:50
Um it's like if you're always gambling
156:52
on on roulette at at the casino
156:54
with odds slightly weighted against you.
156:56
So sometimes you you win, sometimes you lose, but over
156:59
in the long run you lose a bit more than you win.
157:01
Um and so normally your wallet will hit will go to zero
157:04
um if you just keep playing over and over again.
157:06
So statistically it makes sense. Yes.
157:10
So, so the result that I I proved roughly speaking
157:12
such that that statistically
157:14
like 99% of all inputs
157:17
would would drift down
157:18
to maybe not all the way to one, but to be much much smaller
157:22
than what you started.
157:23
So, it's it's like if I told you that if you go to a
157:26
casino, most of the time you end up if you keep playing for long
157:29
enough, you end up with a smaller amount in your wallet than when you started.
157:32
That's kind of like the what the result that I proved.
157:35
So why is that result
157:36
like can you continue down that thread
157:40
to prove the full conjecture?
157:42
Well, the problem is that
157:44
um my I I used arguments from probability theory
157:46
um and there's always this exceptional event.
157:49
So you know, so in probability we have this this law of large numbers
157:53
um which tells you things like if you play a casino with a
157:56
um a game at a casino with a losing
157:58
um expectation over time you are guaranteed
158:01
or almost surely with
158:03
probably probability as close to 100% as you wish you're guaranteed to lose money.
158:07
But there's always this exceptional outlier.
158:09
Like it is mathematically
158:10
possible that even in when the game is is the odds are not in
158:14
your favor, you could just keep winning slightly more often than you lose.
158:17
Very much like how in Navia Stokes there could be, you know, um most
158:20
of the time um your waves can disperse.
158:22
There could be just one
158:24
outlier choice of initial conditions that would lead you to blow up.
158:28
And there could be one
158:29
outlier choice of um
158:32
um special number that they stick in that shoots off infinity while all other
158:36
numbers crash to earth uh crash to one.
158:39
Um in fact um
158:41
there's some mathematicians um who
158:43
Alex Kovvich for instance who've proposed that um
158:46
that actually um these collat
158:48
uh iterations are like the similar automator
158:52
um actually if you look at what they happen on in binary they do
158:55
actually look a little bit like like these game of life type patterns.
158:58
Um and in an analogy to how the game of life can create these
159:02
these massive like self-plicating
159:04
objects and so forth
159:05
possibly you could create some sort of heavier than air flying machine
159:08
a number which is actually
159:10
encoding this machine which is just
159:12
whose job it is is to encode is to create
159:14
a version of itself which which is larger
159:17
heavier than air machine encoded in a number that flies forever. Yeah.
159:22
So Conway in fact worked on worked on this problem as well. Oh wow.
159:26
So Conway so similar in fact
159:28
that was one of inspirations for the Nebby Stokes project
159:32
that Conway studied generalizations
159:34
of the collapse problem where instead of
159:36
multiplying by three and adding one or dividing by two you have a more
159:39
complicated branch but but instead of having two cases maybe you have 17 cases
159:43
and then you go up and down
159:44
and he showed that once your
159:46
iteration gets complicated enough
159:48
you can actually encode touring machines and you can actually make these problems undecidable
159:51
and and do things like this.
159:53
In fact, he invented a programming language
159:55
for uh these kind of fractional linear transformations.
159:58
He called a factrat
160:00
as a play on forrat.
160:02
Uh and he showed that that you could um you can program
160:05
it was too incomplete.
160:06
You could you could you could uh
160:08
um you could make a program that if if your number you insert in
160:11
was encoded as a prime, it would sync to zero.
160:13
It would go down otherwise it would go up
160:15
uh and things like that.
160:16
Um so the general class of problems is is really
160:20
uh as complicated as all of mathematics.
160:23
some of the mystery of the cellular automa
160:24
that we talked about
160:26
uh having a fra mathematical
160:28
framework to say anything about cellular automa
160:31
maybe the same kind of framework is required
160:34
yeah injecture yeah if you want to do it not statistically
160:37
but you really want
160:38
100% of all inputs to to fall to earth
160:42
yeah so what might be feasible is is
160:44
statistically 99% you know
160:46
go to one but
160:47
like everything yeah that looks hard what would you say is
160:52
out of these within
160:53
reach famous problems is the hardest problem we have today.
160:57
Is there a reman hypothesis?
160:59
We want is up there.
161:00
Um POS MP is a good one because like uh that's
161:04
that's a meta problem like if you solve that in the
161:07
um in the positive sense that you can find a PMP algorithm that potentially
161:12
this solves a lot of other problems as well and we should mention
161:15
some of the conjectures we've been talking about.
161:17
You know a lot of stuff is built on top of them.
161:19
Now there's ripple effects.
161:20
P equ= 1 P has more ripple effects than basically any other right if
161:24
the reman hypothesis is disproven
161:27
um that would be a big mental shock to the number theorist uh but
161:31
it would have follow on effects for
161:34
um um because a lot of cryptography
161:39
uses number theory um it uses number theory constructions involving primes and so forth
161:43
and um it relies very much on the intuition that number theories are built
161:47
over many many years
161:48
of what operations involving prime behave randomly and what ones don't.
161:52
Um, and in particular,
161:53
our um methods are designed to turn
161:57
text with information on it into
161:59
text which is indistinguishable
162:00
from um from random noise.
162:03
So um and hence
162:05
we believe to be almost impossible to crack um at least mathematically.
162:09
Um but uh if
162:12
something has core to our belief as human hypothesis
162:15
is is wrong it means that there are there are
162:18
actual patterns of the primes that we not aware of and if there's one
162:22
there's probably going to be more.
162:23
Um and suddenly a lot of our crypto systems are in doubt. Yeah.
162:29
But then how do you then say stuff about the the primes? Yeah.
162:34
That you're going towards the collect conjecture again.
162:38
Um because if I I you you want it to be random, right?
162:41
You want it to be randomly. Yeah.
162:43
So more broadly, I'm just looking for more tools, more ways to show that
162:46
that that things are random.
162:47
How do you prove a conspiracy doesn't happen, right?
162:50
Is there any chance to you
162:52
that P equals NP?
162:54
Is there some Can you imagine a possible universe? It is possible.
162:58
I mean there's there's various uh scenarios.
163:00
I mean there there's one where
163:02
it is technically possible but in practice is never actually implementable.
163:06
The evidence is sort of slightly pushing in favor of no that we probably
163:10
is not equal to NP.
163:11
I mean it seems like it's one of those cases similar similar to reman
163:14
hypothesis that I think the evidence is
163:17
le leaning pretty heavily on the no.
163:20
Certainly more on the no than on on the yes.
163:21
The funny thing about picompy
163:22
is that we have also a lot more obstructions
163:24
than we do for almost any other problem.
163:26
Um so while there's evidence
163:28
we also have a lot of results
163:30
ruling out many many types of approaches to the problem.
163:33
Uh this is the one thing that the computer scientists have actually been very good at.
163:37
It's actually saying that that certain approaches cannot work. No go theorems.
163:41
It could be undecidable.
163:42
We don't Yeah, we don't know.
163:44
There's a funny story I read that when you won the Fields Medal, somebody
163:47
from the internet wrote you
163:50
and asked uh you know what are you going to do now that you've
163:53
won this prestigious award?
163:55
and and then you just quickly very humbly said that, you know, this
163:59
a shiny metal is not going to solve any of the problems I'm currently working on.
164:02
So, I'm just I'm going to keep I'm going to keep working on them.
164:05
It's just first of all, it's funny to me that you would answer an
164:07
email in that context, and second of all, it
164:10
um it just shows your humility.
164:12
But anyway, uh maybe you could speak to the Fields Medal, but it's another
164:16
way for me to ask
164:18
uh about Gregoria Pearlman.
164:22
What do you think about
164:23
him famously declining the Fields Medal and the Millennial Prize,
164:27
which came with a $1 million of prize money?
164:30
He stated that I'm not interested in money or fame.
164:33
The prize is completely irrelevant for me.
164:36
If the proof is correct, then no other recognition is needed. Yeah.
164:40
No, he's he's somewhat of an outlier.
164:42
Um even among mathematicians
164:43
who tend to uh to have uh somewhat idealistic views.
164:48
I've never met him.
164:49
I think I'd be interested to meet him one day, but I I never had the chance.
164:51
I know people who met him, but he's always had strong views about certain things.
164:55
Um, you know, I mean,
164:56
it's it's not like he was completely isolated from the math community.
164:59
I mean, he would he would give talks and
165:00
write papers and so forth.
165:02
Um, but at some point he just decided not to engage with the rest of the community.
165:05
He was he was disillusioned or something.
165:07
Um, I don't know.
165:09
Um, and he decided to to
165:12
uh uh to peace out uh and you know, collect mushrooms in St. Petersburg or something.
165:16
And then that's that's fine.
165:18
you know and you can you can do that.
165:19
Um I mean that's another sort of flip side.
165:22
I mean we are not
165:23
a lot of our problems that we solve you know they some of them do
165:26
have practical application and that's that's great
165:28
but uh like if you stop thinking about a problem
165:31
you know so he's he hasn't published
165:33
since in in this field but that's fine there's many many other people who've
165:37
done so as well.
165:38
Um yeah so I guess one thing I didn't realize initially with the fields
165:42
medal is that it it sort of makes you part of the establishment.
165:45
Um you know so
165:47
you know most mathematicians
165:49
you there's uh just career mathematicians you know you just focus on publishing the
165:52
next paper maybe getting one
165:54
to promote one one rank
165:56
you know and and starting a few projects maybe taking some students or something. Yeah.
166:00
But then suddenly people
166:02
want your opinion on things and uh you have to think a little bit
166:05
about you know things that you might just so foolishly say because you know
166:08
no one's going to listen to you.
166:09
Uh it's more important now.
166:11
Is it constraining to you?
166:12
Are you able to still have fun and be a rebel and
166:15
try crazy stuff and
166:17
well play with ideas?
166:19
I have a lot less free time
166:20
than I had previously.
166:23
Um I mean mostly by choice.
166:24
I mean I I I
166:25
obviously I have the option to sort of uh decline.
166:29
So I decline a lot of things.
166:30
I I could decline even more.
166:31
Um or I could acquire a reputation for being so unreliable that people don't even ask anymore.
166:36
Uh this is I love the different algorithms here. This is great.
166:40
This is it's always an option.
166:42
Um but you know um
166:44
there are things that are like
166:47
I mean so I mean I I I don't spend as much time as
166:50
I do as a postto you know just just working on one problem at
166:52
a time or um fooling around.
166:54
I still do that a little bit
166:56
but yeah as you advance in your career somehow
166:59
the more soft skills so math somehow frontloads
167:01
all the technical skills to the early stages of your career.
167:04
So um yeah, so it's as a post office publisher or parish
167:08
you're you're incent you're incentivized
167:10
to basically focus on on proving very technical themsel
167:14
um as well as proof the theorems.
167:16
Um but then as as you get more senior you
167:20
have to start you know mentoring and and and and
167:22
giving interviews uh and uh
167:24
and trying to shape
167:26
um direction of the field both research wise and and you know
167:29
uh sometimes you have to uh
167:31
u you know do various
167:32
administrative things and it's kind of the right social contract because you you need
167:36
to to work in the trenches to see what can help mathematicians.
167:40
the other side of the establishment sort of the the really positive thing
167:43
is that um you get to be a light that's an inspiration to a
167:47
lot of young mathematicians
167:48
or young people that are just interested in mathematics.
167:51
It's like it's just how the human mind works.
167:54
This is where I would probably
167:56
uh say that I like the fields metal
167:59
that it does inspire
168:01
a lot of young people somehow.
168:03
I don't this just how human brains work. Yeah.
168:06
At the same time, I also want to give sort of respect to somebody
168:09
like Gregoria Pearlman who
168:12
is critical of awards in his mind.
168:14
Those are his principles
168:16
and any human that's able for their principles
168:18
to like do the thing that most humans would not be able to do.
168:23
It's beautiful to see.
168:25
Some recognition is is necessarily important.
168:27
Uh but yeah, it's
168:29
it's also important to not let these things take over your life.
168:32
um and like only be concerned about uh getting the next
168:36
big award or whatever.
168:37
Um I mean yeah so again you see these people try to only solve
168:41
like a really big math problems and not work on on on
168:44
things that are less
168:46
uh sexy if you wish but but but
168:48
actually still interesting and
168:50
instructive as you say like the way the human mind works it's
168:54
um we understand things better when they're attached to humans
168:57
um and also uh if they're attached to a small number of humans like
169:01
this this way our human
169:03
mind is is wired
169:05
we can comprehend and
169:06
the relationships between you know 10 or 20 people you know but once you
169:10
get beyond like 100 people like there there's a there's a limit I think
169:13
there's a name for it um
169:14
beyond which uh it just becomes the other
169:17
um and so we have you have to simplify the pole master you know
169:21
99.9% of humanity becomes the other
169:23
um and uh often these models are are incorrect and this causes all kinds
169:28
of problems but um
169:30
so yeah so to humanize
169:31
a subject you know if you identify a small number of people and say
169:34
you know these representative
169:36
people of the subject
169:37
role models for example
169:39
um that has some role um but it can also be
169:43
um uh yeah too much of it can be harmful because
169:48
I'll be the first to say that my own career
169:51
path is not that of a typical mathematician
169:53
um I the very accelerated
169:55
education I skipped a lot of classes
169:57
um I think I was had very fortunate mentoring
169:59
opportunities um and I think I was at the right place at the right
170:02
time just because someone does doesn't have my
170:06
um trajectory, you it doesn't mean that they can't be good mathematicians.
170:09
I mean they be ma good mathematician
170:11
in a very different style.
170:12
Uh and we need people
170:14
of a different style.
170:15
Um and you know even if and sometimes too much focus is given on
170:20
the on the person who does the last step to complete
170:23
um a project in mathematics or elsewhere that's that's really taken you know centuries
170:27
or decades with lots and lots of
170:29
building lots of previous work.
170:30
Um, but that's a a story that's difficult to tell
170:33
um if you're not an expert because, you know, it's easier to just say
170:36
one person did this one thing.
170:38
You know, it makes for a much simpler history.
170:40
I think on the whole it
170:42
um is a hugely positive thing
170:44
to to talk about Steve Jobs
170:46
as a representative of Apple
170:49
when I personally know and of course everybody
170:51
knows the incredible design, the incredible engineering
170:55
teams, just the individual
170:57
humans on those teams.
170:58
They're not a team.
171:00
They're individual humans on a team.
171:02
And there's a lot of brilliance there.
171:04
But it's just a nice shorthand
171:05
like a very like pi. Yeah. Steve Jobs. Yeah. Yeah.
171:09
As as a starting point, you know, as a first approximation
171:13
that's how you and then read some biographies and then look into much deeper. First approximation. Yeah. That's right.
171:18
Uh so you mentioned you were a Princeton to
171:20
um Andrew Wilds at that time.
171:22
He's a professor there.
171:23
It's a funny moment how history is just all interconnected.
171:27
And at that time he announced that he proved the form last theorem.
171:30
What did you think maybe looking back now with more context about that moment in math history? Yes.
171:37
So I was a graduate student at the time.
171:39
I mean I I vaguely remember you know there was press attention and uh
171:43
um we all had the same um we had pigeon holes in the same
171:46
mail room you know.
171:47
So we all picked our mail and like suddenly Andrew W's mailbox
171:50
exploded to be overflowing.
171:52
That's a good that's a good metric. Yeah.
171:55
um you know so yeah we we all talked about it at at tea
171:58
and so forth I mean we we didn't understand most of us
172:01
didn't understand the proof um we understand sort of high level details
172:05
um fact there's an ongoing project to formalize it in lean right Kevin puzzly
172:09
yeah can can we take that small tangent
172:11
is it is it
172:12
how difficult does that cuz
172:13
as as I understand the for last the proof for uh for last theorem
172:18
has like super complicated objects
172:20
yeah really difficult to formalize now yeah I guess yeah you're right the objects
172:24
that they use um you can define them.
172:27
Uh so they've been defined in lean. Okay.
172:29
So so just defining what they are can be done.
172:32
Uh that's really not trivial but it's been done.
172:34
But there's a lot of really
172:35
basic facts about um these objects
172:38
that have taken decades to prove and that they're in all these different math
172:41
papers and so lots of these have to be formalized as well.
172:45
Um Kevin's uh Kevin Buzzard's
172:48
goal actually he has a five-year grraft to formalize fossil
172:51
theorem and his aim is that he doesn't think he will be able to
172:55
get all the way down to the basic axioms
172:57
but he wants to formalize it to the point where the only things that
173:00
he needs to rely on as black boxes
173:02
are things that were known by 1980
173:04
to um to number theorist at the time.
173:06
Um and then some other person some other work would have to done to
173:10
to to get from there.
173:12
Um so it's it's a different area of mathematics
173:15
than um the type of mathematics I'm used to.
173:18
Um um in analysis, which is kind of my area, um the objects we
173:21
study are kind of much closer to the ground.
173:24
We study I study things like prime numbers and and
173:27
functions and things that
173:29
are within scope of a high school
173:31
um math education to at least uh define.
173:35
Um yeah, but then there's this very advanced algebraic
173:38
side of number theory where people have been building structures upon structures for quite a while.
173:42
Um and it's it's a very sturdy structure.
173:44
It's it's been it's been very
173:46
um at the base at least is extremely well developed in the textbooks and so forth.
173:51
But um um it does get to the point where
173:54
um if you if you haven't taken these years of study and you want
173:57
to ask about what what is going on at
173:59
um like level six of of this tower,
174:01
you have to spend quite a bit of time before they can even get
174:04
to the point where you can see you see something you recognize.
174:07
What uh inspires you about his journey
174:09
that we similar as we talked about
174:11
seven years mostly working in secret? Yeah.
174:15
Uh that is a romantic uh Yeah.
174:18
So it kind of fits with sort of the
174:20
the romantic image I think people have of mathematicians to the extent they think
174:24
of them at all as
174:25
these kind of eccentric
174:27
uh you know wizards or something.
174:29
Um so that certainly kind of uh
174:32
uh accentuated that perspective
174:35
you know I mean it's it is a great achievement
174:38
his style of solving problems is so different from my own
174:42
um but which but which is great.
174:43
I mean we we need people
174:44
speak to it like what uh
174:46
in in terms of like the you like the collaborative
174:49
I like moving on from a problem if it's giving too much everybody. Um got it.
174:55
But you need the people who have the tenacity and the fearlessness.
174:58
Um you I've collaborated with with
175:00
people like that where where I want to give up
175:03
uh cuz the first approach that we tried didn't work and the second one
175:05
didn't approach but they're convinced and they have the third fourth and the fifth approach works.
175:10
Um and I have to eat my words. Okay.
175:13
I didn't think this was going to work, but yes, you were right all along.
175:16
And we should say for people who don't know, not only are you known
175:19
for the brilliance of your work, but the incredible
175:22
productivity, just the number of papers,
175:23
which are all of very high quality.
175:26
So there's something to be said about being able to jump
175:29
from topic to topic.
175:31
Yeah, it works for me.
175:32
Yeah, I mean there also people who are very productive and they focus very deeply on Yeah.
175:37
I think everyone has to find their own workflow.
175:39
Um like one thing which is
175:40
a shame in mathematics is that we have
175:43
mathematics there's sort of a one size fits all approach to teach teaching mathematics
175:47
um and you know so we have a certain curriculum and so forth I
175:51
mean you know maybe like if you do math competitions or something you get
175:54
a slightly different experience
175:55
but um I think many people
175:58
um they don't find their their native math language
176:01
uh until very late or usually too late so they they stop doing mathematics
176:06
and they have a bad experience with a teacher
176:08
who's trying to teach them one way to do mathematics.
176:10
They don't like it.
176:11
Um my theory is that
176:14
um humans don't come
176:15
evolution has not given us a math center of a brain directly.
176:19
We have a vision center and a language center
176:21
and some other centers
176:23
um which have evolution has honed but we it doesn't we don't have innate sense of mathematics.
176:27
Um but our other centers are
176:30
sophisticated enough that different people
176:33
we we we can repurpose
176:36
other areas of our brain to do mathematics.
176:38
So some people have figured out how to use the visual center to do
176:41
mathematics and so they think very visually when they do mathematics.
176:44
Some people have repurposed their their
176:46
language center and they think very symbolically.
176:48
Um, you know, um,
176:50
some people like if they are very competitive and they they like gaming,
176:53
there's a type there's this part of your brain that's very good at
176:56
at at uh at solving puzzles and games and and and
177:00
that can be repurposed.
177:02
But like when I talked about the mathematicians,
177:05
you know, they don't quite think they
177:07
I can tell that they're using some different
177:09
styles of of thinking than I am.
177:11
I mean, not not
177:12
disjoint, but they they may prefer visual.
177:15
Like I I don't actually prefer visual so much.
177:17
I need lots of visual aids myself.
177:19
Um, you know, mathematics provides a common language.
177:23
So, we can still talk to each other even if we are thinking in in different ways.
177:26
But you can tell there's a different
177:28
set of subsystems being used in the thinking process
177:32
like they take different paths.
177:33
They're very quick at things that I struggle with and vice versa.
177:37
Um, and yet they still get to the same goal. Um, that's beautiful.
177:40
And yeah, but I mean the way we educate
177:43
unless you have like a personalized tutor or something.
177:45
I mean education sort of just by natural scale has to be mass-produced
177:48
you know you have to teach to 30 kids
177:50
and you know if they have 30 different styles you can't you can't teach 30 different ways.
177:55
On that topic what advice would you give to students
177:58
uh young students who are struggling
178:01
with math and but are interested in it and would like to get better.
178:05
Is there something in this Yeah.
178:07
um in this complicated
178:08
educational context, what what would you Yeah, it's a tricky problem.
178:11
One nice thing is that there are now lots of sources for mathematical enrichment outside the classroom.
178:16
Um so in in in my day there already there are math competitions.
178:19
Um and you know there also like popular math books in the library.
178:22
Um yeah but but now you have you know YouTube
178:25
uh there there are forums
178:27
just devoted to solving
178:28
you know math puzzles and
178:30
um and math shows up in other places you know like um for example
178:33
there there are hobbyists who play poker
178:36
for fun uh and
178:38
um they they you know they for very specific reasons are interested in very
178:43
specific probability questions um
178:45
and and they actually know there's a community of amateur
178:49
proists in in in poker
178:52
um in chess, in baseball.
178:53
I mean, there's there's there's uh yeah
178:56
um there's math all over the place.
178:58
Um and I'm I'm I'm hoping actually with with these new sort of tools
179:03
for lean and so forth that actually we can incorporate
179:06
the broader public into math research projects
179:09
um like this is almost
179:11
is doesn't happen at all currently.
179:13
So in the sciences there's some scope for citizen science like astronomers
179:17
uh they amateurs who discover comets and there's biologists there people who could identify
179:21
butterflies and so forth.
179:23
Um and in whereum
179:27
amateur mathematicians can like
179:29
discover new primes and so forth but
179:31
but previously because we have to verify every single contribution
179:35
um like most mathematical research projects
179:38
it would not help to have
179:40
input from the general public.
179:41
In fact, it would it would just be be timeconuming
179:43
because just error checking and everything.
179:45
Um but you know one thing about these formalization
179:49
projects is that they are bringing together more bringing in more people.
179:53
So I'm sure there are high school students who've already contributed to some of these
179:56
these formalizing projects who contributed into math liib.
179:58
Um you know you don't need to be a PhD holder to just work
180:01
on one atomic thing.
180:03
There's something about the formalization
180:05
here that also at as a very first step opens it up to the programming community too.
180:11
The people who are already comfortable with programming.
180:14
It seems like programming is somehow
180:16
maybe just the feeling but it feels more accessible to folks than math.
180:21
Math is seen as this like extreme
180:23
especially modern mathematics seen as this extremely
180:26
difficult to enter area and programming is not.
180:29
So that could be just an entry point.
180:31
you can execute code and you can get results.
180:32
You know, you can print a hello world pretty quickly.
180:35
Um, you know, like if
180:38
uh if programming was taught as almost entirely theoretical subject
180:42
where you just taught the the computer science, the theory of functions and and
180:46
and routines and so forth and and outside of some some very specialized homework
180:50
assignments, you're not actually program
180:53
like on the weekend for fun. Yeah. Or Yeah.
180:55
They would be as considered as hard as math. Mhm. Um Yeah. Yeah.
180:59
So, as I said, you know, there are
181:02
communities of non- mathematicians
181:04
where they're deploying math for some very
181:06
specific purpose, you know, like like optimizing their poker game
181:09
and and for them
181:11
then math becomes fun for them.
181:13
Uh what advice would you give in general to young people how to pick
181:15
a career, how to find themselves
181:17
like that's a tough tough tough question. Yeah.
181:21
So um there's a lot less certainty now in the world you know I
181:24
mean I there was this period after the war where
181:27
uh at least in the west you know if you came from a good demographic
181:30
you uh you know like you there was a very stable path to to
181:35
a good career you go to college you get an education
181:38
you pick one profession
181:39
and you stick to it
181:41
becoming much more a thing of the past
181:43
so I think you just have to be adaptable
181:46
and flexible I think people have to
181:48
get skills that are transferable
181:49
you know like like learning one specific
181:51
programming language or one specific subject of mathematics or something.
181:54
It's it's it's that itself is not a super transferable
181:57
skill but sort of knowing how to
182:00
um reason with with abstract
182:03
concepts or how to problem solve when things go wrong.
182:06
So these are things which I think we will still need
182:09
even as our tools get get better and you know you you would be
182:11
working with AI sport and so forth.
182:13
But actually you're an interesting case study.
182:16
I mean you're like a
182:18
one of the great
182:19
living mathematicians right and then you had a way of doing things and then
182:25
all of a sudden you start learning
182:27
I mean first of all you kept learning new fields
182:30
but you learn lean that's not that's a non-trivial
182:33
thing to learn like that's a
182:35
that's a for a lot of people that's an extremely uncomfortable
182:39
leap to take right yeah
182:41
mathematicians um first of all I've always been interested in new ways to do
182:45
mathematics I I I
182:46
feel like a lot of the ways we do things right now are inefficient.
182:50
Um I I I I
182:51
spend me my colleagues, we spend a lot of time
182:54
doing very routine computations or doing things that other mathematicians
182:57
would instantly know how to do and we don't know how to do them.
182:59
Uh and why can't we search
183:01
and get a quick response and so
183:03
that's why I've always been interested in exploring new workflows.
183:08
About four or five years ago, I was on a committee where we had
183:12
to ask for ideas for interesting workshops to run at a math institute.
183:15
And at the time, Peter Schulzer had just formalized
183:18
one of his his um new theorems.
183:20
And um there are some other developments in computer assisted proof that look quite interesting.
183:25
And I said, "Oh, we should we should uh
183:28
um we should run a workshop on this.
183:29
This be a good idea."
183:30
Um and then I was a bit too enthusiastic about this idea.
183:34
So I I got volunte.
183:37
Um, so I did with a bunch of other people,
183:39
Kevin Bisard and Jordan Ellenburg and and
183:41
a bunch of other people.
183:43
Um, and it was it was
183:45
a a nice success.
183:46
We brought together a bunch of mathematicians and computer scientists and other people and
183:50
and we got up to speed and state
183:52
um and it was really interesting
183:54
um developments that that most mathematicians
183:56
didn't know was going on.
183:58
Um that lots of nice proofs of concept, you know, just sort of hints
184:01
of of what was going to happen.
184:03
this was just before chat GBD
184:04
but there was even then there was one talk about language models and the
184:07
potential um capability of those in the future.
184:11
So that got me excited about the subject.
184:13
So I started giving talks
184:14
um about this is something we should more of us should start looking at
184:18
um now that I' arranged to run this conference
184:21
and then chat GPT came out and like suddenly AI was everywhere and so
184:25
uh I got interviewed a lot um about about this topic
184:29
um and in particular
184:30
um the interaction between
184:32
AI and formal proof assistance and I said yeah they should be combined this
184:35
this is this is
184:36
um this perfect synergy to happen here
184:39
and at some point I realized that I have to actually do not just
184:41
talk the talk but walk the book you know like you know I don't
184:44
work in machine learning I and I don't work in proof formalization
184:46
and there's a limit to how much I can just rely on authority and
184:50
saying you know I I'm a I'm a warn mathematician
184:52
just trust me you know when I say that this is going to change
184:54
athletics and I'm not doing it any when I don't do any of it
184:57
myself so I felt like I had to actually uh
185:01
uh justify it yeah
185:03
a lot of what I get into actually
185:05
I don't quite see in advance as how much time I'm going to spend
185:08
on it and it's only after I'm sort of waste deep in in in
185:12
in in a project that I I I realized by that point I'm committed.
185:15
Well, that's deeply admirable that you're willing to go into the fray
185:18
be in some small way a beginner, right?
185:22
Or have some of the
185:24
sort of challenges that a beginner would, right?
185:28
new concepts, new ways of thinking
185:30
also, you know, sucking at a thing that others
185:34
I think I think in that talk
185:36
you could be a fields
185:37
med metal winning mathematician
185:39
and undergrad knows something better than you. Yeah.
185:42
Um I think mathematics
185:44
inherently I mean mathematics is so huge these days that nobody
185:48
knows all of modern mathematics.
185:50
Um and inevitably we make mistakes
185:52
and um you know
185:54
uh you can't cover up your mistakes with just sort of bravado
185:58
and and uh I mean because people will ask for your proofs and if
186:01
you don't have the proofs you don't have the proofs.
186:02
Um I don't love math. Yeah.
186:05
So it does keep us honest.
186:06
I mean not not I mean you can still
186:08
it's not a perfect uh panacea
186:10
but I think uh
186:12
we do have more of a culture of admitting
186:14
error than because we're forced to all the time. Big ridiculous question.
186:19
I'm sorry for it once again.
186:21
Who is the greatest
186:22
mathematician of all time?
186:24
Maybe one who's no longer with us.
186:27
Uh who are the candidates?
186:28
Zyler, Gaus, Newton, Raman, Hilbert.
186:32
So, first of all, as as mentioned before, like there's there's some time dependent on the day. Yeah.
186:38
Like like if if you if you if you plot cumulatively over time, for example,
186:41
Uklid like like sort of like
186:43
is is one of the leading contenders.
186:44
Um and then maybe some unnamed
186:47
anonymous mathematicians before that
186:49
um you know whoever came up with the concept of of numbers you know
186:52
you know um do mathematicians
186:54
today still feel the impact of Hilbert
186:57
just oh yeah directly of everything that's happened in the 20th century
187:00
yeah Hilbert spaces we have lots of things that are named after him
187:03
of course just the arrangement of mathematics
187:06
and just the introduction of certain concepts
187:08
I mean 23 problems have been extremely influential
187:12
there's some strange power to the declaring
187:14
ing which problems are hard to solve.
187:17
The statement of the open problems. Yeah.
187:19
I mean this is bystander effect in everywhere.
187:23
Like if no one says you should do X,
187:26
everyone just moves around waiting for somebody else to to uh to do something
187:28
and and like nothing gets done.
187:31
Um so and and like it like it's
187:34
one one thing that actually uh you have to teach undergraduates in mathematics is
187:37
that you should always try something.
187:40
So um you see
187:42
a lot of paralysis
187:43
um in an undergraduate
187:44
trying a math problem
187:46
if they recognize that there's a certain technique
187:48
that that can be applied they will try it but there are problems for
187:51
which they see none of their standard techniques obviously applies
187:54
and the common reaction is then just paralysis
187:57
I don't know what to do
187:59
or um or I think there's a quote from the Simpsons I've tried nothing
188:02
and I'm all out of ideas
188:04
um so you know like the next step then is to try anything like
188:09
no matter how stupid
188:11
um and in fact almost as stupid of the better
188:13
um which you know and one a technique which is almost guaranteed to fail
188:17
but the way it fails is going to be instructive
188:19
um like it fails because you you you're not at all taking into account
188:22
this hypothesis oh this hypothesis
188:24
must be useful that's a clue
188:26
I I think you also suggested somewhere this this fascinating
188:29
approach which really stuck with me I started using it and really works
188:33
I think you said it's called structured procrastination
188:36
no yes it's when you really don't want to do a thing.
188:39
Do you imagine a thing you don't want to do more? Yes.
188:43
That's worse than that.
188:44
And then in that way, you procrastinate
188:46
by not doing the thing that's worse. Yeah. Yeah.
188:49
It's a nice It's a nice hack. It actually works. Yeah. Yeah.
188:52
This um I mean with anything like you know I mean like you um
188:57
psychology is really important like you
188:59
you talk to athletes like marathon runners and so forth and
189:02
and they talk about what's the most important thing is it their training regimen
189:05
or the diet and so forth.
189:06
Actually so much of it is actually psychology.
189:08
Um you know just tricking yourself to
189:11
to think that the problem is feasible
189:13
um so that you can you're motivated to do it.
189:15
Is there something our human mind will never be able to comprehend?
189:20
Well I sort of as a mathematician I mean
189:25
there must be some suffer
189:27
that you can't understand.
189:29
That was the first thing that came to mind.
189:31
So that but even broadly
189:33
is there are we li is there something about our mind that's we're going
189:37
to be limited even with the help of mathematics
189:41
well okay I mean
189:43
like how much augmentation are you willing like like for example if if I
189:46
didn't even have pen and paper
189:48
um like if I had no technology whatsoever
189:50
okay so I'm not allowed blackboard pen and paper right you're already
189:54
much more limited than you would be incredibly limited even language
189:58
the English language is a
190:00
It's a It's one that's been very internalized. So, you're right.
190:03
There really the the the formulation of the problem is incorrect because
190:07
there really is no longer a just a solo human.
190:11
We're already augmented in extremely
190:15
complicated intricate ways, right? Yeah. Yeah.
190:18
We're already like a collective intelligence. Yes. Yeah. Yes.
190:22
So, humanity plural has much more intelligence
190:24
in principle on it good days
190:27
than than the individual humans put together.
190:29
It can also have less. Okay.
190:31
But uh um yeah, so yeah, mathemat mathematical
190:35
community plural is is is
190:37
incredibly super intelligent uh
190:39
entity um that uh no single human mathematician can can come closer to to replicating.
190:45
You see it a little bit on these like question analysis sites.
190:48
Um so this math overflow which is the math version of stack overflow
190:51
and like sometimes you get like this very quick responses to very difficult questions from the community.
190:56
Um, and it's it's it's a pleasure to watch actually
190:59
as a as an expert.
191:01
I'm a fan spectator
191:02
of that uh of that site, just seeing the brilliance of the different people,
191:06
the um the depth of knowledge that people have
191:11
and the the willingness to engage in the
191:13
in the rigor and the nuance of the particular question.
191:16
It's pretty cool to watch. It's fun.
191:17
It's almost like just fun to watch.
191:19
Uh what gives you hope about this whole thing we have going on, human civilization?
191:25
I think uh yeah.
191:26
Um the younger generation is always like like really creative and enthusiastic and and inventive.
191:31
Um it's a pleasure working with with with uh
191:34
with uh with young students.
191:37
Um you know the uh
191:41
the progress of science
191:42
tells us that the problems that used to be really difficult
191:44
can become extremely you know can become
191:47
like trivial to solve.
191:48
you know, I mean, like it was like navigation,
191:52
you know, just just knowing
191:53
where you were on the planet was this horrendous problem.
191:56
People died um you know,
191:59
or or lost fortunes because they couldn't navigate, you know, and we have devices in
192:02
our pockets that do this automatically for us, I guess, a completely solved problem, you know.
192:06
So things that are seem unfeasible for us now could be maybe just sort
192:10
of homework exercises for Yeah.
192:13
But one of the things I find really sad about the finitness
192:15
of life is that I won't get to see all the cool things we
192:18
create as a civilization.
192:20
You know that cuz in the next 100 years,
192:23
200 years, just imagine showing showing up in 200 years. Yeah.
192:27
Well, already plenty has happened, you know, like if if you could go back
192:29
in time and and talk to your
192:31
teenage self or something, you know what I mean? Yeah.
192:33
and just the internet and and our AI.
192:36
I mean again they they've been in they're beginning to be internalized and say
192:40
yeah of course an AI can understand our voice and and give reasonable
192:44
you know slightly incorrect answers to to any question but yeah
192:48
this was mind-blowing even 2 years ago and in the moment it's hilarious to
192:52
watch on the internet and so on the the
192:54
drama uh people take everything for granted very quickly and then they
192:58
we humans seem to entertain ourselves
193:00
with drama out of anything that's created
193:04
somebody needs to take one opinion another person needs to take an opposite opinion,
193:07
argue with each other about it.
193:09
But when you look at the arc of things, I mean just even in progress of robotics. Yeah.
193:14
Just to take a step back and be like, "Wow, this is beautiful that
193:17
we humans are able to create this." Yeah.
193:19
When the infrastructure and the culture is is healthy, you know,
193:23
the community of humans can be so much
193:25
more intelligent and mature and and and rational
193:29
than the individuals within it.
193:30
Well, one place I can always count on rationality
193:33
is the comment section of your blog, which I'm a big fan of.
193:36
There's a lot of really smart people there.
193:39
And thank you, of course, for
193:41
uh for putting those ideas out on the blog,
193:44
and it's I can't tell you how
193:47
uh honored I am that you would spend your time with me today.
193:51
I was looking forward this for a long time, Terry.
193:53
I'm a huge fan.
193:55
Um you inspire me.
193:56
You inspire millions of people.
193:57
Thank you so much for talking. Oh, thank you.
193:59
It was a pleasure.
194:00
Thanks for listening to this conversation with Terrence Tao.
194:03
To support this podcast, please check out our sponsors in the description
194:06
or at And now,
194:10
let me leave you with some words from Galileo Galile.
194:15
Mathematics is a language
194:17
with which God has written the universe.
194:21
Thank you for listening
194:22
and hope to see you next time.
Thích
Chia sẻ
Lex Fridman
Xem tất cả →
C1
Phỏng vấn
3:17:34
Narendra Modi: Prime Minister of India - Power, Democracy, War & Peace | Lex Fridman Podcast #460
Lex Fridman
7
C1
Phỏng vấn
Karaoke
4:34:10
Pavel Durov: Telegram, Freedom, Censorship, Money, Power & Human Nature | Lex Fridman Podcast #482
Lex Fridman
4
C1
Phỏng vấn
Karaoke
5:06:18
DeepSeek, China, OpenAI, NVIDIA, xAI, TSMC, Stargate, and AI Megaclusters | Lex Fridman Podcast #459
Lex Fridman
6
C1
Phỏng vấn
Karaoke
5:20:08
ThePrimeagen: Programming, AI, ADHD, Productivity, Addiction, and God | Lex Fridman Podcast #461
Lex Fridman
1
C1
Phỏng vấn
Karaoke
3:24:36
James Holland: World War II, Hitler, Churchill, Stalin & Biggest Battles | Lex Fridman Podcast #470
Lex Fridman
C1
Phỏng vấn
Karaoke
2:45:26
Dan Houser: GTA, Red Dead Redemption, Rockstar, Absurd & Future of Gaming | Lex Fridman Podcast #484
Lex Fridman
C1
Phỏng vấn
Karaoke
2:05:13
Deciphering Secrets of Ancient Civilizations, Noah's Ark, and Flood Myths | Lex Fridman Podcast #487
Lex Fridman
C1
Phỏng vấn
Karaoke
2:28:14
Demis Hassabis: Future of AI, Simulating Reality, Physics and Video Games | Lex Fridman Podcast #475
Lex Fridman
Video gợi ý
C1
Phỏng vấn
3:17:34
Narendra Modi: Prime Minister of India - Power, Democracy, War & Peace | Lex Fridman Podcast #460
Lex Fridman
7
C1
Phỏng vấn
Karaoke
4:34:10
Pavel Durov: Telegram, Freedom, Censorship, Money, Power & Human Nature | Lex Fridman Podcast #482
Lex Fridman
4
C1
Phỏng vấn
Karaoke
5:06:18
DeepSeek, China, OpenAI, NVIDIA, xAI, TSMC, Stargate, and AI Megaclusters | Lex Fridman Podcast #459
Lex Fridman
6
C1
Phỏng vấn
Karaoke
5:20:08
ThePrimeagen: Programming, AI, ADHD, Productivity, Addiction, and God | Lex Fridman Podcast #461
Lex Fridman
1
C1
Phỏng vấn
Karaoke
3:24:36
James Holland: World War II, Hitler, Churchill, Stalin & Biggest Battles | Lex Fridman Podcast #470
Lex Fridman
C1
Phỏng vấn
Karaoke
2:45:26
Dan Houser: GTA, Red Dead Redemption, Rockstar, Absurd & Future of Gaming | Lex Fridman Podcast #484
Lex Fridman
C1
Phỏng vấn
Karaoke
2:05:13
Deciphering Secrets of Ancient Civilizations, Noah's Ark, and Flood Myths | Lex Fridman Podcast #487
Lex Fridman
C1
Phỏng vấn
Karaoke
2:28:14
Demis Hassabis: Future of AI, Simulating Reality, Physics and Video Games | Lex Fridman Podcast #475
Lex Fridman