(a) Work through a=1,2,…,6 and keep every b∈A with a+b≤5.
| a | Values of b with a+b≤5 | First value rejected |
|---|
| 1 | 1,2,3,4 | 1+5=6>5 |
| 2 | 1,2,3 | 2+4=6>5 |
| 3 | 1,2 | 3+3=6>5 |
| 4 | 1 | 4+2=6>5 |
| 5 | none | 5+1=6>5 |
| 6 | none | 6+1=7>5 |
R={(1,1),(1,2),(1,3),(1,4),(2,1),(2,2),(2,3),(3,1),(3,2),(4,1)}.
That is 4+3+2+1=10 pairs.
(b) Reading the rows of the table above:
1→1,2,3,4
2→1,2,3
3→1,2
4→1
5→ nothing
6→ nothing

(c) Read these off the roster in part (a).
- Domain — the set of first components that actually occur: {1,2,3,4}. (5 and 6 start no pair.)
- Codomain — the set R is declared to map into, namely A={1,2,3,4,5,6}.
- Range — the set of second components that actually occur: {1,2,3,4}.
So the range is a proper subset of the codomain.
(d) R is not a function from A to A, and it fails for two independent reasons.
- An input with several outputs. 1 is related to 1,2,3 and 4, so the pairs (1,1),(1,2),(1,3),(1,4) all lie in R. A function must attach exactly one output to each input.
- Inputs with no output. 5 and 6 appear in no pair of R at all. A function from A to A must give an output to every element of A.
Since R is not a function, it has no inverse function. (The inverse relation R−1={(b,a):(a,b)∈R} does of course exist, and because R is symmetric — see part (e) — it happens to equal R itself.)
(e) R is symmetric, but it is neither reflexive nor transitive, so it is not an equivalence relation.
Reflexive? No. (a,a)∈R requires 2a≤5, that is a≤2.5. So (1,1) and (2,2) are present, but
(3,3) needs 6≤5,(4,4) needs 8≤5,(5,5) needs 10≤5,(6,6) needs 12≤5,
and all four fail. Reflexivity breaks at 3, 4, 5 and 6.
Symmetric? Yes. The condition a+b≤5 says exactly the same as b+a≤5, because a+b=b+a. So whenever (a,b)∈R, also (b,a)∈R. Check it against the roster: (1,2) and (2,1), (1,3) and (3,1), (1,4) and (4,1), (2,3) and (3,2) are all paired up, and (1,1), (2,2) are their own reverses.
Transitive? No. Take (4,1)∈R (since 4+1=5≤5) and (1,4)∈R (since 1+4=5≤5). Transitivity would demand (4,4)∈R, but 4+4=8>5, so (4,4)∈/R.
A word of caution. A counterexample to transitivity needs two pairs that really are in R and a third pair that really is missing. Here (4,1) and (1,4) are both in R, and the missing pair is (4,4).