Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Fixed rational composition loses balanced input mass


Statement and scope

Fix

F(x)=a1x13+a2x23+a3x33,ai∈Q>0.F(\mathbf x)=a_1x_1^3+a_2x_2^3+a_3x_3^3, \qquad a_i\in\mathbb Q_{>0}.

The following theorem is proved. It strengthens the linear-in-one-input obstruction, but does not decide the density of the values of FF.

Theorem. Suppose that a fixed rational map C∈Q(x,y)3C\in\mathbb Q(\mathbf x,\mathbf y)^3 satisfies

F(C(x,y))=F(x)F(y).(1)F(C(\mathbf x,\mathbf y))=F(\mathbf x)F(\mathbf y). \tag{1}

Then CC is not polynomial of total degree at most two. Furthermore,

#{(x,y)∈[1,N]6∩Z6:C is defined and C(x,y)∈N3}≪F,CN17/3.(2)\#\{(\mathbf x,\mathbf y)\in[1,N]^6\cap\mathbb Z^6: C\text{ is defined and }C(\mathbf x,\mathbf y)\in\mathbb N^3\} \ll_{F,C}N^{17/3}. \tag{2}

Thus no fixed rational composition retains a positive fraction of all input pairs in balanced root boxes. In boxes with both root heights comparable to NN, its product values also number O(N17/3)O(N^{17/3}), compared with the ambient target scale N6N^6. The theorem is not a count of all product values with unrestricted, possibly very unbalanced factors. It also does not control maps whose complexity varies with NN.

Excluding the pure quadratic terms

First suppose PP is a homogeneous quadratic polynomial map satisfying (1). Write

P=A(x)+B(x,y)+D(y),P=A(\mathbf x)+B(\mathbf x,\mathbf y)+D(\mathbf y),

where BB is bilinear. Setting y=0\mathbf y=0 gives F(A)=0F(A)=0.

Suppose A≠0A\ne0. The plane cubic E:F=0E:F=0 is smooth, since its three partial derivatives cannot vanish simultaneously at a projective point. It is therefore geometrically integral of genus one. The rational map [A]:P2⇢E[A]:\mathbb P^2\dashrightarrow E must be constant: if two points in its domain had different images, restriction to their joining line would give a nonconstant rational map P1⇢E\mathbb P^1\dashrightarrow E. It extends to a morphism, since EE is proper and smooth, contradicting Riemann--Hurwitz. The constant image is a rational point qq, as can also be seen by evaluating at a rational point where A≠0A\ne0. Hence

A=qHA=qH

for a nonzero rational homogeneous quadratic HH.

Make a rational linear change of output coordinates taking qq to (1,0,0)(1,0,0) and its tangent line to W=0W=0. The transformed cubic is

G(U,V,W)=αU2W+βUV2+γUVW+δUW2+ϵV3+ηV2W+θVW2+κW3,(3)\begin{aligned} G(U,V,W)={}&\alpha U^2W+\beta UV^2+\gamma UVW+\delta UW^2\\ &+\epsilon V^3+\eta V^2W+\theta VW^2+\kappa W^3, \end{aligned} \tag{3}

with α≠0\alpha\ne0. The transformed coordinates of PP are

U=H+L+u,V=M+v,W=T+w,U=H+L+u,\qquad V=M+v,\qquad W=T+w,

where L,M,TL,M,T are bilinear and u,v,wu,v,w depend quadratically only on y\mathbf y.

Compare bidegrees in G(P)=F(x)F(y)G(P)=F(\mathbf x)F(\mathbf y). The (5,1)(5,1) part gives αH2T=0\alpha H^2T=0, so T=0T=0. The (4,2)(4,2) part gives

αHw+βM2=0.(4)\alpha Hw+\beta M^2=0. \tag{4}

If β=0\beta=0, then w=0w=0, and G(P)=ϵ(M+v)3G(P)=\epsilon(M+v)^3. This cannot be a nonzero scalar multiple of F(x)F(\mathbf x) over Q(y)\mathbb Q(\mathbf y): FF is absolutely irreducible and not a cube. If β≠0\beta\ne0 but w=0w=0, then M=0M=0, and G(P)=βUv2+ϵv3G(P)=\beta Uv^2+\epsilon v^3 has degree at most two in x\mathbf x, again impossible.

In the remaining case βw≠0\beta w\ne0, work over K=Q(y)K=\mathbb Q(\mathbf y). Equation (4) makes HH a scalar multiple of M2M^2. Thus all coordinates of PP belong to K[L,M]K[L,M]. Choose a nonzero h∈K3h\in K^3 annihilated by the two linear forms L,ML,M. Directional differentiation of (1) gives

0=F(y)DhF(x)=3F(y)∑iaihixi2.0=F(\mathbf y)D_hF(\mathbf x) =3F(\mathbf y)\sum_i a_i h_i x_i^2.

This forces every hi=0h_i=0, a contradiction.

Consequently A=0A=0. Interchanging the input blocks proves D=0D=0, so the proposed quadratic composition must be bilinear.

Excluding the bilinear map and the lower-degree terms

Write P=M(y)xP=M(\mathbf y)\mathbf x over K=Q(y)K=\mathbb Q(\mathbf y), and put m=F(y)m=F(\mathbf y). The matrix MM is invertible: a kernel vector would again give a nonzero direction hh with DhF=0D_hF=0. The Hessian determinant is

det⁡Hess⁡F=216a1a2a3x1x2x3.\det\operatorname{Hess}F =216a_1a_2a_3x_1x_2x_3.

Applying the Hessian transformation formula to F(Mx)=mF(x)F(M\mathbf x)=mF(\mathbf x) shows that the product of the row forms of MM is a nonzero scalar multiple of x1x2x3x_1x_2x_3. Unique factorization makes MM monomial. Coefficient comparison therefore gives

F(y)=c g(y)3,c∈Q×,g∈K×.F(\mathbf y)=c\,g(\mathbf y)^3, \qquad c\in\mathbb Q^\times,\quad g\in K^\times.

This is impossible by the valuation at the irreducible divisor F=0F=0: it is one on the left and divisible by three on the right. Absolute irreducibility follows from smoothness; distinct projective components of positive degree in the plane would intersect and give a singular point.

For a polynomial CC of total degree at most two, degree at most one is impossible by degrees. In degree two, comparison of the total degree-six parts gives

F(C2)=F(x)F(y),F(C_2)=F(\mathbf x)F(\mathbf y),

where C2C_2 is the homogeneous quadratic part. The preceding argument excludes this. Lower-degree terms therefore provide no exception.

Counting positive integral images

If some coordinate of CC is nonpolynomial, the resultant divisibility lemma in six variables gives OC,ε(N5+ε)O_{C,\varepsilon}(N^{5+\varepsilon}) integral input points. Choose a fixed ε<2/3\varepsilon<2/3.

Otherwise CC is polynomial of degree D≥3D\ge3. Choose a coordinate PP of degree DD. At a counted point, positivity and (1) imply

∣P(x,y)∣≪FN2.(5)|P(\mathbf x,\mathbf y)|\ll_F N^2. \tag{5}

Let PDP_D be its highest homogeneous part. Choose a primitive integer vector vv with PD(v)≠0P_D(v)\ne0, and complete it to a unimodular integral basis. The transformed input box is contained in a fixed dilate of [−N,N]6[-N,N]^6. Along each line in direction vv, the polynomial p(t)p(t) has degree DD and leading coefficient c=PD(v)≠0c=P_D(v)\ne0, independent of the other five coordinates.

Uniformly over the lower coefficients, a degree-DD polynomial with leading coefficient cc satisfies

#{t∈Z:∣p(t)∣≤T}≪D,c1+T1/D.(6)\#\{t\in\mathbb Z:|p(t)|\le T\}\ll_{D,c}1+T^{1/D}. \tag{6}

Indeed, factoring over C\mathbb C, every such tt lies within (T/∣c∣)1/D(T/|c|)^{1/D} of at least one of the DD roots. The corresponding real intervals contain OD(1+(T/∣c∣)1/D)O_D(1+(T/|c|)^{1/D}) integers.

There are OC(N5)O_C(N^5) choices for the other coordinates. Equations (5)--(6) give

OF,C(N5+2/D)≤OF,C(N17/3),O_{F,C}(N^{5+2/D})\le O_{F,C}(N^{17/3}),

which proves (2).

Remaining arithmetic question

The theorem concerns a prescribed rational rule, not the existence of other integral representations of the product. It does not bound ordinary integer fibers of FF, and supplies neither density zero nor positive density for those values. The bounded-fiber criterion remains unproved.