# Prove map σ:y→xyx⁻¹ is bijective

• catherinenanc
In summary, the conversation discusses the proof that the map σ:y→xyx⁻¹ is bijective for any group G and x∈G. The concept of bijective is defined as being both injective and surjective. To prove injective, it is necessary to show that if y1≠y2, then xy1x⁻¹≠xy2x⁻¹. To prove surjective, it is necessary to show that for every g in G, there exists a y in G such that xyx⁻¹=g. The conversation also suggests a possible approach for proving injective by using the contrapositive. The summary concludes with a confirmation that the thinking on surjective is correct.
catherinenanc
1. Let G be any group and x∈G. Let σ be the map σ:y→xyx⁻¹. Prove that this map is bijective.
It seems to be written strangely, since it never really says anywhere that y is in G, but I guess that must be an assumption.2. bijective=injective+surjective.
in order to prove injective, we need to show that y1≠y2→xy1x⁻¹≠xy2x⁻¹
and in order to prove surjective, we need to show that for every g in G, there exists a y in G such that xyx^-1=g.

3. I think that I can say: Let y=x^-1gx. Then xyx-1=g and we are done for surjective.
I don't really know how to "show" injective, since it seems obvious.

Instead of showing ##y_1\ne y_2 \to xy_1x^{-1}\ne xy_2x^{-1}## try showing the contrapositive.

So I show that xy1x-1=xy2x-1→y1=y2 by simply left-multiplyng both sides by x-1 and right-multiplying both sides by x? Is that too simple?

Also, does my thinking on surjective work?

Yes, it all looks OK to me.

Ok, thanks!

## 1. What is a bijective map?

A bijective map, also known as a bijection, is a type of function that has a one-to-one correspondence between its domain and range. This means that every element in the domain is paired with a unique element in the range, and every element in the range has a corresponding element in the domain. In other words, a bijective map is both injective (one-to-one) and surjective (onto).

## 2. How do you prove that a map is bijective?

To prove that a map is bijective, you must show that it is both injective and surjective. This can be done by showing that for every element in the domain, there is a unique element in the range, and for every element in the range, there is a corresponding element in the domain. In the case of the map σ:y→xyx⁻¹, this can be shown by demonstrating that it is both injective and surjective using algebraic manipulation and logical reasoning.

## 3. Can you explain the map σ:y→xyx⁻¹ in simpler terms?

The map σ:y→xyx⁻¹ is a function that takes a value y and returns the value of xyx⁻¹. In simpler terms, this means that the map takes a value, multiplies it by itself, and then divides by the inverse of the original value. For example, if we input the value 3, the map would return the value (3*3)/3⁻¹, which simplifies to 3*3*3 = 27.

## 4. Why is it important to prove that a map is bijective?

Proving that a map is bijective is important because it guarantees that the function has a well-defined inverse. This means that there is a way to "undo" the function and retrieve the original input value from the output value. Additionally, bijective maps have many useful properties in mathematics and are often used in various fields of science.

## 5. Are there any real-life applications of the map σ:y→xyx⁻¹?

Yes, the map σ:y→xyx⁻¹ has several real-life applications. One example is in physics, where this function is used to describe the motion of a particle in a magnetic field. It is also used in computer science and cryptography, where it is used to generate secure keys for encryption and decryption. Additionally, this map is important in the study of group theory, a branch of abstract algebra.

Replies
4
Views
1K
Replies
4
Views
789
Replies
1
Views
1K
Replies
1
Views
1K
Replies
1
Views
1K
Replies
7
Views
2K
Replies
3
Views
549
Replies
1
Views
1K
Replies
9
Views
1K
Replies
4
Views
4K