Wiki
Wiki

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

Updated

Rough shadow energy


A different attempted proof attached a rough-quotient shadow to each private endpoint and sought an averaged packing estimate. The earlier obstruction rules out bounded pointwise overlap. The construction below also rules out a uniform second-moment substitute, even with globally private positive witnesses and bounded total shadow measure.

Statement

There are finite distinct-modulus singleton families with globally private endpoints rq∈[q,2q)r_q\in[q,2q) for which the rough shadows

Sq={aq+qt:t≥1, P−(t)>q},P−(1)=∞,S_q=\{a_q+qt:t\ge1,\ P^-(t)>q\},\qquad P^-(1)=\infty,

obey

∑qd(Sq)≤C,∫(∑q1Sq)2 dμ⟶∞.(1)\sum_q d(S_q)\le C, \qquad \int\left(\sum_q\mathbf1_{S_q}\right)^2\,d\mu\longrightarrow\infty. \tag{1}

In the integral, each shadow denotes its full periodic congruence version; its natural density and pair intersection densities are unchanged by discarding the finite inactive part. Thus a uniform bound ∫Z2≤C∫Z\int Z^2\le C\int Z, or even a uniform bound on ∫Z2\int Z^2 when ∫Z\int Z is bounded, is false for this proposed shadow assignment.

A private fixed-rank family

Let P\mathcal P be the odd primes at most yy, and put λ=∑p∈P1/p\lambda=\sum_{p\in\mathcal P}1/p. For an integer k≥1k\ge1, let DkD_k be all products of exactly kk distinct primes of P\mathcal P. Use aq=q−1a_q=q-1 and rq=2q−1r_q=2q-1.

Every qq is odd, and DkD_k is primitive. If rpr_p belongs to the qq-cylinder, then q∣2pq\mid2p, hence q∣pq\mid p. Equal squarefree rank forces p=qp=q. The witnesses are therefore globally private, not just private relative to earlier moduli. Activation is exact at rq=2q−1r_q=2q-1.

One shadow has density

d(Sq)=1q∏p≤q(1−1/p)≍1qlog⁡q.(2)d(S_q)=\frac1q\prod_{p\le q}(1-1/p)\asymp\frac1{q\log q}. \tag{2}

The constants follow from the elementary Euler-product bounds.

Uniformly in kk and yy,

∑q∈Dk1qlog⁡q≤3.(3)\sum_{q\in D_k}\frac1{q\log q}\le3. \tag{3}

Indeed, write A(t)=∑p≥3p−1−tA(t)=\sum_{p\ge3}p^{-1-t} for t>0t>0 and use 1/(qlog⁡q)=∫0∞q−1−t dt1/(q\log q)=\int_0^\infty q^{-1-t}\,dt. The elementary symmetric sum is at most A(t)k/k!A(t)^k/k!. For 0<t≤10<t\le1,

A(t)≤log⁡ζ(1+t)≤log⁡(1+1/t)≤log⁡(1/t)+log⁡2.A(t)\le\log\zeta(1+t)\le\log(1+1/t)\le\log(1/t)+\log2.

Substitution u=log⁡(1/t)u=\log(1/t) bounds its integral by

1k!∫0∞(u+log⁡2)ke−u du≤2.\frac1{k!}\int_0^\infty(u+\log2)^k e^{-u}\,du\le2.

For t≥1t\ge1, put C0=∑n≥3n−2<1C_0=\sum_{n\ge3}n^{-2}<1; then A(t)≤C031−tA(t)\le C_0 3^{1-t}, whose kkth power divided by k!k! has integral C0k/(k!klog⁡3)<1C_0^k/(k!k\log3)<1. This proves (3), and hence the bounded mean in (1).

Pair intersections remain large

Let g=(q,p)g=(q,p), q=guq=gu, p=gvp=gv, and L=lcm⁡(q,p)L=\operatorname{lcm}(q,p). The two cylinders require n+1=Lzn+1=Lz. Their quotient variables in the shadows are respectively vz−1vz-1 and uz−1uz-1. At the prime 22, both leading coefficients are odd, so the two forbidden roots coincide. At an odd prime at most min⁡(q,p)\min(q,p), at most two roots are forbidden; at primes between the two cutoffs, at most one is forbidden. A zero leading coefficient gives the constant −1-1, and excludes nothing. CRT therefore yields

μ(Sq∩Sp)≥cLlog⁡qlog⁡p.(4)\mu(S_q\cap S_p) \ge\frac{c}{L\log q\log p}. \tag{4}

For detail, the conditional probability given n+1∈LZ^n+1\in L\widehat{\mathbb Z} is bounded below by

12∏3≤ℓ≤min⁡(q,p)(1−2/ℓ)∏min⁡(q,p)<ℓ≤max⁡(q,p)(1−1/ℓ),\frac12\prod_{3\le\ell\le\min(q,p)}(1-2/\ell) \prod_{\min(q,p)<\ell\le\max(q,p)}(1-1/\ell),

where the products are over primes. The first product is bounded below by an absolute positive constant times the square of ∏ℓ≤min⁡(q,p)(1−1/ℓ)\prod_{\ell\le\min(q,p)}(1-1/\ell), since the correction ratios form a convergent positive product. The displayed quantity is therefore ≫1/(log⁡qlog⁡p)\gg1/(\log q\log p), proving (4).

Selecting a rank with large gcd energy

Over all pairs of squarefree products of primes from P\mathcal P, the sum of 1/lcm⁡(q,p)1/\operatorname{lcm}(q,p) is

Z=∏ℓ∈P(1+3/ℓ)≍(log⁡y)3.Z=\prod_{\ell\in\mathcal P}(1+3/\ell) \asymp(\log y)^3.

Normalize these weights to a probability law. At each prime the four states (neither product, first only, second only, both) have weights 1,1/ℓ,1/ℓ,1/ℓ1,1/\ell,1/\ell,1/\ell, independently between primes. If K1,K2K_1,K_2 are the two ranks, their difference has independent symmetric increments, with probabilities 1/(ℓ+3)1/(\ell+3) each for +1+1 and −1-1. Its characteristic function is

φ(t)=∏ℓ∈P(1−2(1−cos⁡t)ℓ+3).\varphi(t)=\prod_{\ell\in\mathcal P} \left(1-\frac{2(1-\cos t)}{\ell+3}\right).

Every factor is positive for real tt. For ∣t∣≤λ−1/2|t|\le\lambda^{-1/2} and large λ\lambda, the product is at least an absolute positive constant. Fourier inversion consequently gives

Pr⁡(K1=K2)≥c/λ.\Pr(K_1=K_2)\ge c/\sqrt\lambda.

Also EKi≤2λ\mathbb E K_i\le2\lambda, and the exponential-moment bound at parameter log⁡2\log2 gives

Pr⁡(Ki>4λ)≤exp⁡(−(4log⁡2−2)λ).\Pr(K_i>4\lambda)\le\exp(-(4\log2-2)\lambda).

The probability of rank zero for both products is 1/Z1/Z, also negligible. Pigeonholing among the at most 4λ4\lambda positive ranks up to 4λ4\lambda supplies one kk with

1≤k≤4λ,∑q,p∈Dk1lcm⁡(q,p)≥cZλ3/2.(5)1\le k\le4\lambda, \qquad \sum_{q,p\in D_k}\frac1{\operatorname{lcm}(q,p)} \ge\frac{cZ}{\lambda^{3/2}}. \tag{5}

Every member of DkD_k satisfies log⁡q≤klog⁡y\log q\le k\log y. Equations (4)--(5) now give

∫(∑q∈Dk1Sq)2dμ≥cZλ3/2k2(log⁡y)2≫log⁡y(log⁡log⁡y)7/2⟶∞.\int\left(\sum_{q\in D_k}\mathbf1_{S_q}\right)^2d\mu \ge\frac{cZ}{\lambda^{3/2}k^2(\log y)^2} \gg\frac{\log y}{(\log\log y)^{7/2}}\longrightarrow\infty.

Together with (2)--(3), this proves (1).

The residues are all the fixed signed center −1-1, a solved logarithmic density regime. The construction refutes this specific quadratic shadow charge; it does not refute endpoint nullity, the primitive-type reciprocal sum target, or a different fractional allocation of shadows.