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.

196 Chapter 10. Toward rigorization <strong>of</strong> analysis<br />

theorem from Taylor theorem recurred throughout the century and even into the nineteenth<br />

century. 9<br />

EULER’S second pro<strong>of</strong> <strong>of</strong> the binomial theorem based on functional equations. In<br />

his second pro<strong>of</strong> <strong>of</strong> the binomial theorem, published in 1775, 10 EULER devised his<br />

pro<strong>of</strong> following an outline which would recur in most subsequent “rigorous” pro<strong>of</strong>s.<br />

EULER introduced the notation<br />

[m] = 1 + m<br />

1<br />

m (m − 1)<br />

x + x<br />

1 · 2<br />

2 + . . .<br />

to denote the binomial series associated with the exponent m. Thus, proving the bino-<br />

mial theorem thus amounted to proving the equality [m] = (1 + x) m . <strong>The</strong> central step<br />

in the pro<strong>of</strong> was the realization that the brackets satisfied a functional equation 11<br />

[m + n] = [m] · [n] .<br />

EULER’S pro<strong>of</strong> <strong>of</strong> the functional equation was based on formally multiplying the corre-<br />

sponding infinite series. Once EULER had obtained the above functional equation and<br />

the binomial formula secured the equality [m] = (1 + x) m for integral m, he extended<br />

the domain for m by the computation<br />

[1] =<br />

�<br />

m · 1<br />

� � �m 1<br />

=<br />

m m<br />

⇒<br />

m,n∈N<br />

�<br />

n<br />

�<br />

= [n]<br />

m<br />

1 m = (1 + x) n m .<br />

Thus, EULER proved the binomial theorem for all fractional exponents and claimed —<br />

without giving any pro<strong>of</strong> — that it extended to all real exponents by way <strong>of</strong> continuity<br />

(see below). In summary, the central steps <strong>of</strong> EULER’S second pro<strong>of</strong> <strong>of</strong> the binomial<br />

theorem are:<br />

1. <strong>The</strong> binomial formula, [m] = (1 + x) m for m ∈ N.<br />

2. <strong>The</strong> functional equation [m + n] = [m] · [n] proved by manipulating the associ-<br />

ated power series.<br />

3. An extension to rational exponents.<br />

4. A further extension to real exponents by continuity arguments.<br />

In complete correspondence with his views on formal equality, EULER did not ven-<br />

ture into considerations <strong>of</strong> the convergence <strong>of</strong> the infinite expression contained in the<br />

binomial theorem. To him, the theorem simply stated a formal equivalence <strong>of</strong> two<br />

different representations <strong>of</strong> the same function (expression).<br />

9 On the pro<strong>of</strong> by WALLACE, see (Craik, 1999, 252–253).<br />

10 (L. Euler, 1775).<br />

11 For the history <strong>of</strong> functional equations, mainly with CAUCHY, see (J. Dhombres, 1992).

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

Saved successfully!

Ooh no, something went wrong!