05.01.2013 Views

RePoSS #11: The Mathematics of Niels Henrik Abel: Continuation ...

RePoSS #11: The Mathematics of Niels Henrik Abel: Continuation ...

RePoSS #11: The Mathematics of Niels Henrik Abel: Continuation ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

5.7. Some algebraic tools used by GAUSS 95<br />

was the 3-cycle<br />

� �<br />

αβγ<br />

. (5.16)<br />

γαβ<br />

Thus, given any 3-cycle (5.16), the two p-cycles (5.15) could be formed. Under the hy-<br />

pothesis, these p-cycles left K unaltered, whereby the same was true <strong>of</strong> their product,<br />

i.e. the 3-cycle (5.16).<br />

In the third and final part <strong>of</strong> the pro<strong>of</strong> CAUCHY established that if the value <strong>of</strong><br />

K was unaltered by all 3-cycles, the function K would either be symmetric or have<br />

two different values. In his pro<strong>of</strong>, analogous to the second part described above, he<br />

decomposed the 3-cycle<br />

� �<br />

αβγ<br />

γαβ<br />

into the product <strong>of</strong> the two transpositions<br />

� �� �<br />

αβ βγ<br />

βα γβ<br />

which he wrote as (αβ) (βγ). This step <strong>of</strong> the pro<strong>of</strong> corresponds to proving that the<br />

alternating group An is generated by all 3-cycles.<br />

In the remaining part <strong>of</strong> the paper, CAUCHY demonstrated for functions <strong>of</strong> six<br />

arguments, if R < 5 the function would necessarily be symmetric or have two values.<br />

Generally, CAUCHY noted, for n > 4 no functions <strong>of</strong> n quantities were known which<br />

had less than n values without this number being either 1 or 2. After these two early<br />

papers on the theory <strong>of</strong> permutations, CAUCHY would let the topic rest for 30 years<br />

being preoccupied with his many other research themes and his teaching. When he<br />

finally returned to the theory <strong>of</strong> permutations in the 1840s, CAUCHY demonstrated the<br />

following generalization <strong>of</strong> his 1815 result: That no function <strong>of</strong> n quantities could take<br />

on less than n values without either being symmetric or taking on exactly 2 values. 99<br />

With his paper, 100 CAUCHY founded the theory <strong>of</strong> permutations by providing it<br />

with its principal objects: the permutations. He introduced terms and notation which<br />

enabled him to grasp the substitutions as objects abstracted from their action on the<br />

formal values <strong>of</strong> a function, and he provided an important theorem in this new theory<br />

which he based on an elegant, non-computational pro<strong>of</strong>.<br />

5.7 Some algebraic tools used by GAUSS<br />

GAUSS’ first pro<strong>of</strong> <strong>of</strong> the Fundamental <strong>The</strong>orem <strong>of</strong> Algebra had, in a central way, de-<br />

pended on geometrical (topological) intuitions. In 1815, GAUSS published a second<br />

pro<strong>of</strong> <strong>of</strong> the theorem, 101 this time applying algebraic methods. In the process, GAUSS<br />

99 (Dahan, 1980, 281–282).<br />

100 (A.-L. Cauchy, 1815a).<br />

101 (C. F. Gauss, 1815). Eventually, GAUSS would publish two further pro<strong>of</strong>s (one in 1816 and one in<br />

1849) bringing his total to four.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!