The Timpson Lyceum · Discrete Math (2025)

Introduction to Discrete Mathematics – Lecture 0 (Discrete Math)

Overview

This opening lecture sets the agenda for discrete mathematics: above all, learning to prove things rigorously. The course is also a survey, sampling several fields of mathematics and the "discrete structures" (finite sets, or infinite sets no larger than the rationals) that give the subject its name. The central theme is what it means to know something with certainty, and how that certainty comes from deductive reasoning. We contrast deduction with two weaker forms of inference — inductive and abductive reasoning — and see why only deduction yields mathematical truth. By the end you should understand that a proof is a valid deductive argument, and that mathematical truth is about the logical relationship between statements, not about facts of the physical world.

Key Concepts

• Discrete mathematics — the study of discrete structures: finite sets, or infinite sets that are no "bigger" than the rational numbers (e.g. the set $\{\text{square}, \text{triangle}, \text{circle}\}$, or $\mathbb{Q}$ and its subsets). The course doubles as an introduction to proof and a survey across multiple branches of math.

• Rigorous definitions — in this course every object is given a precise definition. Pointing at an example is not a definition: a teddy bear is not the definition of "animal," and writing four tally marks is not the definition of the number four. Knowing a fact means being able to state exactly what its terms mean.

• Knowing with certainty (capital-T Truth) — the only thing we can know for certain is the conclusion of a valid deductive argument. Mathematics does not tell us facts about the physical universe; it tells us how facts relate.

The three types of reasoning

• Deductive reasoning — argues from general premises to a guaranteed conclusion. If the premises are true, the conclusion must be true. Classic form:

  • If all men are mortal, and Socrates is a man, then Socrates is mortal.
  • The key subtlety: we are not asserting any premise is true. We assert only the whole conditional "if (premises) then (conclusion)." That conditional is true regardless of the actual content of the terms.

• Validity vs. truth of premises — a deduction's correctness depends only on its form, not on the meaning of its terms. Replace the words with symbols and the argument still holds:

  • If all $A$ are $B$, and $c$ is an $A$, then $c$ is a $B$.
  • This is true whether $A,B,c$ stand for men, cats, or nothing meaningful at all. This form is exactly what a proof is.

• Inductive reasoning — generalizes from many particular observations: it has happened repeatedly, so it will happen again. This is how the premise "all men are mortal" would be established (observe many people, each eventually dies). Crucially, induction can never deliver capital-T certainty — no number of confirming cases, even infinitely many, guarantees a universal claim.

  • Counterexample: listing primes $3, 5, 7, 11, 13, \dots$ gives infinitely many odd primes, which might tempt the generalization "every prime is odd." But $2$ is prime and even. A single overlooked case destroys the generalization. Induction is the engine of the sciences, not of mathematical proof.

• Abductive reasoning — the counterpart of induction: instead of building a generalization from instances, you use your existing generalizations to reconstruct the most plausible explanation of a single observed event ("inference to the best explanation").

  • Example: you feel a drop on your hand. It's raining — but the sky is cloudless (and you "know" rain needs clouds), so you reconsider. A sprinkler? Too far away. A drop carried by wind? Your friend Pete just said a word with a "P" and spits when he talks — likely that. You reasoned backward from generalizations to the best explanation of one event.

• Why math uses deduction — mathematics cannot establish facts about the universe (that requires the inductive/scientific method). What it can establish, with certainty, is that if certain statements hold, then others must follow. Proofs are valid deductions; constructing them is the work of this course.

Worked Example

The simplest possible proof is a single valid deductive inference. State the general form first, then instantiate it.

The conclusion is forced purely by the form of the argument. We never claimed the premises are true; we claimed only that the conditional "if premises then conclusion" is true — and it is, no matter what $A$, $B$, and $c$ denote. Swapping in "all cats are mammals; Toby is a cat; therefore Toby is a mammal" reuses the identical valid form. That guaranteed transfer of truth from premises to conclusion is exactly what a proof captures.

Summary

• Discrete math studies discrete structures (finite sets, or infinite sets no larger than the rationals) and, above all, teaches you to prove.
• To know something with certainty means to have it as the conclusion of a valid deductive argument.
• Deduction guarantees the conclusion if the premises hold; its correctness depends on form alone, so symbols can replace the terms without affecting validity.
• Induction generalizes from many cases and powers the sciences, but never yields certainty — one counterexample (e.g. $2$ being an even prime) can overturn infinitely many confirming cases.
• Abduction reasons backward from generalizations to the best explanation of a single observed event.
• A proof is a valid deduction; mathematics establishes relationships between statements, not facts about the physical world.