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 .
An exact lattice bound
Let be an integer, let be integers, and put
For and an integer , write
and let count positive integral with in this target class. For every real ,
Proof. Use the weighted norm . The volume of its radius- ball in the positive orthant is .
Fix one admissible residue vector. Attach the disjoint cubes to its positive lattice points of norm at most . Every such cube lies in the positive ball of radius , proving the upper bound for this residue vector.
For the lower bound, take any positive real vector of norm at most and round each coordinate upwards to the least positive integer in the prescribed residue class. The resulting lattice point has norm at most . Each lattice point has preimage volume at most . Thus the number of counted points is at least . Summing over the admissible residue vectors proves (1).
No constants in (1) depend implicitly on or .
Consequence for the finite quintic certificate family
Use the finite set and canonical family of the quintic first-moment proof:
and each prime exponent in a member of is , or . That proof establishes the finite coefficient inequality
for every , not merely after taking a fixed-modulus limit. Its finite certificate is used as established here, without a new computation.
Put
Then for all tuples in this family. Canonical uniqueness and the upper bound on the number of orderings of a five-element multiset give
The inequality is strict whenever the bracket is positive. Hence uniformly for any moving moduli and residues ,
In fact a below-one first moment remains impossible for all with any fixed
The constant is extremely small but positive and independent of .
Moving intervals
Let and . Subtract the upper bound (1) at from the lower bound at , using the same finite coefficient family. This gives
Again it is strict if the displayed bracket is positive. Write and suppose . The mean-value theorem gives
Thus the inner difference in (5) is at least . In particular,
The hypothesis implies , so the preceding bound is applicable. More generally the liminf in (4), with replaced by the interval length , is at least whenever .
These estimates exclude a below-one first-moment argument throughout these ranges. They say nothing comparable when 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 , 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 of canonical fifth-power cores, there is a positive integer such that
is equidistributed in the -dimensional unit torus. Nevertheless every target is a sum of five positive fifth powers.
Proof. Let denote the primes supporting and let
The monomials , , form a basis over . To check the degree, adjoin first if needed, then the remaining prime radicals one at a time. Before adjoining , the preceding field is unramified at the fresh prime : the discriminants of the previous defining polynomials are supported on and their respective defining primes, and composita of unramified extensions remain unramified. Therefore is Eisenstein at any prime above , and each adjunction has degree five. The first adjunction is ordinary Eisenstein over .
For a canonical core the exponents are , giving distinct residues modulo five. Thus distinct , , are nonzero rational multiples of distinct basis monomials, and are linearly independent over .
Set and . Choose a prime . Then and . The derivative of at is a unit modulo . If , take ; otherwise take . Expansion modulo gives for in either case.
The field is unramified at , so , by valuation. Consequently
are linearly independent over : a relation with nonzero constant term would put in , 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,
All five summands are positive, completing the proof.
For example, for every fixed , a proportion of the parameters make all the roots lie within 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 , 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 , positive integral coefficients , and integers . Put . For every fixed real ,
where .
Proof. Let and fix . Tuples with some contribute . For the other tuples, fix , set , and split into residue classes modulo . The congruence in (8) either holds on an entire such class or nowhere on that class; the size restrictions give one interval. The phase has
On the retained interval, and , so . The standard second-derivative estimate for exponential sums on an interval, when , applies after parameterizing the residue class. It gives per fiber. Thus the left side of (8) is
Let and then . This proves (8).
For clarity, this argument also gives the following dependence on a nonzero varying frequency:
It does not give a useful relative error for every shrinking phase set.
Continuous weights have the same limiting mean
Fix positive real numbers , and let be the closure in of the continuous line . Write for Haar probability measure. For any continuous , put
Fourier approximation and (8) give
where is the unweighted tuple count. Indeed, a Fourier character indexed by is constant one precisely when ; every other character is covered by (8).
Ordinary target counting has the identical mean:
For a nonzero Fourier frequency , comparison with the integral gives an error for the exponential sum in (11). Substitution and integration by parts bound the integral by . Both are . Fourier approximation proves (11), including the case of rational dependencies among the .
Take , for any fixed finite list of cores, and . Apply (10) to the finite canonical family used in the quintic certificate, and divide its ordered counts by . Every unordered representation has at most orderings, so nonnegative weighting preserves this lower bound. If is the number of unordered representations of by exactly five positive -powerful integers, the certificate and (11) imply
The normalized weighted target count tends to . 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.