Proving 1+1=2: A Rigorous Foundation of Mathematics

Added:

Wittgenstein’s Critique of Formal Foundations

While formal systems like the Peano axioms or Russell and Whitehead's 'Principia Mathematica' attempt to rigorously prove 1+1=2, critics like Ludwig Wittgenstein argue that such proofs are fundamentally redundant. This perspective suggests that our certainty in basic arithmetic does not rely on complex logical foundations; rather, the formal systems themselves are only validated because they successfully align with our pre-existing, intuitive grasp of 1+1=2. If a formal proof concluded that 1+1=3, we would discard the proof's axioms, not the arithmetic. Therefore, formal proofs do not establish the truth of arithmetic but instead serve as complex language games that reconstruct what is already practically and empirically self-evident.

Basic mathematical logic, including propositional calculus, logical connectives, and the general structure of mathematical proofs.
The conceptual distinction between an axiom (an assumed starting truth) and a theorem (a proven statement).
An intuitive, school-level understanding of addition and the set of natural numbers.
Fundamental concepts of naive set theory, such as sets, elements, subset relations, and the empty set.
The recursive definition of addition and multiplication for all natural numbers using the successor function.
The algebraic construction of larger number systems, including integers, rational numbers, and real numbers, starting from the natural numbers.
Zermelo-Fraenkel Set Theory (ZFC) and how Peano arithmetic is formally modeled within standard set theory.
Gödel's Incompleteness Theorems, which explore the logical limitations of formal systems like Peano arithmetic.
An introduction to interactive theorem provers and proof assistants, such as Lean or Coq, to write computer-verified mathematical proofs.
1.1M views36Klikes12:16@CannedMathsOriginal Release: 2021-08-22

The equation 1+1=2 can be formally proven using the Peano Axioms, which define natural numbers through five fundamental properties: (1) Zero exists, (2) Every number has a unique successor, (3) No number has zero as its successor, (4) Different numbers have different successors, and (5) If zero has a property and every number with that property has its successor also having it, then all natural numbers have that property. Addition is defined recursively where a+0=a and a+s(b)=s(a+b). By defining 1 as the successor of 0 and 2 as the successor of 1, we prove 1+1=2 by rewriting it as s(0)+s(0) = s(s(0)) = 2.