8

There are a number of theorems which have a multitude of proofs, yet all the proofs seem to ultimately rely on the same fundamental ideas. For example, I ran into this blog post recently where Terrence Tao notes that the Brouwer fixed point theorem is of this character. To quote:

"This theorem has many proofs, most of which revolve (either explicitly or implicitly) around the notion of the degree of a continuous map $f: S^{n-1} \rightarrow S^{n-1}$ of the unit sphere..."

(There are a lot of theorems of algebraic topology which seem to go this way: There are many ways to prove something using algebraic topology, but you can't seem to prove it without the algebraic topology.)

(Another example is complex analysis: There are some integrals that can be evaluated using a variety of contours, but to evaluate them with purely real methods is very difficult.)

On the other hand, there are some theorems which seem to have many proofs which are very profoundly different. A former professor of mine commented that the fundamental theorem of algebra was of this sort. He wondered whether there was any sense in which the many proofs were "the same" via some sort of "homotopy of proofs".

My question is whether there is any sense in which these informal observations can be made precise:

  • Is there a meaningful sense in which a proof must use a certain idea?
  • Are there meaningful ways of saying that two proofs are "essentially the same" or "essentially different"?

I am aware that there is at least one affirmative answer to this question: Many theorems can be proven to rely on the axiom of choice. Perhaps there is some similar way to differentiate other kinds of proofs? I.e. if you can find a reduced set of axioms such that one proof makes sense but the other doesn't, then you can say that the proofs are essentially different. I'm well beyond my sphere of knowledge here, but hopefully my idea is sufficiently clear.

EDIT: After posting this, I found this question on mathoverflow, which pretty much answers the question. I'm still curious about the specific examples I mentioned above (Brouwer fixed point theorem, contour integrals, etc.), so commentary about those would be welcome.

Yly
  • 15,292
  • There are a few questions here and at mathoverflow around this basic idea; as a starting point, you might be interested in reverse mathematics. – Noah Schweber Dec 29 '17 at 17:11
  • A recent related question here is https://math.stackexchange.com/questions/2571760/can-one-prove-that-there-is-only-one-proof/2574440#2574440. – Rob Arthan Dec 29 '17 at 18:51
  • "2 different proofs" is evidence of redundancy in your axioms. For this question to be meaningful you have to stipulate some sense in which the foundational axiom set can't be weakened. Also, one very limited sense of "unique" proof is normalization in natural deduction. – DanielV Dec 30 '17 at 05:43
  • @DanielV That's not true. The different proofs may use the same axioms in different ways. Similarly, just because one axiom may be used instead of another in one particular case doesn't mean that the latter is unnecessary in all cases. E.g. from the axiom set ${\varphi,\psi}$ there are two obvious proofs of $\varphi\vee\psi$, but there is no redundancy. – Noah Schweber Dec 31 '17 at 18:17
  • @NoahSchweber Redundancy in axioms doesn't necessarily mean one of them can be removed, just that one of them can be weakened. Like if PA had $(\lnot \exists ~Sx = y) \iff y = 0$ has a redundancy in it, $\lnot \exists x ~ x = y) \to y = 0$ can derived from the other axioms. Using the first form as an axiom instead of the second introduces multiple proofs for similar ideas. I did mean "evidence of" not "guarantee of". Your example is interesting, since there is only 1 normalized constructive proof of each of the 2 constructive interpretations of that claim (which variable is constructable). – DanielV Jan 01 '18 at 01:32
  • @NoahSchweber I guess short version, I'm not trying to say that all multiple proofs come from axiomatic redundancies, but some do, so if you want to define the concept of "redundant proof", as a preliminary you have to handle the matters like redundancy among axioms, so if someone posts an example of "multiple proofs of the same thing", it isn't necessarily a result of the proof technique itself. – DanielV Jan 01 '18 at 01:56

3 Answers3

2

This could be treated as a very long comment and not neccessarily as a pure answer!

Well, as far as proofs are concerned, in logic there is a notion of deduction which's formal definition has as follows:

Deduction: Let $\phi$ be a theorem of a set $\Gamma$. Then a deduction of $\phi$ from $\Gamma$ is a finite sequences of logical types $\langle a_1,\dots,a_n\rangle$such that $a_n=\phi$ and for every $k\leq n$ either:

  1. $a_k$ belongs to $\Gamma\cup\mathrm{A}$ or
  2. $a_k$ can be deducted from some previous types $a_i,a_j$, $i,j<k$ with one of the rules of inference (e.g. modus ponens).

where $\mathrm{A}$ is a set of logical Axioms we have predefined.

Now, let us suppose that we have a theorem $\phi$ and two deductions ("proofs") of it, let $D_1=\langle a_1,\dots,a_n\rangle$ and $D_2=\langle b_1,\dots,b_m\rangle$. Then, we could possibly say that these two proofs are essentially different iff $$\boxed{a_i\neq b_j\text{ for every $a_i,b_j\in\Gamma$ with $i=1,2,\dots,n$ and $j=1,2,\dots,m$}}$$ In that way, two proofs that do not use the same theorems to prove theorem $\phi$ may be considered essentially different.

However, there could be more efficient ways of defining essential difference of proofs I can't think of right now...

Hope this added something useful! :)

  • 4
    Unfortunately, your idea isn't stable under logical perturbations of a proof that we would consider inessential. E.g., take some completely unrelated theorem $\psi$ and take $b_k = a_k \land \psi$, then you can you can combine (1) your proof of $\phi$, (2) a proof of $\psi$ and (3) a final step that concludes $\phi$ from $\phi \land \psi$ to get a new proof of $\phi$ that has no intermediate theorems in common with the original proof. You would need some notion of a normal form for a proof, and that is a subtle problem. – Rob Arthan Dec 29 '17 at 19:00
  • I get your idea however doesn't this proof you showed have all the part from the initial proof of $\phi$ in common with the initial proof of $\phi$? – Vassilis Markos Dec 29 '17 at 19:23
  • 1
    No, in all the places where the original proof had $a_k$, the new proof would have $a_k \land \psi$. This is all somewhat dependent on exactly how you formalise proofs. For one approach to defining normal forms for proofs, google for "normalization in natural deduction". – Rob Arthan Dec 29 '17 at 21:09
  • Oh, I get it! Nice point! :) – Vassilis Markos Dec 29 '17 at 21:34
2

This is a deep question. In practice, my criterion for when two proofs are "essentially the same" or not is whether they generalize in the same way. For example, in this blog post I give five proofs that the Euler characteristic of a closed orientable surface is even, which I would argue are all different because they generalize differently (actually that was the motivation for writing the post):

  1. Proof 1 uses Poincare duality to show that the Euler characteristic of a closed orientable manifold which is a boundary is even.
  2. Proof 2 uses Poincare duality, but in a different way, to show that the middle Betti number of a closed orientable manifold of dimension $2 \bmod 4$ is even. Unlike Proof 1, it uses the fact that in dimension $2 \bmod 4$ Poincare duality gives the middle cohomology a symplectic structure.
  3. Proof 3 uses characteristic classes to show that the Stiefel-Whitney class $w_2$ vanishes. This is yet another application of Poincare duality. Essentially the same computation shows that $w_2$ also vanishes on closed orientable $3$-manifolds, which is no longer a statement about their Euler characteristic.
  4. Proof 4 uses the fact that closed orientable surfaces admit complex structures making them compact Kahler manifolds whose cohomologies admit Hodge decompositions. This is a genuinely different proof from the others since on the one hand it only generalizes to other compact Kahler manifolds and on the other hand it proves a stronger statement about them (that all of their odd Betti numbers are even).
  5. Proof 5 again uses the fact that closed orientable surfaces admit complex structures, and applies the Hirzebruch-Riemann-Roch theorem. This is again a characteristic class computation as in Proof 3, but applied to Chern classes rather than Stiefel-Whitney classes. In the next complex dimension this argument generalizes to Noether's formula, which none of the other proofs can touch.

Of course the "zeroth proof" is just computing the Betti numbers and seeing that they are equal to $1, 2g, 1$, but the question is whether there was an a priori reason the middle Betti number had to end up being even. Each proof gives a different reason (I would argue), although they're certainly related.

Qiaochu Yuan
  • 419,620
  • On the other hand there are some theorems which really appear to be "tight" in that they are not obviously just special cases of more general theorems - all of the hypotheses are really necessary and dropping any of them makes the theorem blatantly false. In that case it's more likely that all proofs follow more or less the same course. But that's not a guarantee. – Qiaochu Yuan Dec 30 '17 at 00:59
1

As Qiaochu Yuan says at the beginning of his response, this is a deep question -- he then gives a very sophisticated set of examples where we have interestingly different proofs motivated by rather different ideas (which generalize differently).

It might help though also to have some much simpler examples of the same phenomenon (for the conceptual issues about sameness/difference/equivalence of proof-ideas arise even in simple cases). And the simplest interesting example I know is the case of different proofs that there are an infinite number of primes.

In the first chapter of their famous, wonderfully accessible, Proofs from the Book, Aigner and Ziegler offer no less than six proofs of this classical result, starting with Euclid's and including later proofs using analysis or topology. I can't improve on their exposition here, and it's just four pages. Look it up: a lovely example to think about -- especially as, in this case, it certainly doesn't seem that "all the proofs seem to ultimately rely on the same fundamental ideas", even on reflection.

Peter Smith
  • 54,743