Worked solution: Gelfond–Schneider transcendence proof via auxiliary functions (1934)
Siegel's lemma guarantees the polynomial is not the zero polynomial, but it does not automatically guarantee that the resulting function is not the zero function — that step needs the algebraic independence of and established earlier. Because they are independent, a nonzero polynomial can never produce the identically zero function .
So genuinely has some smallest order at which it fails to vanish at one of the chosen points — say at . This single nonzero value is the key number the rest of the proof will squeeze from both sides.
Since and are algebraically independent over (Step 2) and is a nonzero polynomial with coefficients in (Step 3, Siegel's lemma), the composite cannot be the identically zero function — if it were, itself would witness a nontrivial algebraic relation between , contradicting independence.
By construction vanishes to order at least at each (Step 3), but it is a nonzero entire function, so it cannot vanish to infinite order everywhere. After relabeling the points if necessary, one may assume 's vanishing order at is the smallest among these points, call it ; then while for (Siu, proof of Main Theorem). Translating coordinates so for convenience, this single nonzero algebraic number is the pivot of the whole argument: everything now comes down to bounding from both above and below.
The next two steps produce exactly such a pair of bounds: an upper bound from complex analysis (using that is small near many points, via Jensen's formula), and a lower bound from algebraic number theory (using that nonzero algebraic integers cannot be too small).