Chapter 7: The Mathematician at the Wall

Thesis: In mathematics you meet the purest form of the unverifiable (intractable, and sometimes undecidable), and the capable responses are: verify a finite slice and prove a bound (a certificate), swap the target for an equivalent but more tractable statement (proxy substitution), and use probabilistic methods that accept an $\varepsilon$ of error (the probabilistic method).

At the Wall

The difficulty of a hard problem often lies not in how hard it is, but in your being unable to measure how far you still stand from it.

A climber can see the summit; someone debugging a program gets error messages. They at least know whether the direction is right, whether they are getting closer or farther. Proving a mathematical conjecture gives you none of this. You might be a single thought away from the answer, or a century away, and there is no instrument at hand to tell you which. In Riemann's eight-page paper of 1859⁹, he set down the conjecture later named after him almost as an aside, then added a line: one would of course wish for a rigorous proof; after a few fleeting, futile attempts I have provisionally set the matter aside, since it is not necessary for the immediate object of my inquiry. That setting aside has lasted more than a hundred and sixty years.

What this chapter looks at is what mathematicians actually do in front of this wall. I choose mathematics as the site because what it offers is the purest form of the unverifiable. Here there is no hidden state, no opponent who will deceive you, no excuse that time was too short. A proposition is either true or false, black and white. And yet it is precisely in this cleanest of places that verification remains systematically out of reach. To see clearly how a capable person acts here is to gain a point of reference for what happens in the dirtier sites that follow: the person at the console, the agent let loose, the organization that cannot see itself.

The Verification Gap

First, state the shape of the wall precisely.

Checking a proof is easy; finding a proof is hard. Hand someone a fully written formal derivation, and checking it line by line against the axioms and inference rules is mechanical work, something a machine could in principle do, and it is guaranteed to deliver a yes or no in finitely many steps. Finding that derivation is another matter. This asymmetry is the bedrock of the whole chapter.

It has a precise logical statement. In 1936, Church and Turing each proved that the decision problem (the Entscheidungsproblem) has no solution: there is no algorithm that can decide, for an arbitrary first-order proposition, whether it is logically valid, equivalently (by Gödel's completeness theorem), whether it is provable. For a system that is sufficiently rich, recursively axiomatizable, and consistent (Peano arithmetic, say, or ZFC), the set of its theorems is recursively enumerable but not recursive: you can list all the proofs one by one, yet no program can decide that some proposition is not a theorem. Checking is decidable, theoremhood is undecidable, and the difference between the two is that gap.

One layer deeper (skippable): The qualifier "sufficiently rich" is doing real work. There are theories that genuinely are decidable: Presburger arithmetic (the natural numbers with addition only), Tarski's real closed fields. In those worlds a decision procedure exists, and every proposition can be adjudicated mechanically. Undecidability is not the universal fate of logic, but the price exacted once expressive power crosses a certain threshold. The analytic number theory where the Riemann hypothesis (RH) lives is far above that threshold.

A sharper layer still is that not only is proof search hard, but even "am I close" has no decision procedure. This is exactly what makes RH tormenting: it resists not only solution but any estimate of progress. Among the five faces of Chapter 2, this chapter stands at the boundary of "undecidable" and "intractable": some problems have no procedure in principle, others have a procedure but at a cost too large to run within the lifetime of the universe. You cannot see what lies behind the wall, and so a capable person stops chiseling at it head-on and shifts stance. The three stances below will recur in other chapters of this book, only under different names.

Certificates and Bounds

The first stance: stop verifying the whole, verify only a slice, and prove a guaranteed bound for it.

Return to the $\zeta$ function. Riemann continued Euler's prime series into a function on the whole complex plane and wrote down its completed form

$$\xi(s) = \tfrac{1}{2}\,s(s-1)\,\pi^{-s/2}\,\Gamma!\left(\tfrac{s}{2}\right)\zeta(s),\qquad \xi(s)=\xi(1-s).$$

This symmetric functional equation folds the critical strip onto itself left and right. The conjecture says that all the nontrivial zeros of $\zeta$ lie on the critical line $\operatorname{Re}(s)=\tfrac12$ (the trivial zeros sit at the negative even integers). The quantifier "all" is where the unverifiability lives.

But finitely many zeros can be verified. Here two things often run together must be kept apart. In 2004 Gourdon computed the first $10^{13}$ zeros and found them all on the line¹⁷; this is numerical computation, carried out in high-precision floating point, and it inspires extremely strong confidence, yet it is not a certificate, because it does not rigorously bound the rounding error. What Platt did in 2017 was something else¹⁸: using interval arithmetic, he rigorously confined all the zeros up to an imaginary part of about $3.06\times10^{10}$ to the critical line, and Platt and Trudgian pushed this height to $3\times10^{12}$ in 2021. Only the latter two are certificates: a bounded, local, mechanically recheckable guarantee. It is true, but it is not a theorem. However high the zeros are verified, it never crosses the threshold of "all."

This stance has its respectable precedents in mathematics. In 1896 Hadamard and de la Vallée Poussin each proved the prime number theorem $\pi(x)\sim x/\ln x$, relying on a bound much weaker than RH yet within reach: that $\zeta$ has no zeros on the line $\operatorname{Re}(s)=1$. Unable to prove the zeros all sit at $\tfrac12$, first prove that none of them sit on the line $1$. This is trading a weak provable proposition for a stretch of real progress along the road toward the strong one.

The same stance, carried over into software, at once wears a familiar face. A type system does not prove a program "wholly correct"; it proves only one property (that an integer will not be dereferenced as a pointer), and in exchange it gets a decidable check. Formal verification goes further: in 2017 Hales's team completed a machine-checkable proof of the Kepler conjecture²⁵, compressing an argument that human referees had argued over for years into a line-by-line verifiable certificate. The price is always the same: a certificate buys certainty on a slice, wagering generality, and a slice is not a theorem. And so some turn instead to move the target itself.

Proxy Substitution

The second stance: stop guarding the original proposition to the death, and swap it for an equivalent but more tractable statement.

The equivalent rewritings of RH are astonishingly many. In 1997 Xian-Jin Li gave a criterion¹⁴: RH holds if and only if a sequence of real numbers $\lambda_n\ge 0$ for all $n\ge1$, where

$$\lambda_n=\sum_{\rho}\left[1-\left(1-\tfrac{1}{\rho}\right)^{n}\right],$$

the sum taken over the nontrivial zeros. A geometric statement about the location of the zeros is translated into the positivity of a sequence of numbers. Nyman and Beurling gave another: RH is equivalent to the indicator function $\chi_{(0,1)}$ lying in the $L^2(0,1)$ closure spanned by a family of dilated fractional-part functions, translating the zero problem into an approximation problem; Báez-Duarte in 2003 tightened it into a sequence version using only integer dilations¹⁶, corresponding to a sequence of distances $d_n\to0$. Lagarias in 2002 even gave an equivalence elementary enough to write on a postcard³²: for all $n$, $\sigma(n)\le H_n+\exp(H_n)\ln H_n$, where $H_n$ is the harmonic number and $\sigma$ is the sum of divisors.

I have walked a stretch of this road myself. I carried RH into Li's criterion, into the Nyman-Beurling-Báez-Duarte approximation framework, then into the language of operator spectra and stochastic processes, each time nursing the same hope: change the language, and perhaps the difficulty would reveal a handle in the new coordinates. And each time the conclusion, squarely faced, was the same: the equivalence is real, the difficulty undiminished by a single ounce. I had not unlocked the problem; I had merely renamed it and changed its clothes.

This is the standard way proxy substitution fails in mathematics, and it deserves an accurate name: a faithful but no-easier proxy. The equivalence guarantees that it still points at the same true target (faithful), yet it is not one bit more tractable than the original (no easier). Whether the move succeeds rides entirely on whether you can secure both faithfulness and greater tractability at once, and getting both is exceedingly rare. So rare that this is precisely where the whole craft lies.

Spread these two dimensions out into a table, and a thread buried in this chapter shows itself:

	Easier	No easier
Faithful	The ideal proxy (rare, where the whole craft lies)	Mathematics' equivalent rewritings: you have only renamed the difficulty (this chapter)
Unfaithful	Goodhart: you optimize the proxy, and the true target rots (Chapters 8, 11)	Useless, no one would want it

The mathematician founders at the left end of the diagonal: faithful but no easier. Later, in the chapter on organizations, we will founder at the other end: an easier but unfaithful proxy, which you optimize with all your might while the thing you actually care about goes bad. The same move, two opposite directions of failure. Chapter 11 will formally join these two ends. For now it is enough to remember one thing: swapping the target is neither cheating nor a way out; it is a stance, and whether it works is a separate question.

The Probabilistic Method

The third stance runs most against the grain of mathematics: stop demanding a two-valued verdict, and instead hold a calibrated probability, accepting a bounded risk of error in order to act.

The primality test is the cleanest example. To judge whether a large number is prime, deterministic algorithms are costly, and Miller-Rabin changes the question. If $n$ is composite, a randomly chosen base will at most slip past it with probability $1/4$, and doing $k$ independent rounds drives the chance of misjudgment down to $\le (1/4)^k$. Solovay and Strassen had earlier given a version with error $\le (1/2)^k$²⁰ (in 1977); Rabin's version is from 1980¹⁹. "Prime with probability $1-\varepsilon$" is an epistemic object fundamentally different from "proven prime," but it is good enough for engineering, and it can be made as sharp as you like: just add a few more rounds.

What matters is to see clearly what has been given up here. What is given up is the kind of certainty, not the rigor. That bound $(1/4)^k$ is itself a theorem, proved tight. You have not lowered the standard; you have only swapped one standard for another that can be delivered within budget. The probabilistic method has its standing in pure mathematics as well: Erdős's probabilistic method (Alon and Spencer wrote it into a classic²⁶) can prove that some object exists by proving that the probability of its appearing is positive, yet without handing you the object itself. Existence is proved, the construction absent.

This stance runs all the way to the belief in RH itself. Montgomery in 1973, studying the pair correlation of the zeros³⁰, derived and conjectured that the normalized pair-correlation function of the zeros takes the form

$$R_2(u)=1-\left(\frac{\sin \pi u}{\pi u}\right)^{2}.$$

At Princeton, Dyson recognized at a glance that this is exactly the pair correlation of the eigenvalues of the random-matrix Gaussian unitary ensemble (GUE). Odlyzko in 1987 did the numerics with a vast number of zeros³³, verifying the agreement to a degree that takes the breath away. None of this is a proof, yet it is extremely strong evidence, leading mathematicians to believe RH, and to believe it in a way no different in essence from the way a physicist believes a law that has not yet been falsified. The interior of mathematics has, it turns out, grown its own method for forming belief amid the unverifiable.

How Mathematicians Judge

So we arrive at the genuinely human part of this chapter: when the oracle never comes, what does a person of judgment rely on to hold a belief and to decide where to push.

Mathematics is deductive on the outside and plausible on the inside. Pólya wrote Mathematics and Plausible Reasoning² precisely to describe how mathematicians, lacking a proof, weigh the import of a proposition through analogy, induction, and special cases; Hadamard surveyed the psychology of mathematical invention³, recording the rhythm of incubation and sudden insight; Poincaré left us that famous moment⁵, the instant his foot touched the step of the omnibus, when the connection between Fuchsian functions and non-Euclidean geometry surged up without warning. These are not substitutes for proof, but the things a person actually relies on along that instrumentless stretch of road before the proof arrives.

Why do mathematicians believe RH before a proof appears? Because the evidence accumulates in every direction and corroborates itself: a vast number of zeros verified on the line, many equivalent forms none of which has collapsed, an analogue already conquered (the Weil conjectures, that is, the Riemann hypothesis over function fields, proved by Deligne), statistical behavior matching the predictions of random matrices exactly. No single one of these is a proof, yet together they constitute a disciplined belief.

The mathematical community has reflected on the standing of this belief too. Thurston's 1994 essay "On Proof and Progress in Mathematics"²¹ argues that what mathematics advances is human understanding, not merely the inventory of formal proofs; the 1993 debate between Jaffe and Quinn over "theoretical mathematics"²² was precisely asking to what extent conjecture-driven, evidence-first work counts as mathematics. Tao asked what good mathematics is²⁹, and not one item in his answer is "already proved." Set these side by side and the very ability to judge "this proposition is most likely true, and worth investing in" is itself a calibrated belief, which is exactly what Part IV will name head-on. A capable actor is not paralyzed when the oracle is absent, nor does he pretend to certainty; he holds a belief with its scale marked, and then acts all the same.

Where This Chapter Leads

Having hit the purest form of the unverifiable, the mathematician did not wait for a decision procedure. What he got was this: certificates (verify a slice, prove a bound), proxy substitution (swap the target for an equivalent statement, and own up to the fact that it is often faithful but no easier), probabilistic acceptance (give up the two-valued verdict, hold a calibrated probability and act), and the judgment to hold a belief before the proof.

None of these is an emergency measure peculiar to mathematics. Caging untrusted code in a sandbox, auditing an organization, inferring behind an interface the preferences a user has left unspoken: the things one reaches for are these same few, only in different jargon. Part III will lift each move out of the field where it grew, name it separately, and juxtapose it across domains; that comparison table is the payload of the whole book.

One plain word remains here. This book's own central claim, that "responses converge on the same small set," I cannot at this moment verify either. My belief in it is the same kind of thing as a mathematician's belief in RH: a belief built on cross-domain evidence, with its scale marked, yet without a proof. Chapter 14 will return to this, and let the book do, in person, the very thing it has been describing all along.

Next chapter: 8. The Organization Blind to Itself →← 6. The Agent Released

References

Waypoints: 1. historical scientific judgment; 2. theoretically studied material; 3. how science progresses; 4. how to live in an unverifiable world. This section was checked source by source.

G. Polya (1945). How to Solve It: A New Aspect of Mathematical Method. Princeton University Press. [1] Pólya breaks mathematical problem-solving into four stages: understanding the problem, devising a plan, carrying it out, and looking back, and systematically lays out heuristic strategies such as analogy, special cases, working backward, and auxiliary problems. What he writes is not the proof of theorems but the instrumentless process of exploration before a proof is found, exactly what the section "How Mathematicians Judge" cares about.
G. Polya (1954). Mathematics and Plausible Reasoning (2 vols.). Princeton University Press. [1][4] The two volumes treat, respectively, induction and analogy in mathematics and the logical structure of plausible reasoning, arguing that before they reach a rigorous proof mathematicians form their belief in a proposition by observing special cases, inducing patterns, and weighing evidence. The main text borrows from it to point out that "mathematics is deductive on the outside and plausible on the inside," and it is the source reading for understanding the concept of plausible reasoning.
J. Hadamard (1945). An Essay on the Psychology of Invention in the Mathematical Field. Princeton University Press. [1] Hadamard surveyed the creative psychology of mathematicians and distilled the rhythm of discovery into preparation, incubation, illumination, and verification, stressing subconscious work and the unheralded flash of inspiration. It provides a first-hand psychological study for this chapter's account of Poincaré-style insight, showing that much of mathematical judgment happens outside consciousness and outside proof.
H. Poincaré (1902). La Science et l'Hypothèse. Flammarion. [1] In this classic of the philosophy of science, Poincaré discusses the standing of mathematical hypotheses, conventions, and geometry, arguing that many foundational choices are not imposed by experience but adopted out of convention and convenience. It shows how a leading mathematician reflects on the epistemological foundations of his own discipline, in tune with this chapter's concern with how to hold a belief where verification is unavailable.
H. Poincaré (1908). Science et Méthode. Flammarion. [1] The passage in which inspiration arrives as he steps onto the running board of an omnibus is the most often cited first-hand record in the psychology of mathematical discovery, by which Poincaré dissects the role of intuition, choice, and the subconscious in creation. The main text uses this moment directly, to show how insight connects scattered threads without any prior sign.
G. H. Hardy (1940). A Mathematician's Apology. Cambridge University Press. [1] Hardy defends the value of pure mathematics, holding that good mathematics lies in its seriousness, depth, and inevitable beauty, not in utility. As the introspection of a great number theorist on his own craft, it defines on what grounds a mathematician judges whether a piece of work is worth doing, of a piece with the question that closes this chapter, "what is good mathematics."
E. P. Wigner (1960). "The Unreasonable Effectiveness of Mathematics in the Natural Sciences." Communications on Pure and Applied Mathematics, 13(1). [2][3] Wigner marvels that abstract mathematical concepts can describe the physical world with such precision, calling this fit a strange gift we neither understand nor deserve. The puzzle this short essay poses has no agreed answer to this day; for this chapter it exemplifies how a belief in a deep regularity can be taken seriously in the absence of proof.
I. Lakatos (1976). Proofs and Refutations: The Logic of Mathematical Discovery. Cambridge University Press. [1][3] Lakatos, taking Euler's polyhedron formula as his example, re-enacts through a fictional classroom dialogue how definition, proof, and counterexample mutually revise one another and together advance mathematics. It overturns the stereotype of mathematics as once-and-for-all deduction, presenting knowledge as growing crookedly through conjecture and refutation, exactly suited to this chapter's concern with the true shape of mathematical progress.
B. Riemann (1859). "Über die Anzahl der Primzahlen unter einer gegebenen Größe." Monatsberichte der Berliner Akademie. [2][3] Riemann's eight-page paper continues the $\zeta$ function onto the complex plane, gives the functional equation, and links the distribution of primes to the nontrivial zeros of $\zeta$; the conjecture about the location of the zeros written down there in passing is the later Riemann hypothesis. It is the source text of the whole chapter, and the line quoted at this chapter's opening about "set aside provisionally after futile attempts" comes from here.
H. M. Edwards (1974). Riemann's Zeta Function. Academic Press. [2] Edwards's monograph develops around Riemann's original 1859 paper, gradually laying out the theory of the $\zeta$ function, the prime number theorem, and the origins of the Riemann hypothesis, attending to both historical context and technical detail. It is the classic introduction to the $\zeta$ function and RH, providing reliable background for the concepts this chapter touches, such as zeros and the critical line.
E. C. Titchmarsh, rev. D. R. Heath-Brown (1986). The Theory of the Riemann Zeta-function (2nd ed.). Oxford University Press. [2] This is the standard advanced monograph on the analytic theory of the $\zeta$ function, systematically treating the distribution of zeros, zero-density estimates, and mean-value theorems on the critical line, with Heath-Brown's revision adding more recent advances. It represents the sum of the technical results rigorously established around RH, and is the specialist background reference when this chapter discusses "certificates and bounds."
E. Bombieri (2000). "Problems of the Millennium: The Riemann Hypothesis." Clay Mathematics Institute. [2][4] This is the official problem statement of RH written for the Clay Mathematics Institute's Millennium Prize Problems, in which Bombieri concisely sets out the conjecture's origins, precise formulation, and weight in number theory. It is the authoritative entry point for understanding why RH is ranked among the problems of the century, and this chapter's assessment of RH's standing finds its warrant here.
J. B. Conrey (2003). "The Riemann Hypothesis." Notices of the American Mathematical Society, 50(3). [2][3] Conrey's survey, aimed at a broad readership, marshals the various kinds of evidence supporting RH, including the numerical verification of zeros, the agreement with random matrix theory, and the proven analogue over function fields. It gathers in one place the evidence on which this chapter's three stances rely, and is a convenient read for understanding why the mathematical community believes RH.
X.-J. Li (1997). "The Positivity of a Sequence of Numbers and the Riemann Hypothesis." Journal of Number Theory, 65(2). [2][4] Xian-Jin Li proves that RH is equivalent to a sequence of real numbers $\lambda_n$ defined from the zeros being nonnegative for all $n$, translating the geometric statement about the location of the zeros into a positivity criterion for a sequence. The main text takes it as the foremost example of proxy substitution, showing how an equivalent rewriting can be faithful yet not necessarily easier.
E. Bombieri & J. C. Lagarias (1999). "Complements to Li's Criterion for the Riemann Hypothesis." Journal of Number Theory, 77(2). [2][4] The two authors point out that Li's criterion is in fact a special case of a family of general inequalities for an arbitrary multiset of complex numbers, not specific to the $\zeta$ function, and, using the Guinand-Weil explicit formula, give an arithmetic expression for $\lambda_n$, connecting it to Weil's criterion for RH. It deepens the understanding of Li's criterion and shows how the same equivalent proposition is rewritten again and again across different languages, an extension of this chapter's theme of proxy substitution.
L. Báez-Duarte (2003). "A Strengthening of the Nyman-Beurling Criterion for the Riemann Hypothesis." Atti della Accademia Nazionale dei Lincei, Rendiconti Lincei Mat. Appl., 14(1). [2][4] Báez-Duarte tightens the Nyman-Beurling approximation criterion into a sequence version using only integer dilations, making RH equivalent to a sequence of approximation distances $d_n$ tending to zero. It is yet another equivalent rewriting listed in this chapter, carrying the zero problem into the framework of $L^2$ approximation, and likewise confirms that a faithful proxy is often no easier to solve.
X. Gourdon (2004). "The 10^13 First Zeros of the Riemann Zeta Function, and Zeros Computation at Very Large Height." Online technical report (numbers.computation.free.fr). [2][4] Gourdon, using high-precision floating-point computation with the Odlyzko-Schönhage algorithm, verified that the first $10^{13}$ zeros all fall on the critical line. This chapter deliberately sets it against Platt: it gives extremely strong numerical confidence but does not rigorously bound the rounding error, and so it is a numerical result rather than a mechanically recheckable certificate.
D. J. Platt (2017). "Isolating Some Non-trivial Zeros of Zeta." Mathematics of Computation, 86(307). [2][4] Platt uses interval arithmetic to isolate the zeros rigorously on the critical line, giving the error a provable upper bound and thereby raising numerical verification to a mechanically recheckable certificate. This chapter uses it to exemplify the stance of "certificates and bounds": prove not the whole, but a guaranteed bound for a finite slice.
M. O. Rabin (1980). "Probabilistic Algorithm for Testing Primality." Journal of Number Theory, 12(1). [2][4] Rabin gives the Miller-Rabin primality test: if $n$ is composite, a randomly chosen base slips past it with probability at most $1/4$, and $k$ independent rounds drive the chance of misjudgment down to $(1/4)^k$. This chapter uses it as the cleanest example of the probabilistic method, showing that the error bound itself is a rigorously proved theorem, and what is given up is the kind of certainty, not the rigor.
R. Solovay & V. Strassen (1977). "A Fast Monte-Carlo Test for Primality." SIAM Journal on Computing, 6(1). [2][4] Solovay and Strassen earlier proposed a probabilistic primality test based on the Jacobi symbol, with a single-round chance of misjudgment of at most $1/2$, one of the founding works of randomized algorithms. This chapter places it alongside Rabin's version, showing that trading the probabilistic method for a decision deliverable within budget has long had precedents in computational number theory.
W. P. Thurston (1994). "On Proof and Progress in Mathematics." Bulletin of the American Mathematical Society, 30(2). [1][3] Thurston argues that what mathematics truly advances is human understanding of mathematics, not merely the inventory of formal proofs, and that proof is only a socialized means by which the community transmits and confirms understanding. This chapter cites it at the close to challenge the narrowing view that "mathematics equals proven theorems," and it is essential reading for reflecting on the standing of proof.
A. Jaffe & F. Quinn (1993). ""Theoretical Mathematics": Toward a Cultural Synthesis of Mathematics and Theoretical Physics." Bulletin of the American Mathematical Society, 29(1). [1][3] Jaffe and Quinn propose distinguishing "theoretical mathematics" from rigorous mathematics, suggesting that conjecture-driven, not-yet-rigorously-proved work be explicitly labeled so as not to erode the reliability of mathematics, which set off a widely noted debate in the community. This chapter borrows from that debate to ask to what extent evidence-first work counts as mathematics, cutting right to the whole book's concern with verification and belief.
J. von Neumann (1947). "The Mathematician." In R. B. Heywood (ed.), The Works of the Mind. University of Chicago Press. [1][3] In this essay von Neumann reflects on the nature of mathematics, on how mathematics travels back and forth between abstraction and empirical sources, how it chooses its direction by aesthetic standards, and why drifting too far from the empirical source carries the risk of degeneration. From the vantage of a master who ranged across many fields, it shows the weight of aesthetics and taste in mathematical judgment, echoing this chapter's discussion of how mathematicians decide where to push.
K. Appel & W. Haken (1977). "Every Planar Map Is Four Colorable, Part I: Discharging." Illinois Journal of Mathematics, 21(3). [2][3] Appel and Haken, with the aid of a computer-checked set of unavoidable configurations, proved the four color theorem, the first famous mathematical proof to depend essentially on a computer. It raised a debate that continues to this day: whether a proof no human can read line by line still counts as a proof, directly bearing on this chapter's discussion of certificates and mechanically recheckable guarantees.
T. Hales et al. (2017). "A Formal Proof of the Kepler Conjecture." Forum of Mathematics, Pi, 5. [2][3][4] Hales's team, in the Flyspeck project, used the HOL Light and Isabelle proof assistants to complete a fully formalized, mechanically checkable proof of the Kepler conjecture, settling the unresolved status the original proof had been left in because human referees could not fully check it. This chapter uses it to show how formal verification compresses a contested argument into a line-by-line verifiable certificate.
N. Alon & J. H. Spencer (1992). The Probabilistic Method. Wiley. [2][4] This classic systematically presents the probabilistic method pioneered by Erdős: to prove that some combinatorial object exists, prove that the probability of its appearing at random is positive, and thereby conclude that it must exist, while often being unable to construct it explicitly. This chapter borrows from it to point out the feature of the probabilistic method in proving existence in pure mathematics: existence proved, construction absent.
P. J. Davis & R. Hersh (1981). The Mathematical Experience. Birkhäuser. [1][3] Davis and Hersh, starting from the actual experience of mathematicians, discuss the existential status of mathematical objects, the role of proof, and the philosophical situation of mathematics, presenting a practitioner's perspective different from formalist dogma. It provides this chapter with a close-to-the-ground reflection for understanding how mathematicians hold beliefs in practice and regard truth.
W. T. Gowers (2000). "The Two Cultures of Mathematics." In Mathematics: Frontiers and Perspectives. American Mathematical Society. [1][3] Gowers distinguishes two cultures within mathematics: theory-builders and problem-solvers, the former solving problems for the sake of understanding, the latter understanding for the sake of solving problems, with algebraic geometry, the Langlands program, and combinatorial number theory as contrasts. It shows that mathematicians can hold different measures of what is deep and what is good work, echoing this chapter's discussion of the standards of mathematical judgment.
T. Tao (2007). "What Is Good Mathematics?" Bulletin of the American Mathematical Society, 44(4). [1][3] Tao enumerates the many mutually distinct dimensions of good mathematics, from rigor, depth, and beauty to richness of application and the power to open new directions, arguing that no single standard exists and that, over the long run, these qualities often pull on one another. This chapter borrows from it to show that judging whether a piece of work is worth investing in is itself an ability, and that not one of its standards is "already proved."
H. L. Montgomery (1973). "The Pair Correlation of Zeros of the Zeta Function." In Analytic Number Theory, Proc. Sympos. Pure Math., XXIV. American Mathematical Society. [2][3] Montgomery studies the normalized pair correlation of the zeros of $\zeta$, deriving and conjecturing its form, and Dyson at once recognized this as exactly the pair correlation of the eigenvalues of the random-matrix Gaussian unitary ensemble. This linkage opened the deep connection between number theory and random matrix theory, and is one of the key pieces of evidence when this chapter discusses on what the belief in RH is built.
P. Sarnak (2004). "Problems of the Millennium: The Riemann Hypothesis." Clay Mathematics Institute. [2][3][4] Sarnak's note for the Clay Institute emphasizes the generalized forms of RH and its central role in analytic number theory, explaining why so many other results take it as a premise. From the vantage of an expert active in the connection between zero statistics and random matrices, it rounds out this chapter's understanding of RH's importance and its web of evidence.
J. C. Lagarias (2002). "An Elementary Problem Equivalent to the Riemann Hypothesis." The American Mathematical Monthly, 109(6). [2][4] Lagarias gives an elementary inequality using only the harmonic numbers and the sum-of-divisors function, proving that it holds for all $n$ if and only if RH holds, translating the abstruse zero problem into an arithmetic statement that could almost be written on a postcard. This chapter uses it to show that proxy substitution can be elementary on the surface while the difficulty remains undiminished.
A. M. Odlyzko (1987). "On the Distribution of Spacings Between Zeros of the Zeta Function." Mathematics of Computation, 48(177). [2][4] Odlyzko, with a vast amount of high-precision computation, examines the distribution of spacings between the zeros of $\zeta$ and finds it in astonishing agreement with the prediction of the random-matrix Gaussian unitary ensemble, providing strong numerical support for the Montgomery-Dyson conjecture. This chapter uses it to show that this statistical fit, though not a proof, is extremely strong evidence leading mathematicians to believe RH.

← 6. The Agent Released8. The Organization Blind to Itself →