Provability and numerical experiments

A tempting view of mathematics is that mathematicians are discovering not facts about what is true, but about what is provable from what.

But proof is not the only way mathematicians have of getting at truth. Numerical experiment is another. For instance, while we don’t have a proof of Goldbach’s Conjecture (each even number bigger than two is the sum of two primes), it has been checked to hold for numbers up to 4 ⋅ 10¹⁸. This seems to give significant inductive evidence that Goldbach’s Conjecture is true. But it does not seem to give significant evidence that Goldbach’s Conjecture can be proved.

Here’s why. Admittedly, when we learned that that the conjecture holds for some particular number n, say 13, we also learned that the conjecture can be proved for that specific number n (e.g., 13 = 11 + 2 and 11 and 2 are prime, etc.). Inductively, then, this gives us significant evidence that for each particular number n, Goldbach’s conjecture for n is provable (to simplify notation, stipulate Goldbach’s Conjecture to hold trivially for odd n or n < 4). But one cannot move from ∀n Provable(G(n)) to Provable(∀n G(n)) (to abuse notation a little).

The issue is that the inductive evidence we have gathered strongly supports the claim that Goldbach’s Conjecture is true, but gives much less evidence for the further claim that Goldbach’s Conjecture is provable.

The argument above is a parallel to the standard argument in the philosophy of science that the success of the practice of induction is best explained by scientific realism.