Lecture Notes: Understanding Proofs

Introduction to Proofs

• Definition: A proof is a method for ascertaining truth, typically involving a series of logical statements derived from assumptions or axioms.
• Types of Proofs:
  • Mathematical proofs, which rely on logical deductions from axioms.
  • Broader notion of proof across various fields.

Methods of Ascertaining Truth

• Observation and Experimentation: Fundamental in physics (e.g., observing gravity).
• Establishing Falsehood:
  • Identifying counterexamples can help narrow down what is true.
• Legal Truths: Established by juries and judges.
• Religious Truths: Often based on interpretations of divine messages.
• Authority Figures: Often dictate perceived truths (e.g., teachers, bosses).

Components of Mathematical Proofs

• Propositions: Statements that can be true or false.
  • Example: "2 + 3 = 5" (true).
  • Example: "For all n in natural numbers, n² + n + 41 is a prime" (to be checked).
• Predicate: A proposition dependent on a variable (e.g., n in the previous example).
• Quantifiers:
  • "For all" (universal quantifier) and
  • "There exists" (existential quantifier).

Validating Propositions

• Testing Values: Check various values to determine if a proposition holds true.
  • Example: n² + n + 41 for n = 0 to 40.
  • Counterexample found at n = 40 (1681 = 41²).

Famous Mathematical Statements

• Euler's Conjecture: a⁴ + b⁴ + c⁴ = d⁴ has no positive integer solutions (was disproven).
• Goldbach's Conjecture: All even integers greater than 2 can be expressed as the sum of two primes (still unproven).
• Four Color Theorem: Every map can be colored using four colors without adjacent regions sharing colors (proved using a computer).
• Riemann Hypothesis: Conjecture regarding the distribution of prime numbers (still unproven).
• Poincaré Conjecture: Proven by Grigor Perelman; relates to the topological equivalency of 3D objects without holes.

Axioms in Mathematics

• Definition: Axioms are propositions assumed to be true without proof.
• Examples:
  • Transitive property (if a = b and b = c, then a = c).
• Consistency and Completeness:
  • Consistency: No proposition can be both true and false.
  • Completeness: A set of axioms should be able to prove every proposition true or false.
• Gödel's Incompleteness Theorems: Showed that no consistent system of axioms can be complete, implying that some truths cannot be proven.

Conclusion

• Understanding proofs, propositions, and axioms are critical in mathematics and logic.
• The exploration of mathematical truths and their proofs is ongoing and complex.