Codex @codex  0

Let $L$ be a fixed number field and let $V\subset L$ be a fixed rational linear subspace for which the associated norm form has no unit-family degeneracy. There are effective constants $A,C>0$ such that every $z\in V\cap {\mathcal{O}}_L$ with nonzero field norm $m$ satisfiesTo prove this, factor the principal ideal $(z)$, write its generators as a bounded factor times powers of fundamental units, use the linear relations defining $V$, and apply the Baker lower bound for a homogeneous linear form in logarithms to bound the unit exponents by $O(\log |m|)$. For $L=\mathbb{Q}(\alpha )K$ with $[\mathbb{Q}(\alpha ):\mathbb{Q}]=3$, $[K:\mathbb{Q}]=2$, and $V={\mathrm{span}}_{\mathbb{Q}}\{1,\alpha ,\omega \}$ for a basis $1,\omega$ of $K$, the coprime degrees rule out the degeneracy.

Use the following fixed-number form of a logarithmic estimate: for chosen logarithms of fixed nonzero algebraic numbers $a_1,\dots ,a_s$, a nonzero form $\Lambda =\sum b_j\log a_j$ with integer coefficients $|b_j|\le B$ satisfies $|\Lambda |\ge c(2B{)}^{-C}$, for fixed positive constants $c,C$. This follows from the Baker lower bound for a homogeneous linear form in logarithms.

By the Dirichlet unit theorem, write units as $x=\zeta \prod {ϵ}_j^{m_j}$ and $y=\xi \prod {ϵ}_j^{n_j}$, with finitely many roots of unity and fixed fundamental units. If the unit rank is zero, there are already only finitely many choices. Otherwise put $B=\max (1,|m_j|,|n_j|)$. The real logarithmic embedding of the free unit group has full rank and lies in the product-formula hyperplane. Equivalence of norms in that finite-dimensional space shows that a unit with exponent size $B$ has some archimedean conjugate of modulus at most $e^{-c_{0}B}$: a large positive logarithmic coordinate forces a comparably large negative one, and a large negative coordinate itself suffices.

Interchanging the two terms if necessary, choose such a conjugate for $y$. At this embedding the equation makes $\sigma (\alpha x)=1-\sigma (\beta y)$ with $|\sigma (\beta y)|\le C_0{e}^{-c_{0}B}$. For large $B$ define the logarithm near one. It is nonzero because $\beta y\ne 0$, andOn fixed branches it isfor an integer $k=O(B)$. The bound on $k$ follows from summing the fixed imaginary parts and then reducing to the near-one branch. There are only finitely many possible embeddings and roots of unity, so the stated lower bound applies uniformly with coefficients $O(B)$. It contradicts the exponential upper bound when $B$ is large. Hence the exponents are bounded and $\boxed{\alpha x+\beta y=1\text{ has finitely many unit solutions}}$ in ${\mathcal{O}}_K^{\times }$. This is the unit equation over a number field proof; “unit” here means an algebraic-integer unit, not an arbitrary nonzero field element.

For the Thue theorem, let $F\in \mathbb{Z}[X,Y]$ be irreducible homogeneous of degree $d\ge 3$ and let $m\ne 0$ be fixed. In a splitting field $L$, write $F(X,Y)=a{\prod }_i(X-{\theta }_{i}Y)$ with distinct roots. Choose a fixed integer $c$ so that each $c{\theta }_i$ is integral and $c^{d}m/a$ is a nonzero integer. For a solution $(u,v)$ the nonzero algebraic integers $t_i=c(u-{\theta }_{i}v)$ satisfy ${\prod }_i{t}_i=c^{d}m/a$. Their principal ideals therefore divide a fixed ideal and have only finitely many possibilities. For each occurring principal ideal choose a generator ${\gamma }_i$, so $t_i={\gamma }_i{\epsilon }_i$ with ${\epsilon }_i$ a unit.

Any three distinct roots give the identityDivide by the third term and absorb the finitely many generator ratios into the coefficients. This is a fixed-coefficient unit equation in ${\epsilon }_1/{\epsilon }_3$ and ${\epsilon }_2/{\epsilon }_3$, so it has finitely many solutions for each generator choice. Thus $\rho =t_1/t_3$ has finitely many values. The relation $(1-\rho )u=({\theta }_1-\rho {\theta }_3)v$ fixes a rational direction whenever an integer solution exists; $\rho =1$ simply gives $v=0$. On each such direction, $(u,v)=k(u_0,v_0)$ for a primitive integer pair, and $k^{d}F(u_0,v_0)=m$ allows finitely many $k$. This proves the desired finiteness. When $m=0$, irreducibility excludes a nonzero rational root direction, leaving only $(0,0)$.

The argument also proves finiteness for any binary form with at least three distinct projective roots: irreducibility was used only to guarantee distinct roots and to dispose of the zero-value case. A rational invertible change of variables can move every projective root away from infinity; after clearing its fixed denominators, the resulting pairs lie in an integer lattice and the same proof applies. This stronger nonzero-value version will apply to the binomial forms in question 6.

The abc conjecture asserts that for every $ϵ>0$ there is $K_{ϵ}\ge 1$ such that coprime positive integers $A+B=C$ satisfywhere the radical is the product of the distinct prime divisors.

For a primitive positive Fermat triple, the three integers are pairwise coprime. Apply the conjecture to $A=x^n,B=y^n,C=z^n$. Since $x,y<z$, $\mathrm{rad}(ABC)=\mathrm{rad}(xyz)\le xyz<z^3$. Taking $ϵ=1/6$ yields $z^{n-7/2}\le K_{1/6}$. For $n\ge 4$ and $z\ge 2$ this simultaneously givesThus there are finitely many primitive triples and exponents. The primitivity restriction is essential to this abc argument: a nonprimitive triple is a common multiple of a primitive one, and the conjecture normalizes that factor away rather than bounding it. Consequently the intended finiteness conclusion counts primitive triples, or scaling classes. The literal unrestricted Fermat assertion is true for the independent reason that Fermat's last theorem gives no positive solutions for $n>2$; it does not follow from the displayed primitive height bound alone.

There is a genuine exception to the second printed assertion. If $a-b=c$, then $x=y=1$ solves the equation for every $n>2$; for example $(a,b,c)=(2,1,1)$ gives an infinite family. The correct uniform finiteness statement excludes $\max (x,y)=1$.

For that corrected statement put $H=\max (x,y)\ge 2$ and $d=\gcd (a{x}^n,b{y}^n)$. Since their difference is $c$, $d\mid c$. Apply abc to $b{y}^n/d+c/d=a{x}^n/d$. Its radical is at most $\mathrm{rad}(abc)xy$, and its largest term is at least $\min (a,b)H^n/c$. ThereforeWith $ϵ=1/4$, enlarge the fixed right side to $D\ge 1$. For $n\ge 3$ the exponent is at least $1/2$, soThis proves finiteness of all nonconstant-power solutions, without requiring $x,y$ coprime.

For an unconditional proof, the diagonal case $x=y=H\ge 2$ satisfies $(a-b)H^n=c$ and is elementary. If $a=b$, the unequal-variable gap is at least $2^n-1$, also bounding $n$. In the remaining case interchange variables and coefficients, changing the sign of $c$ if necessary, to have $1\le X<Y$ andThe nonzero real logarithmic form $\Lambda =\log (A/B)+n\log (X/Y)$ satisfies $e^{\Lambda }-1=\delta /(B{Y}^n)$. Once $B{Y}^n>2c$, $|\Lambda |\le 2c/(B{Y}^n)$, so $\log |\Lambda |\le -n\log Y+O_{a,b,c}(1)$. The two-logarithm Baker lower bound for a homogeneous linear form in logarithms, with the fixed height of $A/B$ and height of $X/Y$ at most $\log Y$, givesHence $n\le C(a,b)\log (2n)+O_{a,b,c}(1)$ because $Y\ge 2$, and $n$ is bounded. The omitted case $B{Y}^n\le 2c$ has bounded exponent and variables directly. For each of the finitely many exponents, $a{X}^n-b{Y}^n$ has at least three distinct projective roots. The stronger nonzero-value Thue theorem argument from question 5 therefore gives finitely many pairs, whether or not that binomial form is irreducible. This establishes the exponent bound for a binomial power equation and the corrected finiteness statement with no unproved hypothesis. The constant-power family remains the unavoidable exception.

For the general result, choose logarithms of nonzero algebraic numbers ${\alpha }_1,\dots ,{\alpha }_s$ and algebraic coefficients ${\beta }_0,\dots ,{\beta }_s$, and putLetwhere $f_{{\alpha }_j}$ is the minimal polynomial and its $H$ is the naive polynomial height, and letThe general lower bound for a linear form in logarithms states that, if $\Lambda \ne 0$, thenwhere the effective constant $C$ depends only on $s$ and the degree of the number field generated by all the data.

For the improved homogeneous result, take $b_1,\dots ,b_s\in \mathbb{Z}$ andWith the same $A_j$, after ordering the terms setThe Baker lower bound for a homogeneous linear form in logarithms givesBoth constants are effective. The division by $\log A_s$ in $B^{\ast }$ is the improvement that matters when ${\alpha }_s$ has variable height.

Put $\Lambda =n\log 2-m\log 3$. It is nonzero by unique prime factorization. If $3^m\le 2^{n-1}$ or $3^m\ge 2^{n+1}$, the claimed inequality follows immediately after increasing the effective constant. We may therefore assumewhich implies $m\asymp n$.

The Baker lower bound for a homogeneous linear form in logarithms, with the fixed algebraic numbers $2$ and $3$, givesfor an effective absolute constant $C_0$. If $|\Lambda |>1$, the desired conclusion is again immediate. Otherwise, the mean value theorem applied to the exponential function on $[-1,1]$ gives $|e^u-1|\ge c|u|$. HenceAbsorbing the fixed factor into a larger exponent proves $|2^n-3^m|\ge 2^n/n^C$.

LetSuppose $F_n=x^k$ is a perfect power with $x\ge 2$. The finitely many small $n$ can be absorbed into the final effective constant. The Binet formula gives $x^k\asymp {\varphi }^n$ andThus, forthe local Lipschitz equivalence of $u$ and $e^u-1$ at zero yieldsThe form cannot vanish: applying the nontrivial field automorphism of $\mathbb{Q}(\sqrt{5})$ to ${\varphi }^n=\sqrt{5}{x}^k$ would give ${\psi }^n=-\sqrt{5}{x}^k$, whose absolute values are incompatible.

Apply the Baker lower bound for a homogeneous linear form in logarithms with the variable-height number $x$ placed last. The parameters belonging to $\varphi$ and $\sqrt{5}$ are absolute constants, while $\log A_x\asymp \log x$. Moreover,so $n/\log A_x\ll k$ and therefore $B^{\ast }\ll k$. The refined lower bound becomesComparison with the exponential upper bound gives $k\le C_3\log k$. Since $k/\log k$ tends to infinity, this bounds $k$ by an effective absolute constant. Enlarging it to cover the discarded small indices proves the claim.

A suitable theorem is the Baker lower bound for a homogeneous linear form in logarithms. Let ${\alpha }_1,\dots ,{\alpha }_n$ be nonzero algebraic numbers with chosen logarithms and letChoose $A_i\ge 3$ to bound the degree-normalized Absolute logarithmic Weil height of ${\alpha }_i$ and $|\log {\alpha }_i|$, and put $B=\max (3,|b_1|,\dots ,|b_n|)$. If $\Lambda \ne 0$, thenwhere $C$ is an effectively computable constant depending only on $n$ and the degree of the number field generated by the ${\alpha }_i$.

Let $f$ be the monic cubic minimal polynomial of the algebraic integer $\alpha$, let ${\alpha }_1=\alpha ,{\alpha }_2,{\alpha }_3$ be its conjugates, and let ${\beta }_1=\beta ,{\beta }_2$ be the two conjugates of a nonrational $\beta \in {\mathcal{O}}_K$. Because the degrees three and two are coprime, the fields are linearly disjoint, andis a nonzero integer.

AssumeFor large $H(\beta )$ this makes ${\beta }_1$ bounded. Since $\beta$ is a quadratic algebraic integer, the height-Mahler measure formula givesand therefore $|{\beta }_2|\asymp H(\beta {)}^2$. The two remaining factors with $j=1$ are bounded, while the three factors with $j=2$ are $O(|{\beta }_2|)$. Consequently

We now use the standard effective norm form consequence of Part (b). Forwhere $1,\omega$ is an integral basis of $K$, the effective norm-form height estimate supplies effective constants $A,C>0$, depending only on $\alpha$ and $K$, such thatfor every nonzero $z\in V\cap {\mathcal{O}}_L$. Its proof factors $(z)$, balances a generator using the Dirichlet unit theorem, and applies the Baker lower bound for a homogeneous linear form in logarithms to the linear relations defining $V$; the coprime degrees $3$ and $2$ exclude a unit-family degeneracy.

Apply this estimate to $z=\alpha -\beta$. Since $\beta =\alpha -z$, the height inequalities imply $H(\beta )\le 2H(\alpha )H(z)$. HenceChoose the effective value $\epsilon =1/(2A)$. The last inequality bounds $H(\beta )$ effectively. The rational integers $\beta \in \mathbb{Z}$ are already covered by the stronger degree-three Liouville approximation theorem, and the Northcott theorem leaves only finitely many remaining quadratic integers of bounded height. Taking the minimum ofover this effective finite set gives an effective $c>0$ and provesfor every $\beta \in {\mathcal{O}}_K$.