Wiki
Wiki

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

Updated

Uniform lattice counting and moving-modulus quintic means


Status

The exact inequalities below are proved and author-recorded. They extend the fixed-progression quintic theorem to moving moduli and intervals. They remain statements about representation counts, not distinct represented values, and do not decide either unresolved question for S5S_5.

An exact lattice bound

Let r≥1r\ge1 be an integer, let di>0d_i>0 be integers, and put

Fd(x)=∑i=1rdixir,Vd=Γ(1+1/r)r∏idi−1/r,κd=(∑idi)1/r.F_{\mathbf d}(\mathbf x)=\sum_{i=1}^r d_i x_i^r,\qquad V_{\mathbf d}=\Gamma(1+1/r)^r\prod_i d_i^{-1/r},\qquad \kappa_{\mathbf d}=\left(\sum_i d_i\right)^{1/r}.

For M≥1M\ge1 and an integer aa, write

ρM(a;d)=M1−r#{b mod M:Fd(b)≡a(modM)},\rho_M(a;\mathbf d)=M^{1-r} \#\{\mathbf b\bmod M:F_{\mathbf d}(\mathbf b)\equiv a\pmod M\},

and let Rd(X;a,M)R_{\mathbf d}(X;a,M) count positive integral x\mathbf x with Fd(x)≤XF_{\mathbf d}(\mathbf x)\le X in this target class. For every real X≥0X\ge0,

ρMVdM(X1/r−κdM)+r≤Rd(X;a,M)≤ρMVdM(X1/r+κdM)r.(1)\frac{\rho_M V_{\mathbf d}}M \bigl(X^{1/r}-\kappa_{\mathbf d}M\bigr)_+^r \le R_{\mathbf d}(X;a,M) \le\frac{\rho_M V_{\mathbf d}}M \bigl(X^{1/r}+\kappa_{\mathbf d}M\bigr)^r. \tag{1}

Proof. Use the weighted norm ∥z∥d=(∑idi∣zi∣r)1/r\|\mathbf z\|_{\mathbf d}=(\sum_i d_i|z_i|^r)^{1/r}. The volume of its radius-tt ball in the positive orthant is VdtrV_{\mathbf d}t^r.

Fix one admissible residue vector. Attach the disjoint cubes q+[0,M)r\mathbf q+[0,M)^r to its positive lattice points q\mathbf q of norm at most t=X1/rt=X^{1/r}. Every such cube lies in the positive ball of radius t+κdMt+\kappa_{\mathbf d}M, proving the upper bound for this residue vector.

For the lower bound, take any positive real vector of norm at most (t−κdM)+(t-\kappa_{\mathbf d}M)_+ and round each coordinate upwards to the least positive integer in the prescribed residue class. The resulting lattice point has norm at most tt. Each lattice point has preimage volume at most MrM^r. Thus the number of counted points is at least Vd(t−κdM)+r/MrV_{\mathbf d}(t-\kappa_{\mathbf d}M)_+^r/M^r. Summing over the ρMMr−1\rho_M M^{r-1} admissible residue vectors proves (1).

No constants in (1) depend implicitly on aa or MM.

Consequence for the finite quintic certificate family

Use the finite set E\mathcal E and canonical family C\mathcal C of the quintic first-moment proof:

E={p≤1000:p prime, p≠5, p≢1(mod5)},\mathcal E=\{p\le1000:p\text{ prime},\ p\ne5,\ p\not\equiv1\pmod5\},

and each prime exponent in a member of C\mathcal C is 0,6,7,80,6,7,8, or 99. That proof establishes the finite coefficient inequality

1120∑d∈C5VdρM(a;d)>Λ:=429400(2)\frac1{120}\sum_{\mathbf d\in\mathcal C^5} V_{\mathbf d}\rho_M(a;\mathbf d)>\Lambda:=\frac{429}{400} \tag{2}

for every M,aM,a, not merely after taking a fixed-modulus limit. Its finite certificate is used as established here, without a new computation.

Put

κ=51/5∏p∈Ep9/5.\kappa=5^{1/5}\prod_{p\in\mathcal E}p^{9/5}.

Then κd≤κ\kappa_{\mathbf d}\le\kappa for all tuples in this family. Canonical uniqueness and the upper bound 120120 on the number of orderings of a five-element multiset give

U5(X;a,M)≥ΛXM(1−κMX1/5)+5.(3)U_5(X;a,M)\ge \Lambda\frac XM \left(1-\frac{\kappa M}{X^{1/5}}\right)_+^5. \tag{3}

The inequality is strict whenever the bracket is positive. Hence uniformly for any moving moduli M=o(X1/5)M=o(X^{1/5}) and residues aa,

lim inf⁡MXU5(X;a,M)≥429400>1.(4)\liminf\frac M X U_5(X;a,M)\ge\frac{429}{400}>1. \tag{4}

In fact a below-one first moment remains impossible for all M≤cX1/5M\le cX^{1/5} with any fixed

0<c<κ−1(1−(400429)1/5).0<c<\kappa^{-1}\left(1-\left(\frac{400}{429}\right)^{1/5}\right).

The constant is extremely small but positive and independent of X,a,MX,a,M.

Moving intervals

Let 0≤A<B0\le A<B and H=B−AH=B-A. Subtract the upper bound (1) at AA from the lower bound at BB, using the same finite coefficient family. This gives

U5((A,B];a,M)≥ΛM[(B1/5−κM)+5−(A1/5+κM)5]+.(5)U_5((A,B];a,M)\ge\frac\Lambda M \left[\bigl(B^{1/5}-\kappa M\bigr)_+^5 -\bigl(A^{1/5}+\kappa M\bigr)^5\right]_+. \tag{5}

Again it is strict if the displayed bracket is positive. Write h=κMh=\kappa M and suppose h≤B1/5h\le B^{1/5}. The mean-value theorem gives

B−(B1/5−h)5≤5hB4/5,(A1/5+h)5−A≤80hB4/5.B-(B^{1/5}-h)^5\le5hB^{4/5}, \qquad (A^{1/5}+h)^5-A\le80hB^{4/5}.

Thus the inner difference in (5) is at least H−85κMB4/5H-85\kappa M B^{4/5}. In particular,

H≥3400κMB4/5⟹U5((A,B];a,M)>1673116000HM>HM.(6)H\ge3400\kappa M B^{4/5} \quad\Longrightarrow\quad U_5((A,B];a,M)> \frac{16731}{16000}\frac HM>\frac HM. \tag{6}

The hypothesis implies h≤B1/5/3400h\le B^{1/5}/3400, so the preceding bound is applicable. More generally the liminf in (4), with XX replaced by the interval length HH, is at least 429/400429/400 whenever H/(MB4/5)→∞H/(MB^{4/5})\to\infty.

These estimates exclude a below-one first-moment argument throughout these ranges. They say nothing comparable when MM is larger than the coordinate scale or the interval is shorter than the boundary error, and they do not rule out arguments exploiting repeated representations.

Aligning finitely many axis intercepts does not force a gap

A different proposed gap construction was to make all fractional parts (n/d)1/5(n/d)^{1/5}, for a finite collection of cores, approach integers from a prescribed side. The following exact statement shows why qualitative alignment alone cannot work.

Proposition. For any finite set DD of canonical fifth-power cores, there is a positive integer q=b5+4q=b^5+4 such that

({(qm5/d)1/5})d∈D,m≥1,(7)\left(\left\{(qm^5/d)^{1/5}\right\}\right)_{d\in D},\qquad m\ge1, \tag{7}

is equidistributed in the ∣D∣|D|-dimensional unit torus. Nevertheless every target qm5qm^5 is a sum of five positive fifth powers.

Proof. Let PDP_D denote the primes supporting DD and let

K=Q(p1/5:p∈PD).K=\mathbb Q(p^{1/5}:p\in P_D).

The monomials ∏p∈PDpjp/5\prod_{p\in P_D}p^{j_p/5}, 0≤jp<50\le j_p<5, form a basis over Q\mathbb Q. To check the degree, adjoin 51/55^{1/5} first if needed, then the remaining prime radicals one at a time. Before adjoining p1/5p^{1/5}, the preceding field is unramified at the fresh prime pp: the discriminants of the previous defining polynomials are supported on 55 and their respective defining primes, and composita of unramified extensions remain unramified. Therefore T5−pT^5-p is Eisenstein at any prime above pp, and each adjunction has degree five. The first adjunction is ordinary Eisenstein over Q\mathbb Q.

For a canonical core the exponents are 0,6,7,8,90,6,7,8,9, giving distinct residues modulo five. Thus distinct d−1/5d^{-1/5}, d∈Dd\in D, are nonzero rational multiples of distinct basis monomials, and are linearly independent over Q\mathbb Q.

Set P=∏p∈PD∪{2,5}pP=\prod_{p\in P_D\cup\{2,5\}}p and b0=2Pb_0=2P. Choose a prime ℓ∣8P5+1\ell\mid 8P^5+1. Then ℓ∤5P\ell\nmid5P and ℓ∣b05+4\ell\mid b_0^5+4. The derivative of f(T)=T5+4f(T)=T^5+4 at b0b_0 is a unit modulo ℓ\ell. If vℓ(f(b0))=1v_\ell(f(b_0))=1, take b=b0b=b_0; otherwise take b=b0+ℓb=b_0+\ell. Expansion modulo ℓ2\ell^2 gives vℓ(q)=1v_\ell(q)=1 for q=b5+4q=b^5+4 in either case.

The field KK is unramified at ℓ\ell, so q1/5∉Kq^{1/5}\notin K, by valuation. Consequently

1,(q/d)1/5(d∈D)1,\quad (q/d)^{1/5}\quad(d\in D)

are linearly independent over Q\mathbb Q: a relation with nonzero constant term would put q1/5q^{1/5} in KK, whereas a relation with zero constant term contradicts the independence of the core radicals. The geometric-series formula for each nontrivial integer Fourier character, followed by Fourier approximation, proves equidistribution of (7).

Finally,

qm5=(bm)5+m5+m5+m5+m5.qm^5=(bm)^5+m^5+m^5+m^5+m^5.

All five summands are positive, completing the proof.

For example, for every fixed 0<ε<10<\varepsilon<1, a proportion ε∣D∣\varepsilon^{|D|} of the parameters mm make all the roots lie within ε\varepsilon of integers from below. More generally, every nonempty open pattern occurs among represented targets. Thus no exclusion criterion can depend solely on membership of these finitely many fractional parts in a fixed nonempty open region. This statement does not cover shrinking tolerances depending on nn, extra arithmetic conditions, or control of the full curved lattice shell.

Representation-weighted root phases

There is a stronger quantitative statement for fixed continuous root-phase filters. It is proved here independently of the particular represented ray above.

Lemma. Fix r≥2r\ge2, positive integral coefficients a1,…,ara_1,\ldots,a_r, and integers M≥1,bM\ge1,b. Put F(x)=∑iaixirF(\mathbf x)=\sum_i a_ix_i^r. For every fixed real λ≠0\lambda\ne0,

∑x∈NrF(x)≤XF(x)≡b(modM)e(λF(x)1/r)=o(X),(8)\sum_{\substack{\mathbf x\in\mathbb N^r\\F(\mathbf x)\le X\\ F(\mathbf x)\equiv b\pmod M}} e\bigl(\lambda F(\mathbf x)^{1/r}\bigr)=o(X), \tag{8}

where e(t)=exp⁡(2πit)e(t)=\exp(2\pi it).

Proof. Let N=X1/rN=X^{1/r} and fix δ>0\delta>0. Tuples with some xi<δNx_i<\delta N contribute OF,r(δNr)O_{F,r}(\delta N^r). For the other tuples, fix x2,…,xrx_2,\ldots,x_r, set B=∑i>1aixirB=\sum_{i>1}a_ix_i^r, and split x1x_1 into residue classes modulo MM. The congruence in (8) either holds on an entire such class or nowhere on that class; the size restrictions give one interval. The phase f(x1)=λ(a1x1r+B)1/rf(x_1)=\lambda(a_1x_1^r+B)^{1/r} has

f′′(x1)=λ(r−1)a1Bx1r−2(a1x1r+B)1/r−2.f''(x_1)=\lambda(r-1)a_1B x_1^{r-2} (a_1x_1^r+B)^{1/r-2}.

On the retained interval, B≍F,δNrB\asymp_{F,\delta}N^r and x1≍F,δNx_1\asymp_{F,\delta}N, so ∣f′′∣≍F,δ∣λ∣/N|f''|\asymp_{F,\delta}|\lambda|/N. The standard second-derivative estimate for exponential sums on an interval, ∑e(f(n))≪Lη+η−1/2\sum e(f(n))\ll L\sqrt\eta+\eta^{-1/2} when η≤∣f′′∣≪η\eta\le |f''|\ll\eta, applies after parameterizing the residue class. It gives OF,δ,M,λ(N1/2)O_{F,\delta,M,\lambda}(N^{1/2}) per fiber. Thus the left side of (8) is

OF,r(δNr)+OF,δ,M,λ(Nr−1/2).O_{F,r}(\delta N^r)+O_{F,\delta,M,\lambda}(N^{r-1/2}).

Let N→∞N\to\infty and then δ→0\delta\to0. This proves (8).

For clarity, this argument also gives the following dependence on a nonzero varying frequency:

∣SF(X;λ)∣X≪F,rδ+CF,δ,M(∣λ∣N+1N∣λ∣).(9)\frac{|S_F(X;\lambda)|}{X} \ll_{F,r}\delta+C_{F,\delta,M} \left(\sqrt{\frac{|\lambda|}{N}} +\frac1{\sqrt{N|\lambda|}}\right). \tag{9}

It does not give a useful relative error for every shrinking phase set.

Continuous weights have the same limiting mean

Fix positive real numbers α1,…,αk\alpha_1,\ldots,\alpha_k, and let HH be the closure in Tk\mathbb T^k of the continuous line {t(α1,…,αk):t∈R}\{t(\alpha_1,\ldots,\alpha_k):t\in\mathbb R\}. Write μH\mu_H for Haar probability measure. For any continuous ψ:Tk→C\psi:\mathbb T^k\to\mathbb C, put

w(n)=ψ(α1n1/r,…,αkn1/r),wˉ=∫Hψ dμH.w(n)=\psi(\alpha_1n^{1/r},\ldots,\alpha_kn^{1/r}),\qquad \bar w=\int_H\psi\,d\mu_H.

Fourier approximation and (8) give

∑x∈NrF(x)≤XF(x)≡b(modM)w(F(x))=wˉ RF(X;b,M)+o(X),(10)\sum_{\substack{\mathbf x\in\mathbb N^r\\F(\mathbf x)\le X\\ F(\mathbf x)\equiv b\pmod M}}w(F(\mathbf x)) =\bar w\,R_F(X;b,M)+o(X), \tag{10}

where RFR_F is the unweighted tuple count. Indeed, a Fourier character indexed by h∈Zk\mathbf h\in\mathbb Z^k is constant one precisely when ∑jhjαj=0\sum_j h_j\alpha_j=0; every other character is covered by (8).

Ordinary target counting has the identical mean:

∑n≤Xn≡b(modM)w(n)=wˉ XM+o(X).(11)\sum_{\substack{n\le X\\n\equiv b\pmod M}}w(n) =\bar w\,\frac X M+o(X). \tag{11}

For a nonzero Fourier frequency λ\lambda, comparison with the integral gives an error OM,λ(1+X1/r)O_{M,\lambda}(1+X^{1/r}) for the exponential sum in (11). Substitution u=t1/ru=t^{1/r} and integration by parts bound the integral by OM,λ(1+X1−1/r)O_{M,\lambda}(1+X^{1-1/r}). Both are o(X)o(X). Fourier approximation proves (11), including the case of rational dependencies among the αj\alpha_j.

Take r=5r=5, αj=dj−1/5\alpha_j=d_j^{-1/5} for any fixed finite list of cores, and ψ≥0\psi\ge0. Apply (10) to the finite canonical family used in the quintic certificate, and divide its ordered counts by 5!5!. Every unordered representation has at most 5!5! orderings, so nonnegative weighting preserves this lower bound. If U5(n)U_5(n) is the number of unordered representations of nn by exactly five positive 55-powerful integers, the certificate and (11) imply

lim inf⁡X→∞MX∑n≤Xn≡b(modM)U5(n)w(n)≥429400wˉ.(12)\liminf_{X\to\infty}\frac M X \sum_{\substack{n\le X\\n\equiv b\pmod M}}U_5(n)w(n) \ge\frac{429}{400}\bar w. \tag{12}

The normalized weighted target count tends to wˉ\bar w. Thus adding a fixed nonnegative continuous root-phase filter with positive mean cannot turn that first-moment method into a deficit below one. The same conclusion permits any fixed nonnegative periodic target weight, by summing residue classes. This is a limitation of those fixed filters, not a statement about distinct values, shrinking-target filters, or infinitude of the complement.