Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Proofs by Induction: Principles and Examples

Description

This lecture covers the induction principle and the structure of proofs by induction, explaining how to prove properties for natural numbers using mathematical induction. It includes examples such as proving propositions like 1 + 3 + 5 + ... + (2n-1) = n² by induction on n.

Official source

Related concepts (25)

Mathematical proof

A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning which establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning which establish "reasonable expectation".

Mathematical induction

Mathematical induction is a method for proving that a statement is true for every natural number , that is, that the infinitely many cases all hold. Informal metaphors help to explain this technique, such as falling dominoes or climbing a ladder: Mathematical induction proves that we can climb as high as we like on a ladder, by proving that we can climb onto the bottom rung (the basis) and that from each rung we can climb up to the next one (the step). A proof by induction consists of two cases.

Transfinite induction

Transfinite induction is an extension of mathematical induction to well-ordered sets, for example to sets of ordinal numbers or cardinal numbers. Its correctness is a theorem of ZFC. Let be a property defined for all ordinals . Suppose that whenever is true for all , then is also true. Then transfinite induction tells us that is true for all ordinals. Usually the proof is broken down into three cases: Zero case: Prove that is true. Successor case: Prove that for any successor ordinal , follows from (and, if necessary, for all ).

Structural induction

Structural induction is a proof method that is used in mathematical logic (e.g., in the proof of Łoś' theorem), computer science, graph theory, and some other mathematical fields. It is a generalization of mathematical induction over natural numbers and can be further generalized to arbitrary Noetherian induction. Structural recursion is a recursion method bearing the same relationship to structural induction as ordinary recursion bears to ordinary mathematical induction.

Proofs and Refutations

Proofs and Refutations: The Logic of Mathematical Discovery is a 1976 book by philosopher Imre Lakatos expounding his view of the progress of mathematics. The book is written as a series of Socratic dialogues involving a group of students who debate the proof of the Euler characteristic defined for the polyhedron. A central theme is that definitions are not carved in stone, but often have to be patched up in the light of later insights, in particular failed proofs. This gives mathematics a somewhat experimental flavour.

Related lectures (27)

Cartesian Product and Induction

Introduces Cartesian product and induction for proofs using integers and sets.

Recurrence: Induction

Covers the principle of induction for natural numbers and the importance of caution in its application.

Recursion and Induction: Understanding Mathematical Proofs

Explores recursion and induction for mathematical proofs through recursive algorithms and functions.

Mathematical Recursion: Induction and Recursion

Explains mathematical induction for proving propositions true for all positive integers.

Mathematical Induction: Principle and Example MOOC: Analysis I (part 1): Prelude, basic concepts, real numbers MOOC: Analysis I