(a) Reflexive: ∣a−a∣=0<1 for every real a, so (a,a)∈R.
Symmetric: ∣b−a∣=∣a−b∣, so if ∣a−b∣<1 then ∣b−a∣<1. Hence (a,b)∈R gives (b,a)∈R.
(b) Take 0, 0.7 and 1.3:
- ∣0−0.7∣=0.7<1, so (0,0.7)∈R;
- ∣0.7−1.3∣=0.6<1, so (0.7,1.3)∈R;
- ∣0−1.3∣=1.3≥1, so (0,1.3)∈/R.
So R is not transitive. Small differences can add up along a chain to a large one.
(c) List the differences between different readings:
| pair | difference | matching? |
|---|
| 0, 0.7 | 0.7 | yes |
| 0, 1.3 | 1.3 | no |
| 0.7, 1.3 | 0.6 | yes |
| 1.3, 2.6 | 1.3 | no |
| 2.6, 3.2 | 0.6 | yes |
| all other pairs | more than 1.3 | no |
So 3 unordered pairs of different readings match, giving 3×2=6 ordered pairs. Add the 5 pairs (d,d):
∣RD∣=5+6=11
(d) Join readings that are linked by a chain of matching steps:
- 0 to 0.7 to 1.3 links {0, 0.7, 1.3};
- 2.6 to 3.2 links {2.6, 3.2};
- no step crosses between these groups, because the smallest gap between them is 2.6−1.3=1.3≥1.
The smallest equivalence relation containing RD must contain every pair inside each group (transitivity forces it), and it needs nothing more. Its classes are
{0, 0.7, 1.3}and{2.6, 3.2}
It has 32+22=9+4=13 ordered pairs, so 13−11=2 pairs are added, namely (0,1.3) and (1.3,0).
(e) The two groups of (d) can only be joined through x. So x must match at least one reading of each group.
- x matches some reading of {0, 0.7, 1.3} exactly when x∈(−1, 1)∪(−0.3, 1.7)∪(0.3, 2.3)=(−1, 2.3).
- x matches some reading of {2.6, 3.2} exactly when x∈(1.6, 3.6)∪(2.2, 4.2)=(1.6, 4.2).
Both hold exactly when
1.6<x<2.3
Then x is linked to both groups, and all six readings form one class. If x misses either range, at least two classes remain. The endpoints are excluded because the inequality ∣a−b∣<1 is strict: for example x=1.6 gives ∣2.6−1.6∣=1, which is not less than 1.
