Update: François Dorais gives one great answer for Question 1! But I still don't have an answer I'm satisfied with (REWRITTEN) There has been some discussion in the comments concerning whether proofs and statements living in the same realm is "utopian". The philosophical idea underlying this question is that, in my opinion, part of mathematics is to understand proofs, including understanding which tools are optimal for Question 2a proof and why. One thing that would make me happy would be If the proof is a result for integers which formal manipulation of definitions used in the statement of the claim (e.g. proof of the snake lemma), then there is "obviously" nothing to explain. If, on the other hand, the proof makes essential use of concepts from beyond the realm of the statement of the theorem (e.g. a projection or restriction proof of some easy fact for a statement about integers which uses real numbers, and is readily understood that or proof of Poincare Duality for simplicial complexes which uses CW complexes) then we ought to understand why. Is there no other way to prove it?Why? Would another way to prove it necessarily be move clumsy? Why? Or is it just an accident of history, but remains mysterious the first thing the prover thought of, with no claim of being an "optimally tooled proof" in any sense? For one think, if a proof of a result involving integers essentially uses properties of the real numbers / (or complex analysis aren't introducednumbers), such a proof would not work in a formal somehow analogous setting where there are no real numbers, such as knots as analogues for primes. For another, by understanding why the tool of the proof is optimal, we're learning something really fundamental about integers.
I'm interested not in "what would be the fastest way to find a first proof", but rather in "what would be the most intuitive way to understand a mathematical phenomenon in hindsight". Note also that the necessary introduction of real numbers in a proof implies So one thing that a parallel result would have no reason to make me happy would be true a result for another context where no analogue integers which is "obviously" a projection or restriction of some easy fact for real numbers exists, say knots as analogues of prime numbers, or something combinatorial, and would not be programmable into a computer. So I think is readily understood that understanding exactly where and why way, but remains mysterious if real numbersare needed in number theory might concievably be more than just an idle question/ complex analysis aren't introduced.
|
3 | added 837 characters in body | ||
|
|
||||
|
2 | added 1062 characters in body | ||
|
Update: François Dorais gives one great answer for Question 1! But I still don't have an answer I'm satisfied with for Question 2. One thing that would make me happy would be a result for integers which is "obviously" a projection or restriction of some easy fact for real numbers, and is readily understood that way, but remains mysterious if real numbers/ complex analysis aren't introduced. I'm interested not in "what would be the fastest way to find a first proof", but rather in "what would be the most intuitive way to understand a mathematical phenomenon in hindsight". Note also that the necessary introduction of real numbers in a proof implies that a parallel result would have no reason to be true for another context where no analogue for real numbers exists, say knots as analogues of prime numbers, or something combinatorial, and would not be programmable into a computer. So I think that understanding exactly where and why real numbers are needed in number theory might concievably be more than just an idle question. |
||||
|
1 |
|
||
What is the high-concept explanation on why real numbers are useful in number theory?The utopian situation in mathematics would be that the statement and the proof of every result would live "in the same world", at the same level of mathematical complexity (in a broad sense), unless there were a good conceptual reason for the contrary. The typical situation would be for a proof in finite combinatorics to be proven purely within the realm of finite combinatorics, a statement about integers to be proven using only the rationals (perhaps together with some formal symbols such as $\sqrt {2}$ and $\sqrt{-1}$), and so on. When the typical situation breaks down, the reason would be well-known and celebrated.
An alternative way of framing the question would be to ask how you would refute the following hypothetical argument: "We know that calculus works well, so we are tempted to apply it to anything and everything. But perhaps it is in fact the wrong tool for Number Theory. Perhaps there exists a rational-number-based approach to Number Theory waiting to be discovered, whose discoverer will win a Fields Medal, which will replace all the analytic tools in Number Theory with dicrete tools." (This question is a byproduct of a discussion we had today at Dror Bar-Natan's LazyKnots seminar.)
|
||||

