Worked solution: Euler's proof via the sine product formula (1734–1735)
Step 3 of 6: A bold analogy with polynomials
In plain words
A finite polynomial is completely rebuilt once you know all its roots: for instance a quadratic with roots and that equals at must be . Euler simply refused to believe that an infinite list of roots should behave any differently, and wrote as an infinite product of one factor per pair of roots .
A polynomial with roots equal to at factors as . Euler treated as an "infinite-degree polynomial" with roots and value at , and wrote down the same kind of factorisation — pairing each with into one real quadratic factor.
- Infinite product
- A value defined as the limit, as , of the partial products of infinitely many factors.
Common mistake. This step is the crux of the whole argument and, in 1735, was not justified: nothing yet guaranteed that an "infinite polynomial" is determined by its zeros the way a finite polynomial is, or that no extra factor (like ) could be hiding in front of the product.