Show that the union of two symmetric relations on a set is again a symmetric relation on that set.
Let R and R’ be two symmetric relations on a set A.
Let a, b ∈ A such that (a, b) ∈ R ∪ R’
∴ Either (a, b) ∈ R or (a, b) ∈ R’
If (a, b) ∴ R then (b, a) ∴ R (∵ R is symmetric)
∴ (b, a) ∈ R ∪ R’ (since R ⊆ R⊆ R’)
Similarly we can prove that (a, b) ∈ R’ ∈ (b, a) ∈ R ∪ R’
In both the cases (b, a) ∈ R ∪ R’
∴ R ∪ R’ is a symmetric relation on A.