Wiki
Wiki

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

Updated

Erdős 699: a quadratic transformation of the moment surface


This is a retained earlier research note. The current reading guide gives the latest status and distinguishes completed proofs from remaining cases.

P699 research · Erdős problem 699 · The integer-moment formulation · The irreducibility theorem

The integer-moment cubic admits a simple quadratic involution. It can decrease the reconstructed row, but it does not automatically preserve the arithmetic conditions. In fact, for every even original column, no normalization of its image has integer first and second moments and a total moment equal to three times a power of two. This rules out this particular descent in those columns. It does not rule out the columns themselves or establish global finiteness.

1. A normal form and a factorization

Suppose a bad triple with index three exists, and retain the notation

n=2hu,h≥2,u odd,4≤j<n/2,c=n−j.n=2^h u,\qquad h\ge2,\quad u\text{ odd},\qquad 4\le j<n/2,\quad c=n-j.

The integer moments from the uniform proof attempt are

s=3nu,m=3ju,ℓ=3j(j−1)u(n−1),a=3j(j−1)(j−2)u(n−1)(n−2).s=\frac{3n}{u},\quad m=\frac{3j}{u},\quad \ell=\frac{3j(j-1)}{u(n-1)},\quad a=\frac{3j(j-1)(j-2)}{u(n-1)(n-2)}.

They satisfy

sa(ℓ+m)−2am2+mℓ2+m2ℓ−2sℓ2=0.sa(\ell+m)-2am^2+m\ell^2+m^2\ell-2s\ell^2=0.

Put

A=2s−3m+ℓ,B=2a+m−3ℓ,C=m+ℓ,D=m−ℓ.A=2s-3m+\ell,\quad B=2a+m-3\ell,\quad C=m+\ell,\quad D=m-\ell.

The inverse change of coordinates is

s=A+C+2D2,m=C+D2,ℓ=C−D2,a=B+C−2D2.s=\frac{A+C+2D}{2},\quad m=\frac{C+D}{2},\quad \ell=\frac{C-D}{2},\quad a=\frac{B+C-2D}{2}.

Direct substitution gives the cubic surface

ABC=D2(A+B−C).(1)ABC=D^2(A+B-C).\tag{1}

Equivalently,

(A−D)(D−B)(C+D)=(A+D)(B+D)(C−D).(2)(A-D)(D-B)(C+D)=(A+D)(B+D)(C-D).\tag{2}

In terms of the original row and column,

A=3c(n+c−2)u(n−1),B=3jc(c−j)u(n−1)(n−2),C=3j(n+j−2)u(n−1),D=3jcu(n−1).\begin{aligned} A&=\frac{3c(n+c-2)}{u(n-1)},& B&=\frac{3jc(c-j)}{u(n-1)(n-2)},\\ C&=\frac{3j(n+j-2)}{u(n-1)},& D&=\frac{3jc}{u(n-1)}. \end{aligned}

Thus A>DA>D, C>DC>D, and 0<B<D0<B<D. All factors in (2) are positive, and their ratios telescope:

A−DA+D=c−1n−1,D−BD+B=j−1c−1,C+DC−D=n−1j−1.(3)\frac{A-D}{A+D}=\frac{c-1}{n-1},\quad \frac{D-B}{D+B}=\frac{j-1}{c-1},\quad \frac{C+D}{C-D}=\frac{n-1}{j-1}.\tag{3}

The factorization itself therefore reproduces adjacent factorial ratios.

2. A quadratic involution

Consider the rational map on (1)

[A:B:C:D]⟼[AD:BD:D(A+B−C):AB].(4)[A:B:C:D]\longmapsto [AD:BD:D(A+B-C):AB].\tag{4}

In the ratios x=A/Dx=A/D, y=B/Dy=B/D, z=C/Dz=C/D, it is

(x,y,z)⟼(1/y,1/x,z).(x,y,z)\longmapsto(1/y,1/x,z).

The surface equation makes the third coordinate equal to zz, so this is an involution wherever the displayed expressions are defined. Moreover, x>1x>1, z>1z>1, 0<y<10<y<1 imply the same three inequalities after the map. These inequalities alone do not guarantee a positive reconstructed population.

To see this explicitly, set

p=c−1n−1,q=j−1n−1.p=\frac{c-1}{n-1},\qquad q=\frac{j-1}{n-1}.

Then 1−p−q=1/(n−1)>01-p-q=1/(n-1)>0, and (4) acts by

(p,q)⟼(q/p,q).(p,q)\longmapsto(q/p,q).

Define

Δ=j2−3nj+2j+n2−1,N=j2−4nj+3j+2n2−2n,d=n−2j.\begin{aligned} \Delta&=j^2-3nj+2j+n^2-1,\\ N&=j^2-4nj+3j+2n^2-2n,\\ d&=n-2j. \end{aligned}

Reconstructing the population and column gives

n′=NΔ,j′=d(n−1)Δ,c′=c(c−1)Δ.(5)n'=\frac{N}{\Delta},\qquad j'=\frac{d(n-1)}{\Delta},\qquad c'=\frac{c(c-1)}{\Delta}.\tag{5}

These rational numbers are unchanged by a common normalization of the transformed homogeneous coordinates. A necessary condition for a positive finite population is Δ>0\Delta>0, since

1−qp−q=Δ(c−1)(n−1).1-\frac qp-q=\frac{\Delta}{(c-1)(n-1)}.

Even when Δ>0\Delta>0, the condition j′>2j'>2 imposes the further inequality

2j2−4nj+2j+n2+n−2<0.2j^2-4nj+2j+n^2+n-2<0.

Consequently preserving the three coordinate inequalities above is not enough to justify a descent. The quantities in (5) must also be integers, and the transformed moments must have the required normalization.

3. Every even column obstructs dyadic normalization

Let s∗,m∗,ℓ∗,a∗s_*,m_*,\ell_*,a_* be obtained by applying the inverse linear change of coordinates to the four quadratic coordinates on the right of (4). Direct substitution gives

m∗s∗=d(n−1)N,ℓ∗s∗=d(j−1)N.(6)\frac{m_*}{s_*}=\frac{d(n-1)}{N},\qquad \frac{\ell_*}{s_*}=\frac{d(j-1)}{N}.\tag{6}

The denominator NN is positive: the expression j2−4nj+3j+2n2−2nj^2-4nj+3j+2n^2-2n decreases on 0≤j≤n/20\le j\le n/2, where its value at j=n/2j=n/2 is n(n−2)/4>0n(n-2)/4>0.

Proposition. Suppose jj is even. No common rational scaling of s∗,m∗,ℓ∗,a∗s_*,m_*,\ell_*,a_* can make both m∗,ℓ∗m_*,\ell_* integers while making s∗=3⋅2Hs_*=3\cdot2^H for a nonnegative integer HH.

Proof. Put t=v2(j)t=v_2(j). The exact-content argument in the irreducibility note gives t<ht<h. It also gives a cubic with four positive integer coefficients whose sum is 2h−t2^{h-t}. Hence 2h−t≥42^{h-t}\ge4 and t≤h−2t\le h-2.

Since jj is even and t≤h−2t\le h-2,

v2(d)=t+1,v2(N)=t.(7)v_2(d)=t+1,\qquad v_2(N)=t.\tag{7}

For the second assertion, write N=j(j+3)+2n(n−2j−1)N=j(j+3)+2n(n-2j-1): the first summand has valuation tt and the second has valuation at least h+1h+1.

Let g=gcd⁡(n−1,j−1)g=\gcd(n-1,j-1), which is odd. If the stated scaling existed, (6) would imply

N∣3⋅2Hd(n−1),N∣3⋅2Hd(j−1).N\mid3\cdot2^H d(n-1),\qquad N\mid3\cdot2^H d(j-1).

Taking greatest common divisors and then odd parts, (7) would give

N2t∣3d2t+1g.\frac{N}{2^t}\mid3\frac{d}{2^{t+1}}g.

Both sides are positive, so necessarily

2N≤3dg≤3d(j−1).(8)2N\le3dg\le3d(j-1).\tag{8}

But direct subtraction gives

2N−3d(j−1)=8j2−11nj+4n2−n.2N-3d(j-1)=8j^2-11nj+4n^2-n.

The right side decreases on 0≤j≤n/20\le j\le n/2, and its value at n/2n/2 is n(n−2)/2>0n(n-2)/2>0. This contradicts (8). □\square

The obstruction applies even before asking whether n′,j′,u′n',j',u' are integers or whether the transformed pair satisfies the full Lucas conditions. For odd jj, the valuation v2(N)v_2(N) can be larger, and the argument above does not supply the same contradiction. Neither those columns nor the original global finiteness question are resolved by this transformation. The algebraic identities in this note were checked symbolically; no finite search was used.