Revision notes

Chapter 12 Discrete Mathematics: Foundation

The key points, rules to remember, tables and diagrams from all 5 lessons, on one page for quick revision. To keep a copy, use your browser's Print and choose "Save as PDF".

Lesson 1

Binary operations and the closure property

∗ is a binary operation on S when, for all a, b ∈ S, a ∗ b is defined, unique, and belongs to S.

— Binary operation
Which usual operations are binary on which sets
Operationℕℤℚℝℂℚ \ {0}, ℝ \ {0}, ℂ \ {0}
+BinaryBinaryBinaryBinaryBinaryNot binary (e.g. 2 + (−2) = 0)
−Not binaryBinaryBinaryBinaryBinaryNot binary (e.g. 2 − 2 = 0)
×BinaryBinaryBinaryBinaryBinaryBinary
÷Not binaryNot binaryNot binary (÷ 0)Not binary (÷ 0)Not binary (÷ 0)Binary

Testing a rule for closure

  • Is a ∗ b defined for every pair? If some pair gives no value (like a ÷ 0), it is not binary.
    • Check zero, negatives, equal elements
  • Is the value unique? One pair must not give two answers.
  • Is the value inside S? Find one pair whose value leaves S to disprove; argue in general to prove.
    • 3 − 4 = −1 ∉ ℕ
    • a + b + ab ∈ ℕ for a, b ∈ ℕ

Key takeaways: a binary operation on S takes every ordered pair of S to a single element of S; closure is built into the definition. One counterexample is enough to show that a rule is not binary. Whether a rule is binary depends on the set: − is binary on ℤ but not on ℕ, and ÷ is binary on ℝ \ {0} but not on ℝ.

Read the full lesson

Lesson 2

Properties of binary operations: commutative, associative, identity and inverse

Checking an operation step by step

  1. Closure Is a ∗ b always in S?
  2. Commutative Compare a ∗ b with b ∗ a.
  3. Associative Expand (a ∗ b) ∗ c and a ∗ (b ∗ c).
  4. Identity Solve a ∗ e = a for e, for every a.
  5. Inverse Solve a ∗ b = e for b; is b in S?

An identity, if it exists, is unique; so is each inverse (the proof regroups, using associativity). To disprove commutativity or associativity, one counterexample is enough.

— Uniqueness
Summary of the worked examples
OperationClosureCommutativeAssociativeIdentityInverse
+ on ℤYesYesYes0−a
− on ℤYesNoNoNoneNone
a + b − 3 on ℤYesYesYes36 − a
a + 2b on ℤYesNoNoNoneNone
a + b + ab on ℤYesYesYes0Only for 0 and −2
× on even integersYesYesYesNoneNone

Key takeaways: check closure first, then commutativity and associativity by expanding both sides, then solve a ∗ e = a for an identity that works for every a, then solve a ∗ a′ = e and check that a′ lies in the set. Identity and inverses are unique when they exist. A single counterexample disproves any "for all" property.

Read the full lesson

Lesson 3

Boolean matrices and modular arithmetic

Every entry is in ℤ₄, so +₄ is a binary operation
+₄0123
00123
11230
22301
33012
For example 3 × 5 = 15 = 2 × 7 + 1, so 3 ×₇ 5 = 1
×₇123456
1123456
2246135
3362514
4415263
5531642
6654321

Join and meet; +ₙ and ×ₙ

  • Join ∨ Entry-wise max
    • Identity: null matrix O
    • No inverses
  • Meet ∧ Entry-wise min
    • Identity: all-ones matrix U
    • No inverses
  • +ₙ on ℤₙ Remainder of a + b
    • Identity 0
    • Inverse of a is n − a (0 for 0)
  • ×ₙ Remainder of a × b
    • Identity 1
    • Inverses only where 1 appears in the row

Key takeaways: join and meet work entry by entry with max and min; their identities are the null matrix and the all-ones matrix, and neither has inverses. a ≡ b (mod n) means n divides a − b. In an operation table, the identity's row and column copy the headings, and an element has an inverse exactly when the identity appears in its row.

Read the full lesson

Lesson 4

Statements, logical connectives and truth tables

SentenceStatement?Reason
The sum of the angles of a triangle is 180°.Yes, TDeclarative and true
7 + 5 = 13Yes, FDeclarative and false
Please shut the window.NoA request
Is 91 a prime number?NoA question
What a beautiful sunset!NoAn exclamation
x + 4 = 9No (open)Truth depends on x
All the connectives in one truth table
pq¬pp ∧ qp ∨ qp → qp ↔ qp ⊻ q
TTFTTTTF
TFFFTFFT
FTTFTTFT
FFTFFTTF

The four related conditionals

  • Conditional p → q
  • Converse q → p
    • Swap hypothesis and conclusion
  • Inverse ¬p → ¬q
    • Negate both
  • Contrapositive ¬q → ¬p
    • Swap and negate
    • Always has the same truth value as p → q

Key takeaways: a statement is a declarative sentence that is definitely true or false. Negation flips the value; ∧ needs both true; ∨ needs at least one; p → q fails only for T → F; ↔ needs equal values; ⊻ needs different values. A truth table for n variables has 2ⁿ rows. The contrapositive ¬q → ¬p, not the converse, says the same as p → q.

Read the full lesson

Lesson 5

Tautology, contradiction, duality and logical equivalence

pqp → q(p → q) ∧ p[(p → q) ∧ p] → q(p ∨ q) ∧ (¬p ∧ ¬q)p → (p ∧ q)
TTTTTFT
TFFFTFF
FTTFTFT
FFTFTFT
Laws of equivalence
LawForm (i)Dual form (ii)
Idempotentp ∨ p ≡ pp ∧ p ≡ p
Commutativep ∨ q ≡ q ∨ pp ∧ q ≡ q ∧ p
Associative(p ∨ q) ∨ r ≡ p ∨ (q ∨ r)(p ∧ q) ∧ r ≡ p ∧ (q ∧ r)
Distributivep ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
Identityp ∨ 𝔽 ≡ p, p ∨ 𝕋 ≡ 𝕋p ∧ 𝕋 ≡ p, p ∧ 𝔽 ≡ 𝔽
Complementp ∨ ¬p ≡ 𝕋, ¬𝕋 ≡ 𝔽p ∧ ¬p ≡ 𝔽, ¬𝔽 ≡ 𝕋
Double negation¬(¬p) ≡ p(self-dual)
De Morgan¬(p ∧ q) ≡ ¬p ∨ ¬q¬(p ∨ q) ≡ ¬p ∧ ¬q
Absorptionp ∨ (p ∧ q) ≡ pp ∧ (p ∨ q) ≡ p

p → q ≡ ¬p ∨ q; p → q ≡ ¬q → ¬p; p ↔ q ≡ (p → q) ∧ (q → p); ¬(p ∧ q) ≡ ¬p ∨ ¬q and ¬(p ∨ q) ≡ ¬p ∧ ¬q.

— Equivalences to remember
pq¬p¬qp → q¬p ∨ q¬q → ¬pq → p
TTFFTTTT
TFFTFFFT
FTTFTTTF
FFTTTTTT

Proving an equivalence by the laws

  1. Remove → and ↔ Use p → q ≡ ¬p ∨ q.
  2. Push ¬ inwards De Morgan and double negation.
  3. Distribute Expand or factor with the distributive laws.
  4. Tidy Complement, identity, absorption, idempotent.

Then back to step 1: Remove → and ↔

Check the result with a quick truth table if unsure.

Key takeaways: a tautology is always T, a contradiction always F, anything mixed is a contingency. To dualise, swap ∧ with ∨ and 𝕋 with 𝔽, leaving ¬ alone. Equivalent formulas have identical truth columns; the laws let you prove equivalences by algebra. A conditional equals its contrapositive and ¬p ∨ q, but not its converse.

Read the full lesson

Privacy · Terms · Refunds · Delivery