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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

5.2. LAGRANGE’s theory <strong>of</strong> equations 69<br />

had coefficients which depended rationally on the coefficients m and n <strong>of</strong> the original<br />

quadratic (5.5). 35 This may not be so surprising because today this is easily realized by<br />

observing that the coefficients are symmetric in f [(x) (y)] and f [(y) (x)]. However,<br />

this was precisely the result, which LAGRANGE was about to prove.<br />

Subsequently, LAGRANGE carried out the rather lengthy argument for the general<br />

cubic. <strong>The</strong>reby, he proved that the equation which had the six values <strong>of</strong> f under all<br />

permutations <strong>of</strong> the three roots <strong>of</strong> the cubic as its roots would be rationally expressible<br />

in the coefficients <strong>of</strong> the cubic.<br />

Based on these illustrative cases <strong>of</strong> equations <strong>of</strong> low (second and third) degrees,<br />

LAGRANGE could state the following two results as a general theorem generalizing<br />

the argument sketched for the quadratic above. 36 In the general case, the degree <strong>of</strong> the<br />

equation was denoted µ, and the polynomial having all the values which the given<br />

function f assumes under permutations <strong>of</strong> the µ roots was denoted Θ and its degree<br />

ϖ. LAGRANGE then stated:<br />

1. <strong>The</strong> degree ϖ <strong>of</strong> Θ divides µ! where µ is the degree <strong>of</strong> the proposed equation,<br />

and<br />

2. <strong>The</strong> coefficients <strong>of</strong> the equation Θ = 0 depend rationally on the coefficients <strong>of</strong><br />

the original equation.<br />

In his pro<strong>of</strong> <strong>of</strong> this general theorem, LAGRANGE’S notation and machinery re-<br />

stricted his argument slightly. Because he worked with permutations acting on func-<br />

tions and had no way <strong>of</strong> clarifying the underlying sets <strong>of</strong> permutations, his argu-<br />

ments — which contain all the necessary ideas — may seem to rely on analogies with<br />

the cases <strong>of</strong> low degrees. 37 Be that as it may, by any contemporary standards, LA-<br />

GRANGE’S argument must have been a convincing pro<strong>of</strong> and LAGRANGE’S general<br />

theorem became an immensely important tool in the investigations <strong>of</strong> future alge-<br />

braists.<br />

“From this it is clear that the number <strong>of</strong> different functions [i.e. different values<br />

obtained by permuting the arguments] must increase following the products <strong>of</strong><br />

natural numbers<br />

1, 1.2, 1.2.3, 1.2.3.4, . . . , 1.2.3.4.5 . . . µ.<br />

Having all these functions one will have the roots <strong>of</strong> the equation Θ = 0; thus, if<br />

it is represented as<br />

Θ = t ϖ − Mt ϖ−1 + Nt ϖ−2 − Pt ϖ−3 + · · · = 0,<br />

35 (Lagrange, 1770–1771, 361).<br />

36 (ibid., 369–370).<br />

37 Since LAGRANGE’S pro<strong>of</strong> can easily be adapted to newer frameworks <strong>of</strong> pro<strong>of</strong>, this interpretation<br />

may be a matter <strong>of</strong> personal taste. However, I do see a major difference between LAGRANGE’S pro<strong>of</strong><br />

by analogy and pattern and the pro<strong>of</strong> later given by CAUCHY (see below).

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

Saved successfully!

Ooh no, something went wrong!