Equivalence of sets proof assistance

Agent M27
Messages
169
Reaction score
0

Homework Statement


Suppose there exist three functions:
f:A\stackrel{1-1}{\rightarrow}B

g:B\stackrel{1-1}{\rightarrow}C

h:C\stackrel{1-1}{\rightarrow}A

Prove A\approxB\approxC

Do not assume the functions map onto their codomains.

Homework Equations


The Attempt at a Solution


I took a screenshot of my work and have attached it to the post. My question is concerning my last step, setting t=g\circf. Mathematically speaking I don't know if it is legal, however I don't see why I would not be able to do such an operation. Thanks in advance for the assistance.

Joe
 

Attachments

  • 5.4 #10.jpg
    5.4 #10.jpg
    35.3 KB · Views: 436
Physics news on Phys.org
That's fine. But there's also no reason you can't just use transitivity to show A<=C just like you did for B without using the composition.
 
I didn't even think about the transitivity of A and C until you pointed it out! I always over complicate these things. I think I will employ that method tomorrow should this problem appear on my exam. Thanks for your help.

Joe
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top