MATH1061 — Week 8 Notes
Lecture 21 — Cardinalities
Pre-work: Video 027 (Cardinalities). The reference notes are [cardinality] for what “the same size” means and how to prove it, and countable-and-uncountable-sets for the listing arguments that start here and finish in 2026-09-15-countable-and-uncountable-sets. Every tool used is a bijection, so one-to-one-and-onto-functions is the prerequisite.
Learning goals
- Understand cardinalities of finite and infinite sets.
- Learn how to prove properties concerning cardinalities of sets.
The picture to keep in mind is two columns of dots, each dot joined to a partner in the other column, both columns going on without end. It is a pairing that never runs out, and that is the whole idea.
Worked: why is \(|\mathbb{Z}| = |\mathbb{Z}^{+}| = |\mathbb{Q}|\)?
If cardinality is a measure of how large a set is, then why is \(|\mathbb{Z}| = |\mathbb{Z}^{+}| = |\mathbb{Q}|\), when clearly \(|\mathbb{Q}| > |\mathbb{Z}| > |\mathbb{Z}^{+}|\)?
\(|\mathbb{Q}| > |\mathbb{Z}| > |\mathbb{Z}^{+}|\) is false. The clearly is the mistake. Put \(1, 2, 3, 4, 5\) over \(\{a, b, c, d, e\}\) and join each number to one letter. That is what counting a finite set is: pairing its elements off with \(1, 2, \dots, n\). Cardinality keeps the pairing and drops the requirement that it stop.
The “clearly” comes from containment. \(\mathbb{Z}^{+} \subset \mathbb{Z} \subset \mathbb{Q}\), each a proper subset of the next, and for finite sets a proper subset is always smaller. For infinite sets that inference fails, and the proofs below show it. Every example below is infinite.
How do we measure the size of infinite sets?
\(\mathbb{Z}^{+}\) : the positive integers \(1, 2, 3, \dots\)
\(2\mathbb{Z}^{+}\) : the even positive integers \(2, 4, 6, \dots\)
There are two ways to set the two sets side by side. The first is as a subset: \(2\mathbb{Z}^{+} \subset \mathbb{Z}^{+}\), the even entries in the row \(1, 2, 3, \dots\). That is not how to think of it. The second is as a pairing: \(\mathbb{Z}^{+}\) sits over \(2\mathbb{Z}^{+}\), with each \(n\) joined to \(2n\).
To measure the size of infinite sets, think with functions:
\[|2\mathbb{Z}^{+}| = |\mathbb{Z}^{+}|, \qquad f : \mathbb{Z}^{+} \to 2\mathbb{Z}^{+},\; f(x) = 2x,\; f \text{ is a bijection.}\]
Figure 1: Two ways of setting the even positive integers beside the positive integers. Top: as a subset, \(2\mathbb{Z}^{+}\) is every second entry, which makes it look like half of \(\mathbb{Z}^{+}\). Bottom: as a pairing, \(n \leftrightarrow 2n\) matches every positive integer with exactly one even number and every even number with exactly one positive integer, with nothing left over on either side. Cardinality is defined by the pairing, so \(|2\mathbb{Z}^{+}| = |\mathbb{Z}^{+}|\) even though \(2\mathbb{Z}^{+}\) is a proper subset.
Both halves of “bijection” are quick. One-to-one: \(2x_1 = 2x_2\) gives \(x_1 = x_2\). Onto: an even positive integer \(y\) is \(2k\) for some \(k \in \mathbb{Z}^{+}\), and \(f(k) = y\).
Finite sets, and the definition
Four facts hold for finite sets. Each one is drawn, with the reason it works, in cardinality.
- If \(A\) has more elements than \(B\), then there is no one-to-one (injective) function \(f : A \to B\). With five elements in \(A\) and four in \(B\), the fifth element of \(A\) has nowhere new to land.
- If \(A\) has fewer elements than \(B\), then there is no onto (surjective) function \(f : A \to B\). Some element of \(B\) is left that nothing reaches.
- If \(A\) and \(B\) have the same number of elements, then any function \(f : A \to B\) is one-to-one if and only if it is onto.
- When \(A\) and \(B\) have the same number of elements there can be functions from \(A\) to \(B\) that are neither one-to-one nor onto.
The definition:
Any two finite sets have the same number of elements if and only if there is a bijection between them.
Any two sets have the same cardinality if and only if there is a bijection between them.
If the sets \(A\) and \(B\) have the same cardinality, then we write \(|A| = |B|\).
Any two sets means finite or infinite. The first sentence is a fact about counting. The second is a definition: “same size” is defined to mean “there is a bijection”, so that the word makes sense for infinite sets too.
Fact 3 is the one that does not survive into the infinite case. \(f : \mathbb{Z}^{+} \to \mathbb{Z}^{+}\), \(f(n) = 2n\), is one-to-one but not onto (nothing maps to 1), between two sets of the same cardinality. For infinite sets one-to-one and onto come apart, which is why every proof below checks them separately.
Proving that \(|\mathbb{Z}^{+}| = |\mathbb{Q}^{+}|\)
A positive rational number has the form \(\frac{a}{b}\) where \(a, b \in \mathbb{Z}^{+}\).
Define \(f : \mathbb{Z}^{+} \to \mathbb{Q}^{+}\) in three stages. First, display the elements of \(\mathbb{Q}^{+}\) in a grid: row \(a\), column \(b\) holds \(\frac{a}{b}\). Next, run a path that snakes through the grid diagonal by diagonal. It meets some numbers more than once: \(\frac{1}{1}\) and \(\frac{2}{2}\) are the same number. Last, number the fractions the path counts, in the order it meets them. Some of the values: \(f(1) = \frac{1}{1}\), \(f(2) = \frac{1}{2}\), \(f(3) = \frac{2}{1}\), \(f(4) = \frac{3}{1}\), \(f(5) = \frac{1}{3}\), \(f(6) = \frac{1}{4}\), \(f(10) = \frac{5}{1}\), \(f(11) = \frac{1}{5}\), \(f(12) = \frac{1}{6}\), \(f(17) = \frac{6}{1}\), \(f(18) = \frac{7}{1}\), \(f(19) = \frac{5}{3}\). The path runs through \(\frac{2}{2}\) without counting it.
Figure 2: Listing the positive rationals. Row \(a\), column \(b\) holds \(\frac{a}{b}\), so every positive rational appears somewhere — infinitely often, under all its names. The path walks the anti-diagonals one after another, snaking back and forth. A fraction met in lowest terms gets the next positive integer (ringed, number above). Any other name for a rational already counted, such as \(\frac{2}{2}\) or \(\frac{4}{2}\), is stepped over (grey). Every diagonal is finite, so the walk reaches every cell after finitely many steps, which makes \(f\) onto; skipping the repeats makes it one-to-one.
Worked questions on \(f\).
(a) What is \(f(12)\)? What is \(f(18)\)? — \(f(12) = \frac{1}{6}\), \(f(18) = \frac{7}{1}\).
(b) Why is this function both one-to-one and onto? Onto: any positive rational in lowest terms, \(\frac{a}{b}\), sits in row \(a\), column \(b\), on the diagonal \(a + b\). There are only finitely many cells on the diagonals before it, so the path gets there after finitely many steps and gives it a number. One-to-one: the path counts a cell only if its fraction is in lowest terms, and each positive rational has exactly one lowest-terms name, so two different positive integers never land on the same rational.
(c) What is \(f^{-1}\!\left(\frac{5}{3}\right)\)? — \(f^{-1}\!\left(\frac{5}{3}\right) = 19\). The notation makes sense here only because \(f\) is a bijection (inverse-functions). To answer it, count along the path until \(\frac{5}{3}\) comes up.
Worked: prove that \(|\mathbb{Z}| = |S|\)
Let \(S = \{n \in \mathbb{Z} \text{ such that } n \bmod 3 = 1\}\). Prove that \(|\mathbb{Z}| = |S|\).
The template below is the one the rest of the course uses. It has three steps, and the proof has the same three parts in the same order.
One way to show \(|X| = |Y|\) for sets \(X\) and \(Y\):
- Define a function \(f : X \to Y\) and explain why it is a function (each element of \(X\) has a unique image in \(Y\))
- Show \(f\) is one-to-one (injective)
- Show \(f\) is onto (surjective)
First list the two sets and pair them up. \(\mathbb{Z} = \{\dots, -2, -1, 0, 1, 2, 3, \dots\}\) goes over \(S = \{\dots, -5, -2, 1, 4, 7, 10, \dots\}\), with \(-1 \leftrightarrow -2\), \(0 \leftrightarrow 1\), \(1 \leftrightarrow 4\), \(2 \leftrightarrow 7\), \(3 \leftrightarrow 10\). Then define \(f : \mathbb{Z} \to S\) by \(f(n) = 3n + 1\).
It is a function into \(S\). For any \(n \in \mathbb{Z}\), \(3n + 1 \equiv 1 \pmod 3\) so \(f(n) \in S\), and \(3n + 1\) is unique so \(f\) is a function.
One-to-one. Suppose \(f(n_1) = f(n_2)\). Then \[3n_1 + 1 = 3n_2 + 1, \qquad 3n_1 = 3n_2, \qquad n_1 = n_2.\] \(\therefore f\) is injective.
Onto. Let \(y \in S\). Take \(\frac{y-1}{3} \in \mathbb{Z}\), which is an integer because \(y - 1\) is divisible by 3 (by definition of \(S\)). Also \[f\!\left(\frac{y-1}{3}\right) = 3\left(\frac{y-1}{3}\right) + 1 = (y - 1) + 1 = y. \qquad \therefore f \text{ is onto.}\]
We have \(f\) is a bijection, so \(|\mathbb{Z}| = |S|\).
The rough work does the solving that the onto step then runs forwards: want \(y = 3x + 1\), so \(\frac{y-1}{3} = x\). This is the same solve backwards, run forwards move as in one-to-one-and-onto-functions. And the domain check again carries the real content. \(\frac{y-1}{3}\) is an integer only because \(y \in S\). For an arbitrary integer \(y\) it would not be, and \(f\) would not be onto \(\mathbb{Z}\).
Two details about \(S\). The members include negatives, \(-2\) and \(-5\), because \(\bmod\) here is the remainder from the quotient-remainder theorem, which is never negative: \(-2 = 3 \cdot (-1) + 1\) (modular-arithmetic). And the first bullet of the template is not a formality. It is where you check that \(f\) lands in \(S\), not just in \(\mathbb{Z}\).
Figure 3: The bijection \(f(n) = 3n + 1\) from \(\mathbb{Z}\) to \(S = {n \in \mathbb{Z} : n \bmod 3 = 1}\). On the lower line the members of \(S\) are only every third integer (the dots), yet each integer \(n\) above is sent to exactly one dot, and each dot \(y\) is hit from exactly one integer, namely \(\frac{y-1}{3}\). Spreading a set out does not change its cardinality.
Hilbert’s Hotel
Suppose that you manage a hotel with infinitely\(^{*}\) many rooms, numbered 1, 2, 3, etc. All rooms are occupied, when a new guest arrives and asks for a room. What do you do?
\(^{*}\)Here “infinite” means having the same cardinality as \(\mathbb{Z}^{+}\).
The question comes in three versions, by who arrives. The answers:
| Arrivals | Move the existing guests | Put the new guests |
|---|---|---|
| one new guest | each person in room \(x\) goes to room \(x + 1\) | in room 1 |
| an infinite\(^{*}\) busload | each room \(x\) goes to room \(2x\) | into the odd rooms |
| infinitely\(^{*}\) many infinite\(^{*}\) busloads | each room \(x\) goes to room \(2^{x}\) | 1st extra bus to all \(3^{x}\), 2nd to all \(5^{x}\), … continue for all primes |
Figure 4: Hilbert’s Hotel, rooms 1 to 16 of infinitely many. In each panel the top row is the full hotel before the move and the bottom row is after it: blue for the guests already there, other colours for arrivals, white for an empty room. (1) \(x \mapsto x+1\) frees room 1. (2) \(x \mapsto 2x\) frees every odd room, one for each passenger on the bus. (3) \(x \mapsto 2^x\), with the \(k\)-th bus sent to the powers of the next prime — 3, 5, 7, 11, 13, … — gives everyone a room of their own, because a prime power is a power of only one prime. Rooms such as 1, 6 and 10 stay empty, and that is allowed: the new assignment only has to be one-to-one.
Each answer is a one-to-one function from guests to rooms, and each says something about cardinality.
- One guest. \(x \mapsto x + 1\) is a bijection from \(\mathbb{Z}^{+}\) to \(\mathbb{Z}^{+} - \{1\}\). Removing one element from \(\mathbb{Z}^{+}\) does not make it smaller.
- One bus. \(x \mapsto 2x\) is a bijection onto the even rooms, and the odd rooms are a second copy of \(\mathbb{Z}^{+}\). \(\mathbb{Z}^{+}\) splits into two parts each the same size as itself.
- Infinitely many buses. Nobody collides, because a room number \(p^{x}\) with \(p\) prime determines both \(p\) and \(x\) — unique factorisation again (divisibility-and-factorisation). This assignment is not onto (room 1, room 6 and every other room that is not a prime power stays empty), and a hotel does not need it to be. Everyone needs a room, and no two guests may share one. That is an injection into \(\mathbb{Z}^{+}\), which is exactly what \(|X| \leq |\mathbb{Z}^{+}|\) means in the next lecture (cardinality).
Worked: prove that \(|\mathbb{Z}^{+}| = |\mathbb{Z} \times \mathbb{Z}|\)
Prove that \(|\mathbb{Z}^{+}| = |\mathbb{Z} \times \mathbb{Z}|\). Draw a picture to illustrate a bijection.
Take \(\mathbb{Z}^{+}\) as the list \(1, 2, 3, \dots\) and \(\mathbb{Z} \times \mathbb{Z}\) as the points of a lattice. Walk a square spiral out from the origin: \((0,0)\) to \((1,0)\), up to \((1,1)\), left to \((-1,1)\), down to \((-1,-1)\), right to \((2,-1)\), up to \((2,2)\), left to \((-2,2)\), down to \((-2,-2)\), right to \((3,-2)\), up to \((3,3)\), and on. Then:
\[f : \mathbb{Z}^{+} \to \mathbb{Z} \times \mathbb{Z}, \qquad f(x) \text{ is "position } x\text{" along this spiral.}\]
Figure 5: The spiral that lists \(\mathbb{Z} \times \mathbb{Z}\): the number beside each lattice point is its position on the path, so the point marked \(n\) is \(f(n)\). The path starts at \(f(1) = (0,0)\) and winds anticlockwise outwards. It never visits a point twice, so \(f\) is one-to-one. Each square ring is finite and is finished before the next begins — ring \(k\) closes at step \((2k+1)^2\), the bold 9, 25 and 49 — so every lattice point is reached after finitely many steps, and \(f\) is onto.
Rows would not work in place of the spiral. Listing \(\mathbb{Z} \times \mathbb{Z}\) row by row never gets past the first row, because the first row is already infinite. A listing has to reach every element after finitely many steps, so it must visit the pairs in finite batches that together cover everything. The spiral’s rings are those batches, as the anti-diagonals were for the \(\mathbb{Q}^{+}\) grid.
Proving that \(|\mathbb{Z}^{+}| = |\mathbb{Q}|\)
Since each rational number can be written as \(\frac{a}{b}\) where \((a,b) \in \mathbb{Z} \times \mathbb{Z}\), there is a bijection \(f\) from \(\mathbb{Q}\) to a proper subset \(A\) of \(\mathbb{Z} \times \mathbb{Z}\).
For \(f : \mathbb{Q} \to \mathbb{Z} \times \mathbb{Z}\), use the same spiral but use only ordered pairs that give each rational number exactly once:
- Take \(\gcd(a,b) = 1\).
- Decide whether the minus sign goes in the numerator (\(a\)) or the denominator (\(b\)).
- Leave out the whole horizontal axis, where \(b = 0\), including \((0,0)\). A pair with \(b = 0\) is not a fraction at all.
For example, \(f\) sends \(\frac{1}{2}\) to \((1,2)\) and, with the minus sign in the denominator, \(-\frac{4}{3}\) to \((4,-3)\). Either choice of sign works if it is made once and kept. Next, represent the rational numbers as blue spots in the spiral, and label them in the order the spiral meets them: \(g(1), g(2), g(3), \dots\) Then:
\(g : \mathbb{Z}^{+} \to \mathbb{Q}\) is a bijection. So \(|\mathbb{Z}^{+}| = |\mathbb{Q}|\).
Strictly, \(f : \mathbb{Q} \to \mathbb{Z} \times \mathbb{Z}\) is a bijection onto \(A\); as a function into all of \(\mathbb{Z} \times \mathbb{Z}\) it is one-to-one but not onto, since \(A\) is a proper subset. That is enough, because \(g\) only ever walks through \(A\).
Figure 6: Listing \(\mathbb{Q}\) with the same spiral. Write each rational in lowest terms with a positive denominator, \(\frac{a}{b}\) with \(b \geq 1\) and \(\gcd(a,b) = 1\), and plot it at \((a,b)\). Those points are the blue spots, and each rational owns exactly one. Walk the spiral and count only the blue spots: \(g(1) = 1\), \(g(2) = 0\), \(g(3) = -1\), \(g(4) = 2\), \(g(5) = \frac{1}{2}\), and so on (index in blue, value beside it). Every rational is reached (onto) and none twice (one-to-one), so \(g : \mathbb{Z}^{+} \to \mathbb{Q}\) is a bijection. Points with \(b \leq 0\) are never used, and neither is a point like \((2,2)\) whose fraction is already spotted at \((1,1)\).
The running total:
\[\text{Now we have seen that } |\mathbb{Z}^{+}| = |2\mathbb{Z}| = |\mathbb{Z}| = |\mathbb{Q}^{+}| = |\mathbb{Q}| = |\mathbb{Z} \times \mathbb{Z}|.\]
Two of these links are not proved above. What was proved is \(|2\mathbb{Z}^{+}| = |\mathbb{Z}^{+}|\), not \(|2\mathbb{Z}| = |\mathbb{Z}|\), though \(n \mapsto 2n\) works just as well from \(\mathbb{Z}\) to the even integers \(2\mathbb{Z}\). And \(|\mathbb{Z}| = |\mathbb{Z}^{+}|\) is the listing \(0, 1, -1, 2, -2, 3, -3, \dots\), drawn in countable-and-uncountable-sets. Equality of cardinality chains like this because bijections compose and invert (composition-of-functions, inverse-functions).
Infinite subsets of \(\mathbb{Z}^{+}\)
Every infinite subset of \(\mathbb{Z}^{+}\) has the same cardinality as \(\mathbb{Z}^{+}\).
The proof opens by listing the subset in increasing order:
Proof. Let \(A = \{a_1, a_2, a_3, \dots\}\) be an infinite subset of \(\mathbb{Z}^{+}\) such that \(a_1 < a_2 < a_3 < \cdots\), that is, let \(a_1\) be the least element of \(A\), let \(a_2\) be the least element of \(A - \{a_1\}\), let \(a_3\) be the least element of \(A - \{a_1, a_2\}\), …and so on…
From there it goes by the \(|X| = |Y|\) template, with one more tool:
The Well-Ordering Principle for the integers: If \(S\) is a non-empty set of integers all of which are greater than some fixed integer, then \(S\) has a least element.
The function to define is \(f : \mathbb{Z}^{+} \to A\). The finished proof is at the start of 2026-09-15-countable-and-uncountable-sets.
The well-ordering principle (strong-induction-and-the-well-ordering-principle) is what makes each “let \(a_i\) be the least element” legitimate. \(A - \{a_1, \dots, a_{i-1}\}\) is a set of positive integers, all greater than 0. It is non-empty because \(A\) is infinite and only finitely many elements have been removed. So it has a least element.
See also
- [cardinality] — the definition, the finite-set facts, the \(|X| = |Y|\) template, comparing sizes
- countable-and-uncountable-sets — listing arguments for \(\mathbb{Z}\), \(\mathbb{Z} \times \mathbb{Z}\), \(\mathbb{Q}\), and what cannot be listed
- one-to-one-and-onto-functions · inverse-functions — bijections, which every argument here is built from
- 2026-09-08-composition-of-functions — Lecture 20 · 2026-09-15-countable-and-uncountable-sets — Lecture 22
- practice-problems — §27, with full worked solutions
Lecture 22 — Countable and Uncountable Sets
Pre-work: Video 028 (Countable and Uncountable Sets). The reference notes are countable-and-uncountable-sets for the definitions and the big results, and [cardinality] for comparing sizes with injections and surjections and for the Schröder–Bernstein Theorem. The proof for infinite subsets of \(\mathbb{Z}^{+}\) is carried over from 2026-09-14-cardinalities.
Learning goals
- Understand countability and cardinalities of finite and infinite sets.
- Prove properties concerning countable and uncountable sets.
The whole topic in one line, with each stretch labelled:
\[|\emptyset| < |\{1,2,\dots,n\}| < |\mathbb{Z}^{+}| = |\mathbb{Z}| = |\mathbb{Q}| < |\mathbb{R}| < |\mathcal{P}(\mathbb{R})|\]
| \(\lvert\emptyset\rvert\) | \(\lvert\{1,2,\dots,n\}\rvert\) | \(\lvert\mathbb{Z}^{+}\rvert = \lvert\mathbb{Z}\rvert = \lvert\mathbb{Q}\rvert\) | \(\lvert\mathbb{R}\rvert\), \(\lvert\mathcal{P}(\mathbb{R})\rvert\) | |
|---|---|---|---|---|
| label | empty | finite (and non-empty) | countably infinite | uncountable |
The chain is drawn out, with every step explained, in countable-and-uncountable-sets.
Three questions to start with
- How does the proof that \(\mathbb{R}\) is uncountable go? It is sketched below.
- Q2 and Q3 of the pre-class quiz. Both are answered below.
- How is the Schröder–Bernstein Theorem applied? See a closed and an open interval and the countability of \(\mathbb{Z}^{+} \times \mathbb{Z}^{+}\).
Infinite subsets of \(\mathbb{Z}^{+}\)
Every infinite subset of \(\mathbb{Z}^{+}\) has the same cardinality as \(\mathbb{Z}^{+}\).
Proof. Let \(A = \{a_1, a_2, a_3, \dots\}\) be an infinite subset of \(\mathbb{Z}^{+}\) such that \(a_1 < a_2 < a_3 < \cdots\), that is, let \(a_1\) be the least element of \(A\), let \(a_2\) be the least element of \(A - \{a_1\}\), let \(a_3\) be the least element of \(A - \{a_1, a_2\}\), …and so on…
Define \(f : \mathbb{Z}^{+} \to A\) where \(f(i) = a_i\).
- Then \(f\) is a function since it maps each positive integer (element of the domain) to a unique element of \(A\) (the co-domain).
- Suppose \(f(i) = f(j)\) for positive integers \(i\) and \(j\). Then \(a_i = a_j\) but the elements of the set \(A\) are all different so this means \(i = j\). Thus, \(f\) is one-to-one.
- For each \(a_j \in A\), we have \(j \in \mathbb{Z}^{+}\) and \(f(j) = a_j\) so \(f\) is onto.
Therefore, \(f\) is a bijection, and hence \(|\mathbb{Z}^{+}| = |A|\).
The three bullets are the three parts of the \(|X| = |Y|\) template: a function, one-to-one, onto. The set-up rests on:
The Well-Ordering Principle for the integers: If \(S\) is a non-empty set of integers all of which are greater than some fixed integer, then \(S\) has a least element.
The onto bullet leans on something the set-up does not say out loud: that every element of \(A\) is one of the \(a_j\). An infinite set could in principle have elements the “and so on” never reaches. It cannot happen here. An element \(a \in A\) has fewer than \(a\) elements of \(A\) below it (they are positive integers less than \(a\)), so after at most \(a - 1\) steps \(a\) is the least element left, and it is picked. That is one of two places \(A \subseteq \mathbb{Z}^{+}\) is used. The other is the well-ordering step. Each \(A - \{a_1, \dots, a_{i-1}\}\) is a set of positive integers, non-empty because \(A\) is infinite, so the Well-Ordering Principle gives it a least element. That step is where the same construction on \(\mathbb{Q}^{+}\) itself fails, since there is no least positive rational.
Definitions
A set \(X\) is finite if and only if \(X = \emptyset\) or \(|X| = |\{1,2,\dots,n\}|\) for some \(n \in \mathbb{Z}^{+}\).
A set is infinite if and only if it is not finite.
A set \(X\) is countable if and only if it is finite or \(|X| = |\mathbb{Z}^{+}|\).
A set \(X\) is uncountable if and only if it is not countable.
A set \(X\) is countably infinite if and only if it is countable and infinite.
Countable is an or: finite, or \(|X| = |\mathbb{Z}^{+}|\). It includes every finite set, and “countably infinite” is the name for the second case alone.
Worked: the set of terms of a sequence. If \(x_1, x_2, x_3, \dots\) is any infinite sequence, then \(\{x_1, x_2, x_3, \dots\}\) is:
| (A) finite | (B) infinite | (C) countable | (D) uncountable | (E) countably infinite |
|---|---|---|---|---|
| ✗ | ✗ | \(\checkmark\) | ✗ | ✗ |
One sequence for each way it can go:
- \(2, 4, 6, 8, \dots\) gives \(\{2, 4, 6, \dots\} = 2\mathbb{Z}^{+}\), which is infinite;
- \(1, 0, 1, 0, 1, 0, 1, 0, \dots\) gives \(\{0, 1\}\), which is finite.
An infinite sequence can have a finite set of terms, because a sequence may repeat and a set forgets repeats. That rules out (A), (B) and (E) as “always” answers. What always holds is (C). The terms are listed by the sequence itself, so the set is either finite or can be listed without repeats by dropping the duplicates. Comparing sizes puts it in one line, since \(i \mapsto x_i\) is onto the set.
Countable sets, and lists
\(\mathbb{Z}^{+}\), \(2\mathbb{Z}\), \(\mathbb{Z}\), \(\mathbb{Q}^{+}\), \(\mathbb{Q}\) and \(\mathbb{Z} \times \mathbb{Z}\) are all countable.
\(X\) is countably infinite if and only if the elements of \(X\) can be written as an infinite list. That is, \(X = \{x_1, x_2, x_3, \dots\}\), where the \(x_i\) are all distinct.
The two directions:
- If \(X = \{x_1, x_2, \dots\}\), then \(f(i) = x_i\) is a bijection \(f : \mathbb{Z}^{+} \to X\).
- If \(f : \mathbb{Z}^{+} \to X\) is a bijection, then we let \(x_i = f(i)\) and we have \(X = \{x_1, x_2, \dots\}\).
A list is a bijection from \(\mathbb{Z}^{+}\): position \(i\) holds \(x_i\). Write \(\mathbb{Z}^{+}\) (\(1\ 2\ 3\ 4\ \cdots\)) above \(X\) (\(x_1\ x_2\ x_3\ x_4\ \cdots\)) and join each \(i\) straight down to \(x_i\). Those joins are the bijection \(f : \mathbb{Z}^{+} \to X\). Distinct is what makes the list one-to-one, and “every element appears somewhere” is what makes it onto.
Theorem: Any subset of a countable set is countable.
Corollary: Any set with an uncountable subset is uncountable.
Examples \(\mathbb{R}\) and \(\mathcal{P}(\mathbb{Z}^{+})\) are examples of uncountable sets. \(\mathbb{R}\) and \(\mathcal{P}(\mathbb{Z}^{+})\) are infinite, \(|\mathbb{R}| \neq |\mathbb{Z}^{+}|\), \(|\mathcal{P}(\mathbb{Z}^{+})| \neq |\mathbb{Z}^{+}|\).
The corollary is the theorem’s contrapositive, since “countable” and “uncountable” are negations of each other. The theorem generalises the result for infinite subsets of \(\mathbb{Z}^{+}\). List the big set, keep the members of the subset in the order they appear, and skip the rest. What is left is still a list, possibly finite. That \(\mathcal{P}(\mathbb{Z}^{+})\) is uncountable is stated without proof.
Quick overview of the proof that \(\mathbb{R}\) is uncountable
This proof is not assessed.
The proof shows that the interval \((0,1) = \{x \in \mathbb{R} \mid 0 < x < 1\}\) is uncountable. It is a proof by contradiction. Assume \((0,1)\) is countable. Then the elements of \((0,1)\) can be written in a list.
| 1st | 2nd | 3rd | 4th | 5th | 6th | 7th | ||
|---|---|---|---|---|---|---|---|---|
| 1 → | 0. | 3 | 6 | 6 | 7 | 8 | 1 | 2 … |
| 2 → | 0. | 4 | 5 | 4 | 0 | 9 | 9 | 2 … |
| 3 → | 0. | 2 | 4 | 5 | 6 | 8 | 9 | 2 … |
| 0. | 3 | 3 | 3 | 3 | 3 | 3 | 5 … | |
| 0. | 1 | 1 | 1 | 1 | 1 | 1 | 7 … | |
| 0. | 5 | 6 | 8 | 7 | 4 | 4 | 7 … | |
| 0. | 3 | 4 | 1 | 0 | 0 | 4 | 1 … | |
| ⋮ | ⋮ | ⋮ | ⋮ | ⋮ | ⋮ | ⋮ | ⋮ |
The bold digit in each row is on the diagonal. Make a real number \(d\) that differs from every other number in the list, by changing each diagonal digit. Where the diagonal digit is not 1 (the 3, 5, 5, 3 and 4) it becomes a 1. Where the diagonal digit is 1 it becomes a 2.
\[0.\,3\,5\,5\,3\,1\,4\,1\,\dots \quad\longrightarrow\quad 0.\,1\,1\,1\,1\,2\,1\,2\,\dots\]
The number on the right is \(d\). It is not in the list. Contradiction. So \((0,1)\) is uncountable.
\((0,1) \subseteq \mathbb{R}\), and any set with an uncountable subset is uncountable. This proves that \(\mathbb{R}\) is uncountable.
Figure 7: The diagonal argument on the first seven numbers of a supposed list of \((0,1)\). The shaded cells are the diagonal: the first digit of the first number, the second digit of the second, and so on. The new number \(d\) is built one decimal place at a time by changing the diagonal digit: 1 if that digit is not 1, and 2 if it is. So \(d\) differs from the \(n\)-th number in the \(n\)-th place, for every \(n\), and cannot be anywhere in the list. Whatever list is proposed, \(d\) is missing from it, so no list of \((0,1)\) exists.
Two remarks. Why \(d\) uses only 1s and 2s. Some real numbers have two decimal names, \(0.1999\ldots = 0.2000\ldots\). A \(d\) built from 0s and 9s might be a second name for a number that is in the list. A \(d\) using only the digits 1 and 2 has just the one decimal name, so “differs in some digit” really does mean “is a different number”. Why the proof is by contradiction. “Uncountable” means no bijection from \(\mathbb{Z}^{+}\) exists, a statement about every possible list. Assuming one list and producing a missing number from it disposes of every list at once, the pattern of proof-techniques.
In fact \(|(0,1)| = |\mathbb{R}|\). Take \((0,1)\) as a segment with open ends and bend it into a circle resting on the real line. A line from the top of the circle through a point on it carries on down to a point of the real line. That is a bijection between the open interval and the whole real line, drawn in countable-and-uncountable-sets.
Worked: a short interval and a long one
Prove that if \(A = [0,1]\) and \(B = [6,9]\), then \(|A| = |B|\). Recall that for \(a, b \in \mathbb{R}\), \([a,b] = \{x \in \mathbb{R} : a \leq x \leq b\}\).
The bijection between \([0,1]\) and \([6,9]\) is a projection. Lines fan out from a point \(c\), cross the short segment \(0\) to \(1\) and hit the long segment \(6\) to \(9\). For a formula, use \(y = mx + c\): the line through \((0,6)\) and \((1,9)\) is \(y = 3x + 6\). The proof has the three parts of the \(|X| = |Y|\) template.
It is a function from \(A\) to \(B\). Let \(f : A \to B\) be defined by \(f(x) = 3x + 6\). Since \(x \in A\) is a real number, \(3x + 6 \in \mathbb{R}\) and is unique. Since \(0 \leq x \leq 1\) we have \(3(0) + 6 \leq f(x) \leq 3(1) + 6\), that is, \(6 \leq f(x) \leq 9\). So \(f\) is indeed a function from \(A\) to \(B\).
One-to-one. Suppose \(x_1, x_2 \in A\) with \(f(x_1) = f(x_2)\). Then \(3x_1 + 6 = 3x_2 + 6\), \(3x_1 = 3x_2\), \(x_1 = x_2\). \(\therefore f\) is one-to-one.
Onto. Suppose \(y \in B = [6,9]\). Consider \(x = \frac{y-6}{3} \in \mathbb{R}\). Since \(y \geq 6\) we have \(x \geq \frac{6-6}{3} = 0\). Since \(y \leq 9\) we have \(x \leq \frac{9-6}{3} = 1\). \(\therefore x \in A\), and \[f\!\left(\frac{y-6}{3}\right) = 3\left(\frac{y-6}{3}\right) + 6 = y - 6 + 6 = y. \qquad \therefore f \text{ is onto.}\]
\(\therefore |A| = |B|\). The \(x\) in the onto part comes from solving backwards: \(y = 3x + 6\), so \(\frac{y-6}{3} = x\).
As in 2026-09-14-cardinalities, the range checks are the part to get right. \(6 \leq f(x) \leq 9\) is what makes \(f\) a function into \(B\), and \(0 \leq x \leq 1\) is what puts the candidate preimage in \(A\).
Figure 8: A bijection between \([0,1]\) and \([6,9]\) by projection. Every ray from \(c\) crosses the short segment once and the long segment once, so it pairs one point of each: nothing is missed and nothing is shared. Because the segments are parallel, the long one is three times the length, and the end rays pair 0 with 6 and 1 with 9, the ray through \(x\) lands at \(3x + 6\) — the formula in the proof is this picture. A longer segment does not have more points.
Definition of \(|A| \geq |B|\) and the Schröder–Bernstein Theorem
For any sets \(A\) and \(B\):
\(|A| \leq |B| \leftrightarrow \exists\) injective \(f : A \to B\). \(\qquad\) \(|A| \geq |B| \leftrightarrow \exists\) surjective \(f : A \to B\).
\(|A| < |B| \leftrightarrow \exists\) injective \(f : A \to B\) but \(\nexists\) bijective \(f : A \to B\).
\(|A| > |B| \leftrightarrow \exists\) surjective \(f : A \to B\) but \(\nexists\) bijective \(f : A \to B\).
There is no guarantee that the injection for \(|A| \leq |B|\) and the surjection for \(|A| \geq |B|\) are the same function.
The Schröder–Bernstein Theorem. For all sets \(A\) and \(B\), if \(|A| \leq |B|\) and \(|A| \geq |B|\), then \(|A| = |B|\).
To show \(|A| = |B|\), instead of finding a bijection from \(A\) to \(B\), you can find a function that shows \(|A| \leq |B|\) and a different function that shows \(|B| \leq |A|\).
The theorem is on the course formula sheet (formula-sheet). It is not obvious. It says two one-way comparisons, made with two unrelated functions, guarantee a two-way pairing that neither function need be. The course does not prove it, and it is used here as a tool. Cardinality sets out why the definitions are the natural ones.
Pre-class quiz questions
Q2. If \(X\) and \(Y\) are sets such that \(|X| \leq |Y|\), then
| Answer | ||
|---|---|---|
| (a) | there is a bijective function \(f : X \to Y\). | No. Might have \(\lvert X\rvert < \lvert Y\rvert\). |
| (b) | there is no bijective function \(f : X \to Y\). | No. Might have \(\lvert X\rvert = \lvert Y\rvert\). |
| (c) | there is an injective function \(f : X \to Y\). | Yes. Works if \(\lvert X\rvert < \lvert Y\rvert\) and if \(\lvert X\rvert = \lvert Y\rvert\). |
| (d) | there is a surjective function \(f : X \to Y\). | No. Might have \(\lvert X\rvert < \lvert Y\rvert\). |
Q3. To show that \(|X| = |Y|\) it is sufficient to show that
| Answer | ||
|---|---|---|
| (a) | there is an injective function \(f : X \to Y\). | No. This shows \(\lvert X\rvert \leq \lvert Y\rvert\) but might have \(\lvert X\rvert < \lvert Y\rvert\). |
| (b) | there is a surjective function \(f : X \to Y\). | No. This shows \(\lvert X\rvert \geq \lvert Y\rvert\) but might have \(\lvert X\rvert > \lvert Y\rvert\). |
| (c) | there is an injective function \(f : X \to Y\) and there is a surjective function \(g : X \to Y\). | Yes. This shows \(\lvert X\rvert \leq \lvert Y\rvert\) and \(\lvert X\rvert \geq \lvert Y\rvert\), so \(\lvert X\rvert = \lvert Y\rvert\). |
| (d) | there is an injective function \(f : X \to Y\) and there is a surjective function \(g : Y \to X\). | No. This shows \(\lvert X\rvert \leq \lvert Y\rvert\) and \(\lvert Y\rvert \geq \lvert X\rvert\), so might have \(\lvert X\rvert < \lvert Y\rvert\). |
| (e) | none of the above is sufficient. |
In Q3 the surjection is \(g : X \to Y\) in (c) and \(g : Y \to X\) in (d). That one arrow is the whole difference between (c) and (d). A surjection \(Y \to X\) gives \(|Y| \geq |X|\), which is the same fact as the injection already gave, so (d) says one thing twice.
Worked: a closed interval and an open one
Prove that if \(A = [0,1]\) and \(B = (6,9)\), then \(|A| = |B|\). Recall that for \(a, b \in \mathbb{R}\), \([a,b] = \{x \in \mathbb{R} : a \leq x \leq b\}\), \((a,b) = \{x \in \mathbb{R} : a < x < b\}\).
The projection that worked for the short interval and the long one now fails. The endpoints \(0\) and \(1\) are in \(A\), and they would have to go to \(6\) and \(9\), which are not in \(B\). So the proof goes in two halves and never finds the bijection.
Show \(|A| \leq |B|\). Define \(f : A \to B\) by \(f(x) = x + 7\). If \(x \in [0,1]\) then \(x + 7 \in [7,8] \subseteq (6,9)\), so \(f\) is indeed a function from \(A\) to \(B\). Suppose \(x_1, x_2 \in [0,1]\) and \(f(x_1) = f(x_2)\); then \(x_1 + 7 = x_2 + 7\), so \(x_1 = x_2\). \(\therefore f\) is one-to-one, \(\therefore |A| \leq |B|\).
Show \(|B| \leq |A|\). Define \(g : B \to A\) by \(g(x) = \frac{x}{9}\). If \(x \in (6,9)\) then \(\frac{6}{9} < \frac{x}{9} < \frac{9}{9}\), i.e. \(g(x) \in \left(\frac{2}{3}, 1\right) \subseteq [0,1]\). Suppose \(x_1, x_2 \in (6,9)\) and \(g(x_1) = g(x_2)\); so \(\frac{x_1}{9} = \frac{x_2}{9}\), so \(x_1 = x_2\). \(\therefore g\) is one-to-one, \(\therefore |B| \leq |A|\).
\(\therefore\) By SBT \(|A| = |B|\).
Figure 9: The two injections between \(A = [0,1]\) and \(B = (6,9)\), each interval drawn at its own scale. \(f(x) = x + 7\) sends the closed interval \([0,1]\) into \((6,9)\), landing on the green band \([7,8]\). \(g(x) = x/9\) sends the open interval \((6,9)\) into \([0,1]\), landing on the purple band \((\frac{2}{3}, 1)\). Neither is onto, so neither is a bijection. Together they show \(|A| \leq |B|\) and \(|B| \leq |A|\), and the Schröder–Bernstein Theorem then guarantees that a bijection exists, without anyone having to find it.
This is how the theorem is applied. Schröder–Bernstein is for when a bijection is awkward to write down but injections both ways are easy. An injection only has to fit one set inside the other without collisions. There is no need to cover every point, and no need to worry about which endpoints are open. A bijection from \([0,1]\) to \((6,9)\) does exist, but it has to do something awkward at the endpoints. One way: send \(0 \mapsto \frac12\), \(1 \mapsto \frac13\) and \(\frac1n \mapsto \frac1{n+2}\) for \(n \geq 2\), fix every other point, and then apply \(x \mapsto 3x + 6\). The first step is a bijection from \([0,1]\) to \((0,1)\): the sequence \(\frac12, \frac13, \frac14, \dots\) moves two places along to make room for the endpoints, the Hilbert’s Hotel trick. That construction is not needed for the course.
Worked: \(\mathbb{Z}^{+} \times \mathbb{Z}^{+}\) is countable
(a) Show that the function \(f : \mathbb{Z}^{+} \times \mathbb{Z}^{+} \to \mathbb{Z}^{+}\) defined by \(f((a,b)) = 2^a \cdot 4^b\) is not one-to-one.
Consider \((3,1)\) and \((1,2)\) in \(\mathbb{Z}^{+} \times \mathbb{Z}^{+}\). \(f((3,1)) = 2^3 \cdot 4^1 = 32\) and \(f((1,2)) = 2^1 \cdot 4^2 = 32\), so \(f((3,1)) = f((1,2))\) but \((3,1) \neq (1,2)\), so \(f\) is not one-to-one.
(b) Show that the function \(f : \mathbb{Z}^{+} \times \mathbb{Z}^{+} \to \mathbb{Z}^{+}\) defined by \(f((a,b)) = 3^a \cdot 5^b\) is one-to-one.
Let \((a,b), (c,d) \in \mathbb{Z}^{+} \times \mathbb{Z}^{+}\) and suppose \(f((a,b)) = f((c,d))\). Then \(3^a 5^b = 3^c 5^d\). By the unique prime factorisation theorem, we have \(a = c\) and \(b = d\). Hence \((a,b) = (c,d)\). So \(f\) is one-to-one.
Figure 10: Why \(2^a \cdot 4^b\) collides and \(3^a \cdot 5^b\) does not, on the pairs with \(a \leq 5\) and \(b \leq 3\). Left: \(2^a 4^b = 2^{a+2b}\) depends only on \(a + 2b\), so every pair on one dashed line gets the same value — \((3,1)\) and \((1,2)\) both give \(2^5 = 32\). Right: \(3^a 5^b\) keeps the two exponents on different primes, and unique factorisation reads both back off the product, so every pair gets its own value.
- is the negation of one-to-one, so it needs one witness pair. One way to find it is \(2^a \cdot 4^b = 2^{a + 2b}\): any two pairs with the same \(a + 2b\) collide. (b) is the universal statement, so it is a general argument from \(f((a,b)) = f((c,d))\), and the unique factorisation theorem does all the work. 4 is a power of 2, so both exponents land on the same prime, and that is the whole reason (a) fails.
(c) Show that the set \(\mathbb{Z}^{+} \times \mathbb{Z}^{+}\) is countable. (Hint: Find an injective function \(f : \mathbb{Z}^{+} \times \mathbb{Z}^{+} \to \mathbb{Z}^{+}\) and an injective function \(g : \mathbb{Z}^{+} \to \mathbb{Z}^{+} \times \mathbb{Z}^{+}\), and apply the Schröder–Bernstein Theorem.) — Not assessed
Proof. By part (b), we have an injective function from \(\mathbb{Z}^{+} \times \mathbb{Z}^{+}\) to \(\mathbb{Z}^{+}\), so \(|\mathbb{Z}^{+} \times \mathbb{Z}^{+}| \leq |\mathbb{Z}^{+}|\).
Consider \(g : \mathbb{Z}^{+} \to \mathbb{Z}^{+} \times \mathbb{Z}^{+}\) defined by \(g(n) = (n,1)\). We can see that \(g\) is a function since for every \(n \in \mathbb{Z}^{+}\) we have \((n,1) \in \mathbb{Z}^{+} \times \mathbb{Z}^{+}\) and each \(n \in \mathbb{Z}^{+}\) maps to a unique element of \(\mathbb{Z}^{+} \times \mathbb{Z}^{+}\).
Suppose \(n_1, n_2 \in \mathbb{Z}^{+}\) and \(g(n_1) = g(n_2)\). Then \((n_1, 1) = (n_2, 1)\) so \(n_1 = n_2\). Hence, \(g\) is injective, and so \(|\mathbb{Z}^{+}| \leq |\mathbb{Z}^{+} \times \mathbb{Z}^{+}|\).
Therefore, by the Schröder–Bernstein Theorem \(|\mathbb{Z}^{+}| = |\mathbb{Z}^{+} \times \mathbb{Z}^{+}|\).
The triple product \(\mathbb{Z}^{+} \times \mathbb{Z}^{+} \times \mathbb{Z}^{+}\) goes the same way with \((a,b,c) \mapsto 2^a 3^b 5^c\) and \(n \mapsto (n,1,1)\). Compare the spiral in 2026-09-14-cardinalities. That was a bijection that had to be drawn and checked; this is two one-line injections and a theorem.
What is assessed. Lecture 22 flags only the \(\mathbb{R}\)-is-uncountable proof and part (c) above as not assessed. The course practice set says of its whole §28 (countable and uncountable sets) that “this content will not be assessed in MATH1061”. The two draw the line in different places. Check with the course before relying on either.
See also
- countable-and-uncountable-sets — the definitions, lists, the diagonal argument, and the hierarchy
- [cardinality] — \(\leq\) by injection, \(\geq\) by surjection, and the Schröder–Bernstein Theorem
- divisibility-and-factorisation — what makes \(3^a 5^b\) one-to-one
- 2026-09-14-cardinalities — Lecture 21 · 2026-09-17-relations-reflexivity-symmetry-transitivity — Lecture 23
- practice-problems — §28, with full worked solutions
Lecture 23 — Relations on Sets; Reflexivity, Symmetry and Transitivity
Pre-work: Video 029 (Relations on sets) and Video 030 (Reflexivity, Symmetry and Transitivity). The reference notes are relations-on-sets for what a relation is and how to draw one, and reflexive-symmetric-and-transitive-relations for the three properties and how to prove or disprove them. A relation is a generalised function, so functions-on-general-sets is the starting point.
Learning goals
- Understand binary relations on sets.
- Know how to draw and interpret an arrow diagram (a “directed graph”) for a relation.
- Understand what it means for a relation to be reflexive, symmetric or transitive.
- Know how to prove or disprove that a relation is reflexive, symmetric or transitive.
One relation can be drawn two ways. First as two ellipses, both labelled \(A\), holding \(1, 2, 3, 4\), with arrows \(1 \to 1\), \(3 \to 3\), \(4 \to 1\), \(4 \to 3\), \(4 \to 4\). Then as a single set of four dots, with a loop at 1, 3 and 4, an arrow from 4 to 1 and from 4 to 3, and 2 on its own. Both are drawn as Figure 12 below.
Two questions to start with
The distinction between functions and relations (Q2 from video 29). Every function is a relation. A relation is not necessarily a function.
The definitions of reflexive, symmetric and transitive (Q1, Q2 and Q3 from video 30). The three questions are answered after the definitions.
Functions, then relations
Start from the definition of a function as a set of pairs (functions-on-general-sets). It has two conditions, for each \(a \in A\) and unique:
A subset \(f\) of \(A \times B\) is a function from a set \(A\) to a set \(B\) if for each \(a \in A\), there is a unique \(b \in B\) such that \((a,b) \in f\). \[f(a) = b \leftrightarrow (a,b) \in f, \qquad f = \{(1,0),(2,2),(3,4),(4,4)\}, \qquad f(1) = 0;\ f(2) = 2;\ f(3) = 4;\ f(4) = 4.\]
A relation drops both conditions:
Any subset \(\rho\) of \(A \times B\) is a binary relation from \(A\) to \(B\). \[\rho = \{(1,0),(3,4),(4,0),(4,4),(4,6)\}, \qquad 1 \mathrel{\rho} 0;\ 3 \mathrel{\rho} 4;\ 4 \mathrel{\rho} 0;\ 4 \mathrel{\rho} 4;\ 4 \mathrel{\rho} 6.\]
A relation on a set \(A\) is a binary relation from \(A\) to \(A\).
A relation \(\rho\) on \(A\) is often defined by a condition such as: \(x \mathrel{\rho} y \leftrightarrow x > y\) for all \(x, y \in A\), \(\quad X \mathrel{\rho} Y \leftrightarrow X \cap Y = \emptyset\) for all \(X, Y \in A\), \(\quad m \mathrel{\rho} n \leftrightarrow 6\) divides \(m - n\) for all \(m, n \in A\).
Reading the notation:
- \((1,0) \in \rho\) means the same as \(1 \mathrel{\rho} 0\), read “1 is related in \(\rho\) to 0”. The 1 of \((1,0)\) comes from the domain and the 0 from the co-domain. The first coordinate is where the arrow starts.
- \(\rho\) “rho”, \(\sigma\) “sigma”, \(\tau\) “tau” — the Greek letters relations are named with, as \(f, g, h\) are for functions.
- The one-set drawing of a relation on \(A\) uses a single copy of \(A\).
Figure 11: The same two sets, a function and a relation. Left: in the function \(f\) every element of \(A\) has exactly one arrow leaving it — that is the whole definition. Right: in the relation \(\rho\) there is no rule at all. 2 has no arrow, 4 has three, and 0 and 4 in \(B\) are each hit twice. Every function is a relation, the special kind with one arrow per element of the domain; a relation is just any set of arrows.
Figure 12: One relation on \(A = {1,2,3,4}\), \(\rho = {(1,1),(3,3),(4,1),(4,3),(4,4)}\), in its two drawings. Left: two copies of \(A\) with arrows from the left copy to the right, as for a function. Right: a single copy of \(A\), the directed graph. Each arrow keeps its start and end, and an arrow from an element to itself becomes a loop. The single-copy drawing is the one to use for a relation on one set, because the three properties below are all about loops, return arrows and short cuts, and those only show up when each element is drawn once.
Reflexivity, symmetry and transitivity
A relation \(\rho\) on a set \(A\) is
(1) reflexive if and only if \(\forall x \in A,\ x \mathrel{\rho} x\).
(2) symmetric if and only if \(\forall x, y \in A,\ x \mathrel{\rho} y \to y \mathrel{\rho} x\).
(3) transitive if and only if \(\forall x, y, z \in A,\ (x \mathrel{\rho} y \text{ and } y \mathrel{\rho} z) \to x \mathrel{\rho} z\).
Each definition has a picture:
| Picture | In symbols | |
|---|---|---|
| reflexive | a loop at \(a\) | \(\forall a \in A,\ a \mathrel{\rho} a\) |
| symmetric | \(a \to b\) above, \(b \to a\) below | \(\forall a, b \in A,\ a \mathrel{\rho} b \to b \mathrel{\rho} a\) |
| transitive | \(a \to b \to c\) along the top, and \(a \to c\) underneath | \(\forall a, b, c \in A,\ a \mathrel{\rho} b \text{ and } b \mathrel{\rho} c \to a \mathrel{\rho} c\) |
Three points about the transitive definition:
- Could have \(x = z\). \(x, y, z\) are any elements of \(A\), not three different ones, so the transitive condition applies with \(z = x\).
- That gives if \(x \mathrel{\rho} y\) and \(y \mathrel{\rho} x\) then \(x \mathrel{\rho} x\), with the weight on the if. Transitivity applied to \(x \to y \to x\) demands the short cut from \(x\) to \(x\), a loop.
- In a transitive relation a two-way pair \(x \rightleftarrows y\) forces loops at both ends (\(y \to x \to y\) gives \(y \mathrel{\rho} y\) as well). So \(x \rightleftarrows y\) with no loops is, on its own, not transitive.
This observation is behind the transitivity counterexamples for disjoint sets (the first one), Diagram 1 and the relation mod 7, and behind the extra hypothesis in the last worked question. It is drawn as Figure 16.
Worked: proper subset on a power set
Questions 1, 2 and 3 from video 30.
Let \(S = \{1,2,3\}\) and consider the relation \(\rho\) defined on the power set of \(S\), \(\mathcal{P}(S)\), by \(X \mathrel{\rho} Y\) if and only if \(X \subset Y\), for all \(X, Y \in \mathcal{P}(S)\).
Q1. True or False: the relation \(\rho\) is reflexive. — False Q2. True or False: the relation \(\rho\) is symmetric. — False Q3. True or False: the relation \(\rho\) is transitive. — True
The reasons for Q2 and Q3: \(X \subset Y \nRightarrow Y \subset X\), and \(X \subset Y\) and \(Y \subset Z \to X \subset Z\) ✓. The power set is \(\mathcal{P}(S) = \{\emptyset, \{1\}, \{2\}, \{3\}, \{1,2\}, \{1,3\}, \{2,3\}, \{1,2,3\}\}\), eight sets. The arrow diagram has a dot for each, with arrows from \(\emptyset\) to all seven other sets, then \(\{1\} \to \{1,2\}\), \(\{1\} \to \{1,2,3\}\) and \(\{1,2\} \to \{1,2,3\}\), and so on: 19 arrows in total.
\(\subset\) is proper subset in this course (sets-and-set-notation), and that is what makes Q1 false. \(X \subset X\) is never true, so there is not a single loop. With \(\subseteq\) instead, Q1 would be true and there would be 27 arrows, the 19 plus a loop at each of the 8 sets. Q2 is false with one witness, \(\emptyset \subset \{1\}\) but \(\{1\} \not\subset \emptyset\).
Figure 13: The relation \(X \subset Y\) on \(\mathcal{P}({1,2,3})\) in full, with the sets in layers by size. Blue arrows add one element (12 of them), orange arrows add two (6), and the green arrow adds all three (1): 19 in total. There are no loops, since no set is a proper subset of itself, so the relation is not reflexive. Every arrow points upward and none comes back, so it is not symmetric. Every two-step path has its one-step short cut — the orange and green arrows are exactly those short cuts — so it is transitive.
Worked: disjoint sets
Let \(\rho\) be the relation on \(\mathcal{P}(\mathbb{Z}^{+})\) defined by \(X \mathrel{\rho} Y \leftrightarrow X \cap Y = \emptyset\).
Is \(\rho\) reflexive? \(X \cap X = X\). E.g. \(\{1,2\} \cap \{1,2\} = \{1,2\} \neq \emptyset\), so \(X \mathrel{\not\rho} X\). \(\rho\) is NOT reflexive.
Is \(\rho\) symmetric? Yes. \(X \cap Y = Y \cap X\), so \(\forall X, Y \in \mathcal{P}(\mathbb{Z}^{+})\), if \(X \mathrel{\rho} Y\) then \(Y \mathrel{\rho} X\).
Is \(\rho\) transitive? \(X = \{1\}\), \(Y = \{2\}\), \(Z = \{1\}\): here \(X \mathrel{\rho} Y\) and \(Y \mathrel{\rho} Z\) but \(X \mathrel{\not\rho} Z\). Not transitive. \(X = \{1,2\}\), \(Y = \{3,4\}\), \(Z = \{1,5\}\) also shows not transitive.
The reflexive definition starts \(\forall a \in A\). That quantifier is why one example settles the question. Reflexive is a “for all”, so it fails as soon as one element lacks its loop, even though some elements have one: \(\emptyset \cap \emptyset = \emptyset\), so \(\emptyset \mathrel{\rho} \emptyset\). The first transitivity counterexample uses \(Z = X\), the could have \(x = z\) case: \(\{1\}\) and \(\{2\}\) are related both ways, so transitivity would force \(\{1\} \mathrel{\rho} \{1\}\), which is false. The second shows the same failure with three different sets.
Worked: reading the properties off Diagram 1
Let \(\rho\) be the relation defined by the arrow diagram in Diagram 1.
Diagram 1 has four points \(a, b, c, d\). The arrows are a loop at \(a\), both \(a \to b\) and \(b \to a\), then \(a \to c\), \(a \to d\), \(b \to c\), \(b \to d\), \(c \to d\), and a loop at \(d\). As a set, \[\rho = \{(a,a), (a,b), (b,a), (a,c), (a,d), (b,c), (b,d), (c,d), (d,d)\}.\]
Is \(\rho\) reflexive? No. E.g. \(b \mathrel{\not\rho} b\), or \((b,b) \notin \rho\). Either notation is fine.
Is \(\rho\) symmetric? No. We have \(b \mathrel{\rho} c\) but \(c \mathrel{\not\rho} b\).
Is \(\rho\) transitive? No. We have \(b \mathrel{\rho} a\) and \(a \mathrel{\rho} b\) but \(b \mathrel{\not\rho} b\).
What is missing for each property:
- To make \(\rho\) reflexive: add \((b,b)\) and \((c,c)\).
- To make \(\rho\) symmetric: add \((c,a)\), \((d,a)\), \((c,b)\), \((d,c)\), \((d,b)\).
- To make \(\rho\) transitive: add \((b,b)\).
The three definitions each start with a quantifier, \(\forall a\), \(\forall a, b\) and \(\forall a, b, c\). Each “no” needs only the specific elements that break it.
Figure 14: Diagram 1 and what each property would need added, dashed in green. Reflexive: the two missing loops, at \(b\) and \(c\). Symmetric: a return arrow for each of the five one-way arrows. Transitive: only the loop at \(b\), forced by the round trip \(b \to a \to b\) — every other two-step path, such as \(a \to c \to d\) or \(b \to a \to d\), already has its short cut. The transitivity check is the slow one: it means looking at every two-step path, not just at pairs of points.
Worked: an arrow diagram mod 7
Draw an arrow diagram for the relation \(\rho\) on \(\{0,1,2,3,4,5,6\}\) defined by \(x \mathrel{\rho} y\) if and only if \(xy \equiv 1 \pmod 7\).
Working: numbers \(\equiv 1 \pmod 7\) are \(1, 8, 15, 22, 29, 36, \dots\). \(0 \cdot y \not\equiv 1 \pmod 7\), so 0 is related to nothing. \(1 \cdot y \equiv 1 \pmod 7\) (so 1 is related only to 1). The diagram has 0 on its own, loops at 1 and 6, arrows both ways between 2 and 4, and both ways between 3 and 5.
Is \(\rho\) reflexive? No, e.g. \(5 \mathrel{\not\rho} 5\).
Is \(\rho\) symmetric? Yes.
Is \(\rho\) transitive? No. For example \(2 \mathrel{\rho} 4\) and \(4 \mathrel{\rho} 2\) but \(2 \mathrel{\not\rho} 2\).
Figure 15: The relation \(xy \equiv 1 \pmod 7\) on \({0, 1, \dots, 6}\). The products that leave remainder 1 are \(1 \cdot 1 = 1\), \(2 \cdot 4 = 8\), \(3 \cdot 5 = 15\) and \(6 \cdot 6 = 36\). Each non-zero number is related to exactly one partner, the number it multiplies with to give 1, and 0 to nothing. Symmetric, because \(xy = yx\). Not reflexive: only 1 and 6 have loops. Not transitive: \(2 \to 4 \to 2\) would need a loop at 2.
Worked: symmetric and transitive, but not reflexive
Prove or disprove the following statement. If a relation \(\rho\) on a set \(A\) is both symmetric and transitive, then \(\rho\) is reflexive.
The statement is false. E.g. \(A = \{1,2\}\), \(\rho = \{(1,1)\}\). The diagram is a loop at 1, and 2 on its own.
\(\rho\) is symmetric and transitive but NOT reflexive (since \(2 \mathrel{\not\rho} 2\)).
- symmetric: \(\forall a, b \in A\) if \(a \mathrel{\rho} b\) then \(b \mathrel{\rho} a\) ✓
- transitive: \(\forall a, b, c \in A\) if \(a \mathrel{\rho} b\) and \(b \mathrel{\rho} c\) then \(a \mathrel{\rho} c\) ✓
The if is the point of the counterexample. Symmetry and transitivity are conditional. They say what must happen if some arrows are present, and they are satisfied without argument wherever those arrows are absent. The only arrow in \(\rho\) is the loop \((1,1)\). Its “return arrow” and its “short cut” are the same loop, so both conditions hold. Element 2 has no arrows at all, so neither condition ever mentions it, and nothing forces a loop there.
One more hypothesis repairs it:
If we also knew that for each \(x \in A\), \(x \mathrel{\rho} y\) for some \(y \in A\), then the statement becomes true.
With that extra hypothesis, take any \(x\). It has an arrow to some \(y\). Symmetry gives the arrow back, and transitivity on \(x \to y \to x\) gives the loop at \(x\). The picture is \(x \rightleftarrows y\) with a loop at each end. This is the if \(x \mathrel{\rho} y\) and \(y \mathrel{\rho} x\) then \(x \mathrel{\rho} x\) observation from the definitions above, and it is the proof that people write without the extra hypothesis. The step “take a \(y\) with \(x \mathrel{\rho} y\)” is exactly where it breaks, because such a \(y\) need not exist.
Figure 16: Why symmetric and transitive do not make a relation reflexive, and what would. Left: \(\rho = {(1,1)}\) on \({1, 2}\) is symmetric and transitive but not reflexive; 2 has no arrows, so neither condition ever says anything about it. Right: once \(x\) has an arrow to some \(y\), symmetry supplies \(y \to x\), and transitivity along \(x \to y \to x\) forces the loop at \(x\) (and along \(y \to x \to y\), the loop at \(y\)). The forced arrows are dashed. The loop depends on \(x\) being related to something.
See also
- relations-on-sets — relations as sets of pairs, the notation \(x \mathrel{\rho} y\), and the two ways to draw one
- reflexive-symmetric-and-transitive-relations — the three properties, their pictures, and how to prove and disprove each
- functions-on-general-sets — functions as the special relations with one arrow out of each element
- 2026-09-15-countable-and-uncountable-sets — Lecture 22 · 2026-09-21-equivalence-relations — Lecture 24
- practice-problems — §29 · practice-problems — §30, with full worked solutions
Reference material
Cardinality
What it means for two sets to be the same size, and how to compare the sizes of sets that are infinite. It all comes down to functions: same size means there is a bijection, and no bigger means there is an injection. The one-to-one, onto and bijection machinery is in one-to-one-and-onto-functions. Which infinite sets can be listed, and which cannot, is in countable-and-uncountable-sets. The lectures are 2026-09-14-cardinalities and 2026-09-15-countable-and-uncountable-sets.
Same size means a bijection
Any two sets have the same cardinality if and only if there is a bijection between them. If the sets \(A\) and \(B\) have the same cardinality, then we write \(|A| = |B|\).
This is a definition, and it is the same idea as counting. Counting a finite set means pairing its elements off with \(1, 2, \dots, n\), so “\(A\) has \(n\) elements” says \(|A| = |\{1, 2, \dots, n\}|\). For finite sets the definition therefore agrees with counting:
Any two finite sets have the same number of elements if and only if there is a bijection between them.
The definition drops only the requirement that the pairing stop. That is what makes it work for infinite sets, and also what makes it surprising there.
Because bijections can be inverted and composed (inverse-functions, composition-of-functions), “same cardinality” behaves like equality. Every set has the same cardinality as itself (the identity). If \(|A| = |B|\) then \(|B| = |A|\) (the inverse). If \(|A| = |B|\) and \(|B| = |C|\) then \(|A| = |C|\) (the composite). That is what lets results be chained, as in \(|\mathbb{Z}^{+}| = |\mathbb{Z}| = |\mathbb{Q}|\).
Finite sets
For finite sets \(A\) and \(B\):
- If \(A\) has more elements than \(B\), there is no one-to-one function \(f : A \to B\).
- If \(A\) has fewer elements than \(B\), there is no onto function \(f : A \to B\).
- If \(A\) and \(B\) have the same number of elements, then any function \(f : A \to B\) is one-to-one if and only if it is onto.
- When \(A\) and \(B\) have the same number of elements there can still be functions from \(A\) to \(B\) that are neither.
Figure 17: The four facts about finite sets, each with the counting reason. (1) With more elements in \(A\) than in \(B\), the arrows run out of fresh targets: once every dot of \(B\) is used, the next arrow must share one. (2) With fewer elements in \(A\), there are not enough arrows to reach every dot of \(B\). (3) With equal numbers, merging two arrows is the same thing as missing a target, so one-to-one and onto stand or fall together. (4) Equal numbers do not force either property, only their agreement: this function merges two arrows and so misses one dot.
Fact 1 is the pigeonhole principle in function form, a name the course reaches later in the semester (pigeonhole-principle). Fact 3 is the useful one in practice. Between two finite sets of the same size, checking one of one-to-one and onto is enough.
Fact 3 is false for infinite sets. On \(\mathbb{Z}^{+}\):
- \(f(n) = 2n\) is one-to-one but not onto (nothing maps to 1);
- \(g(n) = \lceil n/2 \rceil\) is onto but not one-to-one (\(g(1) = g(2) = 1\)).
Both go from a set to itself, so the two sides certainly have the same cardinality. For infinite sets one-to-one and onto have to be checked separately, every time.
Infinite sets break the finite intuition
For finite sets a proper subset is always strictly smaller. For infinite sets it need not be:
| Set | Proper subset | Bijection |
|---|---|---|
| \(\mathbb{Z}^{+}\) | \(2\mathbb{Z}^{+}\) (even positive integers) | \(n \mapsto 2n\) |
| \(\mathbb{Z}^{+}\) | \(\mathbb{Z}^{+} - \{1\}\) | \(n \mapsto n + 1\) |
| \(\mathbb{Z}\) | \(\{n \in \mathbb{Z} : n \bmod 3 = 1\}\) | \(n \mapsto 3n + 1\) |
Sets that look very different in size can match up too. \(\mathbb{Z}^{+}\) pairs off with all of \(\mathbb{Z} \times \mathbb{Z}\) along a spiral (2026-09-14-cardinalities), and the short interval \([0,1]\) with the long interval \([6,9]\) by projection (2026-09-15-countable-and-uncountable-sets).
This is the point of Hilbert’s Hotel (2026-09-14-cardinalities). A full hotel with infinitely many rooms can take one more guest, or a busload, or infinitely many busloads, by moving everyone, because \(\mathbb{Z}^{+}\) can be put in one-to-one correspondence with a proper part of itself.
“Clearly \(|\mathbb{Q}| > |\mathbb{Z}| > |\mathbb{Z}^{+}|\)” is the containment intuition applied where it no longer holds. Containment gives \(\leq\) (the inclusion map is an injection, see below), never automatically \(<\).
Beyond the course: this property characterises infinite sets. A set is infinite exactly when it has the same cardinality as some proper subset of itself.
Proving \(|X| = |Y|\)
The template, used in 2026-09-14-cardinalities:
One way to show \(|X| = |Y|\) for sets \(X\) and \(Y\):
- Define a function \(f : X \to Y\) and explain why it is a function (each element of \(X\) has a unique image in \(Y\)).
- Show \(f\) is one-to-one (injective).
- Show \(f\) is onto (surjective).
Step 1 is where most of the real checking happens. \(f(x)\) has to land in \(Y\), not merely somewhere. In step 3 the preimage you construct has to be in \(X\). Both are range checks, and both use the definitions of \(X\) and \(Y\).
Worked: \(|\mathbb{Z}^{+}| = |\mathbb{Z}|\)
The listing \(0, 1, -1, 2, -2, 3, -3, \dots\) (drawn in countable-and-uncountable-sets) as a formula:
\[f : \mathbb{Z}^{+} \to \mathbb{Z}, \qquad f(n) = \begin{cases} \dfrac{n}{2} & n \text{ even,} \\[6pt] -\dfrac{n-1}{2} & n \text{ odd.} \end{cases}\]
It is a function into \(\mathbb{Z}\). Every \(n \in \mathbb{Z}^{+}\) is even or odd, not both, so exactly one case applies. If \(n\) is even, \(\frac{n}{2} \in \mathbb{Z}\). If \(n\) is odd, \(n - 1\) is even and \(-\frac{n-1}{2} \in \mathbb{Z}\).
One-to-one. Suppose \(f(n_1) = f(n_2)\). The even case gives values \(\geq 1\), and the odd case gives values \(\leq 0\), so \(n_1\) and \(n_2\) fall in the same case. If both are even, \(\frac{n_1}{2} = \frac{n_2}{2}\) gives \(n_1 = n_2\). If both are odd, \(-\frac{n_1 - 1}{2} = -\frac{n_2 - 1}{2}\) gives \(n_1 = n_2\).
Onto. Let \(m \in \mathbb{Z}\). If \(m \geq 1\), take \(n = 2m\), a positive even integer, and \(f(2m) = m\). If \(m \leq 0\), take \(n = 1 - 2m\), a positive odd integer, and \(f(1 - 2m) = -\frac{(1-2m)-1}{2} = m\).
So \(f\) is a bijection and \(|\mathbb{Z}^{+}| = |\mathbb{Z}|\). \(\square\)
The case split in the one-to-one step is the part to notice. With a function defined by cases, first show the two inputs must be in the same case, here by comparing the values each case can produce. Then argue within the case.
Comparing sizes: injections and surjections
For any sets \(A\) and \(B\):
\(|A| \leq |B| \leftrightarrow \exists\) injective \(f : A \to B\).
\(|A| \geq |B| \leftrightarrow \exists\) surjective \(f : A \to B\).
\(|A| < |B| \leftrightarrow \exists\) injective \(f : A \to B\) but \(\nexists\) bijective \(f : A \to B\).
\(|A| > |B| \leftrightarrow \exists\) surjective \(f : A \to B\) but \(\nexists\) bijective \(f : A \to B\).
Both definitions are the finite facts turned round. An injection fits \(A\) inside \(B\) without collisions, so \(B\) has at least as much room. A surjection covers \(B\) using \(A\), so \(A\) has at least as much to spend. The functions witnessing \(\leq\) and \(\geq\) need not be the same function, and usually are not.
Figure 18: The three comparisons as functions. Left: an injection fits \(A\) inside \(B\) with no collisions, so \(|A| \leq |B|\); some of \(B\) may be left over. Middle: a surjection covers all of \(B\) using \(A\), so \(|A| \geq |B|\); arrows may double up. Right: an injection each way, \(f : A \to B\) and a different \(g : B \to A\). Neither need be onto, but by the Schröder–Bernstein Theorem together they guarantee that some bijection exists, so \(|A| = |B|\).
(The rightmost panel is drawn with finite sets only to show the shape of the argument. For finite sets an injection each way already forces equal sizes by counting. The theorem is needed, and is surprising, only for infinite sets.)
Two consequences used all the time:
- A subset is never bigger. If \(A \subseteq B\) then \(|A| \leq |B|\), by the inclusion map \(a \mapsto a\), which is injective. This is all that “\(\mathbb{Z}^{+} \subset \mathbb{Q}\)” proves about sizes.
- A list of things is never bigger than \(\mathbb{Z}^{+}\). If \(x_1, x_2, x_3, \dots\) is any sequence, then \(i \mapsto x_i\) is onto the set \(\{x_1, x_2, x_3, \dots\}\), so that set has cardinality \(\leq |\mathbb{Z}^{+}|\). The set is countable, whether or not the sequence repeats (2026-09-15-countable-and-uncountable-sets).
Beyond the course: the surjection definition of \(\geq\) needs one exception. There is no function at all from a non-empty set to \(\emptyset\), so \(|A| \geq |\emptyset|\) has no surjection behind it, yet it is plainly true. Read the surjection definition as being about non-empty \(B\).
The Schröder–Bernstein Theorem
The Schröder–Bernstein Theorem. For all sets \(A\) and \(B\), if \(|A| \leq |B|\) and \(|A| \geq |B|\), then \(|A| = |B|\).
It is on the formula sheet (formula-sheet). In practice it is used in this form:
To show \(|A| = |B|\), instead of finding a bijection from \(A\) to \(B\), you can find a function that shows \(|A| \leq |B|\) and a different function that shows \(|B| \leq |A|\).
That is, one injection each way. The two injections do not have to fit together, and neither has to be onto. It is the right tool when a bijection would be fiddly, typically because of endpoints or because the sets are built differently.
Worked: \(|[0,1)| = |[0,1]|\)
A bijection between these two exists but has to do something awkward to make room for the extra endpoint. Two injections are easy:
- \(f : [0,1) \to [0,1]\), \(f(x) = x\). It lands in \([0,1]\) because \([0,1) \subseteq [0,1]\), and it is one-to-one because \(f(x_1) = f(x_2)\) says \(x_1 = x_2\). So \(|[0,1)| \leq |[0,1]|\).
- \(g : [0,1] \to [0,1)\), \(g(x) = \frac{x}{2}\). If \(0 \leq x \leq 1\) then \(0 \leq \frac{x}{2} \leq \frac{1}{2} < 1\), so it lands in \([0,1)\). \(\frac{x_1}{2} = \frac{x_2}{2}\) gives \(x_1 = x_2\). So \(|[0,1]| \leq |[0,1)|\).
By the Schröder–Bernstein Theorem, \(|[0,1)| = |[0,1]|\). \(\square\)
Same shape as the proof that \(|[0,1]| = |(6,9)|\) (2026-09-15-countable-and-uncountable-sets), and as the proof that \(\mathbb{Z}^{+} \times \mathbb{Z}^{+}\) is countable, which uses the injections \((a,b) \mapsto 3^a 5^b\) and \(n \mapsto (n,1)\).
The direction trap
Both inequalities must be about the same pair in opposite directions. The trap is in the directions:
- an injection \(X \to Y\) and a surjection \(X \to Y\) — gives \(|X| \leq |Y|\) and \(|X| \geq |Y|\), sufficient;
- an injection \(X \to Y\) and a surjection \(Y \to X\) — gives \(|X| \leq |Y|\) and \(|Y| \geq |X|\), the same fact twice, not sufficient.
Before invoking the theorem, write out the two inequalities the functions give and check that one is \(\leq\) and the other is \(\geq\) between the same two sets in the same order.
Common mistakes
- Reading size off containment. \(A \subsetneq B\) proves \(|A| \leq |B|\), never \(|A| < |B|\), when the sets are infinite.
- Skipping the range check. A formula is not a function into \(Y\) until you have shown every value lies in \(Y\) — \(3n + 1 \in S\), \(6 \leq 3x + 6 \leq 9\).
- Proving only one of one-to-one and onto. Enough for finite sets of equal size (fact 3), never enough for infinite ones.
- Using Schröder–Bernstein with the arrows the wrong way round. See the direction trap above.
- Proving a set is not the same size by failing to find a bijection. Not finding one proves nothing. That \(\mathbb{R}\) is not the size of \(\mathbb{Z}^{+}\) takes an argument that no list can work, the diagonal argument in countable-and-uncountable-sets.
See also
- countable-and-uncountable-sets — finite, countable and uncountable sets; listing arguments; the diagonal argument
- one-to-one-and-onto-functions — the definitions and proof templates every argument here uses
- inverse-functions · composition-of-functions — why “same cardinality” chains like equality
- formula-sheet — the Schröder–Bernstein Theorem as printed on the exam formula page
- counting-principles — counting finite sets without listing them, by the multiplication and addition rules
- pigeonhole-principle — fact 1 put to work: choosing the pigeons and the holes to prove that two chosen things must coincide
- 2026-09-14-cardinalities — Lecture 21 · 2026-09-15-countable-and-uncountable-sets — Lecture 22
- practice-problems — §27, with full worked solutions
Composition of Functions
Chaining two functions into one, and which properties survive the chaining — in both directions. First met in 2026-09-08-composition-of-functions; the properties are defined in one-to-one-and-onto-functions and inverse-functions.
Definition
Let \(f : X \to Y\) and \(g : Y \to Z\) be functions. The composition of \(f\) and \(g\) is the function \(g \circ f : X \to Z\) defined by \[(g \circ f)(x) = g(f(x)) \quad\text{for all } x \in X.\]
Three things to read off the definition:
- Right to left. \(g \circ f\) applies \(f\) first, then \(g\). The order of the symbols matches the formula \(g(f(x))\), not the order of events.
- The domain of \(g \circ f\) is the domain of \(f\); the co-domain is the co-domain of \(g\). The middle set \(Y\) vanishes from the type.
- It is defined only when \(f\)’s co-domain is \(g\)’s domain. \(g \circ f\) makes sense because \(f\) lands in \(Y\) and \(g\) eats \(Y\). The other composite, \(f \circ g\), would need \(g\)’s outputs (in \(Z\)) to be inputs to \(f\) (from \(X\)), so it exists only if \(Z = X\).
Figure 19: Why \(g \circ f\) exists and \(f \circ g\) usually does not. Top: \(f\) then \(g\) chains because \(f\) lands exactly where \(g\) starts. Bottom: \(g\) then \(f\) would need \(g\)’s outputs, in \(Z\), to be acceptable inputs to \(f\), which come from \(X\) — so it is defined only if \(Z = X\).
The composition itself is drawn in 2026-09-08-composition-of-functions: three ellipses, \(x \mapsto f(x) \mapsto g(f(x))\), with the long arrow \(g \circ f\) beneath.
Composition is not commutative. Even when both orders exist (\(X = Y = Z\)), \(g \circ f\) and \(f \circ g\) are generally different functions: with \(f(x) = x + 1\) and \(g(x) = 2x\) on \(\mathbb{R}\), \((g \circ f)(x) = 2x + 2\) but \((f \circ g)(x) = 2x + 1\).
Inverses and composition
For a bijection \(f : X \to Y\) with inverse \(f^{-1} : Y \to X\) (inverse-functions), both composites exist and both do nothing:
\[(f^{-1} \circ f)(x) = x \text{ for all } x \in X, \qquad (f \circ f^{-1})(y) = y \text{ for all } y \in Y.\]
This is the sense check on a computed inverse: for \(f((x,y)) = (y+1, 2x)\) and the claimed \(f^{-1}((x,y)) = \left(\frac{y}{2}, x - 1\right)\), \[f\!\left(f^{-1}((x,y))\right) = f\!\left(\left(\tfrac{y}{2}, x-1\right)\right) = (x, y). \;\checkmark\]
Which properties compose
Two facts:
If \(f\) and \(g\) are both onto, then \(g \circ f\) is onto. If \(f\) and \(g\) are both one-to-one, then \(g \circ f\) is one-to-one.
So both bijective gives \(g \circ f\) bijective. The proofs are short:
- Onto. Let \(z \in Z\). Since \(g\) is onto, \(\exists\, y \in Y\) with \(g(y) = z\). Since \(f\) is onto, \(\exists\, x \in X\) with \(f(x) = y\). Then \(g(f(x)) = z\). \(\square\)
- One-to-one. Suppose \(g(f(x_1)) = g(f(x_2))\). Since \(g\) is one-to-one, \(f(x_1) = f(x_2)\). Since \(f\) is one-to-one, \(x_1 = x_2\). \(\square\)
Which properties come back
The converse asks which ingredient must have a property when the composite has it. The answer is asymmetric:
| If \(g \circ f\) is … | then \(f\) must be … | then \(g\) must be … |
|---|---|---|
| onto | not necessarily | onto |
| one-to-one | one-to-one | not necessarily |
The property comes back to the function on its own side. Onto is about covering \(Z\), and \(g\) is the function that lands in \(Z\). One-to-one is about not merging elements of \(X\), and \(f\) is the function that leaves \(X\). The other ingredient can misbehave in the middle set \(Y\) without the composite noticing, as long as the misbehaviour is never exercised.
The two theorems, by contraposition
If \(g \circ f\) is onto, then \(g\) is onto.
Proof. We prove the contrapositive: if \(g\) is not onto then \(g \circ f\) is not onto. Suppose \(g\) is not onto. Then \(\exists\, z \in Z\) not in the range of \(g\). Then no \(x \in X\) has \(g(f(x)) = z\) — for if one did, \(y = f(x)\) would have \(g(y) = z\), a contradiction. So \(z\) is not in the range of \(g \circ f\), and \(g \circ f\) is not onto. \(\square\)
If \(g \circ f\) is one-to-one, then \(f\) is one-to-one.
Proof. We prove the contrapositive: if \(f\) is not one-to-one then \(g \circ f\) is not one-to-one. Suppose \(f\) is not one-to-one. Then \(\exists\, x_1 \neq x_2 \in X\) with \(f(x_1) = f(x_2)\). Hence \(g(f(x_1)) = g(f(x_2))\), i.e. \((g \circ f)(x_1) = (g \circ f)(x_2)\) with \(x_1 \neq x_2\), so \(g \circ f\) is not one-to-one. \(\square\)
Both go by contraposition (proof-techniques) for the same reason: not onto and not one-to-one are existential and hand you a concrete witness — a missed \(z\), a colliding pair — to push through the composite. The positive forms are universal and give nothing to hold onto. Anything the composite reaches, \(g\) reaches; anything \(f\) merges, the composite merges.
The two counterexamples, to order
\(g \circ f\) onto does not force \(f\) onto. \(X = \{a,b\}\), \(Y = \{0,1,2\}\), \(Z = \{v,w\}\); \(f = \{(a,0),(b,1)\}\), \(g = \{(0,v),(1,w),(2,w)\}\). Then \(f\) misses \(2\), but \(g \circ f = \{(a,v),(b,w)\}\) is onto.
\(g \circ f\) one-to-one does not force \(g\) one-to-one. \(X = \{a,b\}\), \(Y = \{1,2,3\}\), \(Z = \{u,v\}\); \(f = \{(a,1),(b,2)\}\), \(g = \{(1,u),(2,v),(3,v)\}\). Then \(g(2) = g(3)\), but \(g \circ f = \{(a,u),(b,v)\}\) is one-to-one.
Both are drawn in 2026-09-08-composition-of-functions, as (1) and (4) there, and both are built by the same recipe, which is the transferable skill:
- Make \(Y\) one element bigger than it needs to be. That spare element is where the defect will live.
- Give the defect to the function on the wrong side. For (1) \(f\) must miss the spare element; for (4) \(g\) must merge the spare element with another.
- Make sure the composite never touches it. In (1), \(g\) sends the missed element somewhere already covered, so the gap is invisible from \(Z\). In (4), \(f\) never lands on the merged element, so the collision is never fed.
- Use small sets. Two-element \(X\) and \(Z\) with a three-element \(Y\), as above, is enough; even smaller works. A counterexample is a witness; it does not need to be interesting.
The mirror symmetry is exact: (1) is gap in \(f\), hidden by a merge in \(g\); (4) is merge in \(g\), hidden by a gap in \(f\).
See also
- one-to-one-and-onto-functions — the properties and their proof templates
- inverse-functions — \(f \circ f^{-1}\) as the identity
- symmetric-group — composition as the operation of a group, on the bijections of \(\{1, \dots, n\}\)
- groups — the functions \(ax + b\) with \(a \neq 0\), a second non-abelian group under composition
- proof-techniques — contraposition and counterexample
- 2026-09-08-composition-of-functions — Lecture 20 · 2026-09-07-functions-one-to-one-onto-inverse — Lecture 19
- practice-problems — §26
Countable and Uncountable Sets
Which infinite sets are the same size as \(\mathbb{Z}^{+}\), and which are strictly bigger. A set is countable when its elements can be listed, and uncountable when no list can contain them all. Sizes are compared with bijections and injections, as set out in [cardinality]. The lectures are 2026-09-14-cardinalities (the listings) and 2026-09-15-countable-and-uncountable-sets (the definitions and the uncountable sets).
The definitions
A set \(X\) is finite if and only if \(X = \emptyset\) or \(|X| = |\{1,2,\dots,n\}|\) for some \(n \in \mathbb{Z}^{+}\).
A set is infinite if and only if it is not finite.
A set \(X\) is countable if and only if it is finite or \(|X| = |\mathbb{Z}^{+}|\).
A set \(X\) is uncountable if and only if it is not countable.
A set \(X\) is countably infinite if and only if it is countable and infinite.
Every set falls in exactly one of three classes, and “countable” and “infinite” each cover two of them:
| finite | countably infinite | uncountable | |
|---|---|---|---|
| countable? | yes | yes | no |
| infinite? | no | yes | yes |
| \(\lvert X\rvert\) | \(0\) or \(n\) | \(\lvert\mathbb{Z}^{+}\rvert\) | \(> \lvert\mathbb{Z}^{+}\rvert\) |
| examples | \(\emptyset\), \(\{1, \dots, n\}\), \(\{0,1\}\) | \(\mathbb{Z}^{+}\), \(2\mathbb{Z}\), \(\mathbb{Z}\), \(\mathbb{Q}^{+}\), \(\mathbb{Q}\), \(\mathbb{Z} \times \mathbb{Z}\) | \((0,1)\), \(\mathbb{R}\), \(\mathcal{P}(\mathbb{Z}^{+})\) |
The trap is that countable includes finite. “Countable” is not a word for a kind of infinity; “countably infinite” is.
Listing a set
\(X\) is countably infinite if and only if the elements of \(X\) can be written as an infinite list, \(X = \{x_1, x_2, x_3, \dots\}\), where the \(x_i\) are all distinct.
A list is a bijection \(f : \mathbb{Z}^{+} \to X\), \(f(i) = x_i\). “All distinct” is one-to-one, and “every element of \(X\) is somewhere in the list” is onto. To show a set is countably infinite it is enough to describe a list and convince yourself of those two things.
The listings that matter:
| Set | List | Where |
|---|---|---|
| \(2\mathbb{Z}^{+}\) | \(2, 4, 6, 8, \dots\) | 2026-09-14-cardinalities |
| \(\mathbb{Z}\) | \(0, 1, -1, 2, -2, 3, -3, \dots\) | Figure 20; as a formula in cardinality |
| \(\mathbb{Q}^{+}\) | along the anti-diagonals of the \(\frac{a}{b}\) grid, skipping repeats | 2026-09-14-cardinalities |
| \(\mathbb{Z} \times \mathbb{Z}\) | out along a square spiral from \((0,0)\) | 2026-09-14-cardinalities |
| \(\mathbb{Q}\) | along the same spiral, counting only lowest-terms pairs \((a,b)\), with the sign kept in one fixed place (here \(b \geq 1\)) | 2026-09-14-cardinalities |
They are all built the same way. Break the set into finite batches that together cover it, and list the batches one after another. Because each batch is finite, every element comes up after finitely many steps. The batches are \(\{n, -n\}\) for \(\mathbb{Z}\), the anti-diagonals \(a + b = s\) for \(\mathbb{Q}^{+}\), and the square rings for \(\mathbb{Z} \times \mathbb{Z}\).
Figure 20: Two attempts to list \(\mathbb{Z}\); the number above each integer is its place in the list. Top: alternating out from 0 — \(0, 1, -1, 2, -2, \dots\) — reaches every integer after finitely many steps (\(-n\) is in place \(2n+1\)), so it is a list of all of \(\mathbb{Z}\). Bottom: all the positive integers first never finishes them, so 0 and the negatives never get a place, and it is not a list of \(\mathbb{Z}\) at all. A listing must reach every element after finitely many steps; going out in finite batches, here the pairs \({n, -n}\), is how to guarantee it.
Subsets of countable sets
Theorem: Any subset of a countable set is countable.
Corollary: Any set with an uncountable subset is uncountable.
The corollary is the contrapositive of the theorem. For the theorem, take a list of the countable set, keep the members of the subset in the order they come up, and cross out the rest. What is left is a list of the subset, finite if only finitely many survive. The key special case:
Every infinite subset of \(\mathbb{Z}^{+}\) has the same cardinality as \(\mathbb{Z}^{+}\).
Proof. Let \(A \subseteq \mathbb{Z}^{+}\) be infinite. Let \(a_1\) be the least element of \(A\), \(a_2\) the least element of \(A - \{a_1\}\), \(a_3\) the least element of \(A - \{a_1, a_2\}\), and so on. Each step is allowed by the well-ordering principle: what is left is a set of positive integers, and it is non-empty because \(A\) is infinite. Define \(f : \mathbb{Z}^{+} \to A\) by \(f(i) = a_i\).
- \(f\) is one-to-one, because \(a_1 < a_2 < a_3 < \cdots\), so different positions hold different numbers.
- \(f\) is onto, because an element \(a \in A\) has fewer than \(a\) elements of \(A\) below it, all positive integers less than \(a\). So \(a\) is the least element left after at most \(a - 1\) steps, and is picked as some \(a_j\).
So \(|\mathbb{Z}^{+}| = |A|\). \(\square\)
Figure 21: An infinite subset of \(\mathbb{Z}^{+}\), the primes, listed by always taking the least element not yet used. The well-ordering principle guarantees a least element at every step, and the list is increasing, so no prime is used twice. No prime is skipped either: a prime \(p\) has only finitely many primes below it, so it is reached after finitely many steps — 13 has five primes below it and is sixth. So \(i \mapsto a_i\) is a bijection from \(\mathbb{Z}^{+}\) to the primes, and the primes, a sparse and irregular subset, are exactly as numerous as the positive integers.
\(A \subseteq \mathbb{Z}^{+}\) is used twice: in the well-ordering step, which needs a least element at every stage, and in the onto step, “fewer than \(a\) elements below it”. The same construction on \(\mathbb{Q}^{+}\) itself breaks at the first of these, because there is no least positive rational, and that is why \(\mathbb{Q}^{+}\) needed the grid.
\(\mathbb{R}\) is uncountable
It is enough to show that the interval \((0,1)\) is uncountable, because \((0,1) \subseteq \mathbb{R}\) and the corollary does the rest.
Theorem. \((0,1)\) is uncountable.
Proof (by contradiction). Suppose \((0,1)\) is countable. It is infinite, so its elements can be written in a list \(r_1, r_2, r_3, \dots\). Write each as a decimal, \[r_n = 0.\,d_{n1}\,d_{n2}\,d_{n3}\,\dots\] Define a number \(d = 0.\,e_1\,e_2\,e_3\,\dots\) digit by digit, from the diagonal digits \(d_{11}, d_{22}, d_{33}, \dots\): \[e_n = \begin{cases} 1 & \text{if } d_{nn} \neq 1, \\ 2 & \text{if } d_{nn} = 1. \end{cases}\] Then \(d \in (0,1)\). For every \(n\), \(d\) differs from \(r_n\) in the \(n\)-th decimal place, so \(d \neq r_n\). So \(d\) is not in the list, a contradiction. Hence \((0,1)\) is uncountable, and so is \(\mathbb{R}\). \(\square\)
This is Cantor’s diagonal argument. It is worked on a concrete table in 2026-09-15-countable-and-uncountable-sets. Three points in it are easy to get wrong:
- It defeats every list, not one list. The proof never uses anything about the particular list. Whatever list is proposed, the diagonal manufactures a number it misses. That is what “no bijection from \(\mathbb{Z}^{+}\) exists” requires.
- Why the digits 1 and 2. Some numbers have two decimal expansions: \(0.1999\ldots = 0.2000\ldots\). If \(d\) could end in all 0s or all 9s, “differs in a digit” might not mean “is a different number”. A decimal made of 1s and 2s has only the one expansion, so it really is different from every \(r_n\).
- The same argument on \(\mathbb{Q}\) fails. The diagonal of a list of rationals produces a real number, and nothing forces it to be rational. So there is no contradiction, and indeed \(\mathbb{Q}\) is countable.
Not only is \(\mathbb{R}\) bigger than \(\mathbb{Z}^{+}\), it is no bigger than the interval inside it: \(|(0,1)| = |\mathbb{R}|\).
Figure 22: Why the open interval \((0,1)\) has as many points as the whole line. Bend \((0,1)\) into a circle resting on the line, so that its two missing endpoints would meet at the top point \(N\), which is left out. A ray from \(N\) through any other point of the circle meets the line exactly once, and every point of the line is hit by exactly one such ray. Points near the top land far out, the bottom point lands at 0, and nothing is left over on either side — a bijection \((0,1) \to \mathbb{R}\).
The irrational numbers are uncountable as well. If they were countable, \(\mathbb{R} = \mathbb{Q} \cup (\mathbb{R} - \mathbb{Q})\) would be a union of two countable sets and so countable (practice-problems, question 3).
The hierarchy
\[|\emptyset| < |\{1,2,\dots,n\}| < |\mathbb{Z}^{+}| = |\mathbb{Z}| = |\mathbb{Q}| < |\mathbb{R}| < |\mathcal{P}(\mathbb{R})|\]
Figure 23: The sizes of sets met in the course, smallest on the left. Countable covers the first three blocks, empty, finite and countably infinite; infinite covers the last two. Within a block the sets have equal size wherever the chain above writes \(=\): every countably infinite set is the size of \(\mathbb{Z}^{+}\). Crossing a boundary is a strict step up, and the step from countably infinite to uncountable is the diagonal argument. The last block is not all one size: \(\mathcal{P}(\mathbb{R})\) is strictly bigger than \(\mathbb{R}\).
Each strict step has a reason:
- \(|\emptyset| < |\{1, \dots, n\}|\). There is an injection from \(\emptyset\) (the empty function), but no function at all from a non-empty set to \(\emptyset\), so no bijection.
- \(|\{1, \dots, n\}| < |\mathbb{Z}^{+}|\). \(\{1, \dots, n\}\) sits inside \(\mathbb{Z}^{+}\), but no bijection exists, since \(\mathbb{Z}^{+}\) is not finite.
- \(|\mathbb{Z}^{+}| < |\mathbb{R}|\). \(\mathbb{Z}^{+} \subseteq \mathbb{R}\) gives \(\leq\), and the diagonal argument rules out \(=\).
- \(|\mathbb{R}| < |\mathcal{P}(\mathbb{R})|\). Stated without proof. Beyond the course: Cantor’s theorem says \(|A| < |\mathcal{P}(A)|\) for every set \(A\), by a diagonal argument on subsets. So the chain never stops: \(\mathcal{P}(\mathcal{P}(\mathbb{R}))\) is bigger again, and there is no largest size.
How to show a set is countable, or uncountable
Countable — any one of:
- It is finite.
- Write down a list, in finite batches, and check that every element appears exactly once.
- Give a bijection with a set already known to be countable, such as \(\mathbb{Z}^{+}\), \(\mathbb{Z}\), \(\mathbb{Q}\) or \(\mathbb{Z} \times \mathbb{Z}\).
- Give an injection into a countable set. The image is a subset of a countable set, so it is countable, and the injection is a bijection onto its image, so the set itself is countable too. With an injection the other way as well, Schröder–Bernstein gives the exact cardinality, as in the proof that \(\mathbb{Z}^{+} \times \mathbb{Z}^{+}\) is countable using \((a,b) \mapsto 3^a 5^b\) (2026-09-15-countable-and-uncountable-sets).
Uncountable — any one of:
- It contains an uncountable subset, such as an interval of \(\mathbb{R}\).
- There is an injection from a known uncountable set into it, for example from \((0,1)\).
- A diagonal argument: assume a list, and build an element the list misses.
Whatever the direction, the argument has to be a proof. Not being able to think of a list does not show that none exists.
What is assessed. The course practice set marks its whole countable-and-uncountable section (§28) “not assessed in MATH1061”, while Lecture 22 marks only the proof that \(\mathbb{R}\) is uncountable and the countability of \(\mathbb{Z}^{+} \times \mathbb{Z}^{+}\) as not assessed. The two disagree, so check with the course.
See also
- [cardinality] — bijections, the \(|X| = |Y|\) template, \(\leq\) by injection, Schröder–Bernstein
- strong-induction-and-the-well-ordering-principle — the principle that lists an infinite subset of \(\mathbb{Z}^{+}\)
- proof-techniques — proof by contradiction, the shape of the diagonal argument
- rational-and-irrational-numbers — \(\mathbb{Q}\) and \(\overline{\mathbb{Q}}\), on either side of the countable line
- 2026-09-14-cardinalities — Lecture 21 · 2026-09-15-countable-and-uncountable-sets — Lecture 22
- practice-problems — §28, with full worked solutions and the computability application
Divisibility & Unique Factorisation
Definition
\[d \mid n \iff d \neq 0 \text{ and } n = dk \text{ for some integer } k\]
Both \(n\) and \(d\) must be integers, and \(d \neq 0\) — this side condition is part of the definition, not an afterthought. Equivalently, \(d \mid n \iff \frac{n}{d} \in \mathbb{Z}\).
All of these say the same thing:
- \(d\) divides \(n\)
- \(d\) is a divisor of \(n\)
- \(d\) is a factor of \(n\)
- \(n\) is a multiple of \(d\)
\(d \nmid n\) means \(d\) does not divide \(n\). Note that \(d \mid n\) is a statement, not a number: \(2 \mid 6\) is true, it is not “\(2\) divided by \(6\)” and it is not \(3\). Likewise \(10 \nmid 5\) is true, since \(\frac{5}{10} \notin \mathbb{Z}\). Being a statement is what makes \(2 \mid x\) a predicate — it acquires a truth value once \(x\) is fixed — so it is exactly the kind of thing a quantifier can be put in front of.
Divisibility inside a quantified statement
Two quantified divisibility statements, both false, both settled by a single counterexample — one counterexample is enough to make a \(\forall\) statement false, though no single example could ever make one true (see quantified-statements on that asymmetry):
| Statement | Verdict | Counterexample |
|---|---|---|
| \(\forall x \in \mathbb{Z}\), if \(2 \mid x\) then \(4 \mid x\) | False | \(x = 2\): \(2 \mid 2\) is true but \(4 \nmid 2\) |
| \(\forall x \in \mathbb{Z}\), if \(6\) is divisible by \(x\), then \(x = 2\) | False | \(x = 3\): \(3 \in \mathbb{Z}\) and \(3 \mid 6\), but \(3 \neq 2\) |
A counterexample to a universal conditional has to make the hypothesis true and the conclusion false — that is what \(\sim(p \to q) \equiv p \land \sim q\) says. An \(x\) that fails the hypothesis proves nothing.
The second statement becomes true once the conclusion lists every divisor:
\[\forall x \in \mathbb{Z}, \text{ if } 6 \text{ is divisible by } x, \text{ then } x = \pm 1 \text{ or } \pm 2 \text{ or } \pm 3 \text{ or } \pm 6.\]
The \(\pm\) is not optional. The reason is in the definition: it asks only for \(n = dk\) with \(k \in \mathbb{Z}\), and \(k\) may be negative, so divisors over \(\mathbb{Z}\) always come in \(\pm\) pairs — if \(n = dk\) then \(n = (-d)(-k)\), so \(d \mid n\) exactly when \((-d) \mid n\). A divisor list that quietly restricts itself to \(\mathbb{Z}^+\) is answering a question about a different domain.
Proving and disproving divisibility statements
The pattern for a direct proof: unfold \(d \mid n\) into \(n = dk\), do algebra, then re-fold into the definition by exhibiting the integer witness.
\(\forall a, b, c \in \mathbb{Z}\), if \(c \mid a\) then \(c \mid ab\).
Let \(a, b, c \in \mathbb{Z}\) and suppose \(c \mid a\). Then \(\exists k \in \mathbb{Z}\) such that \(a = ck\). Multiplying both sides by \(b\): \(ab = ckb = c(kb)\). Since \(k, b \in \mathbb{Z}\) we have \(kb \in \mathbb{Z}\). Thus \(c \mid ab\). \(\square\)
\(\forall m \in \mathbb{Z}\), \(6m(2m + 10m^2)\) is divisible by 4.
Let \(m \in \mathbb{Z}\). Then \(6m(2m + 10m^2) = 2(3m) \cdot 2(m + 5m^2) = 4 \big(3m(m + 5m^2)\big)\). Since \(m \in \mathbb{Z}\), \(3m(m + 5m^2) \in \mathbb{Z}\). Thus \(4 \mid 6m(2m + 10m^2)\). \(\square\)
\(\forall a, b, c \in \mathbb{Z}\), if \(a \mid (b + c)\) then \(a \mid b\) or \(a \mid c\) — false. Counterexample \(a = 3, b = 4, c = 2\): \(a \mid (b+c)\) since \(3 \mid 6\), but \(3 \nmid 4\) and \(3 \nmid 2\).
\(\forall a, b, m \in \mathbb{Z}\), if \(m \mid (a+b)\) then \(m \mid (a-b)\) — false. A counterexample needs the hypothesis true and the conclusion false:
| \(m \mid (a+b)\) | \(m \mid (a-b)\) | conditional | |
|---|---|---|---|
| \(m=5, a=20, b=10\) | \(5 \mid 30\) T | \(5 \mid 10\) T | T |
| \(m=5, a=21, b=13\) | \(5 \mid 34\) F | \(5 \mid 8\) F | T |
| \(m=5, a=27, b=7\) | \(5 \mid 34\) F | \(5 \mid 20\) T | T |
| \(m=5, a=19, b=-9\) | \(5 \mid 10\) T | \(5 \mid 28\) F | F |
| \(m=5, a=23, b=12\) | \(5 \mid 35\) T | \(5 \mid 11\) F | F |
| \(m=5, a=-10, b=-3\) | \(5 \mid -13\) F | \(5 \mid -7\) F | T |
Only the two rows with hypothesis T and conclusion F are counterexamples.
\(\forall m, n, q \in \mathbb{Z}\), if \(m \mid n\) and \(n \mid q\) then \(m^2 \mid nq\) — true.
Let \(m, n, q\) be non-zero integers with \(m \mid n\) and \(n \mid q\). By definition there exist \(a, b \in \mathbb{Z}\) with \(n = ma\) and \(q = nb\). Then \[nq = (ma)(nb) = ma \cdot (mab) = m^2(a^2b).\] Since \(a^2 b \in \mathbb{Z}\), we conclude \(m^2 \mid nq\). \(\square\)
If \(k\) is even and \(m\) is odd, then \((k+2)^2 - (m-3)^2\) is divisible by 4.
Let \(k = 2a\) and \(m = 2b+1\) for some \(a, b \in \mathbb{Z}\). Then \((k+2)^2 = (2a+2)^2 = 4(a+1)^2\) and \((m-3)^2 = (2b-2)^2 = 4(b-1)^2\), so \[(k+2)^2 - (m-3)^2 = 4\big((a+1)^2 - (b-1)^2\big),\] and \((a+1)^2 - (b-1)^2 \in \mathbb{Z}\). \(\square\)
\(\forall c, d, e \in \mathbb{Z}\), if \(c \mid d\) and \(c \nmid e\), then \(c \nmid (d+e)\).
Proof by contradiction. Suppose there exist integers \(c, d, e\) with \(c \mid d\), \(c \nmid e\) and \(c \mid (d+e)\). Then \(d = cx\) for some \(x \in \mathbb{Z}\), and \(d + e = cy\) for some \(y \in \mathbb{Z}\). Hence \(cx + e = cy\), so \(e = c(y - x)\) with \(y - x \in \mathbb{Z}\) — so \(c \mid e\), a contradiction. \(\square\)
Every integer \(n > 1\) is a product of primes
Proof by contradiction. Suppose the theorem is false. Then there exists an integer \(n > 1\) that is not a product of primes. Choose the smallest such \(n\) — such a smallest one exists by the well-ordering principle. Choosing the smallest is what lets us assume every integer strictly between \(1\) and \(n\) is a product of primes.
Every integer \(n > 1\) is either prime or composite (not both).
Case 1: \(n\) is prime. Then \(n\) is a product of primes (namely itself) — contradiction.
Case 2: \(n\) is composite. Then \(n = rs\) for positive integers \(r, s\) with \(r \neq 1\) and \(s \neq 1\), which forces \(1 < r < n\) and \(1 < s < n\). Because \(n\) was chosen smallest, both \(r\) and \(s\) are products of primes, say \(r = p_1 p_2 \cdots p_k\) and \(s = q_1 q_2 \cdots q_\ell\). Therefore \(n = rs = p_1 \cdots p_k q_1 \cdots q_\ell\) is a product of primes too.
Either way \(n\) is a product of primes, contradicting our choice of \(n\). \(\square\)
Unique Factorisation Theorem
Provided in the exam. This theorem and the Quotient-Remainder Theorem are both stated on the MATH1061/MATH7861 Examination Formula Page, so they can be cited rather than restated from memory — see also logical-equivalence-laws for the rest of what that page carries.
Given any integer \(n > 1\), the standard factored form of \(n\) is \[n = p_1^{e_1} p_2^{e_2} \cdots p_k^{e_k}\] where \(k \in \mathbb{Z}^+\), the \(p_i\) are primes, the \(e_i\) are positive integers, and \(p_1 < p_2 < \cdots < p_k\).
Both the primes and their exponents are unique — this is what makes the factored form a canonical fingerprint of an integer, and it’s the engine behind divisor counting, gcd and lcm (see gcd-lcm-and-euclidean-algorithm).
Counting divisors from the factorisation
Any positive divisor of \(n = p_1^{e_1} \cdots p_k^{e_k}\) has the form \(p_1^{a_1} \cdots p_k^{a_k}\) with \(0 \leq a_i \leq e_i\), so there are
\[(e_1 + 1)(e_2 + 1) \cdots (e_k + 1)\]
positive divisors.
\(6975 = 3^2 \cdot 5^2 \cdot 31\), found by trial division: \(6975 = 3 \cdot 2325 = 3 \cdot 3 \cdot 775 = 3 \cdot 3 \cdot 5 \cdot 155 = 3^2 \cdot 5^2 \cdot 31\). A divisor has \(0\), \(1\) or \(2\) threes; \(0\), \(1\) or \(2\) fives; and \(0\) or \(1\) thirty-ones — so \(3 \cdot 3 \cdot 2 = 18\) positive divisors.
\(27720 = 2^3 \cdot 3^2 \cdot 5 \cdot 7 \cdot 11\).
\(1400 = 2^3 \cdot 5^2 \cdot 7\), worked through:
- \(1400 = 2(700) = 2 \cdot 2(350) = 2 \cdot 2(35)(10) = 2^2 (5 \cdot 7)(2 \cdot 5) = 2^3 \cdot 5^2 \cdot 7^1\) — note the primes are written in increasing order.
- \(1400^2 = (2^3 \cdot 5^2 \cdot 7)^2 = 2^6 \cdot 5^4 \cdot 7^2\) — raising to a power multiplies the exponents.
- \(1400^3 = 1400 \cdot 1400^2 = 2^9 \cdot 5^6 \cdot 7^3\) — multiplying adds the exponents.
- Number of positive divisors of \(1400\): \((3+1)(2+1)(1+1) = 24\).
- Divisors of \(1400\) divisible by \(8\): all factors of the form \(2^3 \cdot 5^* \cdot 7^*\), i.e. \(8, 40, 200, 56, 280, 1400\).
- Smallest \(n\) with \(1400n\) a perfect square: \(1400n = t^2\) needs every exponent even. \(t^2 = 2^3 \cdot 5^2 \cdot 7^1 \cdot n\), and splitting each power in half (bigger halves on the left) gives \(t = 2^2 \cdot 5^1 \cdot 7^1\) against \(2^1 \cdot 5^1 \cdot 7^0 \cdot n\), so \(n = 2 \cdot 7 = 14\).
Primality testing
Lemma: for every integer \(n > 1\), if no integer \(x\) in the range \(1 < x \leq \sqrt{n}\) divides \(n\), then \(n\) is prime.
This is why trial division only has to go as far as \(\sqrt{n}\) — for \(6975\), only up to \(\sqrt{6975} = 83.51\dots\)
Proof by contraposition. The contrapositive is: \(\forall n \in \mathbb{Z}^{\geq 2}\), if \(n\) is not prime, then there exists an integer \(x\) with \(1 < x \leq \sqrt{n}\) such that \(x \mid n\).
Suppose \(n \in \mathbb{Z}^{\geq 2}\) and \(n\) is not prime. Then \(n\) is composite, so by definition \(\exists r, s \in \mathbb{Z}^+\) with \(n = rs\) and \(1 < r < n\) and \(1 < s < n\).
Case 1: \(r = s\). Then \(r = s = \sqrt{n}\).
Case 2: \(r \neq s\). Then one of \(r, s\) is less than \(\sqrt{n}\) and the other greater — if both were greater we’d have \(rs > n\), and if both were less we’d have \(rs < n\).
In either case there is an \(x \in \{r, s\}\) with \(1 < x \leq \sqrt{n}\) and \(x \mid n\). \(\square\)
There are infinitely many primes
Lemma: for any integer \(a\) and any prime \(p\), if \(p \mid a\) then \(p \nmid (a+1)\).
Proof by contradiction. Let \(a \in \mathbb{Z}\), let \(p\) be prime, suppose \(p \mid a\), and assume for a contradiction that \(p \mid (a+1)\). Since \(p \mid a\) there exists \(k \in \mathbb{Z}\) with \(a = pk\); since \(p \mid (a+1)\) there exists \(\ell \in \mathbb{Z}\) with \(a + 1 = p\ell\). So \[1 = (a+1) - a = p\ell - pk = p(\ell - k),\] and \(\ell - k \in \mathbb{Z}\), so \(p \mid 1\). But \(p \geq 2\) for any prime, whereas \(p \mid 1\) forces \(p = \pm 1\) — a contradiction. \(\square\)
Theorem: there are an infinite number of primes.
Proof by contradiction. Suppose the number of primes is finite. Then some prime \(p\) is the largest, and we can list every prime in ascending order: \(2, 3, 5, 7, 11, \dots, p\).
Let \(N = (2 \cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdots p) + 1\).
Then \(N > 1\), so by the Unique Factorisation Theorem \(N\) is a product of primes and hence divisible by some prime \(q\). Because \(q\) is prime it must be one of \(2, 3, 5, 7, 11, \dots, p\).
So \(q\) divides \(2 \cdot 3 \cdot 5 \cdots p\) — that is, \(q \mid (N - 1)\) — and hence by the lemma \(q \nmid \big((2 \cdot 3 \cdot 5 \cdots p) + 1\big) = N\).
So \(q\) divides \(N\) and \(q\) does not divide \(N\): a contradiction. Therefore the original statement is true. \(\square\)
See also
- proof-techniques · modular-arithmetic · gcd-lcm-and-euclidean-algorithm
- partial-order-relations — “divides” as a partial order on \(\mathbb{Z}^{+}\)
- fields — unique factorisation as the reason \(\mathbb{Z}_p\) is a field when \(p\) is prime
- counting-principles — the rule behind counting divisors, one choice of exponent for each prime
- practice-problems — §13 Divisibility, with full worked solutions
The Examination Formula Page
The MATH1061/MATH7861 Examination Formula Page is provided in both exams, which are otherwise closed book with no written materials permitted (see math1061). Knowing what is on it — and what is not — is what decides whether a fact needs memorising.
It has seven blocks.
1. Logical equivalences
Eleven named laws, given any statement variables \(p, q, r\), a tautology \(\mathbf{t}\) and a contradiction \(\mathbf{c}\). Reproduced in full in logical-equivalence-laws.
Commutative · Associative · Distributive · Identity · Negation · Double negative · Idempotent · Universal bound · De Morgan’s · Absorption · Negations of \(\mathbf{t}\) and \(\mathbf{c}\).
2. Valid argument forms
Nine forms. Reproduced in full in valid-argument-forms.
Modus Ponens · Modus Tollens · Generalization (a)(b) · Specialization (a)(b) · Conjunction · Elimination (a)(b) · Transitivity · Proof by division into cases · Contradiction Rule.
3. Set identities
Twelve numbered laws, for all sets \(A, B, C\) that are subsets of a universal set \(U\):
| Law | ||
|---|---|---|
| 1 | Commutative | \(A \cup B = B \cup A\) · \(A \cap B = B \cap A\) |
| 2 | Associative | \((A \cup B) \cup C = A \cup (B \cup C)\) · \((A \cap B) \cap C = A \cap (B \cap C)\) |
| 3 | Distributive | \(A \cup (B \cap C) = (A \cup B) \cap (A \cup C)\) · \(A \cap (B \cup C) = (A \cap B) \cup (A \cap C)\) |
| 4 | Identity | \(A \cup \emptyset = A\) · \(A \cap U = A\) |
| 5 | Complement | \(A \cup A^c = U\) · \(A \cap A^c = \emptyset\) |
| 6 | Double complement | \((A^c)^c = A\) |
| 7 | Idempotent | \(A \cup A = A\) · \(A \cap A = A\) |
| 8 | Universal bound | \(A \cup U = U\) · \(A \cap \emptyset = \emptyset\) |
| 9 | De Morgan’s | \((A \cup B)^c = A^c \cap B^c\) · \((A \cap B)^c = A^c \cup B^c\) |
| 10 | Absorption | \(A \cup (A \cap B) = A\) · \(A \cap (A \cup B) = A\) |
| 11 | Complement of \(U\) and \(\emptyset\) | \(U^c = \emptyset\) · \(\emptyset^c = U\) |
| 12 | Set difference | \(A - B = A \cap B^c\) |
Reproduced with worked proofs in proving-set-properties.
Note the one-to-one correspondence with the logical equivalences in block 1 — laws 1–11 are those same eleven laws in the same order, plus set difference at 12. The names are not quite identical: negation becomes complement (5), double negative becomes double complement (6), and negations of \(\mathbf{t}\) and \(\mathbf{c}\) becomes complement of \(U\) and \(\emptyset\) (11). That correspondence is not a coincidence: \(\cup\) behaves as \(\lor\), \(\cap\) as \(\land\), and complement as \(\sim\). Law 12 is the one with no counterpart in block 1.
The numbering is not decoration — it is how the course expects you to cite. The worked identity proof in Lecture 18 justifies its lines by the number on this page: by set diff law (12), by de Morgan (9b), dist. law (3b), complement law (5b), identity law (4a) — only the double complement step goes uncited there, by name alone. Naming and numbering the law is where the marks are, and this page is in front of you while you do it.
4. The Quotient-Remainder Theorem
Given any integer \(n\) and any positive integer \(d\), there exist unique integers \(q\) and \(r\) such that \(n = dq + r\) and \(0 \leq r < d\).
See modular-arithmetic. The uniqueness clause and the range \(0 \leq r < d\) are what let you read a remainder off a rearranged expression.
5. Unique Factorisation Theorem
Given any integer \(n > 1\), there exists a positive integer \(k\), distinct prime numbers \(p_1, p_2, \dots, p_k\), and positive integers \(e_1, e_2, \dots, e_k\) such that \[n = p_1^{e_1} p_2^{e_2} \cdots p_k^{e_k}\] and any other expression for \(n\) as a product of prime numbers is identical to this except perhaps for the order in which the factors are written.
See divisibility-and-factorisation. The second half is the “unique” part, and it is the half students leave out when asked to state the theorem.
6. Schröder-Bernstein Theorem
For all sets \(A\) and \(B\), if \(|A| \leq |B|\) and \(|A| \geq |B|\) then \(|A| = |B|\).
See cardinality. In use it means two injections, one each way, in place of one bijection, and the two must point in opposite directions between the same two sets.
7. Binomial Theorem
Given any real numbers \(a\) and \(b\), and any nonnegative integer \(n\), \[(a+b)^n = \sum_{k=0}^{n} \binom{n}{k} a^{n-k} b^k\]
Belongs to the counting material (L30–L31). The coefficient \(\binom{n}{k}\) is “\(n\) choose \(k\)”, the number of \(k\)-element subsets of an \(n\)-element set (counting-selections). The theorem, with its proof by counting \(a,b\)-sequences and the method for picking one coefficient out of an expansion, is in binomial-coefficients.
What this means for revision
Blocks 1 and 2 are the bulk of the page and are reproduced in the vault, so for the logic material the assessed skill is recognising and naming which law or form applies — not recalling the list.
Block 3 works the same way: the set identities are given, so the assessed skill is choosing and citing by number, not reciting the twelve laws — see proving-set-properties for both worked methods that use them.
Blocks 4 and 5 are covered by modular-arithmetic and divisibility-and-factorisation. Block 6 is covered by [cardinality]. Block 7 is covered by binomial-coefficients, and its \(\binom{n}{k}\) by counting-selections.
Nothing else is provided. In particular the whole of set theory apart from block 3 — the definitions of \(\subseteq\), \(\subset\), \(\mathcal{P}(A)\), \(A \times B\), partition, function, image and preimage — is not on the page, and neither is any proof technique, nor anything about sequences, induction and recursion. Nor is anything about relations, groups or fields: the definitions of reflexive, symmetric, transitive and antisymmetric, of an equivalence relation (equivalence-relations) and a partial order (partial-order-relations), the four group properties (groups), the subgroup checks (subgroups-and-cyclic-groups) and the conditions for a field (fields). Nor are the counting rules and selection formulas of counting-principles and counting-selections, Pascal’s formula, inclusion/exclusion (inclusion-exclusion), the pigeonhole principle (pigeonhole-principle) or the Handshake Theorem (graphs). Nor is any of the rest of the graph theory: the definitions of walk, trail, circuit and connected (walks-trails-and-circuits), the Euler circuit and trail theorem (euler-circuits-and-trails), adjacency and incidence matrices (adjacency-matrices, incidence-matrices), or the theorem that a tree with \(n\) vertices has \(n - 1\) edges (trees). All of that has to come from memory.
Functions on General Sets
The set-theoretic definition of a function — not “a rule” or “a formula”, but a particular kind of subset of a Cartesian product. See sets-and-set-notation for the Cartesian products this is built on.
The definition
A function \(f : X \to Y\) is a subset \(f \subseteq X \times Y\) such that for each \(x \in X\), there is a unique \(y \in Y\) such that \((x,y) \in f\).
The function is the set of pairs. There is no separate “rule” object — the familiar notations are all names for the same set:
\[y = 2x + 1 \qquad\text{or}\qquad f(x) = 2x + 1 \qquad\text{or}\qquad f = \{(x,y) \in \mathbb{R} \times \mathbb{R} : y = 2x+1\}\]
and the bridge between the two styles is
\[f(x) = y \quad\Longleftrightarrow\quad (x,y) \in f\]
Defining a function this way costs a little intuition and buys a great deal of precision: the definition applies to any sets at all, not just sets of numbers, and questions like “are these two functions equal?” become ordinary questions about set equality.
Worked: which of these is a function?
Let \(X = \{1,2,3\}\) and \(Y = \{1,2,3,4\}\). Which one of the following is a function from \(X\) to \(Y\)?
| Candidate | Why | ||
|---|---|---|---|
| (a) | \(\{(1,2), (1,3), (2,4)\}\) | ✗ | \(f(1) = 2\) and \(f(1) = 3\) — the value at \(1\) is not unique. (Also \(3\) is unused.) |
| (b) | \(\{(1,2), (2,3), (3,2), (4,1)\}\) | ✗ | \(4 \notin X\) — a pair whose first coordinate is outside the domain |
| (c) | \(\{(1,2), (2,3), (3,5)\}\) | ✗ | \(5 \notin Y\) — a value outside the codomain |
| (d) | \(\{(1,2), (2,1), (3,1)\}\) | ✓ | all first coordinates in \(X\), all second in \(Y\), each of \(1,2,3\) used exactly once |
Each wrong answer breaks a different one of the three conditions, which is what makes this a good question: the three failures are not variations on one mistake.
For (d): \(f(1) = 2\), \(f(2) = 1\), \(f(3) = 1\). Note \(f(2) = f(3)\) — two inputs sharing a value is not a problem, for exactly the reason the picture above shows.
Codomain and range
The two are constantly confused, and the difference is one word:
For a function \(f : X \to Y\), the co-domain is \(Y\), and the range is \(f(X) = \{f(x) : x \in X\}\), which is a subset of \(Y\).
| Is | Determined by | |
|---|---|---|
| Co-domain | \(Y\) — where values are allowed to land | the declaration \(f : X \to Y\) |
| Range | \(f(X)\) — where values actually land | the pairs in \(f\) |
So the codomain is a choice you make when you write down the function, and the range is a fact you compute. Always \(f(X) \subseteq Y\), and the containment is often proper.
For the function (d) above, \(f = \{(1,2),(2,1),(3,1)\}\):
\[\text{co-domain} = Y = \{1,2,3,4\} \qquad\qquad \text{range} = f(X) = \{1,2\} \subseteq Y\]
\(3\) and \(4\) are in the codomain and not in the range — they are permitted values that this particular function never takes.
Image and preimage
The two definitions generalise “range” to any subset, in each of the two directions:
If \(f : X \to Y\) is any function and \(A\) is any subset of \(X\), then the image of \(A\) is \[f(A) = \{f(x) : x \in A\}\]
If \(f : X \to Y\) is any function and \(B\) is any subset of \(Y\), then the inverse image or preimage of \(B\) is \[f^{-1}(B) = \{x \in X : f(x) \in B\}\]
Both take a set and return a set — \(A \subseteq X\) gives \(f(A) \subseteq Y\), and \(B \subseteq Y\) gives \(f^{-1}(B) \subseteq X\). The range is then just the image of the whole domain, \(f(X)\).
The notation \(f^{-1}\) here does not mean an inverse function. \(f^{-1}(B)\) is defined for any function, invertible or not — the emphasis on any in both definitions is the point. It is a set-to-set operation that always exists; an inverse function is a different thing that usually does not.
Figure 25: Image and preimage of the same function, read in opposite directions. Following the lines forward from a subset of X collects a subset of Y; following them backwards from a subset of Y collects every x that lands in it — which can be several elements, or none at all. In each panel the domain is on the left and the co-domain on the right, each line runs from an element of X to its value in Y, and the subset under discussion is outlined in colour with its expression in the same colour.
Worked
Let \(X = \{1,2,3\}\), \(Y = \{1,2,3,4\}\) and \(f = \{(1,2), (2,1), (3,1)\}\), the function from the question above. So \(f(1) = 2\), \(f(2) = 1\), \(f(3) = 1\).
| Asked for | Working | Answer | |
|---|---|---|---|
| (a) | image of \(\{1\}\) | \(f(1) = 2\) | \(f(\{1\}) = \{2\}\) |
| (b) | image of \(\{2,3\}\) | \(f(2) = 1\), \(f(3) = 1\) | \(f(\{2,3\}) = \{1\}\) |
| (c) | inverse image of \(\{2\}\) | which \(x\) have \(f(x) = 2\)? only \(x=1\) | \(f^{-1}(\{2\}) = \{1\}\) |
| (d) | preimage of \(\{1\}\) | which \(x\) have \(f(x) = 1\)? \(x = 2\) and \(x = 3\) | \(f^{-1}(\{1\}) = \{2,3\}\) |
| (e) | preimage of \(\{3,4\}\) | no \(x\) maps to \(3\) or \(4\) | \(f^{-1}(\{3,4\}) = \emptyset\) |
Three things this table is designed to show — they are the three panels of Figure 25:
- (b): an image can be smaller than the set you started with. \(\{2,3\}\) has two elements, \(f(\{2,3\})\) has one, because \(f\) sends both to the same place.
- (d): a preimage can be larger than the set you started with. One element of \(Y\) pulls back to two of \(X\).
- (e): a preimage can be empty. \(\{3,4\}\) lies outside the range entirely. Note this is a perfectly good answer, not a failure — \(\emptyset\) is a subset of \(X\) like any other, and it is the reason \(f^{-1}\) needs no invertibility to be defined.
Always write the answers as sets: \(f^{-1}(\{2\}) = \{1\}\), not \(= 1\). The operation returns a subset, and dropping the braces is the standard slip.
See also
- sets-and-set-notation — Cartesian products, and the \(\in\) / \(\subseteq\) distinction these definitions lean on
- proving-set-properties — the proof methods, for arguing about images and preimages
- relations-on-sets — functions as the relations with exactly one arrow out of each element
- 2026-09-03-set-properties-and-functions — Lecture 18
- practice-problems — §24 Functions Defined on General Sets, with full worked solutions
The Integers Modulo n
\(\mathbb{Z}_n\) is the set of equivalence classes of congruence mod \(n\). It is a number system with exactly \(n\) elements, in which addition and multiplication are done on classes. Congruence itself is in modular-arithmetic, and equivalence classes in equivalence-classes-and-partitions. Under addition \(\mathbb{Z}_n\) is one of the course’s standard groups, and when \(n\) is prime it is a field, with division by every non-zero class (fields). First met in 2026-09-24-definitions-and-examples-of-groups.
The set \(\mathbb{Z}_n\)
Fix \(n \in \mathbb{Z}^{+}\). Congruence mod \(n\) is an equivalence relation on \(\mathbb{Z}\), \[m \mathrel{R} k \iff m \equiv k \pmod n \iff n \mid (m - k),\] and its classes partition \(\mathbb{Z}\). \(\mathbb{Z}_n\) is the set of those classes: \[\mathbb{Z}_n = \{[0], [1], [2], \dots, [n-1]\}.\]
For \(n = 10\): \[\mathbb{Z}_{10} = \{[0], [1], [2], [3], [4], [5], [6], [7], [8], [9]\}\] \[[0] = \{\dots, -30, -20, -10, 0, 10, 20, 30, \dots\}, \qquad [1] = \{\dots, -29, -19, -9, 1, 11, 21, 31, \dots\}\]
- \(\mathbb{Z}_n\) has exactly \(n\) elements. Every integer leaves exactly one of the remainders \(0, 1, \dots, n-1\) on division by \(n\) (modular-arithmetic), so every integer is in exactly one of the \(n\) classes.
- Each element is an infinite set of integers. \([1]\) is not the number 1. It is the set of all integers congruent to 1.
- Each class has many names. \([0] = [10] = [30]\) and \([1] = [21] = [-9]\). In general \([a] = [b]\) exactly when \(a \equiv b \pmod n\) (equivalence-classes-and-partitions).
We usually use \([0], [1], \dots, [n-1]\) as representatives for the equivalence classes of \(\mathbb{Z}_n\).
Figure 26: The integers from \(-10\) to 29 written in rows of ten. Each column is one element of \(\mathbb{Z}_{10}\): going down a column adds 10, so everything in a column is congruent mod 10. The whole of \(\mathbb{Z}\) is sorted into these ten columns, and \(\mathbb{Z}_{10}\) is the set of the ten columns. The shaded row holds the usual representatives, 0 to 9. Any other number in a column names the same class, so \([21] = [1]\) and \([-1] = [9]\).
Adding and multiplying classes
Define binary operations \(+\) (plus/addition) and \(\cdot\) (times/multiplication) on \(\mathbb{Z}_n\) as follows. For all \([a], [b] \in \mathbb{Z}_n\), \[[a] + [b] = [a + b] \qquad\text{and}\qquad [a] \cdot [b] = [ab].\]
To combine two classes, combine a representative of each in the ordinary way and take the class of the result. In \(\mathbb{Z}_{10}\): \([8] + [9] = [17] = [7]\) and \([8] \cdot [9] = [72] = [2]\).
Any representative can be used
when doing arithmetic in \(\mathbb{Z}_n\), any representative of the equivalence classes can be used.
The definition \([a] + [b] = [a + b]\) computes with the particular names \(a\) and \(b\), and each class has infinitely many names. The boxed sentence says the result does not depend on which names are used.
The reason is the lemma of modular-arithmetic: if \(a \equiv a' \pmod n\) and \(b \equiv b' \pmod n\), then \[a + b \equiv a' + b' \pmod n \qquad\text{and}\qquad ab \equiv a'b' \pmod n.\] In the language of classes, if \([a] = [a']\) and \([b] = [b']\) then \([a + b] = [a' + b']\) and \([ab] = [a'b']\).
Figure 27: \([8] + [9]\) and \([8] \cdot [9]\) in \(\mathbb{Z}_{10}\), computed with three different representatives of each class: \(-2\), 8 and 18 for \([8]\) down the side, and \(-1\), 9 and 19 for \([9]\) across the top. The sums are not all the same integer, but every one of them is congruent to 7. The products are not all the same integer, but every one is congruent to 2. Whichever representatives are used, \([8] + [9] = [7]\) and \([8] \cdot [9] = [2]\).
Choosing a convenient representative
Since any representative will do, pick the one that makes the arithmetic easy, and reduce at any stage. For example:
\[\begin{aligned} ([8] + [9]) \cdot ([6] + [7]) &= ([8] + [-1]) \cdot ([6] + [-3]) \\ &= [7] \cdot [3] = [21] = [1]. \end{aligned}\]
\([9]\) became \([-1]\) and \([7]\) became \([-3]\). A representative just below a multiple of \(n\) is often better written as a small negative number. Without the swap the same calculation is \([17] \cdot [13] = [221] = [1]\).
\((\mathbb{Z}_n, +)\) is a group
For every \(n \in \mathbb{Z}^{+}\), \((\mathbb{Z}_n, +)\) is a group. The check of the four properties (groups):
- Closure. \([a] + [b] = [a + b]\), which is a class in \(\mathbb{Z}_n\).
- Associativity. \(([a] + [b]) + [c] = [(a + b) + c] = [a + (b + c)] = [a] + ([b] + [c])\). It is inherited from addition of integers.
- Identity. \([0]\), since \([0] + [a] = [a] + [0] = [a]\).
- Inverses. \([a]^{-1} = [-a]\), since \([a] + [-a] = [-a] + [a] = [0]\). With the usual names, \([-a] = [n - a]\).
It is abelian, because \([a] + [b] = [a + b] = [b + a] = [b] + [a]\).
For \(n = 3\), one of the eight candidates of groups:
| \(+\) | \([0]\) | \([1]\) | \([2]\) |
|---|---|---|---|
| \(\mathbf{[0]}\) | \([0]\) | \([1]\) | \([2]\) |
| \(\mathbf{[1]}\) | \([1]\) | \([2]\) | \([0]\) |
| \(\mathbf{[2]}\) | \([2]\) | \([0]\) | \([1]\) |
Here the group inverse of \([1]\) is \([2]\), because \([1] + [2] = [0]\). In an additive group the “inverse” is the negative.
Multiplication: \(\mathbb{Z}_n - \{[0]\}\)
Multiplication of classes is closed, associative and commutative on \(\mathbb{Z}_n\), with identity \([1]\). But \((\mathbb{Z}_n, \cdot)\) is not a group when \(n > 1\): \([0] \cdot [a] = [0]\) for every \([a]\), so \([0]\) has no inverse. This is the same obstacle as 0 in \((\mathbb{R}, \cdot)\), and the same repair is tried, removing it.
| Group under multiplication? | Worked in | |
|---|---|---|
| \(\mathbb{Z}_5 - \{[0]\}\) | yes | 2026-09-24-definitions-and-examples-of-groups; table in practice-problems, Q4 |
| \(\mathbb{Z}_7 - \{[0]\}\) | yes | 2026-09-24-definitions-and-examples-of-groups |
| \(\mathbb{Z}_9 - \{[0]\}\) | no: not closed, \([3] \cdot [3] = [9] = [0]\) | the same practice set, Q1 |
| \(\{[1],[2],[4],[5],[7],[8]\}\) in \(\mathbb{Z}_9\) | yes | the same practice set, Q3 |
| \(\mathbb{Z}_4 - \{[0]\}\) | no: not closed, \([2] \cdot [2] = [4] = [0]\) | 2026-10-08-definitions-and-examples-of-fields |
| \(\mathbb{Z}_{15} - \{[0]\}\) | no: not closed, \([3] \cdot [5] = [15] = [0]\) | 2026-10-08-definitions-and-examples-of-fields |
For \(n = 9\), removing \([0]\) is not enough. \([3]\) and \([6]\) multiply into \([0]\), and removing those as well leaves a group.
The rule: \(\mathbb{Z}_n - \{[0]\}\) is a group under multiplication exactly when \(n\) is prime. When \(n = rs\) is composite, with \(1 < r, s < n\), the non-zero classes \([r]\) and \([s]\) have \([r] \cdot [s] = [n] = [0]\), and closure fails, as for \(9 = 3 \cdot 3\), \(4 = 2 \cdot 2\) and \(15 = 3 \cdot 5\). When \(n\) is prime, no product of non-zero classes is \([0]\) and every non-zero class has an inverse. Why is in fields.
\(\mathbb{Z}_p\) is a field
\((\mathbb{Z}_p, +, \cdot)\) is a field when \(p\) is prime. All three conditions of fields hold:
- \((\mathbb{Z}_p, +)\) is an abelian group, as above.
- \((\mathbb{Z}_p - \{[0]\}, \cdot)\) is an abelian group, by the rule just stated.
- The distributive laws are inherited from the integers: \([a] \cdot ([b] + [c]) = [a(b + c)] = [ab + ac] = [a][b] + [a][c]\).
So in \(\mathbb{Z}_p\) every class can be subtracted and every non-zero class divided by, and every equation \([a]x + [b] = [c]\) with \([a] \neq [0]\) has exactly one solution (fields). For composite \(n\), \(\mathbb{Z}_n\) is not a field. \(\mathbb{Z}_7\) is, and \(\mathbb{Z}_4\) and \(\mathbb{Z}_{15}\) are not (2026-10-08-definitions-and-examples-of-fields).
Finding a multiplicative inverse
The inverse of \([a]\) is the class \([b]\) with \(ab \equiv 1 \pmod n\). Read it from the Cayley table, as in 2026-09-24-definitions-and-examples-of-groups, or search: in \(\mathbb{Z}_7\), \([3] \cdot [5] = [15] = [1]\), so \([3]^{-1} = [5]\). This is the relation \(xy \equiv 1 \pmod 7\), whose arrow diagram is in 2026-09-17-relations-reflexivity-symmetry-transitivity: each non-zero number is joined to its inverse.
When there is no table, there are three ways in:
- List the multiples. Write \(a, 2a, 3a, \dots\) mod \(p\), each one the previous plus \(a\), reduced, until \(1\) appears. For \([10]\) in \(\mathbb{Z}_{17}\) the list is \(10, 3, 13, 6, 16, 9, 2, 12, 5, 15, 8, 1\), so \(10 \cdot 12 \equiv 1\) and \([10]^{-1} = [12]\). The search is drawn in 2026-10-08-definitions-and-examples-of-fields. In \(\mathbb{Z}_p\) it always succeeds within \(p - 1\) steps, because the multiples of a non-zero class run through every non-zero class.
- Stop at \(-1\). If \(ab \equiv -1\), then \(a \cdot (-b) \equiv 1\), so \([a]^{-1} = [-b]\). In the same list, \(10 \cdot 5 = 50 \equiv 16 = -1 \pmod{17}\), so \([10]^{-1} = [-5] = [12]\) after five steps instead of twelve.
- Quick cases. \([1]^{-1} = [1]\) and \([p - 1]^{-1} = [p - 1]\), since \((-1)(-1) = 1\). For odd \(p\), \([2]^{-1} = [\frac{p+1}{2}]\), since \(2 \cdot \frac{p+1}{2} = p + 1 \equiv 1\). In \(\mathbb{Z}_{11}\) that gives \([2]^{-1} = [6]\).
The inverses in three small fields, each pair being inverses of each other:
| \(p\) | Own inverse | Pairs |
|---|---|---|
| 5 | \([1]\), \([4]\) | \([2] \leftrightarrow [3]\) |
| 7 | \([1]\), \([6]\) | \([2] \leftrightarrow [4]\), \(\ [3] \leftrightarrow [5]\) |
| 11 | \([1]\), \([10]\) | \([2] \leftrightarrow [6]\), \(\ [3] \leftrightarrow [4]\), \(\ [5] \leftrightarrow [9]\), \(\ [7] \leftrightarrow [8]\) |
In a composite \(\mathbb{Z}_n\) the search can fail. The multiples of \([2]\) in \(\mathbb{Z}_6\) are \([2], [4], [0], [2], \dots\), and \([1]\) never appears, so \([2]\) has no inverse there.
Notation
- Three ways to say one thing. \(n \mid (a - b)\), \(\ a \equiv b \pmod n\), and \([a] = [b]\) in \(\mathbb{Z}_n\) are the same statement. The first is about divisibility, the second about integers, the third about classes.
- \(=\) for classes, \(\equiv\) for integers. \([7] = [0]\) in \(\mathbb{Z}_7\) is true. \(7 = 0\) is false. \(7 \equiv 0 \pmod 7\) is true.
- Brackets are often dropped. The practice problems write \(\mathbb{Z}_9 - \{0\} = \{1, 2, \dots, 8\}\) and “\(2 \cdot 5 = 10 \equiv 1 \pmod 9\)” for what is written here as \(\mathbb{Z}_9 - \{[0]\}\) and \([2] \cdot [5] = [10] = [1]\). It is the same arithmetic.
- The \(-\) in \(\mathbb{Z}_7 - \{[0]\}\) is set difference (sets-and-set-notation): the set \(\mathbb{Z}_7\) with the one element \([0]\) removed.
- \(\bmod\) again. The remainder \(a \bmod n\) is the usual representative of \([a]\) (modular-arithmetic).
Common mistakes
- Treating \([a]\) as the integer \(a\). \([9] = [-1]\) in \(\mathbb{Z}_{10}\), but \(9 \neq -1\).
- Thinking \(\mathbb{Z}_n\) is infinite. It has \(n\) elements. Each element is an infinite set.
- Using the wrong inverse. In \((\mathbb{Z}_7, +)\) the inverse of \([3]\) is \([4]\). In \((\mathbb{Z}_7 - \{[0]\}, \cdot)\) it is \([5]\). Look at the operation first.
- Dividing. There is no \([\frac12]\). An “inverse of \([2]\)” under multiplication means a class \([b]\) with \([2][b] = [1]\), and it may not exist. In \(\mathbb{Z}_p\) it always does: in \(\mathbb{Z}_{11}\) it is \([6]\), so “dividing by 2” there means multiplying by \([6]\).
- Mixing up the two inverses. To undo \(+ [3]\) in \(\mathbb{Z}_{11}\), add \(-[3] = [8]\). To undo \([2] \cdot\), multiply by \([2]^{-1} = [6]\).
- Not checking closure after removing elements. \(\mathbb{Z}_9 - \{[0]\}\) is the example.
See also
- modular-arithmetic — congruence, remainders, and the lemma that makes class arithmetic work
- equivalence-classes-and-partitions — classes and representatives in general
- groups — the definition \(\mathbb{Z}_n\) is checked against
- fields — why \(\mathbb{Z}_n\) is a field exactly when \(n\) is prime, and solving equations in \(\mathbb{Z}_p\)
- subgroups-and-cyclic-groups — cyclic subgroups and cyclic groups; \((\mathbb{Z}_n, +)\) is cyclic, generated by \([1]\)
- cayley-tables — the tables for \(\mathbb{Z}_7 - \{[0]\}\) and \(\mathbb{Z}_5 - \{[0]\}\) and how to read them
- 2026-09-24-definitions-and-examples-of-groups — Lecture 26 · 2026-09-21-equivalence-relations — Lecture 24, where the classes of congruence mod 3 are drawn
- 2026-10-06-elementary-properties-of-groups — Lecture 27, where powers and cyclic subgroups are worked in \(\mathbb{Z}_7 - \{[0]\}\), \(\mathbb{Z}_{11} - \{[0]\}\) and \(\mathbb{Z}_8\)
- 2026-10-08-definitions-and-examples-of-fields — Lecture 28, where \(\mathbb{Z}_4\), \(\mathbb{Z}_7\) and \(\mathbb{Z}_{15}\) are tested and equations are solved in \(\mathbb{Z}_{11}\) and \(\mathbb{Z}_{17}\)
- practice-problems — §33, with full worked solutions
- practice-problems — §36, equations in \(\mathbb{Z}_5\), \(\mathbb{Z}_{11}\), \(\mathbb{Z}_{13}\) and \(\mathbb{Z}_{19}\)
Inverse Functions
When a function can be run backwards, what the backwards function is, and the one notational trap: \(f^{-1}\) means two different things, and the braces tell you which. Builds on one-to-one-and-onto-functions; the preimage half is from functions-on-general-sets; the lecture is 2026-09-07-functions-one-to-one-onto-inverse.
Bijections have inverses
A function that is both one-to-one and onto is said to be a bijection.
A bijection \(f : X \to Y\) has an inverse function \(f^{-1} : Y \to X\), where for all \(y \in Y\), \[f^{-1}(y) = x \text{ where } x \text{ is the unique } x \in X \text{ such that } f(x) = y.\]
Note the direction: \(f : X \to Y\) gives \(f^{-1} : Y \to X\). The inverse’s domain is \(f\)’s co-domain and vice versa.
The definition is exactly one sentence, and both properties are inside it:
- “\(x\) … such that \(f(x) = y\)” — such an \(x\) exists for every \(y\) because \(f\) is onto.
- “the unique \(x\)” — there is only one because \(f\) is one-to-one.
Figure 28: A bijection \(f\) pairs \(x_1\) with \(f(x_1)\) and \(x_2\) with \(f(x_2)\), one arrow each, nothing shared, nothing missed — and so the arrows can be read backwards. The curved arrow above is \(f : X \to Y\); the one below is \(f^{-1} : Y \to X\), the same pairs in the other direction.
Drop either and \(f^{-1}\) is not a function: if \(f\) is not onto, some \(y\) has nowhere to go; if \(f\) is not one-to-one, some \(y\) has two places to go. Both failures are drawn in 2026-09-07-functions-one-to-one-onto-inverse. And the converse holds too:
\[f \text{ has an inverse} \iff f \text{ is a bijection.}\]
Finding the inverse
The onto proof computes it. Proving \(f\) onto means taking an arbitrary \(y\) (or \((a,b)\)) and producing the \(x\) that maps to it, as a formula in \(y\). That formula is \(f^{-1}\). It is a function whether or not \(f\) is one-to-one; one-to-one is what makes it the inverse, by guaranteeing the \(x\) it produces is the only preimage, so that \(f^{-1} \circ f\) is the identity and not merely \(f \circ f^{-1}\).
\(f : \mathbb{R} \times \mathbb{R} \to \mathbb{R} \times \mathbb{R}\), \(f((x,y)) = (y+1, 2x)\) — a bijection (proved in one-to-one-and-onto-functions).
The onto proof took, for \((a,b)\), the candidate \(\left(\frac{b}{2}, a - 1\right)\). So
\[f^{-1} : \mathbb{R} \times \mathbb{R} \to \mathbb{R} \times \mathbb{R}, \qquad f^{-1}((a,b)) = \left(\tfrac{b}{2}, \; a - 1\right), \quad\text{i.e.}\quad f^{-1}((x,y)) = \left(\tfrac{y}{2}, \; x - 1\right).\]
Sense check, both ways: \[f\!\left(f^{-1}((x,y))\right) = f\!\left(\left(\tfrac{y}{2}, x-1\right)\right) = \left((x-1)+1, \; 2 \cdot \tfrac{y}{2}\right) = (x,y),\] \[f^{-1}\!\left(f((x,y))\right) = f^{-1}((y+1, 2x)) = \left(\tfrac{2x}{2}, \; (y+1) - 1\right) = (x,y).\]
In the language of composition-of-functions: \(f \circ f^{-1}\) and \(f^{-1} \circ f\) are both the identity, and checking one of them is the standard way to confirm an inverse has been computed correctly.
For a function given by a formula in one variable the procedure is the same: set \(f(x) = y\), solve for \(x\) in terms of \(y\), and the solution is \(f^{-1}(y)\) — provided the solution is unique and always in the domain, which is what “bijection” guarantees.
The two meanings of \(f^{-1}\)
This is the most common source of wrong answers in this topic.
1. Preimage. If \(f : X \to Y\) is any function and \(A \subseteq Y\), then the inverse image or preimage of \(A\) is \[f^{-1}(A) = \{x \in X : f(x) \in A\}.\] The preimage function is a function \(f^{-1} : \mathcal{P}(Y) \to \mathcal{P}(X)\).
2. Inverse function. If \(f : X \to Y\) is a bijection, then the inverse function of \(f\) is \(f^{-1} : Y \to X\) with $f^{-1}(y) = $ the unique \(x\) such that \(f(x) = y\). The inverse function is a function \(f^{-1} : Y \to X\).
| Takes | Gives | Exists | |
|---|---|---|---|
| preimage \(f^{-1}(A)\) | a subset \(A \subseteq Y\) | a subset of \(X\) | for every function |
| inverse function \(f^{-1}(y)\) | an element \(y \in Y\) | an element of \(X\) | only if \(f\) is a bijection |
Figure 29: The two meanings side by side. Left: a many-to-one \(f\), with a subset \(A\) of \(Y\) (red) and its preimage \(f^{-1}(A)\) (green) — every \(x\) whose arrow lands in \(A\). This exists for any function, and it is a set. Right: a bijective \(f\), every arrow its own, and the single green arrow \(f^{-1}\) running one element back from \(y\) to \(x\). Same symbol; the first eats sets and the second eats elements.
The braces decide. \(f^{-1}(\{a\})\) has a set inside, so it is a preimage and always means something. \(f^{-1}(a)\) has an element inside, so it is the inverse function and means something only if \(f\) is a bijection.
Worked: reading the braces
\(f : \{1,2,3,4\} \to \{a,b,c\}\), \(f = \{(1,a), (2,a), (3,b), (4,b)\}\).
\(f\) is not one-to-one (\(1, 2 \mapsto a\)) and not onto (\(c\) unreached), so it is not a bijection.
| Statement | Because | |
|---|---|---|
| The inverse function \(f^{-1}\) does not exist. | T | \(f\) is not a bijection |
| \(f^{-1}(\{a\}) = \{1,2\}\). | T | preimage: 1 and 2 map to \(a\), nothing else does |
| \(f^{-1}(a)\) is not defined. | T | \(a\) is an element, so this is the inverse function, which does not exist |
| \(f^{-1}(\{c\}) = \emptyset\). | T | preimage: nothing maps to \(c\), and \(\emptyset\) is a perfectly good answer |
All four are true. The second and third differ only in the braces, and one is a set while the other is undefined.
When \(f\) is a bijection the two meanings agree in the obvious way: \(f^{-1}(\{y\}) = \{f^{-1}(y)\}\), a one-element set whose element is the inverse function’s value. That is the only case in which it is safe to blur them, and even then the types differ.
See also
- one-to-one-and-onto-functions — the two properties a bijection needs, and how to prove them
- composition-of-functions — \(f \circ f^{-1}\) and \(f^{-1} \circ f\)
- symmetric-group — the inverse function as the inverse of an element of a group
- groups — \(f(x) = ax + b\) with \(a \neq 0\) has inverse \(f^{-1}(x) = \frac1a x - \frac{b}{a}\), its inverse in the group of such functions
- functions-on-general-sets — image and preimage, where meaning 1 comes from
- sets-and-set-notation — power sets, which the preimage function maps between
- 2026-09-07-functions-one-to-one-onto-inverse — Lecture 19 · 2026-09-08-composition-of-functions — Lecture 20
- practice-problems — §25
Modular Arithmetic, Floor & the Quotient-Remainder Theorem
Floor and ceiling
For a real number \(x\):
- \(\lfloor x \rfloor\) — the floor: move left on the number line to the nearest integer.
- \(\lceil x \rceil\) — the ceiling: move right on the number line to the nearest integer.
So \(\lfloor -3.2 \rfloor = -4\) and \(\lceil -3.2 \rceil = -3\); \(\lfloor 3.2 \rfloor = 3\) and \(\lceil 3.2 \rceil = 4\). Negative numbers are where this goes wrong most often — floor of \(-3.2\) is \(-4\), not \(-3\).
To use floor or ceiling in a proof, it is usually easiest to rewrite the expression as an integer plus an amount between 0 and 1. For instance, in proving “if \(n\) is an odd integer then \(\lceil \frac{n}{2} \rceil = \lfloor \frac{n}{2} \rfloor + 1\)”, write
\[\frac{n}{2} = \frac{2k+1}{2} = k + \frac{1}{2}\]
for some integer \(k\); then \(k + \frac{1}{2}\) sits strictly between \(k\) and \(k+1\), so the floor is \(k\) and the ceiling is \(k+1\). The same move handles things like \(\big\lfloor (p^3 + 4p^2 + 5) + \frac{1}{4} \big\rfloor\) where \(p \in \mathbb{Z}\).
Two ways to compute \(\lfloor \frac{-32}{5} \rfloor\):
- Fraction approach: \(\lfloor \frac{-32}{5} \rfloor = \lfloor \frac{-30}{5} - \frac{2}{5} \rfloor = \lfloor -6 - \frac{2}{5} \rfloor = -7\) (something smaller than \(-6\)).
- Decimal approach: \(\lfloor -6.4 \rfloor = \lfloor -6 - 0.4 \rfloor = -7\).
And \(\lceil \frac{-32}{5} \rceil = -6\).
\(\forall x \in \mathbb{R}, \lfloor x^2 \rfloor = \lfloor x \rfloor^2\) is false — take \(x = \frac{3}{2}\): \(\lfloor \frac{9}{4} \rfloor = 2\) but \(\lfloor \frac{3}{2} \rfloor^2 = 1^2 = 1\).
The quotient-remainder theorem
Given any integer \(n\) and positive integer \(d\), there exist unique integers \(q\) and \(r\) such that
\[n = dq + r \quad \text{and} \quad 0 \leq r < d\]
\(q\) is the quotient (\(n \operatorname{div} d\)) and \(r\) is the remainder (\(n \bmod d\)). Explicitly:
\[q = \left\lfloor \frac{n}{d} \right\rfloor \qquad r = n - d\left\lfloor \frac{n}{d} \right\rfloor\]
With \(d = 6\):
| \(n\) | \(n = dq + r\) | \(q\) | \(r\) |
|---|---|---|---|
| \(53\) | \(6 \cdot 8 + 5\) | \(8\) | \(5\) |
| \(20\) | \(6 \cdot 3 + 2\) | \(3\) | \(2\) |
| \(-19\) | \(6 \cdot (-4) + 5\) | \(-4\) | \(5\) |
Figure 30: Why the remainder is never negative: the general case and the three \(d = 6\) examples on the number line. Each shaded band is one block \([dq, d(q+1))\) of width \(d\); the quotient names the multiple of \(d\) at or below \(n\), so \(r\) is always the rightward gap from that multiple, and \(-19\) therefore has remainder \(5\) rather than \(-1\).
Negative \(n\) is the case to watch: the remainder is still required to be non-negative, so \(-19 \bmod 6 = 5\), not \(-1\). Likewise \(-95 = 11(-9) + 4\), so \(-95 \operatorname{div} 11 = -9\) and \(-95 \bmod 11 = 4\). And \(58 = 11 \cdot 5 + 3\), so \(58 \operatorname{div} 11 = 5\), \(58 \bmod 11 = 3\).
\(\bmod\) versus \(\equiv\) — take care with notation
These are different statements.
- \(n \bmod d = r\) — an equality between numbers: the remainder when \(n\) is divided by \(d\) is \(r\), with \(0 \leq r < d\).
- \(m \equiv n \pmod{d}\) — a relation between \(m\) and \(n\): they leave the same remainder when divided by \(d\).
Example: \(5 \bmod 4 = 1\) and \(9 \bmod 4 = 1\), so \(9 \equiv 5 \pmod 4\) — but \(9 \bmod 4 \neq 5\).
Two equivalent definitions of congruence
For \(m, n, d \in \mathbb{Z}\) with \(d > 0\):
- Definition 1: \(m \equiv n \pmod d\) iff \(m\) and \(n\) have the same remainder under the quotient-remainder theorem.
- Definition 2: \(m \equiv n \pmod d\) iff \(d \mid (m - n)\).
Definition 2 is usually the faster one to check, and the one to reach for in proofs (see divisibility-and-factorisation).
Worked both ways — is \(-50 \equiv 22 \pmod 8\)?
- Definition 1: \(-50 = -56 + 6 = 8(-7) + 6\), so \(-50 \bmod 8 = 6\); and \(22 = 16 + 6\), so \(22 \bmod 8 = 6\). Same remainder, so yes.
- Definition 2: \(22 - (-50) = 72 = 8 \cdot 9\), so \(8 \mid \big(22 - (-50)\big)\), so yes.
Similarly \(53 \equiv -19 \pmod 6\) (both leave remainder 5; and \(53 - (-19) = 72\) is divisible by 6), while \(53 \not\equiv 20 \pmod 6\).
Arithmetic with congruences
Lemma: if \(a \equiv b \pmod d\) and \(m \equiv n \pmod d\), then \[a + m \equiv b + n \pmod d \qquad \text{and} \qquad am \equiv bn \pmod d\]
That is, you may substitute any number for a congruent one before adding or multiplying — which is what makes modular arithmetic cheap.
For example, \(8 \equiv 2 \pmod 3\) and \(46 \equiv 1 \pmod 3\), so \(8 \cdot 46 \equiv 2 \cdot 1 \equiv 2 \pmod 3\) and \(8 + 46 \equiv 2 + 1 \equiv 0 \pmod 3\).
Worked: suppose \(x \bmod 6 = 4\) and \(y \bmod 6 = 3\).
- \((x + y) \bmod 6\): \(x + y \equiv 4 + 3 \equiv 7 \equiv 1 \pmod 6\), so the answer is \(1\).
- \((5x^2 + 4y) \bmod 6\): \(5x^2 + 4y \equiv 5(4)^2 + 4(3) \equiv 5(16) + 12 \equiv 5(4) \equiv 20 \equiv 2 \pmod 6\) — applying the lemma at each step.
Worked: if \(m \bmod 6 = 4\), what is \(35m \bmod 6\)? Since \(35 \bmod 6 = 5\), \(35m \equiv 5 \cdot 4 \equiv 20 \equiv 2 \pmod 6\). And \(3m^2 + 2m + 1 \equiv 3(4)^2 + 2(4) + 1 \equiv 12(4) + 8 + 1 \equiv 8 + 1 \equiv 3 \pmod 6\) — \(3 \cdot 4^2\) is \(12 \cdot 4\), and that term drops out whole, since \(6 \mid 12\).
Worked: an integer \(n\) leaves remainder 4 on division by 7 — what is the remainder of \(3n\)? Write \(n = 7k + 4\); then \(3n = 21k + 12 = 7(3k + 1) + 5\), so the remainder is \(5\). (The course’s solutions PDF has this step as \(7(3k) + 5\), which is \(21k + 5\), not \(21k + 12\); the quotient is \(3k+1\). The answer of 5 is unaffected — see practice-problems.)
Worked: \(m\) leaves remainder 9 on division by 11 — what remainder does \(4m\) leave on division by 22? Write \(m = 11k + 9\); then \(4m = 44k + 36 = 22(2k+1) + 14\), so the remainder is \(14\). (Note the modulus changed, so you cannot just reduce mod 11.)
Divisibility tests
Modular arithmetic explains the familiar tests. A positive integer is divisible by 3 if and only if the sum of its digits is divisible by 3, because \(10 \equiv 1 \pmod 3\) and hence \(10^k \equiv 1 \pmod 3\) for every \(k \in \mathbb{Z}^+\) (apply the multiplication half of the lemma repeatedly: \(10^2 \equiv 1\) from \(a = m = 10\), \(b = n = 1\); then \(10^3 \equiv 1\) from \(a = 10^2\), \(m = 10\); and so on).
\[254 \equiv 2 \cdot 100 + 5 \cdot 10 + 4 \cdot 1 \equiv 2 + 5 + 4 \equiv 11 \equiv 2 \pmod 3\]
so \(254\) is not divisible by 3 and leaves remainder 2 (checking: \(254 = 3 \cdot 84 + 2\)). Whereas
\[3252 \equiv 3 + 2 + 5 + 2 \equiv 12 \equiv 0 \pmod 3\]
so \(3 \mid 3252\).
Worked proofs
For any odd integer \(n\), \(n^2 \bmod 4 = 1\).
Suppose \(n\) is odd, so \(n = 2k+1\) for some \(k \in \mathbb{Z}\). Then \[n^2 = (2k+1)^2 = 4k^2 + 4k + 1 = 4(k^2 + k) + 1.\] Since \(k^2 + k \in \mathbb{Z}\) and \(0 \leq 1 < 4\), the quotient-remainder theorem gives \(n^2 \bmod 4 = 1\). \(\square\)
Hence for any odd integer \(n\), \(\left\lfloor \frac{n^2}{4} \right\rfloor = \frac{n^2 - 1}{4}\). Two routes:
- Method 1 — expand both sides. With \(n = 2k+1\): LHS \(= \lfloor \frac{4k^2+4k+1}{4} \rfloor = \lfloor (k^2+k) + \frac{1}{4} \rfloor = k^2 + k\). RHS \(= \frac{(2k+1)^2 - 1}{4} = \frac{4k^2+4k}{4} = k^2 + k\). Equal.
- Method 2 — use \(r = n - d\lfloor \frac{n}{d} \rfloor\). With number \(n^2\), divisor \(4\), remainder \(1\): \(1 = n^2 - 4\lfloor \frac{n^2}{4} \rfloor\), so \(4\lfloor \frac{n^2}{4} \rfloor = n^2 - 1\) and \(\lfloor \frac{n^2}{4} \rfloor = \frac{n^2-1}{4}\).
For all odd integers \(n\), \(\left\lfloor \frac{n^2}{4} \right\rfloor = \left(\frac{n-1}{2}\right)\left(\frac{n+1}{2}\right)\) — true, since with \(n = 2k+1\) the right-hand side is \(\frac{2k}{2} \cdot \frac{2k+2}{2} = k(k+1)\), matching the \(k^2 + k\) above.
If \(y\) is any integer, then \(y^2\) divided by 5 leaves remainder 0, 1 or 4 — never 2 or 3.
Fix \(y \in \mathbb{Z}\). By the quotient-remainder theorem, \(y = 5m + r\) for some \(m \in \mathbb{Z}\) and \(r \in \{0,1,2,3,4\}\). Then \[y^2 = 25m^2 + 10mr + r^2 \equiv r^2 \pmod 5.\] Checking each case: \(0^2 \equiv 0\), \(1^2 \equiv 1\), \(2^2 \equiv 4\), \(3^2 \equiv 9 \equiv 4\), \(4^2 \equiv 16 \equiv 1 \pmod 5\). So \(y^2 \equiv 0, 1\) or \(4 \pmod 5\). \(\square\)
Figure 31: The case split the proof above runs on: \(\mathbb{Z}\) cut into the five residue classes mod 5. The tints group the classes by the remainder their square leaves, which is what makes \(2\) and \(3\) unreachable.
This “split into cases by remainder” move is the standard way to prove something about every integer using modular arithmetic.
See also
- divisibility-and-factorisation · gcd-lcm-and-euclidean-algorithm · proof-techniques
- sets-and-set-notation — congruence classes as sets, and the partitions of \(\mathbb{Z}\) they give
- equivalence-relations · integers-modulo-n — congruence as an equivalence relation, and its classes as the number system \(\mathbb{Z}_n\)
- pigeonhole-principle — the \(n\) remainders as pigeonholes: among any \(n + 1\) integers, two differ by a multiple of \(n\)
- practice-problems — §14 Modular Arithmetic, with full worked solutions
One-to-One and Onto Functions
The two properties a function \(f : X \to Y\) can have beyond being a function at all — injective (one-to-one) and surjective (onto) — with the proof templates for showing each and for showing its failure. Together they make a bijection, which is what inverse-functions needs. The definition of a function is in functions-on-general-sets; the lecture is 2026-09-07-functions-one-to-one-onto-inverse.
The definitions
Let \(f\) be a function, \(f : X \to Y\).
Injective function (one-to-one function): \(\forall x_1, x_2 \in X\), if \(f(x_1) = f(x_2)\) then \(x_1 = x_2\).
Surjective function (onto function): \(\forall y \in Y\), \(\exists x \in X\) such that \(f(x) = y\).
A function that is both one-to-one and onto is a bijection.
In words: one-to-one means no two inputs share an output — different inputs, different outputs. Onto means every element of the co-domain is hit — the range is the whole of \(Y\). Each name has a Latin and an English form, used interchangeably: injective / one-to-one, surjective / onto, bijective / one-to-one correspondence.
The two are about opposite ends of the arrows. One-to-one is a condition on the domain side: arrows never merge. Onto is a condition on the co-domain side: nothing is left unreached. They are independent, and all four combinations occur:
Figure 32: The four combinations, on the smallest sets that show them. Top left: one-to-one but not onto — arrows never merge, but the third dot of \(Y\) is missed. Top right: onto but not one-to-one — everything in \(Y\) is hit, but two arrows merge. Bottom left: both, a bijection — a perfect pairing. Bottom right: neither. A red ring marks the offending element of \(Y\) in each failing panel — a target that two arrows share, or a dot no arrow reaches; in the neither panel it marks one of each kind.
For finite sets the picture gives a counting fact for free: one-to-one forces \(|X| \leq |Y|\), onto forces \(|X| \geq |Y|\), and a bijection forces \(|X| = |Y|\). That is the beginning of the next topic, [cardinality], where the same three facts become the definitions of \(\leq\), \(\geq\) and \(=\) for sets of any size.
On the real line
The graph versions of the two tests:
| Test on the graph | Example | |
|---|---|---|
| one-to-one | no horizontal line meets the graph twice | \(2^x\) passes; \(x^3 - x\) fails, \(x^2\) fails |
| onto \(\mathbb{R}\) | every horizontal line meets the graph at least once | \(x^3 - x\) passes; \(2^x\) fails (never \(\leq 0\)), \(x^2\) fails |
The vertical line test decides whether a curve is a function at all (functions-on-general-sets); the horizontal line test decides one-to-one.
Changing the co-domain
Onto depends on the declared co-domain, so it can be switched on by declaring a smaller one:
\[f : \mathbb{R} \to \mathbb{R}, \; f(x) = x^2 \text{ is not onto}; \qquad g : \mathbb{R} \to \mathbb{R}^{\geq 0}, \; g(x) = x^2 \text{ is onto.}\]
Same pairs, different function, because \(Y\) is part of what a function is. Any function becomes onto its own range. One-to-one, by contrast, is a fact about the pairs alone and cannot be adjusted by relabelling the co-domain — though it can be switched on by shrinking the domain, which is how \(\sqrt{\;}\) gets to be the inverse of \(x^2\) on \(\mathbb{R}^{\geq 0}\).
How to prove it
| To show \(f : X \to Y\) is … | Template |
|---|---|
| one-to-one | Suppose \(x_1, x_2 \in X\) with \(f(x_1) = f(x_2)\). … Hence \(x_1 = x_2\). \(\square\) |
| not one-to-one | Exhibit \(x_1, x_2 \in X\) with \(x_1 \neq x_2\) and \(f(x_1) = f(x_2)\). |
| onto | Let \(y \in Y\). Take \(x = \ldots\) (in terms of \(y\)). Check \(x \in X\). Check \(f(x) = y\). \(\square\) |
| not onto | Exhibit \(y \in Y\) such that \(f(x) \neq y\) for all \(x \in X\) (and say why). |
The shape follows the quantifiers (quantified-statements). One-to-one and onto are both universal statements, so proving them means starting from an arbitrary element and arguing in general; their negations are existential, so disproving means producing one witness. This is the same logic as the element method for sets (proving-set-properties), and the same warning applies: checking examples proves neither property, it can only disprove one.
One-to-one: algebra
\(g : \mathbb{Z} \to \mathbb{Z}^{\text{odd}}\), \(g(x) = 2x + 3\).
Let \(x_1, x_2 \in \mathbb{Z}\) with \(g(x_1) = g(x_2)\). Then \(2x_1 + 3 = 2x_2 + 3\), so \(2x_1 = 2x_2\), so \(x_1 = x_2\). \(\therefore g\) is one-to-one. \(\square\)
The proof is “undo the function”: peel operations off both sides until the inputs are exposed. Every step must be reversible-in-effect — dividing by 2 is fine; squaring both sides would not be, which is exactly why \(x^2\) is not one-to-one.
Onto: solve backwards, then run forwards
Same \(g\). Scratch work (not part of the proof): want \(x\) with \(2x + 3 = y\), so \(x = \frac{y - 3}{2}\).
Proof. Let \(y \in \mathbb{Z}^{\text{odd}}\). Take \(x = \frac{y-3}{2}\). Since \(y\) is odd, \(y - 3\) is even, so \(x \in \mathbb{Z}\). And \(g(x) = 2 \cdot \frac{y-3}{2} + 3 = y\). \(\therefore g\) is onto. \(\square\)
Three moves, always in this order: name the candidate, check it is in the domain, check it maps to \(y\). The middle one is where onto proofs go wrong. Here it is the only place the oddness of \(y\) is used; drop it and the same lines “prove” that \(2x + 3\) is onto all of \(\mathbb{Z}\), which is false (\(y = 4\) needs \(x = \frac{1}{2}\)).
Pairs as inputs
\(f : \mathbb{R} \times \mathbb{R} \to \mathbb{R} \times \mathbb{R}\), \(f((x,y)) = (y + 1, 2x)\).
One-to-one. Suppose \(f((x_1,y_1)) = f((x_2,y_2))\). Then \((y_1 + 1, 2x_1) = (y_2 + 1, 2x_2)\), so \(y_1 + 1 = y_2 + 1\) and \(2x_1 = 2x_2\); hence \(y_1 = y_2\) and \(x_1 = x_2\), so \((x_1,y_1) = (x_2,y_2)\). \(\square\)
Onto. Let \((a,b) \in \mathbb{R} \times \mathbb{R}\). Take \(\left(\frac{b}{2}, a - 1\right) \in \mathbb{R} \times \mathbb{R}\). Then \(f\!\left(\left(\frac{b}{2}, a-1\right)\right) = ((a-1)+1, 2 \cdot \frac{b}{2}) = (a,b)\). \(\square\)
Two ordered pairs are equal exactly when both coordinates are, so one equation of pairs is two equations of numbers, and both must be carried through. The coordinates also cross over — the output’s first entry comes from the input’s second — which is why the candidate in the onto proof has \(b\) first.
Disproofs
\(f : \mathbb{Z} - \{-1,0,1\} \to \mathbb{Z}^{>1}\), \(f(x) =\) the largest prime divisor of \(x\).
Not one-to-one: \(f(10) = 5 = f(15)\) and \(10 \neq 15\). Not onto: \(4 \in \mathbb{Z}^{>1}\), but \(4\) is not prime, so no \(x\) has \(f(x) = 4\) — the range of \(f\) is the set of primes, a proper subset of \(\mathbb{Z}^{>1}\). Both are one line, because both are witnesses.
Is it even a function?
Before either property, the candidate has to be a function. These are examples of how that fails (functions-on-general-sets):
- \(f : \mathbb{Z}^{+} \to \mathbb{Z}^{+}\), \(f(n) = \frac{(n+1)(n+3)}{3}\) — lands outside the co-domain (\(n = 1\) gives \(\frac{8}{3}\)).
- \(f : \mathbb{Q} \to \mathbb{Z}\), \(f\!\left(\frac{m}{n}\right) = m\) — one input, two values: \(f\!\left(\frac{1}{2}\right) = 1\) but \(f\!\left(\frac{2}{4}\right) = 2\), and \(\frac{1}{2} = \frac{2}{4}\). A rule that depends on how the input is written is not well defined.
- \(\{(x,y) : y^2 = x\}\) and \(\{(x,y) : x = \lvert y \rvert\}\) — one input, two values again: \((4,2)\) and \((4,-2)\); \((1,1)\) and \((1,-1)\).
A constant function (\(f(x) = 1\)) and \(f(n) = n!\) on \(\mathbb{Z}^{+}\) are functions; the constant one is neither one-to-one nor onto \(\mathbb{R}\), which makes it the fourth panel of Figure 32.
See also
- inverse-functions — what a bijection buys you
- composition-of-functions — how the two properties behave under \(g \circ f\)
- functions-on-general-sets — the definition, co-domain versus range
- counting-selections — a one-to-one function from an \(r\)-element set to an \(n\)-element set picks \(r\) different images in order, so there are \(\frac{n!}{(n-r)!}\) of them
- pigeonhole-principle — no function from a finite set to a smaller one is one-to-one, the pigeonhole principle
- quantified-statements · proof-techniques — why the templates have the shape they have
- 2026-09-07-functions-one-to-one-onto-inverse — Lecture 19
- practice-problems — §25
Partial Order Relations
A partial order is a relation that ranks the elements of a set: it is reflexive, antisymmetric and transitive. If in addition every two elements can be compared, it is a total order. The property that is new here is in antisymmetric-relations, and the picture of a partial order is its Hasse diagram. First met in 2026-09-22-partial-order-relations.
The definitions
A relation \(R\) on a set \(S\) is a partial order relation if and only if \(R\) is
- Reflexive;
- Antisymmetric; and
- Transitive.
If \(R\) is a relation on a set \(S\), then two elements \(a, b \in S\) are comparable if and only if \(a \mathrel{R} b\) or \(b \mathrel{R} a\).
A relation \(R\) on a set \(S\) is a total order relation if and only if \(R\) is
- Reflexive;
- Antisymmetric;
- Transitive; and
- Any two elements of \(S\) are comparable.
Any total order relation is a partial order relation.
A partial order relation is a total order relation if and only if every two elements are comparable.
The model is \(\leq\) on numbers, and it helps to read \(a \mathrel{R} b\) as “\(a\) is below or equal to \(b\)”. Partial refers to condition 4 being absent. In a partial order some pairs may not be ranked against each other at all. Partial does not mean “not total”: a total order is a partial order that happens to rank every pair.
Comparable elements
Two elements are comparable when they are related in some direction. They are non-comparable when neither \(a \mathrel{R} b\) nor \(b \mathrel{R} a\) holds.
| Relation | Comparable | Non-comparable |
|---|---|---|
| \(\subseteq\) on \(\mathcal{P}(\mathbb{Z})\) | \(\{7\}\) and \(\{7,9\}\) | \(\{7\}\) and \(\{9\}\); \(\{1,2,3\}\) and \(\{1,2,4\}\) |
| divides on \(\mathbb{Z}^{+}\) | 2 and 6 | 2 and 3 |
| \(\leq\) on \(\mathbb{R}\) | every pair | none |
The first row is worked in 2026-09-22-partial-order-relations.
- Non-comparable is not “different”. \(\{7\}\) and \(\{7,9\}\) are different and comparable.
- Non-comparable is not “disjoint” or “unlike”. \(\{1,2,3\}\) and \(\{1,2,4\}\) share two elements and are still non-comparable, because neither contains the other.
- Both directions have to fail. \(6 \nmid 2\) on its own does not make 2 and 6 non-comparable, because \(2 \mid 6\).
- The elements have to be in the set. 7 and 9 are not comparable under \(\subseteq\) on \(\mathcal{P}(\mathbb{Z})\), and not non-comparable either: they are not elements of \(\mathcal{P}(\mathbb{Z})\).
In a partial order every element is comparable with itself, because the relation is reflexive. The definition of comparable applies to any relation, and in a relation that is not reflexive an element is comparable with itself only if it has a loop, as in the six-point example of 2026-09-22-partial-order-relations.
Proving a relation is a partial order
Three labelled parts, as for an equivalence relation (equivalence-relations), with the middle one changed:
| Part | Start with | Show |
|---|---|---|
| reflexive | Let \(a \in S\). | \(a \mathrel{R} a\) |
| antisymmetric | Let \(a, b \in S\) and suppose \(a \mathrel{R} b\) and \(b \mathrel{R} a\). | \(a = b\) |
| transitive | Let \(a, b, c \in S\) and suppose \(a \mathrel{R} b\) and \(b \mathrel{R} c\). | \(a \mathrel{R} c\) |
Worked: divides on \(\mathbb{Z}^{+}\)
The proof is written out in full in 2026-09-22-partial-order-relations. Unfold \(a \mid b\) as \(b = ak\) for some \(k \in \mathbb{Z}\) (divisibility-and-factorisation).
- Reflexive. \(a = a \cdot 1\), so \(a \mid a\).
- Antisymmetric. If \(b = ak\) and \(a = b\ell\) then \(b = b(\ell k)\), so \(\ell k = 1\). Both are positive, so \(\ell = k = 1\) and \(a = b\).
- Transitive. If \(b = ak\) and \(c = b\ell\) then \(c = a(k\ell)\) and \(k\ell \in \mathbb{Z}\), so \(a \mid c\).
Worked: \(\subseteq\) on a set of sets
Let \(S\) be any set of sets, for instance a power set.
- Reflexive. Every set is a subset of itself: \(X \subseteq X\).
- Antisymmetric. If \(X \subseteq Y\) and \(Y \subseteq X\) then \(X = Y\) (sets-and-set-notation).
- Transitive. If \(X \subseteq Y\) and \(Y \subseteq Z\), then every element of \(X\) is in \(Y\) and so in \(Z\): \(X \subseteq Z\).
Proper subset, \(\subset\), is not a partial order under this definition: it is not reflexive (2026-09-17-relations-reflexivity-symmetry-transitivity). The same goes for \(<\) on \(\mathbb{R}\). Both are antisymmetric and transitive, and neither has a single loop.
Total or not
Once a relation is known to be a partial order, totality is one more “for all”: for all \(a, b \in S\), \(a \mathrel{R} b\) or \(b \mathrel{R} a\).
| How | |
|---|---|
| To show it is total | Let \(a, b \in S\). Show that \(a \mathrel{R} b\) or \(b \mathrel{R} a\), usually by splitting into cases. |
| To show it is not total | Find one pair that is not comparable. |
Divides on \(\mathbb{Z}^{+}\) is not total: \(2 \nmid 3\) and \(3 \nmid 2\). One pair that cannot be compared is the whole answer. With \(\tau\) for “divides” it is written \(2 \mathrel{\not\tau} 3\) and \(3 \mathrel{\not\tau} 2\).
A total order by cases (practice-problems, Q1): for \(x \mathrel{\rho} y \leftrightarrow x^3 - 1 < y^3\) on \(\mathbb{Z}\), take two different integers \(x, y\). Then \(x^3 \neq y^3\), so either \(x^3 < y^3\), giving \(x \mathrel{\rho} y\), or \(y^3 < x^3\), giving \(y \mathrel{\rho} x\).
Whether an order is total depends on the set. Take “divides” on \(\{1, 2, 4, 8, 16\}\). There each number divides all the later ones, every two are comparable, and the order is total. On a set that contains 2 and 3 it is not.
Figure 33: The relation divides on two sets, drawn as Hasse diagrams: a line means the lower number divides the upper one, and so does any path that goes up all the way. Left: on \({1,2,4,8,16}\) the diagram is a single column. Any two numbers are joined by an upward path, so every two are comparable and the order is total. Right: on \({1,2,3,6}\) the diagram branches. 2 and 3, shaded, are not joined by an upward path, since neither divides the other, so the order is partial and not total.
The examples side by side
| Relation | on | Partial order? | Total order? |
|---|---|---|---|
| \(\leq\) | \(\mathbb{R}\) | yes | yes |
| divides | \(\mathbb{Z}^{+}\) | yes | no: 2 and 3 |
| divides | \(\{1,2,4,8,16\}\) | yes | yes |
| \(\subseteq\) | \(\mathcal{P}(\{1,2,3\})\) | yes | no: \(\{1\}\) and \(\{2\}\) |
| \(\subseteq\) | \(\mathcal{P}(\mathbb{Z})\) | yes | no: \(\{7\}\) and \(\{9\}\) |
| \(x^3 - 1 < y^3\) | \(\mathbb{Z}\) | yes | yes |
| five elements in a single column | five elements | yes | yes |
| the same with a sixth element at the side | six elements | yes | no |
| \(\operatorname{weight}(s) \leq \operatorname{weight}(t)\) | binary strings of length 6 | no: not antisymmetric | — |
| \(<\) | \(\mathbb{R}\) | no: not reflexive | — |
| divides | \(\mathbb{Z}\) | no: not antisymmetric | — |
Rows 6 and 9 are Q1 and Q2 of practice-problems. Rows 7 and 8 are the two diagrams of 2026-09-22-partial-order-relations.
Equivalence relations and partial orders
The two kinds of relation the course singles out differ in one property.
| Equivalence relation | Partial order | |
|---|---|---|
| Properties | reflexive, symmetric, transitive | reflexive, antisymmetric, transitive |
| Between two different related elements | arrows both ways, always | an arrow one way only, always |
| What it does to the set | sorts it into classes | ranks it |
| Its picture | separate clusters, a partition | a Hasse diagram |
| Standard examples | \(=\), congruence mod \(n\), same parity | \(\leq\), \(\subseteq\), divides on \(\mathbb{Z}^{+}\) |
| Notes | equivalence-relations, equivalence-classes-and-partitions | partial-order-relations, hasse-diagrams |
A relation that is both an equivalence relation and a partial order is symmetric and antisymmetric, so all its arrows are loops (antisymmetric-relations), and reflexive, so it has every loop. It is equality.
Common mistakes
- Taking “partial order” to mean “not a total order”. Every total order is a partial order.
- Proving “not symmetric” where “antisymmetric” is wanted. They are different properties (antisymmetric-relations).
- Calling \(<\) or \(\subset\) a partial order. With this course’s definition a partial order is reflexive.
- Declaring a pair non-comparable after checking one direction.
- Showing a relation is total with an example. “2 and 4 are comparable” proves nothing about every pair. Not total, on the other hand, needs only one pair.
- Forgetting the set. Divides is a partial order on \(\mathbb{Z}^{+}\), a total order on \(\{1,2,4,8,16\}\), and not even antisymmetric on \(\mathbb{Z}\).
See also
- antisymmetric-relations — the property that separates a partial order from an equivalence relation
- hasse-diagrams — the standard drawing of a partial order
- reflexive-symmetric-and-transitive-relations — reflexive and transitive, with their proof templates
- equivalence-relations — the other important kind of relation
- divisibility-and-factorisation · sets-and-set-notation — the two standard partial orders, divides and \(\subseteq\)
- 2026-09-22-partial-order-relations — Lecture 25
- practice-problems — §32, with full worked solutions
Practice Problems — the Semester-wide Set
This is the course’s one problem set for the whole semester — a single document rather than a per-week handout. 46 sections, one per pre-work video, each with the relevant textbook pages, a set of practice problems and full worked solutions. Everything is reproduced here in full, so you never need to open the PDF.
Applied Classes start in Week 2 and run to Week 13 — twelve of them, matching the “best 8 of 12” Applied Classes component worth 30% (see math1061). Each week’s class applies the previous week’s lecture content, so the material a class covers runs roughly one week behind the lecture column below. Which sections a given Applied Class draws on is not stated in any of the source material.
These problems belong to the roughly three hours of individual study each week, which are for revising the videos, readings and classes and completing the Practice Problems. They are the out-of-class half of the course, and they are not the same thing as the Assessed Exercises, which are done and submitted inside the class itself. (That class goes by two names, the Active Class and the Applied Class. They are one session.)
How each section is laid out
- Relevant textbook pages for Epp 4th edition and 5th (metric) edition
- Practice problems
- Solutions — full worked solutions, not just answers
- Occasionally a non-assessable Application block (see the table below)
Errata
The source document carries an errata page listing corrections made during semester. Last update: 24 August 2026, with two entries:
- On page 195, the solution to 1(b) was corrected (the note in brackets had previously copied the note from 1(a)) — already applied in §45 below.
- Question 2 in section 30 has been updated, and the original version moved to section 32 (because it refers to antisymmetry) — applied in §30 and §32 below.
If something looks wrong, post on the Ed Discussion board.
Section index
Every section is below, with its topic and textbook page ranges. Each section goes with one pre-work video (§1 with Video 001, and so on up to Video 046), and the Lecture (week) column places it in the schedule of math1061 by that video number. The Notes column links to the concept note covering that material where one exists; the rest are still ahead in the semester.
| § | Topic | Lecture (week) | 4th ed. | 5th ed. | Notes |
|---|---|---|---|---|---|
| 1 | Logical Form | L2 (wk 1) | 023–029 | 037–043 | logical-connectives |
| 2 | Logical Equivalence | L2 (wk 1) | 030–038 | 043–053 | logical-equivalence-laws |
| 3 | Conditional Statements | L3 (wk 1) | 039–050 | 053–066 | conditional-statements |
| 4 | Valid and Invalid Arguments | L4 (wk 2) | 051–063 | 066–079 | valid-argument-forms |
| 5 | Methods for Determining Validity | L5 (wk 2) | 051–063 | 066–079 | determining-argument-validity |
| 6 | Quantified Statements | L5 (wk 2) | 096–108 | 108–121 | quantified-statements |
| 7 | Negation of Quantified Statements | L6 (wk 2) | 108–117 | 122–131 | quantified-statements |
| 8 | Statements with Multiple Quantifiers | L6 (wk 2) | 117–131 | 131–146 | quantified-statements |
| 9 | Direct Proofs and Counterexamples | L7 (wk 3) | 145–163 | 160–182 | proof-techniques |
| 10 | Proof by Contradiction | L8 (wk 3) | 198–207 | 218–228 | proof-techniques |
| 11 | Proof by Contraposition | L9 (wk 3) | 198–207 | 218–228 | proof-techniques |
| 12 | Rational Numbers | L9 (wk 3) | 163–170 | 183–190 | rational-and-irrational-numbers |
| 13 | Divisibility | L10 (wk 4) | 170–179 | 190–199 | divisibility-and-factorisation |
| 14 | Modular Arithmetic | L11 (wk 4) | 482–485 | 528–531 | modular-arithmetic |
| 15 | The Euclidean Algorithm | L12 (wk 4) | 220–224 | 250–254 | gcd-lcm-and-euclidean-algorithm |
| 16 | Sequences | L13 (wk 5) | 227–244 | 258–275 | sequences-and-summations |
| 17 | Mathematical Induction | L13 (wk 5) | 244–268 | 275–301 | mathematical-induction |
| 18 | Strong Induction and the Well Ordering Principle | L14 (wk 5) | 268–279 | 301–314 | strong-induction-and-the-well-ordering-principle |
| 19 | Recursive Definitions | L15 (wk 6) | 290–304 | 325–340 | recursive-definitions |
| 20 | Solving Recurrence Relations | L16 (wk 6) | 304–328 | 340–364 | solving-recurrence-relations |
| 21 | Set Theory Definitions | L17 (wk 6) | 336–351 | 377–391 | sets-and-set-notation |
| 22 | More Definitions and Examples of Sets | L17 (wk 6) | 336–351 | 377–391 | sets-and-set-notation |
| 23 | Properties of Sets | L18 (wk 7) | 352–366 | 391–407 | proving-set-properties |
| 24 | Functions Defined on General Sets | L18 (wk 7) | 383–396 | 425–439 | functions-on-general-sets |
| 25 | one-to-one, Onto, and Inverse Functions | L19 (wk 7) | 397–416 | 439–461 | |
| 26 | Composition of Functions | L20 (wk 7) | 416–427 | 461–472 | |
| 27 | Cardinalities | L21 (wk 8) | 428–441 | 473–486 | |
| 28 | Countable and Uncountable Sets | L22 (wk 8) | 428–441 | 473–486 | |
| 29 | Relations on Sets | L23 (wk 8) | 442–449 | 487–494 | |
| 30 | Reflexivity, Symmetry, Transitivity | L23 (wk 8) | 449–459 | 495–505 | |
| 31 | Equivalence Relations | L24 (wk 9) | 459–478 | 505–523 | |
| 32 | Partial Order Relations | L25 (wk 9) | 498–515 | 546–563 | |
| 33 | Definitions and Examples of Groups | L26 (wk 9) | — | — | |
| 34 | Elementary Properties of Groups | L27 (wk 10) | — | — | |
| 35 | Group Isomorphisms | not scheduled | — | — | |
| 36 | Definitions and Examples of Fields | L28 (wk 10) | — | — | |
| 37 | Introduction to Counting | L29 (wk 11) | 516–553 | 564–604 | |
| 38 | Counting Selections | L30 (wk 11) | 516–553 | 564–604 | |
| 39 | Introduction to Probability | L31 (wk 12) | 516–553 | 564–604 | |
| 40 | Binomial Coefficients | L31 (wk 12) | 565–591 | 617–641 | |
| 41 | Inclusion Exclusion | L32 (wk 12) | 545–549 | 595–599 | |
| 42 | The Pigeonhole Principle | L33 (wk 12) | 554–565 | 604–616 | |
| 43 | Introduction to Graph Theory | L33 (wk 12) | 625–660 | 677–697 | |
| 44 | Walks, Trails and Circuits | L34 (wk 12) | 625–660 | 677–697 | |
| 45 | Matrix Representations of Graphs | L35 (wk 13) | 661–675 | 698–712 | |
| 46 | Trees | L36 (wk 13) | 683–701 | 720–742 |
§35 Group Isomorphisms has no lecture in the published schedule — the Week 10 row jumps from L27 (V34) to L28 (V36). The section itself carries no practice problems and is marked optional and will not be assessed, so the gap is deliberate.
§28 Countable and Uncountable Sets carries its own note in the source: this content will not be assessed in MATH1061. It still has a full set of problems and solutions.
Sections 33–36 (groups and fields) list no textbook page ranges.
Non-assessable application blocks
Eight sections carry an extra block of problems, not assessable for MATH1061, mostly drawn from K. Rosen, Discrete Mathematics and its Applications, 7th ed. (1991), with two from Epp. They connect the pure material to computer science, and are reproduced in full alongside their sections.
| After § | Block | Source |
|---|---|---|
| 2 | Applications to Computer Science — bit strings and logic circuits | Rosen pp. 20–24 |
| 5 | Applications of Valid and Invalid Arguments | Rosen pp. 48–68 |
| 9 | Applications of Proofs to Computer Science — resolution and automated theorem proving | Rosen pp. 74–80 |
| 15 | Trace Tables for Algorithms — the Division and Euclidean algorithms | Epp §4.8 (4th ed.) / §4.10 (5th ed.) |
| 21 | Computer Representations of Sets | Rosen pp. 134–138 |
| 28 | Computability of Functions | Rosen pp. 170–177 |
| 31 | Identifiers — C identifiers as an equivalence-relation example | Rosen pp. 608–618 |
| 37 | Runtime — counting basic instructions | Epp 5th ed. pp. 787–799 |
A note on the diagrams: the source PDF draws logic circuits, graphs and Hasse diagrams as figures. Those are reproduced here as explicit gate netlists and edge lists, which carry the same information in a form that renders everywhere.
§1 — Logical Form
Epp 4th ed. pp. 023–029 · 5th ed. (metric) pp. 037–043. Lecture 2 (week 1). Notes: logical-connectives.
Problems
Write a truth table for the statement form \(p \wedge (\sim q \vee r)\).
Suppose you know that \((\sim p \wedge q) \vee p\) is false. What can you conclude about the truth values of each of the two variables?
Let \(p\) be the statement “DATAENDFLAG is off,” \(q\) the statement “ERROR equals 0,” and \(r\) the statement “SUM is less than 1,000.” Express the following sentences in symbolic notation.
DATAENDFLAG is off, ERROR equals 0, and SUM is less than 1,000.
DATAENDFLAG is off but ERROR is not equal to 0.
DATAENDFLAG is off; however, ERROR is not 0 or SUM is greater than or equal to 1,000.
DATAENDFLAG is on and ERROR equals 0 but SUM is greater than or equal to 1,000.
Either DATAENDFLAG is on or it is the case that both ERROR equals 0 and SUM is less than 1,000.
Solutions
The truth table is
\(p\) \(q\) \(r\) \(\sim q\) \(\sim q \vee r\) \(p \wedge (\sim q \vee r)\) T T T F T T T T F F F F T F T T T T T F F T T T F T T F T F F T F F F F F F T T T F F F F T T F We know \((\sim p \wedge q) \vee p\) is false. A disjunction is false only when both parts are false, so we must have
\[p \text{ is false} \quad \text{and} \quad (\sim p \wedge q) \text{ is false.}\]
From \(p\) being false, it follows that \(\sim p\) is true. Now \((\sim p \wedge q)\) can be false only if \(q\) is false (since \(\sim p\) is already true). Hence \(q\) is false.
Therefore \(p\) is false and \(q\) is false.
\(p \wedge q \wedge r\).
\(p \wedge \sim q\).
\(p \wedge (\sim q \vee \sim r)\).
\(\sim p \wedge q \wedge \sim r\).
\(\sim p \vee (q \wedge r)\).
§2 — Logical Equivalence
Epp 4th ed. pp. 030–038 · 5th ed. (metric) pp. 043–053. Lecture 2 (week 1). Notes: logical-equivalence-laws.
Problems
Use the laws of logical equivalence to show that \(p \wedge q \equiv \; \sim (\sim p \vee \sim q)\).
Use the laws of logical equivalence to show that \(\sim (p \vee \sim q) \vee (\sim p \wedge \sim q) \equiv \; \sim p\).
For each of the following, write down a truth table for the statement, and determine whether the statement is a tautology, a contradiction, or neither.
\(((p \wedge q) \vee (q \wedge r)) \vee \sim q\)
\((\sim p \vee q) \vee (p \wedge \sim q)\)
Use De Morgan’s laws to write sentences equivalent to the following:
It is not true that I am studying Computer Science and I am studying Engineering.
I am not going to the movies this weekend or I am not going swimming this weekend.
Let \(\oplus\) denote exclusive or, which means ‘… or … but not both’. The truth table for \(p \oplus q\) is as follows:
\(p\) \(q\) \(p \oplus q\) T T F T F T F T T F F F Use a truth table to show that \((p \vee q) \wedge \sim p \equiv q \wedge \sim p\).
Use a truth table to show that \((p \oplus q) \wedge r \equiv (p \wedge r) \oplus (q \wedge r)\).
Use the laws of logical equivalence and the equivalence \(p \oplus q \equiv (p \vee q) \wedge \sim (p \wedge q)\) (which is the definition of \(\oplus\)) to show that
\[(p \oplus q) \wedge r \equiv (p \wedge r) \oplus (q \wedge r).\]
Solutions
- We have
\[\begin{aligned} \sim\big(\sim p \vee \sim q\big) &\equiv \; \sim(\sim p) \wedge \sim(\sim q) && \text{by De Morgan's law} \\ &\equiv p \wedge q && \text{by the double negative law (used twice).} \end{aligned}\]
- We have
\[\begin{aligned} \sim (p \vee \sim q) \vee (\sim p \wedge \sim q) &\equiv (\sim p \wedge \sim \sim q) \vee (\sim p \wedge \sim q) && \text{by De Morgan's law} \\ &\equiv (\sim p \wedge q) \vee (\sim p \wedge \sim q) && \text{by the double negative law} \\ &\equiv \; \sim p \wedge (q \vee \sim q) && \text{by the distributive law} \\ &\equiv \; \sim p \wedge \mathbf{t} && \text{by the negation law} \\ &\equiv \; \sim p && \text{by the identity law.} \end{aligned}\]
- We have
\(p\) \(q\) \(r\) \(p \wedge q\) \(q \wedge r\) \((p \wedge q) \vee (q \wedge r)\) \(\sim q\) \(\big((p \wedge q) \vee (q \wedge r)\big) \vee \sim q\) T T T T T T F T T T F T F T F T T F T F F F T T T F F F F F T T F T T F T T F T F T F F F F F F F F T F F F T T F F F F F F T T Thus the statement is neither a tautology nor a contradiction.
- We have
\(p\) \(q\) \(\sim p\) \(\sim p \vee q\) \(\sim q\) \(p \wedge \sim q\) \((\sim p \vee q) \vee (p \wedge \sim q)\) T T F T F F T T F F F T T T F T T T F F T F F T T T F T Hence the statement is a tautology.
- Let \(C\) be the statement “I am studying Computer Science” and \(E\) be the statement “I am studying Engineering.” The given statement is \(\sim (C \wedge E)\). By De Morgan’s law,
\[\sim (C \wedge E) \equiv (\sim C) \vee (\sim E).\]
So an equivalent statement is: “I am not studying Computer Science or I am not studying Engineering.”
- Let \(M\) be the statement “I am going to the movies this weekend” and \(S\) be the statement “I am going swimming this weekend.” The given sentence is \((\sim M) \vee (\sim S)\). By De Morgan’s law (in reverse),
\[(\sim M) \vee (\sim S) \equiv \; \sim (M \wedge S).\]
So an equivalent statement is: “It is not the case that I am both going to the movies this weekend and going swimming this weekend.”
- We have
\(p\) \(q\) \(p \vee q\) \(\sim p\) \((p \vee q) \wedge \sim p\) \(q \wedge \sim p\) T T T F F F T F T F F F F T T T T T F F F T F F Since the last two columns agree on every row, we have \((p \vee q) \wedge \sim p \equiv q \wedge \sim p\).
- We have
\(p\) \(q\) \(r\) \(p \oplus q\) \((p \oplus q) \wedge r\) \(p \wedge r\) \(q \wedge r\) \((p \wedge r) \oplus (q \wedge r)\) T T T F F T T F T T F F F F F F T F T T T T F T T F F T F F F F F T T T T F T T F T F T F F F F F F T F F F F F F F F F F F F F The columns for \((p \oplus q) \wedge r\) and \((p \wedge r) \oplus (q \wedge r)\) match on all rows, hence \((p \oplus q) \wedge r \equiv (p \wedge r) \oplus (q \wedge r)\).
- To save space, multiple laws have been applied in some steps. There are many different ways to apply the laws to prove this, so your proof may look different to this one. We have
\[\begin{aligned} &(p \wedge r) \oplus (q \wedge r) \\ &\equiv \big((p \wedge r) \vee (q \wedge r)\big) \wedge \sim \big((p \wedge r) \wedge (q \wedge r)\big) && \text{by the given equivalence (def of } \oplus) \\ &\equiv (p \vee q) \wedge r \wedge \sim \big((p \wedge r) \wedge (q \wedge r)\big) && \text{by distributive and commutative laws (for } \wedge r) \\ &\equiv (p \vee q) \wedge r \wedge \sim \big((p \wedge q) \wedge (r \wedge r)\big) && \text{by associative and commutative laws (for } \wedge) \\ &\equiv (p \vee q) \wedge r \wedge \sim \big((p \wedge q) \wedge r\big) && \text{by idempotent law} \\ &\equiv (p \vee q) \wedge r \wedge \big(\sim (p \wedge q) \vee \sim r\big) && \text{by De Morgan's law} \\ &\equiv (p \vee q) \wedge \Big(\big(r \wedge \sim (p \wedge q)\big) \vee (r \wedge \sim r)\Big) && \text{by distributive law (for } r \wedge) \\ &\equiv (p \vee q) \wedge \Big(\big(r \wedge \sim (p \wedge q)\big) \vee \mathbf{c}\Big) && \text{by negation law} \\ &\equiv (p \vee q) \wedge r \wedge \sim (p \wedge q) && \text{by identity law} \\ &\equiv (p \vee q) \wedge \sim (p \wedge q) \wedge r && \text{by associative and commutative laws (for } \wedge) \\ &\equiv (p \oplus q) \wedge r && \text{by the given equivalence (def of } \oplus) \end{aligned}\]
Application — Applications to Computer Science
Not assessable for MATH1061. Taken from K. Rosen, Discrete Mathematics and its Applications, 7th edition, 1991, pages 20–24.
Information is often represented using binary or bit strings, which are sequences consisting of zeros and ones. The length of a string is the total number of bits in it — for example \(0110110\) is a string of length 7. The logical operators \(\wedge\), \(\vee\) and \(\oplus\) extend to binary strings. The operators AND, OR and XOR are:
| \(p\) | \(q\) | \(p \vee q\) | \(p \wedge q\) | \(p \oplus q\) |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 0 |
Propositional logic also applies to the design of computer hardware. A digital logic circuit receives input signals (either 0, the wire being off, or 1, on) and produces output signals which are also bits. Complicated digital logic circuits can be constructed from three basic gates: the OR gate, the NOT gate and the AND gate.
A combinational circuit uses these gates and obeys the following rules.
- Two input wires cannot be combined without a gate.
- A single input wire can be split partway and directed into two separate gates.
- An output wire from a gate can be used as input for another gate.
- No output wire from a gate can eventually feed back into that gate.
For example, the logical expression \((p \wedge \sim q) \vee \sim r\) has the combinational circuit
- \(\text{NOT}(q) \to n_1\)
- \(\text{AND}(p,\, n_1) \to a_1\)
- \(\text{NOT}(r) \to n_2\)
- \(\text{OR}(a_1,\, n_2) \to\) output \((p \wedge \sim q) \vee \sim r\)
Application problems
Find the bitwise OR, bitwise AND and bitwise XOR of each of these pairs of binary strings.
\(1011110\), \(0100001\)
\(11110000\), \(10101010\)
Construct a combinational circuit using the NOT, OR and AND gates that produces the outputs:
\((\sim p \vee \sim r) \wedge q\)
\((p \wedge \sim r) \vee (\sim q \wedge r)\)
Find the output of the following combinational circuit, simplify the expression using logical laws and construct a new circuit for the simplified expression. The circuit is
- \(\text{NOT}(p) \to n_1\)
- \(\text{NOT}(q) \to n_2\)
- \(\text{OR}(p,\, n_2) \to o_1\)
- \(\text{OR}(n_1,\, n_2) \to o_2\)
- \(\text{AND}(o_1,\, o_2) \to a_1\)
- \(\text{OR}(a_1,\, r) \to\) output
(both \(p\) and \(q\) have their wires split, feeding two gates each).
The logical binary operation NAND, denoted \(\mid\), is defined by
\[p \mid q \equiv \; \sim (p \wedge q).\]
Write down the truth table for \(\sim (p \mid q)\). Show all working.
Prove, using truth tables or otherwise, that \((p \mid p) \equiv (\sim p)\). Show all working.
Prove, using truth tables or otherwise, that \(((p \mid p) \mid (q \mid q)) \equiv p \vee q\). Show all working.
Application solutions
\[1011110 \text{ OR } 0100001 = 1111111,\] \[1011110 \text{ AND } 0100001 = 0000000,\] \[1011110 \text{ XOR } 0100001 = 1111111.\]
\[11110000 \text{ OR } 10101010 = 11111010,\] \[11110000 \text{ AND } 10101010 = 10100000,\] \[11110000 \text{ XOR } 10101010 = 01011010.\]
- The circuit is
- \(\text{NOT}(p) \to n_1\)
- \(\text{NOT}(r) \to n_2\)
- \(\text{OR}(n_1,\, n_2) \to o_1\)
- \(\text{AND}(o_1,\, q) \to\) output \((\sim p \vee \sim r) \wedge q\)
- The circuit is
- \(\text{NOT}(r) \to n_1\)
- \(\text{AND}(p,\, n_1) \to a_1\)
- \(\text{NOT}(q) \to n_2\)
- \(\text{AND}(n_2,\, r) \to a_2\)
- \(\text{OR}(a_1,\, a_2) \to\) output \((p \wedge \sim r) \vee (\sim q \wedge r)\)
The given digital logic circuit has output \(\big((p \vee \sim q) \wedge (\sim p \vee \sim q)\big) \vee r\). Using laws of logical equivalence we have
\[\begin{aligned} \big((p \vee \sim q) \wedge (\sim p \vee \sim q)\big) \vee r &\equiv \big(\sim q \vee (p \wedge \sim p)\big) \vee r && \text{by distributive and commutative laws} \\ &\equiv (\sim q \vee \mathbf{c}) \vee r && \text{by negation law} \\ &\equiv \; \sim q \vee r && \text{by identity law} \end{aligned}\]
The simplification is \(\sim q \vee r\). The simplified logic circuit is
- \(\text{NOT}(q) \to n_1\)
- \(\text{OR}(r,\, n_1) \to\) output \(\sim q \vee r\)
- We have
\(p\) \(q\) \(p \wedge q\) \(p \mid q\) \(\sim (p \mid q)\) T T T F T T F F T F F T F T F F F F T F Hence \(\sim (p \mid q)\) has the same truth values as \(p \wedge q\) (it is true exactly when both \(p\) and \(q\) are true).
- Since \(p \mid p \equiv \; \sim (p \wedge p)\), we have
\[p \mid p \equiv \; \sim (p \wedge p) \equiv \; \sim p\]
because \(p \wedge p \equiv p\) (idempotent law). Alternatively, by truth table:
\(p\) \(p \wedge p\) \(p \mid p\) \(\sim p\) T T F F F F T T The last two columns agree, so \(p \mid p \equiv \; \sim p\).
- First note from part (b) that \(p \mid p \equiv \; \sim p\) and \(q \mid q \equiv \; \sim q\). Therefore
\[\begin{aligned} (p \mid p) \mid (q \mid q) &\equiv (\sim p) \mid (\sim q) && \text{by part (b)} \\ &\equiv \; \sim\big((\sim p) \wedge (\sim q)\big) && \text{by def of NAND} \\ &\equiv p \vee q && \text{by De Morgan's law.} \end{aligned}\]
Alternatively, by truth table:
\(p\) \(q\) \(p \mid p\) \(q \mid q\) \((p \mid p) \mid (q \mid q)\) \(p \vee q\) T T F F T T T F F T T T F T T F T T F F T T F F The last two columns match, hence \((p \mid p) \mid (q \mid q) \equiv p \vee q\).
§3 — Conditional Statements
Epp 4th ed. pp. 039–050 · 5th ed. (metric) pp. 053–066. Lecture 3 (week 1). Notes: conditional-statements.
Problems
Let \(p\), \(q\) and \(r\) be statements. Use the laws of logical equivalence to show that
\[p \to (q \vee r) \equiv (p \wedge \sim q) \to r.\]
Let \(p\) and \(q\) be statement variables. Are the following statements logically equivalent? Justify your answer.
- Statement A: \((p \to q) \wedge \sim q\)
- Statement B: \(\sim (p \wedge q)\)
Write each of the following statements in the form ‘if … then …’.
A sufficient condition for the warranty to be good is that you bought the computer less than a year ago.
Jane gets seasick whenever she is on a boat.
For each of the following, write down a truth table for the statement, and determine whether the statement is a tautology, a contradiction, or neither.
\((\sim p \wedge (p \to q)) \to \sim q\)
\((p \to (q \vee r)) \leftrightarrow ((p \wedge \sim q) \to r)\)
Negate the following two statements.
If it rains, then Sue takes her umbrella.
The cakes burn if the oven temperature is too high.
Recall “a sufficient condition for \(s\) is \(r\)” means \(r\) is a sufficient condition for \(s\), and that “a necessary condition for \(s\) is \(r\)” means \(r\) is a necessary condition for \(s\). Rewrite the following statements in ‘if … then …’ form:
A sufficient condition for John’s team to win the championship is that it wins the rest of its games.
A necessary condition for this computer program to be correct is that it not produce error messages during translation.
Solutions
We have
\[\begin{aligned} p \to (q \vee r) &\equiv \; \sim p \vee (q \vee r) && \text{by definition of implication} \\ &\equiv (\sim p \vee q) \vee r && \text{by the associative law} \\ &\equiv \; \sim (p \wedge \sim q) \vee r && \text{by De Morgan's law and double negative law} \\ &\equiv (p \wedge \sim q) \to r && \text{by definition of implication.} \end{aligned}\]
Let \(A\) be the statement \((p \to q) \wedge \sim q\) and let \(B\) be the statement \(\sim (p \wedge q)\). Then
\[\begin{aligned} A &\equiv (\sim p \vee q) \wedge \sim q && \text{by definition of implication} \\ &\equiv (\sim p \wedge \sim q) \vee (q \wedge \sim q) && \text{by distributive and commutative laws} \\ &\equiv (\sim p \wedge \sim q) \vee \mathbf{c} && \text{by negation law} \\ &\equiv \; \sim p \wedge \sim q && \text{by identity law,} \end{aligned}\]
while
\[B \equiv \; \sim (p \wedge q) \equiv \; \sim p \vee \sim q \qquad \text{by De Morgan's law.}\]
Thus Statement A and Statement B are not logically equivalent because, for example, if \(p\) is false and \(q\) is true, then \(A\) is false and \(B\) is true. Hence \(A \not\equiv B\).
If you bought the computer less than a year ago, then the warranty is good.
If Jane is on a boat, then Jane gets seasick.
- Solution Option 1. The truth table for the statement is
\(p\) \(q\) \(\sim p\) \(p \to q\) \(\sim p \wedge (p \to q)\) \(\sim q\) \((\sim p \wedge (p \to q)) \to \sim q\) T T F T F F T T F F F F T T F T T T T F F F F T T T T T The statement is neither a tautology nor a contradiction.
Solution Option 2. The same truth table, written under the parts of the statement:
\(p\) \(q\) \(\sim p\) \(\wedge\) \((p \to q)\) \(\to\) \(\sim q\) T T F F T T F T F F F F T T F T T T T F F F F T T T T T order ① ④ ② ⑤ ③ The small numbers show the order in which the columns were completed. Column ④ comes from comparing columns ① and ②. Column ⑤ comes from comparing columns ③ and ④, and shows the truth values for the entire statement. This shows that this statement is neither a tautology nor a contradiction. (You don’t have to number the columns — this is just to help your understanding!)
- Solution Option 1. The truth tables for the LHS and RHS are:
\(p\) \(q\) \(r\) \(q \vee r\) \(p \to (q \vee r)\) \(\sim q\) \(p \wedge \sim q\) \((p \wedge \sim q) \to r\) T T T T T F F T T T F T T F F T T F T T T T T T T F F F F T T F F T T T T F F T F T F T T F F T F F T T T T F T F F F F T T F T Therefore the truth table for the statement is:
\(p\) \(q\) \(r\) \(\big(p \to (q \vee r)\big) \leftrightarrow \big((p \wedge \sim q) \to r\big)\) T T T T T T F T T F T T T F F T F T T T F T F T F F T T F F F T The statement is a tautology.
Solution Option 2. Another way to represent the truth table for \((p \to (q \vee r)) \leftrightarrow ((p \wedge \sim q) \to r)\):
\(p\) \(q\) \(r\) \(p \to\) \((q \vee r)\) \(\leftrightarrow\) \((p \wedge \sim q)\) \(\to r\) T T T T T T F T T T F T T T F T T F T T T T T T T F F F F T T F F T T T T T F T F T F T T T F T F F T T T T F T F F F T F T F T order ② ① ⑤ ③ ④ Here column ⑤ comes from comparing columns ② and ④. We see (from column ⑤) that this is a tautology.
- Let \(R\) be the statement “it rains” and \(U\) be the statement “Sue takes her umbrella.” The given statement is \(R \to U\). Its negation is
\[R \wedge \sim U,\]
i.e. “It rains and Sue does not take her umbrella.”
- Let \(H\) be the statement “the oven temperature is too high” and \(B\) be the statement “the cakes burn.” The given statement is \(H \to B\). Its negation is
\[H \wedge \sim B,\]
i.e. “The oven temperature is too high and the cakes do not burn.”
If John’s team wins the rest of its games, then John’s team will win the championship.
If this computer program is correct, then it does not produce error messages during translation.
§4 — Valid and Invalid Arguments
Epp 4th ed. pp. 051–063 · 5th ed. (metric) pp. 066–079. Lecture 4 (week 2). Notes: valid-argument-forms.
Problems
State truth values for the statement variables \(p\) and \(q\) that demonstrate that the following argument is invalid, and justify your answer.
Premise 1: \(q\) Premise 2: \(p \to q\) Conclusion: \(p\)
Find values of the statement variables \(a\), \(b\) and \(c\) that show that the following argument is invalid.
- \(a \to b\)
- \(\sim a \to c\)
- \(\sim b \to c\) \(\therefore\ b\)
Use a truth table to show that the following argument forms are valid.
- Elimination:
- \(p \vee q\)
- \(\sim q\) \(\therefore\ p\)
- Generalisation:
- \(p\) \(\therefore\ p \vee q\)
Use a truth table to show that the following argument is invalid.
- \((p \wedge q) \to \sim r\)
- \(p \vee \sim q\)
- \(\sim q \to p\) \(\therefore\ \sim r\)
Solutions
To show the argument is invalid, we must find truth values for \(p\) and \(q\) such that the premises are true and the conclusion is false.
Suppose \(p\) is false and \(q\) is true. Then Premise 1 (\(q\)) is true and Premise 2 (\(p \to q\)) is true (by definition of implication). However, the conclusion (\(p\)) is false. Therefore the argument is invalid.
To show the argument is invalid, we must find truth values for \(a\), \(b\) and \(c\) such that the premises are true and the conclusion is false.
Let \(a\) be false, \(b\) be false, and \(c\) be true. By definition of implication, all three premises are true, but the conclusion (\(b\)) is false, so the argument is invalid.
\(p\) \(q\) premise 1: \(p \vee q\) premise 2: \(\sim q\) conclusion: \(p\) T T T F T T F T T T F T T F F F F F T F There is only one row of the truth table in which all premises are true (the second row), and here the conclusion is true. Thus, whenever all the premises are true, the conclusion is true, so the argument is valid.
\(p\) \(q\) premise 1: \(p\) conclusion: \(p \vee q\) T T T T T F T T F T F T F F F F There are two rows for which all premises (here just the one premise) are true — the first two rows — and for each of these rows the conclusion is true. Thus, whenever all the premises are true, the conclusion is true, so the argument is valid.
We compute the truth table:
\(p\) \(q\) \(r\) \((p \wedge q) \to \sim r\) \(p \vee \sim q\) \(\sim q \to p\) Prem. 1 \(\wedge\) Prem. 2 \(\wedge\) Prem. 3 \(\sim r\) T T T F T T F F T T F T T T T T T F T T T T T F T F F T T T T T F T T T F T F F F T F T F T F T F F T T T F F F F F F T T F F T There are three rows for which all the premises are true, however for one of these rows the conclusion is false. In particular, taking \(p\) to be true, \(q\) to be false, and \(r\) to be true makes all the premises true but the conclusion false, so the argument is invalid.
§5 — Methods for Determining Validity
Epp 4th ed. pp. 051–063 · 5th ed. (metric) pp. 066–079. Lecture 5 (week 2). Notes: determining-argument-validity.
Problems
Determine whether the following arguments are valid. If the argument is valid, prove it using rules of inference. If the argument is invalid, demonstrate it with a choice of truth values for the variables.
\(p \to q\) \(q \to p\) \(\therefore\ p \vee q\)
\(p\) \(p \to q\) \(\sim q \vee r\) \(\therefore\ r\)
\(p \vee q\) \(p \to \sim q\) \(p \to r\) \(\therefore\ r\)
Write the following argument in symbolic form. Then determine whether the argument is valid or not.
An error message is received if the output is flagged. The system is running normally only if the output is not flagged. An error message is received. Therefore, the system is not running normally.
Please use the following variables:
\(p\) the output is flagged \(q\) an error message is received \(r\) the system is running normally Give truth values for the variables \(p\), \(q\), \(r\), \(s\) and \(w\) which demonstrate that the following argument is invalid.
\[\big[(p \vee q) \wedge (q \to r) \wedge ((p \wedge s) \to w) \wedge (\sim r) \wedge (q \to s)\big] \to w\]
Solutions
- The argument is invalid. When \(p\) and \(q\) are both false, all the premises are true, but the conclusion is false. One could arrive at this example by computing the following truth table:
\(p\) \(q\) \(p \to q\) \(q \to p\) \(p \vee q\) T T T T T T F F T T F T T F T F F T T F (In the last row, the premises are true, but the conclusion is false.)
- The argument is valid, and we prove this with rules of inference:
1. \(p\) Premise 2. \(p \to q\) Premise 3. \(\sim q \vee r\) Premise 4. \(q\) from 1 and 2 by Modus Ponens 5. \(r\) from 3 and 4 by elimination (and the double negative law) Therefore the argument is valid.
- Suppose the argument is invalid. Then it is possible to find truth values for the statement variables that make all the premises true and the conclusion false. For the conclusion to be false, we have \(r\) is false. Since \(r\) is false but the third premise (\(p \to r\)) is true, we must have \(p\) is false. Since \(p\) is false, this means the second premise (\(p \to \sim q\)) is also true. Now since \(p\) is false but the first premise (\(p \vee q\)) is true, we must have \(q\) is true.
Thus, with these truth values for the three variables, we have that all the premises are true, but the conclusion is false. So the argument is invalid.
The argument has the symbolic form:
1. \(p \to q\) (An error message is received if the output is flagged.) 2. \(r \to \sim p\) (The system is running normally only if the output is not flagged.) 3. \(q\) (An error message is received.) \(\therefore\) \(\sim r\) (The system is not running normally.) Suppose the argument is invalid. Then it is possible to find truth values for the statement variables that make all the premises true and the conclusion false. For the conclusion to be false, we have \(r\) is true. Since \(r\) is true, and premise 2 is true, we must have \(\sim p\) true, that is \(p\) is false. Since premise 3 is true, we have \(q\) is true.
Thus, with these truth values for the three variables, we have that all the premises are true, but the conclusion is false. So the argument is invalid.
The argument being valid is the same as this overall implication statement being a tautology.
\[\big[(p \vee q) \wedge (q \to r) \wedge ((p \wedge s) \to w) \wedge (\sim r) \wedge (q \to s)\big] \to w\]
We can write the argument as follows:
- \(p \vee q\)
- \(q \to r\)
- \((p \wedge s) \to w\)
- \(\sim r\)
- \(q \to s\) \(\therefore\ w\)
Suppose the argument is invalid. Then it is possible to find truth values for the statement variables that make all the premises true and the conclusion false. For the conclusion to be false, we have \(w\) is false. Since premise 4 is true we have \(r\) is false. Since premise 2 is true and \(r\) is false, we must have \(q\) is false. Since premise 1 is true and \(q\) is false we have \(p\) is true. Since premise 3 is true and \(w\) is false, we must have \((p \wedge s)\) false, and since \(p\) is true, this means \(s\) is false. These truth values also mean premise 5 is true.
Thus with these truth values for the variables, we have that all the premises are true, but the conclusion is false. So the argument is invalid.
Application — Applications of Valid and Invalid Arguments
Not assessable for MATH1061. Taken from K. Rosen, Discrete Mathematics and its Applications, 7th edition, 1991, pages 48–68.
Application problems
Translating English sentences into logical expressions is an essential part of specifying both hardware and software systems. Software engineers must take requirements in English and produce precise, unambiguous specifications that can be used as the basis for system development.
Consider the following predicates and domains:
Predicates:
\(F(x, y)\) disk \(x\) has more than \(y\) kilobytes of free space. \(S(m)\) mail message \(m\) can be saved. \(A(x)\) alert \(x\) is active. \(Q(m)\) message \(m\) is queued. \(T(m)\) message \(m\) is transmitted. \(D(s)\) the diagnostic monitor tracks the status of system \(s\). Domains:
\(M\) the nonempty set of all messages. \(X\) the set of all disks. \(Y\) the set of all alerts. \(S\) the set of all systems. Express the system specifications below using quantifiers and logical connectives:
At least one mail message, among the nonempty set of messages, can be saved if there is a disk with more than 10 kilobytes of free space.
Whenever there is an active alert, all queued messages are transmitted.
The diagnostic monitor tracks the status of all systems except the main console.
System specifications should be consistent; that is, they should not contain conflicting requirements that could be used to derive a contradiction. When specifications are not consistent, there would be no way to develop a system that satisfies all specifications. Logically, a system is consistent if it is possible for all the premises to be simultaneously true.
Use logical expressions and methods of logical deduction to determine whether the following specifications are consistent.
The system is in multiuser state if and only if it is operating normally. If the system is operating normally, the kernel is functioning. The kernel is not functioning or the system is in interrupt mode. If the system is not in multiuser state, then it is in interrupt mode. The system is not in interrupt mode.
The router can send packets to the edge system only if it supports the new address space. For the router to support the new address space it is necessary that the latest software release be installed. The router can send packets to the edge system if the latest software release is installed. The router does not support the new address space.
Application solutions
\((\exists x \in X \text{ s.t. } F(x, 10)) \to (\exists m \in M \text{ s.t. } S(m))\).
\((\exists y \in Y \text{ s.t. } A(y)) \to (\forall m \in M,\ (Q(m) \to T(m)))\).
Let \(c \in S\) denote the main console. \(\forall s \in S,\ (s \neq c \to D(s))\).
- Define the following variables:
\(m\) the system is in multiuser state \(n\) the system is operating normally \(k\) the kernel is functioning \(i\) the system is in interrupt mode Now we can express the specifications as follows:
- \(m \leftrightarrow n\)
- \(n \to k\)
- \(\sim k \vee i\)
- \(\sim m \to i\)
- \(\sim i\)
Solution Option 1. If these specifications are consistent, then we must be able to find truth values for each of the variables that makes all of the specifications true. Assume the specifications are consistent (so we assume each specification is true). For specification 5 to be true we know \(i\) is false. For specification 4 to be true, with \(i\) false, we know \(\sim m\) is false so \(m\) is true. For premise 1 to be true, with \(m\) true, we have \(n\) is true. For specification 2 to be true, and since \(n\) is true, we have \(k\) is true. However, now \(\sim k\) is false and \(i\) is false, which means specification 3 is false. This contradicts our assumption that all the specifications are true, and so it is impossible for the system to be consistent. Therefore, the system is not consistent.
Solution Option 2. Suppose the specifications are all true. Using laws of inference, we have
1. \(m \leftrightarrow n\) specification 2. \(n \to k\) specification 3. \(\sim k \vee i\) specification 4. \(\sim m \to i\) specification 5. \(\sim i\) specification 6. \(\sim k\) from 3 and 5 by elimination (and double negative law) 7. \(\sim n\) from 2 and 6 by Modus Tollens 8. \((m \to n) \wedge (n \to m)\) from 1 by definition of \(\leftrightarrow\) 9. \(m \to n\) from 8 by specialisation 10. \(\sim m\) from 9 and 7 by Modus Tollens 11. \(i\) from 4 and 10 by Modus Ponens But now we have both \(i\) and \(\sim i\) being true, which is a contradiction. This contradicts our assumption that all the specifications are true, and so it is impossible for the system to be consistent. Therefore, the system is not consistent.
- Define the following variables:
\(r\) the router can send packets to the edge system \(a\) the router supports the new address space \(s\) the latest software release is installed Now we can express the specifications as follows:
- \(r \to a\)
- \(a \to s\)
- \(s \to r\)
- \(\sim a\)
Assume the specifications are consistent, so each specification is true. For specification 4 to be true, \(\sim a\) is true, so \(a\) is false. For specification 1 to be true with \(a\) false we must have \(r\) is false. Now, since \(r\) is false and specification 3 is true, we have \(s\) is false. We double-check that specification 2 is true, which it is because \(a\) is false. Thus, we have found truth values of the statement variables that make all of the specifications true, so the system is consistent.
§6 — Quantified Statements
Epp 4th ed. pp. 096–108 · 5th ed. (metric) pp. 108–121. Lecture 5 (week 2). Notes: quantified-statements.
Problems
Rewrite each of the following in the form “\(\forall \underline{\phantom{xx}},\ \underline{\phantom{xx}}\).” Here, let \(D\) be the set of all dinosaurs, and let \(L\) be the set of all logicians.
All dinosaurs are extinct.
Every real number is positive, negative, or zero.
No irrational numbers are integers.
No logicians are lazy.
The number \(2{,}147{,}581{,}953\) is not equal to the square of any integer.
The number \(-1\) is not equal to the square of any real number.
Rewrite each of the following in the form “\(\exists \underline{\phantom{xx}}\) such that \(\underline{\phantom{xx}}\).” Here, let \(X\) be the set of all exercises.
Some exercises have answers.
Some real numbers are rational.
Determine whether the following statements are true or false. Justify your reasoning.
\(\forall x \in \mathbb{R},\ x \geq \frac{1}{x}\).
\(\forall a \in \mathbb{Z},\ \frac{a-1}{a} \notin \mathbb{Z}\).
\(\forall m, n \in \mathbb{Z}^+,\ mn \geq m + n\).
Solutions
\(\forall x \in D,\ x\) is extinct.
\(\forall x \in \mathbb{R},\ (x > 0 \vee x < 0 \vee x = 0)\).
\(\forall x \in \mathbb{R},\ (x \text{ is irrational} \to x \notin \mathbb{Z})\).
\(\forall x \in L,\ x\) is not lazy.
\(\forall x \in \mathbb{Z},\ x^2 \neq 2147581953\).
\(\forall x \in \mathbb{R},\ -1 \neq x^2\).
\(\exists x \in X\) such that \(x\) has an answer.
\(\exists x \in \mathbb{R}\) such that \(x \in \mathbb{Q}\).
False. Counterexample: take \(x = \frac{1}{2}\). Then \(x = \frac{1}{2}\) but \(\frac{1}{x} = 2\), so \(x \geq \frac{1}{x}\) is false.
False. Counterexample: take \(a = 1\). Then \(\frac{a-1}{a} = \frac{0}{1} = 0 \in \mathbb{Z}\).
False. Counterexample: take \(n = m = 1\). Then \(mn = 1\) but \(m + n = 2\).
§7 — Negation of Quantified Statements
Epp 4th ed. pp. 108–117 · 5th ed. (metric) pp. 122–131. Lecture 6 (week 2). Notes: quantified-statements.
Problems
Write the negation of each of the following statements, and then determine whether the original or the negation is true:
\(\forall x \in \mathbb{R}\), if \(x^2 > 9\) then \(x \geq 2\).
\(\forall n \in \mathbb{Z}^+\), \(n\) is either prime or composite.
\(\exists x, y \in \mathbb{R}\) such that \(x \notin \mathbb{Z}\) and \(y \notin \mathbb{Z}\) but \(xy \in \mathbb{Z}\).
Write down the negation of each of the following statements:
All fire engines are red.
Some apples are ripe.
A triangle with equal sides exists.
Solutions
- Original: \(\forall x \in \mathbb{R}\), if \(x^2 > 9\) then \(x \geq 2\). Negation: \(\exists x \in \mathbb{R}\) such that \(x^2 > 9\) and \(x < 2\).
The original statement is false. For instance, take \(x = -4\). Then \(x^2 > 9\) but \(x \not\geq 2\).
- Original: \(\forall n \in \mathbb{Z}^+\), \(n\) is either prime or composite. Negation: \(\exists n \in \mathbb{Z}^+\) such that \(n\) is neither prime nor composite.
The original statement is false. For instance, consider \(n = 1\), which is neither prime nor composite.
- Original: \(\exists x, y \in \mathbb{R}\) such that \(x \notin \mathbb{Z}\) and \(y \notin \mathbb{Z}\) but \(xy \in \mathbb{Z}\). Negation: \(\forall x, y \in \mathbb{R}\), if \(x \notin \mathbb{Z}\) and \(y \notin \mathbb{Z}\) then \(xy \notin \mathbb{Z}\).
The original statement is true. For instance, take \(x = \sqrt{2}\) and \(y = \sqrt{2}\). Then \(x \notin \mathbb{Z}\) and \(y \notin \mathbb{Z}\), but \(xy = 2 \in \mathbb{Z}\).
Original: All fire engines are red. Negation: There exists a fire engine which is not red.
Original: Some apples are ripe. Negation: All apples are not ripe.
Original: A triangle with equal sides exists. Negation: There does not exist a triangle with equal sides.
§8 — Statements with Multiple Quantifiers
Epp 4th ed. pp. 117–131 · 5th ed. (metric) pp. 131–146. Lecture 6 (week 2). Notes: quantified-statements.
Problems
Write down the negation of each of the following statements. Then determine whether the statement is true, or whether its negation is true.
\(\forall x, y \in \mathbb{Z}\), \(\exists z \in \mathbb{Z}\) such that \(z = x - y\).
\(\forall x \in \mathbb{R}\), \(\exists y \in \mathbb{R}\) such that \(x^2 - xy - 2y^2 = 0\).
\(\exists x \in \mathbb{Z}^+\) such that \(\forall y \in \mathbb{Z}^+\), \(x \geq y\).
\(\forall r, s \in \mathbb{R}\), if \(rs \in \mathbb{Q}\), then \(r \in \mathbb{Q}\) and \(s \in \mathbb{Q}\).
For each of the following English sentences:
For any rational number \(x\) and any negative integer \(y\) there exists a real number that is greater than the product of \(x\) and \(y\).
For every real number \(x\), there is a real number \(y\) for which \(3y = x\).
do the following:
Write the statement in symbolic form.
Write the negation of the statement in symbolic form.
Determine which of the statement or its negation is true.
Solutions
- Original: \(\forall x, y \in \mathbb{Z}\), \(\exists z \in \mathbb{Z}\) such that \(z = x - y\). Negation: \(\exists x \in \mathbb{Z}\ \exists y \in \mathbb{Z}\) such that \(\forall z \in \mathbb{Z}\), \(z \neq x - y\).
The original statement is true (and the negation is false). For any given \(x, y \in \mathbb{Z}\), choose \(z = x - y \in \mathbb{Z}\).
- Original: \(\forall x \in \mathbb{R}\), \(\exists y \in \mathbb{R}\) such that \(x^2 - xy - 2y^2 = 0\). Negation: \(\exists x \in \mathbb{R}\) s.t. \(\forall y \in \mathbb{R}\), \(x^2 - xy - 2y^2 \neq 0\).
The original statement is true (and the negation is false). For any \(x \in \mathbb{R}\), taking \(y = \frac{x}{2}\) gives
\[x^2 - x\left(\frac{x}{2}\right) - 2\left(\frac{x}{2}\right)^2 = x^2 - \frac{x^2}{2} - 2 \cdot \frac{x^2}{4} = x^2 - \frac{x^2}{2} - \frac{x^2}{2} = 0.\]
- Original: \(\exists x \in \mathbb{Z}^+\) such that \(\forall y \in \mathbb{Z}^+\), \(x \geq y\). Negation: \(\forall x \in \mathbb{Z}^+\ \exists y \in \mathbb{Z}^+\) such that \(x < y\).
The negation is true (and the original is false). For any \(x \in \mathbb{Z}^+\), take \(y = x + 1\). Then \(y\) is an integer satisfying the inequality \(x < y\).
- Original: \(\forall r, s \in \mathbb{R}\), if \(rs \in \mathbb{Q}\), then \(r \in \mathbb{Q}\) and \(s \in \mathbb{Q}\). Negation: \(\exists r, s \in \mathbb{R}\) such that \(rs \in \mathbb{Q}\) and (\(r \notin \mathbb{Q}\) or \(s \notin \mathbb{Q}\)).
The negation is true (and the original is false). Take \(r = \sqrt{2}\) and \(s = \sqrt{2}\). Then \(rs = 2 \in \mathbb{Q}\) but \(r, s \notin \mathbb{Q}\).
- Original: \(\forall x \in \mathbb{Q},\ \forall y \in \mathbb{Z}^{<0},\ \exists z \in \mathbb{R}\) s.t. \(z > xy\).
Negation: \(\exists x \in \mathbb{Q}\ \exists y \in \mathbb{Z}^{<0}\) s.t. \(\forall z \in \mathbb{R}\), \(z \leq xy\).
The original statement is true. For any given \(x \in \mathbb{Q}\) and \(y \in \mathbb{Z}^{<0}\), take \(z = xy + 1\). This is a real number satisfying the inequality \(z > xy\).
- Original: \(\forall x \in \mathbb{R},\ \exists y \in \mathbb{R}\) s.t. \(3y = x\).
Negation: \(\exists x \in \mathbb{R}\) s.t. \(\forall y \in \mathbb{R}\), \(3y \neq x\).
The original statement is true. Given any \(x \in \mathbb{R}\), choose \(y = \frac{x}{3}\). This is a real number satisfying the equality \(3y = x\).
§9 — Direct Proofs and Counterexamples
Epp 4th ed. pp. 145–163 · 5th ed. (metric) pp. 160–182. Lecture 7 (week 3). Notes: proof-techniques.
Problems
For each of the following statements, either prove the statement or disprove it using a counterexample.
The sum of any pair of even integers is even.
There exist positive integers \(a\), \(b\) and \(c\) such that \(a^2 + b^2 = c^2\).
There is an even integer \(n\) such that \(5n - 4\) is prime.
\(\forall n \in \mathbb{Z}^+\), if \(n \geq 4\) then \(2n^2 - 5n + 2\) is composite.
\(\forall x, y \in \mathbb{R}\), if \(y^2 > x^2\) then \(y > x\).
Find a counterexample that disproves the following statement:
\[\text{For all } x \in \mathbb{R},\ \lfloor x^2 \rfloor = \lfloor x \rfloor^2.\]
(Recall that \(\lfloor \cdot \rfloor\) denotes the floor function.)
Find the errors in the following proofs and rewrite the proof correctly. Here is a list of common errors made when writing proofs:
- Arguing from examples
- Using the same variable to mean two different things
- Jumping to the conclusion
- Assuming what is to be proved
- Confusion between what is known and what is to be shown
- Use of the word any instead of some
- Misuse of the word if
- The difference between any odd integer and any even integer is odd.
Proof. Let \(m\) be any odd integer, then \(m = 2k + 1\) where \(k \in \mathbb{Z}\) and let \(n\) be any even integer, so \(n = 2k\) for any \(k \in \mathbb{Z}\). Then \(m - n = 2k + 1 - 2k = 1\) and 1 is odd so the statement is true.
- If \(a\) and \(b\) are even integers, then \(4a + 2b\) is even.
Proof. We have \(a = 2k\) and \(b = 2j\) for some \(k, j \in \mathbb{Z}\). Then we want to show that \(4a + 2b\) is even, so \[\begin{aligned} 4a + 2b &= 2\ell \\ 4(2k) + 2(2j) &= 2\ell \\ 8k + 4j &= 2\ell \\ 2(4k + 2j) &= 2\ell \end{aligned}\] therefore the statement is true.
- \(\forall x \in \mathbb{R}\), \(\exists y \in \mathbb{R}\) such that \(xy = 1\).
Proof. This is true, for example if \(x = 10\) then let \(y = \frac{1}{10}\) and \(xy = 10 \cdot \frac{1}{10} = 1\). Therefore the statement is true.
- \(\forall n \in \mathbb{Z}\), if \(n > 0\) then \(n^2 + 2n + 1\) is composite.
Proof. Suppose \(n\) is an integer and \(n > 0\), then we want to show that \(n^2 + 2n + 1\) is composite, so this means \[n^2 + 2n + 1 = rs\] where \[1 < r, s < n^2 + 2n + 1\] Clearly neither \(r\) nor \(s\) are equal to 1 so \(n^2 + 2n + 1\) is not prime and hence must be composite.
Solutions
- The sum of any pair of even integers is even.
Proof. Let \(m, n \in \mathbb{Z}\) be even. Then \(m = 2k\) and \(n = 2\ell\) for some \(k, \ell \in \mathbb{Z}\). Hence \[m + n = 2k + 2\ell = 2(k + \ell),\] which is even. Therefore, the sum of any pair of even integers is even. \(\square\)
- There exist positive integers \(a\), \(b\) and \(c\) such that \(a^2 + b^2 = c^2\).
Proof. Consider the positive integers \(a = 3\), \(b = 4\), \(c = 5\). Then \(a^2 + b^2 = 9 + 16 = 25 = c^2\). \(\square\)
- There is an even integer \(n\) such that \(5n - 4\) is prime. This statement is false. We prove the negation: \(\forall n \in \mathbb{Z}^{\text{even}}\), \(5n - 4\) is not prime.
Proof. Suppose that \(n\) is an even integer. Thus \(n = 2k\) for some integer \(k\). Hence \[5n - 4 = 5(2k) - 4 = 10k - 4 = 2(5k - 2).\] By definition, this means that \(5n - 4\) is even. The only even prime is 2. If \(2(5k-2) = 2\), then \(5k - 2 = 1\) and hence \(k = \frac{3}{5}\) which is not an integer. Therefore \(5n - 4\) is not a prime number. \(\square\)
- \(\forall n \in \mathbb{Z}^+\), if \(n \geq 4\) then \(2n^2 - 5n + 2\) is composite.
Proof. Suppose \(n\) is a positive integer and \(n \geq 4\). Let us factor \[2n^2 - 5n + 2 = (2n - 1)(n - 2).\] Since \(n \geq 4\), we have \(2n - 1 \geq 7\) and \(n - 2 \geq 2\), so both factors are integers \(> 1\). Hence the expression is composite for all \(n \geq 4\). \(\square\)
- \(\forall x, y \in \mathbb{R}\), if \(y^2 > x^2\) then \(y > x\). This statement is false. Take \(x = 1\) and \(y = -2\). Then \(y^2 = 4 > x^2 = 1\), but \(y = -2 \not> 1 = x\).
Take \(x = \frac{3}{2}\). Then \(\lfloor x^2 \rfloor = \left\lfloor \frac{9}{4} \right\rfloor = 2\), while \(\lfloor x \rfloor^2 = \left\lfloor \frac{3}{2} \right\rfloor^2 = 1^2 = 1\). Hence \(\lfloor x^2 \rfloor \neq \lfloor x \rfloor^2\), so the statement is false.
- Statement. The difference between any odd integer and any even integer is odd.
Proof. Let \(m\) be any odd integer, then \(m = 2k + 1\) where \(k \in \mathbb{Z}\) and let \(n\) be any even integer, so \(n = 2k\) for any \(k \in \mathbb{Z}\). [Error: using \(k\) for both \(m\) and \(n\) means that the statement is only proved when \(m = n + 1\).] Then \(m - n = 2k + 1 - 2k = 1\) and 1 is odd so the statement is true.
Correct proof. Let \(m\) be any odd integer and let \(n\) be any even integer. Then there exist \(k, \ell \in \mathbb{Z}\) such that \(m = 2k + 1\) and \(n = 2\ell\). Hence \[m - n = (2k + 1) - 2\ell = 2(k - \ell) + 1,\] which is an odd integer by definition. \(\square\)
- Statement. If \(a\) and \(b\) are even integers, then \(4a + 2b\) is even. [Error: the proof forgets to state its assumptions.]
Proof. We have \(a = 2k\) and \(b = 2j\) for some \(k, j \in \mathbb{Z}\). Then we want to show that \(4a + 2b\) is even, so \[\begin{aligned} 4a + 2b &= 2\ell && \textbf{[Error: this line assumes what is to be proved.]} \\ 4(2k) + 2(2j) &= 2\ell \\ 8k + 4j &= 2\ell \\ 2(4k + 2j) &= 2\ell \end{aligned}\] therefore the statement is true.
Correct proof. Suppose \(a\) and \(b\) are even integers. Then \(a = 2k\) and \(b = 2j\) for some \(k, j \in \mathbb{Z}\). Therefore \[4a + 2b = 4(2k) + 2(2j) = 8k + 4j = 2(4k + 2j).\] Since \(k, j \in \mathbb{Z}\), we have \((4k + 2j) \in \mathbb{Z}\) and so, by definition, \(4a + 2b\) is even. \(\square\)
- Statement. \(\forall x \in \mathbb{R}\), \(\exists y \in \mathbb{R}\) such that \(xy = 1\).
Proof. This is true, for example if \(x = 10\) then let \(y = \frac{1}{10}\) and \(xy = 10 \cdot \frac{1}{10} = 1\). Therefore the statement is true. [Error: the proof argues from a single example, which cannot establish a universal statement. Moreover, the statement is false.]
Correct disproof. The statement is false. As a counterexample, let \(x = 0\). We know that \(0 \cdot y = 0\) for all \(y \in \mathbb{R}\) and so there is no real number \(y\) such that \(0 \cdot y = 1\). \(\square\)
- Statement. \(\forall n \in \mathbb{Z}\), if \(n > 0\) then \(n^2 + 2n + 1\) is composite.
Proof. Suppose \(n\) is an integer and \(n > 0\), then we want to show that \(n^2 + 2n + 1\) is composite, so this means \[n^2 + 2n + 1 = rs \qquad \textbf{[Error: forgets to define } r, s \textbf{ — e.g. for some } r, s \in \mathbb{Z}\textbf{]}\] where \[1 < r, s < n^2 + 2n + 1\] Clearly neither \(r\) nor \(s\) are equal to 1 so \(n^2 + 2n + 1\) is not prime and hence must be composite. [Error: this is jumping to the conclusion without showing what needs to be shown. The expression we need to show (the definition of composite) has been given but it has not been shown.]
Correct proof. Let \(n \in \mathbb{Z}\) with \(n > 0\). Then we have \[n^2 + 2n + 1 = (n+1)(n+1).\] Now since \(0 < n < n^2 + 2n\), we must have that \(1 < n + 1 < n^2 + 2n + 1\). So by letting \(r = s = n + 1\) we have shown that \[n^2 + 2n + 1 = rs\] for integers \(1 < r, s < n^2 + 2n + 1\). By definition this means \(n^2 + 2n + 1\) is composite. \(\square\)
Application — Applications of Proofs to Computer Science
Not assessable for MATH1061. Taken from K. Rosen, Discrete Mathematics and its Applications, 7th edition, 1991, pages 74–80.
Computer programs have been developed to automate the task of reasoning and proving theorems. Many of these programs make use of a rule of inference known as resolution. This rule of inference is based on the tautology
\[\big((p \vee q) \wedge (\sim p \vee r)\big) \to (q \vee r) \tag{1}\]
Resolution can be used to build automatic theorem proving systems.
To construct proofs using resolution as the only rule of inference, the hypotheses and conclusion must be expressed as clauses. Clauses are logical expressions which only feature disjunctions of variables or their negations (i.e. expressions which only use \(\vee\), \(\sim\), so they do not use \(\wedge\), \(\to\)). To express any statement as a clause, we can use the laws of logical equivalence.
Application problems
Using a truth table, show that expression (1) is a tautology.
Write the following expressions as clauses.
\(\sim (\sim r \wedge w)\)
\(r \to u\)
\(\sim (u \wedge w)\)
- Use resolution only to show that the following argument is valid:
If it is raining, then Yvette has their umbrella. It is not the case that Yvette has their umbrella and gets wet. It is not the case that Yvette gets wet while it is not raining. Therefore, Yvette does not get wet.
Application solutions
- The truth table is
\(p\) \(q\) \(r\) \(p \vee q\) \(\sim p \vee r\) \((p \vee q) \wedge (\sim p \vee r)\) \(q \vee r\) \(\big((p \vee q) \wedge (\sim p \vee r)\big) \to (q \vee r)\) T T T T T T T T T T F T F F T T T F T T T T T T T F F T F F F T F T T T T T T T F T F T T T T T F F T F T F T T F F F F T F F T Since the last column is always T, the statement is a tautology.
- Clause forms:
\(\sim (\sim r \wedge w) \equiv r \vee \sim w\) (by De Morgan’s law and double negative law).
\(r \to u \equiv \; \sim r \vee u\) (by definition of implication).
\(\sim (u \wedge w) \equiv \; \sim u \vee \sim w\) (by De Morgan’s law).
- Define the following variables:
\(r\) it is raining \(u\) Yvette has their umbrella \(w\) Yvette gets wet Then we can express the argument as
- \(r \to u\)
- \(\sim (u \wedge w)\)
- \(\sim (\sim r \wedge w)\) \(\therefore\ \sim w\)
Using the equivalences in (b), we can rewrite this as
1. \(\sim r \vee u\) 2. \(\sim u \vee \sim w\) 3. \(r \vee \sim w\) 4. \(\sim r \vee \sim w\) From 1 and 2 by Resolution 5. \(\sim w\) From 3 and 4 by Resolution.
§10 — Proof by Contradiction
Epp 4th ed. pp. 198–207 · 5th ed. (metric) pp. 218–228. Lecture 8 (week 3). Notes: proof-techniques.
Problems
Prove the following statement using a proof by contradiction:
\[\text{For integers } a \text{ and } b,\ \text{if } 6a + 3b \text{ is odd, then } b \text{ is odd.}\]
Use a proof by contradiction to prove the following statement:
\[\text{For all positive integers } x \text{ and } y,\ x^2 - y^2 \neq 1.\]
Solutions
For integers \(a\) and \(b\), if \(6a + 3b\) is odd, then \(b\) is odd.
Proof. Suppose the statement is false, that is, suppose that there exist integers \(a\) and \(b\) for which \(6a + 3b\) is odd and \(b\) is even.
Since \(b\) is even, \(b = 2k\) for some integer \(k\). Thus \[6a + 3b = 6a + 3(2k) = 6a + 6k = 2(3a + 3k).\] Since \(a, k \in \mathbb{Z}\), \(3a + 3k \in \mathbb{Z}\) so \(6a + 3b\) is even. This contradicts our assumption that \(6a + 3b\) is odd, so our assumption was incorrect and hence the original statement is true. \(\square\)
For all positive integers \(x\) and \(y\), \(x^2 - y^2 \neq 1\).
Proof. Suppose, for contradiction, that \(x\) and \(y\) are positive integers satisfying \(x^2 - y^2 = 1\). Now, by factoring, we have \[1 = x^2 - y^2 = (x - y)(x + y).\] Since \(x\) and \(y\) are positive integers, we must have \(x - y = 1\) and \(x + y = 1\). This means \(2x = 2\), so \(x = 1\). But then we must have \(y = 0\) which is not a positive integer; this is a contradiction. Therefore the original statement is true. \(\square\)
§11 — Proof by Contraposition
Epp 4th ed. pp. 198–207 · 5th ed. (metric) pp. 218–228. Lecture 9 (week 3). Notes: proof-techniques.
Problems
Use proof by contraposition to prove the following statement:
\[\text{For all integers } a \text{ and } b,\ \text{if } (ab)^2 \text{ is odd then } a \text{ is odd and } b \text{ is odd.}\]
Prove the following statement:
\[\text{For any integer } n,\ n^2 \text{ is odd if and only if } n \text{ is odd.}\]
Use a direct proof for the reverse implication (\(\Leftarrow\)), and a proof by contraposition for the forward implication (\(\Rightarrow\)).
Use proof by contraposition to prove the following statement:
\[\text{For all integers } x \text{ and } y,\ \text{if } x^2(y^2 - 2y) \text{ is odd then } x \text{ and } y \text{ are odd.}\]
Solutions
For all integers \(a\) and \(b\), if \((ab)^2\) is odd then \(a\) is odd and \(b\) is odd.
Proof. We prove the contrapositive statement, which is:
For all integers \(a\) and \(b\), if \(a\) is even or \(b\) is even, then \((ab)^2\) is even.
Let \(a\) and \(b\) be integers and suppose \(a\) is even or \(b\) is even. Without loss of generality, suppose \(a\) is even, so \(a = 2k\) for some \(k \in \mathbb{Z}\). Then \(ab = 2kb\) is even, and therefore \((ab)^2 = 4k^2b^2 = 2(2k^2b^2)\). Since \(k, b \in \mathbb{Z}\), we know \(2k^2b^2 \in \mathbb{Z}\), so \((ab)^2\) is even by definition. \(\square\)
For any integer \(n\), \(n^2\) is odd if and only if \(n\) is odd.
Proof. To prove this “if and only if” statement, we must prove each of the following two statements:
(\(\Leftarrow\)) For any integer \(n\), if \(n\) is odd, then \(n^2\) is odd. (\(\Rightarrow\)) For any integer \(n\), if \(n^2\) is odd, then \(n\) is odd.
(\(\Leftarrow\)) Let \(n\) be an integer and suppose \(n\) is odd. Then \(n = 2k + 1\) for some \(k \in \mathbb{Z}\). Hence \(n^2 = (2k+1)^2 = 2(2k^2 + 2k) + 1\). Since \(k \in \mathbb{Z}\), we have \(2k^2 + 2k \in \mathbb{Z}\) and hence \(n^2\) is odd by definition.
(\(\Rightarrow\)) The contrapositive is: for any integer \(n\), if \(n\) is even, then \(n^2\) is even. Let \(n\) be an integer and suppose \(n\) is even. Then \(n = 2k\) for some \(k \in \mathbb{Z}\). Hence \(n^2 = 4k^2 = 2(2k^2)\). Since \(k \in \mathbb{Z}\), we have \(2k^2 \in \mathbb{Z}\), so \(n^2\) is even by definition.
Therefore, for all integers \(n\), \(n^2\) is odd if and only if \(n\) is odd. \(\square\)
For all integers \(x\) and \(y\), if \(x^2(y^2 - 2y)\) is odd then \(x\) and \(y\) are odd.
Proof. We will prove the contrapositive statement, which is:
For all integers \(x\) and \(y\), if \(x\) is even or \(y\) is even, then \(x^2(y^2 - 2y)\) is even.
Let \(x, y \in \mathbb{Z}\) and suppose \(x\) or \(y\) is even. We consider the cases of \(x\) even or \(y\) even individually.
Case 1. Suppose \(x\) is even. Then \(x = 2k\) for some \(k \in \mathbb{Z}\). Hence \[x^2(y^2 - 2y) = (2k)^2(y^2 - 2y) = 2(2k^2)(y^2 - 2y).\] Since \(k, y \in \mathbb{Z}\), we have \((2k^2)(y^2 - 2y) \in \mathbb{Z}\), and hence \(x^2(y^2-2y)\) is even, by definition.
Case 2. Suppose \(y\) is even. Then \(y = 2\ell\) for some \(\ell \in \mathbb{Z}\). Hence \[x^2(y^2 - 2y) = x^2\big((2\ell)^2 - 2(2\ell)\big) = 2\big(x^2(2\ell^2 - 2\ell)\big).\] Since \(x, \ell \in \mathbb{Z}\), we have \(x^2(2\ell^2 - 2\ell) \in \mathbb{Z}\) and thus \(x^2(y^2-2y)\) is even, by definition. \(\square\)
§12 — Rational Numbers
Epp 4th ed. pp. 163–170 · 5th ed. (metric) pp. 183–190. Lecture 9 (week 3). Notes: rational-and-irrational-numbers.
Problems
Prove the following statement:
\[\text{For real numbers } m \text{ and } n,\ \text{if } m \text{ is irrational and } n \text{ is rational, then } m - n \text{ is irrational.}\]
Prove the following statement:
\[\text{For a real number } r,\ \text{if } 2r^2 - 3r \text{ is irrational, then } r \text{ is irrational.}\]
Prove the following statement:
\[\text{For all real numbers } r, s, n,\ \text{if } r \text{ is irrational, } s \text{ is rational and } n \text{ is a positive integer, then } n(r-s) \text{ is irrational.}\]
Recall that \(\sqrt{2}\) is irrational. Consider the statement
\[\text{For every rational number } r,\ \text{if } r \neq 0,\ \text{then } r\sqrt{2} \text{ is an irrational number.}\]
Write down the negation of the statement.
Use a proof by contradiction to prove the statement.
Solutions
For real numbers \(m\) and \(n\), if \(m\) is irrational and \(n\) is rational, then \(m - n\) is irrational.
Proof. Let \(m\) and \(n\) be real numbers and suppose (for a contradiction) that \(m\) is an irrational number and \(n\) is rational, but \(m - n\) is rational. Since \(n\) is rational, we have \(n = \frac{a}{b}\) for some \(a, b \in \mathbb{Z}\) where \(b \neq 0\). Since \(m - n\) is rational, we have \(m - n = \frac{c}{d}\) for some \(c, d \in \mathbb{Z}\) where \(d \neq 0\).
Notice that \(m = (m-n) + n\). Hence \[m = (m-n) + n = \frac{c}{d} + \frac{a}{b} = \frac{bc + ad}{bd}.\] Since \(a, b, c, d \in \mathbb{Z}\) we have \(bc + ad \in \mathbb{Z}\) and \(bd \in \mathbb{Z}\). Further, since \(b \neq 0\) and \(d \neq 0\), we have \(bd \neq 0\). Thus, by definition, \(m\) is rational. But this contradicts the assumption that \(m\) is irrational. \(\square\)
For a real number \(r\), if \(2r^2 - 3r\) is irrational, then \(r\) is irrational.
Proof. We prove the contrapositive statement: for a real number \(r\), if \(r\) is rational, then \(2r^2 - 3r\) is rational.
Let \(r\) be a real number and suppose \(r \in \mathbb{Q}\). Then \(r = \frac{a}{b}\) for some \(a, b \in \mathbb{Z}\) where \(b \neq 0\). So \[2r^2 - 3r = 2\left(\frac{a}{b}\right)^2 - 3\left(\frac{a}{b}\right) = \frac{2a^2 - 3ab}{b^2}.\] Since \(a, b \in \mathbb{Z}\), we have \(2a^2 - 3ab \in \mathbb{Z}\) and \(b^2 \in \mathbb{Z}\). Further, \(b^2 \neq 0\) because \(b \neq 0\). This means \(2r^2 - 3r\) is rational, by definition. \(\square\)
For all real numbers \(r\), \(s\), and \(n\), if \(r\) is irrational, \(s\) is rational and \(n\) is a positive integer, then \(n(r-s)\) is irrational.
Proof. Suppose, for a contradiction, that the statement is false. Then there exist real numbers \(r\), \(s\) and \(n\) such that \(r\) is an irrational number, \(s\) is rational, \(n\) is a positive integer, but \(n(r-s)\) is rational. Since \(s\) is rational, \(s = \frac{a}{b}\) for some \(a, b \in \mathbb{Z}\) where \(b \neq 0\). Since \(n(r-s)\) is rational, we have \(n(r-s) = \frac{c}{d}\) for some \(c, d \in \mathbb{Z}\) where \(d \neq 0\).
Now, \[\begin{aligned} r - s &= n(r-s)\left(\frac{1}{n}\right) && \text{noting that } n \neq 0 \\ r - s &= \frac{c}{d} \cdot \frac{1}{n} \\ r &= s + \frac{c}{d} \cdot \frac{1}{n} \\ &= \frac{a}{b} + \frac{c}{dn} \\ &= \frac{adn + bc}{bdn} \end{aligned}\] Since \(a, b, c, d \in \mathbb{Z}\), we have \(adn + bc \in \mathbb{Z}\) and \(bdn \in \mathbb{Z}\). Further, since \(b \neq 0\), \(d \neq 0\) and \(n \neq 0\), we have \(bdn \neq 0\). This means \(r\) is rational, by definition, which is a contradiction. \(\square\)
For every rational number \(r\), if \(r \neq 0\), then \(r\sqrt{2}\) is an irrational number.
Negation: There exists \(r \in \mathbb{Q}\) such that \(r \neq 0\) and \(r\sqrt{2} \in \mathbb{Q}\).
Proof. Suppose, for a contradiction, that the original statement is false. Then there exists \(r \in \mathbb{Q}\) such that \(r \neq 0\) and \(r\sqrt{2} \in \mathbb{Q}\). Since \(r\) is rational, \(r = \frac{a}{b}\) for some \(a, b \in \mathbb{Z}\) with \(b \neq 0\), and since \(r \neq 0\), we have \(a \neq 0\). Since we have assumed \(r\sqrt{2}\) is rational, \(r\sqrt{2} = \frac{c}{d}\) for some \(c, d \in \mathbb{Z}\) where \(d \neq 0\).
Now \[\sqrt{2} = \frac{r\sqrt{2}}{r} = \left(r\sqrt{2}\right)\left(\frac{1}{r}\right) = \frac{c}{d} \cdot \frac{b}{a} = \frac{bc}{ad}.\] Since \(a, b, c, d \in \mathbb{Z}\), we know \(bc \in \mathbb{Z}\) and \(ad \in \mathbb{Z}\). Further, since \(a \neq 0\) and \(d \neq 0\), we have \(ad \neq 0\). Thus, by definition, \(\sqrt{2}\) is rational. However, this is a contradiction, as \(\sqrt{2}\) is irrational. Thus, the original statement is true. \(\square\)
§13 — Divisibility
Epp 4th ed. pp. 170–179 · 5th ed. (metric) pp. 190–199. Lecture 10 (week 4). Notes: divisibility-and-factorisation.
Problems
Find the unique factorisation (in standard form) of the integer \(27\,720\).
Prove or disprove the statement: for any integers \(m\), \(n\), and \(q\), if \(m \mid n\) and \(n \mid q\) then \(m^2 \mid nq\).
Prove the following statements.
If \(k\) is any even integer and \(m\) is any odd integer, then \((k+2)^2 - (m-3)^2\) is divisible by 4.
The difference between the cube of two consecutive integers leaves the remainder 1 when it is divided by 6.
Use proof by contradiction to prove this statement:
\[\text{For all integers } c, d \text{ and } e,\ \text{if } c \mid d \text{ and } c \nmid e,\ \text{then } c \nmid (d+e).\]
Solutions
By repeated division, we have \(27\,720 = 2^3 \cdot 3^2 \cdot 5 \cdot 7 \cdot 11\).
For any integers \(m\), \(n\), and \(q\), if \(m \mid n\) and \(n \mid q\) then \(m^2 \mid nq\). The statement is true, and we will prove it.
Proof. Let \(m\), \(n\), and \(q\) be non-zero integers. Assume \(m \mid n\) and \(n \mid q\). Then, by definition, there exist integers \(a, b\) such that \[n = ma \quad \text{and} \quad q = nb.\] Then observe \[nq = (ma)(nb) = ma \cdot (mab) = m^2(a^2 b).\] Since \(a^2 b \in \mathbb{Z}\), we conclude that \(m^2 \mid nq\). \(\square\)
- If \(k\) is any even integer and \(m\) is any odd integer, then \((k+2)^2 - (m-3)^2\) is divisible by 4.
Proof. Let \(k\) be even and \(m\) be odd. Then \(k = 2a\) and \(m = 2b + 1\) for some \(a, b \in \mathbb{Z}\). Hence \[(k+2)^2 = (2a+2)^2 = 4(a+1)^2 \quad \text{and} \quad (m-3)^2 = (2b-2)^2 = 4(b-1)^2.\] Therefore \[(k+2)^2 - (m-3)^2 = 4\big[(a+1)^2 - (b-1)^2\big].\] Since \(a, b \in \mathbb{Z}\) we have \((a+1)^2 - (b-1)^2 \in \mathbb{Z}\) so \(4 \mid \big[(k+2)^2 - (m-3)^2\big]\). \(\square\)
- The difference between the cube of two consecutive integers leaves the remainder 1 when it is divided by 6.
Proof. Let \(n\) and \(n+1\) be two consecutive integers. The difference between their cubes is \[(n+1)^3 - n^3 = 3n^2 + 3n + 1 = 3n(n+1) + 1.\] Now whether \(n\) is odd or even (so whatever integer \(n\) is), one of \(n\), \(n+1\) will be odd and the other one will be even. Thus the product \(n(n+1)\) is even.
Since \(n(n+1)\) is even, write \(n(n+1) = 2t\) for some \(t \in \mathbb{Z}\). Then \[(n+1)^3 - n^3 = 3(2t) + 1 = 6t + 1 \equiv 1 \pmod 6.\] Hence the remainder is 1 upon division by 6. \(\square\)
For all integers \(c\), \(d\) and \(e\), if \(c \mid d\) and \(c \nmid e\), then \(c \nmid (d+e)\).
Proof. Suppose for a contradiction that the statement is false. Then there exist integers \(c\), \(d\) and \(e\) such that \(c \mid d\) and \(c \nmid e\) and \(c \mid (d+e)\).
Now \(c \mid d\) means that \(d = cx\) for some integer \(x\). And \(c \mid (d+e)\) means that \(d + e = cy\) for some integer \(y\).
Hence \(d + e = cx + e = cy\), so \(e = cy - cx = c(y-x)\), and we have \(y - x \in \mathbb{Z}\), because \(x\) and \(y\) are both integers. Thus \(c \mid e\), a contradiction. So the original statement is true. \(\square\)
§14 — Modular Arithmetic
Epp 4th ed. pp. 482–485 · 5th ed. (metric) pp. 528–531. Lecture 11 (week 4). Notes: modular-arithmetic.
Problems
Prove the following statement:
\[\text{If } y \text{ is any integer, then when } y^2 \text{ is divided by 5, the remainder is always 0, 1 or 4, and never 2 or 3.}\]
Evaluate \(58 \operatorname{div} 11\) and \(58 \bmod 11\).
Find integers \(q\) and \(r\), with \(0 \leqslant r < d\) and \(n = dq + r\), in the case that \(n = -95\) and \(d = 11\).
An integer \(n\), when divided by 7, leaves remainder 4. What is the remainder (between 0 and 6 inclusive) when \(3n\) is divided by 7?
When the integer \(m\) is divided by 11, the remainder 9 is left. What remainder is left when \(4m\) is divided by 22?
Prove or disprove the following statements.
For all real numbers \(x\), \(\lfloor x^2 \rfloor = \lfloor x \rfloor^2\).
For all odd integers \(n\), \(\left\lfloor \dfrac{n^2}{4} \right\rfloor = \left(\dfrac{n-1}{2}\right)\left(\dfrac{n+1}{2}\right)\).
Solutions
If \(y\) is any integer, then when \(y^2\) is divided by 5, the remainder is always 0, 1 or 4, and never 2 or 3.
Proof. Fix \(y \in \mathbb{Z}\). By the division algorithm, \(y = 5m + r\) for some \(m \in \mathbb{Z}\) and \(r \in \{0, 1, 2, 3, 4\}\). Then \[y^2 = (5m+r)^2 = 25m^2 + 10mr + r^2 \equiv r^2 \pmod 5.\] Let us compute the possible values for \(r^2 \bmod 5\): \[0^2 \equiv 0, \quad 1^2 \equiv 1, \quad 2^2 \equiv 4, \quad 3^2 \equiv 9 \equiv 4, \quad 4^2 \equiv 16 \equiv 1 \pmod 5.\] Thus \(y^2 \equiv 0, 1\), or \(4 \pmod 5\), and never 2 or 3. \(\square\)
- Since \(58 = 11 \cdot 5 + 3\) with \(0 \leq 3 < 11\), we have
\[58 \operatorname{div} 11 = 5 \quad \text{and} \quad 58 \bmod 11 = 3.\]
- We want \(-95 = 11q + r\) with \(0 \leq r < 11\). Taking \(q = -9\) gives
\[11(-9) = -99 \quad \Rightarrow \quad -95 = -99 + 4 = 11(-9) + 4,\]
so \(q = -9\) and \(r = 4\).
- If \(n\) leaves remainder 4 upon division by 7, then \(n = 7k + 4\) for some integer \(k\). Hence
\[3n = 21k + 12 = 7(3k + 1) + 5,\]
so the remainder when \(3n\) is divided by 7 is 5. (The source PDF prints this step as \(7(3k) + 5\), which equals \(21k + 5\), not \(21k + 12\) — the quotient is \(3k + 1\), as above. The answer of 5 is unaffected.)
- If \(m\) leaves remainder 9 upon division by 11, then \(m = 11k + 9\) for some integer \(k\). Then
\[4m = 44k + 36 = 22(2k+1) + 14,\]
so the remainder when \(4m\) is divided by 22 is 14.
- For all real numbers \(x\), \(\lfloor x^2 \rfloor = \lfloor x \rfloor^2\). The statement is false. For a counterexample, take \(x = \frac{3}{2}\). Then
\[\lfloor x^2 \rfloor = \left\lfloor \frac{9}{4} \right\rfloor = 2 \quad \text{but} \quad \lfloor x \rfloor^2 = \left\lfloor \frac{3}{2} \right\rfloor^2 = 1^2 = 1.\]
- For all odd integers \(n\), \(\left\lfloor \dfrac{n^2}{4} \right\rfloor = \left(\dfrac{n-1}{2}\right)\left(\dfrac{n+1}{2}\right)\). The statement is true.
Proof. Let \(n\) be an odd integer, so \(n = 2k+1\) for some integer \(k\). Then \[\frac{n^2}{4} = \frac{(2k+1)^2}{4} = \frac{4k^2 + 4k + 1}{4} = k(k+1) + \frac{1}{4},\] so \(\left\lfloor \frac{n^2}{4} \right\rfloor = k(k+1)\). Moreover, notice \[\left(\frac{n-1}{2}\right)\left(\frac{n+1}{2}\right) = \left(\frac{2k}{2}\right)\left(\frac{2k+2}{2}\right) = k(k+1).\] Hence \(\left\lfloor \frac{n^2}{4} \right\rfloor = \left(\frac{n-1}{2}\right)\left(\frac{n+1}{2}\right)\) for all odd integers \(n\). \(\square\)
§15 — The Euclidean Algorithm
Epp 4th ed. pp. 220–224 · 5th ed. (metric) pp. 250–254. Lecture 12 (week 4). Notes: gcd-lcm-and-euclidean-algorithm.
Problems
Use the Euclidean Algorithm to determine \(\gcd(14, 3003)\).
Compute
\(\operatorname{lcm}(12, 18)\)
\(\operatorname{lcm}(2^2 \cdot 3 \cdot 5,\ 2^3 \cdot 3^2)\)
\(\operatorname{lcm}(2800, 6125)\)
Prove that for all positive integers \(a\) and \(b\), we have
\[\gcd(a,b) = \operatorname{lcm}(a,b) \iff a = b.\]
Prove that for all positive integers \(a\) and \(b\), we have
\[a \mid b \iff \operatorname{lcm}(a,b) = b.\]
Use the Euclidean algorithm to determine \(\gcd(931, 301)\). Show your working.
Write down the unique prime factorisation of 931 in standard form.
How many positive divisors does 931 have? (Hint: use part (b).)
Using the Euclidean algorithm, compute \(\gcd(116, 88)\). Show your working.
Using your answer to part (a), compute \(\operatorname{lcm}(116, 88)\).
Solutions
We apply the Euclidean Algorithm:
\[3003 = 14 \cdot 214 + 7, \qquad 14 = 7 \cdot 2 + 0.\]
Hence \(\gcd(14, 3003) = 7\).
We factor \(12 = 2^2 \cdot 3\) and \(18 = 2 \cdot 3^2\) so \(\operatorname{lcm}(12, 18) = 2^2 \cdot 3^2 = 36\).
Using the maximum exponents of each prime, we have
\[\operatorname{lcm}(2^2 \cdot 3 \cdot 5,\ 2^3 \cdot 3^2) = 2^3 \cdot 3^2 \cdot 5 = 360.\]
- We factor \(2800 = 2^4 \cdot 5^2 \cdot 7\) and \(6125 = 5^3 \cdot 7^2\). Thus
\[\operatorname{lcm}(2800, 6125) = 2^4 \cdot 5^3 \cdot 7^2 = 98000.\]
For all positive integers \(a\) and \(b\), \(\gcd(a,b) = \operatorname{lcm}(a,b)\) if and only if \(a = b\).
Proof. Let \(a\) and \(b\) be positive integers.
(\(\Longleftarrow\)) It is clear that if \(a = b\) then \(\gcd(a,b) = \operatorname{lcm}(a,b)\).
(\(\Longrightarrow\)) Assume \(\gcd(a,b) = \operatorname{lcm}(a,b)\). Denoting \(g = \gcd(a,b)\), we have \(a = gm\) and \(b = gn\) for some positive integers \(m\) and \(n\) with \(\gcd(m,n) = 1\).
Now notice \(gm\) and \(gn\) have no common prime factors beyond those in \(g\), so the least common multiple uses all primes from both \(m\) and \(n\). Therefore \[\operatorname{lcm}(a,b) = gmn.\] Now, we have \(g = gmn\). Therefore \(mn = 1\), and so \(m = n = 1\). This lets us conclude \(a = b\). \(\square\)
For all positive integers \(a\) and \(b\), \(a \mid b\) if and only if \(\operatorname{lcm}(a,b) = b\).
Proof. Let us denote \(g = \gcd(a,b)\) so that \(a = gm\) and \(b = gn\) for some positive integers \(m\) and \(n\) with \(\gcd(m,n) = 1\). As explained in the previous question, we have \[\operatorname{lcm}(a,b) = gmn.\]
(\(\Longrightarrow\)) If \(a \mid b\), then \(gm \mid gn\), hence \(m \mid n\). Since \(\gcd(m,n) = 1\), we conclude \(m = 1\). Therefore \(\operatorname{lcm}(a,b) = gmn = gn = b\).
(\(\Longleftarrow\)) If \(\operatorname{lcm}(a,b) = b\), then \(gmn = gn\) which means \(m = 1\). Therefore \(a = gm = g\) and so \(a \mid b\). \(\square\)
- Using the Euclidean Algorithm:
\[\begin{aligned} 931 &= 301 \cdot 3 + 28 \\ 301 &= 28 \cdot 10 + 21 \\ 28 &= 21 \cdot 1 + 7 \\ 21 &= 7 \cdot 3 + 0. \end{aligned}\]
Hence \(\gcd(931, 301) = 7\).
Since \(\gcd(931, 301) = 7\), we know \(7 \mid 931\), and we have \(931 = 7 \cdot 133\). The number 133 has prime factorisation \(7 \cdot 19\). Therefore the unique prime factorisation of 931 is \(7^2 \cdot 19\).
We have \(931 = 7^2 \cdot 19^1\) from part (b). Any divisor of 931 must have a prime factorisation of the form \(7^a \cdot 19^b\) where \(a \in \{0,1,2\}\) and \(b \in \{0,1\}\). Thus the number of positive divisors is
\[(2+1)(1+1) = 6.\]
(There are 3 choices for the exponent \(a\) and 2 choices for the exponent \(b\).)
- Using the Euclidean Algorithm:
\[\begin{aligned} 116 &= 88 \cdot 1 + 28 \\ 88 &= 28 \cdot 3 + 4 \\ 28 &= 4 \cdot 7 + 0 \end{aligned}\]
Hence \(\gcd(116, 88) = 4\).
- Using \(\gcd(a,b) \cdot \operatorname{lcm}(a,b) = ab\) for \(a, b \in \mathbb{Z}^+\),
\[\operatorname{lcm}(116, 88) = \frac{116 \cdot 88}{\gcd(116,88)} = \frac{116 \cdot 88}{4} = 116 \cdot 22 = 2552.\]
Application — Trace Tables for Algorithms
Not assessable for MATH1061. For reference, see S. Epp, Discrete Mathematics with Applications, Section 4.8 (4th edition) or Section 4.10 (5th edition), Brooks/Cole, Belmont, CA.
The following pseudo-code describes the Division Algorithm, with annotations to explain what each step is doing.
Input: \(a\) (a non-negative integer), \(d\) (a positive integer). This algorithm will take two inputs, \(a\) and \(d\), and will find the quotient \(a \operatorname{div} d\) and the remainder \(a \bmod d\).
Algorithm body:
r := a -- defining our variables
q := 0
-- starting with a, repeatedly subtract lots of d until we reach
-- a number less than d; each round adds 1 to the quotient count
while r >= d,
r := r - d
q := q + 1
end while
Output: \(q\), \(r\). Once we have obtained a number less than \(d\), we are finished. The output \(q\) is the quotient (\(a \operatorname{div} d\)) and the output \(r\) is the remainder (\(a \bmod d\)).
The following pseudo-code describes the Euclidean Algorithm, with annotations to explain what each step is doing.
Input: \(A\), \(B\) (integers with \(A > B \geq 0\)).
Algorithm body:
a := A -- defining our variables
b := B
r := B
-- if b /= 0, compute a mod b (call the algorithm above for this
-- step) and set r to be this value; replace a with b and b with r
-- and repeat until b = 0
while b /= 0,
r := a mod b
a := b
b := r
end while
gcd := a
Output: \(\text{gcd}\) (a positive integer).
A trace table keeps track of the value of each variable at each step of an algorithm. For example, the trace table for the Division Algorithm with input variables \(a = 19\) and \(d = 4\) is:
| Variable / iteration | 0 | 1 | 2 | 3 | 4 |
|---|---|---|---|---|---|
| \(a\) | 19 | ||||
| \(d\) | 4 | ||||
| \(r\) | 19 | 15 | 11 | 7 | 3 |
| \(q\) | 0 | 1 | 2 | 3 | 4 |
Output: \(q = 4\), \(r = 3\).
Application problems
Construct a trace table to trace the action of the Division Algorithm for the following inputs.
\(a = 26\), \(d = 7\)
\(a = 15\), \(d = 6\)
Construct a trace table to trace the action of the Euclidean Algorithm with inputs \(A = 1001\) and \(B = 871\).
Application solutions
- Trace table for the Division Algorithm with \(a = 26\), \(d = 7\):
Variable / iteration 0 1 2 3 \(a\) 26 \(d\) 7 \(r\) 26 19 12 5 \(q\) 0 1 2 3 Output: \(q = 3\), \(r = 5\).
- Trace table for the Division Algorithm with \(a = 15\), \(d = 6\):
Variable / iteration 0 1 2 \(a\) 15 \(d\) 6 \(r\) 15 9 3 \(q\) 0 1 2 Output: \(q = 2\), \(r = 3\).
Trace table for the Euclidean Algorithm with inputs \(A = 1001\) and \(B = 871\):
Variable / iteration 0 1 2 3 4 5 \(A\) 1001 \(B\) 871 \(a\) 1001 871 130 91 39 13 \(b\) 871 130 91 39 13 0 \(r\) 871 130 91 39 13 0 \(\text{gcd}\) 13 Output: \(\text{gcd} = 13\).
§16 — Sequences
Epp 4th ed. pp. 227–244 · 5th ed. (metric) pp. 258–275. Lecture 13 (week 5).
Problems
Write down the first four terms in the sequence defined by \(a_k = \dfrac{k}{10+k}\) for \(k = 1, 2, \dots\).
Consider the sequences \(a_k = 2k+1\) and \(b_k = (k-1)^3 + k + 2\) where \(k = 0, 1, 2, \dots\). Show that the first three terms of these sequences are identical, but that their fourth terms differ.
Find an explicit formula for a sequence \(c_n\) whose first six terms are \(-1, 1, -1, 1, -1, 1\).
Find an explicit formula for a sequence \(d_n\) whose first six terms are \(\frac{1}{4}, \frac{2}{9}, \frac{3}{16}, \frac{4}{25}, \frac{5}{36}, \frac{6}{49}\).
Write \((x^2 - 1) + (2x^3 - 1) + (3x^4 - 1) + (4x^5 - 1) + (5x^6 - 1)\) in summation notation.
Evaluate \(\displaystyle\prod_{i=1}^{5} (-1)^i \cdot i\).
Write \((y-1)(y^2 - 2)(y^3 - 3)(y^4 - 4)\) in product notation.
Evaluate \(\displaystyle\sum_{j=1}^{n} (-1)^j \frac{1}{2^j}\) when \(n = 5\).
Solutions
We have
\[a_1 = \frac{1}{11}, \qquad a_2 = \frac{2}{12} = \frac{1}{6}, \qquad a_3 = \frac{3}{13}, \qquad a_4 = \frac{4}{14} = \frac{2}{7}.\]
We compute
\[a_0 = 1,\quad a_1 = 3,\quad a_2 = 5,\quad a_3 = 7;\]
\[b_0 = (-1)^3 + 0 + 2 = 1, \quad b_1 = 0^3 + 1 + 2 = 3, \quad b_2 = 1^3 + 2 + 2 = 5, \quad b_3 = 2^3 + 3 + 2 = 13.\]
Hence the first three terms agree (\(a_0 = b_0\), \(a_1 = b_1\) and \(a_2 = b_2\)), but the fourth terms differ (\(a_3 = 7\) while \(b_3 = 13\)).
- One explicit formula is
\[c_n = (-1)^n \qquad n = 1, 2, 3, \dots\]
- The denominators are square numbers, so an explicit formula is
\[d_n = \frac{n}{(n+1)^2} \qquad n = 1, 2, 3, \dots\]
- We have
\[(x^2 - 1) + (2x^3 - 1) + (3x^4 - 1) + (4x^5 - 1) + (5x^6 - 1) = \sum_{k=1}^{5} \left(kx^{k+1} - 1\right).\]
- We have
\[\prod_{i=1}^{5} (-1)^i \cdot i = \left(\prod_{i=1}^{5} (-1)^i\right)\left(\prod_{i=1}^{5} i\right) = (-1)^{1+2+3+4+5} \cdot 5! = (-1)^{15} \cdot 120 = -120.\]
- We have
\[(y-1)(y^2-2)(y^3-3)(y^4-4) = \prod_{k=1}^{4} \left(y^k - k\right).\]
- When \(n = 5\), we have
\[\sum_{j=1}^{5} (-1)^j \frac{1}{2^j} = -\frac{1}{2} + \frac{1}{4} - \frac{1}{8} + \frac{1}{16} - \frac{1}{32} = -\frac{11}{32}.\]
§17 — Mathematical Induction
Epp 4th ed. pp. 244–268 · 5th ed. (metric) pp. 275–301. Lecture 13 (week 5).
Problems
Use mathematical induction to prove the following statements.
For every positive integer \(n\), \(n(n+1)\) is even.
For every integer \(n \geq 2\), \(n^3 - n\) is a multiple of 6.
For all integers \(n \geq 7\), \(3^n < n!\).
For each integer \(n \geq 1\),
\[\sum_{i=1}^{n} i^3 = \frac{n^2(n+1)^2}{4}.\]
- For each integer \(n \geq 0\), \(1 + 4n \leq 5^n\).
Solutions
- For every positive integer \(n\), \(n(n+1)\) is even.
Proof. Let \(P(n)\) be the predicate “\(n(n+1)\) is even”.
Basis: when \(n = 1\), \(n(n+1) = 2\) which is even, so \(P(1)\) is true.
(The inductive step is to show that for all integers \(k \geq 1\), \(P(k)\) implies \(P(k+1)\).)
Inductive hypothesis: suppose that for some integer \(k \geq 1\), \(P(k)\) is true. Thus \(k(k+1) = 2a\) for some integer \(a\).
Now consider \(n = k+1\). Then \[(k+1)(k+2) = k(k+1) + 2(k+1) = 2a + 2(k+1) = 2(a + k + 1).\] Since \(a\) and \(k\) are integers, \(a + k + 1\) is an integer, so \((k+1)(k+2)\) is even and \(P(k+1)\) is true.
Thus, by the principle of mathematical induction, \(n(n+1)\) is even for every positive integer \(n\). \(\square\)
- For every integer \(n \geq 2\), \(n^3 - n\) is a multiple of 6.
Proof. Let \(P(n)\) be the predicate \(6 \mid (n^3 - n)\).
Basis: when \(n = 2\), \(n^3 - n = 8 - 2 = 6\). Since \(6 \mid 6\), \(P(2)\) is true.
(The inductive step is to show that for all integers \(k \geq 2\), \(P(k)\) implies \(P(k+1)\).)
Inductive hypothesis: suppose that for some integer \(k \geq 2\), \(P(k)\) is true. Thus \(k^3 - k = 6a\) for some integer \(a\).
Now consider \(n = k+1\). Then \[(k+1)^3 - (k+1) = k^3 + 3k^2 + 3k + 1 - k - 1 = k^3 - k + 3k^2 + 3k = 6a + 3k(k+1).\] For the integer \(k\), \(k(k+1)\) is even from part (a), so let \(k(k+1) = 2b\) for some integer \(b\). Hence \((k+1)^3 - (k+1) = 6a + 3(2b) = 6(a+b)\). Thus \(6 \mid \big((k+1)^3 - (k+1)\big)\) and so \(P(k+1)\) is true.
Thus, by the principle of mathematical induction, \(n^3 - n\) is a multiple of 6 for each integer \(n \geq 2\). \(\square\)
- For all integers \(n \geq 7\), \(3^n < n!\).
Proof. Let \(P(n)\) be the predicate \(3^n < n!\).
Basis: \(P(7)\) is the statement \(3^7 < 7!\). The left-hand side is \(3^7 = 2187\) and the right-hand side is \(7! = 5040\), so \(P(7)\) holds.
(The inductive step is to show that for all integers \(k \geq 7\), \(P(k)\) implies \(P(k+1)\).)
Inductive hypothesis: let \(k \geq 7\) be an integer and assume that \(P(k)\) is true; that is \(3^k < k!\). We will now show that \(P(k+1)\) holds, so we will show \(3^{k+1} < (k+1)!\).
Taking the right-hand side, we have \[\begin{aligned} (k+1)! &= (k+1) \cdot k! \\ &> (k+1) \cdot 3^k && \text{by the inductive hypothesis} \\ &> 3 \cdot 3^k && \text{since } k \geq 7 \\ &= 3^{k+1} \end{aligned}\] Hence \(P(k+1)\) is true.
Thus by the principle of mathematical induction, for all integers \(n \geq 7\), \(3^n < n!\). \(\square\)
- For each integer \(n \geq 1\), \(\displaystyle\sum_{i=1}^{n} i^3 = \frac{n^2(n+1)^2}{4}\).
Proof. Let \(P(n)\) be the predicate \[\sum_{i=1}^{n} i^3 = \frac{n^2(n+1)^2}{4}.\]
Basis: consider \(n = 1\). We have \(\sum_{i=1}^{1} i^3 = 1^3 = 1\) and \(\frac{1^2(1+1)^2}{4} = \frac{4}{4} = 1\) so \(P(1)\) is true.
(The inductive step is to show that for all integers \(k \geq 1\), \(P(k)\) implies \(P(k+1)\).)
Inductive hypothesis: suppose \(k \geq 1\) is an integer and \(P(k)\) is true. That is, \[\sum_{i=1}^{k} i^3 = \frac{k^2(k+1)^2}{4}.\]
Now consider \(n = k+1\). \[\begin{aligned} \sum_{i=1}^{k+1} i^3 &= \sum_{i=1}^{k} i^3 + (k+1)^3 && \text{(splitting off the last term)} \\ &= \frac{k^2(k+1)^2}{4} + (k+1)^3 && \text{by the inductive hypothesis} \\ &= \frac{k^2(k+1)^2}{4} + \frac{4(k+1)^3}{4} \\ &= \frac{(k+1)^2}{4}\big(k^2 + 4(k+1)\big) \\ &= \frac{(k+1)^2}{4}\big(k^2 + 4k + 4\big) \\ &= \frac{(k+1)^2}{4}(k+2)^2 \end{aligned}\] Thus \(P(k+1)\) is true.
Therefore, by the principle of mathematical induction, \(\sum_{i=1}^{n} i^3 = \frac{n^2(n+1)^2}{4}\) for every integer \(n \geq 1\). \(\square\)
- For each integer \(n \geq 0\), \(1 + 4n \leq 5^n\).
Proof. Let \(P(n)\) be the predicate \(1 + 4n \leq 5^n\).
Basis: when \(n = 0\) we have \(1 + 4 \cdot 0 \leq 5^0\), so \(P(0)\) is true.
(The inductive step is to show that for all integers \(k \geq 0\), \(P(k)\) implies \(P(k+1)\).)
Inductive hypothesis: suppose \(k \geq 0\) is an integer and \(P(k)\) is true; that is, \(1 + 4k \leq 5^k\).
Now consider \(n = k+1\). Starting with the left-hand side of \(P(k+1)\), we have \[\begin{aligned} 1 + 4(k+1) &= 1 + 4k + 4 \\ &\leq 5^k + 4 && \text{by the inductive hypothesis} \\ &\leq 5^k + 4 \cdot 5^k && \text{since } k \geq 0 \text{ so } 5^k \geq 1 \\ &= 5(5^k) \\ &= 5^{k+1} \end{aligned}\] so \(P(k+1)\) is true.
Thus, by the principle of mathematical induction, \(1 + 4n \leq 5^n\) for every integer \(n \geq 0\). \(\square\)
§18 — Strong Induction and the Well Ordering Principle
Epp 4th ed. pp. 268–279 · 5th ed. (metric) pp. 301–314. Lecture 14 (week 5).
Problems
Consider the statement
\[\text{For every integer } n \geq 2, \text{ there exist integers } a, b \geq 0 \text{ such that } n = 2a + 3b.\]
Prove the statement using the well-ordering principle.
Prove the statement using strong mathematical induction.
The Lucas sequence \(a_1, a_2, a_3, \dots\) is defined by \(a_1 = 1\), \(a_2 = 3\) and \(a_k = a_{k-1} + a_{k-2}\) for all integers \(k \geqslant 3\). Use strong mathematical induction to prove that \(a_n \leqslant \left(\dfrac{7}{4}\right)^n\) for all \(n \in \mathbb{Z}^+\).
Suppose \(x\) is a real number and \(x + \frac{1}{x}\) is an integer. Use strong mathematical induction to prove \(a_n := x^n + \frac{1}{x^n}\) is an integer for all \(n \geq 0\).
Solutions
For every integer \(n \geq 2\), there exist integers \(a, b \geq 0\) such that \(n = 2a + 3b\).
Proof (using the well-ordering principle). Consider the set of counterexamples \[S = \{\, n \in \mathbb{Z}^{\geq 2} : \text{there do not exist integers } a, b \geq 0 \text{ with } n = 2a + 3b \,\}.\] If \(S\) is empty, we are done. Otherwise, by the well-ordering principle, \(S\) has a least element. Let us call it \(N\).
Notice that \(2 \notin S\) because \(2 = 2 \cdot 1 + 3 \cdot 0\), and \(3 \notin S\) because \(3 = 2 \cdot 0 + 3 \cdot 1\). Also \(4 \notin S\) because \(4 = 2 \cdot 2 + 3 \cdot 0\). Hence \(N \geq 5\). By minimality of \(N\), we must have \(N - 2 \notin S\). Therefore there exist integers \(a, b \geq 0\) such that \[N - 2 = 2a + 3b.\] In other words, we have \[N = 2(a+1) + 3b.\] This means \(N \notin S\), contradicting the assumption that \(N \in S\). Hence \(S\) is empty, and the statement holds for all \(n \geq 2\). \(\square\)
Proof (using strong induction). Let \(P(n)\) be the predicate: “there exist integers \(a, b \geq 0\) such that \(n = 2a + 3b\).”
Basis: we have \[2 = 2 \cdot 1 + 3 \cdot 0, \qquad 3 = 2 \cdot 0 + 3 \cdot 1, \qquad 4 = 2 \cdot 2 + 3 \cdot 0,\] so \(P(2)\), \(P(3)\), \(P(4)\) are true.
(The inductive step is to show that for every integer \(k \geq 4\), if \(P(2), P(3), \dots, P(k)\) are all true then \(P(k+1)\) is true.)
Inductive hypothesis: suppose \(k \geq 4\) is an integer and assume \(P(m)\) is true for every integer \(m = 2, 3, \dots, k\).
Consider \(n = k+1\). Since \(k \geq 4\), we have \(k - 1 \geq 3\), so by the inductive hypothesis \(P(k-1)\) is true. Thus there exist \(a, b \geq 0\) such that \[k - 1 = 2a + 3b.\] Adding 2 gives \[k + 1 = 2(a+1) + 3b,\] so \(P(k+1)\) holds. \(\square\)
The Lucas sequence \(a_1, a_2, a_3, \dots\) is defined by \(a_1 = 1\), \(a_2 = 3\) and \(a_k = a_{k-1} + a_{k-2}\) for all integers \(k \geqslant 3\). Prove that \(a_n \leqslant \left(\frac{7}{4}\right)^n\) for all \(n \in \mathbb{Z}^+\).
Proof. Let \(P(n)\) be the predicate \(a_n \leqslant \left(\frac{7}{4}\right)^n\).
Basis: when \(n = 1\), \(a_1 = 1 \leqslant \left(\frac{7}{4}\right)^1 = 1\frac{3}{4}\) is true, so \(P(1)\) is true. When \(n = 2\), \(P(2)\) holds because \(a_2 = 3 \leqslant \left(\frac{7}{4}\right)^2 = \frac{49}{16} = 3\frac{1}{16}\).
(The inductive step is to show that for every integer \(k \geq 1\), if \(P(1), \dots, P(k)\) are all true then \(P(k+1)\) is true.)
Inductive hypothesis: suppose \(k \geq 1\) is an integer and that \(P(m)\) is true for all \(m\) with \(1 \leq m \leq k\).
Now consider \(P(k+1)\), which we want to prove holds. We have \[\begin{aligned} a_{k+1} &= a_k + a_{k-1} \\ &\leqslant \left(\frac{7}{4}\right)^k + \left(\frac{7}{4}\right)^{k-1} && \text{by the inductive hypothesis} \\ &= \left(\frac{7}{4}\right)^{k-1}\left(\frac{7}{4} + 1\right) \\ &= \left(\frac{7}{4}\right)^{k-1}\left(\frac{11}{4}\right) \\ &\leqslant \left(\frac{7}{4}\right)^{k-1}\left(\frac{49}{16}\right) && \text{noting } \tfrac{11}{4} = \tfrac{44}{16} < \tfrac{49}{16} \\ &= \left(\frac{7}{4}\right)^{k-1}\left(\frac{7}{4}\right)^2 \\ &= \left(\frac{7}{4}\right)^{k+1}. \end{aligned}\] Hence \(P(k+1)\) holds. Therefore, by the principle of strong mathematical induction, \(a_n \leqslant \left(\frac{7}{4}\right)^n\) for all integers \(n \geqslant 1\). \(\square\)
Suppose \(x\) is a real number and \(x + \frac{1}{x}\) is an integer. Prove \(a_n := x^n + \frac{1}{x^n}\) is an integer for all \(n \geq 0\).
Proof. Suppose \(x\) is a real number and \(x + \frac{1}{x}\) is an integer. Let \(P(n)\) be the predicate “\(a_n\) is an integer.”
Basis: \(P(0)\) holds since \(a_0 = x^0 + \frac{1}{x^0} = 2\). \(P(1)\) holds since \(a_1 = x + \frac{1}{x}\), which is an integer by assumption.
(The inductive step is to show that for every integer \(k \geq 1\), if \(P(0), P(1), \dots, P(k)\) are all true then \(P(k+1)\) is true.)
Inductive hypothesis: suppose \(k \geq 1\) is an integer and \(P(m)\) holds for all integers \(m = 0, 1, \dots, k\).
We now aim to show that \(P(k+1)\) is true. Notice that \[\begin{aligned} a_1 a_k &= \left(x + \frac{1}{x}\right)\left(x^k + \frac{1}{x^k}\right) \\ &= \left(x^{k+1} + \frac{1}{x^{k+1}}\right) + \left(x^{k-1} + \frac{1}{x^{k-1}}\right) = a_{k+1} + a_{k-1}. \end{aligned}\] Therefore \(a_{k+1} = a_1 a_k - a_{k-1}\). By the inductive hypothesis, \(a_k\) and \(a_{k-1}\) are integers, and \(a_1\) is an integer, so \(a_{k+1}\) is an integer. Hence \(P(k+1)\) holds.
Therefore, by the principle of strong mathematical induction, \(a_n\) is an integer for all \(n \geq 0\). \(\square\)
§19 — Recursive Definitions
Epp 4th ed. pp. 290–304 · 5th ed. (metric) pp. 325–340. Lecture 15 (week 6).
Problems
Define the sequence \(b_1 = 2\), \(b_2 = 6\) and
\[b_k = b_{k-1} + b_{k-2} + \gcd(b_{k-1}, b_{k-2})\]
for all \(k \geq 3\). Use strong induction to prove \(b_n\) is even for all \(n \geq 1\).
A sequence is defined by \(a_1 = 2\) and
\[a_k = k(a_{k-1} + k - 1)\]
for all integers \(k \geq 2\). Use mathematical induction to prove \(a_n\) is even for all \(n \geq 1\).
Recursively define the set \(S\) of binary strings as follows.
(Base rule) \(1 \in S\).
(Recursion rule) If \(s \in S\) then \(0s \in S\) and \(1s \in S\) (e.g. if \(s = 1\) then \(0s = 01\)).
(Restriction rule) No other strings lie in \(S\) besides those given by the rules above.
What are the strings contained in \(S\) arising from the first three applications of the recursive rule?
Solutions
Proof. Let \(P(n)\) be the predicate “\(b_n\) is even”.
Base case. The base cases are \(n = 1, 2\). We have \(b_1 = 2\) and \(b_2 = 6\) so \(P(1)\) and \(P(2)\) are true.
Inductive hypothesis. Assume \(P(m)\) is true for all integers \(m\) with \(1 \leq m \leq k\), where \(k \geq 2\) is an integer. That is, we assume \(b_1, b_2, \dots, b_k\) are all even.
Inductive step. We need to show that \(P(k+1)\) is true, i.e. \(b_{k+1}\) is even. Using the recursive definition, we have \[b_{k+1} = b_k + b_{k-1} + \gcd(b_k, b_{k-1}).\] By the inductive hypothesis, \(b_k\) and \(b_{k-1}\) are even, so \(2 \mid b_k\) and \(2 \mid b_{k-1}\), hence \(2 \mid \gcd(b_k, b_{k-1})\) as well. Therefore each term on the right-hand side is even, so their sum \(b_{k+1}\) is even. Thus \(P(k+1)\) holds.
Therefore, \(b_n\) is even for all integers \(n \geq 1\). \(\square\)
Proof. Let \(P(n)\) be the predicate “\(a_n\) is even”.
Base case. The base case is \(n = 1\). We have \(a_1 = 2\), which is even, so \(P(1)\) is true.
Inductive hypothesis. Assume \(P(k)\) is true for some integer \(k \geq 1\). That is, assume \(a_k\) is even.
Inductive step. We need to show that \(P(k+1)\) is true, i.e. \(a_{k+1}\) is even. By the recursive definition, we have \[a_{k+1} = (k+1)\big(a_k + (k+1) - 1\big) = (k+1)(a_k + k).\] Note that \(a_k\) is even by the inductive hypothesis. We split into cases:
- If \(k\) is even, then \(a_k + k\) is even, hence \(a_{k+1}\) is even.
- If \(k\) is odd, then \(k + 1\) is even, hence \(a_{k+1}\) is even.
In all cases, \(a_{k+1}\) is even, so \(P(k+1)\) is true.
Therefore, \(a_n\) is even for all integers \(n \geq 1\). \(\square\)
By the base rule, we only know \(1 \in S\).
First application of the recursive rule:
\[01 \in S, \qquad 11 \in S.\]
Second application of the recursive rule:
\[001 \in S, \quad 101 \in S, \quad 011 \in S, \quad 111 \in S.\]
Third application of the recursive rule:
\[0001 \in S, \quad 1001 \in S, \quad 0101 \in S, \quad 1101 \in S,\] \[0011 \in S, \quad 1011 \in S, \quad 0111 \in S, \quad 1111 \in S.\]
§20 — Solving Recurrence Relations
Epp 4th ed. pp. 304–328 · 5th ed. (metric) pp. 340–364. Lecture 16 (week 6).
Problems
Define a sequence \(a_n = 2^n + 5 \cdot 3^n\) for all integers \(n \geq 0\). Show that
\[a_n = 5a_{n-1} - 6a_{n-2}\]
for all integers \(n \geq 2\).
Let \(\{b_n\}_{n \geq 0}\) be the sequence defined by
\[b_0 = 2, \qquad b_1 = 5, \qquad \text{and} \qquad b_k = 2b_{k-1} - b_{k-2} \text{ for each integer } k \geq 2.\]
Write down the values of \(b_0, b_1, b_2, b_3, b_4, b_5\).
Based on your answers for part (a), guess an explicit formula for this sequence.
Prove that your guess from part (b) is correct.
Let \(T_n\) be a sequence defined by \(T_1 = 1\) and
\[T_{n+1} = 1 + (T_1 \times T_2 \times T_3 \times \cdots \times T_n)\]
for all \(n \geq 1\). Prove that \(T_{n+1} = (T_n)^2 - T_n + 1\) for all \(n \geq 2\).
Consider the Fibonacci sequence defined recursively by
\[\begin{aligned} a_0 &= 0 \\ a_1 &= 1 \\ a_n &= a_{n-2} + a_{n-1} \qquad \text{for all integers } n \geq 2. \end{aligned}\]
Use strong mathematical induction to prove the explicit formula
\[a_n = \frac{\phi^n - \psi^n}{\sqrt{5}}\]
for all integers \(n \geq 0\), where \(\phi = \frac{1+\sqrt{5}}{2}\) and \(\psi = \frac{1-\sqrt{5}}{2}\). (You may use the fact that \(\phi^2 = \phi + 1\) and \(\psi^2 = \psi + 1\).)
Solutions
Define a sequence \(a_n = 2^n + 5 \cdot 3^n\) for all integers \(n \geq 0\). Show that \(a_n = 5a_{n-1} - 6a_{n-2}\) for all integers \(n \geq 2\).
Proof. For \(n \geq 2\), we have \(n - 2 \geq 0\) so all three terms \(a_n\), \(a_{n-1}\) and \(a_{n-2}\) are defined in the given formula. Then, \[\begin{aligned} 5a_{n-1} - 6a_{n-2} &= 5\left(2^{n-1} + 5 \cdot 3^{n-1}\right) - 6\left(2^{n-2} + 5 \cdot 3^{n-2}\right) \\ &= \left(5 \cdot 2^{n-1} - 6 \cdot 2^{n-2}\right) + \left(25 \cdot 3^{n-1} - 30 \cdot 3^{n-2}\right) \\ &= (10 - 6)2^{n-2} + (75 - 30)3^{n-2} \\ &= 4 \cdot 2^{n-2} + 45 \cdot 3^{n-2} \\ &= 2^n + 5 \cdot 3^n \\ &= a_n. \end{aligned}\] Hence \(a_n = 5a_{n-1} - 6a_{n-2}\) for all integers \(n \geq 2\). \(\square\)
\[\begin{aligned} b_0 &= 2 \\ b_1 &= 5 \\ b_2 &= 2(5) - 2 = 8 \\ b_3 &= 2(8) - 5 = 11 \\ b_4 &= 2(11) - 8 = 14 \\ b_5 &= 2(14) - 11 = 17 \end{aligned}\]
Guess that \(b_n = 3n + 2\) for each integer \(n \geq 0\).
Proof. The guess gives \(b_0 = 3(0) + 2 = 2\) and \(b_1 = 3(1) + 2 = 5\) so it gives the correct initial conditions. Now we substitute the guess into the recurrence relation. The LHS of the recurrence relation is \(b_k = 3k + 2\). The RHS of the recurrence relation is \[\begin{aligned} 2b_{k-1} - b_{k-2} &= 2\big(3(k-1) + 2\big) - \big(3(k-2) + 2\big) \\ &= 2(3k - 1) - (3k - 4) \\ &= 6k - 2 - 3k + 4 \\ &= 3k + 2 \end{aligned}\] So the guess also satisfies the recurrence relation. Thus the guess is correct. \(\square\)
Alternative proof (by strong induction). Let \(P(n)\) be the predicate \(b_n = 3n + 2\).
Basis: \(b_0 = 2\) from the recursive definition and \(3(0) + 2 = 2\) so \(P(0)\) is true. \(b_1 = 5\) from the recursive definition and \(3(1) + 2 = 5\) so \(P(1)\) is true.
Inductive hypothesis: suppose \(k \geq 1\) is an integer and \(P(0), P(1), \dots, P(k)\) are true.
Now \[\begin{aligned} b_{k+1} &= 2b_k - b_{k-1} && \text{by the rec. rel. since } k+1 \geq 2 \\ &= 2(3k+2) - \big(3(k-1) + 2\big) && \text{since } P(k) \text{ and } P(k-1) \text{ are true} \\ &= 6k + 4 - (3k - 1) \\ &= 3k + 5 \\ &= 3(k+1) + 2 \end{aligned}\] So \(P(k+1)\) is true. Therefore, by the principle of (strong) mathematical induction, the guess is correct for this recursively defined sequence. \(\square\)
Let \(T_n\) be a sequence defined by \(T_1 = 1\) and \(T_{n+1} = 1 + (T_1 \times \cdots \times T_n)\) for all \(n \geq 1\). Prove that \(T_{n+1} = (T_n)^2 - T_n + 1\) for all \(n \geq 2\).
Proof. We can prove this simply by applying the recursive formula twice, once for \(T_{n+1}\) and once for \(T_n\): \[\begin{aligned} T_{n+1} &= 1 + (T_1 \cdot T_2 \cdot T_3 \cdots T_n) && \text{by the recursive definition} \\ &= 1 + T_n \cdot (T_1 \cdot T_2 \cdot T_3 \cdots T_{n-1}) \\ &= 1 + T_n \cdot (T_n - 1) && \text{since } T_n = 1 + (T_1 \cdots T_{n-1}) \text{ by rec. def.} \\ &= 1 + (T_n)^2 - T_n \\ &= (T_n)^2 - T_n + 1. \end{aligned}\] Note that both applications of the recursive definition are valid, since \(n - 1 \geq 1\). \(\square\)
Fibonacci explicit formula.
Proof. Let \(P(n)\) be the predicate \[a_n = \frac{\phi^n - \psi^n}{\sqrt{5}}.\]
Basis. The base cases are \(n = 0, 1\), which are true because \[\frac{\phi^0 - \psi^0}{\sqrt{5}} = \frac{1-1}{\sqrt{5}} = 0 = a_0,\] and \[\frac{\phi - \psi}{\sqrt{5}} = \frac{\frac{1+\sqrt{5}}{2} - \frac{1-\sqrt{5}}{2}}{\sqrt{5}} = \frac{\sqrt{5}}{\sqrt{5}} = 1 = a_1.\]
Inductive hypothesis. Now suppose that for some integer \(m \geq 1\), we have that \(P(i)\) is true for all \(0 \leq i \leq m\). In particular, \(P(m)\) and \(P(m-1)\) are true, that is, \[a_m = \frac{\phi^m - \psi^m}{\sqrt{5}} \qquad \text{and} \qquad a_{m-1} = \frac{\phi^{m-1} - \psi^{m-1}}{\sqrt{5}}.\]
We need to show that \(P(m+1)\) is true. That is, we aim to show \[a_{m+1} = \frac{\phi^{m+1} - \psi^{m+1}}{\sqrt{5}}.\]
Starting with the right-hand side of \(P(m+1)\), we have \[\begin{aligned} \frac{\phi^{m+1} - \psi^{m+1}}{\sqrt{5}} &= \frac{\phi^2 \phi^{m-1} - \psi^2 \psi^{m-1}}{\sqrt{5}} \\ &= \frac{(\phi+1)\phi^{m-1} - (\psi+1)\psi^{m-1}}{\sqrt{5}} && \text{since } \phi^2 = \phi+1 \text{ and } \psi^2 = \psi+1 \\ &= \frac{(\phi^m + \phi^{m-1}) - (\psi^m + \psi^{m-1})}{\sqrt{5}} \\ &= \frac{\phi^m - \psi^m}{\sqrt{5}} + \frac{\phi^{m-1} - \psi^{m-1}}{\sqrt{5}} \\ &= a_m + a_{m-1} && \text{by the inductive hypothesis} \\ &= a_{m+1} && \text{by definition.} \end{aligned}\] Hence \(P(m+1)\) is true. \(\square\)
§21 — Set Theory Definitions
Epp 4th ed. pp. 336–351 · 5th ed. (metric) pp. 377–391. Lecture 17 (week 6).
Problems
Define the sets
\[\begin{aligned} V &= \{x \in \mathbb{Z} \mid 2 \leqslant x \leqslant 11 \text{ and } x \text{ is odd}\}, \\ X &= \{x \in \mathbb{Z} \mid -1 \leqslant x \leqslant 4\}, \\ Y &= \{2, 3, 7, 9\}, \\ Z &= \{x \in \mathbb{Z} \mid x \neq 0\}. \end{aligned}\]
Write down the following sets, listing their elements and using brackets as appropriate.
\(V \cap X\). (b) \(V \cup Y\). (c) \(X \cap Z\).
\(X \cap (Z - Y)\). (e) \((X \cup Y) \cap V\). (f) \(X \cup (Y \cap V)\).
For each of the following sets, write down its elements and then state the size of the set; that is, find \(|A|\), \(|B|\), \(|C|\) and \(|D|\).
\(A = \{x \in \mathbb{Z} \mid \exists\, i \in \mathbb{Z} \text{ such that } x = 1 + (-1)^i\}\).
\(B = \{y \in \mathbb{Z} \mid -8 < y \leqslant -5\}\).
\(C = \{s \in \mathbb{Z} \mid s^2 + 1 = 0\}\).
\(D = \{t \in \mathbb{Z} \mid t^4 = 1\}\).
Define the sets \(A = \{0,1,2,3,4\}\), \(B = \{3,4,5,6\}\) and \(C = \{1,2,4,5,7\}\). List the elements of the set
\[R = \big((A - B) \cap (A - C)\big) \cup (B \cap C \cap A).\]
Are the following statements true or false? Justify in one or two sentences.
\(x \in \{x\}\) (b) \(\{x\} \subseteq \{x\}\) (c) \(\{\emptyset\} \in \{\{\emptyset\}\}\)
\(\emptyset \subseteq \{x\}\) (e) \(\emptyset \in \{x\}\)
Solutions
\(V \cap X = \{3\}\)
\(V \cup Y = \{2, 3, 5, 7, 9, 11\}\)
\(X \cap Z = \{-1, 1, 2, 3, 4\}\)
\(X \cap (Z - Y) = \{-1, 1, 4\}\)
\((X \cup Y) \cap V = \{3, 7, 9\}\)
\(X \cup (Y \cap V) = \{-1, 0, 1, 2, 3, 4, 7, 9\}\)
Note that \((-1)^i\) is either \(+1\) or \(-1\) (according as \(i\) is even or odd). So \(x\) is either \(1+1\) or \(1-1\), that is, 2 or 0. So \(A = \{2, 0\}\) and \(|A| = 2\).
\(B = \{-7, -6, -5\}\), so \(|B| = 3\).
If \(s^2 + 1 = 0\), we have \(s^2 = -1\), and there are no such real numbers \(s\), let alone integers! So \(C = \emptyset\) and \(|C| = 0\).
\(D = \{-1, 1\}\), since \(t^4 = 1\) with \(t \in \mathbb{Z}\) implies \(t = \pm 1\). Hence \(|D| = 2\).
We have \(A - B = \{0,1,2\}\) and \(A - C = \{0,3\}\), so \((A-B) \cap (A-C) = \{0\}\). Also \(B \cap C \cap A = \{4\}\). Thus \(R = \{0\} \cup \{4\} = \{0, 4\}\).
True: \(\{x\}\) is the set whose only element is \(x\), so \(x \in \{x\}\).
True: every set is a subset of itself, so \(\{x\} \subseteq \{x\}\).
True: \(\{\{\emptyset\}\}\) has the single element \(\{\emptyset\}\), so \(\{\emptyset\} \in \{\{\emptyset\}\}\).
True: \(\emptyset \subseteq S\) for every set \(S\), in particular \(\emptyset \subseteq \{x\}\).
False (in general): \(\emptyset \in \{x\}\) would require \(\emptyset = x\).
Application — Computer Representations of Sets
Not assessable for MATH1061. Taken from K. Rosen, Discrete Mathematics and its Applications, 7th edition, 1991, pages 134–138.
There are various ways to represent sets using a computer. One such method involves the use of binary strings.
If we fix a finite universal set \(U\) with an arbitrary ordering, for example \(U = \{a_1, a_2, \dots, a_n\}\), we can represent subsets of \(U\) using binary strings of length \(n\). A 1 in the \(i\)th position of the string indicates that element \(a_i\) is in the subset and a 0 indicates it is not.
For example if \(U = \{1,2,3\}\) then the string \(000\) represents the empty set, \(101\) represents the subset \(\{1,3\}\) and \(111\) represents the entire set \(U\).
The set operations union and intersection can be computed at the level of binary strings by utilising the bitwise OR and AND operations. The union of two sets corresponds to the bitwise OR operation on the strings and the intersection corresponds to bitwise AND.
Application problems
Define the universal set \(U = \{1,2,3,4,5,6,7,8,9,10\}\).
- Express each of the following subsets of \(U\) using binary strings:
\(\{3,4,5\}\)
\(\{1,3,6,10\}\)
\(\{a \in U \mid a \text{ is prime}\}\).
- Using the same \(U\), find the set represented by the following strings:
\(1111001111\)
\(0101111000\)
\(1000000001\)
- Use binary strings to compute the following set operations.
\(\{1,3,4,6,10\} \cap \{2,3,6,9,10\}\)
\(\{2,4,6,8\} \cup \{3,4,5\}\)
Application solutions
- \(0011100000\)
\(1010010001\)
\(0110101000\) — the primes in \(U\) are \(2, 3, 5, 7\). (The source PDF prints \(1010111000\) here, which decodes to \(\{1,3,5,6,7\}\) and is not the set of primes; the string above is the correct one.)
- \(\{1,2,3,4,7,8,9,10\}\)
\(\{2,4,5,6,7\}\)
\(\{1,10\}\)
- \(1011010001 \text{ AND } 0110010011 = 0010010001\), so the intersection is \(\{3,6,10\}\).
- \(0101010100 \text{ OR } 0011100000 = 0111110100\), so the union is \(\{2,3,4,5,6,8\}\).
§22 — More Definitions and Examples of Sets
Epp 4th ed. pp. 336–351 · 5th ed. (metric) pp. 377–391. Lecture 17 (week 6).
Problems
Let \(A = \{1,2\}\), \(B = \{2,3\}\) and \(C = \{3,4\}\). List the elements of the following sets.
\(A \cap C\)
\((A \cup C) - B\)
\((A \times B) \cap (A \times C)\)
\(\mathcal{P}(B \cap C)\)
\(\{x : (x \subseteq A) \wedge (x \in \mathcal{P}(B))\}\)
Are the following statements true or false?
\(\mathbb{Q} \in \mathbb{R}\).
\(\{1,2\} \subseteq \mathbb{Z}\).
\(\{-3, 0\} \subseteq \mathcal{P}(\mathbb{Z})\).
\(\{(1,2), (0,1)\} \in \mathbb{Z} \times \mathbb{Z}\).
Let \(X = \mathcal{P}(\emptyset)\) and \(Y = \mathcal{P}(\mathcal{P}(\emptyset))\). List the elements of each of the following sets.
- \(X\) (b) \(Y\) (c) \(X \cap Y\) (d) \(X \cup Y\)
Define sets \(S = \{3,5\}\) and \(T = \{2,3,7\}\). Are the following statements true or false?
\(S \subseteq T\)
\(\emptyset \in \mathcal{P}(S)\)
\(\emptyset \in T\)
\((3,3,3) \in S \times T\)
Solutions
\(A \cap C = \emptyset\).
\((A \cup C) - B = \{1, 4\}\).
\((A \times B) \cap (A \times C) = \{(1,3), (2,3)\}\).
\(\mathcal{P}(B \cap C) = \{\emptyset, \{3\}\}\).
\(\{x : (x \subseteq A) \wedge (x \in \mathcal{P}(B))\} = \{\emptyset, \{2\}\}\).
False. (\(\mathbb{Q}\) is a subset of \(\mathbb{R}\), not an element of it.)
True.
False. (The elements of \(\mathcal{P}(\mathbb{Z})\) are sets of integers; \(-3\) and \(0\) are integers, not sets.)
False. (It is a subset of \(\mathbb{Z} \times \mathbb{Z}\), not an element — the elements of \(\mathbb{Z} \times \mathbb{Z}\) are ordered pairs.)
\(X = \mathcal{P}(\emptyset) = \{\emptyset\}\).
\(Y = \mathcal{P}(\mathcal{P}(\emptyset)) = \{\emptyset, \{\emptyset\}\}\).
\(X \cap Y = \{\emptyset\}\).
\(X \cup Y = \{\emptyset, \{\emptyset\}\}\).
False. (\(5 \in S\) but \(5 \notin T\).)
True. (The empty set is an element of every power set.)
False. (\(T\)’s elements are \(2\), \(3\) and \(7\).)
False. (The elements of \(S \times T\) are ordered pairs, not triples.)
§23 — Properties of Sets
Epp 4th ed. pp. 352–366 · 5th ed. (metric) pp. 391–407. Lecture 18 (week 7).
Problems
- Use the element method to prove that for all sets \(A\) and \(B\)
\[A \cup (B - A) = A \cup B.\]
- Use the element method to prove that for all sets \(X\), \(Y\) and \(Z\),
\[(X - Z) \cap (Y - Z) \cap (X - Y) = \emptyset.\]
- Use set identities to prove that for all sets \(A\), \(B\) and \(C\)
\[(A - B) - C = A - (B \cup C).\]
Prove or disprove the following:
For all sets \(A\) and \(B\), we have \(\mathcal{P}(A \cup B) = \mathcal{P}(A) \cup \mathcal{P}(B)\).
For all sets \(A\) and \(B\), we have \(\mathcal{P}(A) = \mathcal{P}(B) \iff A = B\).
There exists a set \(A\) such that \(\mathcal{P}(A) = \{\{a\}, \{b\}, \{c\}, \{a,b\}, \{b,c\}, \{a,c\}, \{a,b,c\}\}\).
Let \(A\), \(B\) and \(C\) be sets. If \(B \subseteq C\) then \(A \times B \subseteq A \times C\).
Let \(A\), \(B\) and \(C\) be sets. Prove that
\[A - (B \cup C) = (A - B) - C.\]
Solutions
- For all sets \(A\) and \(B\), \(A \cup (B - A) = A \cup B\).
Proof. First we show that \(A \cup (B-A) \subseteq A \cup B\).
Consider an arbitrary element \(x \in A \cup (B-A)\). Then we know \(x \in A\) or \(x \in B - A\). This means \(x \in A\), or \(x \in B\) and \(x \notin A\). If \(x \in A\), then \(x \in A \cup B\). Similarly if \(x \in B - A\), then it must be in \(B\) and so \(x \in A \cup B\). In either case, we have \(x \in A \cup B\), thus \(A \cup (B-A) \subseteq A \cup B\).
Now we show that \(A \cup B \subseteq A \cup (B-A)\).
Let \(x \in A \cup B\), then \(x \in A\) or \(x \in B\) or it is in both \(A\) and \(B\). If \(x \in A\), then \(x \in A \cup (B-A)\). If \(x \notin A\) then \(x \in B\) since \(x \in A \cup B\). So we have that \(x \in B\) and \(x \notin A\), hence \(x \in B - A\) and thus \(x \in A \cup (B-A)\). This proves that \(A \cup B \subseteq A \cup (B-A)\), and together this proves that \(A \cup B = A \cup (B-A)\). \(\square\)
- For all sets \(X\), \(Y\) and \(Z\), \((X-Z) \cap (Y-Z) \cap (X-Y) = \emptyset\).
Proof. Assume that \((X-Z) \cap (Y-Z) \cap (X-Y) \neq \emptyset\).
So let \(x \in (X-Z) \cap (Y-Z) \cap (X-Y)\). Then, in particular, \(x \in Y - Z\) and \(x \in X - Y\). The former implies \(x \in Y\), but the latter implies \(x \notin Y\). No such \(x\) exists. Therefore the set is empty. \(\square\)
- For all sets \(A\), \(B\) and \(C\), \((A-B) - C = A - (B \cup C)\).
Proof. Using \(A - B = A \cap B^c\), \((S - T) = S \cap T^c\), and De Morgan’s law, we have \[(A-B) - C = (A \cap B^c) \cap C^c = A \cap (B^c \cap C^c) = A \cap (B \cup C)^c = A - (B \cup C). \qquad \square\]
- For all sets \(A\) and \(B\), \(\mathcal{P}(A \cup B) = \mathcal{P}(A) \cup \mathcal{P}(B)\). False. Counterexample: \(A = \{1\}\), \(B = \{2\}\). Then
\[\mathcal{P}(A \cup B) = \{\emptyset, \{1\}, \{2\}, \{1,2\}\} \neq \{\emptyset, \{1\}\} \cup \{\emptyset, \{2\}\} = \{\emptyset, \{1\}, \{2\}\}.\]
- For all sets \(A\) and \(B\), \(\mathcal{P}(A) = \mathcal{P}(B) \iff A = B\). True.
(\(\Longleftarrow\)) If \(A = B\) then clearly \(\mathcal{P}(A) = \mathcal{P}(B)\).
(\(\Longrightarrow\)) We next show that if \(\mathcal{P}(A) = \mathcal{P}(B)\), then \(A = B\). Suppose (for a contradiction) that \(\mathcal{P}(A) = \mathcal{P}(B)\) but \(A \neq B\). Then (without loss of generality), there exists an element \(x\) in \(A\) that is not in \(B\). Therefore, there is an element \(\{x\}\) in \(\mathcal{P}(A)\) that is not in \(\mathcal{P}(B)\). Therefore \(\mathcal{P}(A) \neq \mathcal{P}(B)\) — a contradiction. Thus, for all sets \(A\) and \(B\), if \(\mathcal{P}(A) = \mathcal{P}(B)\) then \(A = B\). \(\square\)
- There exists a set \(A\) such that \(\mathcal{P}(A) = \{\{a\}, \{b\}, \{c\}, \{a,b\}, \{b,c\}, \{a,c\}, \{a,b,c\}\}\). False.
No such set exists. The power set of any set must contain the empty set — that is, \(\emptyset \in \mathcal{P}(A)\), where \(A\) is any set. Also, the power set of any set of size \(n\) has cardinality \(2^n\). The power set above contains 7 elements, and there does not exist any integer \(n\) such that \(2^n = 7\).
- Let \(A\), \(B\) and \(C\) be sets. If \(B \subseteq C\) then \(A \times B \subseteq A \times C\). True.
First note that if \(A = \emptyset\) then \(A \times B = A \times C = \emptyset\) and the statement is true. Also, if \(B = \emptyset\) then \(A \times B = \emptyset\) and \(\emptyset \subseteq A \times C\) for any \(C\), so the statement is true.
Suppose \(A\), \(B\) and \(C\) are non-empty sets with \(B \subseteq C\). Thus if \(b \in B\), then \(b \in C\). Consider any element \((a,b) \in A \times B\), where \(a \in A\) and \(b \in B\). Since \(b \in B\), \(b \in C\). As such, \(a \in A\) and \(b \in C\) for all \(a\) or \(b\), so \((a,b) \in A \times C\). Therefore \(A \times B \subseteq A \times C\). \(\square\)
For all sets \(A\), \(B\) and \(C\), \(A - (B \cup C) = (A-B) - C\).
Proof Option 1. For any \(x\), we have \[x \in A - (B \cup C) \iff x \in A \wedge x \notin (B \cup C) \iff x \in A \wedge (x \notin B) \wedge (x \notin C).\] Also, we have \[x \in (A-B) - C \iff x \in (A-B) \wedge x \notin C \iff (x \in A \wedge x \notin B) \wedge x \notin C.\] The statements on the right-hand side are equivalent. Hence \(A - (B \cup C) = (A-B) - C\). \(\square\)
Proof Option 2. \[\begin{aligned} A - (B \cup C) &= A \cap (B \cup C)^c && \text{by the Set Difference Law} \\ &= A \cap (B^c \cap C^c) && \text{by De Morgan's law} \\ &= (A \cap B^c) \cap C^c && \text{by Associative law} \\ &= (A - B) \cap C^c && \text{by the Set Difference Law} \\ &= (A - B) - C && \text{by the Set Difference Law} \qquad \square \end{aligned}\]
§24 — Functions Defined on General Sets
Epp 4th ed. pp. 383–396 · 5th ed. (metric) pp. 425–439. Lecture 18 (week 7).
Problems
Consider the function \(f : \mathbb{R} \to \mathbb{R}\) defined by \(f(x) = x^2 - 1\).
What is the domain, codomain and range of \(f\)?
What is the image of \(\{x \in \mathbb{R} \mid -1 \leq x \leq 2\}\) under \(f\)?
What is the preimage of \(\{y \in \mathbb{R} \mid 0 \leq y \leq 3\}\) under \(f\)?
Let \(X = \{1,3,5\}\) and \(Y = \{s,t,u,v\}\) be sets. Define \(f : X \to Y\) by the arrow diagram
\[1 \mapsto v, \qquad 3 \mapsto s, \qquad 5 \mapsto v\]
(the elements \(t\) and \(u\) of \(Y\) receive no arrows).
Write the domain of \(f\) and the co-domain of \(f\).
Determine \(f(1)\), \(f(3)\), and \(f(5)\).
Determine the range of \(f\).
Is 3 an inverse image of \(s\)? Is 1 an inverse image of \(u\)?
What is the inverse image of \(s\)? of \(u\)? of \(v\)?
Represent \(f\) as a set of ordered pairs.
Let \(D\) be the set of all finite subsets of \(\mathbb{Z}^+\). Consider the function \(T : \mathbb{Z}^+ \to D\) defined by \(T(n) := \{d \mid d \in \mathbb{Z}^+ \text{ and } d \text{ divides } n\}\). Find the following:
- \(T(1)\) (b) \(T(15)\) (c) \(T(17)\) (d) \(T(5)\) (e) \(T(18)\) (f) \(T(21)\)
Let \(S\) be the set of all strings of \(a\)’s and \(b\)’s.
- Define the function \(f : S \to \mathbb{Z}\) by
\[f(s) = \begin{cases} \text{the number of } b\text{'s to the left of the left-most } a \text{ in } s, & \text{if } s \text{ contains an } a, \\ 0, & \text{if } s \text{ contains no } a\text{'s.} \end{cases}\]
Find \(f(aba)\), \(f(bbab)\), and \(f(b)\). What is the range of \(f\)?
- Define the function \(g : S \to S\) by
\[g(s) = \text{the string obtained by writing the characters of } s \text{ in reverse order.}\]
Find \(g(aba)\), \(g(bbab)\), and \(g(b)\). What is the range of \(g\)?
Solutions
The domain is \(\mathbb{R}\), the codomain is \(\mathbb{R}\), and the range is \([-1, \infty)\).
\(f\big(\{x \in \mathbb{R} \mid -1 \leq x \leq 2\}\big) = [-1, 3]\).
\(f^{-1}\big(\{y \in \mathbb{R} \mid 0 \leq y \leq 3\}\big) = \{x \in \mathbb{R} \mid 1 \leq x^2 \leq 4\} = [-2,-1] \cup [1,2]\).
The domain is \(X = \{1,3,5\}\) and the codomain is \(Y = \{s,t,u,v\}\).
\(f(1) = v\), \(f(3) = s\), \(f(5) = v\).
\(\operatorname{range}(f) = \{s, v\}\).
Yes, 3 is an inverse image of \(s\). No, 1 is not an inverse image of \(u\).
\(f^{-1}(s) = \{3\}\), \(f^{-1}(u) = \emptyset\), \(f^{-1}(v) = \{1, 5\}\).
\(f = \{(1,v), (3,s), (5,v)\}\).
\(T(1) = \{1\}\).
\(T(15) = \{1, 3, 5, 15\}\).
\(T(17) = \{1, 17\}\).
\(T(5) = \{1, 5\}\).
\(T(18) = \{1, 2, 3, 6, 9, 18\}\).
\(T(21) = \{1, 3, 7, 21\}\).
\(f(aba) = 0\), \(f(bbab) = 2\), \(f(b) = 0\), \(\operatorname{range}(f) = \mathbb{Z}^{\geq 0}\).
\(g(aba) = aba\), \(g(bbab) = babb\), \(g(b) = b\), \(\operatorname{range}(g) = S\).
§25 — one-to-one, Onto, and Inverse Functions
Epp 4th ed. pp. 397–416 · 5th ed. (metric) pp. 439–461. Lecture 19 (week 7).
Problems
Consider the function \(f : \mathbb{Z} \to \mathbb{Z}\) defined by \(f(n) = \left\lfloor \dfrac{1-6n}{3} \right\rfloor\).
Is \(f\) one-to-one?
Is \(f\) onto?
Is \(f\) bijective?
Prove or disprove that for all \(m, n \in \mathbb{Z}\), we have \(f(mn) = f(m)f(n)\).
Define the set \(A = \{0,1,2,3,4\}\) and the functions \(f : A \to A\) and \(g : A \to A\) by
\[f(a) = (a+4)^2 \pmod 5, \qquad g(a) = (a^2 + 3a + 1) \pmod 5.\]
Is \(f = g\)?
Consider the function \(f : \mathbb{Z}^+ \times \mathbb{Z}^+ \to \mathbb{Z}^+\) defined by \(f((m,n)) = 2^m 3^n\).
Determine \(f((3,1))\).
Determine the pre-image of \(\{36\}\).
Prove \(f\) is one-to-one.
Consider the function \(f : \mathbb{R} \to \mathbb{Z}\) defined by \(f(x) = \lfloor x^2 \rfloor\).
What is the image \(f([-1,1])\)?
What is the preimage \(f^{-1}(\{1\})\)?
Is \(f\) one-to-one?
Is \(f\) onto?
Is \(f\) bijective?
Solutions
First, we note that, for \(n \in \mathbb{Z}\),
\[f(n) = \left\lfloor \frac{1-6n}{3} \right\rfloor = \left\lfloor -2n + \frac{1}{3} \right\rfloor = -2n\]
since \(-2n \in \mathbb{Z}\) and \(\frac{1}{3} \in [0,1)\).
Yes. If \(f(m) = f(n)\) then \(-2m = -2n\), hence \(m = n\). Therefore \(f\) is one-to-one.
No. Since \(f(n) = -2n\) we see that \(f\) never maps to any odd integer; for example, there is no integer \(w\) with \(f(w) = 1\). Therefore \(f\) is not onto.
No, \(f\) is not a bijection. (It is injective but not surjective.)
This is false; take \(m = n = 1\). Then \(f(mn) = -2\) but \(f(m)f(n) = 4\).
Yes. First note \(f\) and \(g\) have the same domain and codomain. This means we just need to show \(f(a) = g(a)\) for all \(a \in A\). Notice that we have
\[(a+4)^2 = a^2 + 8a + 16 \equiv a^2 + 3a + 1 \pmod 5,\]
so \(f(a) = g(a)\) for all \(a \in A\), and hence \(f = g\).
\(f((3,1)) = 2^3 3^1 = 24\).
\(36 = 2^2 3^2\), so \(f((m,n)) = 36\) if and only if \((m,n) = (2,2)\). Hence \(f^{-1}(\{36\}) = \{(2,2)\}\).
If \(f((m,n)) = f((m',n'))\), then \(2^m 3^n = 2^{m'} 3^{n'}\), so \(2^{m-m'} = 3^{n'-n}\). By unique prime factorisation, this forces \(m - m' = 0\) and \(n' - n = 0\). That is, \(m = m'\) and \(n = n'\), and hence \((m,n) = (m',n')\). So \(f\) is one-to-one.
Note that if \(x \in [-1,1]\) then \(x^2 \in [0,1]\). This means we have \(\lfloor x^2 \rfloor \in \{0,1\}\). Both values occur because \(\lfloor 0^2 \rfloor = 0\) and \(\lfloor 1^2 \rfloor = 1\). Thus \(f([-1,1]) = \{0,1\}\).
\(f^{-1}(\{1\}) = \{x \in \mathbb{R} : 1 \leq x^2 < 2\} = (-\sqrt{2}, -1] \cup [1, \sqrt{2})\).
No, \(f\) is not one-to-one. For example, \(f\!\left(\frac{1}{2}\right) = 0 = f\!\left(-\frac{1}{2}\right)\) but \(\frac{1}{2} \neq -\frac{1}{2}\).
No, \(f\) is not onto since \(f(x) = \lfloor x^2 \rfloor \geq 0\) for all \(x\). This means, for instance, that \(-1\) is not in the image of \(f\).
No, \(f\) is not bijective.
§26 — Composition of Functions
Epp 4th ed. pp. 416–427 · 5th ed. (metric) pp. 461–472. Lecture 20 (week 7).
Problems
Let \(f, g : \mathbb{Z} \to \mathbb{Z}\) be defined by \(f(x) = x^3 - 1\) and \(g(x) = x + 5\).
Determine the functions \((g \circ f)(x)\) and \((f \circ g)(x)\).
Is \(g \circ f\) a bijection?
Define \(f : \mathbb{Q} \to \mathbb{Z}\) by \(f(x) = 2\lfloor x + 1 \rfloor\).
What is the range of \(f\)?
Is \(f\) one-to-one?
Is \(f\) onto?
Define \(g : \mathbb{Z} \to \mathbb{Z}\) by \(g(x) = 2x - 1\). Determine the composition \((g \circ f)(x)\).
Calculate \((g \circ f)\left(-\frac{3}{4}\right)\).
What is the range of \(g \circ f\)?
Let \(f\) and \(g\) be functions. Prove or disprove the following statements:
If \(f\) and \(f \circ g\) are one-to-one, then \(g\) is one-to-one.
If \(f\) and \(f \circ g\) are onto, then \(g\) is onto.
Solutions
- We have
\[(g \circ f)(x) = g(x^3 - 1) = x^3 + 4\]
and
\[(f \circ g)(x) = f(x+5) = (x+5)^3 - 1 = x^3 + 15x^2 + 75x + 124.\]
- No, \(g \circ f\) is not a bijection. The map \(x \mapsto x^3 + 4\) is one-to-one on \(\mathbb{Z}\), but it is not onto (e.g. 0 is not in its image since \(x^3 = -4\) has no integer solution).
The range is a subset of the even integers because \(\lfloor x+1 \rfloor \in \mathbb{Z}\). If \(2m\) is an even integer then \(f(m-1) = 2\lfloor m-1+1 \rfloor = 2m\), so the range is the set of all even integers.
No, \(f\) is not one-to-one. For example,
\[f(0) = 2\lfloor 0+1 \rfloor = 2\lfloor 1 \rfloor = 2 \times 1 = 2, \quad \text{and}\] \[f\!\left(\tfrac{1}{2}\right) = 2\left\lfloor \tfrac{1}{2} + 1 \right\rfloor = 2\left\lfloor \tfrac{3}{2} \right\rfloor = 2 \times 1 = 2,\]
but \(0 \neq \frac{1}{2}\).
No, \(f\) is not onto since \(\operatorname{range}(f) \neq \mathbb{Z}\) (e.g. there is no \(x \in \mathbb{Q}\) such that \(f(x) = 1\) because 1 is odd).
We have
\[(g \circ f)(x) = g(f(x)) = 2\big(2\lfloor x+1 \rfloor\big) - 1 = 4\lfloor x+1 \rfloor - 1.\]
- We have
\[(g \circ f)\left(-\frac{3}{4}\right) = 4 \cdot 0 - 1 = -1.\]
- The range is a subset of \(\{4n - 1 \mid n \in \mathbb{Z}\}\) because \(\lfloor x+1 \rfloor \in \mathbb{Z}\). This is the range because, given an integer \(4n-1\), we have \(f(n-1) = 4\lfloor n-1+1 \rfloor - 1 = 4n-1\). Note that you can also write the range as \(\{n \in \mathbb{Z} \mid n \equiv -1 \pmod 4\}\) which is the same as \(\{n \in \mathbb{Z} \mid n \equiv 3 \pmod 4\}\).
- The statement is true.
Proof. Suppose that \(f\) and \(f \circ g\) are one-to-one functions. Suppose for a contradiction that \(g\) is not one-to-one. Thus there exist two distinct elements in the domain of \(g\), say \(x_1\) and \(x_2\), for which \(g(x_1) = g(x_2)\). Let \(g(x_1) = y = g(x_2)\). Thus \(f(g(x_1)) = f(y) = f(g(x_2))\), but \(x_1 \neq x_2\), which contradicts the fact that \(f \circ g\) is one-to-one. Therefore \(g\) must be one-to-one. \(\square\)
- The statement is false.
Counterexample. Consider the functions \(g : \{1\} \to \{2,3\}\) defined by \(g(1) = 2\), and \(f : \{2,3\} \to \{4\}\) defined by \(f(2) = 4\) and \(f(3) = 4\). Then \(f\) is onto, and \(f \circ g\) is onto (since \(f \circ g : \{1\} \to \{4\}\) and \(f(g(1)) = 4\)). However, \(g\) is not onto. \(\square\)
§27 — Cardinalities
Epp 4th ed. pp. 428–441 · 5th ed. (metric) pp. 473–486. Lecture 21 (week 8).
Problems
Let \(A = \{-2,-1,0,1\}\) and \(B = \{3,4,5,6\}\). Prove that \(|A| = |B|\) by providing a bijection between \(A\) and \(B\).
Prove that \(|\{1,2,3\}| \leq |\mathbb{Z}|\) by providing an appropriate injective (one-to-one) function.
Consider the intervals
\[[6,12] = \{x \in \mathbb{R} \mid 6 \leq x \leq 12\} \quad \text{and} \quad (6,12) = \{x \in \mathbb{R} \mid 6 < x < 12\}.\]
Prove that \(|[6,12]| \leq |(6,12)|\) by providing an appropriate injective (one-to-one) function.
Let \(A = \{x \in \mathbb{R} \mid -1 \leq x \leq 1\}\) and \(B = \{x \in \mathbb{R} \mid 3 \leq x \leq 7\}\). Prove that \(|A| = |B|\) by providing a bijection between \(A\) and \(B\).
Solutions
Define the function \(f : A \to B\) by
\[f(-2) = 3, \qquad f(-1) = 4, \qquad f(0) = 5, \qquad f(1) = 6.\]
Then \(f\) is bijective, hence \(|A| = |B|\).
Define the function \(g : \{1,2,3\} \to \mathbb{Z}\) by \(g(1) = 1\), \(g(2) = 2\), and \(g(3) = 3\). Then \(g\) is injective (one-to-one), so \(|\{1,2,3\}| \leq |\mathbb{Z}|\).
Define \(h : [6,12] \to (6,12)\) by
\[h(x) = \frac{x}{2} + 4.\]
For each \(x \in [6,12]\) we have
\[\begin{aligned} \frac{6}{2} + 4 \leq\ &h(x) \leq \frac{12}{2} + 4 \\ 7 \leq\ &h(x) \leq 10. \end{aligned}\]
Thus \(h\) is indeed a function from \([6,12]\) to \((6,12)\), and \(h\) has range \([7,10] \subseteq (6,12)\).
Suppose \(x, y \in [6,12]\) and \(h(x) = h(y)\). Then \(\frac{x}{2} + 4 = \frac{y}{2} + 4\), so \(x = y\). Therefore \(h\) is injective (one-to-one).
Thus \(|[6,12]| \leq |(6,12)|\).
Let \(A = \{x \in \mathbb{R} \mid -1 \leq x \leq 1\}\) and \(B = \{x \in \mathbb{R} \mid 3 \leq x \leq 7\}\).
Consider the function \(f : A \to B\) where \(f(x) = 2x + 5\). Since \(x \geq -1\), \(f(x) = 2x+5 \geq 2(-1)+5 = 3\), and since \(x \leq 1\), \(f(x) = 2x+5 \leq 2(1)+5 = 7\). Also each value of \(x\) gives a unique value of \(2x+5\). Thus \(f\) is a function with the correct domain and codomain.
We now prove that \(f\) is one-to-one. Suppose that \(x_1, x_2 \in A\) and \(f(x_1) = f(x_2)\). Thus \(2x_1 + 5 = 2x_2 + 5\), and so \(x_1 = x_2\). Thus \(f\) is one-to-one.
We now prove that \(f\) is onto. Suppose \(y \in [3,7]\). Let \(x = \frac{y-5}{2}\). Since \(y \leq 7\), we have \(x \leq 1\) and since \(y \geq 3\), we have \(x \geq -1\). So \(x \in [-1,1]\). Furthermore \(f(x) = f\!\left(\frac{y-5}{2}\right) = 2\left(\frac{y-5}{2}\right) + 5 = y - 5 + 5 = y\). Thus \(f\) is onto.
Hence \(f\) is a bijection and so \(|A| = |B|\).
§28 — Countable and Uncountable Sets
Epp 4th ed. pp. 428–441 · 5th ed. (metric) pp. 473–486. Lecture 22 (week 8).
Note that this content will not be assessed in MATH1061.
Problems
Determine whether each of the following sets is countable or uncountable.
\(\{1, 2, \dots, n\}\).
\(\mathbb{Z} \times \mathbb{Z}\).
\(\mathbb{Q} \times \mathbb{Q}\).
\(\mathbb{Z} \times \mathbb{Z} \times \cdots\) (infinitely many copies of \(\mathbb{Z}\)).
Is \(|\mathbb{Z}| = |\mathbb{Q}|\)?
Is \(|\mathbb{Z}| = |\mathbb{Z} \times \mathbb{Z}|\)?
Is \(|\mathbb{R}| = |\mathbb{Q} \times \mathbb{Q}|\)?
Show that the union of a countable number of countable sets is countable.
Show that the set of all finite binary strings is countable.
Use (a) to show that the set of all irrational numbers is uncountable.
Solutions
The set is countable because the function \(f : \{1,2,\dots,n\} \to \mathbb{N}\) defined by \(f(i) = i\) is injective.
The set \(\mathbb{Z} \times \mathbb{Z}\) is countable. Define the function \(f : \mathbb{Z} \times \mathbb{Z} \to \mathbb{N}\) by
\[f(a,b) = \begin{cases} 2^a 3^b, & a > 0,\ b > 0, \\ 5^{-a} 7^{-b}, & a < 0,\ b < 0, \\ 11^{a} 13^{-b}, & a > 0,\ b < 0, \\ 17^{-a} 19^{b}, & a < 0,\ b > 0, \\ 23^{b}, & a = 0,\ b > 0, \\ 29^{a}, & a > 0,\ b = 0, \\ 31^{-b}, & a = 0,\ b < 0, \\ 37^{-a}, & a < 0,\ b = 0, \\ 1, & (a,b) = (0,0). \end{cases}\]
We claim \(f\) is injective. Suppose \(f(a,b) = f(c,d)\). By unique prime factorisation, the set of primes dividing \(f(a,b)\) and the set of primes dividing \(f(c,d)\) must be equal. Hence \((a,b)\) and \((c,d)\) lie in the same case. Again, by unique prime factorisation, the corresponding exponents must agree, so \(a = c\) and \(b = d\). Therefore \(f\) is injective.
- The set \(\mathbb{Q} \times \mathbb{Q}\) is countable. First define an injection \(e : \mathbb{Z} \to \mathbb{N}\) by
\[e(z) = \begin{cases} 2z, & z \geq 0, \\ -2z - 1, & z < 0. \end{cases}\]
Next define an injection \(c : \mathbb{N} \times \mathbb{N} \to \mathbb{N}\) by
\[c(m,n) = 2^m 3^n.\]
Write each rational in lowest terms with positive denominator: \(x = \frac{p}{q}\), \(y = \frac{r}{s}\) with \(p, r \in \mathbb{Z}\) and \(q, s \in \mathbb{N}\). Define \(F : \mathbb{Q} \times \mathbb{Q} \to \mathbb{N}\) by
\[F\left(\frac{p}{q}, \frac{r}{s}\right) = 2^{\,c(e(p),\,q)}\, 3^{\,c(e(r),\,s)}.\]
If \(F\left(\frac{p}{q}, \frac{r}{s}\right) = F\left(\frac{p'}{q'}, \frac{r'}{s'}\right)\), then by unique prime factorisation we get \(c(e(p),q) = c(e(p'),q')\) and \(c(e(r),s) = c(e(r'),s')\). Since \(c\) is injective, we have \(e(p) = e(p')\), \(q = q'\), \(e(r) = e(r')\), \(s = s'\). Moreover, since \(e\) is injective, we have \(p = p'\) and \(r = r'\). Therefore \(\frac{p}{q} = \frac{p'}{q'}\) and \(\frac{r}{s} = \frac{r'}{s'}\), so \(F\) is injective.
- The set \(\mathbb{Z} \times \mathbb{Z} \times \dots\) is not countable. We will prove this by giving an injection \(\mathbb{R} \to \mathbb{Z} \times \mathbb{Z} \times \cdots\).
For each \(x \in \mathbb{R}\), write \(x = n + r\) with \(n = \lfloor x \rfloor \in \mathbb{Z}\) and \(r \in [0,1)\). Choose the unique decimal expansion of \(r\) that does not end with an infinite tail of 9’s. Write this decimal expansion as
\[r = 0.d_1 d_2 d_3 \cdots, \qquad d_k \in \{0,1,\dots,9\}.\]
Then define the function \(\iota : \mathbb{R} \to \mathbb{Z} \times \mathbb{Z} \times \cdots\) by
\[\iota(x) = (n, d_1, d_2, d_3, \dots) \in \mathbb{Z} \times \mathbb{Z} \times \cdots.\]
This is injective; if \(\iota(x) = \iota(y)\) then the decimals of \(x\) and \(y\) are equal, so \(x = y\).
Yes. Both \(\mathbb{Z}\) and \(\mathbb{Q}\) are countable and infinite.
Yes. Both \(\mathbb{Z}\) and \(\mathbb{Z} \times \mathbb{Z}\) are countable and infinite.
No. \(\mathbb{Q} \times \mathbb{Q}\) is countable, while \(\mathbb{R}\) is uncountable.
- Let \(A_1, A_2, A_3, \dots\) be countable. Then for each \(n\) we can list \(A_n\) as
\[A_n = \{a_{n,1}, a_{n,2}, a_{n,3}, \dots\}.\]
Now list the union by going along diagonals:
\[a_{1,1};\ a_{1,2}, a_{2,1};\ a_{1,3}, a_{2,2}, a_{3,1};\ a_{1,4}, a_{2,3}, a_{3,2}, a_{4,1};\ \dots\]
Every element of every \(A_n\) appears somewhere in this list, so \(\bigcup_{n=1}^{\infty} A_n\) can be listed in a sequence. Hence \(\bigcup_{n=1}^{\infty} A_n\) is countable.
- Let \(B_n\) be the set of all binary strings of length \(n\). Each \(B_n\) is finite (there are \(2^n\) such strings), hence countable. Every finite binary string has some length, so
\[B = \{\text{all finite binary strings}\} = \bigcup_{n=0}^{\infty} B_n.\]
By (a), a countable union of countable sets is countable, so \(B\) is countable.
- Suppose, for contradiction, that the set of irrationals \(\mathbb{R} \setminus \mathbb{Q}\) were countable. We already know \(\mathbb{Q}\) is countable. Then by part (a),
\[\mathbb{R} = \mathbb{Q} \cup (\mathbb{R} \setminus \mathbb{Q})\]
would be a union of two countable sets, hence countable. But \(\mathbb{R}\) is uncountable. This contradiction shows that \(\mathbb{R} \setminus \mathbb{Q}\) is uncountable.
Application — Computability of Functions
Not assessable for MATH1061. Taken from K. Rosen, Discrete Mathematics and its Applications, 7th edition, 1991, pages 170–177.
An important application of the topic of countability to computer science is examining the computability of functions. In computer science, a function is computable if there is a computer program in some programming language that can find the values of the function. If there is no such program, we say the function is uncomputable.
Application problems
- Show the set of all computer programs in any given computer language is countable.
Hint: a computer program written in a programming language can be thought of as a string of symbols from a finite alphabet.
- Let \(T\) be the set of all functions from \(\mathbb{Z}^+\) to the set \(\{0,1,2,3,4,5,6,7,8,9\}\). Show that \(T\) is uncountable.
Hint: start by finding an injection between the interval \((0,1)\) and a subset of \(T\).
- Hence show that there are uncomputable functions.
Application solutions
- Given a computer language with a finite alphabet \(A\), we let \(P\) be the set of all computer programs in the language. If \(P\) is finite, then it is countable and we are done, so assume \(P\) is infinite.
Now we use the fact that we can think of each computer program as a series of strings made using the alphabet \(A\). Consider all strings of length \(m\) made from alphabet \(A\), and denote this set by \(A_m\). It is easy to show that there are \(|A|^m\) distinct strings of this type, and since \(A\) is finite, \(|A|^m\) is also finite. Now \(P\) is a subset of \(\bigcup_{i=1}^{\infty} A_m\). Since the union of a countable number of countable sets is also countable (see Question 3(a) from earlier in this section) it follows that \(\bigcup_{i=1}^{\infty} A_m\) is countable and hence \(P\) is countable.
- We use the hint and start by defining a function from \((0,1)\) to \(T\) as follows. Recall that every real number in the interval \((0,1)\) can be written in decimal notation as \(0.a_1 a_2 a_3 \dots a_n \dots\) where each \(a_i\) is an integer from 0 to 9. Also recall that \(T\) is the set of all functions from \(\mathbb{Z}^+\) to \(\{0,1,\dots,9\}\). Let \(f : (0,1) \to T\) be the function defined as
\[f(0.a_1 a_2 a_3 \dots a_n \dots) = g,\]
where \(g\) is the function in \(T\) such that \(g(n) = a_n\) for all \(n \in \mathbb{Z}^+\).
So for example, if \(f(0.457013) = g\) then \(g\) is the function where \(g(1) = 4\), \(g(2) = 5\), \(g(3) = 7\), \(g(4) = 0\), \(g(5) = 1\), \(g(6) = 3\) and \(g(n) = 0\) for all \(n \geq 7\).
Now we will prove that this function is one-to-one. Suppose that \(f(x_1) = f(x_2)\) for \(x_1, x_2 \in (0,1)\). Then for these functions to be equal, they map every integer to the same value. For this to happen, every decimal digit of \(x_1\) must be equal to the same decimal digit of \(x_2\) and so we must have \(x_1 = x_2\).
Now denote the set of all outputs of \(f\) as \(S\). Hence \(S \subseteq T\). Now if we set the codomain of \(f\) to be \(S\), which is the range of \(f\), we have made this function surjective and hence a bijection. This means that the subset \(S \subseteq T\) is in bijection with the interval \((0,1)\). Since the interval \((0,1)\) is uncountable, we must have that \(S\) is also uncountable and since \(S \subseteq T\), \(T\) must also be uncountable.
- Part (a) showed us that the set of all computer programs in a given language is countable. This means that there are a countable number of computable functions. However part (b) showed us that there is an uncountable number of functions in the set \(T\), so we must have that some functions are uncomputable.
§29 — Relations on Sets
Epp 4th ed. pp. 442–449 · 5th ed. (metric) pp. 487–494. Lecture 23 (week 8).
Problems
Define a relation \(P\) on \(\mathbb{Z}\) as follows: for every ordered pair \((m,n) \in \mathbb{Z} \times \mathbb{Z}\),
\[m \mathrel{P} n \iff m \text{ and } n \text{ have a common prime factor.}\]
Is \(15 \mathrel{P} 25\)?
Is \(22 \mathrel{P} 27\)?
Is \(0 \mathrel{P} 5\)?
Is \(8 \mathrel{P} 8\)?
Let \(X = \{a,b,c\}\). Define a relation \(S\) on the power set \(\mathcal{P}(X)\) as follows: for all sets \(A\) and \(B\) in \(\mathcal{P}(X)\),
\[A \mathrel{S} B \iff A \text{ has the same number of elements as } B.\]
Is \(\{a,b\} \mathrel{S} \{b,c\}\)?
Is \(\{a\} \mathrel{S} \{a,b\}\)?
Is \(\{c\} \mathrel{S} \{b\}\)?
Let \(A = \{3,4,5\}\) and \(B = \{4,5,6\}\) be sets. Let \(R\) be the ‘divides’ relation. That is, for every ordered pair \((a,b)\) in \(A \times B\), we have \(a \mathrel{R} b\) if and only if \(a \mid b\). Draw an arrow diagram (i.e. the directed graph) of this relation.
Solutions
Yes, since \(15 = 3 \cdot 5\) and \(25 = 5 \cdot 5\) share the prime factor 5.
No, since \(22 = 2 \cdot 11\) and \(27 = 3^3\) share no common prime factor.
Yes, since 0 is divisible by every prime; in particular \(5 \mid 0\) and \(5 \mid 5\), so 0 and 5 have a common prime factor.
Yes, since \(8 = 2^3\) and 2 is a prime factor of 8 (so they share the prime factor 2).
Yes, since \(|\{a,b\}| = 2 = |\{b,c\}|\).
No, since \(|\{a\}| = 1 \neq 2 = |\{a,b\}|\).
Yes, since \(|\{c\}| = 1 = |\{b\}|\).
We have \(A \times B = \{(3,4), (3,5), (3,6), (4,4), (4,5), (4,6), (5,4), (5,5), (5,6)\}\). The pairs \((a,b)\) satisfying \(a \mid b\) are
\[\{(3,6),\ (4,4),\ (5,5)\} \subseteq A \times B.\]
So the directed graph has an arrow from 3 (in \(A\)) to 6 (in \(B\)), an arrow from 4 to 4, and an arrow from 5 to 5 — and no other arrows.
§30 — Reflexivity, Symmetry, Transitivity
Epp 4th ed. pp. 449–459 · 5th ed. (metric) pp. 495–505. Lecture 23 (week 8).
Problems
Let \(X = \{1,2,3,4,5\}\) and consider the subset \(R \subseteq X \times X\) given by
\[R = \{(1,1), (2,2), (3,3), (4,4), (5,5), (1,2), (2,3), (3,4), (4,5), (5,1)\}.\]
Draw an arrow diagram for the binary relation \(R\).
Draw an arrow diagram for the binary relation \(R^{-1}\).
Draw an arrow diagram for the binary relation \(R \cup R^{-1}\).
Is \(R\) symmetric? Is \(R^{-1}\) symmetric? Is \(R \cup R^{-1}\) symmetric?
Is \(R\) transitive? Is \(R^{-1}\) transitive? Is \(R \cup R^{-1}\) transitive?
Suppose \(R\) is a binary relation on the set \(\{1,2,3\}\) such that:
- \((1,2) \in R\)
- \((2,3) \in R\)
- \(R\) is reflexive
- \(R\) is transitive
What is the minimum number of arrows required in an arrow diagram for a relation \(R\) that satisfies these criteria?
Solutions
- The arrow diagram for \(R\) has the five vertices \(1, 2, 3, 4, 5\) drawn around a circle, with a loop at every vertex (from the pairs \((1,1), \dots, (5,5)\)) together with the directed 5-cycle
\[1 \to 2 \to 3 \to 4 \to 5 \to 1.\]
- The arrow diagram for \(R^{-1}\) is the same picture with every non-loop arrow reversed: a loop at every vertex, together with the directed 5-cycle
\[1 \to 5 \to 4 \to 3 \to 2 \to 1,\]
that is, \(R^{-1} = \{(1,1), (2,2), (3,3), (4,4), (5,5), (2,1), (3,2), (4,3), (5,4), (1,5)\}\).
The arrow diagram for \(R \cup R^{-1}\) has a loop at every vertex and a double-headed arrow between each consecutive pair around the cycle — that is, both \((i, i+1)\) and \((i+1, i)\) for the cycle \(1,2,3,4,5,1\).
\(R\) is not symmetric because \((1,2) \in R\) but \((2,1) \notin R\).
\(R^{-1}\) is not symmetric because \((2,1) \in R^{-1}\) but \((1,2) \notin R^{-1}\).
\(R \cup R^{-1}\) is symmetric. If \((a,b) \in R \cup R^{-1}\) then \((a,b) \in R\) or \((a,b) \in R^{-1}\), which means \((b,a) \in R^{-1}\) or \((b,a) \in R\), and thus, in either case, \((b,a) \in R \cup R^{-1}\).
- \(R\) is not transitive because \((1,2), (2,3) \in R\) but \((1,3) \notin R\).
\(R^{-1}\) is not transitive because \((3,2), (2,1) \in R^{-1}\) but \((3,1) \notin R^{-1}\).
\(R \cup R^{-1}\) is not transitive because \((1,2), (2,3) \in R \cup R^{-1}\) but \((1,3) \notin R \cup R^{-1}\).
\(R\) is reflexive, so \((1,1), (2,2), (3,3) \in R\) — a loop on each point of the arrow diagram. We are also given \((1,2), (2,3) \in R\), and \(R\) is transitive, so \((1,3) \in R\). \(R\) is not required to be symmetric, so no further arrows are forced.
\[R = \{(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)\}\]
So the minimum number of arrows required is 6.
§31 — Equivalence Relations
Epp 4th ed. pp. 459–478 · 5th ed. (metric) pp. 505–523. Lecture 24 (week 9).
Problems
Define the binary relations \(\alpha\), \(\beta\) and \(\gamma\) on \(\mathbb{Z}\) as follows:
\[\begin{aligned} x \mathrel{\alpha} y &\iff x + y \text{ is an even integer}, \\ x \mathrel{\beta} y &\iff x \text{ is a multiple of } y, \\ x \mathrel{\gamma} y &\iff 3 \text{ is a factor of } x^2 - y^2. \end{aligned}\]
- Fill in the table with ‘Yes’/‘No’ to indicate the properties satisfied by each relation.
\(\alpha\) \(\beta\) \(\gamma\) Reflexive Symmetric Transitive Equivalence relation - For each equivalence relation, state its equivalence classes.
Let \(A = \{a,b,c,d,e\}\) be a set and \(\rho\) be a binary relation defined by
\[\rho = \{(a,a), (a,b), (a,d), (b,b), (c,c), (d,d), (b,a), (d,a), (b,d), (d,b), (c,e), (e,c), (e,e)\}.\]
For instance, \((a,b) \in \rho\) means \(a \mathrel{\rho} b\).
Draw the directed graph representing \(\rho\).
Is \(\rho\) reflexive? Is \(\rho\) symmetric? Is \(\rho\) transitive?
Is \(\rho\) an equivalence relation on \(A\)? If so, give its equivalence classes.
What is the smallest subset \(\tau\) of \(\rho\) which forms an equivalence relation on \(A\)?
Give the equivalence classes for \(\tau\).
Consider a positive integer \(n\) and any set of strings \(S\). Define a relation \(R_n\) on \(S\) by the condition \(s \mathrel{R_n} t\) if and only if \(s = t\) or both \(s\) and \(t\) have at least \(n\) characters and the first \(n\) characters are the same. Show that \(R_n\) is an equivalence relation.
Solutions
\(\alpha\) \(\beta\) \(\gamma\) Reflexive Yes Yes Yes Symmetric Yes No Yes Transitive Yes Yes Yes Equivalence relation Yes No Yes - The equivalence relations are \(\alpha\) and \(\gamma\).
For \(\alpha\), notice \(x \mathrel{\alpha} y \iff x + y\) is even \(\iff x\) and \(y\) have the same parity. This means the equivalence classes are \(\mathbb{Z}^{\text{even}}\) and \(\mathbb{Z}^{\text{odd}}\).
For \(\gamma\), notice \(x \mathrel{\gamma} y \iff 3 \mid (x^2 - y^2) \iff x^2 \equiv y^2 \pmod 3\). But modulo 3 the only possible square residues are
\[0^2 \equiv 0, \qquad 1^2 \equiv 1, \qquad 2^2 \equiv 1 \pmod 3.\]
Hence \(x^2 \equiv 0 \pmod 3\) exactly when \(3 \mid x\), and \(x^2 \equiv 1 \pmod 3\) exactly when \(3 \nmid x\). Therefore \(x \mathrel{\gamma} y\) iff either both \(x\) and \(y\) are multiples of 3, or neither is. So the equivalence classes are \(\{n \in \mathbb{Z} : 3 \mid n\}\) and \(\{n \in \mathbb{Z} : 3 \nmid n\}\). Note that another way to write the equivalence classes is \(\{3n \mid n \in \mathbb{Z}\}\) and \(\{3n+1,\ 3n+2 \mid n \in \mathbb{Z}\}\).
A digraph for \(\rho\) (vertex set \(A = \{a,b,c,d,e\}\)) has a loop at every vertex, double-headed arrows between each pair of \(\{a,b,d\}\) — that is between \(a\) and \(b\), between \(a\) and \(d\), and between \(b\) and \(d\) — and a double-headed arrow between \(c\) and \(e\). There are no arrows between \(\{a,b,d\}\) and \(\{c,e\}\).
\(\rho\) is reflexive: we have \((x,x) \in \rho\) for all \(x \in A\) (loops on all vertices).
\(\rho\) is symmetric: whenever \((x,y) \in \rho\), we have \((y,x) \in \rho\) (no single-direction arrow between any two distinct vertices).
\(\rho\) is transitive: within \(\{a,b,d\}\) all relations occur, within \(\{c,e\}\) all relations occur, and there are no relations between \(\{a,b,d\}\) and \(\{c,e\}\). That is, whenever \((x,y)\) and \((y,z)\) are in \(\rho\), then \((x,z)\) is also in \(\rho\) (and \(x = z\) is possible).
- Yes, \(\rho\) is an equivalence relation. Its equivalence classes are
\[[a] = [b] = [d] = \{a,b,d\}, \qquad [c] = [e] = \{c,e\}.\]
- An equivalence relation \(\tau \subseteq \rho\) must be reflexive, so \((x,x) \in \tau\) for all \(x \in A\). But notice if \(\tau\) is the relation
\[\tau = \{(a,a), (b,b), (c,c), (d,d), (e,e)\}\]
then \(\tau\) is an equivalence relation. Therefore this is the smallest relation which is an equivalence relation.
- The equivalence classes for \(\tau\) are the singletons:
\[[a] = \{a\},\ [b] = \{b\},\ [c] = \{c\},\ [d] = \{d\},\ [e] = \{e\}.\]
Let \(S\) be any set of strings and fix \(n \in \mathbb{Z}^+\).
\(R_n\) is reflexive: for any \(s \in S\), since \(s = s\), by definition \(s \mathrel{R_n} s\).
\(R_n\) is symmetric: let \(s, t \in S\), and assume \(s \mathrel{R_n} t\). If \(s = t\) then \(t \mathrel{R_n} s\); otherwise both \(s\) and \(t\) must have at least \(n\) characters and, since \(s \mathrel{R_n} t\), they must have the same first \(n\) characters, so \(t \mathrel{R_n} s\).
\(R_n\) is transitive: let \(s, t, u \in S\) and assume \(s \mathrel{R_n} t\) and \(t \mathrel{R_n} u\). Since \(s \mathrel{R_n} t\) we either have \(s = t\), or \(s\) and \(t\) both have at least \(n\) characters and have the same first \(n\) characters. Similarly, since \(t \mathrel{R_n} u\), either \(t = u\), or \(t\) and \(u\) both have at least \(n\) characters and have the same first \(n\) characters. Thus either \(s = t = u\), or \(s\) and \(u\) both have at least \(n\) characters and they both share the first \(n\) characters with \(t\) (and hence each other). Thus \(s \mathrel{R_n} u\) and so \(R_n\) is transitive.
Since \(R_n\) is reflexive, symmetric and transitive it is an equivalence relation. \(\square\)
Application — Identifiers
Not assessable for MATH1061. Taken from K. Rosen, Discrete Mathematics and its Applications, 7th edition, 1991, pages 608–618.
In the C programming language, an identifier is the name of a variable, a function or another type of entity.
Each identifier is a nonempty string of characters where each character is a lowercase or uppercase English letter, a digit, or an underscore.
There is no limit on the number of characters used in the identifier; however, for some compilers for some versions of C, there is a limit on the number of characters checked when two names are compared.
For example, Standard C compilers consider two identifiers the same when they agree in their first 31 characters. We see that two identifiers will be considered the same if and only if they are related under the relation \(R_n\) when \(n = 31\) (defined in a previous question).
Application problems
Using \(R_{31}\) on the set of all possible identifiers, determine the equivalence classes of each of the following identifiers:
file_1Number_of_tropical_stormsNumber_of_named_tropical_stormsNumber_of_named_tropical_storms_in_the_Atlantic_in_2005
Application solutions
Let \(I\) be the set of all possible identifiers (strings over letters, digits and underscores).
- Since
file_1has length \(6 < 31\), its equivalence class is just
\[[\texttt{file\_1}]_{R_{31}} = \{\texttt{file\_1}\}.\]
- Since
Number_of_tropical_stormshas length \(25 < 31\), its equivalence class is
\[[\texttt{Number\_of\_tropical\_storms}]_{R_{31}} = \{\texttt{Number\_of\_tropical\_storms}\}.\]
- The identifier
Number_of_named_tropical_stormshas length exactly 31, so two identifiers are \(R_{31}\)-equivalent to it iff they have at least 31 characters and their first 31 characters equal this string. Hence
\[[\texttt{Number\_of\_named\_tropical\_storms}]_{R_{31}} = \left\{ t \in I : \begin{array}{l} |t| \geq 31 \text{ and the first 31 characters of} \\ t \text{ are } \texttt{Number\_of\_named\_tropical\_storms} \end{array} \right\}.\]
- The identifier
Number_of_named_tropical_storms_in_the_Atlantic_in_2005begins with the same first 31 charactersNumber_of_named_tropical_storms, so it has the same \(R_{31}\)-equivalence class as in (c):
\[[\texttt{Number\_of\_named\_tropical\_storms\_in\_the\_Atlantic\_in\_2005}]_{R_{31}} = \left\{ t \in I : \begin{array}{l} |t| \geq 31 \text{ and the first 31 characters of} \\ t \text{ are } \texttt{Number\_of\_named\_tropical\_storms} \end{array} \right\}.\]
- Since
§32 — Partial Order Relations
Epp 4th ed. pp. 498–515 · 5th ed. (metric) pp. 546–563. Lecture 25 (week 9).
Problems
Let \(\rho\) be a relation on \(\mathbb{Z}\) defined by \(x \mathrel{\rho} y\) if and only if \(x^3 - 1 < y^3\).
Prove \(\rho\) is a partial order relation.
Is \(\rho\) a total order?
Let \(S\) be the set of binary strings of length 6. Define the weight of a binary string as the number of ones it contains. (For example, \(\operatorname{weight}(110110) = 4\).) Define a relation \(\rho\) on \(S\) by
\[s \mathrel{\rho} t \text{ if and only if } \operatorname{weight}(s) \leq \operatorname{weight}(t).\]
Prove that \(\rho\) is not an equivalence relation.
Prove that \(\rho\) is not a partial order relation.
Suppose \(R\) is a binary relation on the set \(\{1,2,3\}\) such that:
- \((2,3) \in R\)
- \((3,2) \in R\)
- \((1,1) \notin R\)
- \(R\) is transitive
- \(R\) is not symmetric
- \(R\) is not antisymmetric.
Draw an arrow diagram for the relation \(R\).
Solutions
- To show that \(\rho\) is a partial order, we need to show that \(\rho\) is reflexive, antisymmetric and transitive.
Reflexive: let \(x \in \mathbb{Z}\). Then \(x^3 - 1 < x^3\) and so \(x \mathrel{\rho} x\), so \(\rho\) is reflexive.
Antisymmetric: suppose \(x \mathrel{\rho} y\) where \(x \neq y\). (We must show that then \(y \mathrel{\not\rho} x\).) Now \(x \mathrel{\rho} y\) means that \(x^3 - 1 < y^3\). And since \(x \neq y\) we must have \(x^3 < y^3\) and so \(x^3 \leqslant y^3 - 1\). Hence \(y^3 - 1 \not< x^3\) and so we do not have \(y \mathrel{\rho} x\). Therefore \(\rho\) is antisymmetric.
Transitive: suppose that \(x \mathrel{\rho} y\) and \(y \mathrel{\rho} z\). Then we know that \(x^3 - 1 < y^3\) and \(y^3 - 1 < z^3\). So \(x^3 - 1 \leqslant y^3 - 1 < z^3\), that is, \(x^3 - 1 < z^3\) so that \(x \mathrel{\rho} z\), which means that \(\rho\) is transitive.
Hence \(\rho\) is a partial order. \(\square\)
- To check whether \(\rho\) is a total order, let \(x\) and \(y\) be any two distinct integers. Then \(x^3 \neq y^3\) and so either \(x^3 < y^3\) or else \(y^3 < x^3\).
If \(x^3 < y^3\) then \(x^3 - 1 < y^3\) and so \(x \mathrel{\rho} y\).
If \(y^3 < x^3\) then \(y^3 - 1 < x^3\) and so \(y \mathrel{\rho} x\).
So for any integers \(x \neq y\), we have either \(x \mathrel{\rho} y\) or else \(y \mathrel{\rho} x\). So any two integers are comparable under \(\rho\). Hence \(\rho\) is a total order.
It is not an equivalence relation because it is not symmetric. For instance, let \(s = 000000\) and \(t = 111111\). Then \(\operatorname{weight}(s) = 0 \leq 6 = \operatorname{weight}(t)\), so \((s,t) \in \rho\), but \((t,s) \notin \rho\).
It is not a partial order because it is not antisymmetric. For instance, let \(s = 100000\) and \(t = 010000\). Then \(\operatorname{weight}(s) = \operatorname{weight}(t) = 1\), so \(s \mathrel{\rho} t\) and \(t \mathrel{\rho} s\), but \(s \neq t\).
One relation on \(\{1,2,3\}\) satisfying all conditions is
\[R = \{(1,2), (1,3), (2,2), (3,3), (2,3), (3,2)\}.\]
(It contains \((2,3)\) and \((3,2)\); it is transitive; it is not symmetric since \((1,2) \in R\) but \((2,1) \notin R\); it is not antisymmetric since \(2 \neq 3\) and \((2,3), (3,2) \in R\); and \((1,1) \notin R\).)
An arrow diagram for this \(R\) has vertices \(1, 2, 3\) with: arrows \(1 \to 2\) and \(1 \to 3\); loops at 2 and at 3; and a double-headed arrow between 2 and 3. There is no loop at vertex 1.
§33 — Definitions and Examples of Groups
No relevant textbook pages. Lecture 26 (week 9).
Problems
Show \(\mathbb{Z}_9 - \{0\} = \{1,2,3,\dots,7,8\}\) is not a group under multiplication modulo 9.
Let \(G\) be the set of all odd integers. Define the binary operation \(\star\) on \(G\) by
\[x \star y = x + y - 1.\]
Show that \((G, \star)\) is an abelian group.
Show \(\mathbb{Z}_9 - \{0,3,6\} = \{1,2,4,5,7,8\}\) is a group under multiplication modulo 9. Is the group abelian?
Define the group \(H = \mathbb{Z}_5 - \{0\} = \{1,2,3,4\}\) under multiplication modulo 5. Write the Cayley table for \(H\).
Define the group \(G = \mathbb{Z}_2 \times \mathbb{Z}_2\) under component-wise addition modulo 2. That is,
\[(a,b) + (c,d) = (a + c \bmod 2,\ b + d \bmod 2).\]
Write the Cayley table for \(G\).
Solutions
It is not a group under multiplication mod 9 because, for example, it is not closed (\(3 \cdot 3 = 0 \notin \mathbb{Z}_9 - \{0\}\)).
Closure: if \(x\) and \(y\) are odd, then \(x + y\) is even, so \(x + y - 1\) is odd. Hence \(x \star y \in G\).
Associativity: for \(x, y, z \in G\),
\[(x \star y) \star z = (x + y - 1) + z - 1 = x + y + z - 2 = x + (y + z - 1) - 1 = x \star (y \star z).\]
Commutativity: for \(x, y \in G\),
\[x \star y = x + y - 1 = y + x - 1 = y \star x.\]
Identity: we seek \(e \in G\) such that \(x \star e = x = e \star x\) for all \(x\). Now the requirement \(x \star e = x + e - 1 = x\) implies that \(e = 1\). Note 1 lies in \(G\). Moreover, commutativity implies that \(e \star x = x\) as well. Thus the identity is 1.
Inverses: given \(x \in G\), we want \(y \in G\) with \(x \star y = 1\). This means \(x + y - 1 = 1\), so \(y = 2 - x\). Since \(x\) is odd, \(2 - x\) is odd, hence \(2 - x \in G\). Thus the inverse of \(x\) is \(x^{-1} = 2 - x\).
Therefore \((G, \star)\) is an abelian group. \(\square\)
Closure: if \(a, b \in \{1,2,4,5,7,8\}\), then \(3 \nmid a\) and \(3 \nmid b\), hence \(3 \nmid ab\), so \(ab \not\equiv 0, 3, 6 \pmod 9\); thus \(\{1,2,4,5,7,8\}\) is closed under multiplication modulo 9.
Associativity and commutativity: normal multiplication between integers is associative and commutative, so multiplication modulo 9 in the set \(\{1,2,4,5,7,8\}\) is also associative and commutative. This means the group is abelian.
Identity: \(1 \in G\) is the identity because \(1 \cdot x \equiv x \pmod 9\).
Inverse: every element has an inverse. We explicitly calculate the inverses:
\[\begin{aligned} 1^{-1} &= 1 && \text{because } 1 \cdot 1 \equiv 1 \pmod 9, \\ 2^{-1} &= 5 && \text{because } 2 \cdot 5 = 10 \equiv 1 \pmod 9, \\ 4^{-1} &= 7 && \text{because } 4 \cdot 7 = 28 \equiv 1 \pmod 9, \\ 5^{-1} &= 2 && \text{because } 5 \cdot 2 = 10 \equiv 1 \pmod 9, \\ 7^{-1} &= 4 && \text{because } 7 \cdot 4 = 28 \equiv 1 \pmod 9, \\ 8^{-1} &= 8 && \text{because } 8 \cdot 8 = 64 \equiv 1 \pmod 9. \end{aligned}\]
For \(H = \mathbb{Z}_5 \setminus \{0\} = \{1,2,3,4\}\) under multiplication mod 5, the Cayley table is:
\(\cdot\) 1 2 3 4 1 1 2 3 4 2 2 4 1 3 3 3 1 4 2 4 4 3 2 1 For \(G = \mathbb{Z}_2 \times \mathbb{Z}_2 = \{(0,0), (0,1), (1,0), (1,1)\}\) under componentwise addition mod 2, the Cayley table is:
\(+\) \((0,0)\) \((0,1)\) \((1,0)\) \((1,1)\) \(\mathbf{(0,0)}\) \((0,0)\) \((0,1)\) \((1,0)\) \((1,1)\) \(\mathbf{(0,1)}\) \((0,1)\) \((0,0)\) \((1,1)\) \((1,0)\) \(\mathbf{(1,0)}\) \((1,0)\) \((1,1)\) \((0,0)\) \((0,1)\) \(\mathbf{(1,1)}\) \((1,1)\) \((1,0)\) \((0,1)\) \((0,0)\)
§34 — Elementary Properties of Groups
No relevant textbook pages. Lecture 27 (week 10).
Problems
Let \(H = \{3n \mid n \in \mathbb{Z}\}\) be the set of multiples of 3. Prove \(H\) is a subgroup of \((\mathbb{Z}, +)\).
Fix elements \(g\) and \(h\) in a group \(G\) where \(e\) is the group identity. Prove the following statements:
If \(g^{-1} = h\) then \(h^{-1} = g\).
\((g^{-1})^{-1} = g\).
\((gh)^{-1} = h^{-1}g^{-1}\).
Prove \(K = \{(0,0), (0,1), (2,0), (2,1)\}\) is a subgroup of \((\mathbb{Z}_4 \times \mathbb{Z}_2, +)\) where the group operation is componentwise addition:
\[(a,b) + (c,d) = (a + c \pmod 4,\ b + d \pmod 2).\]
Consider the group \((\mathbb{Z}_{11} - \{0\}, \cdot)\). Show that this group is cyclic.
Hint: express every element of \(\mathbb{Z}_{11} - \{0\}\) as a power of 2.
Solutions
First we note that \(H \subseteq \mathbb{Z}\), and \(H \neq \emptyset\).
Closure: if \(x, y \in H\) then \(x = 3a\) and \(y = 3b\) for some \(a, b \in \mathbb{Z}\). Therefore \(x + y = 3a + 3b = 3(a+b) \in H\).
Identity: the identity of \((\mathbb{Z},+)\) is 0, and since \(0 = 3 \cdot 0\), we have \(0 \in H\).
Inverse: in \(\mathbb{Z}\), the inverse of \(x\) is \(-x\). In \(H\), if \(x \in H\) then \(x = 3a\) for some \(a \in \mathbb{Z}\). This means \(-x = -3a = 3 \cdot (-a)\), and so \(-x \in H\) also.
Note that we do not need to check associativity for subgroups, since this property is automatically inherited from the parent group \((\mathbb{Z},+)\). \(\square\)
Suppose \(g^{-1} = h\). Now \(gh = gg^{-1} = e\) and \(hg = g^{-1}g = e\). Thus \(h^{-1} = g\).
By definition, \(gg^{-1} = e = g^{-1}g\), so \((g^{-1})^{-1} = g\).
Notice we have
\[(gh)(h^{-1}g^{-1}) = ghh^{-1}g^{-1} = e\]
and
\[(h^{-1}g^{-1})(gh) = h^{-1}g^{-1}gh = e.\]
This means \((gh)^{-1} = h^{-1}g^{-1}\).
We draw the Cayley table of \(K = \{(0,0), (0,1), (2,0), (2,1)\}\) under componentwise addition in \(\mathbb{Z}_4 \times \mathbb{Z}_2\):
\(+\) \((0,0)\) \((0,1)\) \((2,0)\) \((2,1)\) \(\mathbf{(0,0)}\) \((0,0)\) \((0,1)\) \((2,0)\) \((2,1)\) \(\mathbf{(0,1)}\) \((0,1)\) \((0,0)\) \((2,1)\) \((2,0)\) \(\mathbf{(2,0)}\) \((2,0)\) \((2,1)\) \((0,0)\) \((0,1)\) \(\mathbf{(2,1)}\) \((2,1)\) \((2,0)\) \((0,1)\) \((0,0)\) Notice the operation is closed in \(K\) and every element of \(K\) has an inverse in \(K\). Therefore \(K\) is a subgroup. \(\square\)
Note that 2 is a generator of \((\mathbb{Z}_{11} - \{0\}, \cdot)\), so it is cyclic:
\[1 = 2^0,\ 2 = 2^1,\ 4 = 2^2,\ 8 = 2^3,\ 5 = 2^4,\ 10 = 2^5,\ 9 = 2^6,\ 7 = 2^7,\ 3 = 2^8,\ 6 = 2^9.\]
§35 — Group Isomorphisms
No relevant textbook pages. No lecture in the published schedule — the Week 10 row jumps from L27 (V34) to L28 (V36).
This content is optional and will not be assessed. The source document carries no practice problems or solutions for this section.
§36 — Definitions and Examples of Fields
No relevant textbook pages. Lecture 28 (week 10).
Problems
Solve \(3x + 4 = 2\) in the field \((\mathbb{Z}_5, +, \cdot)\).
Solve \(8x - 9 = 6\) in the field \((\mathbb{Z}_{11}, +, \cdot)\).
Solve \(4(1-x) = 10\) in the field \((\mathbb{Z}_{13}, +, \cdot)\).
Solve \(16(x-6) = 15\) in the field \((\mathbb{Z}_{19}, +, \cdot)\).
Prove \(\mathbb{Z}_{12}\) with addition modulo 12 and multiplication modulo 12 is not a field.
Define addition and multiplication on \(\mathbb{Q} \times \mathbb{Q}\) by
\[(a,b) + (c,d) = (a+c,\ b+d)\]
and
\[(a,b) \cdot (c,d) = (ac + 3bd,\ ad + bc)\]
for all \((a,b), (c,d) \in \mathbb{Q} \times \mathbb{Q}\). Prove that \((\mathbb{Q} \times \mathbb{Q}, +, \cdot)\) is a field.
Solutions
\[\begin{aligned} 3x + 4 &= 2 \\ \to 3x &= -2 \end{aligned}\]
Now, since \(3 \times 2 = 6 \equiv 1 \pmod 5\), 2 is the multiplicative inverse of 3, and so we multiply both sides by 2 and obtain \(x = -4\). That is, \(x = 1\).
Check: \(3 \cdot 1 + 4 = 7 \equiv 2 \pmod 5\).
\[\begin{aligned} 8x - 9 &= 6 \\ \to 8x &= 15 = 4 \end{aligned}\]
Now, since \(8 \times 7 = 56 \equiv 1 \pmod{11}\), 7 is the multiplicative inverse of 8, and so we multiply both sides by 7 and obtain \(x = 28\). That is, \(x = 6\).
Check: \(8 \cdot 6 - 9 = 39 \equiv 6 \pmod{11}\).
- Since \(4 \times 10 = 40 \equiv 1 \pmod{13}\), 10 is the multiplicative inverse of 4, and so we multiply both sides by 10 and obtain \(1 - x = 100 = 9\). That is, \(x = 1 - 9 = 14 - 9 = 5\).
Check: \(4(1-5) = -16 \equiv 10 \pmod{13}\).
- Since \(16 \times 6 = 96 \equiv 1 \pmod{19}\), 6 is the multiplicative inverse of 16, and so we multiply both sides by 6 and obtain \(x - 6 = 90 = 14\). That is, \(x = 20 = 1\).
Check: \(16(1-6) = -80 \equiv 15 \pmod{19}\).
\(\mathbb{Z}_{12}\) is not a field because 2 has no multiplicative inverse modulo 12. Indeed \(2 \cdot k \equiv 1 \pmod{12}\) has no solution since \(2k\) is always even.
We show that \((\mathbb{Q} \times \mathbb{Q}, +, \cdot)\) is a field in three steps.
Step 1 — \((\mathbb{Q} \times \mathbb{Q}, +)\) is an abelian group.
Closure: for all \((a,b), (c,d) \in \mathbb{Q} \times \mathbb{Q}\), we have \((a,b) + (c,d) = (a+c, b+d) \in \mathbb{Q} \times \mathbb{Q}\).
Associative: for all \((a,b), (c,d), (e,f) \in \mathbb{Q} \times \mathbb{Q}\) we have \(\big((a,b) + (c,d)\big) + (e,f) = (a+c, b+d) + (e,f) = (a+c+e, b+d+f) = (a,b) + (c+e, d+f) = (a,b) + \big((c,d) + (e,f)\big)\).
Identity: for all \((a,b) \in \mathbb{Q} \times \mathbb{Q}\) we have \((a,b) + (0,0) = (a+0, b+0) = (a,b) = (0+a, 0+b) = (0,0) + (a,b)\).
Inverses: for all \((a,b) \in \mathbb{Q} \times \mathbb{Q}\) we have \((a,b) + (-a,-b) = (a-a, b-b) = (0,0)\) and \((-a,-b) + (a,b) = (-a+a, -b+b) = (0,0)\). So \((-a,-b)\) is the inverse of \((a,b)\).
Commutativity: for all \((a,b), (c,d) \in \mathbb{Q} \times \mathbb{Q}\), we have \((a,b) + (c,d) = (a+c, b+d) = (c+a, d+b) = (c,d) + (a,b)\).
Thus \((\mathbb{Q} \times \mathbb{Q}, +)\) is an abelian group.
Step 2 — \(\big((\mathbb{Q} \times \mathbb{Q}) - \{(0,0)\},\ \cdot\big)\) is an abelian group.
Closure: for all \((a,b), (c,d) \in (\mathbb{Q} \times \mathbb{Q}) - \{(0,0)\}\), we have \((a,b) \cdot (c,d) = (ac+3bd, ad+bc) \in \mathbb{Q} \times \mathbb{Q}\). So we only need to show that \((ac+3bd, ad+bc) \neq (0,0)\). For a contradiction, suppose \((ac+3bd, ad+bc) = (0,0)\). That is, \(ac + 3bd = 0\) and \(ad + bc = 0\). Multiplying the first equation by \(d\) and the second by \(c\) we obtain \(acd + 3bd^2 = 0\) and \(acd + bc^2 = 0\), from which it follows that \(3bd^2 = bc^2\).
Now, if \(b = 0\), then \(ac = 0\), \(ad = 0\) and \(a \neq 0\), and so \(c = d = 0\); a contradiction. Thus \(b \neq 0\) and we have \(3d^2 = c^2\). This is a contradiction because if \(d = 0\), then \(c \neq 0\) and the equation does not hold, and if \(d \neq 0\), then we have \(3 = \frac{c^2}{d^2}\), which implies \(\sqrt{3} = \frac{c}{d}\) is rational. Thus \((ac+3bd, ad+bc) \neq (0,0)\) and we have closure.
Associative: for all \((a,b), (c,d), (e,f) \in (\mathbb{Q} \times \mathbb{Q}) - \{(0,0)\}\) we have
\[\begin{aligned} (a,b) \cdot \big((c,d) \cdot (e,f)\big) &= (a,b) \cdot (ce + 3df,\ cf + de) \\ &= \big(a(ce+3df) + 3b(cf+de),\ a(cf+de) + b(ce+3df)\big) \\ &= (ace + 3adf + 3bcf + 3bde,\ acf + ade + bce + 3bdf) \end{aligned}\]
and
\[\begin{aligned} \big((a,b) \cdot (c,d)\big) \cdot (e,f) &= (ac+3bd,\ ad+bc) \cdot (e,f) \\ &= \big((ac+3bd)e + 3(ad+bc)f,\ (ac+3bd)f + (ad+bc)e\big) \\ &= (ace + 3bde + 3adf + 3bcf,\ acf + 3bdf + ade + bce) \\ &= (ace + 3adf + 3bcf + 3bde,\ acf + ade + bce + 3bdf). \end{aligned}\]
Identity: for all \((a,b) \in (\mathbb{Q} \times \mathbb{Q}) - \{(0,0)\}\) we have \((a,b) \cdot (1,0) = (a,b)\) and \((1,0) \cdot (a,b) = (a,b)\), so \((1,0)\) is a multiplicative identity.
Commutativity: for all \((a,b), (c,d) \in \mathbb{Q} \times \mathbb{Q}\), we have
\[(a,b) \cdot (c,d) = (ac+3bd,\ ad+bc) = (ca+3db,\ cb+da) = (c,d) \cdot (a,b).\]
Inverses: we check that for all \((a,b) \in (\mathbb{Q} \times \mathbb{Q}) - \{(0,0)\}\),
\[(a,b)^{-1} = \left(\frac{a}{a^2 - 3b^2},\ \frac{-b}{a^2 - 3b^2}\right).\]
First, note that \(a^2 - 3b^2 \neq 0\), because \(a^2 - 3b^2 = 0\) implies either \((a,b) = (0,0)\) or \(\sqrt{3} = \frac{a}{b}\), both of which are contradictions (the second because \(\sqrt{3}\) is not rational). Thus \((a,b)^{-1} \in (\mathbb{Q} \times \mathbb{Q}) - \{(0,0)\}\), and notice
\[\begin{aligned} (a,b) \cdot \left(\frac{a}{a^2-3b^2}, \frac{-b}{a^2-3b^2}\right) &= \left(a \cdot \frac{a}{a^2-3b^2} + 3b \cdot \frac{-b}{a^2-3b^2},\ a \cdot \frac{-b}{a^2-3b^2} + b \cdot \frac{a}{a^2-3b^2}\right) \\ &= \left(\frac{a^2 - 3b^2}{a^2 - 3b^2},\ \frac{-ab + ab}{a^2 - 3b^2}\right) \\ &= (1, 0). \end{aligned}\]
So every nonzero element has an inverse. Thus \(\big((\mathbb{Q} \times \mathbb{Q}) - \{(0,0)\}, \cdot\big)\) is an abelian group.
Step 3 — the distributive laws. For all \((a,b), (c,d), (e,f) \in \mathbb{Q} \times \mathbb{Q}\) we have
\[\begin{aligned} (a,b) \cdot \big((c,d) + (e,f)\big) &= (a,b) \cdot (c+e,\ d+f) \\ &= \big(a(c+e) + 3b(d+f),\ a(d+f) + b(c+e)\big) \\ &= \big((ac+3bd) + (ae+3bf),\ (ad+bc) + (af+be)\big) \\ &= (ac+3bd,\ ad+bc) + (ae+3bf,\ af+be) \\ &= (a,b) \cdot (c,d) + (a,b) \cdot (e,f) \end{aligned}\]
and (since we have already shown that multiplication and addition are commutative)
\[\begin{aligned} \big((a,b) + (c,d)\big) \cdot (e,f) &= (e,f) \cdot \big((a,b) + (c,d)\big) \\ &= (e,f) \cdot (a,b) + (e,f) \cdot (c,d) && \text{(by the first distributive law)} \\ &= (a,b) \cdot (e,f) + (c,d) \cdot (e,f). \end{aligned}\]
Thus \((\mathbb{Q} \times \mathbb{Q}, +, \cdot)\) is a field. \(\square\)
§37 — Introduction to Counting
Epp 4th ed. pp. 516–553 · 5th ed. (metric) pp. 564–604. Lecture 29 (week 11).
Problems
The UQ drama club is auditioning for its annual production of Romeo and Juliet. Six people are auditioning for the role of Romeo, and eight other people are auditioning for the role of Juliet. In how many ways can the director cast the lead couple?
There are eleven questions on the final exam, but you decide — based on your successful grade for your in-semester exam — that you will only do five of them. How many combinations of questions are there which you could complete?
How many permutations of \(\{1, 2, \dots, 15\}\) start with an odd number?
How many 5-element subsets of \(\{1, 2, \dots, 15\}\) contain exactly two numbers from \(\{1,2,3,4\}\)?
Solutions
There are 6 choices for Romeo and 8 choices for Juliet, so \(6 \cdot 8 = 48\) ways.
Since the order in which you do the 5 questions does not matter, there are \(\binom{11}{5} = 462\) combinations of questions.
There are 8 odd numbers in the set \(\{1, \dots, 15\}\). Choose the first entry in 8 ways, then permute the remaining 14 numbers, so \(8 \cdot 14!\) permutations.
We choose exactly 2 numbers from the set \(\{1,2,3,4\}\) and exactly 3 numbers from the remaining 11 numbers, so the number of subsets is
\[\binom{4}{2}\binom{11}{3}.\]
Application — Runtime
Not assessable for MATH1061. Taken from S. Epp, Discrete Mathematics with Applications, 5th edition, pages 787–799.
In many algorithms, the runtime is well approximated by counting how many times the basic instructions are executed.
For programs with nested for-loops and no early exits, the total number of executions of the inner loop body equals the number of choices of the outer-loop index multiplied by the number of choices of the inner-loop index.
Concretely, if \(i\) runs through \(M\) values and, for each fixed \(i\), the variable \(j\) runs through \(N\) values, then the inner loop body is executed exactly \(MN\) times.
Application problems
The following algorithms are written in pseudo-code and contain nested loops. For each algorithm, count the total number of iterations of the inner loop that the algorithm will run.
for i := 1 to 30 for j := 1 to 15 [Statements in body of inner loop. None contain branching statements that lead outside the loop.] next j next ifor i := 5 to 50 for j := 10 to 20 [Statements in body of inner loop. None contain branching statements that lead outside the loop.] next j next i- (Fix integers \(a, b, c, d \in \mathbb{Z}^+\) with \(a \leq b\) and \(c \leq d\).)
for i := a to b for j := c to d [Statements in body of inner loop. None contain branching statements that lead outside the loop.] next j next i
Application solutions
\(i = 1, \dots, 30\) gives 30 iterations and \(j = 1, \dots, 15\) gives 15 iterations, so the inner loop runs \(30 \cdot 15 = 450\) times.
\(i = 5, \dots, 50\) gives \(50 - 5 + 1 = 46\) iterations and \(j = 10, \dots, 20\) gives \(20 - 10 + 1 = 11\) iterations, so the inner loop runs \(46 \cdot 11 = 506\) times.
\(i = a, \dots, b\) gives \(b - a + 1\) iterations and \(j = c, \dots, d\) gives \(d - c + 1\) iterations, so the inner loop runs \((b-a+1)(d-c+1)\) times.
§38 — Counting Selections
Epp 4th ed. pp. 516–553 · 5th ed. (metric) pp. 564–604. Lecture 30 (week 11).
Problems
How many distinct arrangements can be made from the letters of the word INDOOROOPILLY?
How many distinct arrangements can be made from the letters of the word INDOOROOPILLY that begin with R and end with P?
How many distinct arrangements can be made from the letters of the word INDOOROOPILLY that begin with I and end with Y?
How many distinct arrangements can be made from the letters of the word INDOOROOPILLY that have all four Os next to each other?
How many distinct arrangements can be made of the letters of the word WOOLLOONGABBA?
How many distinct arrangements are there of the letters of the word WOOLLOONGABBA such that exactly one of the following is true?
- The two As are not next to each other.
- The two Bs are not next to each other.
- The two Ls are not next to each other.
How many one-to-one (injective) functions are there from \(\{a,b,c\}\) to \(\{1,2,3,4,5\}\)?
How many onto (surjective) functions are there from \(\{1,2,3,4,5\}\) to \(\{a,b,c\}\)?
Solutions
- There are 13 letters in INDOOROOPILLY, with four O’s, two I’s, two L’s, and the remaining letters appearing once each. Therefore the number of distinct arrangements is
\[\frac{13!}{4!\,2!\,2!} = 64\,864\,800.\]
- Fix R in the first position and P in the last position. There are 11 letters remaining, with four O’s, two I’s, two L’s, and the remaining letters appearing once each. Therefore the number of distinct arrangements is
\[\frac{11!}{4!\,2!\,2!} = 415\,800.\]
- Fix I in the first position and Y in the last position. There are 11 letters remaining, with four O’s, two L’s, and the remaining letters appearing once each. Therefore the number of distinct arrangements is
\[\frac{11!}{4!\,2!} = 831\,600.\]
- Treat the four O’s as one ‘letter’. There are 10 ‘letters’ with two I’s, two L’s, and the remaining ‘letters’ appearing once each. Therefore the number of distinct arrangements is
\[\frac{10!}{2!\,2!} = 907\,200.\]
- There are 13 letters in WOOLLOONGABBA, with four O’s, two L’s, two A’s, two B’s, and the remaining letters appearing once each. Therefore the number of distinct arrangements is
\[\frac{13!}{4!\,2!\,2!\,2!} = 32\,432\,400.\]
- We want exactly one of the pairs AA, BB, LL to be non-adjacent. That is, there are three cases to consider:
- Case 1: the two A’s are not adjacent but BB and LL are adjacent.
- Case 2: the two B’s are not adjacent but AA and LL are adjacent.
- Case 3: the two L’s are not adjacent but AA and BB are adjacent.
Note that the number of ways Case 1 can occur is exactly the same as the number of ways Case 2 can occur (and similarly for Case 3).
To count the number of ways Case 1 can occur, we first count arrangements with BB adjacent and LL adjacent. Treat BB as one ‘letter’ and LL as one ‘letter’. Then there are 11 ‘letters’ (W, O, O, LL, O, O, N, G, A, BB, A) to arrange, with four O’s, two A’s, and the remaining ‘letters’ appearing once each. Therefore the number of such arrangements is
\[\frac{11!}{4!\,2!}.\]
In order to determine the number of these for which the two A’s are not adjacent, we take this total and subtract those where AA is also adjacent. For this, treat AA, BB, and LL as ‘letters’. Then there are 10 ‘letters’ to arrange, with four O’s and the remaining ‘letters’ appearing once each. Therefore the number of arrangements with AA adjacent and BB adjacent and LL adjacent is
\[\frac{10!}{4!}.\]
Hence, the number of ways that Case 1 can occur is
\[\frac{11!}{4!\,2!} - \frac{10!}{4!}.\]
Case 2 and Case 3 have exactly the same number of occurrences as Case 1. Also note that the three cases are mutually exclusive (you cannot have both Case 1 and Case 2 occurring at the same time, for example).
So the number of arrangements of the word WOOLLOONGABBA for which exactly one of the three cases occurs is
\[3\left(\frac{11!}{4!\,2!} - \frac{10!}{4!}\right).\]
- An injective function \(f : \{a,b,c\} \to \{1,2,3,4,5\}\) is determined by choosing distinct images for \(a\), \(b\), \(c\). The number of choices is
\[5 \cdot 4 \cdot 3 = {}^5P_3 = 60.\]
- The number of surjective functions \(f : \{1,2,3,4,5\} \to \{a,b,c\}\) is the total number of functions from \(\{1,2,3,4,5\}\) to \(\{a,b,c\}\) minus the number of functions from \(\{1,2,3,4,5\}\) to \(\{a,b,c\}\) which are not surjective. The former number is \(3^5\). A function which is not surjective must have image of size 1 or 2.
- In the first case, there are 3 such functions (one for each of the three choices for the image).
- In the latter case, first choose which 2 elements of \(\{a,b,c\}\) will be in the image. There are \(\binom{3}{2}\) such choices. For this fixed two-element image, the number of functions with this image is
\[2^5 - 2,\]
since there are \(2^5\) total functions from a 5-element set to a 2-element set, and we subtract the 2 constant ones (which fall into the first case, having image of size 1). Thus the number of functions from \(\{1,2,3,4,5\}\) to \(\{a,b,c\}\) with an image of size 2 is
\[\binom{3}{2}(2^5 - 2) = 3 \cdot 30 = 90.\]
This means there are 93 functions which are not surjective, so the number of surjective functions from \(\{1,2,3,4,5\}\) to \(\{a,b,c\}\) is
\[3^5 - 93 = 150.\]
§39 — Introduction to Probability
Epp 4th ed. pp. 516–553 · 5th ed. (metric) pp. 564–604. Lecture 31 (week 11).
Problems
To form a committee, five people are to be chosen from a group of ten people.
How many different committees of five can be chosen?
Amongst the ten people, we have Alice, Bob, Eve and Oscar. Alice and Bob are extremely talkative during meetings, and so at most one of these two can be chosen. Eve and Oscar are inseparable, and so a committee must either contain both of them or neither of them. With these constraints, how many different five-person committees can be formed?
What is the probability that none of Alice, Bob, Eve and Oscar are on a committee, given that a random committee of five is chosen subject to the constraints in part (b)?
How many positive two-digit integers are multiples of 3?
What is the probability that a randomly chosen positive two-digit integer is a multiple of 3?
What is the probability that a randomly chosen positive two-digit integer is a multiple of 4?
Solutions
- Number of different committees of five is
\[\binom{10}{5} = \frac{10 \cdot 9 \cdot 8 \cdot 7 \cdot 6}{5 \cdot 4 \cdot 3 \cdot 2} = 252.\]
- Let \(A\), \(B\) be Alice and Bob, and let \(E\), \(O\) be Eve and Oscar. There are 6 other people. We split into cases.
Case 1: the committee contains both \(E\) and \(O\). Then we choose 3 more people from the remaining 8 with the restriction that we cannot choose both \(A\) and \(B\). There are \(\binom{8}{3}\) ways to choose 3 more people from the remaining 8 to be on the committee; of these, there are \(\binom{6}{1}\) ways in which both \(A\) and \(B\) are chosen (such a committee must have \(E, O, A, B\) so there is only one more person to choose from the remaining 6 people). Thus the number of committees for this case is
\[\binom{8}{3} - \binom{6}{1} = 56 - 6 = 50.\]
Case 2: the committee contains neither \(E\) nor \(O\). Then we choose 5 people from the remaining 8, again not allowing both \(A\) and \(B\). There are \(\binom{8}{5}\) ways to choose 5 people from the remaining 8 people to be on the committee; of these, there are \(\binom{6}{3}\) ways in which both \(A\) and \(B\) are chosen. Thus the number of committees for this case is
\[\binom{8}{5} - \binom{6}{3} = 56 - 20 = 36.\]
Hence the total number is \(50 + 36 = 86\).
- To have none of Alice, Bob, Eve, or Oscar on the committee, we must choose all 5 members from the other 6 people, which can be done in \(\binom{6}{5} = 6\) ways. Therefore the probability is
\[\frac{6}{86} = 0.069767\ldots\]
- The positive two-digit multiples of 3 occur as every third number from 12 to 99, so there are
\[\frac{99 - 12}{3} + 1 = 30\]
such numbers.
- There are 90 positive two-digit integers (9 choices for the first digit and 10 choices for the second digit). Thus, by part (a), the probability that a randomly selected positive two-digit number is a multiple of 3 is
\[\frac{30}{90} = \frac{1}{3}.\]
- The positive two-digit multiples of 4 occur as every fourth number from 12 to 96, so there are
\[\frac{96 - 12}{4} + 1 = 22\]
such numbers. Hence the probability that a randomly selected positive two-digit number is a multiple of 4 is
\[\frac{22}{90} = \frac{11}{45}.\]
§40 — Binomial Coefficients
Epp 4th ed. pp. 565–591 · 5th ed. (metric) pp. 617–641. Lecture 31 (week 11).
Problems
What is the coefficient of \(x^4\) in \((2 + 3x)^7\)?
What is the coefficient of \(x^{12}\) in \((3 - x^3)^6\)?
What is the coefficient of \(x^8\) in \((3 - x^3)^6\)?
What is the coefficient of \(x^2\) in the expansion of \((3-x)^6\)?
What is the coefficient of \(x^5\) in the expansion of \((2x+1)^{20}\)?
What is the coefficient of \(x^5\) in the expansion of \(\left(3x^2 - \dfrac{2}{x}\right)^7\)?
Solutions
By the binomial theorem,
\[(2 + 3x)^7 = \sum_{k=0}^{7} \binom{7}{k} 2^{7-k} (3x)^k.\]
The term \(x^4\) appears only when \(k = 4\). This term is \(\binom{7}{4} 2^3 (3x)^4\). Therefore the coefficient of \(x^4\) is
\[\binom{7}{4} 2^3 3^4 = 35 \times 8 \times 81 = 22\,680.\]
By the binomial theorem,
\[(3 - x^3)^6 = \sum_{k=0}^{6} \binom{6}{k} 3^{6-k} (-x^3)^k = \sum_{k=0}^{6} \binom{6}{k} 3^{6-k} (-1)^k x^{3k}.\]
- The term involving \(x^{12}\) is \(\binom{6}{4} 3^2 (-1)^4 x^{3 \cdot 4}\), so the coefficient of \(x^{12}\) is
\[15 \times 9 \times (-1)^4 = 135.\]
- Every power of \(x\) that appears is a multiple of 3. Since 8 is not a multiple of 3, there is no \(x^8\) term, so the coefficient of \(x^8\) is 0.
By the binomial theorem,
\[(3-x)^6 = \sum_{i=0}^{6} \binom{6}{i} 3^{6-i} (-x)^i = \sum_{i=0}^{6} \binom{6}{i} 3^{6-i} (-1)^i x^i.\]
The term \(x^2\) appears only when \(i = 2\), so the coefficient of \(x^2\) is
\[\binom{6}{2} 3^{6-2} (-1)^2 = \binom{6}{2} 3^4 = 1215.\]
By the binomial theorem,
\[(2x+1)^{20} = \sum_{k=0}^{20} \binom{20}{k} (2x)^{20-k} (1)^k.\]
The term \(x^5\) appears only when \(k = 15\), where the term is \(\binom{20}{15}(2x)^5\), so the coefficient of \(x^5\) is
\[\binom{20}{5} 2^5 = 496\,128.\]
By the binomial theorem,
\[\left(3x^2 - \frac{2}{x}\right)^7 = \sum_{i=0}^{7} \binom{7}{i} (3x^2)^{7-i}\left(-\frac{2}{x}\right)^i = \sum_{i=0}^{7} \binom{7}{i} 3^{7-i} (-2)^i x^{14-3i}.\]
The term \(x^5\) appears only when \(14 - 3i = 5\), i.e. \(i = 3\). Therefore the coefficient of \(x^5\) is
\[\binom{7}{3} 3^4 (-2)^3 = -22\,680.\]
§41 — Inclusion Exclusion
Epp 4th ed. pp. 545–549 · 5th ed. (metric) pp. 595–599. Lecture 32 (week 12).
Problems
Out of 100 people surveyed, 40 people like apples, 50 like bananas and 40 like cherries. 15 like apples and bananas, 16 like bananas and cherries, 17 like cherries and apples and 10 people like all three. How many people do not like any of the three fruits?
How many integers between 1 and 600 inclusive are coprime with 15? That is, how many integers \(n\) satisfy \(1 \leq n \leq 600\) and \(\gcd(n, 15) = 1\)?
Seven friends, named Alice, Bob, Charlie, Delia, Edward, Fred and George, stand in a line for a photograph. How many different arrangements are there of the seven friends standing in a line such that Alice is not next to Charlie and Bob is not next to Delia?
Solutions
Let \(A\) be the set of people who like apples, \(B\) the set of people who like bananas, and \(C\) the set of people who like cherries. We are given
\[|A| = 40,\ |B| = 50,\ |C| = 40,\quad |A \cap B| = 15,\ |B \cap C| = 16,\ |C \cap A| = 17,\quad |A \cap B \cap C| = 10.\]
By inclusion–exclusion,
\[\begin{aligned} |A \cup B \cup C| &= |A| + |B| + |C| - |A \cap B| - |B \cap C| - |C \cap A| + |A \cap B \cap C| \\ &= 40 + 50 + 40 - 15 - 17 - 16 + 10 \\ &= 92. \end{aligned}\]
Hence the number of people who do not like any of the three fruits is
\[100 - |A \cup B \cup C| = 100 - 92 = 8.\]
Let \(U = \{1, 2, \dots, 600\}\). Define
\[A = \{n \in U : 3 \mid n\}, \qquad B = \{n \in U : 5 \mid n\}.\]
Then \(n\) is not coprime to 15 if and only if \(n \in A \cup B\). We have
\[|A| = \frac{600}{3} = 200, \qquad |B| = \frac{600}{5} = 120, \qquad |A \cap B| = \frac{600}{15} = 40.\]
By inclusion–exclusion,
\[|A \cup B| = |A| + |B| - |A \cap B| = 200 + 120 - 40 = 280.\]
Therefore the number of \(n\) with \(\gcd(n,15) = 1\) is
\[|U| - |A \cup B| = 600 - 280 = 320.\]
Let \(U\) be the set of all linear arrangements of the 7 friends, so \(|U| = 7!\). Define
\[A = \{\text{arrangements in which Alice is next to Charlie}\},\] \[B = \{\text{arrangements in which Bob is next to Delia}\}.\]
We want to count the number of arrangements in \(U\) which are neither in \(A\) nor in \(B\). The required number is \(|U \setminus (A \cup B)| = |U| - |A \cup B|\).
To count \(|A|\), treat \(\{\)Alice, Charlie\(\}\) as a single block. There are \(6!\) ways to arrange the 6 “objects”, and for each of these there are 2 ways to order Alice and Charlie within their block (either Alice or Charlie to the left). Hence
\[|A| = 2 \cdot 6!.\]
Similarly, \(|B| = 2 \cdot 6!\).
To count \(|A \cap B|\), treat both pairs \(\{\)Alice, Charlie\(\}\) and \(\{\)Bob, Delia\(\}\) as two single blocks. There are \(5!\) ways to arrange the 5 objects (two blocks plus the other three people), and for each of these there are \(2 \cdot 2\) internal orders of the two blocks. Hence
\[|A \cap B| = 4 \cdot 5!.\]
By inclusion–exclusion,
\[|A \cup B| = |A| + |B| - |A \cap B| = 2 \cdot 6! + 2 \cdot 6! - 4 \cdot 5!.\]
Therefore
\[|U \setminus (A \cup B)| = 7! - \left(2 \cdot 6! + 2 \cdot 6! - 4 \cdot 5!\right) = 2640.\]
§42 — The Pigeonhole Principle
Epp 4th ed. pp. 554–565 · 5th ed. (metric) pp. 604–616. Lecture 33 (week 12).
Problems
Explain why, in a group of 50 people, at least five people were born in the same month.
How many people do you need to ensure that at least seven people were born in the same month?
Show that, if we select six distinct integers from the set \(\{1, 2, \dots, 10\}\), two of these must add to give 11.
A computer network consists of six computers. Each computer is directly connected to zero or more of the other computers. Show that there are at least two computers in the network that are directly connected to the same number of other computers.
During a month with 30 days, a baseball team plays at least one game a day, but no more than 45 games. Show that there must be a period of some number of consecutive days during which the team must play exactly 14 games.
Let \(S = \{1, 2, \dots, 100\}\). What is the minimum number of integers you must pick from \(S\) to be sure that at least one pair has a difference which is divisible by 3?
Solutions
There are 12 months (pigeonholes) and 50 people (pigeons). If each month had at most 4 birthdays, then there would be at most \(12 \cdot 4 = 48\) people. Since \(50 > 48\), by the pigeonhole principle some month must contain at least 5 people.
To guarantee at least 7 people are born in the same month, note that if each month had at most 6 birthdays, then there could be at most \(12 \cdot 6 = 72\) people. Therefore with 73 people, by the pigeonhole principle some month has at least 7 people. Moreover, 72 people is not enough (take 6 born in each month), so the minimum is 73.
Partition \(A = \{1, 2, \dots, 10\}\) into the 5 pairs
\[\{1,10\},\ \{2,9\},\ \{3,8\},\ \{4,7\},\ \{5,6\},\]
each summing to 11. In order for a selection of distinct integers from the set \(A\) to not have two that add to give 11, at most one integer can be chosen from each of the subsets. Choosing 6 distinct integers from \(A\) forces us to select two numbers from the same pair (there are 5 pairs but 6 choices), by the pigeonhole principle. Those two numbers then add to 11.
For each computer, let its degree be the number of other computers it is directly connected to. With 6 computers, each degree is an integer in \(\{0,1,2,3,4,5\}\). It is impossible to have both a computer of degree 0 and a computer of degree 5 (if one is connected to everyone, then none has degree 0). Hence the degrees must all lie in one of the two 5-element sets
\[\{0,1,2,3,4\} \quad \text{or} \quad \{1,2,3,4,5\}.\]
So, in either case, there are only 5 possible degree values available for 6 computers. By the pigeonhole principle, at least two computers have the same degree, i.e. are connected to the same number of other computers.
Let \(g_i\) be the total number of games played in the first \(i\) days, for \(i = 1, 2, \dots, 30\). Then
\[1 \leq g_1 < g_2 < \cdots < g_{30} \leq 45\]
because at least one game is played each day. Consider also the 30 numbers
\[g_1 + 14,\ g_2 + 14,\ \dots,\ g_{30} + 14,\]
which satisfy \(15 \leq g_1 + 14 < \cdots < g_{30} + 14 \leq 59\). Thus we have 60 integers
\[g_1, \dots, g_{30},\ g_1 + 14, \dots, g_{30} + 14\]
all lying in the set \(\{1, 2, \dots, 59\}\) of size 59. By the pigeonhole principle, two of these 60 integers are equal. Since the \(g_i\) are strictly increasing, no equality can occur among the \(g_i\) themselves, and likewise no equality can occur among the \(g_i + 14\) themselves. Therefore we must have
\[g_j = g_i + 14\]
for some \(i, j \in \{1, \dots, 30\}\). Then the number of games played from day \(i+1\) through day \(j\) is
\[g_j - g_i = 14,\]
so there is a period of consecutive days during which exactly 14 games are played.
First, we note that two integers have a difference that is divisible by 3 if and only if they are congruent modulo 3 (have the same remainder when divided by 3). Now, the set \(S\) can be partitioned into three sets based on their congruence class modulo 3. By the pigeonhole principle, if we select 4 numbers from \(S\), at least two of them must belong to the same congruence class. These two will have difference that is divisible by 3. Note that 4 is the minimum number of selections that guarantees this, since it is possible to select 3 numbers where no two of them have difference divisible by 3 (select one from each congruence class).
§43 — Introduction to Graph Theory
Epp 4th ed. pp. 625–660 · 5th ed. (metric) pp. 677–697. Lecture 33 (week 12).
Problems
For each of the following, state whether or not there exists a simple graph with the stated number of vertices and degrees. Draw the graph, or explain why one does not exist.
Five vertices with degrees 3, 3, 2, 2, 2.
Seven vertices with degrees 4, 2, 3, 1, 1, 1, 1.
Five vertices with degrees 5, 4, 3, 1, 1.
A graph has 10 edges and 6 vertices. Five of the vertices have degree 3. What is the degree of the remaining vertex?
Let \(n\) be a positive integer and let \(K_n\) be the complete graph with \(n\) vertices. How many edges does \(K_n\) have?
A graph has 27 edges and every vertex has degree 2, 3 or 4. If there are 7 vertices that have degree 4 and 4 vertices that have degree 3, then how many vertices of degree 2 are there?
Solutions
- Yes, such a simple graph exists. One drawing has vertices \(a, b, c, d, e\) and the six edges
\[ab,\quad ac,\quad ad,\quad bc,\quad be,\quad de,\]
giving \(\deg(a) = 3\), \(\deg(b) = 3\), \(\deg(c) = 2\), \(\deg(d) = 2\), \(\deg(e) = 2\) as required.
- No such graph exists. If the degrees are 4, 2, 3, 1, 1, 1, 1, then the sum of degrees is
\[4 + 2 + 3 + 1 + 1 + 1 + 1 = 13,\]
which is odd. Remember (by the Handshake Theorem) that the sum of the degrees in any graph equals twice the number of edges, and so is always even. So such a graph cannot exist.
- No such graph exists. In a simple graph on 5 vertices, the largest possible degree is 4, but the sequence contains a vertex of degree 5, which is impossible. So there is no such simple graph.
Since the graph has 10 edges, the sum of all the degrees is \(2 \cdot 10 = 20\). If five vertices have degree 3, the sum of their degrees is \(5 \cdot 3 = 15\), so the remaining vertex has degree
\[20 - 15 = 5.\]
In \(K_n\), an edge is determined by choosing 2 distinct vertices, so the number of edges is
\[\binom{n}{2} = \frac{n(n-1)}{2}.\]
Let \(x\) be the number of vertices of degree 2. Since the graph has 27 edges, the sum of degrees is \(2 \cdot 27 = 54\). Given that there are seven vertices of degree 4 and four vertices of degree 3, and all other vertices have degree 2, we have
\[2x + 4 \cdot 7 + 3 \cdot 4 = 54.\]
This means \(x = 7\).
§44 — Walks, Trails and Circuits
Epp 4th ed. pp. 625–660 · 5th ed. (metric) pp. 677–697. Lecture 34 (week 12).
Problems
Let \(G\) and \(H\) be the graphs below.
\(G\) has vertex set \(\{v_1, v_2, v_3, v_4, v_5\}\) and is drawn with a loop at \(v_2\), a loop at \(v_5\), and two parallel edges between \(v_1\) and \(v_2\). Its degree sequence is
\[\deg(v_1) = 4,\quad \deg(v_2) = 6,\quad \deg(v_3) = 4,\quad \deg(v_4) = 2,\quad \deg(v_5) = 4,\]
so \(G\) is connected with 10 edges.
\(H\) has vertex set \(\{v_1, v_2, v_3, v_4, v_5\}\) and is a simple connected graph drawn as the 4-cycle \(v_1 v_2 v_3 v_4 v_1\) with a single pendant edge \(v_3 v_5\), giving degrees
\[\deg(v_1) = 2,\quad \deg(v_2) = 2,\quad \deg(v_3) = 3,\quad \deg(v_4) = 2,\quad \deg(v_5) = 1.\]
For each of the following statements, explain why it is true or false.
\(G\) is a simple graph.
The sum of the degrees of the vertices of \(G\) is 18.
\(G\) contains an Euler circuit.
\(H\) contains an Euler trail.
Does the following graph contain an Euler circuit? (The graph shown is connected and has exactly two vertices of degree 3.)
Let \(G\) be a simple, connected, Eulerian graph with eight vertices and let \(e\) be the number of edges in \(G\). Prove that \(8 \leq e \leq 24\).
Solutions
This statement is false. The graph \(G\) has loops (at \(v_2\) and \(v_5\)) and it also has multiple edges between \(v_1\) and \(v_2\), so \(G\) is not simple.
This statement is false. A loop contributes 2 to the degree, so we have
\[\deg(v_1) = 4,\quad \deg(v_2) = 6,\quad \deg(v_3) = 4,\quad \deg(v_4) = 2,\quad \deg(v_5) = 4,\]
and thus the sum of the degrees is \(4 + 6 + 4 + 2 + 4 = 20 \neq 18\).
This statement is true. The graph \(G\) is connected and every vertex has even degree (as computed above), so \(G\) contains an Euler circuit.
This statement is true. In \(H\), the degrees are
\[\deg(v_1) = 2,\ \deg(v_2) = 2,\ \deg(v_4) = 2,\ \deg(v_3) = 3,\ \deg(v_5) = 1,\]
so exactly two vertices have odd degree (namely \(v_3\) and \(v_5\)). Therefore \(H\) has an Euler trail (starting at one of \(v_3\), \(v_5\) and ending at the other).
No. The graph is connected, but has two vertices of degree 3, so not all vertices have even degree. Hence there is no Euler circuit.
Since \(G\) is connected and Eulerian, every vertex has even degree, and (because \(G\) is simple and connected with 8 vertices) each vertex has degree at least 2. Hence
\[2e = \sum_{v} \deg(v) \geq 8 \cdot 2 = 16,\]
so \(e \geq 8\). Moreover, in a simple graph on 8 vertices we have \(\deg(v) \leq 7\), and because \(G\) is Eulerian all degrees are even, so in fact \(\deg(v) \leq 6\) for every vertex. Therefore
\[2e = \sum_{v} \deg(v) \leq 8 \cdot 6 = 48,\]
so \(e \leq 24\). Hence \(8 \leq e \leq 24\). \(\square\)
§45 — Matrix Representations of Graphs
Epp 4th ed. pp. 661–675 · 5th ed. (metric) pp. 698–712. Lecture 35 (week 13).
Problems
Let \(G\) be the graph with vertex set \(\{v_1, v_2, v_3, v_4\}\) and edge set \(\{a,b,c,d,e,f\}\), where the edges are
edge endpoints \(a\) \(v_1 v_2\) \(b\) \(v_2 v_3\) \(c\) \(v_2 v_3\) (parallel to \(b\)) \(d\) \(v_3 v_4\) \(e\) \(v_2 v_4\) \(f\) loop at \(v_4\) Write down an adjacency matrix for \(G\). Make sure you clearly label the rows and columns of your matrix.
Write down an incidence matrix for \(G\). Make sure you clearly label the rows and columns of your matrix.
Does \(G\) have an Euler circuit? If yes, write it out as a sequence of vertices and edges. If not, determine the fewest number of edges that would need to be added to \(G\) to create a new graph that does have an Euler circuit.
Let \(G\) be the graph with the following adjacency matrix.
\[\begin{pmatrix} 0 & 1 & 0 & 0 & 3 \\ 1 & 0 & 2 & 0 & 0 \\ 0 & 2 & 0 & 1 & 1 \\ 0 & 0 & 1 & 0 & 1 \\ 3 & 0 & 1 & 1 & 0 \end{pmatrix}\]
Draw the graph \(G\).
Explain whether or not \(G\) has an Euler circuit or an Euler trail.
Let \(G\) be the graph with the following adjacency matrix.
\[\begin{pmatrix} 0 & 1 & 0 & 1 & 0 & 0 \\ 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 & 1 \\ 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 & 1 & 0 \end{pmatrix}\]
Explain whether or not \(G\) is Eulerian.
Solutions
- The labelled adjacency matrix for \(G\) is
\(v_1\) \(v_2\) \(v_3\) \(v_4\) \(\mathbf{v_1}\) 0 1 0 0 \(\mathbf{v_2}\) 1 0 2 1 \(\mathbf{v_3}\) 0 2 0 1 \(\mathbf{v_4}\) 0 1 1 1 (where the entry 1 on the diagonal at \(v_4\) records the single loop at \(v_4\)).
- The labelled incidence matrix for \(G\) is
\(a\) \(b\) \(c\) \(d\) \(e\) \(f\) \(\mathbf{v_1}\) 1 0 0 0 0 0 \(\mathbf{v_2}\) 1 1 1 0 1 0 \(\mathbf{v_3}\) 0 1 1 1 0 0 \(\mathbf{v_4}\) 0 0 0 1 1 2 (where the entry 2 in the bottom right indicates the loop that is incident twice with \(v_4\)).
- The degrees are
\[\deg(v_1) = 1,\quad \deg(v_2) = 4,\quad \deg(v_3) = 3,\quad \deg(v_4) = 4,\]
so \(G\) does not have an Euler circuit (since \(v_1\) and \(v_3\) have odd degree).
The fewest edges to add to make all degrees even is 1; for example, adding an edge \(g\) between vertices \(v_1\) and \(v_3\) creates a new connected graph in which all of the vertices have even degree.
An example of an Euler circuit in the new graph is
\[v_1,\ a,\ v_2,\ b,\ v_3,\ d,\ v_4,\ f,\ v_4,\ e,\ v_2,\ c,\ v_3,\ g,\ v_1.\]
- Reading the matrix off (with vertices \(v_1, \dots, v_5\) in matrix order), \(G\) has the edges
- \(v_1 v_2\) — a single edge,
- \(v_1 v_5\) — three parallel edges,
- \(v_2 v_3\) — two parallel edges,
- \(v_3 v_4\) — a single edge,
- \(v_3 v_5\) — a single edge,
- \(v_4 v_5\) — a single edge.
- The degrees are
\[\deg(v_1) = 4,\ \deg(v_2) = 3,\ \deg(v_3) = 4,\ \deg(v_4) = 2,\ \deg(v_5) = 5,\]
so there is no Euler circuit (since \(v_2\) and \(v_5\) have odd degree), but there is an Euler trail (exactly two odd-degree vertices) from \(v_2\) to \(v_5\).
Let the vertices be \(v_1, v_2, v_3, v_4, v_5, v_6\) in the order of the matrix. Reading the matrix off, \(G\) has edges
\[v_1 v_2,\quad v_1 v_4,\quad v_2 v_4,\quad v_3 v_5,\quad v_3 v_6,\quad v_5 v_6,\]
that is, two disjoint triangles: one on \(\{v_1, v_2, v_4\}\) and one on \(\{v_3, v_5, v_6\}\).
The graph is not connected (e.g. there is no walk from vertex \(v_1\) to vertex \(v_3\)). Hence \(G\) is not Eulerian.
(Errata note: the source document’s solution to 1(b) was corrected on 11 August 2026 — the note in brackets had previously copied the note from 1(a). The corrected note is the one given above.)
§46 — Trees
Epp 4th ed. pp. 683–701 · 5th ed. (metric) pp. 720–742. Lecture 36 (week 13).
Problems
A tree has 11 vertices, of which exactly four vertices have degree 1 and exactly one vertex has degree 4. Determine the degrees of the remaining six vertices.
Let \(T\) be a tree with \(p\) vertices, where \(p \geq 11\). Suppose \(T\) has precisely six vertices of degree 1 and precisely four vertices of degree 3. Determine the degree of each of the remaining \(p - 10\) vertices of \(T\).
Let \(T\) be a tree on 12 vertices. Suppose \(T\) has exactly three vertices of degree 3 and each of the remaining vertices has degree 1 or 5. Using theorems that were given in lectures, determine the number of vertices of degree 5.
Two trees with the same vertex set \(\{1, 2, \dots, n\}\) are distinct if their edge sets are not equal. Use mathematical induction to prove that for each integer \(n \geq 2\), the number of distinct trees with vertex set \(\{1, 2, \dots, n\}\) is at least \((n-1)!\).
Solutions
A tree with 11 vertices has \(e = 10\) edges, so by the Handshake Theorem, the sum of degrees is \(2e = 20\). We are given that exactly four vertices have degree 1 and exactly one vertex has degree 4. Let \(v_1, v_2, \dots, v_6\) be the remaining vertices whose degrees are to be determined. We have
\[\begin{aligned} \sum_{i=1}^{6} \deg(v_i) + 4 \cdot 1 + 1 \cdot 4 &= 20 \\ \sum_{i=1}^{6} \deg(v_i) &= 12. \end{aligned}\]
None of these six vertices \(v_1, v_2, \dots, v_6\) can have degree 1 (since there are exactly four vertices of degree 1, already accounted for). Hence each has degree at least 2. Because six vertices of degree at least 2 have total degree 12, each must have degree exactly 2.
Thus the remaining six vertices all have degree 2.
\(T\) is a tree with \(p\) vertices and so must have \(p-1\) edges. Now by the Handshake Theorem we know
\[2(p-1) = \sum_{i=1}^{p} \deg(v_i).\]
Using the known degrees we can write this as
\[\begin{aligned} 2(p-1) &= 6 \cdot 1 + 4 \cdot 3 + \sum_{i=1}^{p-10} \deg(v_i) \\ 2(p-1) &= 18 + \sum_{i=1}^{p-10} \deg(v_i) \\ 2p - 2 - 18 &= \sum_{i=1}^{p-10} \deg(v_i) \\ 2(p-10) &= \sum_{i=1}^{p-10} \deg(v_i). \end{aligned}\]
Rewriting the final line as
\[\frac{\sum_{i=1}^{p-10} \deg(v_i)}{p-10} = 2, \qquad \text{i.e.} \qquad \frac{\deg(v_1) + \deg(v_2) + \cdots + \deg(v_{p-10})}{p-10} = 2,\]
we see that the average degree of the remaining \(p-10\) vertices is 2. However, we know that there are no more vertices of degree 1. Thus each of the remaining \(p-10\) vertices must have degree exactly 2.
Let \(x\) be the number of vertices of degree 5 and \(y\) the number of vertices of degree 1. Then, because the tree has 12 vertices, we have
\[x + y + 3 = 12.\]
This simplifies to give \(x + y = 9\).
Now, since \(T\) is a tree on 12 vertices, it must have \(e = 11\) edges. By the Handshake Theorem, the sum of degrees is \(2e = 22\), so
\[3 \cdot 3 + 5x + 1 \cdot y = 22.\]
This simplifies to give \(5x + y = 13\).
Subtracting \(x + y = 9\) from \(5x + y = 13\) gives \(4x = 4\), hence \(x = 1\). Therefore there is exactly one vertex of degree 5.
We prove by induction that the number of distinct trees with vertex set \(\{1, 2, \dots, n\}\) is at least \((n-1)!\).
Basis: let \(n = 2\). Here \((n-1)! = (2-1)! = 1\). There is exactly one tree on \(\{1,2\}\), namely the single edge \(\{1,2\}\). So the base case is true.
Inductive hypothesis. Suppose \(k \geq 2\) is an integer and there are at least \((k-1)!\) distinct trees on \(\{1, 2, \dots, k\}\).
Now consider \(n = k+1\). We aim to show that there are at least \(k!\) distinct trees on vertex set \(\{1, 2, \dots, k, k+1\}\).
Let \(T\) be a tree on vertex set \(\{1, 2, \dots, k\}\). For any choice of \(m \in \{1, 2, \dots, k\}\), we form a graph \(T_m\) on vertex set \(\{1, 2, \dots, k, k+1\}\) as follows: start with tree \(T\), add a new vertex \(k+1\), and the edge \(\{k+1, m\}\).
Note that \(T_m\) is connected (since \(k+1\) is joined to \(m\), and \(T\) was connected). Also, \(T_m\) has no circuit because \(T\) is a tree and adding a new leaf does not create a circuit. Thus \(T_m\) is a tree. Moreover, different choices of \(m\) give rise to distinct trees \(T_m\), because their edge sets are different.
By the inductive hypothesis, there are at least \((k-1)!\) choices for the tree \(T\). Since there are \(k\) choices for the vertex \(m\), there are at least \(k \cdot (k-1)! = k!\) trees \(T_m\) on vertex set \(\{1, 2, \dots, k+1\}\).
By the principle of mathematical induction, this completes the proof. \(\square\)
See also
- math1061 — assessment weights and the full lecture schedule
- Logic: logical-connectives · logical-equivalence-laws · conditional-statements · valid-argument-forms · determining-argument-validity · quantified-statements
- Number theory and proof: proof-techniques · rational-and-irrational-numbers · divisibility-and-factorisation · modular-arithmetic · gcd-lcm-and-euclidean-algorithm
- Graph theory (§43–§46): graphs · walks-trails-and-circuits · euler-circuits-and-trails · adjacency-matrices · incidence-matrices · trees
Proof Techniques — Direct, Counterexample, Contradiction, Contraposition
The four methods for establishing (or demolishing) a statement of the form \(\forall x \in D, P(x) \to Q(x)\), plus the definitions every proof in this course is expected to unfold.
Definitions to prove from
Proofs are written by demonstrating facts using the definitions — so these have to be at your fingertips. Each is a biconditional: it can be used in either direction.
| Term | Definition |
|---|---|
| \(n\) is even | \(n = 2k\) for some integer \(k\) |
| \(n\) is odd | \(n = 2k + 1\) for some integer \(k\) (equivalently \(n = 2k - 1\) for some integer \(k\)) |
| \(n\) is prime | \(n \in \mathbb{Z}\), \(n > 1\), and \(\forall r, s \in \mathbb{Z}^+\), if \(n = rs\) then (\(r = 1\) and \(s = n\)) or (\(r = n\) and \(s = 1\)) |
| \(n\) is composite | \(n \in \mathbb{Z}\), \(n > 1\), and \(\exists r, s \in \mathbb{Z}^+\) such that \(n = rs\) and \(1 < r < n\) and \(1 < s < n\) |
| \(r\) is rational | \(\exists a, b \in \mathbb{Z}\) such that \(r = \frac{a}{b}\) and \(b \neq 0\) |
| \(d \mid n\) | \(d \neq 0\) and \(n = dk\) for some integer \(k\) |
Two facts used constantly, and worth naming explicitly when you lean on them:
- Fact: the sum, difference, and product of integers is an integer.
- Fact: every integer is either even or odd.
Parity
Almost every early proof in this course turns on whether something is even or odd, so the consequences of those two definitions are worth having ready rather than re-deriving:
| Result | |
|---|---|
| \(\text{even} + \text{even}\), \(\text{odd} + \text{odd}\) | even |
| \(\text{even} + \text{odd}\) | odd |
| \(\text{even} \times\) anything | even |
| \(\text{odd} \times \text{odd}\) | odd |
| consecutive integers | opposite parity — so two integers two apart share their parity |
Each row follows from the two definitions by a one-line substitution. Subtraction behaves like addition throughout, since \(m - n\) and \(m + n\) differ by \(2n\).
The “two apart” row is the whole content of the warm-up in 2026-07-27-welcome-and-intro-problems, where consecutive \(p < q < r\) forces \(p + r\) to be even and \(r - p\) to be exactly \(2\), while \(pr\) is free to be either.
Prime vs. not-prime. For \(n \in \mathbb{Z}^{>1}\), “\(n\) is not prime” means “\(n\) is composite”. For \(n \in \mathbb{Z}\) generally, “\(n\) is not prime” means “\(n\) is composite or \(n \leq 1\)” — the integers split into \(\mathbb{Z}^{\leq 1}\), \(\mathbb{Z}^{\text{prime}}\), and \(\mathbb{Z}^{\text{composite}}\), and \(1\) and everything below it is in none of the latter two. This is why \(n = 1\) is the standard counterexample to “every positive integer is prime or composite”.
Warning: don’t assume something that seems like an “obvious fact” until you have proven it, or can name the lecture or pre-work video it was proved in.
The four methods
All four target \(\forall x \in D, P(x) \to Q(x)\). Recall the truth table for \(p \to q\) — the only row that makes it false is \(p\) true, \(q\) false:
| \(p\) | \(q\) | \(p \to q\) |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | T |
| F | F | T |
Every method below is a different way of attacking that one row.
Figure 34: The skeletons of the four methods for a statement of the form ∀x ∈ D, P(x) → Q(x). Three of the four establish the statement and one demolishes it, which is what the red verdict lines record.
Direct proof (shows the statement is true)
Let \(x \in D\) and suppose \(P(x)\). \(\dots\) Hence \(Q(x)\). \(\square\)
Why suppose \(P(x)\) is true, when \(P(x) \to Q(x)\) holds anyway if \(P(x)\) is false? Because the only case that could make the statement false is \(P(x)\) true and \(Q(x)\) false. Ruling that out is the whole job — the \(P(x)\)-false rows are true for free.
Disproof by counterexample (shows the statement is false)
Let \(x = \cdots\). Then \(x \in D\) and \(P(x)\) is true. However, \(Q(x)\) is false. So \(x\) is a counterexample and the statement is false.
A counterexample to \(p \to q\) needs \(p\) true and \(q\) false — a value where the hypothesis fails proves nothing.
Proof by contradiction (shows the statement is true)
Suppose the negation of \(\forall x \in D, P(x) \to Q(x)\) is true. That is, suppose \(\exists x \in D\) such that \(P(x)\) is true but \(Q(x)\) is false. \(\dots\) Hence something that is obviously wrong, like \(P(x)\) is false, or \(Q(x)\) is true, or \(1 = 0\). This is a contradiction, and we conclude that \(\forall x \in D, P(x) \to Q(x)\) is true. \(\square\)
The set-up comes straight from quantified-statements: the negation of \(\forall x \in D, P(x) \to Q(x)\) is \(\exists x \in D\) such that \(P(x) \land \sim Q(x)\).
Useful negations to have ready (see logical-equivalence-laws):
\[\sim(p \lor q) \equiv \sim p \land \sim q \qquad \sim(p \land q) \equiv \sim p \lor \sim q \qquad \sim(p \to q) \equiv p \land \sim q\]
Proof by contraposition (shows the statement is true)
We prove the contrapositive of \(\forall x \in D, P(x) \to Q(x)\), namely that \(\forall x \in D, \sim Q(x) \to \sim P(x)\). Let \(x \in D\) and suppose \(\sim Q(x)\). \(\dots\) Hence, \(\sim P(x)\). \(\square\)
This is valid because \(p \to q \equiv \sim q \to \sim p\) (see conditional-statements).
Choosing a method
- Contradiction is the most versatile, but it needs more set-up, so a direct proof is often easier when one is available.
- Contraposition is the natural choice when \(\sim Q(x)\) gives you something concrete to work with and \(P(x)\) doesn’t — typically when the conclusion is a negative statement (“\(r\) is irrational”, “\(n\) is odd”) whose negation is a definition you can expand.
- Contradiction vs. contraposition: a contraposition proof is a contradiction proof that never actually needs the assumption \(P(x)\) — you derive \(\sim P(x)\) from \(\sim Q(x)\) alone. If your “contradiction” proof only ever uses the \(\sim Q(x)\) half of the assumption, write it as a contraposition instead.
- Counterexample vs. contradiction: counterexample is a disproof, contradiction is a proof. They are not variants of each other.
Worked comparisons on the same statements live in the lecture notes: 2026-08-13-proof-by-contradiction proves \(\forall n \in \mathbb{Z}\), if \(n\) is odd then \(3n+2\) is odd both directly and by contradiction, and 2026-08-13-proof-by-contraposition works through statements where one method gets stuck and another doesn’t.
Worked examples
Direct proof
\(\forall n \in \mathbb{Z}\), if \(n\) is odd then \(3n + 2\) is odd.
Let \(n \in \mathbb{Z}\) and suppose \(n\) is odd. Then \(n = 2k + 1\) for some \(k \in \mathbb{Z}\). Now \[3n + 2 = 3(2k+1) + 2 = 6k + 5 = 2(3k + 2) + 1.\] Since \(k \in \mathbb{Z}\), we have \(3k + 2 \in \mathbb{Z}\), and hence \(3n + 2\) is odd. \(\square\)
For any integer \(x\), if \(x + 6 = 4y\) for some integer \(y\), then \(\frac{x}{2}\) is an odd integer.
Let \(x \in \mathbb{Z}\) and suppose \(x + 6 = 4y\) for some \(y \in \mathbb{Z}\). Then \(x = 4y - 6 = 2(2y - 3)\), so \[\frac{x}{2} = \frac{2(2y-3)}{2} = 2y - 3 = 2(y - 1) - 1.\] Since \(y \in \mathbb{Z}\) we have \(2y - 3 \in \mathbb{Z}\), so \(\frac{x}{2} \in \mathbb{Z}\); and \(y - 1 \in \mathbb{Z}\), so by definition \(\frac{x}{2}\) is odd. \(\square\)
The sum of any pair of even integers is even.
Let \(m, n \in \mathbb{Z}\) be even. Then \(m = 2k\) and \(n = 2\ell\) for some \(k, \ell \in \mathbb{Z}\). Hence \(m + n = 2k + 2\ell = 2(k + \ell)\), which is even. \(\square\)
\(\forall n \in \mathbb{Z}^+\), if \(n \geq 4\) then \(2n^2 - 5n + 2\) is composite.
Suppose \(n \in \mathbb{Z}^+\) and \(n \geq 4\). Factor \(2n^2 - 5n + 2 = (2n - 1)(n - 2)\). Since \(n \geq 4\), we have \(2n - 1 \geq 7\) and \(n - 2 \geq 2\), so both factors are integers greater than \(1\). Hence the expression is composite. \(\square\)
Disproof by counterexample
- For all integers \(m\) and \(n\), if \(2m + n\) is odd then \(m\) and \(n\) are both odd. Counterexample \(m = 4, n = 5\): \(2(4) + 5 = 13\) is odd, but \(m\) is even. (Not \(m=3, n=5\) — there the conclusion holds; not \(m=3,n=6\) or \(m=4,n=6\) — there the hypothesis fails.)
- \(\forall n \in \mathbb{Z}^{\geq 2}\), \(n\) is composite or \(n + 1\) is composite. Take \(n = 2\): both \(2\) and \(3\) are prime.
- For each integer \(n \geq 2\), the product of the first \(n\) primes minus \(1\) is prime. Take \(n = 4\): \(2 \cdot 3 \cdot 5 \cdot 7 - 1 = 209 = 11 \cdot 19\), composite.
- \(\forall x, y \in \mathbb{R}\), if \(y^2 > x^2\) then \(y > x\). Take \(x = 1, y = -2\): \(4 > 1\) but \(-2 \not> 1\).
- \(\forall x \in \mathbb{R}, \lfloor x^2 \rfloor = \lfloor x \rfloor^2\). Take \(x = \frac{3}{2}\): \(\lfloor \frac{9}{4} \rfloor = 2\) but \(\lfloor \frac{3}{2} \rfloor^2 = 1\). (See modular-arithmetic for the floor function.)
Disproof by proving the negation
When the statement to disprove is existential, a single counterexample isn’t available — you must prove the universal negation.
\(\exists n \in \mathbb{Z}^+\) such that \(n^2 + 5n + 6\) is prime. This is false; the negation is \(\forall n \in \mathbb{Z}^+\), \(n^2 + 5n + 6\) is composite.
Let \(n \in \mathbb{Z}^+\). Now \(n^2 + 5n + 6 = (n+2)(n+3)\). Since \(n \geq 1\) we have \(n + 2 > 1\) and \(n + 3 > 1\), so \(n^2 + 5n + 6\) is composite. \(\square\)
(Because \(n \geq 1\) forces \(n^2 + 5n + 6 \geq 2\), “not prime” here does mean “composite”.)
There is an even integer \(n\) such that \(5n - 4\) is prime. False; prove \(\forall n \in \mathbb{Z}^{\text{even}}\), \(5n - 4\) is not prime.
Suppose \(n\) is even, so \(n = 2k\) for some \(k \in \mathbb{Z}\). Then \(5n - 4 = 10k - 4 = 2(5k - 2)\), which is even. The only even prime is \(2\); if \(2(5k-2) = 2\) then \(k = \frac{3}{5} \notin \mathbb{Z}\). Therefore \(5n - 4\) is not prime. \(\square\)
Proof by contradiction
\(\forall m, n \in \mathbb{Z}\), if \(mn\) is even, then \(m\) is even or \(n\) is even.
Suppose \(\exists m, n \in \mathbb{Z}\) such that \(mn\) is even and both \(m\) and \(n\) are odd. Since \(m\) is odd, \(m = 2k+1\) for some \(k \in \mathbb{Z}\); since \(n\) is odd, \(n = 2\ell + 1\) for some \(\ell \in \mathbb{Z}\) — a new variable, since \(m\) and \(n\) need not be equal. Now \[mn = (2k+1)(2\ell+1) = 4k\ell + 2k + 2\ell + 1 = 2(2k\ell + k + \ell) + 1.\] Since \(k, \ell \in \mathbb{Z}\), \(2k\ell + k + \ell \in \mathbb{Z}\), so \(mn\) is odd. It is impossible for \(mn\) to be both even and odd, a contradiction. Therefore the original statement is true. \(\square\)
\(\forall n \in \mathbb{Z}\), if \(3n^3 - 2\) is odd, then \(n\) is odd.
Suppose the statement is false: \(\exists n \in \mathbb{Z}\) such that \(3n^3 - 2\) is odd and \(n\) is even. Since \(n\) is even, \(n = 2a\) for some \(a \in \mathbb{Z}\). Then \[3n^3 - 2 = 3(2a)^3 - 2 = 24a^3 - 2 = 2(12a^3 - 1).\] Since \(a \in \mathbb{Z}\), \(12a^3 - 1 \in \mathbb{Z}\), so \(3n^3 - 2\) is even — a contradiction. Therefore the original statement is true. \(\square\)
\(\forall m, n \in \mathbb{Z}\), if \(m + n\) is even, then \(m\) and \(n\) are both even or both odd.
Suppose the statement is false. Then \(\exists m, n \in \mathbb{Z}\) such that \(m + n\) is even but exactly one of \(m, n\) is even. Without loss of generality, assume \(m\) is even and \(n\) is odd — the other case (\(m\) odd, \(n\) even) follows because \(m + n = n + m\). Thus \(m = 2a\) for some \(a \in \mathbb{Z}\) and \(n = 2b + 1\) for some \(b \in \mathbb{Z}\). Now \(m + n = 2a + 2b + 1 = 2(a + b) + 1\), and \(a + b \in \mathbb{Z}\), so \(m + n\) is odd. This contradicts the assumption that \(m + n\) is even. Therefore the original statement is true. \(\square\)
For integers \(a\) and \(b\), if \(6a + 3b\) is odd, then \(b\) is odd.
Suppose there exist integers \(a, b\) with \(6a + 3b\) odd and \(b\) even. Then \(b = 2k\) for some \(k \in \mathbb{Z}\), so \(6a + 3b = 6a + 6k = 2(3a + 3k)\), which is even — contradicting that \(6a + 3b\) is odd. \(\square\)
For all positive integers \(x\) and \(y\), \(x^2 - y^2 \neq 1\).
Suppose \(x, y \in \mathbb{Z}^+\) with \(x^2 - y^2 = 1\). Factoring, \(1 = (x-y)(x+y)\). Since \(x, y\) are positive integers we must have \(x - y = 1\) and \(x + y = 1\), so \(2x = 2\) and \(x = 1\); then \(y = 0\), which is not a positive integer — a contradiction. \(\square\)
Proof by contraposition
\(\forall r \in \mathbb{R}\), if \(r^2\) is irrational, then \(r\) is irrational.
We prove the contrapositive: \(\forall r \in \mathbb{R}\), if \(r \in \mathbb{Q}\) then \(r^2 \in \mathbb{Q}\). Suppose \(r \in \mathbb{R}\) with \(r \in \mathbb{Q}\). Then \(r = \frac{a}{b}\) for some \(a, b \in \mathbb{Z}\) with \(b \neq 0\). Now \(r^2 = \frac{a^2}{b^2}\). Since \(a, b \in \mathbb{Z}\) we have \(a^2, b^2 \in \mathbb{Z}\), and \(b^2 \neq 0\) since \(b \neq 0\). So \(r^2 \in \mathbb{Q}\). \(\square\)
\(\forall m, n \in \mathbb{Z}\), if \(mn\) is odd, then \(m\) and \(n\) are both odd.
We prove the contrapositive: \(\forall m, n \in \mathbb{Z}\), if at least one of \(m, n\) is even then \(mn\) is even. Without loss of generality, assume \(m\) is even, so \(m = 2k\) for some \(k \in \mathbb{Z}\). Now \(mn = (2k)n = 2(kn)\), and \(kn \in \mathbb{Z}\), so \(mn\) is even. \(\square\)
For all integers \(a\) and \(b\), if \((ab)^2\) is odd then \(a\) is odd and \(b\) is odd.
Contrapositive: if \(a\) is even or \(b\) is even, then \((ab)^2\) is even. WLOG suppose \(a\) is even, so \(a = 2k\) for some \(k \in \mathbb{Z}\). Then \(ab = 2kb\) and \((ab)^2 = 4k^2b^2 = 2(2k^2b^2)\). Since \(k, b \in \mathbb{Z}\), \(2k^2b^2 \in \mathbb{Z}\), so \((ab)^2\) is even. \(\square\)
For all integers \(x\) and \(y\), if \(x^2(y^2 - 2y)\) is odd then \(x\) and \(y\) are odd.
Contrapositive: if \(x\) is even or \(y\) is even, then \(x^2(y^2 - 2y)\) is even. Here the two cases need separate treatment.
Case 1: \(x\) even. \(x = 2k\) for some \(k \in \mathbb{Z}\), so \(x^2(y^2-2y) = 4k^2(y^2-2y) = 2\big(2k^2(y^2-2y)\big)\), and \(2k^2(y^2-2y) \in \mathbb{Z}\).
Case 2: \(y\) even. \(y = 2\ell\) for some \(\ell \in \mathbb{Z}\), so \(x^2(y^2-2y) = x^2\big(4\ell^2 - 4\ell\big) = 2\big(x^2(2\ell^2 - 2\ell)\big)\), and \(x^2(2\ell^2-2\ell) \in \mathbb{Z}\).
In both cases \(x^2(y^2-2y)\) is even. \(\square\)
For any integer \(n\), \(n^2\) is odd if and only if \(n\) is odd. A biconditional needs both directions, and they want different methods:
(\(\Leftarrow\), direct) Suppose \(n\) is odd, so \(n = 2k+1\). Then \(n^2 = 4k^2 + 4k + 1 = 2(2k^2 + 2k) + 1\) is odd.
(\(\Rightarrow\), contraposition) The contrapositive is: if \(n\) is even then \(n^2\) is even. Suppose \(n = 2k\). Then \(n^2 = 4k^2 = 2(2k^2)\) is even. \(\square\)
This lemma — for all integers \(n\), if \(n^2\) is even then \(n\) is even — is used in the proof that \(\sqrt{2}\) is irrational (see rational-and-irrational-numbers).
Common proof errors
The course explicitly tests spotting these. The seven below are the list given with the practice problems’ §9 Q3 (see practice-problems, where the four proofs you are asked to find the errors in are worked):
- Arguing from examples — a single example never establishes a universal statement. (“\(\forall x \in \mathbb{R}, \exists y \in \mathbb{R}\) s.t. \(xy = 1\). Proof: if \(x = 10\) take \(y = \frac{1}{10}\).” Not a proof — and the statement is false, since \(x = 0\) has no such \(y\).)
- Using the same variable to mean two different things — “let \(m = 2k+1\) and \(n = 2k\)” only proves the case \(m = n + 1\). Use a fresh variable for each quantity.
- Jumping to the conclusion — writing down the definition you need to satisfy and then asserting it holds, without exhibiting the witnesses.
- Assuming what is to be proved — starting from “\(4a + 2b = 2\ell\)” and manipulating both sides assumes the conclusion. Derive the conclusion; don’t begin with it.
- Confusion between what is known and what is to be shown.
- Use of the word any instead of some.
- Misuse of the word if.
One more, not on that list: forgetting to state your assumptions, or forgetting to say where a variable lives (“for some \(r, s \in \mathbb{Z}\)”). Introduce every existential witness with its domain.
See also
- quantified-statements — the negations these proofs are built on
- conditional-statements · logical-equivalence-laws
- 2026-07-27-welcome-and-intro-problems — the parity warm-up, the course’s first proof-shaped problem
- proving-set-properties — the element method, and these techniques applied to sets
- rational-and-irrational-numbers · divisibility-and-factorisation
- practice-problems — §9 Direct Proofs and Counterexamples, with full worked solutions
- practice-problems — §10 Proof by Contradiction, with full worked solutions
- practice-problems — §11 Proof by Contraposition, with full worked solutions
Reflexive, Symmetric and Transitive Relations
The three properties a relation on a single set can have, what each looks like in an arrow diagram, and how to prove or disprove each one. Relations themselves are defined in relations-on-sets. The lecture is 2026-09-17-relations-reflexivity-symmetry-transitivity.
The definitions
A relation \(\rho\) on a set \(A\) is
(1) reflexive if and only if \(\forall x \in A,\ x \mathrel{\rho} x\).
(2) symmetric if and only if \(\forall x, y \in A,\ x \mathrel{\rho} y \to y \mathrel{\rho} x\).
(3) transitive if and only if \(\forall x, y, z \in A,\ (x \mathrel{\rho} y \text{ and } y \mathrel{\rho} z) \to x \mathrel{\rho} z\).
In the arrow diagram:
- reflexive — every dot has a loop;
- symmetric — every arrow has a return arrow;
- transitive — every path of two arrows has a direct arrow from its start to its end, the short cut.
A relation fails a property when the diagram contains one of the patterns in Figure 35. Each is a witness — one specific element, pair or triple. Nothing more is needed to disprove a “for all”.
Figure 35: What a failure of each property looks like; any one such pattern in a diagram disproves the property. Not reflexive: one element without a loop. Not symmetric: one arrow whose return is missing. Not transitive: one path of two arrows whose short cut is missing. The fourth panel is the not-transitive pattern with \(z = x\): a round trip \(x \to y \to x\) needs the short cut \(x \to x\), a loop, so two elements joined both ways but without loops already break transitivity. The missing arrows are dashed.
Reading the definitions carefully
Reflexive is about every element. “\(\forall x \in A\)” means a single element without a loop is enough to make a relation not reflexive, even if every other element has one. Disjointness, \(X \mathrel{\rho} Y \leftrightarrow X \cap Y = \emptyset\) on \(\mathcal{P}(\mathbb{Z}^{+})\), is not reflexive, though \(\emptyset \mathrel{\rho} \emptyset\) holds.
Symmetric and transitive are conditional. They say what must happen if certain arrows are present. Where those arrows are absent, the condition holds automatically, by vacuous truth (conditional-statements). This is why a relation with very few arrows can be symmetric and transitive. The empty relation on any set is both, and so is \(\{(1,1)\}\) on \(\{1,2\}\).
\(x\), \(y\), \(z\) need not be different. In the transitive condition, \(z\) may equal \(x\). Then it reads: if \(x \mathrel{\rho} y\) and \(y \mathrel{\rho} x\), then \(x \mathrel{\rho} x\). In a transitive relation, any two elements related both ways both have loops. Three of the transitivity counterexamples in 2026-09-17-relations-reflexivity-symmetry-transitivity use exactly this: \(\{1\}\) and \(\{2\}\) are disjoint both ways but \(\{1\}\) is not disjoint from itself; in Diagram 1 \(b \to a \to b\) exists but the loop at \(b\) does not; and for \(xy \equiv 1 \pmod 7\), \(2 \to 4 \to 2\) exists but \(2 \mathrel{\not\rho} 2\).
Proving and disproving
Each property is a universal statement, so proving it needs a general argument about arbitrary elements, while disproving it needs one witness (quantified-statements, proof-techniques):
| To prove it | To disprove it | |
|---|---|---|
| reflexive | Let \(x \in A\). Show \(x \mathrel{\rho} x\). | Find one \(x \in A\) with \(x \mathrel{\not\rho} x\). |
| symmetric | Let \(x, y \in A\) and suppose \(x \mathrel{\rho} y\). Show \(y \mathrel{\rho} x\). | Find \(x, y \in A\) with \(x \mathrel{\rho} y\) but \(y \mathrel{\not\rho} x\). |
| transitive | Let \(x, y, z \in A\) and suppose \(x \mathrel{\rho} y\) and \(y \mathrel{\rho} z\). Show \(x \mathrel{\rho} z\). | Find \(x, y, z \in A\) with \(x \mathrel{\rho} y\) and \(y \mathrel{\rho} z\) but \(x \mathrel{\not\rho} z\). |
In every proof, unfold the definition of \(\rho\) — turn \(x \mathrel{\rho} y\) into the condition it stands for, work with that, and fold it back up at the end. For a disproof, give specific elements and check each of the stated facts about them.
Worked: \(m \mathrel{\rho} n \leftrightarrow 6 \mid (m - n)\) on \(\mathbb{Z}\)
All three hold. Unfold with the definition of divides (divisibility-and-factorisation): \(m \mathrel{\rho} n\) means \(m - n = 6k\) for some \(k \in \mathbb{Z}\).
- Reflexive. Let \(m \in \mathbb{Z}\). Then \(m - m = 0 = 6 \cdot 0\), so \(6 \mid (m - m)\) and \(m \mathrel{\rho} m\).
- Symmetric. Let \(m, n \in \mathbb{Z}\) with \(m \mathrel{\rho} n\), so \(m - n = 6k\) for some \(k \in \mathbb{Z}\). Then \(n - m = 6(-k)\) and \(-k \in \mathbb{Z}\), so \(6 \mid (n - m)\) and \(n \mathrel{\rho} m\).
- Transitive. Let \(m, n, p \in \mathbb{Z}\) with \(m \mathrel{\rho} n\) and \(n \mathrel{\rho} p\), so \(m - n = 6k\) and \(n - p = 6\ell\) for some \(k, \ell \in \mathbb{Z}\). Adding, \(m - p = 6(k + \ell)\) with \(k + \ell \in \mathbb{Z}\), so \(m \mathrel{\rho} p\).
Its diagram on \(\{0, \dots, 11\}\) is drawn in relations-on-sets. The second divisibility gets a new variable \(\ell\): reusing \(k\) would claim that \(m - n\) and \(n - p\) are the same multiple of 6.
Worked: \(x \mathrel{\rho} y \leftrightarrow x > y\) on \(\mathbb{Z}\)
- Not reflexive. \(0 > 0\) is false, so \(0 \mathrel{\not\rho} 0\).
- Not symmetric. \(1 \mathrel{\rho} 0\) since \(1 > 0\), but \(0 \mathrel{\not\rho} 1\) since \(0 > 1\) is false.
- Transitive. Suppose \(x > y\) and \(y > z\). Then \(x > z\), so \(x \mathrel{\rho} z\).
Worked: divides, on \(\{1, 2, \dots, 6\}\)
\(x \mathrel{\rho} y \leftrightarrow x \mid y\) is reflexive (\(x = x \cdot 1\)), not symmetric (\(1 \mid 2\) but \(2 \nmid 1\)), and transitive: if \(y = xk\) and \(z = y\ell\) then \(z = x(k\ell)\). The diagram shows all three at once.
Figure 36: The relation \(x \mid y\) on \({1, 2, \dots, 6}\), with the numbers placed so every arrow points upward. Reflexive: a loop at every number, since each number divides itself. Not symmetric: no arrow comes back down — \(1 \mid 2\), but \(2 \nmid 1\). Transitive: every two-step path has its short cut, such as \(1 \to 2 \to 4\) with the direct arrow \(1 \to 4\). There are 14 arrows: 6 loops and 8 others.
Checking a finite relation from its diagram
For a relation given as a diagram or a list of pairs:
- Reflexive: look for a loop at every element. Any element without one is the witness.
- Symmetric: for each non-loop arrow, look for its return. Any arrow without one is the witness.
- Transitive: for each arrow \(x \to y\), look at every arrow leaving \(y\), say \(y \to z\), and check that \(x \to z\) is there. Include the paths that come back, \(x \to y \to x\), whose short cut is a loop. This is the slow check, and the round trips are where it usually goes wrong.
The same procedure answers “what must be added to make it reflexive, symmetric, transitive”: the missing loops, the missing returns, and the missing short cuts. For transitivity, keep checking after adding, because a new arrow can create new two-step paths. This is worked on Diagram 1 in 2026-09-17-relations-reflexivity-symmetry-transitivity.
The examples side by side
| Relation | on | Reflexive | Symmetric | Transitive |
|---|---|---|---|---|
| \(X \subset Y\) (proper subset) | \(\mathcal{P}(\{1,2,3\})\) | no | no | yes |
| \(X \cap Y = \emptyset\) | \(\mathcal{P}(\mathbb{Z}^{+})\) | no | yes | no |
| Diagram 1 | \(\{a,b,c,d\}\) | no | no | no |
| \(xy \equiv 1 \pmod 7\) | \(\{0, \dots, 6\}\) | no | yes | no |
| \(\{(1,1)\}\) | \(\{1, 2\}\) | no | yes | yes |
| \(6 \mid (m - n)\) | \(\mathbb{Z}\) | yes | yes | yes |
| \(x > y\) | \(\mathbb{Z}\) | no | no | yes |
| \(x \mid y\) | \(\{1, \dots, 6\}\) | yes | no | yes |
The first five are worked in 2026-09-17-relations-reflexivity-symmetry-transitivity; the other three are worked above. The three properties are independent, and most of the eight combinations appear here. Relations with all three, like \(6 \mid (m - n)\), are equivalence relations (equivalence-relations). Relations like \(x \mid y\) — reflexive and transitive, with no two different elements related both ways — are partial orders (partial-order-relations). Those are the next two topics in the course.
Symmetric and transitive do not make reflexive
Claim. If a relation \(\rho\) on a set \(A\) is both symmetric and transitive, then \(\rho\) is reflexive. — False.
Counterexample. \(A = \{1, 2\}\), \(\rho = \{(1,1)\}\). Symmetric: the only pair is \((1,1)\), whose reverse is itself. Transitive: the only two-step path is \(1 \to 1 \to 1\), whose short cut \((1,1)\) is present. Not reflexive: \(2 \mathrel{\not\rho} 2\).
The tempting “proof” goes: let \(x \in A\); take \(y\) with \(x \mathrel{\rho} y\); by symmetry \(y \mathrel{\rho} x\); by transitivity \(x \mathrel{\rho} x\). Every step is valid except the second. Nothing guarantees there is any \(y\) with \(x \mathrel{\rho} y\). The element 2 in the counterexample is related to nothing, so there is nothing to start the argument from. Adding the missing hypothesis makes the claim true:
If \(\rho\) is symmetric and transitive, and for each \(x \in A\) there is some \(y \in A\) with \(x \mathrel{\rho} y\), then \(\rho\) is reflexive.
The proof is the tempting argument above, now legitimate. The picture is the right-hand panel of 2026-09-17-relations-reflexivity-symmetry-transitivity.
See also
- relations-on-sets — relations as sets of pairs, the notation, arrow diagrams
- equivalence-relations · partial-order-relations — the two kinds of relation built from these properties, the second with antisymmetry in place of symmetry
- quantified-statements · proof-techniques — why a “for all” needs a general argument and its negation needs a witness
- conditional-statements — vacuous truth, which is why sparse relations are often symmetric and transitive
- sets-and-set-notation — the proper-subset relation, and why it has no loops
- 2026-09-17-relations-reflexivity-symmetry-transitivity — Lecture 23
- practice-problems — §30, with full worked solutions
Relations on Sets
A relation records which elements are related to which, and nothing more: any set of ordered pairs. Functions are the special relations with exactly one partner for each input. The properties a relation on one set can have are in reflexive-symmetric-and-transitive-relations. The lecture is 2026-09-17-relations-reflexivity-symmetry-transitivity.
The definition
Any subset \(\rho\) of \(A \times B\) is a binary relation from \(A\) to \(B\).
A relation on a set \(A\) is a binary relation from \(A\) to \(A\), that is, a subset of \(A \times A\).
If \((x, y) \in \rho\) we write \(x \mathrel{\rho} y\) and read it “\(x\) is related in \(\rho\) to \(y\)”. If \((x,y) \notin \rho\) we write \(x \mathrel{\not\rho} y\). The two notations mean exactly the same thing and either is fine in an answer. Relations are usually named with Greek letters: \(\rho\) (rho), \(\sigma\) (sigma), \(\tau\) (tau).
Order matters. \((1,0)\) and \((0,1)\) are different pairs, so \(1 \mathrel{\rho} 0\) and \(0 \mathrel{\rho} 1\) are different statements, and one can hold without the other. The first coordinate is where an arrow starts, and the second is where it ends.
For example, with \(A = \{1,2,3,4\}\) and \(B = \{0,2,4,6,8\}\), \[\rho = \{(1,0), (3,4), (4,0), (4,4), (4,6)\}\] is a relation from \(A\) to \(B\): \(1 \mathrel{\rho} 0\), \(3 \mathrel{\rho} 4\), \(4 \mathrel{\rho} 0\), \(4 \mathrel{\rho} 4\), \(4 \mathrel{\rho} 6\), and nothing else is related.
Functions are relations
The definition of a function (functions-on-general-sets) is the definition of a relation with one extra condition:
A subset \(f\) of \(A \times B\) is a function from \(A\) to \(B\) if for each \(a \in A\), there is a unique \(b \in B\) such that \((a,b) \in f\).
So every function is a relation, and a relation is not necessarily a function. A relation may give an element of \(A\) no partner, or several; a function must give each exactly one. Written as a relation, \(f(a) = b\) is just \(a\,f\,b\), since \(f(a) = b \leftrightarrow (a,b) \in f\).
Figure 37: A relation is a choice of points from the grid \(A \times B\). Each column is an element of \(A\) and each row an element of \(B\), and the filled points are the pairs in the relation. Left: the relation \(\rho\) is any choice of points — column 2 is empty, column 4 has three. Right: a function \(f\) is a choice with exactly one point in every column, the unique \(b\) for each \(a\). Nothing restricts the rows in either: in \(f\), row 4 has two points and rows 6 and 8 have none.
Relations defined by a condition
Listing pairs only works for small finite sets. Usually a relation on \(A\) is defined by a condition on \(x\) and \(y\):
- \(x \mathrel{\rho} y \leftrightarrow x > y\) for all \(x, y \in A\);
- \(X \mathrel{\rho} Y \leftrightarrow X \cap Y = \emptyset\) for all \(X, Y \in A\) (here \(A\) is a set of sets, such as \(\mathcal{P}(\mathbb{Z}^{+})\));
- \(m \mathrel{\rho} n \leftrightarrow 6 \mid (m - n)\) for all \(m, n \in A\);
- \(x \mathrel{\rho} y \leftrightarrow xy \equiv 1 \pmod 7\) on \(\{0, 1, \dots, 6\}\).
To decide whether a particular pair is related, substitute and check. \(5 \mathrel{\rho} 2\) under \(x > y\) because \(5 > 2\), and \(2 \mathrel{\not\rho} 5\). Under \(6 \mid (m-n)\), \(13 \mathrel{\rho} 1\) because \(13 - 1 = 12 = 6 \cdot 2\), and \(13 \mathrel{\not\rho} 2\). The relation is the set of all pairs that pass: \(\rho = \{(x,y) \in A \times A : x > y\}\).
Arrow diagrams
A relation on a finite set is drawn as an arrow diagram, also called a directed graph: one dot per element, and an arrow from \(x\) to \(y\) for each pair \((x,y) \in \rho\). An arrow from an element to itself is a loop. The two drawings of a relation on \(A\) are compared in 2026-09-17-relations-reflexivity-symmetry-transitivity. With two copies of \(A\) side by side, as for a function, loops become horizontal arrows and are easy to miss. With a single copy of \(A\), loops, arrows in both directions and paths of two arrows can all be seen at a glance, and those are what the properties of relations are about.
Reading a diagram back into pairs: each arrow is one pair, loops included. Forgetting the loops is the usual slip.
Figure 38: The relation \(m \mathrel{\rho} n \leftrightarrow 6 \mid (m-n)\) on \({0, 1, \dots, 11}\), drawn with a single copy of the set. Two numbers are related exactly when they leave the same remainder on division by 6, so the diagram falls apart into six separate pieces, one per remainder: each number has a loop, since \(6 \mid 0\), and each pair such as 1 and 7 is joined both ways, since \(7 - 1\) and \(1 - 7\) are both multiples of 6. Nothing joins different pieces. A diagram that splits into clusters like this marks a special kind of relation, the equivalence relations.
Common mistakes
- Treating a relation like a function. \(\rho(x)\) means nothing. A relation can have many partners for \(x\), or none, so there is no “value” to name. Write \(x \mathrel{\rho} y\) or \((x,y) \in \rho\).
- Reversing the pair. \(x \mathrel{\rho} y\) is the arrow from \(x\) to \(y\). Under \(x > y\), \(5 \mathrel{\rho} 2\) but not \(2 \mathrel{\rho} 5\).
- Dropping loops when reading pairs off a diagram, or when drawing one.
- Forgetting the set. A relation is on a particular set. “\(xy \equiv 1 \pmod 7\)” on \(\{0, \dots, 6\}\) has 6 pairs, on \(\mathbb{Z}\) infinitely many. Always state or check the set.
See also
- reflexive-symmetric-and-transitive-relations — the three properties, and how to prove or disprove each
- equivalence-relations · partial-order-relations — the two kinds of relation the course goes on to study, and hasse-diagrams, the arrow diagram of a partial order cut down
- functions-on-general-sets — functions as relations with exactly one partner per input
- sets-and-set-notation — Cartesian products and power sets, the raw material of relations
- modular-arithmetic — congruence, the source of relations like \(6 \mid (m - n)\)
- graphs — dots joined by edges without arrows, where a loop is an edge with one endpoint and adds 2 to a degree
- 2026-09-17-relations-reflexivity-symmetry-transitivity — Lecture 23
- practice-problems — §29, with full worked solutions
Sets and Set Notation
The language the rest of mathematics is written in: what a set is, the difference between belonging to one and being contained in one, and the operations that build new sets from old. See proving-set-properties for the proof methods that go with these definitions, and functions-on-general-sets for what gets built on top of them.
Writing a set down
Two ways, both used constantly:
- By listing the elements, inside braces: \(\{1,2,3\}\), \(\{a\}\), \(\{\emptyset, \{\emptyset\}\}\). An infinite list gets an ellipsis: \(\{\dots, -2, -1, 0, 1, 2, \dots\}\).
- By a defining condition — set-builder notation: \(\{n \in \mathbb{Z} \mid n \equiv 2 \;(\mathrm{mod}\; 8)\}\), read “the set of integers \(n\) such that \(n \equiv 2\) mod \(8\)”.
Both a vertical bar and a colon are used as the “such that” separator, interchangeably. \(\{n \in \mathbb{Z} \mid n \equiv 2 \;(\mathrm{mod}\; 8)\}\) and \(\{(x,y) \mid x \in \mathbb{R} \text{ and } y \in \mathbb{R}\}\) take the bar; \(f = \{(x,y) \in \mathbb{R} \times \mathbb{R} : y = 2x+1\}\) and \(f^{-1}(B) = \{x \in X : f(x) \in B\}\) take the colon. Read either as “such that”; nothing turns on which one is written.
Two conventions worth naming, because everything below relies on them: sets take capital italic letters (\(A, B, C, S, T, X, Y\)), with \(U\) reserved for the universal set, and elements take lower case (\(x\), \(y\), \(t\), \(n\)). And \(|A|\) denotes the cardinality of \(A\) — the number of elements it has (for infinite sets, where “number of elements” needs care, see [cardinality]).
“Is an element of” versus “is a subset of”
Warning. Take care with the distinction between is an element of (\(\in\)) and is a subset of (\(\subseteq\)).
This is the single most common source of error in the whole topic, and it is worth being blunt about why: the two relate different kinds of thing.
| Reads | Left-hand side is | Right-hand side is | |
|---|---|---|---|
| \(x \in A\) | \(x\) is an element of \(A\) | an object | a set |
| \(A \subseteq B\) | \(A\) is a subset of \(B\) | a set | a set |
Is \(\mathbb{Z} \in \mathbb{Q}\)? False. The elements of \(\mathbb{Q}\) are rational numbers, and \(\mathbb{Z}\) is not a number — it is a set of numbers. The true statement in the neighbourhood is \(\mathbb{Z} \subseteq \mathbb{Q}\).
The instinct behind the mistake (“but aren’t all integers rational?”) is right; it is the symbol that is wrong. “All integers are rational” is exactly the claim \(\mathbb{Z} \subseteq \mathbb{Q}\).
The same care applies one level down: a single element is not the same as the set containing that element, so \(2 \neq \{2\}\).
Worked: true or false?
| Statement | Why | ||
|---|---|---|---|
| a) | \(4 \in \{4\}\) | True | \(\{4\}\) contains \(4\) as an element |
| b) | \(4 \in \{\{4\}\}\) | False | \(\{\{4\}\}\) does not contain \(4\) as an element — it contains \(\{4\}\) as an element |
| c) | \(\{4\} \in \{2,3,4\}\) | False | \(\{2,3,4\}\) does not contain \(\{4\}\) as an element — it contains \(4\) as an element |
Each false line becomes true if you swap the symbol or the braces, which is the point of the exercise. In (c), \(\{4\} \subseteq \{2,3,4\}\) is true.
The reliable technique: write out the set’s elements and ask whether the left-hand object is literally one of the things in the list. For \(\{\{4\}\}\) that list is a single item, the set \(\{4\}\) — and \(4\) is not on it.
Subsets and proper subsets
A set \(S\) is a subset of a set \(T\), written \(S \subseteq T\), if every element in \(S\) is also in \(T\). Formally, \(\forall x\), if \(x \in S\) then \(x \in T\).
A set \(S\) is a proper subset of \(T\), written \(S \subset T\), if \(S \subseteq T\) and there is an element in \(T\) that is not in \(S\).
So \(\subset\) is \(\subseteq\) plus “and they are not equal” — exactly parallel to \(<\) against \(\leq\) for numbers.
| Holds | Fails | |
|---|---|---|
| \(\subseteq\) | \(\mathbb{Z} \subseteq \mathbb{Q}\), and \(\mathbb{Z} \subseteq \mathbb{Z}\) | |
| \(\subset\) | \(\mathbb{Z} \subset \mathbb{Q}\) | \(\mathbb{Z} \not\subset \mathbb{Z}\) |
A set is always a subset of itself and never a proper subset of itself — that single line is the whole difference between the two symbols.
Figure 39: The four situations the symbols distinguish. An element sits inside a set; a subset is a set inside a set; a proper subset leaves something over; and equality is containment holding both ways at once. The contained set is green and the containing set pale blue, with elements as small blue dots; the red dot is the element that keeps the containment proper.
Proving one set is a subset of another
To prove \(S \subseteq T\), consider an arbitrary element of \(S\) and show it is also in \(T\). That is: suppose \(x \in S\), and prove \(x \in T\).
This is the element method, and it is used so heavily that proving-set-properties treats it in full. The word doing the work is “arbitrary” — you may assume nothing about \(x\) beyond membership of \(S\), which is what makes the one argument cover every element at once.
Worked. Let \(D = \{n \in \mathbb{Z} \mid n \equiv 2 \;(\mathrm{mod}\; 8)\}\) and let \(E\) be the set of even integers, i.e. \(E = \{n \in \mathbb{Z} \mid n \equiv 0 \;(\mathrm{mod}\; 2)\}\). Prove \(D \subseteq E\).
Proof. Let \(x \in D\). Then \(x \equiv 2 \;(\mathrm{mod}\; 8)\), so there exists \(k \in \mathbb{Z}\) such that \[x = 8k + 2 = 2(4k + 1) + 0\] Since \(4k + 1 \in \mathbb{Z}\), we have \(x \equiv 0 \;(\mathrm{mod}\; 2)\), and therefore \(x \in E\). Thus \(D \subseteq E\). \(\blacksquare\)
Rewriting \(8k+2\) as \(2(4k+1)\) is the entire proof — see modular-arithmetic for the definition being applied.
Is \(D \subset E\)? Yes. We have \(D \subseteq E\), and \(4 \in E\) while \(4 \notin D\) (since \(4 \not\equiv 2 \bmod 8\)), so the containment is proper. Note that upgrading \(\subseteq\) to \(\subset\) needs one witness, not a general argument.
When are two sets equal?
For sets \(S\) and \(T\), \(S = T\) means \(\forall x\), \(x \in S\) if and only if \(x \in T\).
Recall that \(S \subseteq T\) means \(\forall x\), if \(x \in S\) then \(x \in T\). Since \(p \leftrightarrow q \equiv (p \rightarrow q) \land (q \rightarrow p)\), it follows that
\[S = T \quad\text{is logically equivalent to}\quad (S \subseteq T) \land (T \subseteq S)\]
So to prove two sets are equal, do two separate proofs:
- Suppose \(x \in S\), and prove \(x \in T\). This shows \(S \subseteq T\).
- Suppose \(x \in T\), and prove \(x \in S\). This shows \(T \subseteq S\).
Together these give \(S = T\). This is not a convention but a consequence — the double containment argument is just the biconditional law of logical-equivalence-laws read through the definition of \(\subseteq\), which is why “prove both directions” is never optional.
The empty set
\(\emptyset = \{\;\}\) — the set with no elements.
Why is \(\emptyset \subseteq A\) for every set \(A\)? Because “\(\forall x\), if \(x \in \emptyset\) then \(x \in A\)” is true for every set \(A\). The hypothesis \(x \in \emptyset\) is never satisfied, and a conditional with a false hypothesis is true — so the statement holds vacuously. See conditional-statements for that truth-table row, which is doing all the work here.
Do not confuse this with \(\emptyset \in A\). Some sets do contain the empty set as an element; many do not. \(\emptyset \subseteq A\) is a theorem about every set; \(\emptyset \in A\) is a claim about one particular set that usually fails.
Why is \(A \subseteq A\) for every set \(A\)? Because “\(\forall x\), if \(x \in A\) then \(x \in A\)” is true for every set \(A\) — this one for the opposite reason, that the conclusion simply restates the hypothesis.
There is only one empty set
Lemma. There is only one empty set.
Proof (by contradiction). Suppose \(\emptyset_1\) and \(\emptyset_2\) are distinct sets each having no elements, so \(\emptyset_1 \neq \emptyset_2\). Since \(\emptyset_1\) has no elements, it is a subset of \(\emptyset_2\); that is, \(\emptyset_1 \subseteq \emptyset_2\). Also, since \(\emptyset_2\) has no elements, \(\emptyset_2 \subseteq \emptyset_1\). Thus \(\emptyset_1 = \emptyset_2\) by definition of set equality — contradicting the supposition. \(\blacksquare\)
This is why we say the empty set and write a single symbol for it. The proof is a neat demonstration of the double-containment criterion doing real work: both containments come free from vacuous truth, and equality falls out.
Unions and intersections
\[A \cup B = \{x \mid x \in A \text{ or } x \in B\} \qquad\qquad A \cap B = \{x \mid x \in A \text{ and } x \in B\}\]
Figure 40: The four operations as shaded regions. Union takes everything in either circle, intersection only the overlap, difference removes B from A, and the complement is everything in the universe outside A — which is why a complement is only meaningful once the universe U is fixed. The enclosing rectangle is that universe.
Worked. Let \(A_1 = \{1,2,3\}\), \(A_2 = \{1,2,4\}\) and \(A_3 = \{3,4,5\}\).
\[A_1 \cup A_2 = \{1,2,3,4\} \qquad A_1 \cap A_2 = \{1,2\} \qquad A_1 \cap A_3 = \{3\} \qquad A_2 \cap A_3 = \{4\}\]
Indexed over all three:
\[\bigcup_{i=1}^{3} A_i = A_1 \cup A_2 \cup A_3 = \{1,2,3,4,5\} \qquad\qquad \bigcap_{i=1}^{3} A_i = (A_1 \cap A_2) \cap A_3 = \{1,2\} \cap \{3,4,5\} = \emptyset\]
Worth noticing: the three sets intersect pairwise in a non-empty set every time, and yet the triple intersection is empty. Pairwise overlap does not survive to the whole family, so an indexed intersection has to be computed, not inferred.
Indexed families
\[\bigcup_{i \in I} A_i = \{x \mid x \in A_i \text{ for \textbf{at least one} } i \in I\} \qquad \bigcap_{i \in I} A_i = \{x \mid x \in A_i \text{ for \textbf{every} } i \in I\}\]
These extend to infinite index sets unchanged, which is where they earn their keep.
Worked, over \(i = 0, 1, 2, \dots\):
\[\bigcup_{i=0}^{\infty} \{i, -i\} = \{0\} \cup \{1,-1\} \cup \{2,-2\} \cup \cdots = \{\dots, -2, -1, 0, 1, 2, \dots\} = \mathbb{Z}\]
\[\bigcap_{i=0}^{\infty} [-i,\, i] = \{0\}\]
recalling the interval notation \([a,b] = \{x \in \mathbb{R} \mid a \leq x \leq b\}\).
The intersection is the interesting one. The intervals grow as \(i\) increases, so the intersection is pinned by the smallest of them, the \(i = 0\) term \([0,0] = \{0\}\). Every larger interval contains \(0\), so nothing is lost, and nothing else survives.
Figure 41: An intersection over an increasing family is decided by its smallest member. Each interval contains the one below it, so the only real number lying in all of them is the single point the innermost interval contains. The intervals sit above the number line, with a filled dot at each closed endpoint.
Set difference and complement
\[A - B = \{x \mid x \in A \text{ and } x \notin B\}\]
Both are drawn in Figure 40 above.
The backslash and the minus sign mean the same thing: \(A - B\) can equally be written \(A \setminus B\). Different textbooks pick different ones; there is no distinction to learn.
The complement \(A^{c}\) is the set difference from the universal set \(U\) under discussion: \(A^{c} = U - A\). It is only meaningful once \(U\) is fixed, so a complement always sits inside a stated universe.
The power set
\(\mathcal{P}(A)\) is the set of all subsets of \(A\).
Worked. Let \(S = \{1,2,3\}\). Then
\[\mathcal{P}(S) = \big\{\, \emptyset,\; \{1\},\; \{2\},\; \{3\},\; \{1,2\},\; \{1,3\},\; \{2,3\},\; \{1,2,3\} \,\big\}\]
Note that the elements of \(\mathcal{P}(S)\) are sets, which resets the \(\in\) / \(\subseteq\) trap one level up:
| Statement | Why | |
|---|---|---|
| \(\{1,2\} \in \mathcal{P}(S)\) | True | \(\{1,2\}\) is one of the eight things listed |
| \(\{1,2\} \subseteq \mathcal{P}(S)\) | False | that would need \(1\) and \(2\) themselves to be elements of \(\mathcal{P}(S)\), i.e. to be subsets of \(S\) — and they are numbers, not sets |
| \(\big\{\{1,2\}\big\} \subseteq \mathcal{P}(S)\) | True | the one element it has, \(\{1,2\}\), is in \(\mathcal{P}(S)\) |
Also worth recording as a standing fact: since \(\emptyset \subseteq A\) for every set \(A\), it follows that \(\emptyset \in \mathcal{P}(A)\) for every set \(A\). Every power set is non-empty, including \(\mathcal{P}(\emptyset)\).
Fact. If \(T\) is a finite set with \(n\) elements, then \(|\mathcal{P}(T)| = 2^{n}\).
The finiteness matters — the count is meaningless otherwise. The \(2^n\) comes from building a subset by making \(n\) independent in/out choices. Sorting the same subsets by size instead gives \(\binom{n}{0} + \binom{n}{1} + \cdots + \binom{n}{n} = 2^n\) (binomial-coefficients).
Worked: is \(\{1, 3, -1\} \subset \mathcal{P}(\mathbb{Z})\)?
False, and the reasoning is the \(\in\)/\(\subseteq\) distinction again, run carefully:
- \(1, 3, -1 \in \mathbb{Z}\), so \(\{1,3,-1\} \subseteq \mathbb{Z}\).
- Therefore \(\{1,3,-1\} \in \mathcal{P}(\mathbb{Z})\) — it is one of the subsets of \(\mathbb{Z}\), hence an element of the power set.
- So \(\{1,3,-1\} \not\subset \mathcal{P}(\mathbb{Z})\): for that, its elements \(1\), \(3\) and \(-1\) would have to be elements of \(\mathcal{P}(\mathbb{Z})\), i.e. subsets of \(\mathbb{Z}\) — and they are integers, not sets.
The statement is off by exactly one level, which is the characteristic failure mode with power sets.
Worked: power sets of power sets
Building up from the empty set, with the \(2^n\) fact as a running check:
| Value | \(|\,\cdot\,|\) of the input | Check | |
|---|---|---|---|
| \(\mathcal{P}(\{a\})\) | \(\big\{\emptyset,\; \{a\}\big\}\) | \(|\{a\}| = 1\) | \(2^1 = 2\) \(\checkmark\) |
| \(\mathcal{P}(\emptyset)\) | \(\big\{\emptyset\big\}\) | \(|\emptyset| = 0\) | \(2^0 = 1\) \(\checkmark\) |
| \(\mathcal{P}(\mathcal{P}(\emptyset)) = \mathcal{P}(\{\emptyset\})\) | \(\big\{\emptyset,\; \{\emptyset\}\big\}\) | \(|\{\emptyset\}| = 1\) | \(2^1 = 2\) \(\checkmark\) |
| \(\mathcal{P}(\mathcal{P}(\mathcal{P}(\emptyset))) = \mathcal{P}\big(\{\emptyset, \{\emptyset\}\}\big)\) | \(\big\{\emptyset,\; \{\emptyset\},\; \{\{\emptyset\}\},\; \{\emptyset, \{\emptyset\}\}\big\}\) | \(\big|\{\emptyset,\{\emptyset\}\}\big| = 2\) | \(2^2 = 4\) \(\checkmark\) |
\(\mathcal{P}(\emptyset) = \{\emptyset\}\) is the line to get right: the empty set has exactly one subset — itself — so its power set has one element and is not empty. Counting the elements at each stage and checking against \(2^n\) is the cheapest way to catch a dropped or duplicated brace.
Cartesian products
\[A \times B = \{(a,b) \mid a \in A \text{ and } b \in B\}\]
the set of ordered pairs with first coordinate from \(A\) and second from \(B\).
Worked. \(A_1 = \{1,2\}\), \(A_2 = \{3,4,5\}\), \(A_3 = \{6\}\).
\[A_1 \times A_2 = \{(1,3), (1,4), (1,5), (2,3), (2,4), (2,5)\}\]
\[A_1 \times A_2 \times A_3 = \{(1,3,6), (1,4,6), (1,5,6), (2,3,6), (2,4,6), (2,5,6)\}\]
Figure 42: A Cartesian product laid out as a grid: one row per element of the first set, one column per element of the second, one ordered pair at every crossing. The rectangular shape is the counting fact — the number of pairs is the product of the two sizes.
Worked. Let \(S = \{a,b,c\}\) and \(T = \{c,d\}\).
- \((d,c) \notin S \times T\), since \(d \notin S\) — the order matters, and \(d\) is disqualified as a first coordinate.
- \((c,d) \in S \times T\), since \(c \in S\) and \(d \in T\).
- \(S \times T\) contains \(3 \times 2 = 6\) elements.
The familiar case is \(\mathbb{R} \times \mathbb{R} = \{(x,y) \mid x \in \mathbb{R} \text{ and } y \in \mathbb{R}\}\), usually written \(\mathbb{R}^2\) — the plane is a Cartesian product, which is where the name comes from.
Two facts:
- If \(A = \emptyset\) or \(B = \emptyset\) then \(A \times B = \emptyset\) — there is no way to choose a coordinate from an empty set.
- For finite sets, \(|A_1 \times A_2 \times \cdots \times A_n| = |A_1| \cdot |A_2| \cdots |A_n|\).
Notation clash to be aware of. \((a,b)\) can mean an ordered pair, and \((a,b)\) can also mean an open interval — the real numbers \(x\) with \(a < x < b\). Nothing in the symbols distinguishes them; only the context does.
Partitions
A finite or infinite collection of non-empty sets \(\{A_1, A_2, A_3, \dots\}\) is a partition of a set \(A\) if and only if \[A = A_1 \cup A_2 \cup A_3 \cup \cdots \qquad\text{and}\qquad A_i \cap A_j = \emptyset \text{ for each } i, j \geq 1,\; i \neq j\]
Three conditions, all of which are checkable and all of which get tested: the pieces are non-empty, they cover \(A\), and they are pairwise disjoint.
Figure 43: A partition cuts a set into non-empty pieces that cover it with no overlap — every element lands in exactly one piece. Failing any one of the three conditions is enough to disqualify a collection. On the left is a partition: separate closed curves, one per piece, each holding its elements as dots. On the right, two pieces share an element, so the collection is not a partition.
Examples over \(\mathbb{Z}\):
- \(\{E, O\}\), where \(E\) is the even integers and \(O\) the odd integers, is a partition of \(\mathbb{Z}\).
- \(\big\{\{0\},\; \mathbb{Z}^{+},\; \mathbb{Z}^{-}\big\}\) is another partition of \(\mathbb{Z}\) — a set can be partitioned in many ways.
Worked: a collection that fails
Let \(S = \{x \in \mathbb{Z} \mid x \equiv 1 \;(\mathrm{mod}\; 3)\}\), let \(T = \{x \in \mathbb{Z} \mid x \equiv 2 \;(\mathrm{mod}\; 4)\}\), and let \(R = S \cup T\). Is \(\{S, T\}\) a partition of \(R\)?
No. The covering condition holds by construction — \(R = S \cup T\) is how \(R\) was defined. But disjointness fails:
\[10 = 3(3) + 1 \;\Rightarrow\; 10 \equiv 1 \;(\mathrm{mod}\; 3) \;\Rightarrow\; 10 \in S\] \[10 = 4(2) + 2 \;\Rightarrow\; 10 \equiv 2 \;(\mathrm{mod}\; 4) \;\Rightarrow\; 10 \in T\]
so \(10 \in S \cap T\) and \(S \cap T \neq \emptyset\). Therefore \(\{S,T\}\) is not a partition of \(R\).
A single witness settles it — disjointness is a universal claim, so one counterexample is a complete disproof.
Worked: two partitions of \(\mathbb{Z} \times \mathbb{Z}\)
Any rule that sorts every pair into exactly one bucket works. Two independent ways:
By the sign of the first coordinate. \[P = \{(a,b) \in \mathbb{Z} \times \mathbb{Z} \mid a \geq 0\} \qquad N = \{(a,b) \in \mathbb{Z} \times \mathbb{Z} \mid a < 0\}\] \(\{N, P\}\) is a partition of \(\mathbb{Z} \times \mathbb{Z}\) — every integer \(a\) is either \(\geq 0\) or \(< 0\), never both.
By the parity of the second coordinate. \[E = \{(a,b) \in \mathbb{Z} \times \mathbb{Z} \mid b \equiv 0 \;(\mathrm{mod}\; 2)\} \qquad O = \{(a,b) \in \mathbb{Z} \times \mathbb{Z} \mid b \equiv 1 \;(\mathrm{mod}\; 2)\}\] \(\{E, O\}\) is another partition of \(\mathbb{Z} \times \mathbb{Z}\).
The recipe generalises: take any property that every element either has or lacks, and the two resulting sets partition the whole — provided neither comes out empty. That connection is made exact by equivalence relations: every partition is the set of classes of one, and the other way round (equivalence-classes-and-partitions).
See also
- proving-set-properties — the element method, the set identities, and proofs about these operations
- functions-on-general-sets — functions defined as subsets of a Cartesian product
- equivalence-classes-and-partitions — partitions as the classes of an equivalence relation
- modular-arithmetic — the congruence sets used throughout the worked examples
- counting-principles · counting-selections — \(|A \times B| = |A| \times |B|\) as the multiplication rule, and \(\binom{n}{r}\), the number of \(r\)-element subsets of an \(n\)-element set
- inclusion-exclusion · probability — the size of a union of sets that overlap, with De Morgan’s law for “neither”, and events as subsets of a sample space
- pigeonhole-principle — a partition as the set of pigeonholes
- conditional-statements · logical-equivalence-laws — vacuous truth, and the biconditional behind set equality
- 2026-09-03-set-theory-definitions — Lecture 17
- practice-problems — §21 Set Theory Definitions, with full worked solutions
- practice-problems — §22 More Definitions and Examples of Sets
Strong Induction and the Well-Ordering Principle
Strong mathematical induction, the well-ordering principle for the integers, and the sense in which these two and ordinary induction are all the same tool. See mathematical-induction for ordinary induction and the four-step proof template both methods share.
Strong mathematical induction
Let \(P(n)\) be a predicate written in terms of some integer \(n\). The difference from ordinary induction is entirely in what the inductive step is allowed to assume: every earlier case, not just the immediately preceding one — and, to pay for that, a basis step that establishes several cases rather than one.
| Ordinary induction (MI) | Strong induction (SMI) | |
|---|---|---|
| Basis step | \(P(2)\) | \(P(2) \wedge P(3) \wedge P(4)\) |
| Inductive step | \(\forall k \in \mathbb{Z}\) with \(k \geq 2\), if \(P(k)\) then \(P(k+1)\) | \(\forall k \in \mathbb{Z}\) with \(k \geq 4\), if \(P(2) \wedge P(3) \wedge \cdots \wedge P(k)\) then \(P(k+1)\) |
| Conclusion | \(P(n)\) for each integer \(n \geq 2\) | \(P(n)\) for each integer \(n \geq 2\) |
Both reach the same conclusion by the same kind of chain. For MI, \(P(5)\) follows from \(P(2)\) by three applications of the implication; for SMI with the basis above, \(P(6)\) follows in two.
Figure 44: Mathematical induction and strong mathematical induction as chains of inferences. Each column is an argument — premises stacked, conclusion prefixed by ∴, no rule line. MI climbs one rung at a time from a single base case; SMI starts from three base cases and each step may lean on everything established so far, which is why it lands on P(6) in two moves rather than four. Colour tracks one expression as it moves: green is what the basis step supplies, orange is a statement concluded one column earlier and carried forward. There are no arrows between columns — the repeated colour alone shows where a statement moves.
How many base cases?
As many as the inductive step reaches back for. This is the whole reason the basis step of an SMI proof is not a single case, and the answer to “why two values and not three?”
Count how far back the recurrence reaches, not how many terms it uses — those differ. \(a_n = a_{n-1} - a_{n-3}\) uses only two earlier terms, but the deepest is three positions back, so all three of \(P(0), P(1), P(2)\) must be established or the step could reach for an unproven case.
Figure 45: How many base cases a strong induction needs, on the two sequences worked below: b_n = b_{n-2} + b_{n-1} and a_n = a_{n-1} − a_{n-3}. Both use exactly two earlier terms, so counting terms gives the wrong answer; what settles it is the longest arrow. Reaching two positions back means the basis step must cover two cases; reaching three means three. The terms sit in a row, and each short curved arrow is labelled with what it does.
If the basis step establishes fewer cases than the inductive step consumes, the chain has a hole in it: the first few applications of the inductive step would reach for a case nobody ever proved.
Worked example — a two-term recurrence
Suppose \(b_1, b_2, b_3, \dots\) is defined by \(b_1 = 4\), \(b_2 = 12\), and \(b_n = b_{n-2} + b_{n-1}\) for each integer \(n \geq 3\). Prove that \(4 \mid b_n\) for each integer \(n \geq 1\).
Proof. Let \(P(n)\) be the predicate \(4 \mid b_n\).
Basis step. We know that \(b_1 = 4\) and \(b_2 = 12\). Since \(4 \mid 4\) and \(4 \mid 12\), \(P(1)\) is true and \(P(2)\) is true.
Inductive hypothesis. Suppose \(k \geq 2\) is an integer and that \(P(1), P(2), \dots, P(k)\) are true. Since \(P(k)\) is true, \(b_k = 4x\) for some \(x \in \mathbb{Z}\). Since \(P(k-1)\) is true, \(b_{k-1} = 4y\) for some \(y \in \mathbb{Z}\).
Inductive step. Consider \(n = k+1\):
\[b_{k+1} = b_{k-1} + b_k = 4y + 4x \qquad \text{(by the inductive hypothesis)}\] \[= 4(y+x)\]
Thus \(4 \mid b_{k+1}\), so \(P(k+1)\) is true.
Therefore, by PSMI, for each integer \(n \geq 1\), \(4 \mid b_n\). \(\square\)
Note where strong induction actually earns its keep: the step uses \(P(k)\) and \(P(k-1)\). Ordinary induction only hands you \(P(k)\), which is not enough to say anything about \(b_{k-1}\).
Worked example — every integer \(n > 1\) is a product of primes
Theorem. Every integer \(n > 1\) can be written as a product of primes.
Proof. Let \(P(n)\) be the predicate \(n\) can be written as a product of primes, for \(n \geq 2\).
Basis step. \(n = 2\) is prime and thus is a product of primes, so \(P(2)\) is true.
Inductive step. Suppose that for some integer \(k \geq 2\), every integer \(2, 3, \dots, k\) can be written as a product of primes — that is, \(P(2) \wedge P(3) \wedge \cdots \wedge P(k)\). We now need to prove that \(k+1\) is a product of primes. Since \(k + 1 > 1\), either \(k+1\) is prime or \(k+1\) is composite.
- Case 1: \(k+1\) is prime. Then \(k+1\) is a product of primes.
- Case 2: \(k+1\) is composite. Then \(k+1 = rs\) for some positive integers \(r \neq 1\) and \(s \neq 1\). This implies \(1 < r < k+1\) and \(1 < s < k+1\). So by the inductive hypothesis — specifically \(P(r)\) and \(P(s)\) — both \(r\) and \(s\) are products of primes. Let \(r = p_1p_2\dots p_a\) and \(s = q_1q_2\dots q_b\) where the \(p_i\) and \(q_j\) are primes; thus \(k+1 = rs = p_1p_2\dots p_a q_1q_2 \dots q_b\) is a product of primes.
In either case, \(k+1\) is a product of primes.
Therefore, by SMI, every integer \(n > 1\) can be written as a product of primes. \(\square\)
Why strong induction and not ordinary induction? Because \(r\) and \(s\) can be any integers from 2 to \(k\) — the factorisation gives no control over which — so the proof needs the inductive hypothesis available at all of those values, not just at \(k\).
The well-ordering principle for the integers
Let \(S\) be a non-empty set of integers, each of which is greater than some fixed integer. Then \(S\) has a least element.
Four pieces of terminology, all load-bearing:
- non-empty — the empty set has no least element, trivially.
- of integers — not of rationals or reals. This clause is not decoration: the positive rationals are non-empty and bounded below by 0, and still have no least element, because between any candidate and 0 there is always another one (halve it). See 2026-08-27-strong-induction-and-well-ordering.
- greater than some fixed integer — \(S\) must be bounded below. Without this the principle fails: \(\mathbb{Z}^-\) is a non-empty set of integers with no least element.
- a least element — an element of \(S\) that is \(\leq\) every element of \(S\). It lives inside the set, not outside it.
Example — integers congruent to \(1 \bmod 4\)
True or false? The set of all integers congruent to \(1 \bmod 4\) has a least element.
False. The set is \(\{\dots, -7, -3, 1, 5, 9, \dots\}\).
Suppose this set did have a least element, call it \(x\). Then, since \(x \equiv 1 \pmod 4\), we have \(x - 4 \equiv 1 \pmod 4\), so \(x-4\) is also in the set. But \(x - 4\) is smaller than \(x\) — a contradiction. \(\square\)
The set is non-empty, but it fails the “bounded below” condition, so the well-ordering principle simply does not apply to it.
MI, SMI and the WOP are equivalent
Anything provable by one is provable by the other two. Two of the translations:
SMI \(\to\) MI: reword the statement. A strong-induction proof of \(P(n)\) becomes an ordinary-induction proof of the accumulated predicate
\[Q(n) \;\equiv\; P(0) \wedge P(1) \wedge \cdots \wedge P(n)\]
Assuming \(Q(k)\) in ordinary induction gives you exactly what assuming \(P(0), \dots, P(k)\) gave you in strong induction. (Epp, Q27 p. 279.)
MI \(\to\) WOP: argue by contradiction. Suppose the set of integers \(\geq a\) for which \(P(n)\) is false is non-empty. It is bounded below by \(a\), so by the WOP it has a least element; derive a contradiction from that least element. (Epp, Q31 p. 279.)
The same theorem, three ways
Suppose \(a_0, a_1, a_2, \dots\) is defined by \(a_0 = 6\), \(a_1 = 9\), \(a_2 = 12\) and \(a_n = a_{n-1} - a_{n-3}\) for each integer \(n \geq 3\). Prove that for all integers \(n \geq 0\), \(3 \mid a_n\).
By SMI.
Let \(P(n)\) be the predicate \(3 \mid a_n\).
Basis step. \(a_0 = 6\), \(a_1 = 9\) and \(a_2 = 12\). Since \(3 \mid 6\), \(3 \mid 9\) and \(3 \mid 12\), \(P(0)\), \(P(1)\) and \(P(2)\) are true.
Inductive hypothesis. Suppose \(k \geq 2\) is an integer and that \(P(0), P(1), \dots, P(k)\) are true. Since \(P(k-2)\) is true, \(a_{k-2} = 3y\) for some \(y \in \mathbb{Z}\); since \(P(k)\) is true, \(a_k = 3x\) for some \(x \in \mathbb{Z}\).
Inductive step. Consider \(n = k+1\): \(a_{k+1} = a_k - a_{k-2} = 3x - 3y = 3(x-y)\). Thus \(3 \mid a_{k+1}\), so \(P(k+1)\) is true.
Therefore, by PSMI, for each integer \(n \geq 0\), \(3 \mid a_n\). \(\square\)
By MI, on the reworded predicate.
Let \(Q(n)\) be the predicate \(3 \mid a_j\) for all integers \(j\) where \(0 \leq j \leq n\) — that is, \(Q(n) \equiv P(0) \wedge P(1) \wedge \cdots \wedge P(n)\).
Basis step. Consider \(n = 2\). Since \(3 \mid a_0\), \(3 \mid a_1\) and \(3 \mid a_2\), \(Q(2)\) is true.
Inductive hypothesis. Suppose \(k \geq 2\) is an integer and that \(Q(k)\) is true. Since \(Q(k)\) is true and \(k \geq 2\), \(a_k = 3x\) and \(a_{k-2} = 3y\) for some \(x, y \in \mathbb{Z}\).
Inductive step. Consider \(n = k+1\): \(a_{k+1} = a_k - a_{k-2} = 3x - 3y = 3(x-y)\). Thus \(3 \mid a_{k+1}\). Since \(Q(k)\) already gives \(3 \mid a_i\) for every \(0 \leq i \leq k\), adding \(3 \mid a_{k+1}\) gives \(Q(k+1)\).
(That last step is the point of rewording the predicate: \(Q(k+1)\) is a conjunction over all indices up to \(k+1\), so it needs \(Q(k)\) and the new case — \(3 \mid a_{k+1}\) alone would not establish it.)
Therefore, by PMI, for each integer \(n \geq 0\), \(3 \mid a_n\). \(\square\)
The two proofs have the same algebraic core: the line \(a_{k+1} = a_k - a_{k-2} = 3x - 3y = 3(x-y)\) is identical in each. All the reworded predicate does is let a single assumption, \(Q(k)\), carry the several earlier facts the algebra needs.
Two details of the MI proof are easy to get wrong:
- The basis is \(n = 2\), not \(n = 0\). \(Q(2)\) already asserts \(3 \mid a_0\), \(3 \mid a_1\) and \(3 \mid a_2\), so verifying \(Q(2)\) discharges all three of the SMI proof’s base cases in one statement. Three base cases have not disappeared; they have been packed into one predicate.
- The step concludes \(Q(k+1)\), not \(P(k+1)\). An ordinary induction on \(Q\) has to deliver \(Q(k+1)\), and \(3 \mid a_{k+1}\) on its own does not — it needs \(Q(k)\) alongside it.
The conjunction in \(Q\) starts at \(P(0)\), not \(P(1)\). The predicate is \(3 \mid a_j\) for all integers \(j\) where \(0 \leq j \leq n\), so \(Q(2) \equiv P(0) \wedge P(1) \wedge P(2)\) — which is also what the basis step checks.
By the WOP, by contradiction.
Suppose the statement is false, so there exists an integer \(n \geq 0\) such that 3 does not divide \(a_n\). Let
\[A = \{\, n \in \mathbb{Z}^{\geq 0} \;:\; 3 \nmid a_n \,\}\]
By the WOP and our assumption, \(A\) has a least element — the smallest \(n\) for which \(3 \nmid a_n\). Call it \(k\). Thus \(3 \nmid a_k\), but \(3 \mid a_i\) for all \(0 \leq i \leq k-1\).
Note that \(k \geq 3\), since \(a_0\), \(a_1\) and \(a_2\) are all divisible by 3.
Thus \(a_{k-1} = 3x\) and \(a_{k-3} = 3y\) for some \(x, y \in \mathbb{Z}\), so
\[a_k = a_{k-1} - a_{k-3} = 3x - 3y = 3(x-y)\]
Thus \(3 \mid a_k\), which is a contradiction.
Therefore, for each integer \(n \geq 0\), \(3 \mid a_n\). \(\square\)
Reading the WOP proof next to the SMI one: “let \(k\) be the least counterexample” plays the role of the inductive hypothesis (everything below \(k\) works), and “\(3 \mid a_k\), contradiction” plays the role of the inductive step. Drawn on the index line, the whole proof is one picture:
Figure 46: The well-ordering proof of 3 | a_n as a picture of its own least counterexample. Everything to the left of k is green not because it was proved, but because k was chosen least — that single step is the only place the WOP is used, and it is exactly what the strong inductive hypothesis supplies in the SMI proof. The least element here is the smallest number that gives a contradiction. k ≥ 3 is what guarantees both arrows land inside the green stretch, since a_{k-3} has to be a term of the sequence at all.
Note which term the WOP proof reaches for. The SMI proof used \(a_k\) and \(a_{k-2}\) to build \(a_{k+1}\); the WOP proof is standing at \(k\) rather than at \(k+1\), so the same recurrence reads \(a_k = a_{k-1} - a_{k-3}\) and it reaches for \(a_{k-1}\) and \(a_{k-3}\). Same recurrence, index shifted by one — and that shift is why the “\(k \geq 3\)” line has to be there.
Spotting a WOP proof
A proof is using the well-ordering principle whenever it says “choose the smallest such \(n\)” about a set it has just argued is non-empty. That phrase is not free — it is the WOP being invoked, and it needs the set to be non-empty and bounded below.
For instance, the primes theorem above can be rewritten as a contradiction proof: suppose some integer \(n > 1\) is not a product of primes; by the WOP, choose the smallest such \(n\); then \(n\) is prime (done) or \(n = rs\) with \(1 < r, s < n\), and both \(r\) and \(s\) are products of primes precisely because \(n\) was chosen smallest — contradicting the choice of \(n\). Structurally it is the SMI proof with the induction turned inside out.
See also
- mathematical-induction · proof-techniques · sequences-and-summations
- recursive-definitions · solving-recurrence-relations — where a two-term recurrence forces the strong hypothesis
- trees — strong induction on the number of vertices: a tree with \(n\) vertices has \(n - 1\) edges
- 2026-08-27-strong-induction-and-well-ordering — Lecture 14
- practice-problems — §18, with full worked solutions