(i) Put a=1,2,3,4,5 in each rule. Every value lands in B.
R1={(1,1),(2,3),(3,5),(4,7),(5,9)}
R2={(1,4),(2,5),(3,6),(4,7),(5,8)}
(ii) R1∪R2 contains every pair that is in R1 or in R2. The pair (4,7) is in both, because 2a−1=a+3 only when a=4, so it is written once:
R1∪R2={(1,1),(1,4),(2,3),(2,5),(3,5),(3,6),(4,7),(5,8),(5,9)}
Counting the listed pairs, n(R1∪R2)=9.
Domain of R1∪R2={1,2,3,4,5}=A.
Range of R1∪R2={1,3,5,7,9}∪{4,5,6,7,8}={1,3,4,5,6,7,8,9}.
(iii) From part (ii), R1∩R2={(4,7)}. Its domain is {4} and its range is {7}.
(iv) Let x be in the domain of S∩T. Then there is some y∈Y with (x,y)∈S∩T. So (x,y)∈S, which puts x in the domain of S, and (x,y)∈T, which puts x in the domain of T. Hence x∈ (domain of S) ∩ (domain of T), and
domain of (S∩T)⊂(domain of S)∩(domain of T)
Equality need not hold. Both R1 and R2 have domain A, so
(domain of R1)∩(domain of R2)=A={4}
For example, 1 is in both domains, but its images are different: 1 under R1 and 4 under R2. So no pair with first element 1 is common. An element can have an image under each relation without the two images being the same.
The two relations in one arrow diagram (R1 solid, R2 dashed; both arrows from 4 end at 7):
