Let H be a team of stimulate 3. By meaning of group, there deserve to be just one identity element in the team H.
You are watching: Prove that a group of order 3 must be cyclic
So, $H=\left \ e,x,y \right \$.
By definition of cyclic group,
we have actually that the aspects x and y
$x=g^n \exists n \in \urbanbreathnyc.combbZ$
$y=g^n \exists n \in \urbanbreathnyc.combbZ$
In particular, n is confident for if it were not, a contradiction would arise from having an ext than one identification element.
Any clues or assistance is appreciated.
Thank in advance.
asked Jun 2 "16 at 10:15
5,42966 gold badges5252 silver- badges102102 bronze badges
$\begingroup$ In third and 4th line of her attempt of systems you it seems to be ~ to assume the thesis ("$H$ is cyclic") as a hypothesis, making your discussion circular. $\endgroup$
Jun 2 "16 in ~ 10:19
include a comment |
2 answers 2
active oldest Votes
You"re trying to PROVE that $G$ is cyclic, for this reason you can not (yet) assert that $x = g^n$. Instead, think about $x \cdot x$. It have to be either $x, y,$ or $e$. If it"s $x$, then you have$$x^2 = x\\x^2 (x^-1) = x x^-1\\x = e$$which is a contradiction, because $x$ and also $e$ are distinct aspects of the group.
If $x^2 = e$, then $x$ has order 2, yet 2 does no divide 3, for this reason this contradicts Lagrange"s theorem.
Finally, we conclude that $x^2 = y$, and thus the team is cyclic, produced by the facet $g = x$.
Alternative if friend don"t choose Lagrange yet:
In the instance where we intend that $x^2 = e$:
The aspects $xe, xx,$ and $xy$ must all be distinctive for if two were the same, climate multiplying by $x^-1$ top top the left would display that 2 of $e, x, y$ to be the same, i m sorry is impossible.
Since $xe = x$ and we"re presume $x^2 = e$, us must have $$xy = y.$$multiplying ~ above the best by $y^-1$ offers $x = e$, a contradiction. For this reason $x^2 = e$ is likewise impossible.
answered Jun 2 "16 at 10:20
john HughesJohn Hughes
86.6k44 gold badges6666 silver- badges125125 bronze badges
add a comment |
Actually, any kind of group of prime order is cyclic.
Indeed, allow $p=\lvert G\rvert$ and $a\in G$, $a\ne e$. By Lagrange"s theorem, the subgroup $\langle\mkern1.5mu a\mkern1.5mu \rangle$ produced by $a$ has order a divisor that $\lvert G\rvert=p$, and is $>1$ since $a\ne e$, whence $\lvert\langle\mkern1.5mu a\mkern1.5mu \rangle\rvert=p$, i.e. $\;\langle\mkern1.5mu a\mkern1.5mu \rangle=G$.
reply Jun 2 "16 in ~ 10:35
167k99 gold badges5959 silver- badges157157 bronze title
include a comment |
Thanks because that contributing an answer to urbanbreathnyc.comematics ridge Exchange!Please be certain to answer the question. Provide details and also share your research!
But avoid …Asking because that help, clarification, or responding to other answers.Making statements based on opinion; ago them increase with references or personal experience.
Use urbanbreathnyc.comJax to style equations. Urbanbreathnyc.comJax reference.
To learn more, see our tips on writing good answers.
See more: " If I Were Nothing More Lyrics By Nothing More, Nothing More
Sign increase or log in in
authorize up using Google
sign up making use of Facebook
sign up using Email and also Password
Post together a guest
email Required, however never shown
Post together a guest
Required, yet never shown
post Your prize Discard
Not the prize you're feather for? Browse other questions tagged abstract-algebra group-theory or questioning your own question.
Featured top top Meta
stimulate of elements in a cyclic team
show that $\urbanbreathnyc.combbZ_2 \times \urbanbreathnyc.combbZ_4$ is no a cyclic group
Prove that a cyclic group can have actually no more than one element of order two.
Prove the a cyclic group with much more than one element may be a homomorphic picture of a no cyclic group.
show that in any type of cyclic additive team of an odd order the sum of all aspects is same to the identity facet 0.
present that any cyclic group of also order has exactly one facet of order $2$
Subgroup the a Dihedral team is Cyclic proof
just how do I present that a finite team $G$ of order $n$ is cyclic if over there is at most one subgroup of bespeak $d$ for each $d\mid n$?
warm Network inquiries an ext hot questions
i ordered it to RSS
question feed To subscribe to this RSS feed, copy and paste this URL right into your RSS reader.
stack Exchange Network
site architecture / logo © 2021 stack Exchange Inc; user contributions license is granted under cc by-sa. Rev2021.9.24.40305