Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Abel–Ruffini theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Galois correspondence=== The [[Galois correspondence]] establishes a [[one to one correspondence]] between the [[subextension]]s of a normal field extension <math>F/E</math> and the subgroups of the Galois group of the extension. This correspondence maps a field {{mvar|K}} such <math>E\subseteq K \subseteq F</math> to the [[Galois group]] <math>\operatorname{Gal}(F/K)</math> of the [[field automorphism|automorphisms]] of {{mvar|F}} that leave {{mvar|K}} fixed, and, conversely, maps a subgroup {{mvar|H}} of <math>\operatorname{Gal}(F/E)</math> to the field of the elements of {{mvar|F}} that are fixed by {{mvar|H}}. The preceding section shows that an equation is solvable in terms of radicals if and only if the Galois group of its [[splitting field]] (the smallest field that contains all the roots) is [[solvable group|solvable]], that is, it contains a sequence of subgroups such that each is [[normal subgroup|normal]] in the preceding one, with a [[quotient group]] that is [[cyclic group|cyclic]]. (Solvable groups are commonly defined with [[abelian group|abelian]] instead of cyclic quotient groups, but the [[fundamental theorem of finite abelian groups]] shows that the two definitions are equivalent). So, for proving the Abel–Ruffini theorem, it remains to show that the [[symmetric group]] <math>S_5</math> is not solvable, and that there are polynomials with symmetric Galois groups.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)