| ▲ | thaumasiotes 5 hours ago | |
But that's 100% wrong. If it was easy to prove surprising theorems from an assumption of the Riemann hypothesis, it would also be easy to disprove the Riemann hypothesis. | ||
| ▲ | Jweb_Guru 4 hours ago | parent | next [-] | |
To borrow the usual quote about ingenious fools, the trouble with "easily" disproving that False is in your context is that there are such ingenious proofs of False. One can appear to be doing very substantial and sophisticated mathematics, encountering many obstacles along the way that look identical to what you'd face if you were relying on something true, only to realize much later that one of your hypotheses is uninhabited. The concern was that were the Riemann Hypothesis false, a very, very large subset of modern mathematics might fall into this category. | ||
| ▲ | xrisk 5 hours ago | parent | prev [-] | |
not at all. we can prove a lot of things using P != NP, but that doesn’t make a proof or disproof of that statement easy | ||