Terence Tao

Terence Tao (born 17 July 1975 in Adelaide, Australia) is an Australian-American mathematician and a Distinguished Professor at the University of California, Los Angeles (UCLA), where he holds the James and Carol Collins Chair in Mathematics. His research encompasses harmonic analysis, partial differential equations, combinatorics, and number theory, alongside contributions to random matrix theory, representation theory, and compressed sensing. He received the Fields Medal in 2006 for contributions to partial differential equations, combinatorics, harmonic analysis, and additive number theory. (math.ucla.edu)

Tao’s work connects methods from analysis with questions about discrete structures and arithmetic. With Ben Green, he proved that the prime numbers contain arithmetic progressions of every finite length; his other research includes the Erdős discrepancy problem and, with collaborators, the recovery of sparse signals from incomplete measurements. His mathematical activities also include textbooks, research exposition, online collaborative projects, and the formal verification of proofs. (arxiv.org)

Early life and mathematical education

Terence Tao was born in Adelaide, Australia, on 17 July 1975 and grew up there. His early education involved acceleration across school levels rather than simply completing a conventional curriculum more quickly. In a 2009 interview with the Australian Mathematical Society’s Gazette, Tao recalled skipping five primary-school grades and beginning high school at eight. The acceleration was staggered by subject: at that age he attended Year 8 classes in subjects such as English and physical education while studying mathematics at Year 11 or Year 12 level. His parents arranged access to advanced classes with school and university staff, and he subsequently took university mathematics while still attending high school. These documented arrangements provide a concrete account of his early development without relying on anecdotes about infant abilities. (math.ucla.edu)

Tao represented Australia in the International Mathematical Olympiad in three consecutive years, winning bronze in 1986, silver in 1987, and gold in 1988. The official competition records give his totals as 19, 40, and 34 points respectively, with overall ranks of 87th, 28th, and 13th. His individual problem scores also show the distinction between solving selected problems completely and performing consistently across the paper: in 1986 he received the maximum seven points on two problems, whereas in 1987 he received seven points on five problems and five on the sixth. The progression in medals therefore should not be read as a steadily increasing raw score; his silver-medal total in 1987 exceeded his gold-medal total the following year. (m.imo-official.org)

Olympiad participation overlapped with, rather than preceded, his exposure to higher education. Flinders University records that he was studying mathematics there at ten under the supervision of Garth Gaudry. Competition problem-solving was thus one strand of an education that also included sustained contact with university mathematicians. Recalling his childhood interests in the Gazette interview, Tao distinguished his enjoyment of puzzles and arithmetic from his later understanding of mathematical research: as a child, he had not yet understood that researchers must formulate their own problems rather than merely solve assigned ones. (news.flinders.edu.au)

At Flinders University, Tao completed a Bachelor of Science with honours in mathematics in December 1991, aged sixteen, followed by a Master of Science in August 1992, aged seventeen. His curriculum vitae identifies Gaudry as his adviser for both degrees. The master’s thesis was titled Convolution operators generated by right-monogenic and harmonic kernels, documenting a specialized interest in mathematical analysis before his doctoral studies. Gaudry’s role extended beyond supervising this work: Tao later recalled that, after his bachelor’s degree, Gaudry strongly encouraged him to study abroad. His subsequent move to Princeton University followed this period of Australian schooling, competition participation, and university training. (math.ucla.edu)

Doctoral training and academic career

Tao completed his Ph.D. in mathematics at Princeton University in June 1996 under the supervision of Elias Stein. His dissertation, Three regularity results in harmonic analysis, brought together three investigations that appeared as journal articles: “Weak-type endpoint bounds for Riesz means” and “On the almost-everywhere convergence of wavelet summation methods,” both published in 1996, and “Weak-type endpoint bounds for homogeneous convolution operators,” published in 1999. These studies placed his doctoral work within harmonic analysis, with an emphasis on bounds for operators and convergence of approximation procedures. Tao’s description of the dissertation explicitly credits Stein’s guidance and identifies the thesis as essentially the union of these three papers. (math.ucla.edu)

In 1996, Tao joined the University of California, Los Angeles (UCLA), as a Hedrick Assistant Professor, an appointment his curriculum vitae records for 1996–1998. His subsequent progression should be distinguished from this initial position: his professional biography dates his professorship at UCLA to 1999, while the detailed appointments table lists an acting assistant professorship in 1999 and the full professorship from 2000. UCLA’s institutional account, published on August 22, 2006, states that he joined the faculty in 1996 and was promoted to full professor at age 24. These records establish the rapid transition from his initial Hedrick appointment to the professorial rank, while preserving the differing dates used in the biographical summary and appointment chronology. (teorth.github.io)

Tao’s later appointments include Distinguished Professor, dated from 2009 in his curriculum vitae, and the James and Carol Collins Chair in UCLA’s College of Letters and Science. A UCLA announcement dated January 11, 2007, identified him as the chair’s first holder and reported that James and Carol Collins had endowed it with a $1 million gift. Unlike chairs restricted to a particular discipline, this chair could be awarded to a professor in any of the College’s more than 30 departments. UCLA’s mathematics faculty directory lists Tao with both the Distinguished Professor designation and the Collins Chair. (teorth.github.io)

UCLA’s departmental profile describes his research interests as analysis and oscillatory integrals; his professional homepage gives a broader disciplinary list: harmonic analysis, partial differential equations, geometric and arithmetic combinatorics, analytic number theory, compressed sensing, and algebraic combinatorics. His detailed research profile specifies oscillatory integrals and Kakeya maximal functions, nonlinear dispersive equations, multilinear operators such as the bilinear Hilbert transform, and connections between arithmetic combinatorics, number theory, and ergodic theory. It also lists secondary interests in representation theory, geometric partial differential equations, and inverse scattering for rough data, documenting an academic research programme extending beyond the subjects of his dissertation. (math.ucla.edu)

Harmonic analysis and geometric questions

The Fourier restriction problem asks when the Fourier transform of a function can be meaningfully restricted to a lower-dimensional surface, such as a sphere, with bounds in suitable $L^p$ spaces. Its dual formulation estimates oscillatory integrals assembled from frequencies on that surface. The Kakeya problem concerns the size of sets containing a unit line segment in every direction. Their connection becomes visible through wave packets: localized oscillatory contributions concentrate along thin tubes, making estimates for functions depend on how tubes with different directions overlap. (arxiv.org)

In their 2005 paper, Jonathan Bennett, Anthony Carbery, and Tao established near-optimal multilinear restriction and Kakeya estimates. In $d$ dimensions, they considered products involving $d$ families whose normal or tube directions are uniformly transverse: the determinant formed by these directions stays bounded away from zero. This spanning condition, rather than curvature, controls their interaction. Their proof used monotonicity formulae for evolving Gaussian functions, related to heat flow. The restriction estimate allowed an arbitrarily small loss $R^\varepsilon$ on a ball of radius $R$; the Kakeya estimate excluded the endpoint exponent. These results did not establish the full linear conjectures. (arxiv.org)

With Gerd Mockenhaupt, Tao developed analogous questions over a finite field in a paper first submitted in 2002 and published in Duke Mathematical Journal in 2004. Here, continuous Euclidean space is replaced by the finite set $\mathbb{F}_q^n$, and Fourier integrals become finite sums involving additive characters—the finite-field counterparts of complex exponentials. Restriction estimates therefore become bounds for exponential sums associated with algebraic surfaces, including paraboloids. The Kakeya question asks how small a set can be if it contains an entire affine line in every direction. This setting removes limiting and small-scale analytic difficulties while retaining the interaction between oscillation and incidence geometry. Their paper transferred several Euclidean arguments to this discrete setting while identifying additional phenomena arising from finite-field algebra. (arxiv.org)

A different connection between Fourier analysis and geometry appears in Tao’s 2003 counterexample to Fuglede’s conjecture. A measurable set $\Omega$ of finite positive volume is spectral if $L^2(\Omega)$ has an orthonormal basis consisting of normalized exponentials

for a suitable frequency set $\Lambda$. A translational tile, by contrast, admits translates that cover Euclidean space without overlaps, apart from sets of measure zero. Fuglede’s conjecture asserted that these analytic and geometric properties were equivalent. (arxiv.org)

Tao constructed a finite union of unit cubes in $\mathbb{R}^5$ that was spectral but could not tile by translations, disproving the implication from spectrality to tiling in dimension five and, through extensions of the construction, every higher dimension. The construction began with a six-point spectral configuration in $\mathbb{F}_3^5$. Its cardinality prevented a translational tiling of that finite group, whose order is $3^5=243$. Tao transferred this finite algebraic obstruction into a Euclidean construction, producing a set with an exponential basis but no translational tiling. (arxiv.org)

Nonlinear partial differential equations

Tao’s research on nonlinear partial differential equations examines whether prescribed initial data generate solutions, whether those solutions are unique, and whether their regularity persists as time evolves. Local well-posedness combines existence and uniqueness over a time interval with continuous dependence on the initial data; global well-posedness extends this control to arbitrarily large times. Regularity concerns the preservation of smoothness or bounds on derivatives, while scattering asks whether a nonlinear solution approaches a solution of the corresponding linear equation at large positive or negative times. These are distinct questions: a solution can exist globally without scattering. Much of Tao’s work addresses how dispersion and conservation laws prevent concentration, or why they sometimes fail to do so. (math.ucla.edu)

In a 2005 paper with Monica Visan and Xiaoyi Zhang, Tao studied the nonlinear Schrödinger equation with two power nonlinearities,

where $n\geq3$, the coefficients are nonzero real numbers, and $0<p_1<p_2\leq4/(n-2)$. For initial data in the Sobolev space $H^1(\mathbb R^n)$, they established global well-posedness when the higher-power term is defocusing, $\lambda_2>0$, even if the lower-power term is focusing. They also proved global well-posedness for either choice of signs when $p_2<4/n$. Thus both the dimension-dependent exponents and the signs of the nonlinearities determine the available conclusions. The thresholds $4/n$ and $4/(n-2)$ are respectively mass-critical and energy-critical. (arxiv.org)

Their scattering theorem imposed stronger restrictions. When both coefficients are positive and $4/n<p_1<p_2\leq4/(n-2)$, every $H^1$ solution scatters: there are states $u_\pm\in H^1$ such that

The proof uses an interaction Morawetz estimate to control spacetime concentration, together with stability and spacetime estimates for critical equations. At the endpoint $p_1=4/n$, the paper’s scattering statement was explicitly conditional on a global existence and spacetime bound for the mass-critical defocusing equation. This qualification distinguishes the endpoint result as originally formulated from the unconditional results above it. (arxiv.org)

In 2006, Tao proved global regularity for the three-dimensional defocusing nonlinear wave equation

with smooth, compactly supported, spherically symmetric initial data. The logarithmic factor makes the equation slightly energy-supercritical relative to the energy-critical quintic equation: the nonlinear potential grows like $u^6\log(2+u^2)$, beyond the control supplied by the linear energy alone. By modifying an argument of Jean Ginibre, Avy Soffer, and Giorgio Velo for the critical equation, Tao obtained global smooth solutions despite this additional growth. The theorem retains both spherical symmetry and the specific logarithmic strengthening; it is not a general regularity theorem for supercritical wave equations. (arxiv.org)

A different direction appeared in Tao’s 2014 construction of finite-time blowup for an averaged three-dimensional Navier–Stokes equation. Writing the incompressible equation as $\partial_tu=\Delta u+B(u,u)$, he replaced $B$ with an averaged operator $\widetilde B$, built using rotations and order-zero Fourier multipliers. The replacement preserves the cancellation $\langle\widetilde B(u,u),u\rangle=0$, and therefore the usual energy identity, yet admits a solution from smooth initial data that blows up in finite time. The construction demonstrates that this energy identity and the harmonic-analysis estimates retained by the averaging do not alone guarantee regularity. Because the nonlinear operator is modified, the result does not prove blowup for the original Navier–Stokes equations. (arxiv.org)

Arithmetic combinatorics and patterns in primes

In 2004, Tao and Ben Green proved the Green–Tao theorem: for every positive integer $k$, there are positive integers $a$ and $d$ such that

are all prime numbers. The result establishes arbitrarily long finite arithmetic progressions, not a single infinite progression consisting entirely of primes. More precisely, their theorem gives infinitely many progressions of each prescribed finite length; neither the starting point nor the common difference is fixed as the length increases. (arxiv.org)

The central obstacle is that primes are sparse: their proportion among the integers up to $N$ is asymptotic to $1/\log N$, which tends to zero. Szemerédi’s theorem guarantees arbitrarily long progressions in sets of integers with positive upper density, but therefore does not apply directly. Green and Tao instead established a relative-density theorem. If $A$ is a subset of the primes satisfying

where $\pi(N)$ counts primes up to $N$, then $A$ also contains arbitrarily long progressions. Thus the conclusion survives restriction to any subset occupying a positive proportion of the primes along an unbounded sequence of intervals. (arxiv.org)

Their proof combines three ingredients: Szemerédi’s theorem, a transference principle, and estimates of Daniel Goldston and Cem Yıldırım. The transference principle carries a dense-set conclusion into a sparse setting whose surrounding measure satisfies suitable pseudorandomness conditions. Here “pseudorandom” means that specified averages and correlations behave approximately as they would for a uniform measure—not that the primes are independent random choices. The proof controls the structured and uniform components of a function representing the primes, allowing the positive-density theorem to operate despite their vanishing density among all integers. (arxiv.org)

The number-theoretic ingredient constructs a nonnegative majorizing weight from truncated divisor sums, concentrated on “almost primes.” Goldston–Yıldırım correlation estimates establish the required pseudorandomness of this larger weighted environment, within which suitably normalized primes have positive relative density. A preliminary $W$-trick removes systematic divisibility biases: $W$ is a product of small primes, and attention is restricted to numbers $Wn+b$ with $b$ coprime to $W$. This separates unavoidable local arithmetic restrictions from the uniformity needed for transference. The argument establishes existence through density and correlation estimates rather than by computing particular long progressions. (arxiv.org)

Tao and Tamar Ziegler extended this framework to polynomial patterns in work submitted in 2006 and published in Acta Mathematica in 2008. For any finite collection $P_1,\ldots,P_k\in\mathbb Z[m]$ satisfying $P_i(0)=0$, and any $\varepsilon>0$, they proved that infinitely many integer pairs $x,m$, with $1\leq m\leq x^\varepsilon$, make every $x+P_i(m)$ prime simultaneously. Taking $P_i(m)=(i-1)m$ recovers arithmetic progressions; choosing $0,m^2,2m^2$ gives three-term prime progressions with square common difference. The zero-constant-term hypothesis is essential to the stated theorem: arbitrary fixed offsets can introduce divisibility obstructions. Their proof uses polynomial extensions of the transference machinery, localized uniformity estimates, and an induction procedure that reduces polynomial averaging problems to linear ones. (arxiv.org)

Discrepancy, multiplicative functions, and the Collatz map

In September 2015, Tao proved the Erdős discrepancy problem: every sequence $a:\mathbb N\to\{-1,+1\}$ satisfies

The sums run along homogeneous arithmetic progressions $d,2d,\ldots,md$. Thus, however the two signs are assigned, some such progression has an imbalance exceeding any prescribed bound. The quantification over both $d$ and $m$ matters: the theorem does not assert that ordinary partial sums, corresponding to $d=1$, must be unbounded. His paper, published in Discrete Analysis in 2016, also established a vector-valued extension for sequences of unit vectors in a real or complex Hilbert space. (arxiv.org)

The proof connected this arbitrary-sign statement to multiplicative functions. A Fourier-analytic reduction developed through Polymath5 converted the vector-valued problem into one about random completely multiplicative functions $g$, for which $g(rs)=g(r)g(s)$ for all positive integers $r,s$. The required conclusion became unboundedness of the expected squared magnitude of their partial sums. These functions were auxiliary objects in the proof; the original discrepancy theorem imposed no multiplicativity assumption on the sign sequence. (arxiv.org)

Tao then used his logarithmically averaged form of an Elliott-type correlation theorem. Under suitable hypotheses, it controls correlations between multiplicative functions evaluated at different affine-linear arguments, weighting the summands by $1/n$. Together with a van der Corput argument, this forced any hypothetical bounded-discrepancy example to resemble a modulated Dirichlet character, $n\mapsto\chi(n)n^{it}$, in a precise sense measured through its values at primes. An extension of another Polymath5 argument excluded this remaining structured case. The proof therefore combined a collaborative reduction, Tao’s correlation estimates, and a final analysis of structured multiplicative functions. (arxiv.org)

In September 2019, Tao announced a separate result concerning the Collatz map, defined by $C(N)=N/2$ for even $N$ and $C(N)=3N+1$ for odd $N$. Writing $C_{\min}(N)=\min_{k\geq0}C^k(N)$, he proved that, for every function $F(N)\to+\infty$,

for almost every starting value in the sense of logarithmic density. The bound may grow arbitrarily slowly: for example, $F(N)=\log\log\log\log N$ is admissible for sufficiently large $N$. His proof studied the accelerated iteration on odd integers, which removes all factors of two after applying $3N+1$. It established an approximate transport property for first-passage distributions using Fourier estimates for a random walk on cyclic groups of order a power of three. (arxiv.org)

Here logarithmic density one means that the set $A$ of successful starting values satisfies

Unlike natural density, which counts integers with equal weight, this formulation weights them by their reciprocals and gives comparable weight to multiplicative ranges. It still permits an exceptional set, potentially infinite. Moreover, attaining a value below an arbitrarily slowly growing function is not the same as attaining $1$, or even falling below one fixed constant for almost all starting values. The result consequently does not establish the Collatz conjecture, whose assertion concerns every positive integer. (arxiv.org)

Algebraic combinatorics and the honeycomb model

Tao and Allen Knutson introduced the honeycomb model in a paper submitted in July 1998 and published in the Journal of the American Mathematical Society in 1999. Their construction translated questions about tensor products of representations of $GL_n(\mathbb C)$, the group of invertible complex $n\times n$ matrices, into questions about planar networks and lattice points. Its principal application was their proof of the saturation conjecture. (arxiv.org)

In representation theory, a partition $\lambda$ with at most $n$ parts labels an irreducible polynomial representation $V_\lambda$. The decomposition

defines the Littlewood–Richardson coefficients: the nonnegative integer $c_{\lambda\mu}^{\nu}$ counts how many copies of $V_\nu$ occur. The saturation theorem states that, for every positive integer $N$,

where scaling multiplies every part by $N$. This is a statement about nonvanishing, not equality of the coefficients before and after scaling. (arxiv.org)

A honeycomb consists of edges in three prescribed directions in the plane $x+y+z=0$, with balancing conditions at vertices and semi-infinite edges recording boundary data. For fixed boundary data, the configurations form a convex polytope; counting its integral configurations gives the corresponding representation-theoretic multiplicity. Thus a discrete counting problem becomes a geometric problem involving continuously variable edge lengths, with integral honeycombs selecting the configurations relevant to representations. (arxiv.org)

The proof’s crucial step was to pass from real feasibility to integral feasibility. An integral honeycomb for the scaled partitions can be divided by $N$, producing a real honeycomb for the original partitions, but generally not an integral one. Knutson and Tao showed that a nonempty honeycomb polytope with integral boundary data contains an integral honeycomb. They selected a special extremal configuration by maximizing a weighted-perimeter functional and established its integrality. This required more than ordinary convexity: some vertices of honeycomb polytopes with integral boundaries are themselves nonintegral. (arxiv.org)

Honeycombs also encode possible eigenvalues of sums of Hermitian matrices. Given decreasing eigenvalue lists $\lambda,\mu,\nu$, the existence of matrices $A,B$ with these spectra for $A,B,A+B$ is equivalent to the existence of an appropriately bounded real honeycomb. Combined with Alexander Klyachko’s work, saturation completed the proof of Alfred Horn’s 1962 conjecture describing the possible spectra through linear inequalities. (arxiv.org)

In subsequent work with Christopher Woodward, published in 2004, Knutson and Tao introduced triangular “puzzles” to determine which inequalities define essential facets of the spectral cone. They also proved William Fulton’s conjecture that multiplicity one persists under scaling:

This strengthened the scaling picture beyond the positivity assertion of saturation. (arxiv.org)

Random matrices and spectral universality

Tao’s collaboration with Van Vu on random matrix theory developed methods for comparing spectral statistics of matrices whose entries have different probability distributions. Their work distinguishes global questions—such as the proportion of eigenvalues in a fixed interval—from local questions about individual eigenvalues, neighbouring gaps, and correlations at the mean-spacing scale. For a Wigner matrix $M_n$, with independent upper-triangular entries subject to Hermitian symmetry, centred entries, and off-diagonal variance one, the normalization $W_n=M_n/\sqrt n$ gives the global semicircle density

This density describes the overall spectrum but does not determine its microscopic fluctuations. Near an interior point $E\in(-2,2)$, the mean eigenvalue spacing of $W_n$ is approximately $1/(n\rho_{\mathrm{sc}}(E))$. (arxiv.org)

The Four Moment Theorem, surveyed by Tao and Vu in December 2011, supplies a comparison principle at this finer scale. In one formulation, two Wigner ensembles satisfy a uniform stretched-exponential tail bound, their corresponding off-diagonal entries match moments through order four, and their diagonal entries match through order two. For complex entries, matching means equality of mixed moments of the real and imaginary parts up to the specified total degree. After the fine-scale normalization $A_n=\sqrt n M_n$, expectations of sufficiently smooth functions of a fixed number of selected eigenvalues differ by a quantity tending to zero. The test functions must satisfy explicit derivative bounds; the theorem is not an assertion that the entire spectra have identical distributions. (arxiv.org)

The proof uses the Lindeberg replacement strategy: entries are exchanged one at a time, replacing each off-diagonal entry together with its conjugate to preserve Hermitian symmetry. A perturbative expansion shows that matching moments cancels the leading contributions to the expected change. Estimates controlling eigenvalue gaps and eigenvector delocalization bound the remaining errors, allowing them to be summed over the matrix’s entries. This connects assumptions on individual random variables to the collective behaviour of eigenvalues. (arxiv.org)

In their February 2012 survey, Tao and Vu described how comparison theorems, combined with results for Gaussian-divisible ensembles and moment-matching constructions, yield universality beyond Gaussian matrices. For complex Hermitian ensembles under the relevant hypotheses, bulk correlation statistics converge, in specified weak senses, to those governed by the sine kernel,

with diagonal value $K(x,x)=1$. The rescaling by the local semicircle density is essential. Real symmetric ensembles have a different symmetry class, while spectral edges require a different scaling from the bulk. Moment matching is a hypothesis of the comparison theorem, not a claim that every universality result requires four prescribed moments; their survey also discusses versions using sufficiently high finite-moment bounds rather than stretched-exponential tails. (arxiv.org)

Their 2011 paper “Random matrices: Universal properties of eigenvectors” extended comparison to eigenvector coordinates and established associated central limit theorems. Because a unit eigenvector is defined only up to sign or complex phase, the proof uses rank-one projections $P_i=u_i u_i^*$, which remove this ambiguity. Under suitable matching and moment hypotheses, selected coordinates, normalized on their natural $n^{-1/2}$ scale and with an appropriate phase convention, exhibit Gaussian limiting behaviour. The paper also proves universality results for the resolvent $R(z)=(M_n-zI)^{-1}$, extending to the real axis under its stated conditions and implying results for inverse matrices. Resolvents encode both eigenvalue locations and eigenvector weights, so these results compare more than the spectrum alone. (arxiv.org)

Compressed sensing and sparse recovery

Tao’s collaboration with Emmanuel Candès and Justin Romberg investigated when incomplete linear measurements determine a sparse signal, a central problem in compressed sensing. Their paper “Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information,” submitted in September 2004 and published in IEEE Transactions on Information Theory in 2006, considered signals with relatively few nonzero entries observed through a randomly selected subset of their Fourier coefficients. For a fixed signal of length $N$ with $s$ nonzero entries, their results gave exact recovery with high probability when the number of sampled frequencies was sufficiently large relative to $s\log N$, with constants depending on the desired probability of success. This was a probabilistic recovery guarantee, not a statement that every selection of that many frequencies suffices. (arxiv.org)

The underlying inverse problem can be written $y=Ax$, where $x$ has $N$ coordinates and the measurement matrix $A$ has only $m<N$ rows. The resulting underdetermined system does not uniquely identify an arbitrary vector. Sparsity supplies additional structure: only $s$ coordinates are nonzero, although their locations need not be known beforehand. The reconstruction procedure minimizes the sum of absolute coordinate values:

This is a convex optimization problem, expressible as linear programming for real-valued variables. Its recovery guarantees depend on the interaction between sparsity and the measurement matrix, rather than on sparsity alone. (arxiv.org)

A key sufficient condition developed in this research is the restricted isometry property, also described through a uniform uncertainty principle. It requires small groups of measurement-matrix columns to behave approximately like orthonormal systems. Thus, although $A$ loses information on the full vector space, it approximately preserves lengths on sufficiently sparse vectors. Tao’s account distinguishes guarantees for a fixed sparse signal with high probability over the measurements from uniform guarantees applying to every sufficiently sparse signal for a qualifying matrix. It also distinguishes random Fourier measurements from Gaussian and Bernoulli measurement ensembles; their sampling bounds and hypotheses are not interchangeable. (arxiv.org)

Candès, Romberg, and Tao extended the analysis in “Stable Signal Recovery from Incomplete and Inaccurate Measurements,” submitted in March 2005 and published in 2006. With noisy data $y=Ax+e$ and $\|e\|_2\leq\epsilon$, they replaced exact consistency by

Under their restricted-isometry hypotheses, an $s$-sparse signal satisfies $\|\widehat{x}-x\|_2\leq C\epsilon$. For approximately sparse signals, the bound includes an additional term proportional to $\|x-x_s\|_1/\sqrt{s}$, where $x_s$ retains the $s$ largest coordinates in magnitude. The error therefore reflects both measurement noise and departure from exact sparsity. (math.ucla.edu)

The work connected signal processing with tractable mathematical optimization through concrete models beyond isolated nonzero samples. The 2004 paper also treated piecewise-constant objects by minimizing total variation, exploiting the small number of discontinuities rather than sparsity of the objects themselves. In that setting, reconstruction from incomplete frequency data depended on controlling the number of jumps. Such examples specify the structural information that makes reduced sampling possible; they do not permit unrestricted signals to be reconstructed from arbitrarily few measurements. (arxiv.org)

Books, teaching, and mathematical exposition

Tao’s Solving Mathematical Problems: A Personal Perspective first appeared through Deakin University Press in 1992; Oxford University Press published the second edition in 2006. It addresses reasoning at Mathematical Olympiad level rather than offering a systematic university mathematics course. Its organization places a chapter on problem-solving strategies before worked examples in number theory, algebra and analysis, geometry, and miscellaneous topics. The emphasis is on how a solution develops, not simply on presenting a finished proof: examples connect general strategies with the particular features of individual problems. The distinction between the two publication dates is important, since the 2006 volume is a revised edition of an earlier work, not Tao’s first book. (math.ucla.edu)

Analysis I and Analysis II, both first published by Hindustan Book Agency in 2006, grew out of his UCLA Math 131A and 131B lecture notes. Intended for honours undergraduates already acquainted with calculus, they emphasize the foundations and logical structure of analysis. The first volume begins with natural numbers, sets, and the construction of number systems before developing limits, infinite series, continuity, differentiation, and Riemann integration. The second proceeds through metric spaces, uniform convergence, power series, Fourier series, and several-variable differential calculus. The sequence thus makes explicit the definitions and convergence arguments underlying familiar calculus operations, rather than treating those operations primarily as computational procedures. (terrytao.wordpress.com)

An Epsilon of Room, I: Real Analysis, published in the American Mathematical Society’s Graduate Studies in Mathematics series in 2010, operates at a different level. Derived from graduate courses taught at UCLA and posts written in 2009, it assumes undergraduate analysis and prior familiarity with measure and integration theory. Its subjects include signed measures and the Radon–Nikodym theorem, Lebesgue spaces, Hilbert and Banach spaces, duality, the Fourier transform, distributions, and Sobolev spaces. These prerequisites distinguish it from the foundational Analysis textbooks. The companion second volume contains independent mathematical articles rather than continuing the course as a single sequential textbook. (terrytao.wordpress.com)

The research blog What’s New began on 22 February 2007, succeeding a research-update page that Tao had maintained on his UCLA website since 1999. The earlier page announced papers, slides, and notes, gradually adding explanatory commentary; the blog supplied a setting for reader responses and more varied mathematical writing. Its contents included discussions of open problems, informal explanations of techniques, guest contributions, presentations of lectures, and graduate course notes. Tao’s account of its first year describes how comments supplied bibliographic information, identified unclear passages, and suggested connections with other fields. This exchange made exposition open to correction and elaboration before some of it entered print. (terrytao.wordpress.com)

Selected posts from 2007 became Structure and Randomness: Pages from Year One of a Mathematical Blog, published by the American Mathematical Society in 2008. The articles were revised for publication, including formalized and updated references, rather than reproduced as an unedited chronological archive. The collection groups material into open problems, expository articles, and lectures. Examples include an explanation of compressed sensing and single-pixel cameras, a discussion of obstacles to global regularity for the Navier–Stokes equations, and lectures on structure and randomness. These retain distinct purposes: explaining an application, analyzing the difficulty of an unresolved problem, and developing a broader mathematical theme. (terrytao.wordpress.com)

Online collaboration and formal verification

Tao’s participation in Polymath5 illustrates how an online collaboration could produce useful intermediate results without immediately solving its central problem. The project investigated the Erdős discrepancy problem through publicly discussed reductions and partial arguments. Tao’s September 2015 proof explicitly incorporated two of its contributions: a Fourier-analytic reduction from arbitrary sign sequences to stochastic completely multiplicative functions, and an argument addressing functions resembling modulated Dirichlet characters. Between these components, Tao supplied a logarithmically averaged correlation theorem. The completed proof therefore combined results developed collectively online with subsequent individual research; it was not simply a transcription of an already completed Polymath argument. (arxiv.org)

In November 2023, Tao, Yaël Dillies, and Bhavik Mehta began a collaborative Lean 4 formalization of the polynomial Freiman–Ruzsa theorem over the two-element finite field. The mathematical proof, by Timothy Gowers, Ben Green, Freddie Manners, and Tao, preceded this project. Its original quantitative statement asserted that a nonempty set $A\subseteq\mathbb F_2^n$ satisfying $|A+A|\leq K|A|$ can be covered by at most $2K^{12}$ translates of a subspace of cardinality at most $|A|$. Formalization translated this argument into definitions and deductions checkable by a proof assistant, rather than asking software to discover the theorem independently. On 5 December 2023, Tao announced that the principal theorem had been checked without sorry placeholders—Lean’s notation for an omitted proof—after approximately three weeks of collaboration. (terrytao.wordpress.com)

Patrick Massot’s Blueprint tool organized this work by linking a human-readable mathematical account to the corresponding Lean declarations. Its dependency graph displayed which definitions and lemmas were formalized, which statements still lacked proofs, and which tasks had their prerequisites available. Contributors could consequently work on individual lemmas without mastering the entire argument. This process also exposed details needing explicit formulation: Tao’s November 2023 tour noted that the nonemptiness hypothesis on $A$, initially absent from the blueprint’s statement, had been included in Lean. The blueprint coordinated the work, but its prose and progress indicators were distinct from the formal proofs themselves. (terrytao.wordpress.com)

Tao launched the Equational Theories Project on 25 September 2024 to apply distributed collaboration and formal verification to mathematical exploration, rather than solely to an existing proof. Its objects were magmas: sets equipped with a binary operation, with no initial assumption of associativity or commutativity. The project compared 4,694 equational laws involving at most four occurrences of that operation, identifying laws up to variable renaming and symmetry of equality. Each ordered pair posed a precise question: does every magma satisfying the first law also satisfy the second? A positive answer required a deduction; a negative answer required a counterexample satisfying the first law but violating the second. (terrytao.wordpress.com)

The workflow combined human constructions, searches through finite multiplication tables, and automated theorem proving with tools including Vampire, Prover9, and Mace4. Proposed deductions and candidate counterexamples were separate from verified conclusions: their mathematical content had to be validated in Lean, with further relationships obtained through logical dependencies such as transitivity. The project’s December 2025 report recorded the resolution of all 22,028,942 ordered comparisons between distinct laws, using human-generated and automated proofs validated in Lean. This completed classification concerned unrestricted magmas; the report separately discussed the altered questions arising when only finite magmas are permitted. (terrytao.wordpress.com)

Awards, academy memberships, and professional service

Tao received the Fields Medal in 2006. The International Mathematical Union’s citation recognized his contributions to partial differential equations, combinatorics, harmonic analysis, and additive number theory, rather than identifying a single theorem as the basis of the award. Its accompanying account illustrated this breadth through his work with Ben Green on arithmetic progressions of primes, investigations of the Kakeya problem, and research on nonlinear wave and Schrödinger equations. In particular, it highlighted his collaboration with James Colliander, Markus Keel, Gigliola Staffilani, and Hideo Takaoka on existence results for nonlinear Schrödinger equations. These examples placed both individual research and collaborative work within the medal’s recognition. (mathunion.org)

His other research distinctions include the Salem Prize in 2000 and the Crafoord Prize in Mathematics in 2012. The latter was awarded jointly to Tao and Jean Bourgain; the award announcement identified contributions spanning harmonic analysis, partial differential equations, ergodic theory, number theory, combinatorics, functional analysis, and theoretical computer science. Tao was also one of five inaugural recipients of the 2015 Breakthrough Prize in Mathematics, alongside Simon Donaldson, Maxim Kontsevich, Jacob Lurie, and Richard Taylor. His Breakthrough citation again emphasized contributions across harmonic analysis, combinatorics, partial differential equations, and analytic number theory. (teorth.github.io)

The MacArthur Fellowship requires a distinction between its award year and the period recorded in Tao’s curriculum vitae: the MacArthur Foundation identifies him as a member of its 2006 class, while his CV lists the fellowship for 2007–2011. The foundation’s profile cited research on the honeycomb approach to Horn’s conjecture, nonlinear Schrödinger equations, and prime-number progressions, together with his mathematical exposition through books, lectures, and his website. The fellowship therefore appears in his record alongside research prizes but represents a separate form of support for an individual’s work. (macfound.org)

Academy elections are distinct from these prizes and fellowships. Tao became a corresponding member of the Australian Academy of Science in 2006 and a Fellow of the Royal Society in 2007; his Royal Society election certificate is dated 17 May 2007. He was elected to the United States National Academy of Sciences in 2008, initially as a foreign affiliate according to his CV, which records regular membership from 2022. The American Academy of Arts and Sciences elected him in 2009. These dates record admission to scholarly bodies, rather than the award of a prize for a particular result or group of results. (teorth.github.io)

Tao’s professional service includes mathematical journal editing. His UCLA research profile identifies editorial and associate-editorial responsibilities, and its linked submissions page lists him as an editor of Forum of Mathematics and an associate editor of the American Journal of Mathematics and Dynamics of Partial Differential Equations. The page directs prospective authors to the respective journals’ submission procedures. His academy service has also included membership of the Royal Society’s Newton International Fellowships Committee for the physical sciences from January 2016 through December 2021. (math.ucla.edu)

References

1. Vitae and Bibliography for Terence Taomath.ucla.edu
2. Vitae and Bibliographymath.ucla.edu
3. Scholarship for young SA math talentnews.flinders.edu.au
4. Mathematical minds: Terence Taoaustms.org.au
5. Thesismath.ucla.edu
6. Terence Tao — Curriculum Vitaeteorth.github.io
7. Terence Tao, ‘Mozart of Math,’ is first UCLA math prof to win Fields Medalnewsroom.ucla.edu
8. Terence Tao Appointed to UCLA’s James and Carol Collins Chair in the College of Letters and Science; Will Deliver Public Colloquium Jan. 17newmediawire.com
9. UCLA Department of Mathematics: Terence Taomath.ucla.edu
10. Terence Tao, UCLAmath.ucla.edu
11. On the Multilinear Restriction and Kakeya conjecturesarxiv.org
12. On the Multilinear Restriction and Kakeya conjecturesarxiv.org
13. Restriction and Kakeya phenomena for finite fieldsarxiv.org
14. Restriction and Kakeya phenomena for finite fieldsarxiv.org
15. Fuglede's conjecture is false in 5 and higher dimensionsarxiv.org
16. Well-posedness for non-linear dispersive and wave equationsmath.ucla.edu
17. Terence Tao's research interestsmath.ucla.edu
18. The nonlinear Schrödinger equation with combined power-type nonlinearitiesarxiv.org
19. The nonlinear Schrödinger equation with combined power-type nonlinearitiesarxiv.org
20. Global regularity for a logarithmically supercritical defocusing nonlinear wave equation for spherically symmetric dataarxiv.org
21. Global regularity for a logarithmically supercritical defocusing nonlinear wave equation for spherically symmetric dataarxiv.org
22. Finite time blowup for an averaged three-dimensional Navier-Stokes equationarxiv.org
23. The primes contain arbitrarily long arithmetic progressionsarxiv.org
24. The primes contain arbitrarily long arithmetic progressionsarxiv.org
25. The primes contain arbitrarily long polynomial progressionsarxiv.org
26. The Erdos discrepancy problemarxiv.org
27. The Erdős discrepancy problemarxiv.org
28. Almost all orbits of the Collatz map attain almost bounded valuesarxiv.org
29. Almost all orbits of the Collatz map attain almost bounded valuesarxiv.org
30. The honeycomb model of GL(n) tensor products I: proof of the saturation conjecturearxiv.org
31. The honeycomb model of GL(n) tensor products I: proof of the saturation conjecturearxiv.org
32. Preprints in Honeycombs and puzzlesmath.ucla.edu
33. Honeycombs and sums of Hermitian matricesarxiv.org
34. The honeycomb model of GL(n) tensor products II: Puzzles determine facets of the Littlewood-Richardson conearxiv.org
35. Random matrices: The Four Moment Theorem for Wigner ensemblesarxiv.org
36. Random matrices: The Universality phenomenon for Wigner ensemblesarxiv.org
37. Random matrices: Universal properties of eigenvectorsarxiv.org
38. Compressed sensingmath.ucla.edu
39. Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Informationarxiv.org
40. Stable Signal Recovery from Incomplete and Inaccurate Measurementsarxiv.org
41. Stable Signal Recovery from Incomplete and Inaccurate Measurementsarxiv.org
42. Solving mathematical problemsterrytao.wordpress.com
43. Analysis Iterrytao.wordpress.com
44. Analysis IIterrytao.wordpress.com
45. Analysis I: Fourth Editionlink.springer.com
46. Analysis II: Fourth Editionlink.springer.com
47. An epsilon of room: pages from year three of a mathematical blogterrytao.wordpress.com
48. An Epsilon of Room, I: Real Analysisterrytao.wordpress.com
49. What’s new - 2007: Open questions, expository articles, and lecture series from a mathematical blogterrytao.wordpress.com
50. Structure and Randomness: pages from year one of a mathematical blogterrytao.wordpress.com
51. On a conjecture of Martonterrytao.wordpress.com
52. Formalizing the proof of PFR in Lean4 using Blueprint: a short tourterrytao.wordpress.com
53. Project completed! Thoughts and reflections?leanprover-community.github.io
54. A pilot project in universal algebra to explore new ways to collaborate and use machine assistance?terrytao.wordpress.com
55. Equational Theory Projectterrytao.wordpress.com
56. The Equational Theories Project: Advancing Collaborative Mathematical Research at Scalearxiv.org
57. Fields Medals 2006mathunion.org
58. Fields Medal: Terence Taomathunion.org
59. Recipients Of The 2015 Breakthrough Prizes In Fundamental Physics And Life Sciences Announcedbreakthroughprize.org
60. Terence Tao — MacArthur Foundationmacfound.org
61. Directory of Fellows, 1981–2021macfound.org
62. Tao, Terence Chi-Shen: certificate of election to the Royal Societycatalogues.royalsociety.org
63. Submissions to journalsmath.ucla.edu