Discrete Math YouTube Lecture Proof Notes (Claim, Strategy, Key Step)

Published 2026-10-07 · Francesco Masciopinto

Discrete math is often the first course where students are asked to write proofs, and it surprises people. You can follow every line of a proof in a lecture video, nod along, and then freeze completely when an exam asks you to prove something similar. Watching a proof is not the same as being able to produce one.

The fix is to take notes that capture how a proof works, not just what it says. These discrete math YouTube lecture proof notes use a simple card for every proof: the claim, the strategy, and the key step.

The proof card

For every proof the lecturer presents, make a card with four lines:

Field	What to write	Example
Claim	The exact statement being proved	The sum of two odd integers is even
Strategy	The proof technique	Direct proof
Key step	The one move that makes it work	Write odds as 2a+1 and 2b+1; the sum is 2(a+b+1)
Timestamp	Where it is in the video	14:20

Optional fifth line: Where people get stuck, if the lecturer mentions a common mistake.

The key-step line is the most important. Most proofs at this level have one idea that unlocks them: choose the right representation, pick the right induction hypothesis, assume the opposite and find the contradiction. If you can name that idea, you can usually rebuild the rest.

Intro discrete math courses typically use a small set of proof techniques. Keep a one-page list and add each lecture's examples to it:

Direct proof: assume the hypothesis, derive the conclusion.
Proof by contrapositive: prove "if not Q, then not P" instead.
Proof by contradiction: assume the statement is false, derive something impossible.
Proof by cases: split into exhaustive cases and prove each one.
Mathematical induction: base case, inductive hypothesis, inductive step.
Strong induction: assume all previous cases, not just the last one.
Counterexample: disprove a universal claim with one example.
Combinatorial / counting arguments: count the same thing two ways, or build a bijection.

Use whatever names your course uses. Under each technique, list the timestamps of proofs that used it. Before an exam, this page tells you which techniques you have seen most and where to find examples.

Watch proofs in two passes

First pass: understand the goal. When the lecturer states the claim, pause. Write the claim in your own words and guess which strategy might work. Then watch the proof.

Second pass: reconstruct. After the proof is finished, close or minimize the video. On paper, try to write the proof yourself from the claim and your key-step note. Then compare against the lecture.

The second pass is where learning happens. You will discover gaps you did not notice while watching: a step you assumed was obvious, a quantifier you dropped, a case you forgot.

Induction proofs deserve their own template

Induction appears in almost every discrete math course and has a fixed structure that students often lose under exam pressure. Use this template for every induction proof in the lecture:

Statement P(n): what exactly is being proved for each n.
Base case: which value, and the check.
Inductive hypothesis: "Assume P(k) is true for some k ≥ base."
Inductive step goal: write out P(k+1) explicitly before proving it.
Key step: where the hypothesis gets used.
Conclusion line.

Writing the P(k+1) goal explicitly before starting the algebra is a simple habit that prevents a lot of lost marks.

Notes for definitions

Many discrete math proofs depend on using a definition precisely: even, odd, divides, prime, injective, surjective, equivalence relation, and so on. Keep a definitions sheet where each definition is written in a form you can plug into a proof:

"n is even" means "there exists an integer k such that n = 2k."
"a divides b" means "there exists an integer k such that b = ak."

When a proof feels stuck, the answer is often "go back to the definition." Having it written in usable form makes that step automatic.

Practice: from lecture proof to new proof

A proof you watched is a template for similar proofs. After each lecture, take one proof and vary it:

Change the claim slightly (sum of two evens, product of two odds).
Try a different strategy (prove a direct-proof claim by contrapositive).
Find a counterexample to a false variation ("the sum of two primes is always even").

Then do assigned problems without looking at your notes first. Check your proof cards only when you are stuck, and note which key step you needed.

Common mistakes

Copying proofs line by line without naming the strategy or key step.
Watching proofs at high speed without pausing at the claim.
Skipping the reconstruct-from-memory pass.
Writing induction proofs without stating P(k+1) first.
Using informal definitions ("even means divisible by two-ish") instead of precise ones.

A helper for finding each proof again

Long discrete math lectures often contain five or six proofs, and scrubbing to find the right one wastes time. SummarizAI is a Chrome extension that adds chapters, a summary, a chat, and Study flashcards on the YouTube watch page, so you can jump straight to "proof by induction example" and turn your key steps into review cards. The free plan works as a student trial. Use it to navigate, then do the proofs yourself.

Frequently asked questions

How do I take notes on proofs from a YouTube lecture?

For each proof, record the claim, the strategy, the key step, and the timestamp. Then try to rewrite the proof from memory and compare.

Should I memorize proofs for a discrete math exam?

Memorizing exact wording is fragile. It is more reliable to know the strategy and key step, because exam questions usually change the details.

How can I get better at choosing a proof technique?

Keep a strategy list with examples from lectures. Over time you will see patterns: universal claims about integers often start with a direct proof, statements with "not" often suit contrapositive or contradiction, and claims about all n often suggest induction.

What if I understand the proof when watching but cannot write it myself?

That is normal. Pause at the claim, try it yourself first, then watch. After the proof, rebuild it on paper from memory. This gap closes with practice.

Does this work for other proof-based courses?

Yes. The same card works for linear algebra, real analysis, abstract algebra, and theoretical computer science.

Related guides

Try SummarizAI on your next lecture

SummarizAI is a Chrome extension that adds a summary, chapters, and Study flashcards on the YouTube watch page. The free plan is a student trial—no need to leave the lecture tab.

Start the free student trial

Students · Responsible summaries · Install