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.

8.3. Refocusing on the equation 175<br />

<strong>The</strong> central question <strong>of</strong> this part <strong>of</strong> the paper was whether k1 = ν, i.e. whether all<br />

the roots <strong>of</strong> P = 0 were found in the sequence above. ABEL answered this important<br />

question by a nice application <strong>of</strong> GAUSS’ primitive roots, although his presentation<br />

in the notebook becomes increasingly obscure (see figure 8.1). Eventually, nothing<br />

but a sequence <strong>of</strong> equations can be found. However, ABEL’S intended argument can<br />

be inferred and reconstructed. In the following, I add some explanation to ABEL’S<br />

equations based on arguments by HOLMBOE and SYLOW. 25<br />

In order to demonstrate that s<br />

1 1<br />

µ µ<br />

1 , . . . , sk<br />

were rational functions <strong>of</strong> s<br />

1 1 µ , ABEL let m<br />

denote a primitive root <strong>of</strong> the modulus µ and recast the procedure described above as<br />

1<br />

µ<br />

s1<br />

1<br />

µ<br />

s2<br />

= p0s mα<br />

µ ,<br />

m<br />

= p1s<br />

α<br />

µ<br />

1 ,<br />

1<br />

µ<br />

sk<br />

= pk−1s mα<br />

µ .<br />

At some point, say after the k th iteration, the procedure would stabilize and give<br />

s 1 m<br />

µ = s αk k−1<br />

µ × ∏ p<br />

u=0<br />

muα<br />

k−u−1 .<br />

By the same argument as above, ABEL could write<br />

m αk − 1<br />

µ<br />

.<br />

(8.7)<br />

= integer, (8.8)<br />

and he concluded that k divided µ − 1. This conclusion can be seen to impose a mini-<br />

mality condition upon k with respect to (8.8). However, in ABEL’S equations no men-<br />

tion <strong>of</strong> such a minimality requirement can be found. <strong>The</strong> congruence (8.8)<br />

led ABEL to introduce n such that<br />

m αk ≡ 1 (mod µ)<br />

αk = (µ − 1) n.<br />

In subsequent reasoning, ABEL repeatedly used the fact that (k, n) = 1 without going<br />

into details. However, it is a consequence <strong>of</strong> the minimality <strong>of</strong> k mentioned above.<br />

Through a sequence <strong>of</strong> deductions based on primitive roots and congruences inspired<br />

by GAUSS, ABEL could link a number β to the sequence (8.7) such that<br />

βk = µ − 1.<br />

25 (Holmboe in N. H. <strong>Abel</strong>, 1839, vol. 2, 288–293), (Sylow in N. H. <strong>Abel</strong>, 1881, vol. 2, 329–338), and (L.<br />

Sylow, 1902, 18–22).

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

Saved successfully!

Ooh no, something went wrong!