Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Prepared blocks entropy
These results control an entire class of preparations, rather than an individual unusually small first-kill cell. They do not prove the general first-kill entropy conjecture.
Write and , where is the actual delayed first-kill set and the full first-kill Haar measure. We use the established valuation-model bound: for a zero-residue first-kill cell ,
This follows because the geometric valuation model assigns each -smooth integer probability ; the cell is determined by valuations. Only active moduli need be retained.
A period barrier for a prepared block
Let a finite preparatory sieve have period and full survivor density . Append distinct moduli , all coprime to , and give them one common normalized integer residue
Then, uniformly in the appended family and ,
The appended family may be finite or infinite. Its moduli are still installed in increasing numerical order.
Let be the first-kill density in the zero-residue system formed by the appended moduli alone. Their prime coordinates are disjoint from those of , so translation and independence give . If is an actual appended first kill, then lies in its corresponding zero-residue first-kill cell: otherwise an earlier appended class would cover . Also and . Thus (1) gives
All appended hits occur beyond , where every preparatory class is active. There are surviving residues modulo . The exact delayed harmonic progression bound on each of them gives
Together with (3), this proves (2).
For the energy construction, and . Its old full cylinders are disjoint, so their and make their positive entropy terms zero. Consequently its entire normalized entropy is at most . The lower bound already proved there is , so its order is exactly . Changing the cutoff or the sparse residue channel within this mechanism cannot refute constant normalized entropy.
The hypotheses matter. The argument does not handle appended moduli smaller than the preparatory period or arbitrary moving centers. The shared-prime restriction can now be removed, as proved next. Neither version applies to every conditioned block.
Removing coprimality by exact gcd strata
Theorem. Let be any -periodic set of density . Append a family of moduli with one common normalized integer center . Write
There is an absolute such that, with and ,
If is the survivor set of a finite preparatory sieve, its appended first-kill masses also satisfy
Interpret the right side as zero when . No coprimality with is assumed. The constants do not depend on or the center.
Proof. If there are no hits. Otherwise discard appended moduli greater than , which does not change the trace or any active first-kill cell. This can only decrease , so it suffices to prove the assertions for the retained finite family.
For an actual hit put , , , and , so . For a modulus , let . It can divide only if . When ,
Indeed and . Let be the set of effective moduli arising in this way, and put
The set is -periodic. Every generator of is coprime to , so CRT independence gives the Haar contribution of this stratum as
Every actual hit in the stratum has . Also and . Summing the exact delayed progression bound over the residues of gives
For a second bound, use the geometric valuation model on primes at most the global cutoff , omitting primes dividing . Its normalizing product is
since all primes dividing are at most . Every sampled with is an atom of this model. The probability of is exactly , since its retained generators are coprime to and at most . Dropping the restriction therefore gives . Combining this with (9),
Cauchy--Schwarz and (8) prove (5).
For (6), retain the original ordering of appended moduli. In a fixed -stratum the effective zero classes have first-kill measures ; incompatible classes contribute zero, and repeated effective moduli have empty later cells. The order of the effective moduli need not be increasing. Independence from the -coordinates gives
The same rough valuation model, now applied to a zero-residue first-kill cell, gives . All relevant effective generators are at most , so their cell probabilities are their Haar measures. Put . For nonzero terms,
The convex log-sum inequality for permits passage from these joint masses to their -marginals. Concavity of then yields
because . Every preparatory congruence is active at an appended hit, since . This checks that the arithmetic cells used are the actual first kills and completes the proof.
Disjoint copies cannot amplify these blocks
Embed a block by , , in a parent cylinder of measure . A base class becomes , with activation preserved exactly. The harmonic image mass is at most times the base mass, while the incremental Haar mass is divided by . Consequently (5) gives
For any finite collection of copies in pairwise disjoint parent cylinders, , and hence
Thus changing preparation systems, sharing primes within a block, or using arbitrarily many disjoint localized copies does not create a fixed harmonic deletion with vanishing incremental footprint in this construction. The argument does not handle overlapping parent regions, moving centers within a block, or appended moduli below its preparatory period. No counterexample meeting those remaining requirements was found.
There is also a separate obstruction to assigning divergent entropy to disjoint selector cylinders with distinct moduli. Croot's corollary gives
for their maximal number with moduli at most ; the hypotheses and corollary were checked on pages 1--2 of Croot, On Non-intersecting Arithmetic Progressions. For any fixed , summing over therefore gives
because each sufficiently late block contributes at most . In particular their Shannon energy is uniformly bounded. This theorem concerns disjoint full cylinders, not disjoint first-kill regions inside overlapping cylinders.
Moreover, affine disjoint copies multiply both and by the parent weight (with an additional factor at most one on from the harmonic cutoff). The weight cancels inside . Thus these direct sums yield a weighted average of internal entropies, not an extra logarithm of the reciprocal parent weight. Neither this construction nor the selector argument refutes the constant global first-kill entropy target.
A prime-power preparation can be reduced to small full footprint
There is a separate reduction for a preparation whose survivor set is periodic modulo . It permits arbitrary appended residues and overlap, but assumes all appended moduli satisfy . Let be their full union, their originally activated union, and . For every there is an appended subfamily with unions satisfying
This is a proved reduction, not a small-full-footprint theorem for arbitrary singleton families.
Separate the -adic coordinate of each full cylinder, writing it , and retain the class when . For fixed other coordinates, the retained -adic cylinders are nested or disjoint. Their union is a disjoint union of maximal retained cylinders, each having -relative measure at least . Integration over the other coordinates proves .
Let be the union of all -adic cylinders with -relative measure below . Its maximal cylinders are disjoint, so . Moreover is -periodic: a cylinder deeper than level either lies in , with relative measure one, or misses entirely. For , periodic counting gives
Every discarded active hit lies in and is at least . Partial summation bounds their harmonic mass by , proving (11).
For appended hits admitting a witnessing modulus with , this gives the explicit bound
Indeed their retained part has mass at most . Distinctness, the exact multiples inequality, and finite union compression bound this by . Add the discarded mass from (11) and optimize ; when its optimizer is larger than one, the trivial bound suffices. If , take .
Thus overlapping binary selector fibers cannot amplify the earlier energy gadgets through bounded-quotient endpoints. For unrestricted quotients, (11) reduces such an attempted construction to one with small full footprint; it does not exclude that remaining possibility. The argument uses laminarity of one prime's cylinders and supplies no corresponding uniform theorem for a general multi-prime preparation.
Independent prime-support blocks
The bounded-prime-overlap theorem extends the density conclusion below to blocks such that each prime occurs in at most a fixed number of block supports. Its proof uses product-space Hölder and the exact whole-block harmonic bound; it does not assert the first-kill entropy estimate (10) for overlapping blocks.
Theorem. Partition a strictly increasing singleton modulus family into blocks whose prime supports are pairwise disjoint. Within block , use one integer center
The blocks and their prime ranks may be unbounded, and the centers need not remain bounded. The delayed survivor set has logarithmic density equal to its finite-prefix candidate.
If that candidate is , finite prefixes already give natural density zero. Suppose . For a modulus , let denote its first-kill Haar mass among earlier moduli of its own block only. Independence of prime supports gives
The substitution maps each actual first kill into the zero-residue version of that within-block cell. The same argument as (3) yields . Therefore
This is uniform in for the given infinite system.
For a prefix of length , put and . Log-sum and (4) give
It follows that . This is precisely finite-periodic approximation in upper logarithmic density. Finite prefixes supply the claimed density. No natural-density assertion is made when .
The proof respects activation: normalized positive centers ensure , not an omitted root below its modulus. Disjoint prime supports supply independence only between blocks; no coprimality or bounded rank is assumed inside a block.