Set of sets and isomorphism

  • Thread starter yaganon
  • Start date
17
0
So it says here "Let S be a set of sets. Show that isomorphism is an equivalence relation on S."

So in order to approach this proof, can I just use the Reflexive, Symmetrical, and Transitive properties that is basically the definition of equivalence relations?

eg. suppose x, y, z are sets contained in S...

Reflexive: x~x <same as> xRx
Symmetry: x~y => y~x <same as> xRy => yRx
Transitive: x~y, y~z => x~z

This seems too elementary, but I just want to make sure.
 
97
0
Yes - showing something is an equivalence relation always involves the same steps. Sets are isomorphic if they have the same cardinality, so you need to show that the property of "having the same number of elements" satisfies the three conditions.
 
17
0
I'm also confused about the X! notation. I think X^x means the set of all selfmap functions on X. What is X! suppose to be?
 

Related Threads for: Set of sets and isomorphism

  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
1
Views
1K
Replies
3
Views
559
  • Last Post
2
Replies
28
Views
4K
  • Last Post
Replies
11
Views
12K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
2
Views
1K
Replies
15
Views
8K
Top