Metraipolis › archive › dc_8ff42be96861

Mathematical induction — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Mathematical_induction
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T00:55:07.004Z
SHA-256 of the archived text
08a83c66e877fe032b63ee2b0d1e21ab446f9bbbc48c8caf33bdc51e899f86b3
Stable URL of this page
https://metraipolis.com/documento/dc_8ff42be96861

How to cite

Mathematical induction — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Mathematical_induction (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_8ff42be96861 (Metraipolis archive dc_8ff42be96861, sha256 08a83c66e877fe032b63ee2b0d1e21ab446f9bbbc48c8caf33bdc51e899f86b3)
BibTeX
@misc{dc8ff42be96861,
  title = {Mathematical induction — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Mathematical_induction},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_8ff42be96861; sha256 08a83c66e877fe032b63ee2b0d1e21ab446f9bbbc48c8caf33bdc51e899f86b3},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Mathematical_induction. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Mathematical induction is a method for proving that a statement P ( n ) {\displaystyle P(n)} is true for every natural number n {\displaystyle n} , that is, that the infinitely many cases P ( 0 ) , P ( 1 ) , P ( 2 ) , P ( 3 ) , … {\displaystyle P(0),P(1),P(2),P(3),\dots } all hold. This is done by first proving a simple case, then also showing that if we assume the claim is true for a given case, then the next case is also true. 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. The first, the base case, proves the statement for n = 0 {\displaystyle n=0} without assuming any knowledge of other cases. The second case, the induction step, proves that if the statement holds for any given case n = k {\displaystyle n=k} , then it must also hold for the next case n = k + 1 {\displaystyle n=k+1} . These two steps establish that the statement holds for every natural number n {\displaystyle n} . The base case does not necessarily begin with n = 0 {\displaystyle n=0} , but often with n = 1 {\displaystyle n=1} , and possibly with any fixed natural number n = N {\displaystyle n=N} , establishing the truth of the statement for all natural numbers n ≥ N {\displaystyle n\geq N} . The method can be extended to prove statements about more general well-founded structures, such as trees; this generalization, known as structural induction, is used in mathematical logic and computer science. Mathematical induction in this extended sense is closely related to recursion. Mathematical induction is an inference rule used in formal proofs, and is the foundation of most correctness proofs for computer programs. Despite its name, mathematical induction differs fundamentally from inductive reasoning as used in philosophy, in which the examination of many cases results in a probable conclusion. The mathematical method examines infinitely many cases to prove a general statement, but it does so by a finite chain of deductive reasoning involving the variable n {\displaystyle n} , which can take infinitely many values. The result is a rigorous proof of the statement, not an assertion of its probability.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «zero-knowledge proof»).
Fonte: Wikipedia in inglese, voce «Mathematical induction» — https://en.wikipedia.org/wiki/Mathematical_induction
Wikidata Q178377 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q178377
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Mathematical_induction?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1373903526, consultata il 2026-10-06T00:12:49.907Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: f508d39f00322faccb4da819b4a693472dfddde6ddf104c054cba13718322c63