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.

78 Chapter 5. Towards unsolvable equations<br />

<strong>The</strong> other cases, which in the presently adopted notation can be described as<br />

2.P �= ˆP and P ∩ ˆP �= ∅,<br />

3.Q ∩ ˆQ �= ∅, and<br />

4.P ∩ ˆP = ∅ and Q ∩ ˆQ = ∅,<br />

could all be brought to a contradiction, either directly or by referring to the first case<br />

described above.<br />

<strong>The</strong> fruitfulness <strong>of</strong> the pro<strong>of</strong> <strong>of</strong> the irreducibility <strong>of</strong> X was that it demonstrated<br />

that if X was decomposed into factors <strong>of</strong> lower degrees (such as 5.10) some <strong>of</strong> these<br />

had to have irrational coefficients. Thus any attempt at determining the roots would<br />

have to involve equations <strong>of</strong> degree higher than one. <strong>The</strong> purpose <strong>of</strong> the following<br />

investigation was to gradually reduce the degree <strong>of</strong> these equations to minimal values<br />

by refining the system <strong>of</strong> roots.<br />

5.3.3 Outline <strong>of</strong> GAUSS’s pro<strong>of</strong><br />

Continuing from the result above that any root r in Ω was a primitive n th root <strong>of</strong> unity,<br />

GAUSS wrote [1] , [2] , . . . , [n − 1] for the associated powers <strong>of</strong> r. He introduced the con-<br />

cept <strong>of</strong> periods by defining the period ( f , λ) to be the set <strong>of</strong> the roots [λ] , [λg] , . . . , � λg f −1� ,<br />

where f was an integer, λ an integer not divisible by n, and g a primitive root <strong>of</strong> the<br />

modulus n. Connected to the period, he introduced the sum <strong>of</strong> the period, which he also<br />

designated ( f , λ),<br />

( f , λ) =<br />

f −1 �<br />

∑ λg<br />

k=0<br />

k�<br />

,<br />

and the first result, which he stated concerning these periods, was their independence<br />

<strong>of</strong> the choice <strong>of</strong> g.<br />

Throughout the following argument, GAUSS let g designate a primitive root <strong>of</strong><br />

modulus n and constructed a sequence <strong>of</strong> equations through which the periods (1, g),<br />

i.e. the roots in X = 0 (5.9), could be determined. Assuming that the number n − 1<br />

had been decomposed into primes as<br />

n − 1 =<br />

u<br />

∏ pk, k=1<br />

GAUSS partitioned the roots <strong>of</strong> Ω into n−1<br />

p 1 periods, each <strong>of</strong> p1 terms. From these, he<br />

formed p1 equations X ′ = 0 having the n−1<br />

p 1 sums <strong>of</strong> the form (p1, λ) as its roots. By<br />

a central theorem proved using symmetric functions, 63 he proved that the coefficients<br />

<strong>of</strong> these latter equations depended upon the solution <strong>of</strong> yet another equation <strong>of</strong> de-<br />

gree p1. Thus the solution <strong>of</strong> the original equation <strong>of</strong> degree n had been reduced to<br />

solving p1 equations X ′ = 0 each <strong>of</strong> degree n−1<br />

p 1 and a single equation <strong>of</strong> degree p1.<br />

63 (C. F. Gauss, 1801, §350).

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

Saved successfully!

Ooh no, something went wrong!