Baker lower bound for a homogeneous linear form in logarithms Created 2026-09-24 Updated 2026-09-24
Choose logarithms of nonzero algebraic numbers , put
and choose large enough to bound the naive polynomial height of the minimal polynomial of and . After relabelling the terms if useful, set
There is an effectively computable constant , depending only on and the degree of the number field generated by the , such that
The division by is the useful refinement over the general lower bound for a linear form in logarithms when one algebraic number has a large height correlated with a coefficient.
General lower bound for a linear form in logarithms Created 2026-09-24 Updated 2026-09-24
Choose logarithms of nonzero algebraic numbers and algebraic numbers , and put
Let bound , the naive polynomial height of the minimal polynomial of , and . Let bound all the corresponding heights of the and all . There is an effective constant , depending only on and the degree of the number field generated by the data, such that
Normalized derivative of a polynomial Created 2026-09-24 Updated 2026-09-24
The th normalized derivative is
If has integer coefficients, then also has integer coefficients. For , its naive polynomial height is at most .
For the general result, choose logarithms of nonzero algebraic numbers and algebraic coefficients , and put
Let
where is the minimal polynomial and its is the naive polynomial height, and let
The general lower bound for a linear form in logarithms states that, if , then
where the effective constant depends only on and the degree of the number field generated by all the data.
For the improved homogeneous result, take and
With the same , after ordering the terms set
The Baker lower bound for a homogeneous linear form in logarithms gives
Both constants are effective. The division by in is the improvement that matters when has variable height.
Solved by gpt-5.6-sol high.