Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Curved residue profiles
This approach uses the real graph of the residue function. Curvature controls compatibility between congruences, without imposing coherence or restricting the prime factors of the moduli. It supplies a new endpoint theorem, not a solution of the full delayed-union problem.
Curved perturbations of every slope
Theorem. Fix and , and set
These residues satisfy for all sufficiently large . Let be a set of distinct moduli, and fix an integer . Suppose the points satisfy
Then and have natural density zero.
Consequently, in every singleton system with residues (1), all first kills with bounded quotient form a naturally null set. The same assertion allows arbitrary uniformly bounded integer errors in (1). There is no Diophantine condition on .
The earlier slope theorem required a Brjuno hypothesis for natural endpoint nullity and admitted a Liouville obstruction without that hypothesis. Here the sublinear curved term removes that restriction. Neither theorem controls unbounded quotients.
Curvature bounds the dyadic second moment
On Haar space let
We prove, uniformly in and ,
The finitely many initially unnormalized residues cause no difficulty for this full-cylinder assertion.
Consider compatible distinct in the dyadic block and write
Compatibility and the error of less than one in a difference of floors give
Put . Since has second derivative of constant sign, with on ,
The allowed interval of has length at most , and its image has length . Thus (4) is the union of at most intervals, each of length at most . Its number of integer points is at most
This estimate is uniform in the phase .
Summing (6) over bounds the number of candidate pairs for a fixed by
Dropping the coprimality condition on only increases this count. Every pair of exact gcd contributes to the Haar second moment. Such distinct pairs have . After summing over , including both orders, and adding the diagonal,
For example the first term uses , and the third uses . Since and , the right side is bounded in . This proves (3).
The two residue coordinates become uniform
For every fixed integer and residues ,
If is irrational, write and . For every nonzero integer ,
The partial sums of are bounded. The last factor has total variation , so Abel summation bounds the exponential sum by . Trigonometric approximation therefore makes uniform. The condition is precisely , proving (8).
If is rational, refine to . On this progression, equals . For fixed , the inverse-level intervals for on number , each has length , and the full interval lengths are increasing by convexity of . Abel summation against the mean-zero periodic sequence consequently shows that the levels with index have total length . The two possibly clipped end intervals have the same error bound. Counting on each level incurs a total error . Hence
Take and sum over the possible to prove (8).
Transfer through an arbitrary old survivor set
Let , , and take a finite prefix . Write
Let be an old period and identify with its surviving residues modulo . If is empty, (2) allows no later selected endpoints. Otherwise, for , define
Here for selected , by (2), and CRT gives .
For fixed , put and define in the same way. Translation by preserves every fiber modulo , so exact counting gives
Equation (8), with this fixed period, therefore implies
Put and . Its support has measure at most , and (3) gives . Twice applying Cauchy--Schwarz yields
Thus
Exhausting by finite prefixes makes . Dyadic summation proves . Since , the endpoint set is naturally null as well. The constant in this conclusion does not grow with the old period; the limit in was taken while that period was fixed.
For actual bounded-quotient first kills, partition by the finitely many values of . At each such point all earlier moduli are active, so (2) holds. A fixed integer shift of all the residues changes neither the compatibility proof nor uniformity in (8). Partitioning by the finitely many error values proves the stated bounded-perturbation extension.
A fixed flat profile can have large natural endpoint spikes
The curved theorem cannot be replaced by an assertion for every smooth increasing sublinear profile. In fact the fixed choice
admits a globally private endpoint family of positive upper natural density. Its full delayed union can fail to have natural density, although it has logarithmic density. All selected moduli below are large enough for (11) to be normalized.
Fix . At stage , choose an integer exceeding every earlier endpoint, and put
Writing for the old period, choose so large that and
This is possible by the uniform multiples-window limit. Throughout the block, for large . Retain those for which avoids the earlier full union. Its Haar measure is at most , so periodic counting retains at least moduli.
The new endpoints have pairwise differences less than , so are private within their block. They avoid earlier cylinders by selection. Every earlier endpoint is less than , the least positive representative of each new cylinder, so the reverse privacy holds too. Also . Consequently the full endpoint set satisfies
Let be the retained moduli and their delayed union. It is exactly . Positive translation and the exact multiples harmonic inequality give, for every ,
Thus finite-block approximation proves logarithmic density for , where denotes the full block union. But contains , so its upper natural density is greater than by (13). It has no natural density. Its lower natural density is : finite prefixes give the lower bound, and logarithmic density gives the reverse inequality for the lower natural density.
The endpoint set itself has logarithmic density zero by the summable-footprint endpoint bound. The independent ordered-run criterion also gives logarithmic endpoint nullity for every system with (11). This example is not a counterexample to Problem 25.
The remaining gap
Even in the curved class, its full arithmetic cylinder trace cannot replace its delayed union. For , , select , . The canonical residue is , so the full cylinders cover every integer at least through an inactive root. Their delayed union, however, has natural density at most , by the summable-moduli theorem. Thus full-trace regularity cannot be assumed in a dynamical argument for these profiles.
The curved theorem proves natural nullity of every fixed quotient range, not tightness uniformly as the quotient bound tends to infinity. It therefore supplies no density theorem for the entire curved-profile union. The flat example shows why natural-density claims require care, while the run criterion gives a different logarithmic endpoint regime. No general endpoint theorem or control of unbounded-quotient first kills has resulted from this approach.