Overlapping entropy obstruction
The moment obstructions rule out
fixed higher-moment bounds for an overlapping potential. The following
strengthening also rules out uniform integrability, including every
superlinear Orlicz bound. It does not refute the disjoint first-kill
entropy target and is not a counterexample to Problem 25.
For a finite singleton system, let Fq be its full first-kill cells,
eq=μ(Fq), and
cq(X)=HEq(X)/H⌊X⌋. Consider on Haar space
ZX(z)=q∑qcq(X)1[aq]q(z).
There are zero-residue systems and cutoffs X=Xk such that, for a
fixed γ>0,
k→∞liminf∫{ZXk≥eγk}ZXkdμ≥21.(1)
In particular ∫ZXklog+ZXkdμ≫k.
Choose a finite set P of primes exceeding k3, stopping when
λ:=p∈P∑p−1=2k+O(k−3).
Then ∑p∈Pp−2=O(k−2). Take every product of k
distinct primes from P as a modulus, with residue zero, and order
these products numerically. Put L=∏p∈Pp and X=L2.
These moduli are distinct and primitive. Every positive multiple of
a modulus is active, so Eq=Fq∩N exactly.
Each cell is L-periodic with exactly eqL points in every block
of L consecutive positive integers. In the jth such block,
each reciprocal is at least 1/(jL). Therefore
HEq(L2)≥eqHL,cq(L2)≥eq/2,(2)
using HL2≤2HL. The latter inequality follows, for example,
by bounding the jth block after the first in Hmn by
1/(j−1), which gives Hmn≤Hm+Hn.
Define
Y=21q∑qeq1q∣z≤ZX,β=q∑eq.
If NP counts the dividing primes of P in a Haar integer, then
β=Pr(NP≥k)=1−O(k−1), by Chebyshev, since
ENP=2k+O(k−3) and
VarNP≤ENP. Thus
EY=β/2⟶1/2.(3)
For a modulus q, write u(q)=maxp∣qp and
T(q)=∑p∈P, p≤u(q)1/p.
The least numerical k-prime product dividing a Haar integer consists
of its k smallest dividing pool primes. Consequently
qeq=p∈P, p<u(q)p∤q∏(1−1/p).(4)
If q has law eq/β, it is that first product conditional on
NP≥k. Therefore
Pr(0.9k≤T(q)≤1.1k)=1−O(k−1).(5)
Indeed, a first product before reciprocal time 0.9k requires at
least k successes in a prime prefix of mean at most 0.9k.
A first product after time 1.1k requires fewer than k successes
in a prefix of mean 1.1k+O(k−3) (or one with mean just below
that threshold). Both probabilities are O(1/k) by Chebyshev;
conditioning costs a factor 1/β=1+O(1/k).
Size bias and concentration
The size-biased probability dν=Ydμ/EY can be sampled
by choosing q with probability eq/β and then choosing a
Haar integer conditional only on q∣z, not on Fq.
Its density is exactly
∑q(eq/β)q1q∣z=2Y/β.
For the chosen q, let Nq count dividing pool primes at most
u(q). Under this conditional Haar law,
Nq=k+p∈P, p≤u(q)p∤q∑1p∣z,
with independent Bernoulli terms. When (5) holds,
E(Nq∣q)≥1.9k−k−2,Var(Nq∣q)≤1.1k.
Another application of Chebyshev gives
Pr(Nq≥1.8k∣q)=1−O(1/k), uniformly over these q.
Every k-product r of these dividing primes is among our moduli,
and (4) gives
rer≥p∈Pp≤u(q)∏(1−1/p)≥e−T(q)−O(k−2).
It follows, with ν-probability 1−O(1/k), that
Y≥21e−1.1k−O(k−2)(k⌊1.8k⌋).
Stirling's formula gives
log(k⌊1.8k⌋)=(1.8log1.8−0.8log0.8)k+O(logk),
whose linear coefficient exceeds 1.1. Hence, with
γ=1/20, for all sufficiently large k,
ν(Y≥eγk)=1−O(1/k),∫{Y≥eγk}Ydμ⟶1/2.
Since Y≤ZX, this proves (1).
If Φ is convex and increasing, Φ(0)=0, and
Φ(t)/t→∞, then Φ(t)/t is nondecreasing and (1)
implies ∫Φ(ZXk)dμ→∞ as well.
The distinction from the disjoint potential is essential. In these
zero-residue examples, the geometric valuation model gives
cq(X)≤(ZXEuler/HX)eq≪eq, where
ZXEuler=∏p≤X(1−1/p)−1.
Thus ∑q(cq/eq)1Fq is uniformly bounded.
Replacing these disjoint cells by the cylinders loses precisely the
information needed by the still-unproved entropy argument.