Mdthbs

I am pretty distant from anything analytic, including analytic number theory but I decided to read the Wikipedia page on the Riemann hypothesis and there is some pretty interesting stuff there:

Some consequences of the RH are also consequences of its negation, and are thus theorems. In their discussion of the Hecke, Deuring, Mordell, Heilbronn theorem, (Ireland & Rosen 1990, p. 359) say

The method of proof here is truly amazing. If the generalized Riemann hypothesis is true, then the theorem is true. If the generalized Riemann hypothesis is false, then the theorem is true. Thus, the theorem is true!!

What is surprising is that both a statement and its negation are useful for proving the same theorem.

Do similar situations arise with other major, notorious conjectures in mathematics? I only care about algebraic geometry and algebraic number theory for the most part but I guess it will make little sense to have such questions devoted to each area of mathematics so post whatever you've got.

To give an initial direction: are there any interesting statements one can prove assuming both some hard conjecture about motives (e.g. motivic $t$-structure, the standard conjectures, Hodge/Tate conjectures) and its negation?

Every proof by contradiction can be seen as following the template identified in the theorem.

Namely, when we've proved a statement $S$ by contradiction, then $S$ follows from $S$ and also from $neg S$.

I think this is much less surprising today. It's not uncommon to argue that a statement about some structures is true because one can decompose structures into random-like and structured parts ('structure and randomness'), and in either case get to the desired conclusion. Usually one is trying to prove that a certain statement is true for a whole class of structures by this method; there is no one special structure for which we really want to prove it. Take Roth's theorem as an example: we want to prove any positive-density set of integers in $N$ (for some large $N$) contains a three-term AP. We can do this if the set looks random (small Fourier coefficients) easily enough, but if the set does not look random, then there is a large Fourier coefficient, so the set looks structured, namely it has a noticeably larger density on some long AP than on $[N]$. But then we can pass to the AP and iterate this argument.

It just happens that when we try to prove things about the primes, we really only want to know about the one structure, contained in a class of structures with prime-like properties (which might not have more than one member, depending on the properties used in the proof). But the proof method is still to show that the whole class of structures satisfies the desired conclusion.

In this case (G)RH is a statement that the primes behave in some random-like way, in a fairly strong quantitative sense. And so its negation is the assertion of some structure beyond the obvious - which of course can be useful.

Of course, if you want to find other examples of theorems which you can prove by appealing to some major open problem being either true or false, you should probably have some reason why either outcome helps. Quite a few major open problems (or major theorems) can be read as some kind of quasirandomness statement, and for that there is a reason why the conjecture failing might be useful, so in principle there should be a decent list of possible candidates.

This paper proves the existence of an essentially-deterministic algorithm for the following problem:

Input: an integer $n$

Output: An $n$-bit prime.

Which runs in time polynomial in $n$.

On a high level the argument works as follows:

1. Suppose a certain kind of pseudo-random generator exists. Then we can derive an algorithm to compute the above.


2. Suppose that kind of pseudo-random generator does not exist. Then we have a collapse of complexity classes $mathsf{PSPACE} = mathsf{ZPP}$ which then implies some circuit lower bounds, which in turn yields a pseduo-random generator with the desired properties.