Proof of the Baker-Feldman theorem via linear forms in two logarithms (Q5939692)

\textit{A. O. Gel'fond} [Transcendental and algebraic numbers. New York: Dover Publications (1960; Zbl 0090.26103)] proved effective measures of linear independence for two logarithms of algebraic numbers; he also deduced a non effective measure of linear independence for \(n\) logarithms of algebraic numbers from Thue's improvement of Liouville's inequality. The first effective measure of linear independence for \(n\) logarithms of algebraic numbers was produced by A. Baker. By means of a refinement of Baker's inequality, N. I. Feldman obtained an effective refinement of Liouville's inequality as follows: For each real algebraic number \(\alpha\) of degree \(d\geq 3\) there exist two effective positive constants \(C\) and \(\tau\) such that, for any \(p/q\in\mathbb{Q}\) with \(q>0\), \[ \left|\alpha-{p\over q}\right|>Cq^{-\tau}. \] Using an argument akin to Gel'fond's one, E. Bombieri pointed out that measures of linear independence for two logarithms suffice to deduce measures of linear independence for \(n\) logarithms, which are good enough to entail Feldman's improved Liouville's inequality. He used it both in the archimedean case [\textit{E. Bombieri}, Ann. Sc. Norm. Super. Pisa, Cl. Sci., IV. Ser. 20, 61--89 (1993; Zbl 0774.11034)] and in the ultrametric case, where Laurent's interpolation determinants was used [\textit{E. Bombieri} and \textit{P. B. Cohen}, ibid. 24, 205--225 (1997; Zbl 0912.11028)]. In the paper under review, in place of using Dyson's type methods, the authors apply Schneider's transcendence method which produces Baker-like estimates. Further, a complete proof of the required measure of linear independence for two logarithms is also included, by means of Laurent's interpolation argument. As a result this paper is self-contained.