[Baker's theorem](https://en.wikipedia.org/wiki/Baker%27s_theorem) in transcendental number theory states that
$$
\left|\beta\_0 + \sum\_{i=1}^n \beta\_i \log \alpha\_i\right| > H^{-C}
$$
where


* $\beta\_0, \ldots, \beta\_n$ are algebraic numbers, not all zero,
* $\alpha\_1, \ldots, \alpha\_n$ are multiplicatively independent algebraic numbers,
* $H$ is the maximum of the heights of $\beta\_i$, and
* $C$ is an effectively computable constant depending on $n$, $\alpha\_i$, and the maximum of the degrees of $\beta\_i$.


Is there a simple proof for a special case of Baker's theorem where $\beta\_0 = 0$, the $\beta\_i$ are rational integers, and the $\alpha\_i$ are positive rational integers?



Baker's theorem for integer combinations of logarithms of integers?
The main difficulty in proving Baker's theorem is in estimating $C$. If you don't care about those estimates, then the proof is not difficult. For example, Chapter 7 of Waldschmidt's *Diophantine approximation on linear groups* gives a simple proof for the homogeneous case $\beta\_0=0$. Some technicalities (like using Fel'dman integer-valued polynomials) are not necessary if you don't care about strong estimates.


The homogeneous case is slightly simpler because one can work with just $G\_m^n$ or (dually) with $G\_a^n$. However, the basic structure of the proof is the same:


1. Using group structure, consider several points (working with $G\_m^n$, the points are $(\alpha\_1^s,\dots,\alpha\_n^s)$).
2. construct an auxiliary function/polynomial either using Dirichlet principle (in the form of Siegel's lemma) or using interpolating determinant
3. Show that this polynomial with some derivatives is small (using either Schwarz's lemma or Hermite's formula) at those points.
4. Show that it can't vanish at all those points.
5. Show that if the polynomial or its derivative is small at one of those points, the value must be zero.
Assumptions, that $\beta\_i$ and $\alpha\_i$ are integers simplify the last step - instead of Liouville's inequalities, you are just using directly that if $x$ is an integer with $|x|<1$ then $x=0$. However, the other steps are the same.


Baker's theorem can also be proved using the Schnieder-Lang criterion, but I don’t know if that method will provide estimates sufficient for your needs.


