The set of 1-1 Mapping of S Onto itself

In summary, the conversation is discussing a property of functions in abstract algebra - namely, that fg = fh implies g = h, but gf = f^(-1)g does not necessarily imply f = f^(-1) and g = g. This is illustrated with an example and further explained using algebraic manipulation.
  • #1
kmikias
73
0

Homework Statement



I was reading my textbook and i encountered this...--->>

" For instance if f,g,h are in A(S) and fg = fh then g=h " I understand this part... because we can take the the inverse of f both sides and say g=h.

then it says--->> " If gf = f^(-1)g but since f ≠ f^(-1) we cannot cancel the g here"

SO MY QUESTION IS
IF gf = f^(-1)g then ...why can't we take inverse of g both sides and show f = f^(-1) and say f = f^(-1) and g = g.
 
Physics news on Phys.org
  • #2
Note that for functions it is NOT true that fg=gf in general.

This is very easy to see. Let [itex]f(x)=x+1[/itex] and let [itex]g(x)=x^3[/itex].

Then [itex]fg(x)=x^3+1[/itex] and [itex]gf(x)=(x+1)^3[/itex]. These are not equal.

Now, back to your question. Let's assume that [itex]gf=f^{-1}g[/itex]. If we take [itex]g^{-1}[/itex] of both sides, then we end up with

[tex]g^{-1}gf=g^{-1}f^{-1}g[/tex]

The left side is equal to f, no problem. But we can do nothing with the right side. Indeed, we can't just switch [itex]g^{-1}[/itex] and [itex]f^{-1}[/itex]!
 

FAQ: The set of 1-1 Mapping of S Onto itself

What is a 1-1 mapping of S onto itself?

A 1-1 mapping of S onto itself is a function that maps each element in a set S to a unique element in the same set. This means that each element in the domain of the function is mapped to a distinct element in the co-domain.

What is the importance of a 1-1 mapping of S onto itself?

A 1-1 mapping of S onto itself is important because it allows us to establish a one-to-one correspondence between elements in the same set. This can be useful in various mathematical and scientific applications, such as graph theory and cryptography.

How is a 1-1 mapping of S onto itself different from a general mapping?

A 1-1 mapping of S onto itself is a special case of a general mapping, where the domain and co-domain are the same set. In a general mapping, the domain and co-domain can be different sets and the mapping does not have to be one-to-one.

Can all sets have a 1-1 mapping of itself?

No, not all sets have a 1-1 mapping of themselves. In order for a set to have a 1-1 mapping of itself, it must have the same cardinality (number of elements) as its co-domain. For example, the set of natural numbers can have a 1-1 mapping of itself, but the set of real numbers cannot.

How do you prove that a mapping is 1-1 onto itself?

To prove that a mapping is 1-1 onto itself, you must show that for every element in the domain, there exists a unique element in the co-domain that it is mapped to. This can be done by using the definition of a 1-1 mapping and showing that no two elements in the domain are mapped to the same element in the co-domain.

Back
Top