39
Great Solved Problems MUIC Seminar 31 January 2018

Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

  • Upload
    others

  • View
    3

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Great Solved Problems

MUIC Seminar

31 January 2018

Page 2: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

PROBLEMSI (0) Axiom of ChoiceI (1) Continuum HypothesisI (2) Basis Problem, Approximation ProblemI (3) Apery TheoremI (4) Four Color ProblemI (5) Bieberbach ConjectureI (6) Mordell ConjectureI (7) Invariant Subspace ProblemI (8) Fermat Last TheoremI (9) Unconditional Basic SequenceI (10) Maharam ProblemI (11) Poincare HypothesisI (12) Primes in Arithmetic Progression

Page 3: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Problems in Progress

I (13) Goldbach HypothesisI (14) Twin Primes Conjecture

Page 4: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Continuum Hypothesis

Problem (Cantor, 1878; Hilbert, 1900)Every infinite set of real numbers is either countable orhas the same cardinality as R.

FactI (AC) =⇒ every set (in particular, every infinite set of

real numbers) can be put into 1− 1 correspondencewith a cardinal number.

I (CH)⇐⇒ card R = ℵ1 ⇐⇒ 2ℵ0 = ℵ1.

Fact (Godel, 1938)(CH) (and (AC)) is consistent with the (ZF) Axioms.

Page 5: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Theorem (Paul Cohen, 1963; Fields Medal1966)(CH) is undecidable in (ZFC).

Cohen constructed by a new technique of forcing amodel M of (ZFC) (= forcing extension of M(G)) that isalso a model of (ZFC). In this model (CH) is false, i.e.showing that (CH)is independent of (ZFC).

CorollaryThere exists a model of set theory without (AC) where allsets are measurable⇒ (AC) is necessary for existence ofnon–measurable sets.

Page 6: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Basis Problem

DefinitionLet X be a separable Banach space. A sequence {xn}∞n=1is called a (Schauder) basis of X if every element x ∈ Xcan be uniquely represented as

x =∞∑

n=1

anxn ,

with an ∈ R, n = 1,2, . . . .

Problem (Mazur, Scottish Book 1936)Does every separable Banach space have a Schauderbasis ?

Page 7: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Theorem (Per Enflo 1973)There exists a separable Banach space without aSchauder basis.

Page 8: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Approximation ProblemDefinitionA Banach space X has the ApproximationProperty if, forevery Banach space Y the set of finite–rank members ofB(X ,Y ) is dense in K (X ,Y ) (= compact operatorsK : X → Y ).

Problem (Alexandre Grothendieck, Fields Medal1966)Does every separable Banach space have theApproximation Property ?

Theorem (Per Enflo 1973)There exists a separable Banach space without theApproximation Property.

Page 9: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Four Color Problem

Problem (Four Color Problem, 1852)Given any separation of a plane into contiguous regions (amap), the regions can be colored using at most four colorsso that no two adjacent regions have the same color.

I all corners belonging to three or more countries mustbe ignored

I every ”country” must be a connected region, orcontiguous

Problem (Four Color Problem, Graph Version)Is every planar graph four colorable ?

Page 10: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

HistoryI asked by a botanist Francis GuthrieI considered by Augustus de MorganI William Rowan HamiltonI Arthur Cayley, 1878I Alfred Kempe ”proof”, 1879I Percy Heawood found gap in Kempe’s proof, 1889I Heinrich Heesch, 1948 - unavoidable and irreducible

configurationsI Wolfgang Haken and Kenneth Appel, 1976 -

computer proof

Theorem (Haken–Appel, 1976)Every planar graph is four colorable.

Page 11: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Apery Theorem

Theorem (Apery,1978)The number

ζ(3) =∞∑

n=1

1n3 =

113 +

123 +

133 + . . .

is irrational.

Page 12: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Theorem (Euler)If n is a positive integer then

ζ(2n) =1

12n +1

22n +1

32n + · · · =pqπ2n

for some integers p and q.

Euler showed that, in fact,

ζ(2n) = (−1)n+1 B2n(2π)2n

2(2n!)

where the B2n are the rational Bernoulli numbers.

Page 13: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Theorem (Rivoal, 2000)The sequence

ζ(3), ζ(5), ζ(7), ζ(9), . . .

contains infinitely many irrational numbers.

This theorem has been extended by V.V.Zudilin in 2002. Itis believed (but not proved) that all values of ζ(n) areirrational, in fact, transcendental.

Page 14: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Bieberbach Conjecture

Problem (Bieberbach Conjecture,1916)Let f (z) be a univalent function, i.e. one–to–oneholomorphic function that maps the open unit disk∆ = {z ∈ C : |z| < 1} into the complex plane C withf (0) = 0 and f ′(0) = 1. Then f (z) has a Taylor series

f (z) = z +∑n≥2

anzn.

Ludwig Bieberbach conjectured in 1916 that for suchfunctions |an| ≤ n for n = 2,3, . . . .

Theorem (L. de Branges, 1984)Bieberbach Conjecture is true.

Page 15: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Mordell Conjecture

Problem (Mordell Conjecture, 1922)Any Diophantine equation with genus at least 2 has onlyfinitely many (rational) solutions.

Theorem (Gerd Faltings, 1983; Fields Medal,1986)Mordell Conjecture is True.

Page 16: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

The Mordell Conjecture/Faltings Theorem says roughlythat if K is an algebraic number field and X is analgebraic curve defined over K of genus g > 1 then theset of K - rational points X (K ) is finite.Mordell objected to it being called ”Mordell’s conjecture”,saying it was more of a question, not even a wild guess,and that he had little or no intuition to base it on.

Page 17: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

The genus of a plane algebraic curve of degree n is theinteger (n−1)(n−2)

2 minus the orders of multiplicity ofsingular points of the curve in the complex projectiveplane.It is the genus of this curve considered as a surface (i.e. amanifold of dimension 2) of the complex projective plane,which itself is a manifold of dimension 4 .A real curve of genus g is therefore the section of a toruswith g holes by a plane, and, as a result, has, in generaland at most g + 1 connected components in the realprojective plane.

Page 18: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

By the Harnack theorem (1878), we can find curves ofany degree having g + 1 real connected components (andthe 16th problem of Hilbert consisted in classifying thesecurves).The curves of genus zero are the rational curves, that canbe parametrized by rational functions, and the curves ofgenus 1, the elliptic curves, that can be parametrized byelliptic functions; the curves of maximal genus (n−1)(n−2)

2are the smooth curves.

Page 19: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

HistoryI Poincare conjectured that the group of rational points

on an elliptic curve is finitely generatedI proved by Louis Mordell in 1922I Falting’s proof in 1983I Simplified proof by Enrico Bombieri (1990) and Pavel

Vojta (1991)I Cosequences for the proof of the Fermat Last

Theorem

Page 20: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Invariant Subspace Problem

DefinitionLet T : X → X be a bounded linear operator on a Banachspace X and let V be a proper subspace of X (i.e.∅ 6= V 6= X ). We say that V is invariant under T ifT (V ) ⊆ V .

ProblemWhen does a bounded linear operator on an infinitedimensional Banach space have a non–trivial closedinvariant subspace ?

Page 21: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

I P. Enflo (1987) showed an example of a boundedlinear operator on a real or complex separablenon–reflexive space Banach space withoutnon–trivial invariant subspaces;

I C. J. Read (1984) showed an example of a boundedlinear operator on the space `1 without non–trivialclosed invariant subspaces.

Page 22: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Fermat Last Theorem

Theorem (Pierre de Fermat)It is impossible to divide a cube into two cubes, or a fourpower into two four powers, or in general, any powerhigher than the second, into two like powers.

Proof.I have discovered a truly marvellous proof of this, whichthis margin is too narrow to contain.

NOTE : Fermat does have a complete proof of the FLT forthe case n = 4 by reductio ad absurdum through the useof Mathematical Induction.

Page 23: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Early Steps in the Solution of the FLTI n = 3 Euler 1770I Gauss 1816 – too isolated problem to be interestingI n = 5 Legendre, Dirichlet 1825I n = 7 Lame 1834I Sophie Germain, two cases : p|xyz, p 6 |xyzI cyclotomic integers, Lame 1847I unique factorization, LiouvilleI Ideals, Class Number, Dedekind, Kummer

Page 24: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Final Steps in the Solution of the FLT

Problem (Taniyama – Shimura Conjecture)Every elliptic curve is modular.

I Weil–Taniyama–Shimura ConjectureI Faltings Theorem⇒ there are at most finitely many

solutions of the FLTI Frey : TS =⇒ FLTI Serre (Fields Medal, 1954), RibetI Laglands Correspondence

Page 25: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

FINALLY !!!, AFTER 350 YEARS

Summer of 1993, Andrew Wiles’ Cambridge Lecture”Elliptic Curves, Modular Forms, and Galois Theory”

CorollaryGiven x , y , z ∈ Z+ and ∈ N,n ≥ 3, the equation

xn + yn = zn

has a solution if and only if xyz = 0.

Final proof April 1995 – Andrew Wiles with Richard Taylor.

Page 26: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Unconditional Basic Sequence

DefinitionLet X be a Banach space . A sequence {xn}∞n=1 ofelements of X is a basic sequence of X if it is a Schauderbasis for its closed linear span. The basis is unconditionalif the series

∑π(n) anxn converges for any permutation of

indices π(n).

FactEvery Banach space has a basic sequence.

ProblemDoes every Banach space have an unconditional basicsequence ?

Page 27: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

The question of unconditional basic sequence isfundamental in many applications of Banach spaces, e.g.in the probability theory.

Theorem (Timothy Gowers, Bernard Maurey1993)There exists a Banach space without any unconditionalbasic sequence.

This important discovery allowed Gowers to answer manyimportant longstanding problems about structure ofBanach spaces. For these important discoveries TimothyGowers was awarded Fields Medal in 1994.

Page 28: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Sample consequences of the Gowers – Maurey Theorem:

I there exists an infinite–dimensional Banach spacenoy isomorphic to any of its proper subspaces

I there exist two nonisomorphic Banach spaces suchthat each is isomorphic to a subspace of the other

I a Banach space which is isomorphic to all of itsinfinite–dimensional subspaces is isomorphic to `2

I there exists a Banach space X such that the onlylinear operators L(X ,X ) are the identity and compactoperators

Page 29: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Maharam ProblemDefinitionLet B be a Boolean algebra. A function µ : B→ [0,1] iscalled a submeasure on B if µ(0) = 0 andµ(A ∪ B) ≤ µ(A) + µ(B) for A,B ∈ B.A submeasure is called order continuous if An ↓ 0 impliesthat µ(An)→ 0.

Problem (Dorothy Maharam 1947)If a Boolean algebra B admits a continuous submeasure,does it admit a measure ?

Theorem (M.Talagrand 1996)There exists a Boolean submeasure algebra with nonon–trivial measure.

Page 30: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Poincare Conjecture

Problem (Poincare,1904)Every compact, simply connected, three–dimensionalmanifold is (homeomorphic to) the three–dimensionalsphere.

DefinitionA manifold with the property that any closed loop in it canbe continuously contracted to a point is called simplyconnected.

Page 31: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

FactEvery two-dimensional manifold has a geometric structurethat is either spherical, Euclidean, or hyperbolic.Moreover, if it has a structure of one of these types, itcannot have one of a different type.

Problem (Geometrization Conjecture, WilliamThurston 1982 ; Fields Medal 1983)Every smooth three-dimensional manifold can be cut in acanonical fashion along a predetermined spheres andone–holed tori so that each of resulting parts hasprecisely one of the list of eight possible geometricstructures.

Theorem (Grigori Perelman,2003; Fields Medal2006)The Geometrization Conjecture is True.

Page 32: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

I Poincare himself solved the problem for n = 2 early inthe XX-th century by completely classifying allcompact 2–manifolds and noting that in the list of allpossible such manifolds only the sphere was simplyconnected.

I For a time he believed that he solved thethree–dimensional case as well, but then hediscovered a counterexample to one of his mainassertions.

I 1961 – Stephen Smale (Fields Medal 1966) provedthe conjecture for n ≥ 5, and Michael Freedman(Fields Medal 1986) proved the n = 4 case in 1982.

Page 33: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

The Geometrization Conjecture implies the PoincareConjecture.

I 1981 Richard Hamilton set up a program to addressboth conjectures. The main idea of this program wasto solve the problems by analyzing Ricci Flow.

I Ricci Flow is a technique that allows one to take anarbitrary Riemannian manifold and smooth out thegeometry of the manifold to make it look moresymmetric

I Ricci flow converts an arbitrary manifold into a finiteunion of very symmetric pieces (GEOMETRIZATIONTHEOREM).

Page 34: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Primes in Arithmetic ProgressionProblem (Erdos–Turan Conjecture)Does every infinite sequence of integers {ni}∞n=1 such that∑ 1

ni

contain an arbitrary arithmetic progression ?

Theorem (Green–Tao, Terence Tao; FieldsMedal 2010)For every k ∈ N there are infinitely many k–termarithmetic progressions of primes, i.e. pairs of integersa,d such that a,a + d ,a + 2d , . . . ,a + (k − 1)d are allprimes.

Page 35: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Goldbach Conjecture

Problem (Even Goldbach Conjecture 1742)Every even integer greater than 2 is the sum of twoprimes.

Problem (Odd Goldbach Conjecture 1742)Every odd integer greater than 5 is the sum of 3 primes.

I The even conjecture implies the odd one but notconversely.

Page 36: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Odd Goldbach Conjecture

I 1937 Vinogradov – all ”sufficiently large” odd integerscan be expressed as a sum of three primes

I 2002 Liu Ming Chit and Wang Tien Ze :n > e3100 ≈ 2× 101346

I 2012 Tao – every odd integer is a sum of at most 5primes

I 2012, 2013 Harald Helfgot - proves the odd GoldbachConjecture (?)

Page 37: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Even Goldbach Conjecture

I Chen Jingru 1973 – every sufficiently large eveninteger can be written as either a sum of two primesor a sum of a prime and a semiprime (the product oftwo primes)

I T. Oliveira da Silva computer verified the even casefor all n ≤ 4× 1018

Page 38: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Twin Prime ConjectureTheorem (Vigo Brun, 1915)The series ∑ 1

p

taken over all twin primes p, is convergent

Theorem (Erdos 1940)There exists a constant c < 1 and infinitely many primesp such that (p′ − p) < c ln p, where p′ is the next prime.

In 2005 Goldston, Prinz and Yilddirim showed that theconstant in the Theorem can be arbitrarily small

lim infp→∞

pn+1 − pn

log pn= 0.

Page 39: Great Solved Problems - muicmath.comPROBLEMS I (0) Axiom of Choice I (1) Continuum Hypothesis I (2) Basis Problem, Approximation Problem I (3) Apery Theorem` I (4) Four Color Problem

Theorem (Yitzang Zhang 2013)There is a constant N (= 7× 107) and infinitely manyprimes pn such that

lim infn→+∞

(pn+1 − pn) < N.

I Tao and Maynard reduced N to 246, and in somecases to 12, or even to 6 (under additionalassumptions).