Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

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 FqF_q be its full first-kill cells, eq=μ(Fq)e_q=\mu(F_q), and cq(X)=HEq(X)/H⌊X⌋c_q(X)=H_{E_q}(X)/H_{\lfloor X\rfloor}. Consider on Haar space

ZX(z)=∑qqcq(X)1[aq]q(z).Z_X(z)=\sum_q q c_q(X)\mathbf1_{[a_q]_q}(z).

There are zero-residue systems and cutoffs X=XkX=X_k such that, for a fixed γ>0\gamma>0,

lim inf⁡k→∞∫{ZXk≥eγk}ZXk dμ≥12.(1)\liminf_{k\to\infty} \int_{\{Z_{X_k}\ge e^{\gamma k}\}} Z_{X_k}\,d\mu \ge\frac12. \tag{1}

In particular ∫ZXklog⁡+ZXk dμ≫k\int Z_{X_k}\log_+ Z_{X_k}\,d\mu\gg k.

Construction and the first-kill formula

Choose a finite set PP of primes exceeding k3k^3, stopping when

λ:=∑p∈Pp−1=2k+O(k−3).\lambda:=\sum_{p\in P}p^{-1}=2k+O(k^{-3}).

Then ∑p∈Pp−2=O(k−2)\sum_{p\in P}p^{-2}=O(k^{-2}). Take every product of kk distinct primes from PP as a modulus, with residue zero, and order these products numerically. Put L=∏p∈PpL=\prod_{p\in P}p and X=L2X=L^2. These moduli are distinct and primitive. Every positive multiple of a modulus is active, so Eq=Fq∩NE_q=F_q\cap\mathbb N exactly.

Each cell is LL-periodic with exactly eqLe_qL points in every block of LL consecutive positive integers. In the jjth such block, each reciprocal is at least 1/(jL)1/(jL). Therefore

HEq(L2)≥eqHL,cq(L2)≥eq/2,(2)H_{E_q}(L^2)\ge e_qH_L, \qquad c_q(L^2)\ge e_q/2, \tag{2}

using HL2≤2HLH_{L^2}\le2H_L. The latter inequality follows, for example, by bounding the jjth block after the first in HmnH_{mn} by 1/(j−1)1/(j-1), which gives Hmn≤Hm+HnH_{mn}\le H_m+H_n.

Define

Y=12∑qqeq1q∣z≤ZX,β=∑qeq.Y=\frac12\sum_q qe_q\mathbf1_{q\mid z}\le Z_X, \qquad \beta=\sum_qe_q.

If NPN_P counts the dividing primes of PP in a Haar integer, then β=Pr⁡(NP≥k)=1−O(k−1)\beta=\Pr(N_P\ge k)=1-O(k^{-1}), by Chebyshev, since ENP=2k+O(k−3)\mathbb E N_P=2k+O(k^{-3}) and Var⁡NP≤ENP\operatorname{Var}N_P\le\mathbb E N_P. Thus

EY=β/2⟶1/2.(3)\mathbb EY=\beta/2\longrightarrow1/2. \tag{3}

For a modulus qq, write u(q)=max⁡p∣qpu(q)=\max_{p\mid q}p and T(q)=∑p∈P, p≤u(q)1/pT(q)=\sum_{p\in P,\ p\le u(q)}1/p. The least numerical kk-prime product dividing a Haar integer consists of its kk smallest dividing pool primes. Consequently

qeq=∏p∈P, p<u(q)p∤q(1−1/p).(4)qe_q=\prod_{\substack{p\in P,\ p<u(q)\\p\nmid q}}(1-1/p). \tag{4}

If qq has law eq/βe_q/\beta, it is that first product conditional on NP≥kN_P\ge k. Therefore

Pr⁡(0.9k≤T(q)≤1.1k)=1−O(k−1).(5)\Pr(0.9k\le T(q)\le1.1k)=1-O(k^{-1}). \tag{5}

Indeed, a first product before reciprocal time 0.9k0.9k requires at least kk successes in a prime prefix of mean at most 0.9k0.9k. A first product after time 1.1k1.1k requires fewer than kk successes in a prefix of mean 1.1k+O(k−3)1.1k+O(k^{-3}) (or one with mean just below that threshold). Both probabilities are O(1/k)O(1/k) by Chebyshev; conditioning costs a factor 1/β=1+O(1/k)1/\beta=1+O(1/k).

Size bias and concentration

The size-biased probability dν=Y dμ/EYd\nu=Y\,d\mu/\mathbb EY can be sampled by choosing qq with probability eq/βe_q/\beta and then choosing a Haar integer conditional only on q∣zq\mid z, not on FqF_q. Its density is exactly ∑q(eq/β)q1q∣z=2Y/β\sum_q(e_q/\beta)q\mathbf1_{q\mid z}=2Y/\beta.

For the chosen qq, let NqN_q count dividing pool primes at most u(q)u(q). Under this conditional Haar law,

Nq=k+∑p∈P, p≤u(q)p∤q1p∣z,N_q=k+\sum_{\substack{p\in P,\ p\le u(q)\\p\nmid q}} \mathbf1_{p\mid z},

with independent Bernoulli terms. When (5) holds,

E(Nq∣q)≥1.9k−k−2,Var⁡(Nq∣q)≤1.1k.\mathbb E(N_q\mid q)\ge1.9k-k^{-2}, \qquad \operatorname{Var}(N_q\mid q)\le1.1k.

Another application of Chebyshev gives Pr⁡(Nq≥1.8k∣q)=1−O(1/k)\Pr(N_q\ge1.8k\mid q)=1-O(1/k), uniformly over these qq.

Every kk-product rr 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).re_r\ge\prod_{\substack{p\in P\\p\le u(q)}}(1-1/p) \ge e^{-T(q)-O(k^{-2})}.

It follows, with ν\nu-probability 1−O(1/k)1-O(1/k), that

Y≥12e−1.1k−O(k−2)(⌊1.8k⌋k).Y\ge\frac12e^{-1.1k-O(k^{-2})} {\lfloor1.8k\rfloor\choose k}.

Stirling's formula gives

log⁡(⌊1.8k⌋k)=(1.8log⁡1.8−0.8log⁡0.8)k+O(log⁡k),\log {\lfloor1.8k\rfloor\choose k} =(1.8\log1.8-0.8\log0.8)k+O(\log k),

whose linear coefficient exceeds 1.11.1. Hence, with γ=1/20\gamma=1/20, for all sufficiently large kk,

ν(Y≥eγk)=1−O(1/k),∫{Y≥eγk}Y dμ⟶1/2.\nu(Y\ge e^{\gamma k})=1-O(1/k), \qquad \int_{\{Y\ge e^{\gamma k}\}}Y\,d\mu\longrightarrow1/2.

Since Y≤ZXY\le Z_X, this proves (1).

If Φ\Phi is convex and increasing, Φ(0)=0\Phi(0)=0, and Φ(t)/t→∞\Phi(t)/t\to\infty, then Φ(t)/t\Phi(t)/t is nondecreasing and (1) implies ∫Φ(ZXk) dμ→∞\int\Phi(Z_{X_k})\,d\mu\to\infty 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≪eqc_q(X)\le (Z_X^{\rm Euler}/H_X)e_q\ll e_q, where ZXEuler=∏p≤X(1−1/p)−1Z_X^{\rm Euler}=\prod_{p\le X}(1-1/p)^{-1}. Thus ∑q(cq/eq)1Fq\sum_q(c_q/e_q)\mathbf1_{F_q} is uniformly bounded. Replacing these disjoint cells by the cylinders loses precisely the information needed by the still-unproved entropy argument.