The Short Life of Evariste Galois: by Tony Rothman
The Short Life of Evariste Galois: by Tony Rothman
the night before he was fatally shot in a duel. More careful investigation
by Tony Rothman
n the early morning hours of May years later the manuscripts he had left geni us, oppressed by the stupidity of his
136
137
138
139
I
II: n spite of the setbacks Galois re
u::
mained a productive mathematician
140
PERMUJ'ATIONS IN S(3) can invariably be written as the product called a normal subgroup of S(3) if for any element h in A(3) and any
of permutations that interchange only two objects. If a permutatiou elementg in S(3), the elementg* h *g-l is also an element of A(3). To
can be written as a product of au even number of such interchanges, prove thatA(3) is a normal subgroup of S(3) supposeg is an even per
it is called an even permutation; otherwise it is an odd permutation. mutation. Then g* h *g-l is the product of three even permutations,
If an even permutation (colored circles) is multiplied by an even per which is also an even permutation and so is a member of A(3). If g is
mutation (colored arrows), the product is an even permutation; if an an odd permutation,g* h *g-l is the product of an odd by an even by
even pern.utation is multiplied by an odd permutation (black arrows), an odd permutation, which is again an even permutation. Hence A (3)
the product is odd. Similarly, if an odd permutation (black circles) is is a normal subgroup. By a similar argument it can be shown that for
multiplied by an even permutation, the product is odd, whereas if an any number n, A(n) is a normal subgroup of S(n). The number of ele
odd permutation is multiplied by an odd permutation, the product is ments in a subgroup must divide the number of elements in the parent
even. The even permutations form a subgroup, namely the subgroup group without remainder. Because A(n) bas half as many elements
printed in color in the bottom illustration on page 140. This subgroup as S(n), A(n) includes the maximum number of elements that a prop
is called the alternating group, or A(3). A subgroup such as A(3) is er subgroup of S(n) can have. A(n) is the maximal normal subgroup.
142
discoverer. 1(,
To teach.To
encourag e.
But most of
all, to illterest.
chilcllil<e '-''-''-'" '-'>"-J '-'
ax3 + bx2 + ex + d =
0 IS S(3).
THE MAXIMAL NORMAL SUBGROUP OF S(3) IS A(3).
THE MAXIMAL NORMAL SUBGROUP OF A(3) IS I.
[S(3)/A(3)1 =3!/3 613 2.
= =
(I 52 (I 32
241 2 51
(I 53 (I 34 (24
31
(135
\
421 521
(I 5 3 (I 34 (25
31
(145
1
A(5) 241 31
31 41 , 2
( I 5 42 (I 3 5 (25 (23
41 (
(151
321 421 41 41
(I 54 (I 3 5 ( 35 (2:3
51
(15 1'(2
351 51 !II
(I 42 (I 23
4 1 (341
(245 (151
'
531 541 45 1 '1(3
41
(I 42 (I 23 (34
51
(2 31'( (12
35 1 ' 3
( 51 (351
(I 24 (132
1
(241 (121'
(I 24
5 31 1 '(3
41 (451
(142 (251 (121'
1 (241
(152 (12
31 (131'
31 1 1 251
(14 (124 (131'
1 (451
(125 (131'
41 ( 231
(13 (141'
(251
((41'
1
.(:35
(141
SOLUTION OF EQUATIONS was the problem for which Galois solvable if it generates a series of maximal normal subgroups whose
developed group theory. A general method of solution would employ composition factors (determined from the number of elements in the
only addition, subtraction, multiplication, division and the extraction parent group and the subgroups) are prime numbers. The composition
of roots, and it could be applied to any equation of degree n, where factors generated by S(3) and its series of maximal normal subgroups
11 is the highest power to which a variable is raised. Galois proved are all prime numbers. It follows that all third-degree equations are
that no such method exists when n is equal to 5 or more. Every equa solvable. When n is equal to 5 or more, however, it can be proved that
tion of degree 11 can be associated with the group S(II) or with some the maximal normal subgroup of A(n) is the identity group I, which
subgroup of S(n); the group associated with an equatioD is now called includes only the identity element. Since A (11) is the maximal normal
the Galois group of the equation. Galois showed that an equation subgroup of S(n), the composition factors of S(II) when 11 is equal to
can be solved by the methods of arithmetic and root extraction only 5 or more are not all prime numbers. Hence there are equations of
if its Galois group is what he defined as a solvable group. A group is degree 5 or greater that cannot be solved by the allowed methods.
144
145
called sporadic finite simple groups is a objects, includes the 3! (or six) permuta n - sac PROGRAMMAIlI CALCULATOR
complete list. In a sense this finding im tions (1), (12), (13), (23), (123) and (132). o Over 170 functions end operations 0 Up to 480
program steps or up to 60 memories 0 Complete
plies that the components or building Here (1) is the identity permutation that programming editing features. Constant memory
blocks of any group with a finite num leaves any arrangement of objects un • Includes master library
147
or uv + w - l . Any such function can pie without knowing the values of the subgroup of S(3), for instance. is [( 1 ).
be converted into a related function by roots of the equation. For Galois's pur ( 1 23 ), ( 1 3 2)]. In turn the maximal nor
permuting the roots u, v and w. For poses, however, the calculation was not mal subgroup of [( 1 ). ( 1 23 ). ( 1 3 2)] is
example. the permutation ( 1 2) inter necessary. All he needed to show was [( 1 )]. The composition factor defined for
changes u and v and so converts the that there are invariably equations of S(3) and its subgroup [( 1 ). ( 1 2 3 ). ( 1 3 2)]
function u - v into the function v - u. degree n whose Galois group is the larg is 6 / 3 or 2, and the composition factor
Many functions of the roots are changed est-possible group of permutations of for the group [( 1), ( 1 23 ). ( 1 3 2)] and its
in value by such a permutation, but the roots, namely S(n). subgroup [( 1 )] is 3 / l or 3. Since both 2
some of them are not. For example, and 3 are prime numbers. S(3) is a solv
the function u + v + w is not changed he second concept introduced by able group.
in value by any permutation of u, v and T Galois was the concept of a normal The term solvable group is well j usti
w. Since the group S(3) includes all pos subgroup. A subgroup H of a group G is fied by Galois's theory: he was able to
sible permutations of u, v and w, u + normal in G if and only if the following show that an equation is solvable by
v + w is said to be invariant under S(3). condition is satisfied: When one "multi radicals if and only if the Galois group
It is possible to show that the value of plies" any element h of the subgroup H of the equation is a solvable group. In
u + v + w is a rational number for any on the left by any element g of the parent order to prove that equations of the fifth
third-degree equation with rational co group G, and then "multiplies" the prod degree or higher cannot in general be
efficients. Other polynomial functions uct on the right by g - l (the inverse ele solved by radicals. Galois had to show
of the roots may be rational for some ment of g), the result is an element of that there are equations of this kind for
equations and irrational for others, de the subgroup H. Symbolically, if H is which the Galois group is not a solvable
pending on the coefficients of the equa normal in G, there is an element h in H I one. As it happens the group S(n) is not a
tion. If the value of such a function is such that h' =g . h • g- l. For example, solvable group when n is equal to 5 or
rational, there exists some group of per one can verify that [( 1), ( 1 2 3 ), ( 1 3 2)] is more [see illustrations on pages 142
mutations of u, v and w that do not a normal subgroup of S(3) [see illustra and 144]. Since for all such values of n
change the value of the function. The tion on page 142]. there are equations of degree n for which
Galois group of an equation is the larg If a finite group G has any normal S(n) is the Galois group, the general
est group of permutations that meet this subgroups at all, there must be one sub equation of the fifth degree or higher is
requirement for every rational-valued group whose order is the largest of all not solvable.
polynomial function of the roots. In the normal subgroups of G: it is called
other words, for any polynomial func the maximal normal subgroup of G: y the time Galois's work on group
tion of the roots that has a rational val Similarly, a maximal normal subgroup B theory was nearly completed. the
ue, every permutation in the Galois may in turn have a maximal normal sub events of his life had become markedly
group leaves the value of the function group of its own. and the sequence of political. In J uly. 1 83 0. the republican
unchanged. When a permutation of the maximal normal subgroups continues opponents of the restored monarchy
roots does not change the value of any until the smallest normal subgroup pos took to the streets and the revolution
rational-valued polynomial function of sible is reached. Any group G therefore forced the Bourbon king Charles X into
the roots, the roots are indistinguishable generates a sequence of maximal nor exile. While the students of the left-wing
Ecole Poly technique played an active
beled G, H. L J,
for that permutation. Hence the larger mal subgroups. If the sequence is la
the number of elements in the Galois then .a series of maxi
. . . • role in the fighting. Galois and his fel
group is, the more permutations there mal normal composition factors can be lows at the Ecole Prt!paratoire were
are for which the roots are indistinguish defined: [GI H]. [HI 1]. [1/ J] and so on. locked up in the school by its director.
able. For this reason the Galois group is The third important concept of Ga Inc'e nsed. Galois tried to scale the walls;
a powerful way of representing the sym lois's theory is the concept of a solvable he failed and thereby missed the brief
metry properties of an equation. group. Galois calls a group solvable if revolution.
Calculating the Galois group for a every one of the maximal normal com Although the Bourbon abdication
given equation is generally difficult, al position factors generated by the group seemed a great victory for the republi
though it can always be done in princi- is a prime number. The maximal normal cans. it proved a short-lived one. Louis
148
149