Sophomore's dream

In mathematics, sophomore's dream is the pair of identities (especially the first) discovered in 1697 by Johann Bernoulli.

The name "sophomore's dream", which appears in (Borwein, Bailey & Girgensohn 2004), is in contrast to the name "freshman's dream" which is given to the incorrect[note 1] identity (x + y)n = xn + yn. The sophomore's dream has a similar too-good-to-be-true feel, but is true.

Proof Graph of the functions y = xx and y = xx on the interval x  (0, 1].

We prove the second identity; the first is completely analogous.

The key ingredients of the proof are:

Expand xx as Therefore, we have : By uniform convergence of the power series, we may interchange summation and integration To evaluate the above integrals we perform the change of variable in the integral , with , giving us By the well-known Euler's integral identity for the Gamma function so that: Summing these (and changing indexing so it starts at n = 1 instead of n = 0) yields the formula.

Historical proof

The original proof, given in Bernoulli (1697), and presented in modernized form in Dunham (2005), differs from the one above in how the termwise integral is computed, but is otherwise the same, omitting technical details to justify steps (such as termwise integration). Rather than integrating by substitution, yielding the Gamma function (which was not yet known), Bernoulli used integration by parts to iteratively compute these terms.

The integration by parts proceeds as follows, varying the two exponents independently to obtain a recursion. An indefinite integral is computed initially, omitting the constant of integration both because this was done historically, and because it drops out when computing the definite integral. One may integrate by taking u = (ln x)n and dv = xm dx, which yields: (also in the list of integrals of logarithmic functions). This reduces the power on the logarithm in the integrand by 1 (from to ) and thus one can compute the integral inductively, as where (n) i denotes the falling factorial; there is a finite sum because the induction stops at 0, since n is an integer.

In this case m = n, and they are integers, so Integrating from 0 to 1, all the terms vanish except the last term at 1,[note 2] which yields: From a modern point of view, this is (up to a scale factor) equivalent to computing Euler's integral identity for the Gamma function, on a different domain (corresponding to changing variables by substitution), as Euler's identity itself can also be computed via an analogous integration by parts.

Notes

1. Incorrect unless one is working over a field or unital commutative ring of prime characteristic n or a factor of n. The correct result is given by the binomial theorem.
2. All the terms vanish at 0 because by l'Hôpital's rule (Bernoulli omitted this technicality), and all but the last term vanish at 1 since ln(1) = 0.

References

Formula

• Johann Bernoulli, 1697, collected in Johannis Bernoulli, Opera omnia, vol. 3, pp. 376–381
• Borwein, Jonathan; Bailey, David H.; Girgensohn, Roland (2004), Experimentation in Mathematics: Computational Paths to Discovery, pp. 4, 44, ISBN 978-1-56881-136-9
• Dunham, William (2005), "3: The Bernoullis (Johann and )", The Calculus Gallery, Masterpieces from Newton to Lebesgue, Princeton, NJ: Princeton University Press, pp. 46–51, ISBN 978-0-691-09565-3
• OEIS, (sequence A083648 in the OEIS) and (sequence A073009 in the OEIS)
• Pólya, George; Szegő, Gábor (1998), "part I, problem 160", Problems and Theorems in Analysis, p. 36, ISBN 978-3-54063640-3