I think talking about proofs in terms of probabilities is a category error; logical proof is analogous to computable functions (equivalent if you are a constructivist), while probabilities are about bets.
I agree that logical/mathematical proofs are more analogous to functions than probabilities, but they don’t have to be only computable functions, even if it’s all we will ever access, and that actually matters, especially in non-constructive math and proofs.
I also realized why probability 0 and 1 aren’t enough for proof, or equivalently why Abram Demski’s observation that a proof is stronger than an infinite number of observations is correct.
And it essentially boils down to the fact that in infinite sets, there are certain scenarios where the probability of an outcome is 0, but it’s still possible to get that outcome, or equivalently the probability is 1, but that doesn’t mean that it doesn’t have counterexamples. The best example is throwing a dart at a diagonal corner has probability 0, yet it still can happen. This doesn’t happen in finite sets, because a probability of 0 or 1 implicitly means that you have all your sample points, and for probability 0 means that it’s impossible to do, because you have no counterexamples, and for probability 1 you have a certainty proof, because you have no counterexamples. Mathematical conjectures and proofs usually demand something stronger than that of probability in infinite sets: A property of a set can’t hold at all, and there are no members of a set where that property holds, or a property of a set always holds, and the set of counterexamples is empty.
(Sometimes mathematics conjectures that something must exist, but this doesn’t change the answer to why probability!=proof in math, or why probability!=possibility in infinite sets.)
Unfortunately, infinite sets are the rule, not the exception in mathematics, and this is still true of even uncomputably large sets, like the arithmetical hierarchy of halting oracles. Finite sets are rare in mathematics, especially for proof and conjecture purposes.
I agree that logical/mathematical proofs are more analogous to functions than probabilities, but they don’t have to be only computable functions, even if it’s all we will ever access, and that actually matters, especially in non-constructive math and proofs.
I also realized why probability 0 and 1 aren’t enough for proof, or equivalently why Abram Demski’s observation that a proof is stronger than an infinite number of observations is correct.
And it essentially boils down to the fact that in infinite sets, there are certain scenarios where the probability of an outcome is 0, but it’s still possible to get that outcome, or equivalently the probability is 1, but that doesn’t mean that it doesn’t have counterexamples. The best example is throwing a dart at a diagonal corner has probability 0, yet it still can happen. This doesn’t happen in finite sets, because a probability of 0 or 1 implicitly means that you have all your sample points, and for probability 0 means that it’s impossible to do, because you have no counterexamples, and for probability 1 you have a certainty proof, because you have no counterexamples. Mathematical conjectures and proofs usually demand something stronger than that of probability in infinite sets: A property of a set can’t hold at all, and there are no members of a set where that property holds, or a property of a set always holds, and the set of counterexamples is empty.
(Sometimes mathematics conjectures that something must exist, but this doesn’t change the answer to why probability!=proof in math, or why probability!=possibility in infinite sets.)
Unfortunately, infinite sets are the rule, not the exception in mathematics, and this is still true of even uncomputably large sets, like the arithmetical hierarchy of halting oracles. Finite sets are rare in mathematics, especially for proof and conjecture purposes.
Here’s a link on where I got the insight from:
https://en.wikipedia.org/wiki/Almost_surely