4.2k views
There are two elements $x,\:y$ in a group $(G,*)$ such that every element in the group can be written as a product of some number of $x$'s and $y$'s in some order. It is known that
$$x*x=y*y=x*y*x*y=y*x*y*x=e$$
where $e$ is the identity element. The maximum number of elements in such a group is ____.
retagged | 4.2k views
+9
$\textbf{*}$ $\textbf{x}$ $\textbf{y}$ $\textbf{x*y}$ $\textbf{e}$
$\textbf{x}$ $e$ $x*y$ $y$ $x$
$\textbf{y}$ $x*y$ $e$ $x$ $y$
$\textbf{x*y}$  $y$ $x$ $e$ $x*y$
$\textbf{e}$ $x$ $y$ $x*y$ $e$

It is given that:

• $x$ is its own inverse.
• $y$ is its own inverse.
• $x*y$ is its own inverse.
• $y*x$ is its own inverse.

Now I will show you that $x*y$ and $y*x$ are essentially same.
$x*y = x*e*y = x*(x*y*x*y)*y = (x*x)*y*x*(y*y) = e*y*x*e = y*x$

(Group is associative so I do not care about brackets)

This turns out to be abelian group. and $x*y$ is no different from $y*x$

Up to this point I have 4 elements - $x$, $y$, $e$, $x*y$.   $(G$ is abelian therefore $x*y$ is same as $y*x)$
Now see if you can have a new element. It is given that every element is product of some numbers of $x$ and $y$.
Lets try with $x$.
$x*\circ$, what u would like to put next to $x$ ?
If you put $x$ then there is no use and you have to start over again because of $x*x=e$ now you have to start all over again.
Put $y$ next to $x:$ $x*y$ (this element we already have, we want different element so try multiplying further.)
$x*y*\circ$, obviously you cannot put $y$, next to $x*y$ because it will be $x$ again: $x*y*y=x*e=x$
(you have to put alternate.)
Put $x$, next to $x*y$: $x*y*x$.
This is equal to $x*x*y$ because of commutative property. $x*y*x=x*x*y=y$.
I showed you that, once you get $x*y$ using $x$, you can not get next element by multiplying into $x*y$ further. Because of commutative property it will be again $x$ or $y$.

Similarly, if we start with $y$, we have the same issue.

This concludes that we can not generate further element and only four element can be there at max.
$\{x,y,x*y,e\}$.
There is a theorem for abelian group: If every element is its own inverse then Group $G$ is abelian. I am not sure if proof of that theorem relates to this problem somewhere, You can check it out. :)

edited
+23

If every element in group G is equals to its own inverse then Group G is abelian Group.

Proof:-

Let (G,*) is a group.

∴  if  a,b ∈ G  then  a−1,b−1 ∈ G //Bcoz in Group inverse exist for every element.

also if a*b ∈ G the (a * b)−1 ∈ G //Bcoz in Group inverse exist for every element.

Given that a=a−1 and b=b−1

so we can write (a * b)=(a*b)−1=b−1 * a−1=(b * a)

i.e, (G,*) is commutative. Hence (G,*) is abelian group.

+1

Nice approach to tackle such problems.Thanks :-)

+5
Also it is given that x*x=e

this means order of group is surely even( By lagrange's theorem)

Since, 3 elements of the group are confirm and they are x,y and e

The group must atleast 4 or 6 or 8...elements.

Now exactly how much?

That is well explained above
0
converse need not be true right?
0
+1

Converse is: If G is an abelian group then then every element is inverse of itself.

This need not be true always.
+1

@SachinMittal, in your answer you have said "This turns out to be abelian group." But how?
If you tell the proof is as given in the Rajesh's comment, then note that this proof says "If every element in group G is equals to its own inverse then Group G is abelian Group." So this proof assumes we know every element. However that is not the case in the given problem and we need to find every element in this question. So we cannot use Rajesh's theorem in this problem, right?

To repeat,
to find every element in the group, Sachin has assumed the fact the given group is abelian.
to prove given group is abelian, Rajest's theorem statement assumes we know all elemens in the group.

We cannot use one to prove other, right?

Thats why I believe, other answer is more correct, which is same as that of geeksforgeeks.

0
Very nice explanation
0

@sushmita-Consider abelian group $(Z,+)$ Set of Integers over addition. It is Abelian group but for all elements except 0 $a^{-1}=-a$, but still this group is abelian.

$x * x=e \quad\Rightarrow \text{x is its own inverse.}$

$y * y=e \quad\Rightarrow \text{y is its own inverse.}$

$(x * y)*(x*y)=e \quad\Rightarrow \text{(x*y) is its own inverse.}$

$(y*x)*(y*x)=e \quad\Rightarrow \text{(y*x) is its own inverse.}$

also $x*x*e=e*e$ can be rewritten as follows,

$x*y*y*x=e*y*y*e=[\therefore y*y=e ]$

$(x*y)*(y*x)=e$ shows that $(x*y) \text{ and }(y*x)$

are each other's inverse and we already know that $(x*y) \text{ and }(y*x)$ are inverse of its own.

As per $(G,*)$ to be group any elenent shouls hsve only one inverse element (unique).

This process $x*y=y*x$ (is one element).

So,the elements of such group are 4 which are $\{x,y,e,x*y\}$

And so the answer is 4.
edited
–1
tell the elements...
+1
can you see the image?
0

I didn't get it.How you got the 4 elements as (x,y,e,xy).?
I know i'm wrong but shouldn't it be (x,y,yx,xy)???

0
Above method is understandable but isn't there some easy way to solve this question ...?
0
can you explain just 1 step

how ?

x∗x∗e=e∗e can be rewritten

x ∗ y∗y∗x =  e∗y∗y∗e     [∴y∗y=e]

Thank you.

the elements which are visible in this group at the first site are = {x, y, e, x*y, y*x}.

we can try generating other elements like
x*x
x*x*x
x*x*x*x
but these will simplify out to
e
x
e
respectively.

Property of a Group is that There can be only one identity element in a group, and each element in a group has exactly one inverse element.

we try to obtain inverse of x*y :
x*x = e
x*x*y = e*y
x*xy*y = y*y
x*xy*y = e
x*x*xy*y = x*e
e*xy*y = x
xy*y*x = x*x
xy * yx = e

This shows us that x*y has another inverse which is y*x. But as per the properties of a Group an element has a unique inverse. We already know that x*y is its own inverse, this is given to us. This makes us to conclude that x*y and y*x are same elements. Since it is given that G is a group and x*y and y*x both are its elements. So to keep them as elements of a Group they must be the same.

Hence there are only 4 elements in the Group (G,*), which are = {x, y, e, x*y} or we can write this set G as = {x, y, e, y*x}

0
Nice explanation.

x* x=e, x is its own inverse
y *y= e, y is its own inverse

(x *y)*( x* y)= e, x *y is its own inverse

(y* x)* (y* x)= e, y* x is its own inverse
also x* x* e= e*e can be rewritten as follows

x* y* y *x= e *y* y* e= e, (Since y *y= e)
(x* y)* (y* x)= e shows that (x *y) and (y *x)
are each other’s inverse and we already know that
(x *y) and (y* x) are inverse of its own.

As per (G,*) to be group any element should have
only one inverse element (unique)

This implies x *y= y* x (is one element)

So the elements of such group are 4 which are {x, y,e,x *y }.

0
how did you prove each element is its inverse?

You have just used elements given in the equation.Group may or may not have more elements

1
2
3
4
5
6