Sign inSign in
ConceptMathematics

Proof by contradiction

A proof technique where one assumes the negation of the statement to be proven and derives a logical contradiction.
as Casey Rodriguez defines itMITThe wording closest to all 24 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

11

Each in their own terms, from the easiest level.

  • Vicky Neale

    University of Oxford · Introductory

    A proof technique that assumes the negation of a statement and shows that this assumption leads to a logical contradiction.
    • 13:03Constructing Statements and Proofs
    • 41:41Natural Numbers and Induction
    • 1:06:33Binary Relations, Partitions & Equivalence Relations
    • 23:48Functions, Injections, Surjections, Bijections & Inverses
  • Emily Riehl

    Perimeter Institute · Introductory

    A proof strategy where you assume the opposite of what you want to show, find a contradiction, and conclude the original statement must be true.
    • 26:27A Solution to the Stable Marriage Problem
  • Bernhard Boser & Gireeja Ranade

    UC Berkeley · Undergraduate

    A proof strategy where you assume the negation of what you want to prove to show it leads to a contradiction.
    • 21:50Operational Amplifiers and Negative Feedback
    • 1:09:32Introduction to Circuit Elements and KCL/KVL
    • 53:32Linear Independence, Span, and Null Spaces
    • 10:07Nodal Analysis and Resistive Networks
  • Casey Rodriguez

    MIT · Undergraduate

    A proof technique where one assumes the negation of the statement to be proven and derives a false statement to show the assumption is impossible.
    • 44:46Sets, Set Operations and Mathematical Induction
    • 13:51The Characterization of the Real Numbers
  • Francis Su

    Harvey Mudd College · Undergraduate

    A proof technique where one assumes the negation of the statement to be proven and derives a contradiction.
    • 55:41Properties of Q
    • 11:28Principle of Induction
    • 8:11Compactness and the Heine-Borel Theorem
  • Tom Leighton

    MIT · Undergraduate

    An indirect proof method where one assumes the opposite of what is to be proved and derives a falsehood or contradiction.
    • 1:52Mathematical Induction
    • 50:05Matching Problems
  • Ankur Moitra

    MIT · Undergraduate

    A proof technique where we assume the negation of what we want to prove and derive a contradiction.
  • Michael Sipser

    MIT · Undergraduate

    A proof technique where you assume the opposite of what you want to prove and show that this assumption leads to a logical impossibility.
    • 51:32Regular Pumping Lemma, Conversion of FA to Regular Expressions
    • 33:40CF Pumping Lemma, Turing Machines
  • Brian Yu

    Harvard University · Undergraduate

    A technique of proving a statement by assuming its negation and showing that it leads to a contradiction.
    • 3:22:51Harvard CS50’s Artificial Intelligence with Python – Full University Course
  • Marten van Dijk

    MIT · Undergraduate

    A proof technique where we assume the negation of the statement to be proved and show that it leads to a contradiction, thereby proving the original statement.
  • Alan Guth

    MIT · Undergraduate

    A logical technique where one assumes the negation of a statement and shows that it leads to a logical impossibility.
    • 34:15Introduction to Non-Euclidean Spaces

Lectures that assume it

9

Connections

42

The lectures that define it or assume it, and the concepts next to it.

Concepts9

Show 3 more

Lectures33

Show 27 more

11 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.