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.

96 Chapter 5. Towards unsolvable equations<br />

spelled out some <strong>of</strong> the most important algebraic tools <strong>of</strong> the early 19 th century; there-<br />

fore some <strong>of</strong> his tools are briefly sketched in the present context. During the pro<strong>of</strong>,<br />

GAUSS dealt with results such as the Euclidean algorithm applied to polynomials and<br />

the “elementariness” <strong>of</strong> the elementary symmetric functions, both <strong>of</strong> which will be-<br />

come immensely important in ABEL’S theory <strong>of</strong> algebraic solubility as described in<br />

subsequent chapters. Whether ABEL studied any <strong>of</strong> GAUSS’ pro<strong>of</strong>s <strong>of</strong> the fundamen-<br />

tal theorem <strong>of</strong> algebra is not clear; there are no explicit references to these pro<strong>of</strong>s in<br />

ABEL’S writings, nor is ABEL anywhere concerned with the existence <strong>of</strong> roots. 102 Thus,<br />

the similarity <strong>of</strong> methods in GAUSS’ pro<strong>of</strong> and ABEL’S subsequent algebraic research<br />

may equally well be attributed to their belonging to the same common framework and<br />

mathematical tradition.<br />

Explicitly stressing the connection to the procedure used to determine the greatest<br />

common divisor <strong>of</strong> integers, GAUSS applied the Euclidean algorithm to polynomials.<br />

Besides producing the greatest common divisor, the procedure also proved that two<br />

polynomials Y, Y ′ have no (non-trivial) common divisor if and only if there exists an-<br />

other pair <strong>of</strong> polynomials Z, Z ′ such that<br />

ZY + Z ′ Y ′ = 1.<br />

<strong>The</strong> second tool which GAUSS introduced concerned symmetric functions, and<br />

amounts to the central theorem on symmetric functions. By firstly decomposing any<br />

symmetric function <strong>of</strong> a, b, c, . . . in a sum <strong>of</strong> terms<br />

Ma α b β c γ . . .<br />

and secondly imposing an ordering on such terms, GAUSS was able to prove that any<br />

symmetric function could be realized as an entire function <strong>of</strong> the elementary symmet-<br />

ric functions.<br />

Besides these tools, GAUSS’ argument rested upon central properties <strong>of</strong> the quan-<br />

tity which he termed the determinant (today called the discriminant) <strong>of</strong> Y (x) = ∏ (x − x k),<br />

∏ i�=j<br />

� �<br />

xi − xj .<br />

GAUSS was able to demonstrate that the determinant vanishes if and only if Y and<br />

d<br />

dx Y have a common divisor, i.e. a common root.<br />

102 Without references, KLINE writes as if ABEL had given a pro<strong>of</strong> <strong>of</strong> the fundamental theorem <strong>of</strong> algebra<br />

(Kline, 1990, 599). I have not been able to identify such a pro<strong>of</strong>, nor have I any idea how KLINE<br />

had come to believe that ABEL had even worked on it.

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

Saved successfully!

Ooh no, something went wrong!