Earlier quoted context omitted.
A quicker proof is to just differentiate. For |r| 1 + r + r^2 + ... = 1/(1-r) Differentiate both sides of the equation: 1 + 2r + 3r^2 + ... = 1/(1-r)^2 Here's a bijective combinatorial proof, which I like best of all. It uses the concept of generating functions. As a caveat, it only shows the equality for formal power series, not analytic power series. The series 1 + r + r^2 + ... = 1/(1-r) is the type of tuples with…
Thanks ...the differential proof is very insightful and perhaps says something about differentiation itself. EDIT 1: Forgive my ignorance but can you please elaborate on 1 + r + r^2 + ... = 1/(1-r) is the type of tuples with entries in r ? EDIT 2: Okay I think I get it. 1 + r + r 2 are the terms in the expansion of (1+r) n
> >1 + r + r^2 + ... = 1/(1-r) is the type of tuples with entries in r ?
r^n is the type of n-tuples with entries in r. When you sum over all n, you get the type of tuples of any length with entries in r.
One thing that might be confusing you is that I'm thinking of r itself as a type, not as a number. You get a number from a type by counting its elements, but a type has much more structure than just its size.