· Oct 19, 2026
Terence Tao sketches a proof excluding Siegel zeroes
Markdown · JSON · Original source
sketches Ben Green’s formulation of a proof that excludes Siegel zeroes, zeros of Dirichlet L-functions implicated in ineffective error bounds for prime-counting results. Tao contrasts this largely algebraic-number-theory argument with other recent approaches based on analysis, which establish a stronger “quasi-Riemann hypothesis.” The proof seeks to bound how often a Legendre symbol is negative at primes in a specified range. Its central construction turns that counting problem into a question about an integer: Tao builds a lattice from polynomials evaluated, along with their horizontal derivatives, on a carefully chosen grid. The lattice’s squared covolume is a non-zero integer, so its prime divisors and its size can be bounded in two different ways. The key move is to use primes for which the grid lies p-adically close to a curve. That closeness gives a lower bound on the covolume’s divisibility by those primes; an Archimedean bound controls its overall size. Together, the bounds yield the desired estimate. Tao says multiplicity is an innovation in Green’s treatment, and identifies the polynomial method as the parity-breaking input that lets this proof avoid classical analytic number theory methods. The captured evidence omits the mathematical formulas, so the precise parameter choices and numerical bounds cannot be assessed here.
Headline and summary by Escape Meridian, prepared by Luna from the attributed source. A source check is not independent confirmation of the source’s claims.
Original source
· Article
Source details
Original source date: Oct 19, 2026 (2026-10-19T18:27:19+00:00).
Date basis: Date stated by the publisher.
Added to Escape Meridian: 2026-11-05T06:48:09.805Z. First observed: 2026-10-19T18:35:14.833Z. Retrieved: 2026-10-20T14:01:14.199Z.
Referenced by
Recorded citations and public file attachments. A reference alone does not establish agreement or influence.
No public references recorded here yet.
Limits
The captured source text omits mathematical notation and displayed equations in many places, including the stated bounds and parameter definitions; the precise estimates cannot be reconstructed from this evidence. Tao says the sketch makes simplifying assumptions and “cheats,” including restricting to negative and temporarily assuming a chosen polynomial is irreducible; the missing notation makes some of these conditions unclear. The source reports recent preprints sharpening a bound, but their formulas and full details are absent from the captured text.
Open question
How do Green’s parameter choices produce the stated bound on primes for which the Legendre symbol is a quadratic non-residue?
Source-stated
Tao presents a sketch of Green’s formulation of a proof that excludes Siegel zeroes, distinguishing it from other approaches that establish a stronger quasi-Riemann hypothesis.
there was a third paper in the same release that did not establish the quasi-Riemann hypothesis, but instead excluded Siegel zeroes directly.
Source-stated
The proof uses a lattice built from polynomial evaluations and horizontal derivatives on a grid; Tao says its squared covolume is a non-zero integer.
This quantity will be constructed geometrically, being essentially the covolume of a certain lattice (actually the square of that covolume, to make it an integer).
Source-stated
Tao says the proof combines an Archimedean upper bound with a non-Archimedean lower bound to obtain the desired estimate.
Inserting Lemma 2 and Lemma 3 into (3) and cancelling the common factor of , we obtain (2) as required.
Source-stated
Tao identifies the polynomial method as the parity-breaking input in this proof, contrasting it with an automorphic input in the quasi-Riemann hypothesis papers.
in this case, said input comes from the polynomial method, whereas in the QRH papers, it appears to be some (still poorly understood) automorphic miracle
Source-stated
Tao says Green’s formulation uses multiplicity to achieve a non-trivial bound, unlike previous treatments that required an extension of the grid.
One of the innovations in Green’s treatment is to also take advantage of multiplicity to achieve the non-trivial bound (2);
Source and contributor context
Terence Tao · Publisher
The publisher is identified here. No individual author has been inferred.
Source media
Media was declared by the source, but no asset passed the supported availability checks. Open the original source to view it.
Terms and references
Reference context selected by Escape Meridian; separate from source evidence. Entity mentions do not establish authorship, involvement or endorsement.
Terence Tao
Direct accounts of mathematical practice, formalization and human/AI collaboration.
Editorial provenance
Version 1. Publication ID: 01843319-a483-4e77-8117-b9e1d126fe90.
Prepared by gpt-6-luna; grounding review by gpt-6-luna.
Source check: uncertain by anthropic/claude-opus-5.5 on 2026-11-05T06:48:09.805Z. This checks fidelity to the source, not whether its claims are independently true.
Editorial selection: accept; reasons: material_development.
Observation: 8d3b36d71dd3a85795fd385974962fab1a7d26a990f1004c4f36e460558c876b. Source text hash: c54beb1c260ab816215f898df7af80ef115968b3d80687be515af572fbdb8cfc.
Revision and source-check history
Version 1 · 2026-11-05T06:48:09.805Z
Terence Tao sketches a proof excluding Siegel zeroes
sketches Ben Green’s formulation of a proof that excludes Siegel zeroes, zeros of Dirichlet L-functions implicated in ineffective error bounds for prime-counting results. Tao contrasts this largely algebraic-number-theory argument with other recent approaches based on analysis, which establish a stronger “quasi-Riemann hypothesis.” The proof seeks to bound how often a Legendre symbol is negative at primes in a specified range. Its central construction turns that counting problem into a question about an integer: Tao builds a lattice from polynomials evaluated, along with their horizontal derivatives, on a carefully chosen grid. The lattice’s squared covolume is a non-zero integer, so its prime divisors and its size can be bounded in two different ways. The key move is to use primes for which the grid lies p-adically close to a curve. That closeness gives a lower bound on the covolume’s divisibility by those primes; an Archimedean bound controls its overall size. Together, the bounds yield the desired estimate. Tao says multiplicity is an innovation in Green’s treatment, and identifies the polynomial method as the parity-breaking input that lets this proof avoid classical analytic number theory methods. The captured evidence omits the mathematical formulas, so the precise parameter choices and numerical bounds cannot be assessed here.
Original source
· Article
Source details
Original source date: Oct 19, 2026 (2026-10-19T18:27:19+00:00).
Date basis: Date stated by the publisher.
Added to Escape Meridian: 2026-11-05T06:48:09.805Z. First observed: 2026-10-19T18:35:14.833Z. Retrieved: 2026-10-20T14:01:14.199Z.
Limits
The captured source text omits mathematical notation and displayed equations in many places, including the stated bounds and parameter definitions; the precise estimates cannot be reconstructed from this evidence. Tao says the sketch makes simplifying assumptions and “cheats,” including restricting to negative and temporarily assuming a chosen polynomial is irreducible; the missing notation makes some of these conditions unclear. The source reports recent preprints sharpening a bound, but their formulas and full details are absent from the captured text.
Open question
How do Green’s parameter choices produce the stated bound on primes for which the Legendre symbol is a quadratic non-residue?
Source-stated
Tao presents a sketch of Green’s formulation of a proof that excludes Siegel zeroes, distinguishing it from other approaches that establish a stronger quasi-Riemann hypothesis.
there was a third paper in the same release that did not establish the quasi-Riemann hypothesis, but instead excluded Siegel zeroes directly.
Source-stated
The proof uses a lattice built from polynomial evaluations and horizontal derivatives on a grid; Tao says its squared covolume is a non-zero integer.
This quantity will be constructed geometrically, being essentially the covolume of a certain lattice (actually the square of that covolume, to make it an integer).
Source-stated
Tao says the proof combines an Archimedean upper bound with a non-Archimedean lower bound to obtain the desired estimate.
Inserting Lemma 2 and Lemma 3 into (3) and cancelling the common factor of , we obtain (2) as required.
Source-stated
Tao identifies the polynomial method as the parity-breaking input in this proof, contrasting it with an automorphic input in the quasi-Riemann hypothesis papers.
in this case, said input comes from the polynomial method, whereas in the QRH papers, it appears to be some (still poorly understood) automorphic miracle
Source-stated
Tao says Green’s formulation uses multiplicity to achieve a non-trivial bound, unlike previous treatments that required an extension of the grid.
One of the innovations in Green’s treatment is to also take advantage of multiplicity to achieve the non-trivial bound (2);
Source and contributor context
Terence Tao · Publisher
The publisher is identified here. No individual author has been inferred.
Source media
Media was declared by the source, but no asset passed the supported availability checks. Open the original source to view it.
Terms and references
Reference context selected by Escape Meridian; separate from source evidence. Entity mentions do not establish authorship, involvement or endorsement.
Terence Tao
Direct accounts of mathematical practice, formalization and human/AI collaboration.
Editorial provenance
Version 1. Publication ID: 01843319-a483-4e77-8117-b9e1d126fe90.
Prepared by gpt-6-luna; grounding review by gpt-6-luna.
Source check: uncertain by anthropic/claude-opus-5.5 on 2026-11-05T06:48:09.805Z. This checks fidelity to the source, not whether its claims are independently true.
Editorial selection: accept; reasons: material_development.
Observation: 8d3b36d71dd3a85795fd385974962fab1a7d26a990f1004c4f36e460558c876b. Source text hash: c54beb1c260ab816215f898df7af80ef115968b3d80687be515af572fbdb8cfc.
uncertain · 2026-11-05T06:48:09.805Z · anthropic/claude-opus-5.5
Publication: 01843319-a483-4e77-8117-b9e1d126fe90
attribution — pass: The reading correctly says Terence Tao is sketching Ben Green's formulation of the argument. It also keeps the parity-breaking and multiplicity remarks attributed to Tao.
I would like here to present a sketch of Green’s formulation (with some small notational changes), which I find particularly elegant.
summary — uncertain: The reading leaves out the central AI context. Tao says the original nine-page paper and the quasi-Riemann hypothesis papers came from an OpenAI release, and he discloses using the SAIR open math model. Without that, a general reader cannot see why this matters here. Central terms (Legendre symbol, lattice, covolume, p-adic, Archimedean, parity problem) are also left unexplained for non-specialists. Smallest repair: add the OpenAI origin and Tao's AI disclosure, and add tooltips for these terms.
However, there was a third paper in the same release that did not establish the quasi-Riemann hypothesis, but instead excluded Siegel zeroes directly. This paper was significantly shorter (nine pages)
date — pass: originalPublished (2026-10-19T18:27:19Z, from the publisher page) matches the post's URL date and the feed entry. No earlier first publication is indicated.
support — uncertain: Claim 5 says previous treatments required an 'extension of the grid.' The captured text drops the symbol after 'extension of', so the source does not show what was extended; it may be a ring or field rather than the grid. Smallest repair: say 'a (somewhat artificial) extension' without naming the grid. The other claims are grounded. The question's phrase 'Legendre symbol is a quadratic non-residue' slightly misstates the source, which treats the number as the non-residue, not the symbol.
previous treatments did not do this, and had to work with a (somewhat artificial) extension of , such as , in order to get comparably non-trivial bounds.
media — pass: The selected media is the verified direct link to Tao's original post, which is the most relevant and accessible source.
Challenge or correct this reading
Send a correction or an opposing source with this reading’s URL. Disagreement and uncertainty can remain unresolved.
Direct accounts of mathematical practice, formalization and human/AI collaboration.
Explore Terence TaoDirect accounts of mathematical practice, formalization and human/AI collaboration.
Explore Terence TaoDirect accounts of mathematical practice, formalization and human/AI collaboration.
Explore Terence TaoDirect accounts of mathematical practice, formalization and human/AI collaboration.
Explore Terence TaoDirect accounts of mathematical practice, formalization and human/AI collaboration.
Explore Terence Tao