SlideShare una empresa de Scribd logo
1 de 43
Descargar para leer sin conexión
HOW DOES HE DO IT?




    Jeff Cheeger




                     1
From Gromov’s Abel Prize Citation:

• A decisive role in the creation of modern
global Riemannian geometry.

• One of the founders of symplectic geom-
etry, in particular, he created the theory of
J-holomorphic curves, which led to the cre-
ation of symplectic topology and became
linked to quantum field theory.

• His solution of the conjecture that groups
of polynomial growth are almost nilpotent
introduced ideas which forever changed the
way a discrete infinite group is viewed and
his geometrical approach rendered combi-
natorial ideas much more natural and pow-
erful.




                                       2
Further influence, broad view point.

Apart from group theory, other fields such
as partial differential equations have been
strongly influenced by Gromov’s introduc-
tion of a geometric perspective.

He has a deep and detailed understanding
of many areas which are seemingly far from
geometry — ask anyone who has attended
a lecture with Gromov in the audience.

As an example, the finitely generated group
discussion includes, not only hyperbolic groups
(incorporating a synthetic asymptotic gen-
eralization of negative curvature) but also,
“random groups” and ideas from algorith-
mic complexity.




                                      3
Early influences.

Gromov cites the “obviously nonsensical”
work of Nash on the isometric imbedding
problem and Smale on turning the 2-sphere
inside out, as strong early influences.

These led to his work far reaching work on
the “h-principle” and “convex integration”.

Another strong influence was the work of
Kazhdan-Margulis which associated nontriv-
ial nilpotent subgroups to the “thin” parts
of locally homogeneous spaces.

This led to his work on “almost flat man-
ifolds” and subsequently, to many other
works in geometry and discrete groups.




                                     4
The h-principle.

It asserts very roughly, that for “most un-
der determined” partial differential equa-
tions arising, the “obvious” obstructions to
the existence of a solution are the only ones
and the solutions are rather dense in a ap-
propriate function spaces.

Intuition derived from classical equations
of mathematical physics, makes the above
statement seem totally counterintuitive.

Gromov invented a general tool, called “con-
vex integration”, which can be used for ver-
ify the h-principle in many specific cases.

These ideas, which were later elaborated in
Gromov’s book: “Partial differential rela-
tions”, have slowly been assimilated, though
the full effects are likely yet to be felt.


                                       5
A startling application.

Every open manifold admits a (generally
incomplete) Riemannian metric of positive
curvature and also one of negative curva-
ture.

Gromov (age 26) included this striking but
puzzling result in his talk at the 1970 ICM
held in Nice.

Prior to his arrival in Stony Brook in 1974,
this was the theorem for which Gromov was
primarily known in the west.




                                      6
Almost flat manifolds.

If the metric, g, of a Riemannian manifold
is multiplied by a constant η 2 > 0, then the
curvature gets multiplied by η −2,

        K(M n,η 2·g) = η −2 · K(M n,g) .


In almost all cases, as η → 0,

           diam(M n, η 2 · g) → 0 ,
and the curvature blows up.

The only exception is the case of flat man-
ifolds,
                K(M n,g) ≡ 0 .


Bieberbach’s theorem states that the fun-
damental group of a flat manifold has a
free abelian subgroup of finite index.


                                           7
By the 1960’s, members of the Russian
school were aware that there exist com-
pact smooth manifolds with the following
startling properties:

• They admit a sequence of Riemannian
metrics, gλ, such that as λ → 0, the diame-
ter goes to zero and the curvature goes to
zero.

• The fundamental groups of these man-
ifolds are nilpotent, but have no abelian
subgroup of finite index.

From the second property and Bieberbach’s
theorem, it follows that these manifolds ad-
mit no flat metric.

Next we describe the simplest example.



                                      8
The 3-dimensional Heisenberg group.

Let H denote R3 = (a, b, c) viewed as the
nilpotent matrix group
                           
                     1 a c
                   0 1 b 
                          
                     0 0 1


For any fixed λ > 0, the set of all
                   1 λa λ2c
                               

               0      1   λb 
                               

                   0   0   1


with a, b, c ∈ Z, is a subgroup, Γλ, which,
up to isomorphism, is independent of λ.

The quotients, H/Γλ are compact and mu-
tally diffeomorphic, with nilpotent funda-
mental group Γλ = Γ1.



                                     9
Equip H with a Riemannian metric which
is right-invariant and hence, has bounded
curvature.

The curvature of the induced metric on
H/Γλ is bounded independent of λ.

As λ → 0,

            diam(H/Γλ) ∼ λ → 0 ,
while the curvature stays bounded.

After multiplying the metric on H/Γλ by a
        −1
factor, λ2   , one obtains a family for which



                             1
            diam(H/Γλ) ∼   λ 2   → 0,

               |KM n | ∼ λ → 0 .




                                        10
By the early 1970’s Gromov had proved a
striking converse:

Theorem. (Gromov) Every manifold ad-
mitting a sequence of metrics such that
the diameter and curvature go to zero is
finitely covered by a nilmanifold.




The proof introduced many new ideas and
techniques which were subsequently used
in describing the general phenomonenon of
“collapse with bounded curvature”.

Even today, the proof is not easy.




                                     11
Remark: In 1982, E. Ruh, introduced an-
alytic techniques into the discussion and
made the nature of the finite covering pre-
cise (as had been suggested by Gromov).




Remark. It was in the context of almost
flat manifolds, that Gromov invented the
“Gromov-Hausdorff distance”.

His motivation was to describe precisely,
the phenomenon of higher dimensional spaces
converging geometrically to lower ones.




                                    12
Arrival in Stony Brook, 1974.

The experience of meeting in person, the
man who was known primarily for the strange
result on positive and negative curvature,
remains vivd in my mind after 35 years.

Initial curiosity rapidly gave way to shock.

After some weeks of listening to Misha, I
remarked to Dennis Sullivan:

“I have the impression that more than half
of what is known in Riemannian geometry
is known only to Gromov.”

A bit later Detlef Gromoll said to me:

“Misha is one of the great minds of the
century, I don’t know how he does it, he
understands everything in the simplest pos-
sible way.”

                                       13
Already visible characteristics.

A strongly geometric perspective, also ap-
plied in other fields.

A pronounced interest in discrete groups.

Introduction of “rough” notions in geome-
try (Gromov-Hausdorff distance).

Thinking in terms of structures.

Identification inside the work of others, of
the simple essential principles, with far reach-
ing consequences.

Strikingly original results.




                                        14
Pronouncements worth pondering.

Next we look at some statements of Misha.

They seem to reflect in part, a continuation
of themes that have already been noted.




                                     15
Oral communication:

• “Quite often, famous problems are fa-
mous primarily because they have remained
open for a long time,

Intrinsically they may not be so interesting.

When they are finally solved, the really sig-
nificant point is often some statement which
remains buried inside the proof.”




                                       16
From “Spaces and questions”.

• “A common way to generate questions
(not only) in geometry is to confront prop-
erties of objects specific to different cat-
egories: what is a possible topology (e.g.
homology) of a manifold with a given type
of curvature? ...

These seduce us by simplicity and apparent
naturality, sometimes leading to new ideas
and structures ... but often the mirage of
naturality lures us into a featureless desert,
where the solution, even if found, does not
quench our thirst for structural mathemat-
ics.”




                                        17
Oral communication:

“Many people don’t really think about what
they do.”




                                    18
Continuation of the discussion from “Spaces
and questions”.

• “Another approach consists in interbreed-
ing (rather than intersecting) categories and
ideas.

For example, random graphs, differential
topology, p-adic analysis, . . .

This has a better chance for a successful
outcome, with questions following (rather
than preceding) construction of new ob-
jects.”




Remark. Compare also “hyperbolic groups”,
“random groups”, etc.




                                       19
From “Stability and pinching”.

• “What may be new and interesting for
non-experts is an exposition of the stabil-
ity/pinching philosopy which lies behind the
basic results and methods in the field and
which is rarely (if ever) presented in print.

This common and unfortunate fact of the
lack of adequate presentation of basic ideas
and motivations of almost any mathemat-
ical theory is probably due to the binary
nature of mathematical perception.

Either you have no inkling of and idea or,
once you have understood it, the very idea
appears so embarassingly obvious that you
feel reluctant to say it aloud ...”




                                       20
Oral communication (concerning the Gromov-
Hausdorff distance):

• “I knew it for a long time, but it seemed
too trivial to write.

Sometimes you just have to say it.”




                                      21
Structural thinking versus technique.

Oral communication:

• “There is a temptation for people who
are extremely powerful to rely on technique
rather than structural thinking, because for
them, it is so much easier.

At the highest level of technique, structure
can emerge, as with say Jacobi and certain
of his present day counterparts.

Both structural thinking and technique are
necessary; most people are more naturally
inclined to one or the other.”




                                      22
Dennis Sullivan (oral communication):

“Sometimes Gromov secretly computes.

He computes by logic.”




                                    23
Soft and hard structures.

The relation between “soft” and “hard”
structures plays a major role in much of
Gromov’s work.

From his 1986 ICM talk: “Soft and hard
sympectic geometry”:

• “Intuitively, hard refers to a strong and
rigid structure of a given object, while soft
refers to some weak general property of a
vast class of objects.”

For further discussion, see also “Spaces and
questions”.




                                       24
J-holomorphic curves.

A symplectic structure on a smooth man-
ifold, M 2n, is a closed 2-form, ω, of maxi-
mal rank i.e. the n-fold wedge product of
ω with itself is nonzero.

By Darboux’s theorem, in suitable local co-
ordinates, we can always write

   ω = dx1 ∧ dx2 + · · · + dx2n−1 ∧ dx2n .


Therefore, locally, the subject is completely
soft i.e. all symplectic forms are locally
equivalent.




                                        25
Gromov revolutionized symplectic geome-
try by introducing elliptic methods which
“hardened” or “rigidified” the structure.

His bold stroke was to choose a Riemannian
metric g and an almost complex structure
J such that one can write

            ω(x, y) = g(Jx, y) .




Remark. This must have been noticed be-
fore and judged not not to be helpful, since
in general, J can not be chosen to be inte-
grable.




                                      26
Let J1 denote the standard complex struc-
ture on C and let f : C → M 2n.

Gromov observed that the equation,

              df ◦ J1 = J ◦ df ,
has the same linearization as that of the
Cauchy-Riemann operator for maps

                f : C → Cn .


This enabled him to associate moduli spaces
of J-holomorphic curves to (M 2k , ω), whose
essential properties were independent of the
choice of J.

Here we suppress a lot that is crucial, in-
cluding the role of “positivity” of the metric
in “taming” the almost complex structure.




                                        27
The “nonsqueezing” theorem.

Let V1 denote the ball of radius r in Cn and
let V2 denote the R-tubular neighborhood
of Cn−1 ⊂ Cn.

Let zj = xj + iyj and let ω denote the stan-
dard symplectic form,

   ω = dx1 ∧ dx2 + · · · + dx2n−1 ∧ dx2n .




Theorem. If there exists a simplectic em-
bedding, f : V1 → V2, i.e.

                f ∗(ω) = ω ,
then
                   r < R.




                                        28
The Gromov-Hausdorff distance.

In proving the polynomial growth conjec-
ture, Gromov employed a soft geometric
tool, the Gromov-Hausdorff distance, in the
solution of a discrete algebraic problem.

Subsequently, the Gromov-Hausdorff dis-
tance, has been used in Riemannian geom-
etry to the study the shapes of manifolds
with Ricci curvature bounded below.

In particular, it has been used to study de-
generations of Einstein metrics which, by
definition, are solutions of the highly non-
linear elliptic system

              RicM n = λ · g .




                                      29
Definition.

If X, Y are compact subsets of a metric
space Z, the Hausdorff distance, dH (X, Y ),
is defined as the infimal ǫ, such that:

X is contained in the ǫ-tubular neighbor-
hood of Y , and Y is contained in the
ǫ-tubular neighborhood of X.

More generally, if X, Y are compact met-
ric spaces, define their Gromov-Hausdorff
distance, dGH (X, Y ), to be:

The infimum of the collection of Hausdorff
distances obtained from pairs isometric em-
beddings of X and Y into the same metric
space Z.




                                     30
Inuition.

Intuitively, dGH (X, Y ) is small if X, Y are
hard to distinguish with the naked eye, al-
though they may look entirely different un-
der the microscope.

Thus, with respect to dGH , a finite segment
of a thin cylinder is close to a line segment.

Remark. We should consider isometry classes,
since what we defined is actually a pseudo-
distance.




                                        31
Gromov’s compactness theorem.

Let d > 0, and N (ǫ) : (0, 1] → Z+ denote
some function.

Let X (d, N (ǫ)) denote the collection of isom-
etry classes of compact metric spaces, X,
with
               diam(X) ≤ d ,
and such that for all ǫ > 0, there an ǫ-dense
subset with ≤ N (ǫ) members

The collection, X (d, N (ǫ)), is said to be
uniformly totally bounded.




                                        32
Theorem. The collection, X (d, N (ǫ)), is
compact with respect to the topology in-
duced by dGH .

Proof: Use the pigeon hole principle and a
diagonal argument.




This compactness theorem is an elemen-
tary result, whose proof is not difficult.

It nonetheless, the theorem constitutes a
powerful organizing principle.




                                    33
Ricci curvature bounded below.

The Bishop-Gromov inequality in Rieman-
nian geometry controls ratios of volumes of
concentric metric balls for manifolds with a
definite lower bound on Ricci curvature

           RicM n ≥ (n − 1)H · g .




It implies a doubling condition, for r ≤ R,

   Vol(B2r (x)) ≤ c(n, H, R) · Vol(Br (x)) .


Here,

        Br (x) := {y | dist(y, x) < r} .




                                           34
Let M(d, H, n) denote the collection of isom-
etry classes of Riemannian manifolds M n,
with
              diam(M n) ≤ d ,

           RicM n ≥ (n − 1)H · g .




By a well known easy consequence of the
doubling condition:

For all M n ∈ M(d, H, n), there is an ǫ-dense
set with ≤ N (ǫ, c(n, H, d)) members.

Thus, M(d, H, n) is uniformly totally bounded.




Corollary. M(d, H, n) is precompact with
repect to the topology induced by dGH .


                                       35
Application to potential bad behavior.

Consider the possible existence of a sequence
of manifolds, Min, in M(d, H, n), exhibiting
some specific sort of arbitrarily bad geo-
metric behavior as i → ∞.

After passing to a subsequence, we find a
                         n dGH M .
convergent subsequence, Mj −→ ∞

By analogy with the theory of distributions
or Sobolev spaces, we think of M∞ as some
kind of generalized riemannian manifold with
bounded diameter and Ricci tensor bounded
below.

Suppose next, that we actually know some
properties of M∞ — the analog of a Sobolev
embedding theorem.



                                      36
In favorable cases be able to conclude that
the putative arbitrarily badly behaving se-
quence could not have existed.

But a priori, we have virtually no idea at all
what the limiting objects M∞ look like.

Indeed, the possible existence of such po-
tentially bizarre objects arising from Rie-
mannin geometry was initially quite disturb-
ing.

Even worse, it seems like the only way of
getting information on M∞ is to have uni-
form information on the sequence Mj .

Thus, the program looks circular.




                                        37
However.

It is true that getting some initial control
over M∞ requires uniform information on
   n
Mj .

But once it has been obtained, it can be
used to argue directly on M∞, to obtain
more properties.

This in turn, gives new information on the
             n
sequence, Mj , etc.




                                      38
An exception that proves the rule.

Over and over, Gromov has invented new
techniques enabling him to deal with prob-
lems which otherwise would have been com-
pletely out of reach.

But in at least one instance, things went
differently.

For simplicity, we state a special case of
the estimate he proved.




                                    39
The Betti number estimate.

Let bi(M n) denote the i-th Betti number
of the manifold M n with coefficients some
arbitrary fixed field F .

Theorem. There is a constant, c(n), such
that if M n denotes a complete Riemannian
manifold with nonnegative sectional curva-
ture, then
             n
                  bi(M n) ≤ c(n) .
            i=0




Remark. It is still conceivable that on can
choose c(n) = 2n, as holds for the n-torus.




                                     40
Critical points of distance functions.

In Riemannian geometry, distance functions,

           distp(x) := dist(x, p) ,
are, of course Lipschitz, but need not be
smooth.

K Grove and K. Shiohama observed that for
these functions, there is a notion of criti-
cal point for which the Isotopy Lemma of
Morse theory holds.

They used it to prove a beautiful general-
ization of Berger’s sphere theorem.

Unfortunately, in general, there is no ana-
logue of the Morse Lemma.




                                      41
When Misha announced that he had used
the Grove-Shiohama technique to obtain
the Betti number estimate, I was stunned,

Was there in fact, an analog of the Morse
Lemma?

No, it turned out that he had invented a
new method of estimating Betti numbers
based on the Isotopy Lemma!

In the whole proof, nonnegative curvature
was used only once, in a key lemma, whose
rather standard proof, took only a few lines.

But as far as I know, Misha’s method has
had no further applications.




                                       42
This proves that no one is perfect!




                                      43

Más contenido relacionado

La actualidad más candente

National mathematics
National mathematicsNational mathematics
National mathematics
Sanketh Sanki
 
Prof.c.r.rao
Prof.c.r.raoProf.c.r.rao
Prof.c.r.rao
RuchiMehta52
 

La actualidad más candente (20)

The greatest mathematicians of all times
The greatest mathematicians of all timesThe greatest mathematicians of all times
The greatest mathematicians of all times
 
Complex number
Complex numberComplex number
Complex number
 
The Three Greatest Women Mathematicians
The Three Greatest Women MathematiciansThe Three Greatest Women Mathematicians
The Three Greatest Women Mathematicians
 
Application of Linear Algebra in Electrical Circuit
Application of Linear Algebra in Electrical CircuitApplication of Linear Algebra in Electrical Circuit
Application of Linear Algebra in Electrical Circuit
 
National mathematics
National mathematicsNational mathematics
National mathematics
 
Leonhard euler
Leonhard eulerLeonhard euler
Leonhard euler
 
Coal 10 instruction cycle and interrupts in Assembly Programming
Coal 10 instruction cycle and interrupts in Assembly ProgrammingCoal 10 instruction cycle and interrupts in Assembly Programming
Coal 10 instruction cycle and interrupts in Assembly Programming
 
Top 10 Mathematician
Top 10 MathematicianTop 10 Mathematician
Top 10 Mathematician
 
Srinivasa Ramanujan
Srinivasa Ramanujan Srinivasa Ramanujan
Srinivasa Ramanujan
 
Pascal- triangle- 134929855
Pascal- triangle- 134929855Pascal- triangle- 134929855
Pascal- triangle- 134929855
 
Sadiq maths ppt
Sadiq maths pptSadiq maths ppt
Sadiq maths ppt
 
John forbes nash
John forbes nashJohn forbes nash
John forbes nash
 
Modern Mathematics
Modern MathematicsModern Mathematics
Modern Mathematics
 
Women in mathematics
Women in mathematicsWomen in mathematics
Women in mathematics
 
Numerical integration
Numerical integrationNumerical integration
Numerical integration
 
Why do we study Math?
Why do we study Math?Why do we study Math?
Why do we study Math?
 
Prof.c.r.rao
Prof.c.r.raoProf.c.r.rao
Prof.c.r.rao
 
Leonhard Paul Euler
Leonhard Paul  EulerLeonhard Paul  Euler
Leonhard Paul Euler
 
Leonhard Euler
Leonhard EulerLeonhard Euler
Leonhard Euler
 
Pigeon hole principle
Pigeon hole principlePigeon hole principle
Pigeon hole principle
 

Destacado

Sales presentation market explore-english
Sales presentation   market explore-englishSales presentation   market explore-english
Sales presentation market explore-english
Rachid QCHIQACH
 
OICX Retail Customer Experience
OICX Retail Customer ExperienceOICX Retail Customer Experience
OICX Retail Customer Experience
Damian Kernahan
 
Email &amp; Social Media Training
Email &amp; Social Media TrainingEmail &amp; Social Media Training
Email &amp; Social Media Training
William Mann
 
Klasifikasi pesan non verbal dan konsep waktu
Klasifikasi pesan non verbal dan konsep waktuKlasifikasi pesan non verbal dan konsep waktu
Klasifikasi pesan non verbal dan konsep waktu
Robby Zf
 
CityU academic transcript 2015
CityU academic transcript 2015CityU academic transcript 2015
CityU academic transcript 2015
Wing Tsun Lee
 
Answers in environmental education @kaye
Answers in environmental education @kayeAnswers in environmental education @kaye
Answers in environmental education @kaye
Cee Saliendrez
 

Destacado (18)

Pass Love Charity Foundation (PLCF)
Pass Love Charity Foundation (PLCF)Pass Love Charity Foundation (PLCF)
Pass Love Charity Foundation (PLCF)
 
quick sort by student of NUML university
quick sort by student of NUML universityquick sort by student of NUML university
quick sort by student of NUML university
 
Sales presentation market explore-english
Sales presentation   market explore-englishSales presentation   market explore-english
Sales presentation market explore-english
 
Microsoft Technical Webinar: Doing more with MS Office, SharePoint and Visual...
Microsoft Technical Webinar: Doing more with MS Office, SharePoint and Visual...Microsoft Technical Webinar: Doing more with MS Office, SharePoint and Visual...
Microsoft Technical Webinar: Doing more with MS Office, SharePoint and Visual...
 
Quiz 3 (answer)
Quiz 3 (answer)Quiz 3 (answer)
Quiz 3 (answer)
 
Thinking Outside the Box that Keeps Moving
Thinking Outside the Box that Keeps MovingThinking Outside the Box that Keeps Moving
Thinking Outside the Box that Keeps Moving
 
Ziemia kielecka 1
Ziemia kielecka 1Ziemia kielecka 1
Ziemia kielecka 1
 
OICX Retail Customer Experience
OICX Retail Customer ExperienceOICX Retail Customer Experience
OICX Retail Customer Experience
 
Status report1
Status report1Status report1
Status report1
 
工作人生
工作人生工作人生
工作人生
 
Email &amp; Social Media Training
Email &amp; Social Media TrainingEmail &amp; Social Media Training
Email &amp; Social Media Training
 
Klasifikasi pesan non verbal dan konsep waktu
Klasifikasi pesan non verbal dan konsep waktuKlasifikasi pesan non verbal dan konsep waktu
Klasifikasi pesan non verbal dan konsep waktu
 
365 产品介绍 产品推广app_20150721
365 产品介绍 产品推广app_20150721365 产品介绍 产品推广app_20150721
365 产品介绍 产品推广app_20150721
 
CityU academic transcript 2015
CityU academic transcript 2015CityU academic transcript 2015
CityU academic transcript 2015
 
2
22
2
 
Answers in environmental education @kaye
Answers in environmental education @kayeAnswers in environmental education @kaye
Answers in environmental education @kaye
 
Tap lenh co_ban
Tap lenh co_banTap lenh co_ban
Tap lenh co_ban
 
Info penting
Info pentingInfo penting
Info penting
 

Similar a Mikhail Gromov - How Does He Do It?

Singula holomorphic foliations on cp3 shfc zak
Singula holomorphic foliations on cp3 shfc zakSingula holomorphic foliations on cp3 shfc zak
Singula holomorphic foliations on cp3 shfc zak
Francisco Inuma
 
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, VOL. XIII, 001.docx
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, VOL. XIII, 001.docxCOMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, VOL. XIII, 001.docx
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, VOL. XIII, 001.docx
pickersgillkayne
 

Similar a Mikhail Gromov - How Does He Do It? (20)

Singula holomorphic foliations on cp3 shfc zak
Singula holomorphic foliations on cp3 shfc zakSingula holomorphic foliations on cp3 shfc zak
Singula holomorphic foliations on cp3 shfc zak
 
Equations Over Local Monodromies
Equations Over Local MonodromiesEquations Over Local Monodromies
Equations Over Local Monodromies
 
Tot d isomorphism2
Tot d isomorphism2Tot d isomorphism2
Tot d isomorphism2
 
list of mathematician
list of mathematicianlist of mathematician
list of mathematician
 
Millennium prize problems powerpoint presentation
Millennium prize problems powerpoint presentationMillennium prize problems powerpoint presentation
Millennium prize problems powerpoint presentation
 
Fractal geometry
Fractal geometryFractal geometry
Fractal geometry
 
Teste
TesteTeste
Teste
 
Paracompact Space Literature Survey
Paracompact Space Literature SurveyParacompact Space Literature Survey
Paracompact Space Literature Survey
 
The search for certainty
The search for certaintyThe search for certainty
The search for certainty
 
Mathematics
MathematicsMathematics
Mathematics
 
Steiner-Lehmus Direct Proof
Steiner-Lehmus Direct Proof Steiner-Lehmus Direct Proof
Steiner-Lehmus Direct Proof
 
Minimality in homological PDE- Charles E. Rodgers - 2019
Minimality in homological PDE- Charles E. Rodgers - 2019Minimality in homological PDE- Charles E. Rodgers - 2019
Minimality in homological PDE- Charles E. Rodgers - 2019
 
Term Paper
Term PaperTerm Paper
Term Paper
 
Descriptive Granularity - Building Foundations of Data Mining
Descriptive Granularity - Building Foundations of Data MiningDescriptive Granularity - Building Foundations of Data Mining
Descriptive Granularity - Building Foundations of Data Mining
 
David hume and the limits of mathematical reason
David hume and the limits of mathematical reasonDavid hume and the limits of mathematical reason
David hume and the limits of mathematical reason
 
David hume and the limits of mathematical reason
David hume and the limits of mathematical reasonDavid hume and the limits of mathematical reason
David hume and the limits of mathematical reason
 
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, VOL. XIII, 001.docx
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, VOL. XIII, 001.docxCOMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, VOL. XIII, 001.docx
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, VOL. XIII, 001.docx
 
Paper
PaperPaper
Paper
 
Reviewer-in-HOM.docx
Reviewer-in-HOM.docxReviewer-in-HOM.docx
Reviewer-in-HOM.docx
 
Forca Barca Math's quiz finals
Forca Barca Math's quiz finalsForca Barca Math's quiz finals
Forca Barca Math's quiz finals
 

Último

Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers:  A Deep Dive into Serverless Spatial Data and FMECloud Frontiers:  A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Safe Software
 
Why Teams call analytics are critical to your entire business
Why Teams call analytics are critical to your entire businessWhy Teams call analytics are critical to your entire business
Why Teams call analytics are critical to your entire business
panagenda
 
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Victor Rentea
 
Finding Java's Hidden Performance Traps @ DevoxxUK 2024
Finding Java's Hidden Performance Traps @ DevoxxUK 2024Finding Java's Hidden Performance Traps @ DevoxxUK 2024
Finding Java's Hidden Performance Traps @ DevoxxUK 2024
Victor Rentea
 

Último (20)

Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin WoodPolkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
 
Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...
 
Spring Boot vs Quarkus the ultimate battle - DevoxxUK
Spring Boot vs Quarkus the ultimate battle - DevoxxUKSpring Boot vs Quarkus the ultimate battle - DevoxxUK
Spring Boot vs Quarkus the ultimate battle - DevoxxUK
 
ICT role in 21st century education and its challenges
ICT role in 21st century education and its challengesICT role in 21st century education and its challenges
ICT role in 21st century education and its challenges
 
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
 
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers:  A Deep Dive into Serverless Spatial Data and FMECloud Frontiers:  A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
 
Exploring the Future Potential of AI-Enabled Smartphone Processors
Exploring the Future Potential of AI-Enabled Smartphone ProcessorsExploring the Future Potential of AI-Enabled Smartphone Processors
Exploring the Future Potential of AI-Enabled Smartphone Processors
 
Ransomware_Q4_2023. The report. [EN].pdf
Ransomware_Q4_2023. The report. [EN].pdfRansomware_Q4_2023. The report. [EN].pdf
Ransomware_Q4_2023. The report. [EN].pdf
 
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot TakeoffStrategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
 
TrustArc Webinar - Unlock the Power of AI-Driven Data Discovery
TrustArc Webinar - Unlock the Power of AI-Driven Data DiscoveryTrustArc Webinar - Unlock the Power of AI-Driven Data Discovery
TrustArc Webinar - Unlock the Power of AI-Driven Data Discovery
 
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
 
Why Teams call analytics are critical to your entire business
Why Teams call analytics are critical to your entire businessWhy Teams call analytics are critical to your entire business
Why Teams call analytics are critical to your entire business
 
Cyberprint. Dark Pink Apt Group [EN].pdf
Cyberprint. Dark Pink Apt Group [EN].pdfCyberprint. Dark Pink Apt Group [EN].pdf
Cyberprint. Dark Pink Apt Group [EN].pdf
 
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWEREMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
 
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
 
2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...
 
Finding Java's Hidden Performance Traps @ DevoxxUK 2024
Finding Java's Hidden Performance Traps @ DevoxxUK 2024Finding Java's Hidden Performance Traps @ DevoxxUK 2024
Finding Java's Hidden Performance Traps @ DevoxxUK 2024
 
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost SavingRepurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
 
Exploring Multimodal Embeddings with Milvus
Exploring Multimodal Embeddings with MilvusExploring Multimodal Embeddings with Milvus
Exploring Multimodal Embeddings with Milvus
 
Boost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdfBoost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdf
 

Mikhail Gromov - How Does He Do It?

  • 1. HOW DOES HE DO IT? Jeff Cheeger 1
  • 2. From Gromov’s Abel Prize Citation: • A decisive role in the creation of modern global Riemannian geometry. • One of the founders of symplectic geom- etry, in particular, he created the theory of J-holomorphic curves, which led to the cre- ation of symplectic topology and became linked to quantum field theory. • His solution of the conjecture that groups of polynomial growth are almost nilpotent introduced ideas which forever changed the way a discrete infinite group is viewed and his geometrical approach rendered combi- natorial ideas much more natural and pow- erful. 2
  • 3. Further influence, broad view point. Apart from group theory, other fields such as partial differential equations have been strongly influenced by Gromov’s introduc- tion of a geometric perspective. He has a deep and detailed understanding of many areas which are seemingly far from geometry — ask anyone who has attended a lecture with Gromov in the audience. As an example, the finitely generated group discussion includes, not only hyperbolic groups (incorporating a synthetic asymptotic gen- eralization of negative curvature) but also, “random groups” and ideas from algorith- mic complexity. 3
  • 4. Early influences. Gromov cites the “obviously nonsensical” work of Nash on the isometric imbedding problem and Smale on turning the 2-sphere inside out, as strong early influences. These led to his work far reaching work on the “h-principle” and “convex integration”. Another strong influence was the work of Kazhdan-Margulis which associated nontriv- ial nilpotent subgroups to the “thin” parts of locally homogeneous spaces. This led to his work on “almost flat man- ifolds” and subsequently, to many other works in geometry and discrete groups. 4
  • 5. The h-principle. It asserts very roughly, that for “most un- der determined” partial differential equa- tions arising, the “obvious” obstructions to the existence of a solution are the only ones and the solutions are rather dense in a ap- propriate function spaces. Intuition derived from classical equations of mathematical physics, makes the above statement seem totally counterintuitive. Gromov invented a general tool, called “con- vex integration”, which can be used for ver- ify the h-principle in many specific cases. These ideas, which were later elaborated in Gromov’s book: “Partial differential rela- tions”, have slowly been assimilated, though the full effects are likely yet to be felt. 5
  • 6. A startling application. Every open manifold admits a (generally incomplete) Riemannian metric of positive curvature and also one of negative curva- ture. Gromov (age 26) included this striking but puzzling result in his talk at the 1970 ICM held in Nice. Prior to his arrival in Stony Brook in 1974, this was the theorem for which Gromov was primarily known in the west. 6
  • 7. Almost flat manifolds. If the metric, g, of a Riemannian manifold is multiplied by a constant η 2 > 0, then the curvature gets multiplied by η −2, K(M n,η 2·g) = η −2 · K(M n,g) . In almost all cases, as η → 0, diam(M n, η 2 · g) → 0 , and the curvature blows up. The only exception is the case of flat man- ifolds, K(M n,g) ≡ 0 . Bieberbach’s theorem states that the fun- damental group of a flat manifold has a free abelian subgroup of finite index. 7
  • 8. By the 1960’s, members of the Russian school were aware that there exist com- pact smooth manifolds with the following startling properties: • They admit a sequence of Riemannian metrics, gλ, such that as λ → 0, the diame- ter goes to zero and the curvature goes to zero. • The fundamental groups of these man- ifolds are nilpotent, but have no abelian subgroup of finite index. From the second property and Bieberbach’s theorem, it follows that these manifolds ad- mit no flat metric. Next we describe the simplest example. 8
  • 9. The 3-dimensional Heisenberg group. Let H denote R3 = (a, b, c) viewed as the nilpotent matrix group   1 a c 0 1 b    0 0 1 For any fixed λ > 0, the set of all 1 λa λ2c   0 1 λb    0 0 1 with a, b, c ∈ Z, is a subgroup, Γλ, which, up to isomorphism, is independent of λ. The quotients, H/Γλ are compact and mu- tally diffeomorphic, with nilpotent funda- mental group Γλ = Γ1. 9
  • 10. Equip H with a Riemannian metric which is right-invariant and hence, has bounded curvature. The curvature of the induced metric on H/Γλ is bounded independent of λ. As λ → 0, diam(H/Γλ) ∼ λ → 0 , while the curvature stays bounded. After multiplying the metric on H/Γλ by a −1 factor, λ2 , one obtains a family for which 1 diam(H/Γλ) ∼ λ 2 → 0, |KM n | ∼ λ → 0 . 10
  • 11. By the early 1970’s Gromov had proved a striking converse: Theorem. (Gromov) Every manifold ad- mitting a sequence of metrics such that the diameter and curvature go to zero is finitely covered by a nilmanifold. The proof introduced many new ideas and techniques which were subsequently used in describing the general phenomonenon of “collapse with bounded curvature”. Even today, the proof is not easy. 11
  • 12. Remark: In 1982, E. Ruh, introduced an- alytic techniques into the discussion and made the nature of the finite covering pre- cise (as had been suggested by Gromov). Remark. It was in the context of almost flat manifolds, that Gromov invented the “Gromov-Hausdorff distance”. His motivation was to describe precisely, the phenomenon of higher dimensional spaces converging geometrically to lower ones. 12
  • 13. Arrival in Stony Brook, 1974. The experience of meeting in person, the man who was known primarily for the strange result on positive and negative curvature, remains vivd in my mind after 35 years. Initial curiosity rapidly gave way to shock. After some weeks of listening to Misha, I remarked to Dennis Sullivan: “I have the impression that more than half of what is known in Riemannian geometry is known only to Gromov.” A bit later Detlef Gromoll said to me: “Misha is one of the great minds of the century, I don’t know how he does it, he understands everything in the simplest pos- sible way.” 13
  • 14. Already visible characteristics. A strongly geometric perspective, also ap- plied in other fields. A pronounced interest in discrete groups. Introduction of “rough” notions in geome- try (Gromov-Hausdorff distance). Thinking in terms of structures. Identification inside the work of others, of the simple essential principles, with far reach- ing consequences. Strikingly original results. 14
  • 15. Pronouncements worth pondering. Next we look at some statements of Misha. They seem to reflect in part, a continuation of themes that have already been noted. 15
  • 16. Oral communication: • “Quite often, famous problems are fa- mous primarily because they have remained open for a long time, Intrinsically they may not be so interesting. When they are finally solved, the really sig- nificant point is often some statement which remains buried inside the proof.” 16
  • 17. From “Spaces and questions”. • “A common way to generate questions (not only) in geometry is to confront prop- erties of objects specific to different cat- egories: what is a possible topology (e.g. homology) of a manifold with a given type of curvature? ... These seduce us by simplicity and apparent naturality, sometimes leading to new ideas and structures ... but often the mirage of naturality lures us into a featureless desert, where the solution, even if found, does not quench our thirst for structural mathemat- ics.” 17
  • 18. Oral communication: “Many people don’t really think about what they do.” 18
  • 19. Continuation of the discussion from “Spaces and questions”. • “Another approach consists in interbreed- ing (rather than intersecting) categories and ideas. For example, random graphs, differential topology, p-adic analysis, . . . This has a better chance for a successful outcome, with questions following (rather than preceding) construction of new ob- jects.” Remark. Compare also “hyperbolic groups”, “random groups”, etc. 19
  • 20. From “Stability and pinching”. • “What may be new and interesting for non-experts is an exposition of the stabil- ity/pinching philosopy which lies behind the basic results and methods in the field and which is rarely (if ever) presented in print. This common and unfortunate fact of the lack of adequate presentation of basic ideas and motivations of almost any mathemat- ical theory is probably due to the binary nature of mathematical perception. Either you have no inkling of and idea or, once you have understood it, the very idea appears so embarassingly obvious that you feel reluctant to say it aloud ...” 20
  • 21. Oral communication (concerning the Gromov- Hausdorff distance): • “I knew it for a long time, but it seemed too trivial to write. Sometimes you just have to say it.” 21
  • 22. Structural thinking versus technique. Oral communication: • “There is a temptation for people who are extremely powerful to rely on technique rather than structural thinking, because for them, it is so much easier. At the highest level of technique, structure can emerge, as with say Jacobi and certain of his present day counterparts. Both structural thinking and technique are necessary; most people are more naturally inclined to one or the other.” 22
  • 23. Dennis Sullivan (oral communication): “Sometimes Gromov secretly computes. He computes by logic.” 23
  • 24. Soft and hard structures. The relation between “soft” and “hard” structures plays a major role in much of Gromov’s work. From his 1986 ICM talk: “Soft and hard sympectic geometry”: • “Intuitively, hard refers to a strong and rigid structure of a given object, while soft refers to some weak general property of a vast class of objects.” For further discussion, see also “Spaces and questions”. 24
  • 25. J-holomorphic curves. A symplectic structure on a smooth man- ifold, M 2n, is a closed 2-form, ω, of maxi- mal rank i.e. the n-fold wedge product of ω with itself is nonzero. By Darboux’s theorem, in suitable local co- ordinates, we can always write ω = dx1 ∧ dx2 + · · · + dx2n−1 ∧ dx2n . Therefore, locally, the subject is completely soft i.e. all symplectic forms are locally equivalent. 25
  • 26. Gromov revolutionized symplectic geome- try by introducing elliptic methods which “hardened” or “rigidified” the structure. His bold stroke was to choose a Riemannian metric g and an almost complex structure J such that one can write ω(x, y) = g(Jx, y) . Remark. This must have been noticed be- fore and judged not not to be helpful, since in general, J can not be chosen to be inte- grable. 26
  • 27. Let J1 denote the standard complex struc- ture on C and let f : C → M 2n. Gromov observed that the equation, df ◦ J1 = J ◦ df , has the same linearization as that of the Cauchy-Riemann operator for maps f : C → Cn . This enabled him to associate moduli spaces of J-holomorphic curves to (M 2k , ω), whose essential properties were independent of the choice of J. Here we suppress a lot that is crucial, in- cluding the role of “positivity” of the metric in “taming” the almost complex structure. 27
  • 28. The “nonsqueezing” theorem. Let V1 denote the ball of radius r in Cn and let V2 denote the R-tubular neighborhood of Cn−1 ⊂ Cn. Let zj = xj + iyj and let ω denote the stan- dard symplectic form, ω = dx1 ∧ dx2 + · · · + dx2n−1 ∧ dx2n . Theorem. If there exists a simplectic em- bedding, f : V1 → V2, i.e. f ∗(ω) = ω , then r < R. 28
  • 29. The Gromov-Hausdorff distance. In proving the polynomial growth conjec- ture, Gromov employed a soft geometric tool, the Gromov-Hausdorff distance, in the solution of a discrete algebraic problem. Subsequently, the Gromov-Hausdorff dis- tance, has been used in Riemannian geom- etry to the study the shapes of manifolds with Ricci curvature bounded below. In particular, it has been used to study de- generations of Einstein metrics which, by definition, are solutions of the highly non- linear elliptic system RicM n = λ · g . 29
  • 30. Definition. If X, Y are compact subsets of a metric space Z, the Hausdorff distance, dH (X, Y ), is defined as the infimal ǫ, such that: X is contained in the ǫ-tubular neighbor- hood of Y , and Y is contained in the ǫ-tubular neighborhood of X. More generally, if X, Y are compact met- ric spaces, define their Gromov-Hausdorff distance, dGH (X, Y ), to be: The infimum of the collection of Hausdorff distances obtained from pairs isometric em- beddings of X and Y into the same metric space Z. 30
  • 31. Inuition. Intuitively, dGH (X, Y ) is small if X, Y are hard to distinguish with the naked eye, al- though they may look entirely different un- der the microscope. Thus, with respect to dGH , a finite segment of a thin cylinder is close to a line segment. Remark. We should consider isometry classes, since what we defined is actually a pseudo- distance. 31
  • 32. Gromov’s compactness theorem. Let d > 0, and N (ǫ) : (0, 1] → Z+ denote some function. Let X (d, N (ǫ)) denote the collection of isom- etry classes of compact metric spaces, X, with diam(X) ≤ d , and such that for all ǫ > 0, there an ǫ-dense subset with ≤ N (ǫ) members The collection, X (d, N (ǫ)), is said to be uniformly totally bounded. 32
  • 33. Theorem. The collection, X (d, N (ǫ)), is compact with respect to the topology in- duced by dGH . Proof: Use the pigeon hole principle and a diagonal argument. This compactness theorem is an elemen- tary result, whose proof is not difficult. It nonetheless, the theorem constitutes a powerful organizing principle. 33
  • 34. Ricci curvature bounded below. The Bishop-Gromov inequality in Rieman- nian geometry controls ratios of volumes of concentric metric balls for manifolds with a definite lower bound on Ricci curvature RicM n ≥ (n − 1)H · g . It implies a doubling condition, for r ≤ R, Vol(B2r (x)) ≤ c(n, H, R) · Vol(Br (x)) . Here, Br (x) := {y | dist(y, x) < r} . 34
  • 35. Let M(d, H, n) denote the collection of isom- etry classes of Riemannian manifolds M n, with diam(M n) ≤ d , RicM n ≥ (n − 1)H · g . By a well known easy consequence of the doubling condition: For all M n ∈ M(d, H, n), there is an ǫ-dense set with ≤ N (ǫ, c(n, H, d)) members. Thus, M(d, H, n) is uniformly totally bounded. Corollary. M(d, H, n) is precompact with repect to the topology induced by dGH . 35
  • 36. Application to potential bad behavior. Consider the possible existence of a sequence of manifolds, Min, in M(d, H, n), exhibiting some specific sort of arbitrarily bad geo- metric behavior as i → ∞. After passing to a subsequence, we find a n dGH M . convergent subsequence, Mj −→ ∞ By analogy with the theory of distributions or Sobolev spaces, we think of M∞ as some kind of generalized riemannian manifold with bounded diameter and Ricci tensor bounded below. Suppose next, that we actually know some properties of M∞ — the analog of a Sobolev embedding theorem. 36
  • 37. In favorable cases be able to conclude that the putative arbitrarily badly behaving se- quence could not have existed. But a priori, we have virtually no idea at all what the limiting objects M∞ look like. Indeed, the possible existence of such po- tentially bizarre objects arising from Rie- mannin geometry was initially quite disturb- ing. Even worse, it seems like the only way of getting information on M∞ is to have uni- form information on the sequence Mj . Thus, the program looks circular. 37
  • 38. However. It is true that getting some initial control over M∞ requires uniform information on n Mj . But once it has been obtained, it can be used to argue directly on M∞, to obtain more properties. This in turn, gives new information on the n sequence, Mj , etc. 38
  • 39. An exception that proves the rule. Over and over, Gromov has invented new techniques enabling him to deal with prob- lems which otherwise would have been com- pletely out of reach. But in at least one instance, things went differently. For simplicity, we state a special case of the estimate he proved. 39
  • 40. The Betti number estimate. Let bi(M n) denote the i-th Betti number of the manifold M n with coefficients some arbitrary fixed field F . Theorem. There is a constant, c(n), such that if M n denotes a complete Riemannian manifold with nonnegative sectional curva- ture, then n bi(M n) ≤ c(n) . i=0 Remark. It is still conceivable that on can choose c(n) = 2n, as holds for the n-torus. 40
  • 41. Critical points of distance functions. In Riemannian geometry, distance functions, distp(x) := dist(x, p) , are, of course Lipschitz, but need not be smooth. K Grove and K. Shiohama observed that for these functions, there is a notion of criti- cal point for which the Isotopy Lemma of Morse theory holds. They used it to prove a beautiful general- ization of Berger’s sphere theorem. Unfortunately, in general, there is no ana- logue of the Morse Lemma. 41
  • 42. When Misha announced that he had used the Grove-Shiohama technique to obtain the Betti number estimate, I was stunned, Was there in fact, an analog of the Morse Lemma? No, it turned out that he had invented a new method of estimating Betti numbers based on the Isotopy Lemma! In the whole proof, nonnegative curvature was used only once, in a key lemma, whose rather standard proof, took only a few lines. But as far as I know, Misha’s method has had no further applications. 42
  • 43. This proves that no one is perfect! 43