%ap.tex:
%%a Plain TeX file by Doron Zeilberger (x pages)

%begin macros
\def\L{{\cal L}}
\baselineskip=14pt
\parskip=10pt
\def\halmos{\hbox{\vrule height0.15cm width0.01cm\vbox{\hrule height
  0.01cm width0.2cm \vskip0.15cm \hrule height 0.01cm width0.2cm}\vrule
  height0.15cm width 0.01cm}}
\font\eightrm=cmr8 \font\sixrm=cmr6
\font\eighttt=cmtt8
\magnification=\magstephalf
\def\P{{\cal P}}
\def\Q{{\cal Q}}
\def\1{{\overline{1}}}
\def\2{{\overline{2}}}
\parindent=0pt
\overfullrule=0in
\def\Tilde{\char126\relax}
\def\frac#1#2{{#1 \over #2}}
%\headline={\rm  \ifodd\pageno  \RightHead  \else  \LeftHead  \fi}
%\def\RightHead{\centerline{
%Title
%}}
%\def\LeftHead{ \centerline{Doron Zeilberger}}
%end macros
\bf
\centerline
{
A  Proof in the Style of George Andrews 
}
\centerline
{
(and G. H. Hardy, and Unfortunately MANY other, otherwise very smart, people)
}
\centerline
{
That $\sum_{i=0}^{n} 1 = n+1$ 
}
\rm
\bigskip
\centerline{ {\it
Doron 
ZEILBERGER}\footnote{$^1$}
{\eightrm  \raggedright
Department of Mathematics, Rutgers University (New Brunswick),
Hill Center-Busch Campus, 110 Frelinghuysen Rd., Piscataway,
NJ 08854-8019, USA.
%\break
{\eighttt zeilberg  at math dot rutgers dot edu} ,
\hfill \break
{\eighttt http://www.math.rutgers.edu/\~{}zeilberg/} .
\hfill \break
Exclusively published in {\eighttt http://www.math.rutgers.edu/\~{}zeilberg/pj.html} .
Jan. 3, 2013.
}
}

{\bf Theorem:} Let $n$ be a non-negative integer, then we have the following identity
$$
\sum_{i=0}^{n} 1 = n+1 \quad .
$$
{\bf Proof}: Recall that
$$
\frac{1}{1-z }= \sum_{n=0}^{\infty} z^n = \sum_{n=0}^{\infty} \, 1 \cdot z^n 
\quad,
$$
valid for all complex numbers $z$ such that $|z|<1$.
Squaring both sides, we get
$$
\left ( \frac{1}{1-z}  \right )^2= \left ( \sum_{n=0}^{\infty} 1 \cdot z^n \right )^2 \quad .
$$
Hence
$$
\frac{1}{(1-z)^2}=\sum_{n=0}^{\infty} \, (\, \sum_{i=0}^{n} 1 \cdot 1 \, ) z^n \quad=
\sum_{n=0}^{\infty} \, (\, \sum_{i=0}^{n} 1  ) z^n \quad ,
\eqno(1)
$$
also valid for $|z|<1$. Since the function on the left side is analytic in $|z|<1$, it
has a Taylor expansion at $z=0$. By induction on $n$, (and using the chain rule) the reader can verify that
$$
\frac{d^n}{d z^n} \frac{1}{(1-z)^2} = \frac{(n+1)!}{(1-z)^{n+2}} \quad ,
$$
also valid for  $|z|<1$.
Hence
$$
\frac{d^n}{d z^n} \frac{1}{(1-z)^2} \Bigl \vert_{z=0}= (n+1)! \quad .
$$
By Taylor's theorem
$$
\frac{1}{(1-z)^2}  =  \sum_{n=0}^{\infty} \frac{(n+1)!}{n!} z^n
= \sum_{n=0}^{\infty} (n+1) z^n \quad,
\eqno(2)
$$
valid for $|z|<1$. 
Since the right sides of Eqs. $(1)$ and Eqs. $(2)$ are both analytic functions
that are equal to each other in an open neighborhood of $z=0$ (that happens to be the
open disk $|z|<1$), we can
equate the coefficients of $z^n$, getting the desired identity. \halmos.




{\bf Comments}.  In case you didn't notice, this is a {\bf PARODY} of the very bad habit,
(that like so many bad habits  seems so hard to get rid of)
of using analytic proofs where they
are not needed. While the above proof is technically correct, it is {\it morally}
{\bf worse} than wrong, since it constitutes a {\bf category mistake},
that according to wikipedia is when {\it ``things of one kind are presented as if they belonged to another''}.
The statement of the ``theorem'' is entirely elementary, dealing with integers, and while I am sure
that the reader can find a ``direct'' proof (hint: $1+1+ \dots +1$ ($a$ times) equals $a$),
the above ``proof'' can be recast in the {\it purely algebraic} (and much more elementary!) 
(fully  rigorous [in fact far more rigorous]) {\it algebra of formal power series},
and ditto for much ``deeper'' identities, including the Rogers-Ramanujan ones!

Of course George Andrews knows it very well, and explicitly states 
a ``disclaimer''  on p. 3 of his classic book {\it Theory of Partitions}, 
that ``for many problems it suffices to consider the generating functions as {\it formal power series}'',
and then the manipulations become ``almost trivial''.
But  because that for {\it some} applications (to asymptotics) 
one seems to need analytic convergence, he made the very
{\bf bad decision} to consider {\it all} generating functions as belonging to {\it analytic functions}.
Indeed a serious {\it category mistake}.


I was lead to this parody while reading a recent
(otherwise beautiful!) article by S. Ole Warnaar (Notices of the Amer. Math. Soc. \#60(1) (Jan. 2013), pp. 18-22)
about Ramanujan's ${}_1 \psi_1$  Summation.
In that article, Warnaar repeated the conventional statement of this celebrated identity
(most probably Hardy's {\it bowdlerized} version, Ramanujan was a formalist at heart!)
viewing both sides as {\it analytic functions}
``valid for $|b/a|<|z|<1$'', 
rather than viewing them, much more naturally, as ``{\it bilateral formal power series} in $z$ with coefficients
that are rational functions of $b$'', and then goes on to give Mourad Ismail's
original {\it proof-from-the-book}, rather than my own
elementary adaptation of Ismail's gorgeous proof, sketched in

{\tt http://www.math.rutgers.edu/\~{}zeilberg/mamarim/mamarimPDF/cfinite.pdf }.

Warnaar then goes on to describe some amazing {\it almost trivial} consequences, for example 
he deduced, by a clever specialization, Jacobi's famous theorem about
the number of ways to represent a positive integer as as sum of four squares,
leaving the impression that analysis is required to prove this beautiful but purely elementary statement,
thereby propagating Andrews' (and Hardy's and  Ismail's and Askey's and ...) pernicious {\it category mistake}.

I am sure that in many other parts of both pure and applied mathematics, where analysis seems
indispensable, it is a mere {\it red herring} due to our human limitations. Let's work  together
to free us from the annoying shackles of {\it continuous} analysis, and replace it by the
much healthier and prettier {\it discrete} analysis. Amen.




\end

