Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Prove that for n5,An is not solvable.

Short Answer

Expert verified

n5,Anis not solvable.

Step by step solution

01

Definition of the abelian group.

An abelian group is a commutative group and satisfy the condition for all a,bin the field extension isab=ba .

02

Step-2: Showing that n≥5,An is not solvable.

Consider the n element of the same ordern which consist in the different subgroup let assume the order of the subgroup and the chain of the of the subgroup is

sn=G0G1........Gi=<1>

Let consist the three element (rst)be any 3 cycle in Snand the two element u,vis the element of the set of the subgroup of order role="math" localid="1657971913247" n and element of the subgroup is role="math" localid="1657971882943" {1,2,.....n} and thsese two element are the exist because n5. Since snover Gi is abelian.

Now the subgroup one is contain two element a,b and a={tus},b={srv}

Then

{tus}{srv}{tus}-1={srv}-1={tus}{srv}{tus}{srv}=(rst)

Therefore the first subgroup G1 contains all the 3 cycle since G2 is abelianover G1. Repeat the process for n order. Hence for each subgroup is abelian and all are contain the 3 cycle which is opposition. Therefore sn is not solvable.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Study anywhere. Anytime. Across all devices.

Sign-up for free