What does mathematicians say of this proof, right or wrong?
closed as off topic by Aryabhata, Jonas Meyer, Byron Schmuland, Chris Eagle, Eric Naslund Jun 3 '11 at 21:15
Questions on Mathematics Stack Exchange are expected to relate to math within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here.If this question can be reworded to fit the rules in the help center, please edit the question.
Here's a short summary of "what it all boils down to".
Let $k$ be some arbitrary integer. Define a sequence by iterating the mapping $k \mapsto (3k+1)/2$ until you hit an even number. For example, the sequence for $7$ is $$ 7, 11, 17, 26. $$ Denote the even number which terminates the sequence by $F(k)$. So $F(7) = 26$.
We now define a directed graph on all integers $\geq 3$. An edge $j \rightarrow j"$ exists if the sequence for $j"$ contains $F(j)/2$.
For example, we always have $2j \rightarrow j$ and $j \rightarrow F(j)/2$.
Opfer reduces the Collatz conjecture to showing that the vertex $4$ is reachable from any vertex $n \geq 3$. The proof of this fact can be found on page 11.
Note: I obtained this summary by "diagram chasing" across the paper. It's not presented in exactly that way.
Update: On June 17th, 2011 Opfer's pre-print available here has been updated with this comment:
|show 1 more comment|
I don't know whether the paper is right, but it sure looks like a legitimate math paper, and seems to represent the culmination of decades of work by various mathematicians. The author is a reputable mathematician at a major university, and the math genealogy page indicates that he was originally a student of Lothar Collatz.
Apparently the preprint has been submitted to Mathematics of Computation, so it will now undergo the formal peer review process. It is much too early to tell how this will turn out.
protected by Qiaochu Yuan Jun 3 '11 at 17:07
This question is protected to prevent "thanks!", "me too!", or spam answers by new users. To answer it, you must have earned at least 10 reputation on this site.