Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Coherent annuli and shadows
The following finite estimates are proved. They do not control the union of all arbitrarily thin power bands adjacent to the activation boundary.
A finite relative-power annulus estimate
Consider a coherent family, and selected full first-kill cells of total Haar mass . Let denote the least full covering modulus. For , put
Uniformly in finite families, centers, , and ,
The same statement follows for infinite families by retaining the finitely many moduli that can be active below .
Here is the additional summation argument, using the already proved coherent smooth-factor sieve. Work on for dyadic , omitting the initial range ; its total harmonic weight is . Set with a small absolute . The shifted smooth-part estimate excludes at most points. At a remaining point write , where is the -smooth part of , is -rough, and is an integer realizing the finite center residues. We have . For the retained annulus,
The quotient interval has length , sufficient for the elementary rough-number upper sieve. Moreover is the first generator dividing in the corresponding zero-residue system. Retaining this size information in that sieve gives
All constants remain absolute; the discarded initial range absorbs the fixed factors two in the cutoffs.
For fixed , the dyadic sum of over the displayed range is . This follows by placing between and and comparing the sum with the integral of . Also, the geometric valuation model gives
Partial summation of (3) yields
Multiply (2) by the harmonic bound per point and sum the dyadic intervals. Equations (2)--(3) give the main term and the stated error. The excluded fractions give , completing (1).
For fixed , the infinite-family annulus was already naturally null: it is the difference of two power-delayed unions with the same density. The new content of (1) is its finite uniformity and explicit error, allowing to decrease with . Summing all decreasing deficit bands still incurs an unbounded loss. The argument does not justify interchanging that infinite sum with logarithmic density.
A weighted one-prime-shadow bound
Let be a finite primitive set. For , define
Then
For each prime , assign the face . For fixed , order its prime children increasingly. Every earlier child divides , so
If the child weights are , the inequality and telescoping imply
Thus each face contributes at most . Summing over proves (4); each is counted exactly times.
An actual coherent first-kill quotient cannot be divisible by any prime in : otherwise a smaller generator would divide . This is additional information beyond primitive-modulus counting. However, no simultaneous upper sieve has been proved that converts (4) into the required harmonic bound. In particular, predecessor primes larger than the relevant quotient interval cannot simply be treated as independent arithmetic exclusions.
The primitive atom obstruction shows why the unsieved term cannot instead be bounded using only primitivity and the full Haar footprint. A weighted shadow/sieve argument is a provisional possibility, not an established next step.
Separate phase maxima cannot be summed
There is a stronger obstruction to replacing the simultaneous problem by individual quotient-sieve estimates. There are finite primitive modulus sets with and cutoffs for which
Here is the actual first-kill set at in the coherent system on . The supremum may use a different center for each modulus. Equation (5) is not a single-system harmonic anomaly.
Use the prime-block construction. With , set
For a sufficiently large fixed , take all products of distinct pool primes that are at most , and set . The reciprocal-weight and upper-cutoff estimates proved in that note give
No lower cutoff is imposed on ; this ensures that every smaller rank- product used next is still a generator.
Fix and put
Choose . For , the earlier coherent classes are avoided exactly when
To prove necessity, for each the generator is smaller than . Matching its -coordinate, together with , makes divide . Conversely, any earlier rank- generator introduces a prime smaller than : otherwise replacing its removed prime factors of by the introduced ones would increase the product. If that generator divides , this violates (7).
Independently choose the forbidden quotient residue at each uniformly from . CRT realizes these choices by an integer center satisfying . For , primes cannot remove . For the remaining primes the hitting probability is at most . The convergent correction product in the admissible-set argument and the elementary Euler-product bounds therefore imply
All these hits are active, every predecessor is active there, and . Averaging over the choices gives
Summing and applying (6) proves (5), with a lower bound .
Thus even optimal separate first-kill bounds, uniform in the coherent center, cannot be summed to obtain the desired small-footprint result. In this example the complete predecessor conditions already reduce to the prime exclusions (7), so merely retaining composite predecessors does not repair that particular strategy. A successful replacement would have to use the common center simultaneously across moduli. Neither such an estimate nor a synchronized counterexample was obtained.
Simultaneous transport across a bounded divisor gap
The following bound uses one common center simultaneously, rather than summing separate phase maxima. It applies directly to selected first-kill cells and has no preparatory-period constant.
Let be finite, with coherent center , and let be the least covering modulus of an activated hit . Select cells of total Haar mass . For an integer , set
Then, for integers ,
where .
Proof. Put
where the first generator is taken in the zero-residue multiples system on . The geometric valuation distribution gives
For this calculation retain the generators at most ; their selected first-kill masses sum to at most . All their prime supports are at most , so the smooth-integer law has exactly their Haar divisibility probabilities.
Any witnessing belongs to , with first generator exactly . An earlier generator dividing would also cover ; it would be active since it is smaller than .
For witnesses , the sum of the weights of the positive delayed progression points at a fixed is at most . Summing over gives by (9). For witnesses , select one per . This selection is injective: a fixed has at most one positive root congruent to . Since , the second contribution is at most . The established estimate completes (8).
For all cells together, one may allow any matching in , not necessarily a multiple of the actual first-kill modulus. The exact multiples inequality gives
where . Use in the same two counts.
Taking in (8) shows that outside normalized harmonic mass , any selected-cell anomaly has no matching multiple of its first-kill modulus within factor of the sampled integer. Equivalently, all ordinary divisors of the profinite cofactor avoid . This is a necessary divisor-gap condition, not a bound for the remaining points. It does not prove the coherent small-footprint estimate or logarithmic density.