4 ms·
I've seen a paper[1] that claims RH, as stated, is undecideable, and then proposes to prove that an analytic continuation of it has the property required. The i
by ncmncm 8y ago
I've seen a paper[1] that claims RH, as stated, is undecideable, and then proposes to prove that an analytic continuation of it has the property required. The idea seems to be that you can choose your continuation to have or not have the property.
It's not clear to me what could be undecideable about the original proposition; either the continuation matches at the points in question, or it doesn't, and if it doesn't, how is it a continuation?
Enlightenment welcome.
[1] http://phys.lsu.edu/~fmoxley/r1.pdf http://phys.lsu.edu/~fmoxley/r1.pdf
- pmiller2 8y agoNot having read the paper, I’m skeptical, both because of the author’s relative lack of credentials (he’s a physicist with all of 5 publications, from what I can see), and because the core idea seems too simple. However, the paper is clearly a serious attempt by someone inside academia who works in quantum computing, which is a related and heavily mathematical field. You may have just given me a few hours of weekend reading material. :)
- soVeryTired 8y agoI've been following the development of the Bender-Brody-Muller approach to the Riemann hypothesis because I knew one of the authors in a previous life. I don't think it's taken that seriously by number theorists [0][1]. The paper was written by physicists, who sometimes play a little fast and loose with mathematical rigour. Maybe this line of argument fixes the flaws in the original BBM paper in some way - I'm not qualified to comment - but I sort of doubt it. [0] https://arxiv.org/abs/1704.02644 https://arxiv.org/abs/1704.02644 [1] https://math.stackexchange.com/questions/2211278/riemann-hypothesis-is-bender-brody-m%C3%BCller-hamiltonian-a-new-line-of-attack https://math.stackexchange.com/questions/2211278/riemann-hyp...
- throwawaymath 8y agoI'm not familiar with that particular paper, but I'm aware of a similar line of attack from a decade or so ago. Off the top of my head I can tell you that we know Riemann is provably false if it is false[1]. I'm not aware of any comparable result for the affirmative, but personally I'm a bit skeptical of the undecidability argument. That being said, it would be kind of narratively satisfying if Riemann is undecidable. There are many novel theorems from the past two decades which are conditionally true assuming Riemann is true. Riemann itself has become a useful technique for conditionally proving new theorem. If Riemann is undecidable, it would imply a great deal of mathematics has been developed which compartmentalizes the undecidability of other theorems. ______________________ 1. https://mathoverflow.net/questions/79685/can-the-riemann-hypothesis-be-undecidable https://mathoverflow.net/questions/79685/can-the-riemann-hyp...