Question and Answers Forum

All Questions      Topic List

Algebra Questions

Previous in All Question      Next in All Question      

Previous in Algebra      Next in Algebra      

Question Number 189013 by Pengu last updated on 10/Mar/23

Suppose (G, ∙ ) and (H, ∗ ) are groups.  Take homomorphism φ : G → H.  Suppose ∃g∈G : ∣g∣ = n, then ∣φ(g)∣ ≤ n.     Does ∀g∈G, ∣g∣ = ∣φ(g)∣ ⇒ G ≅ H ?

Suppose(G,)and(H,)aregroups.Takehomomorphismϕ:GH.SupposegG:g=n,thenϕ(g)n.DoesgG,g=ϕ(g)GH?

Answered by aleks041103 last updated on 11/Mar/23

suppose ∣φ(g)∣=m>n.  ⇒(φ(g))^k ≠id_H , k=1,2,...,m−1  But, since φ is a homomorhism, then  (φ(g))^k =φ(g^k )  let k=n<m⇒(φ(g))^n =φ(g^n )=φ(id_G )=id_H   but since n<m, then (φ(g))^n ≠id_H   ⇒id_H ≠id_H ⇒contradiction  ⇒∣φ(g)∣≤∣g∣

supposeϕ(g)∣=m>n.(ϕ(g))kidH,k=1,2,...,m1But,sinceϕisahomomorhism,then(ϕ(g))k=ϕ(gk)letk=n<m(ϕ(g))n=ϕ(gn)=ϕ(idG)=idHbutsincen<m,then(ϕ(g))nidHidHidHcontradiction⇒∣ϕ(g)∣⩽∣g

Commented by aleks041103 last updated on 11/Mar/23

Note:  φ:(G,∙)→(H,∗) is a homomorhism  iff  φ(g_1 ∙g_2 )=φ(g_1 )∗φ(g_2 )  ⇒ the following properties are following    φ(id∙g)=φ(g)=φ(id)∗φ(g)=id∗φ(g)  ⇒since id is unique then  φ(id)=id    ⇒φ(g^(−1) ∙g)=φ(g^(−1) )∗φ(g)=φ(id)=id  ⇒φ(g^(−1) )=(φ(g))^(−1)

Note:ϕ:(G,)(H,)isahomomorhismiffϕ(g1g2)=ϕ(g1)ϕ(g2)thefollowingpropertiesarefollowingϕ(idg)=ϕ(g)=ϕ(id)ϕ(g)=idϕ(g)sinceidisuniquethenϕ(id)=idϕ(g1g)=ϕ(g1)ϕ(g)=ϕ(id)=idϕ(g1)=(ϕ(g))1

Answered by aleks041103 last updated on 11/Mar/23

For the second question:  if φ∈Hom(G,H) is surjective   and ∀g∈G:∣g∣=∣φ(g)∣ then G≅H.    suppose φ isnt injective  then  ∃g_1 ,g_2 ∈G and g_1 ≠g_2  such that  φ(g_1 )=φ(g_2 )  ⇒(φ(g_1 ))^(−1) ∗φ(g_1 )=(φ(g_1 ))^(−1) ∗φ(g_2 )  id_H =φ(g_1 ^(−1) ∙g_2 )=φ(g_3 )  since ∣g∣=∣φ(g)∣⇒1=∣id_H ∣=∣φ(g_3 )∣=∣g_3 ∣  ⇒∣g_3 ∣=1⇒g_3 ^1 =g_3 =id_G   ⇒g_1 ^(−1) ∙g_2 =id_G ⇒g_1 =g_2 ⇒contradiction  ⇒φ is injective.  Since φ is also surjective⇒φ is bijective  ⇒φ is bijective homomorphism  ⇒φ is a isomorphism  ⇒G≅H    if G≅H then ∃bij. homomorhism φ:G→H  then it is obvious that ∣φ(g)∣=∣g∣ for ∀g∈G

Forthesecondquestion:ifϕHom(G,H)issurjectiveandgG:∣g∣=∣ϕ(g)thenGH.supposeϕisntinjectivetheng1,g2Gandg1g2suchthatϕ(g1)=ϕ(g2)(ϕ(g1))1ϕ(g1)=(ϕ(g1))1ϕ(g2)idH=ϕ(g11g2)=ϕ(g3)sinceg∣=∣ϕ(g)∣⇒1=∣idH∣=∣ϕ(g3)∣=∣g3⇒∣g3∣=1g31=g3=idGg11g2=idGg1=g2contradictionϕisinjective.SinceϕisalsosurjectiveϕisbijectiveϕisbijectivehomomorphismϕisaisomorphismGHifGHthenbij.homomorhismϕ:GHthenitisobviousthatϕ(g)∣=∣gforgG

Terms of Service

Privacy Policy

Contact: info@tinkutara.com