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.

6.3. Classification <strong>of</strong> algebraic expressions 107<br />

which was an equation <strong>of</strong> degree at most µ − 1 having some <strong>of</strong> the roots <strong>of</strong> the irre-<br />

ducible (6.8) as its roots. In this connection, ABEL actually used the word “irreducible”<br />

for the first time (see the quotation below). Consequently, the polynomial <strong>of</strong> (6.9)<br />

would have to be the zero polynomial and a contraction had been reached:<br />

“But since the equation z µ + tµ−1z µ−1 · · · = 0 is irreducible, it must, since it is<br />

<strong>of</strong> the µ − 1’st degree give<br />

which is impossible.” 24<br />

α µ − 1 = 0, α − α µ = 0 . . . α µ−1 − α µ = 0;<br />

<strong>The</strong> contradicted assumption was that at least one coefficient among r0, . . . , rn−1<br />

was non-zero, and thus the result (lemma 1) had been demonstrated.<br />

When ABEL considered n different values y1, . . . , yn <strong>of</strong> y resulting from substitut-<br />

ing α k p 1 n for p 1 n in the expression (6.4) for y, he found that these all constituted roots<br />

<strong>of</strong> the equation when it was assumed to be algebraically solvable. Through labori-<br />

ous, albeit not very difficult, algebraic manipulations including a tacit application <strong>of</strong><br />

LAGRANGE’S theorem 1 on resolvents, ABEL then demonstrated that if the equation<br />

was solvable, the coefficients q0, q2, . . . , qn−1 as well as p 1 n would all depend rationally<br />

on these roots (and certain roots <strong>of</strong> unity, such as α). <strong>The</strong>reby, he demonstrated that<br />

all components <strong>of</strong> a top-level algebraic expression solving a solvable equation were ra-<br />

tional functions <strong>of</strong> the equation’s roots. By considering any <strong>of</strong> these components and<br />

working downward in the hierarchy, ABEL demonstrated that this applied equally<br />

well to any component involved in the solution. Thus, he had proved the following<br />

explicitly formulated and very important auxiliary theorem, corresponding to RUF-<br />

FINI’S open hypothesis. 25<br />

<strong>The</strong>orem 3 “When an equation can be solved algebraically, it is always possible to give to<br />

the root [solution] such a form that all the algebraic functions <strong>of</strong> which it is composed can be<br />

expressed by rational functions <strong>of</strong> the roots <strong>of</strong> the given equation.” 26<br />

<strong>The</strong> study <strong>of</strong> algebraic expressions which ABEL had conducted as a preliminary<br />

to his impossibility pro<strong>of</strong> had produced two central results for the pro<strong>of</strong>. Firstly, it<br />

had provided a hierarchy on the algebraic expressions based on the nesting <strong>of</strong> root<br />

extractions. Secondly, it had resulted in the auxiliary theorem stated just above, which<br />

24 “Da nun aber die Gleichung z µ + tµ−1z µ−1 · · · = 0 irreducibel ist, so muß sie, weil sie vom µ − 1 ten<br />

Grade ist, einzeln<br />

α µ − 1 = 0, α − α µ = 0 . . . α µ−1 − α µ = 0<br />

geben; was nicht sein kann.” (ibid., 72).<br />

25 ABEL carried out his deductions in ignorance <strong>of</strong> RUFFINI’S work (see section 6.7).<br />

26 “Wenn eine Gleichung algebraisch auflösbar ist, so kann man der Wurzel allezeits eins solche Form<br />

geben, daß sich alle algebraische Functionen, aus welchen sie zusammengesetzt ist, durch rationale<br />

Functionen der Wurzeln der gegebenen Gleichung ausdrücken lassen.” (ibid., 73).

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

Saved successfully!

Ooh no, something went wrong!