Tao also has two brothers, Trevor and Nigel, who are currently living in Australia. Both formerly represented Australia at the International Mathematical Olympiad.[15][16] Furthermore, Trevor Tao has been representing Australia internationally in chess and holds the title of Chess International Master.[17]
Tao speaks Cantonese but cannot write Chinese. Tao is married to Laura Tao, an electrical engineer at NASA's Jet Propulsion Laboratory.[10][18] They live in Los Angeles, California, and have two children.[19]
Childhood
A child prodigy,[20] Terence Tao skipped 6 grades.[21][22] Tao exhibited extraordinary mathematical abilities from an early age, attending university-level mathematics courses at the age of 9. He is one of only three children in the history of the Johns Hopkins Study of Exceptional Talent program to have achieved a score of 700 or greater on the SAT math section while just eight years old; Tao scored a 760.[23]Julian Stanley, Director of the Study of Mathematically Precocious Youth, stated that Tao had the greatest mathematical reasoning ability he had found in years of intensive searching.[6][24]
Tao was the youngest participant to date in the International Mathematical Olympiad, first competing at the age of ten; in 1986, 1987, and 1988, he won a bronze, silver, and gold medal, respectively. Tao remains the youngest winner of each of the three medals in the Olympiad's history, having won the gold medal at the age of 13 in 1988.[25]
Career
At age 14, Tao attended the Research Science Institute, a summer program for secondary students. In 1991, he received his bachelor's and master's degrees at the age of 16 from Flinders University under the direction of Garth Gaudry.[26] In 1992, he won a postgraduate Fulbright Scholarship to undertake research in mathematics at Princeton University in the United States. From 1992 to 1996, Tao was a graduate student at Princeton University under the direction of Elias Stein, receiving his PhD at the age of 21.[26] In 1996, he joined the faculty of the University of California, Los Angeles. In 1999, when he was 24, he was promoted to full professor at UCLA and remains the youngest person ever appointed to that rank by the institution.[26]
He is known for his collaborative mindset; by 2006, Tao had worked with over 30 others in his discoveries,[6] reaching 68 co-authors by October 2015.
In 2004, Dr. Tao, along with Ben Green, a mathematician now at the University of Cambridge in England, solved a problem related to the Twin Prime Conjecture by looking at prime number progressions—series of numbers equally spaced. (For example, 3, 7 and 11 constitute a progression of prime numbers with a spacing of 4; the next number in the sequence, 15, is not prime.) Dr. Tao and Dr. Green proved that it is always possible to find, somewhere in the infinity of integers, a progression of prime numbers of equal spacing and any length.
Many other results of Tao have received mainstream attention in the scientific press, including:
his 2019 progress on the Collatz conjecture, in which he proved the probabilistic claim that almost all Collatz orbits attain almost bounded values.[31]
Tao has also resolved or made progress on a number of conjectures. In 2012, Green and Tao announced proofs of the conjectured "orchard-planting problem," which asks for the maximum number of lines through exactly 3 points in a set of n points in the plane, not all on a line. In 2018, with Brad Rodgers, Tao showed that the de Bruijn–Newman constant, the nonpositivity of which is equivalent to the Riemann hypothesis, is nonnegative.[32] In 2020, Tao proved Sendov's conjecture, concerning the locations of the roots and critical points of a complex polynomial, in the special case of polynomials with sufficiently high degree.[33]
Such is Tao's reputation that mathematicians now compete to interest him in their problems, and he is becoming a kind of Mr. Fix-it for frustrated researchers. "If you're stuck on a problem, then one way out is to interest Terence Tao," says Charles Fefferman [professor of mathematics at Princeton University].[37]
British mathematician and Fields medalist Timothy Gowers remarked on Tao's breadth of knowledge:[48]
Tao's mathematical knowledge has an extraordinary combination of breadth and depth: he can write confidently and authoritatively on topics as diverse as partial differential equations, analytic number theory, the geometry of 3-manifolds, nonstandard analysis, group theory, model theory, quantum mechanics, probability, ergodic theory, combinatorics, harmonic analysis, image processing, functional analysis, and many others. Some of these are areas to which he has made fundamental contributions. Others are areas that he appears to understand at the deep intuitive level of an expert despite officially not working in those areas. How he does all this, as well as writing papers and books at a prodigious rate, is a complete mystery. It has been said that David Hilbert was the last person to know all of mathematics, but it is not easy to find gaps in Tao's knowledge, and if you do then you may well find that the gaps have been filled a year later.
Michael Christ, Colliander, and Tao developed methods of Carlos Kenig, Gustavo Ponce, and Luis Vega to establish ill-posedness of certain Schrödinger and KdV equations for Sobolev data of sufficiently low exponents.[CCT03][49] In many cases these results were sharp enough to perfectly complement well-posedness results for sufficiently large exponents as due to Bourgain, Colliander−Keel−Staffilani−Takaoka−Tao, and others. Further such notable results for Schrödinger equations were found by Tao in collaboration with Ioan Bejenaru.[BT06]
A particularly notable result of the Colliander−Keel−Staffilani−Takaoka−Tao collaboration established the long-time existence and scattering theory of a power-law Schrödinger equation in three dimensions.[C+08] Their methods, which made use of the scale-invariance of the simple power law, were extended by Tao in collaboration with Monica Vișan and Xiaoyi Zhang to deal with nonlinearities in which the scale-invariance is broken.[TVZ07]Rowan Killip, Tao, and Vișan later made notable progress on the two-dimensional problem in radial symmetry.[KTV09]
An article by Tao in 2001 considered the wave maps equation with two-dimensional domain and spherical range.[T01a] He built upon earlier innovations of Daniel Tataru, who considered wave maps valued in Minkowski space.[50] Tao proved the global well-posedness of solutions with sufficiently small initial data. The fundamental difficulty is that Tao considers smallness relative to the critical Sobolev norm, which typically requires sophisticated techniques. Tao later adapted some of his work on wave maps to the setting of the Benjamin–Ono equation; Alexandru Ionescu and Kenig later obtained improved results with Tao's methods.[T04a][51]
In 2016, Tao constructed a variant of the Navier–Stokes equations which possess solutions exhibiting irregular behavior in finite time.[T16] Due to structural similarities between Tao's system and the Navier–Stokes equations themselves, it follows that any positive resolution of the Navier–Stokes existence and smoothness problem must take into account the specific nonlinear structure of the equations. In particular, certain previously proposed resolutions of the problem could not be legitimate.[52] Tao speculated that the Navier–Stokes equations might be able to simulate a Turing complete system, and that as a consequence it might be possible to (negatively) resolve the existence and smoothness problem using a modification of his results.[6][29] However, such results remain (as of 2024) conjectural.
Harmonic analysis
Bent Fuglede introduced the Fuglede conjecture in the 1970s, positing a tile-based characterisation of those Euclidean domains for which a Fourier ensemble provides a basis of L2.[53] Tao resolved the conjecture in the negative for dimensions larger than 5, based upon the construction of an elementary counterexample to an analogous problem in the setting of finite groups.[T04b]
With Camil Muscalu and Christoph Thiele, Tao considered certain multilinear singular integral operators with the multiplier allowed to degenerate on a hyperplane, identifying conditions which ensure operator continuity relative to Lp spaces.[MTT02] This unified and extended earlier notable results of Ronald Coifman, Carlos Kenig, Michael Lacey, Yves Meyer, Elias Stein, and Thiele, among others.[54][55][56][57][58][59] Similar problems were analysed by Tao in 2001 in the context of Bourgain spaces, rather than the usual Lp spaces.[T01b] Such estimates are used in establishing well-posedness results for dispersive partial differential equations, following famous earlier work of Jean Bourgain, Kenig, Gustavo Ponce, and Luis Vega, among others.[60][61]
A number of Tao's results deal with "restriction" phenomena in Fourier analysis, which have been widely studied since the time of the articles of Charles Fefferman, Robert Strichartz, and Peter Tomas in the 1970s.[62][63][64] Here one studies the operation which restricts input functions on Euclidean space to a submanifold and outputs the product of the Fourier transforms of the corresponding measures. It is of major interest to identify exponents such that this operation is continuous relative to Lp spaces. Such multilinear problems originated in the 1990s, including in notable work of Jean Bourgain, Sergiu Klainerman, and Matei Machedon.[65][66][67] In collaboration with Ana Vargas and Luis Vega, Tao made some foundational contributions to the study of the bilinear restriction problem, establishing new exponents and drawing connections to the linear restriction problem. They also found analogous results for the bilinear Kakeya problem which is based upon the X-ray transform instead of the Fourier transform.[TVV98] In 2003, Tao adapted ideas developed by Thomas Wolff for bilinear restriction to conical sets into the setting of restriction to quadratic hypersurfaces.[T03][68] The multilinear setting for these problems was further developed by Tao in collaboration with Jonathan Bennett and Anthony Carbery; their work was extensively used by Bourgain and Larry Guth in deriving estimates for general oscillatory integral operators.[BCT06][69]
Compressed sensing and statistics
In collaboration with Emmanuel Candes and Justin Romberg, Tao has made notable contributions to the field of compressed sensing. In mathematical terms, most of their results identify settings in which a convex optimisation problem correctly computes the solution of an optimisation problem which seems to lack a computationally tractable structure. These problems are of the nature of finding the solution of an underdetermined linear system with the minimal possible number of nonzero entries, referred to as "sparsity". Around the same time, David Donoho considered similar problems from the alternative perspective of high-dimensional geometry.[70]
Motivated by striking numerical experiments, Candes, Romberg, and Tao first studied the case where the matrix is given by the discrete Fourier transform.[CRT06a] Candes and Tao abstracted the problem and introduced the notion of a "restricted linear isometry," which is a matrix that is quantitatively close to an isometry when restricted to certain subspaces.[CT05] They showed that it is sufficient for either exact or optimally approximate recovery of sufficiently sparse solutions. Their proofs, which involved the theory of convex duality, were markedly simplified in collaboration with Romberg, to use only linear algebra and elementary ideas of harmonic analysis.[CRT06b] These ideas and results were later improved by Candes.[71] Candes and Tao also considered relaxations of the sparsity condition, such as power-law decay of coefficients.[CT06] They complemented these results by drawing on a large corpus of past results in random matrix theory to show that, according to the Gaussian ensemble, a large number of matrices satisfy the restricted isometry property.[CT06]
In 2007, Candes and Tao introduced a novel statistical estimator for linear regression, which they called the "Dantzig selector." They proved a number of results on its success as an estimator and model selector, roughly in parallel to their earlier work on compressed sensing.[CT07] A number of other authors have since studied the Dantzig selector, comparing it to similar objects such as the statistical lasso introduced in the 1990s.[72]Trevor Hastie, Robert Tibshirani, and Jerome H. Friedman conclude that it is "somewhat unsatisfactory" in a number of cases.[73] Nonetheless, it remains of significant interest in the statistical literature.
In 2009, Candes and Benjamin Recht considered an analogous problem for recovering a matrix from knowledge of only a few of its entries and the information that the matrix is of low rank.[74] They formulated the problem in terms of convex optimisation, studying minimisation of the nuclear norm. Candes and Tao, in 2010, developed further results and techniques for the same problem.[CT10] Improved results were later found by Recht.[75] Similar problems and results have also been considered by a number of other authors.[76][77][78][79][80]
Random matrices
In the 1950s, Eugene Wigner initiated the study of random matrices and their eigenvalues.[81][82] Wigner studied the case of hermitian and symmetric matrices, proving a "semicircle law" for their eigenvalues. In 2010, Tao and Van Vu made a major contribution to the study of non-symmetric random matrices. They showed that if n is large and the entries of a n × n matrix A are selected randomly according to any fixed probability distribution of expectation 0 and standard deviation 1, then the eigenvalues of A will tend to be uniformly scattered across the disk of radius n1/2 around the origin; this can be made precise using the language of measure theory.[TV10] This gave a proof of the long-conjectured circular law, which had previously been proved in weaker formulations by many other authors. In Tao and Vu's formulation, the circular law becomes an immediate consequence of a "universality principle" stating that the distribution of the eigenvalues can depend only on the average and standard deviation of the given component-by-component probability distribution, thereby providing a reduction of the general circular law to a calculation for specially-chosen probability distributions.
In 2011, Tao and Vu established a "four moment theorem", which applies to random hermitian matrices whose components are independently distributed, each with average 0 and standard deviation 1, and which are exponentially unlikely to be large (as for a Gaussian distribution). If one considers two such random matrices which agree on the average value of any quadratic polynomial in the diagonal entries and on the average value of any quartic polynomial in the off-diagonal entries, then Tao and Vu show that the expected value of a large number of functions of the eigenvalues will also coincide, up to an error which is uniformly controllable by the size of the matrix and which becomes arbitrarily small as the size of the matrix increases.[TV11] Similar results were obtained around the same time by László Erdös, Horng-Tzer Yau, and Jun Yin.[83][84]
Analytic number theory and arithmetic combinatorics
In 2004, Tao, together with Jean Bourgain and Nets Katz, studied the additive and multiplicative structure of subsets of finite fields of prime order.[BKT04] It is well known that there are no nontrivial subrings of such a field. Bourgain, Katz, and Tao provided a quantitative formulation of this fact, showing that for any subset of such a field, the number of sums and products of elements of the subset must be quantitatively large, as compared to the size of the field and the size of the subset itself. Improvements of their result were later given by Bourgain, Alexey Glibichuk, and Sergei Konyagin.[85][86]
Tao and Ben Green proved the existence of arbitrarily long arithmetic progressions in the prime numbers; this result is generally referred to as the Green–Tao theorem, and is among Tao's most well-known results.[GT08] The source of Green and Tao's arithmetic progressions is Endre Szemerédi's 1975 theorem on existence of arithmetic progressions in certain sets of integers. Green and Tao showed that one can use a "transference principle" to extend the validity of Szemerédi's theorem to further sets of integers. The Green–Tao theorem then arises as a special case, although it is not trivial to show that the prime numbers satisfy the conditions of Green and Tao's extension of the Szemerédi theorem.
In 2010, Green and Tao gave a multilinear extension of Dirichlet's celebrated theorem on arithmetic progressions. Given a k × n matrix A and a k × 1 matrix v whose components are all integers, Green and Tao give conditions on when there exist infinitely many n × 1 matrices x such that all components of Ax + v are prime numbers.[GT10] The proof of Green and Tao was incomplete, as it was conditioned upon unproven conjectures. Those conjectures were proved in later work of Green, Tao, and Tamar Ziegler.[GTZ12]
Notable awards
Terence Tao has won numerous awards for his work. Terence Tao won the Fields Medal, the highest award of mathematics, in 2006.
Global regularity of wave maps I. Small critical Sobolev norm in high dimensions.Internat. Math. Res. Notices (2001), no. 6, 299–328.
Global regularity of wave maps II. Small energy in two dimensions.Comm. Math. Phys. 2244 (2001), no. 2, 443–544.
in addition to "his remarkable series of papers, written in collaboration with J. Colliander, M. Keel, G. Staffilani, and H. Takaoka, on global regularity in optimal Sobolev spaces for KdV and other equations, as well as his many deep contributions to Strichartz and bilinear estimates."
his restriction theorems in Fourier analysis, his work on wave maps, his global existence theorems for KdV-type equations, and for his solution with Allen Knutson of Horn's conjecture
"his surprising and original contributions to many fields of mathematics, including number theory, differential equations, algebra, and harmonic analysis"
"his combination of mathematical depth, width and volume in a manner unprecedented in contemporary mathematics". His Lars Onsager lecture was entitled "Structure and randomness in the prime numbers" at NTNU, Norway.[94]
^Mathematical Reviews MR2523047, Review by Timothy Gowers of
Terence Tao's Poincaré's legacies, part I, http://mathscinet
^Kenig, Carlos E.; Ponce, Gustavo; Vega, Luis. On the ill-posedness of some canonical dispersive equations. Duke Math. J. 106 (2001), no. 3, 617–633.
^Tataru, Daniel. On global existence and scattering for the wave maps equation. Amer. J. Math. 123 (2001), no. 1, 37–77.
^Ionescu, Alexandru D.; Kenig, Carlos E. Global well-posedness of the Benjamin-Ono equation in low-regularity spaces. J. Amer. Math. Soc. 20 (2007), no. 3, 753–798.
^Fuglede, Bent. Commuting self-adjoint partial differential operators and a group theoretic problem. J. Functional Analysis 16 (1974), 101–121.
^Coifman, R. R.; Meyer, Yves On commutators of singular integrals and bilinear singular integrals. Trans. Amer. Math. Soc. 212 (1975), 315–331.
^Coifman, R.; Meyer, Y. Commutateurs d'intégrales singulières et opérateurs multilinéaires. (French) Ann. Inst. Fourier (Grenoble) 28 (1978), no. 3, xi, 177–202.
^Coifman, Ronald R.; Meyer, Yves Au delà des opérateurs pseudo-différentiels. Astérisque, 57. Société Mathématique de France, Paris, 1978. i+185 pp.
^Lacey, Michael; Thiele, Christoph. Lp estimates on the bilinear Hilbert transform for 2<p<∞. Ann. of Math. (2) 146 (1997), no. 3, 693–724.
^Lacey, Michael; Thiele, Christoph On Calderón's conjecture. Ann. of Math. (2) 149 (1999), no. 2, 475–496.
^Kenig, Carlos E.; Stein, Elias M. Multilinear estimates and fractional integration. Math. Res. Lett. 6 (1999), no. 1, 1–15.
^Kenig, Carlos E.; Ponce, Gustavo; Vega, Luis. A bilinear estimate with applications to the KdV equation. J. Amer. Math. Soc. 9 (1996), no. 2, 573–603.
^Ginibre, Jean. Le problème de Cauchy pour des EDP semi-linéaires périodiques en variables d'espace (d'après Bourgain). Séminaire Bourbaki, Vol. 1994/95. Astérisque No. 237 (1996), Exp. No. 796, 4, 163–187.
^Tomas, Peter A. A restriction theorem for the Fourier transform. Bull. Amer. Math. Soc. 81 (1975), 477–478.
^Strichartz, Robert S. Restrictions of Fourier transforms to quadratic surfaces and decay of solutions of wave equations. Duke Math. J. 44 (1977), no. 3, 705–714.
^Bourgain, J. Fourier transform restriction phenomena for certain lattice subsets and applications to nonlinear evolution equations. I. Schrödinger equations. Geom. Funct. Anal. 3 (1993), no. 2, 107–156
^Bourgain, J. Fourier transform restriction phenomena for certain lattice subsets and applications to nonlinear evolution equations. II. The KdV-equation. Geom. Funct. Anal. 3 (1993), no. 3, 209–262.
^Klainerman, S.; Machedon, M. Space-time estimates for null forms and the local existence theorem. Comm. Pure Appl. Math. 46 (1993), no. 9, 1221–1268.
^Wolff, Thomas. A sharp bilinear cone restriction estimate. Ann. of Math. (2) 153 (2001), no. 3, 661–698.
^Bourgain, Jean; Guth, Larry. Bounds on oscillatory integral operators based on multilinear estimates. Geom. Funct. Anal. 21 (2011), no. 6, 1239–1295.
^Donoho, David L. Compressed sensing. IEEE Trans. Inform. Theory 52 (2006), no. 4, 1289–1306.
^Candès, Emmanuel J. The restricted isometry property and its implications for compressed sensing. C. R. Math. Acad. Sci. Paris 346 (2008), no. 9-10, 589–592.
^Bickel, Peter J.; Ritov, Ya'acov; Tsybakov, Alexandre B. Simultaneous analysis of lasso and Dantzig selector. Ann. Statist. 37 (2009), no. 4, 1705–1732.
^Hastie, Trevor; Tibshirani, Robert; Friedman, Jerome The elements of statistical learning. Data mining, inference, and prediction. Second edition. Springer Series in Statistics. Springer, New York, 2009. xxii+745 pp. ISBN978-0-387-84857-0
^Candès, Emmanuel J.; Recht, Benjamin Exact matrix completion via convex optimization. Found. Comput. Math. 9 (2009), no. 6, 717–772.
^Recht, Benjamin A simpler approach to matrix completion. J. Mach. Learn. Res. 12 (2011), 3413–3430.
^Keshavan, Raghunandan H.; Montanari, Andrea; Oh, Sewoong Matrix completion from a few entries. IEEE Trans. Inform. Theory 56 (2010), no. 6, 2980–2998.
^Recht, Benjamin; Fazel, Maryam; Parrilo, Pablo A. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52 (2010), no. 3, 471–501.
^Candès, Emmanuel J.; Plan, Yaniv Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. IEEE Trans. Inform. Theory 57 (2011), no. 4, 2342–2359.
^Koltchinskii, Vladimir; Lounici, Karim; Tsybakov, Alexandre B. Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. Ann. Statist. 39 (2011), no. 5, 2302–2329.
^Gross, David Recovering low-rank matrices from few coefficients in any basis. IEEE Trans. Inform. Theory 57 (2011), no. 3, 1548–1566.
^Wigner, Eugene P. Characteristic vectors of bordered matrices with infinite dimensions. Annals of Mathematics (2) 62 (1955), 548–564.
^Wigner, Eugene P. On the distribution of the roots of certain symmetric matrices. Ann. of Math. (2) 67 (1958), 325–327.
^Bourgain, J. More on the sum-product phenomenon in prime fields and its applications. Int. J. Number Theory 1 (2005), no. 1, 1–32.
^Bourgain, J.; Glibichuk, A.A.; Konyagin, S.V. Estimates for the number of sums and products and for exponential sums in fields of prime order. J. London Math. Soc. (2) 73 (2006), no. 2, 380–398.