Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Let and . How many elements do and each have? Are the two sets equal?
holds every pair , and . A relation is any subset of . On one set, a relation that is reflexive, symmetric and transitive is an equivalence relation.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. Sizes. Each has pairs.
Step 2. Equal? No. holds pairs such as , and holds . Ordered pairs with swapped entries are different.
Answer: elements each, but .
Log in to join the discussion.
Loading…