Wiki
Wiki

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

Updated

Harmonic affine completion


The following uniform coupling theorem is proved. Its application to Problem 25 includes a return-probability weight that has not been removed. No singleton-distinctness assertion is implicit in the theorem.

Total-variation convergence

Write HN=∑n≤N1/nH_N=\sum_{n\le N}1/n, with H0=0H_0=0. For integers 1≤L≤X1\le L\le X, define a subprobability measure νL,X\nu_{L,X} on G=Z^G=\widehat{\mathbb Z} as follows. Give each n∈[L,X]n\in[L,X] mass 1/(nHX)1/(nH_X), choose

1≤r≤⌊n/L⌋with probability1rH⌊n/L⌋,1\le r\le\lfloor n/L\rfloor \quad\hbox{with probability}\quad \frac1{rH_{\lfloor n/L\rfloor}},

and then choose a Haar-uniform point in the cylinder [n]Lr[n]_{Lr}. This preserves n(modL)n\pmod L. Its total mass is

bL,X=HX−HL−1HX.b_{L,X}=\frac{H_X-H_{L-1}}{H_X}.

Uniformly in L,XL,X,

sup⁡E⊆G mmeasurable∣νL,X(E)−bL,Xμ(E)∣≪1+log⁡log⁡(3X/L)HX.(1)\sup_{E\subseteq G\ { m measurable}} |\nu_{L,X}(E)-b_{L,X}\mu(E)| \ll\frac{1+\log\log(3X/L)}{H_X}. \tag{1}

In particular ν1,X\nu_{1,X} converges to Haar in total variation, not merely against fixed continuous test functions.

Its density is

ρL,X(z)=LHX∑r≤X/L∑Lr≤n≤Xn≡z(modLr)1nH⌊n/L⌋.(2)\rho_{L,X}(z)=\frac L{H_X} \sum_{r\le X/L} \sum_{\substack{Lr\le n\le X\\n\equiv z\pmod{Lr}}} \frac1{nH_{\lfloor n/L\rfloor}}. \tag{2}

At fixed rr, write the canonical residue of zz modulo LrLr as a∈[0,Lr)a\in[0,Lr). Every term has n=kLr+an=kLr+a, k≥1k\ge1, so n≥kLrn\ge kLr and H⌊n/L⌋≥HkrH_{\lfloor n/L\rfloor}\ge H_{kr}. Consequently, with T=⌊X/L⌋T=\lfloor X/L\rfloor,

ρL,X(z)≤DTHX,DT:=∑j≤Td(j)jHj.(3)\rho_{L,X}(z)\le\frac{D_T}{H_X},\qquad D_T:=\sum_{j\le T}\frac{d(j)}{jH_j}. \tag{3}

Here d(j)d(j) is the divisor-counting function. The elementary identity

∑j≤td(j)=∑a≤t⌊t/a⌋=tlog⁡t+O(t)\sum_{j\le t}d(j)=\sum_{a\le t}\lfloor t/a\rfloor =t\log t+O(t)

and partial summation give

DT=log⁡T+O(1+log⁡log⁡(3T)).(4)D_T=\log T+O(1+\log\log(3T)). \tag{4}

For detail, for j≥2j\ge2 replace 1/Hj1/H_j by 1/log⁡j+O(1/log⁡2j)1/\log j+O(1/\log^2j). Partial summation with the displayed divisor estimate makes the main sum log⁡T+O(1+log⁡log⁡(3T))\log T+O(1+\log\log(3T)), and the error sum O(1+log⁡log⁡(3T))O(1+\log\log(3T)).

Uniformly, HX−HL−1=log⁡T+O(1)H_X-H_{L-1}=\log T+O(1). Thus (3) bounds ρL,X\rho_{L,X} above by bL,X+ηb_{L,X}+\eta, where

0≤η=DT−HX+HL−1HX≪1+log⁡log⁡(3T)HX.0\le\eta=\frac{D_T-H_X+H_{L-1}}{H_X} \ll\frac{1+\log\log(3T)}{H_X}.

Nonnegativity also follows by integrating (3). The density has mean bL,Xb_{L,X}, so its positive and negative deviations from this mean each have integral at most η\eta. This proves (1). For L=1L=1, the same bound implies the relative entropy estimate

D(ν1,X∥μ)≤log⁡(DX/HX)=O(log⁡log⁡(3X)/HX).D(\nu_{1,X}\Vert\mu) \le\log(D_X/H_X)=O(\log\log(3X)/H_X).

An averaged conditioned return inequality

Consider any finite or countable congruence family and put

U=⋃q[aq]q,Dn={q≤n:n≡aq(modq)}.U=\bigcup_q[a_q]_q,\qquad D_n=\{q\le n:n\equiv a_q\pmod q\}.

For a set DD, let M(D)M(D) be its set of positive multiples. If the random completion period is divisible by a member of DnD_n, the completed point belongs to UU. For L=1L=1, (1) therefore gives

1HX∑n≤XHM(Dn)(n)nHn≤μ(U)+O ⁣(log⁡log⁡(3X)HX).(5)\frac1{H_X}\sum_{n\le X} \frac{H_{M(D_n)}(n)}{nH_n} \le\mu(U)+O\!\left(\frac{\log\log(3X)}{H_X}\right). \tag{5}

More generally, let SS be LL-periodic and put

Dn,L′={q/(q,L):q∈Dn},Nn=⌊n/L⌋.D'_{n,L}=\{q/(q,L):q\in D_n\},\qquad N_n=\lfloor n/L\rfloor.

The completion preserves SS, and q∣Lrq\mid Lr if and only if q/(q,L)∣rq/(q,L)\mid r. Hence

1HX∑L≤n≤Xn∈SHM(Dn,L′)(Nn)nHNn≤bL,Xμ(S∩U)+O ⁣(1+log⁡log⁡(3X/L)HX).(6)\frac1{H_X}\sum_{\substack{L\le n\le X\\n\in S}} \frac{H_{M(D'_{n,L})}(N_n)}{nH_{N_n}} \le b_{L,X}\mu(S\cap U) +O\!\left(\frac{1+\log\log(3X/L)}{H_X}\right). \tag{6}

Indeed, completion restricted to starting points in SS is exactly the restriction of νL,X\nu_{L,X} to SS, so its mass in UU is νL,X(S∩U)\nu_{L,X}(S\cap U). This also explains the coefficient bL,Xb_{L,X}. The theorem allows S,U,LS,U,L to depend on XX.

One may take SS to be the full periodic survivor set of a finite prefix and UU its tail union; then the right side has the desired incremental Haar footprint. Starting with n≥Ln\ge L, where LL is the prefix period, makes every prefix modulus active.

The remaining loss

The weights on the left of (5)--(6) are return probabilities, not indicators of deletion. For a sole active witness qq, the return probability at L=1L=1 is only

H⌊n/q⌋qHn.\frac{H_{\lfloor n/q\rfloor}}{qH_n}.

In (6), a witness with q/(q,L)>n/Lq/(q,L)>n/L contributes zero. Thus comparable-modulus first kills can be lost altogether, and the coupling does not establish the required unweighted logarithmic-tail estimate. Neither the coupling proof nor (5)--(6) uses singleton distinctness. The counterexample below rules out a universal lower bound for these return weights even after imposing distinctness and primitivity. A solution by this route would need a different completion law or additional footprint-sensitive information. No such adaptive kernel or uniform first-kill relative-entropy bound was obtained.

The averaged return can be arbitrarily small despite full deletion

There is no universal positive lower bound for the return weight in (5), even for a primitive zero-residue system with canonical private integer witnesses. Fix an integer Q≥2Q\ge2, and put

PQ={q≥Q:every proper divisor of q is below Q}.P_Q=\{q\ge Q:\text{every proper divisor of }q\text{ is below }Q\}.

This is primitive. Every integer n≥Qn\ge Q has a smallest divisor at least QQ, which belongs to PQP_Q. Thus the zero classes at these distinct moduli, activated at n≥qn\ge q, delete exactly [Q,∞)∩N[Q,\infty)\cap\mathbb N. Their canonical witnesses rq=qr_q=q are globally private, since no other member of PQP_Q divides qq. In particular all their full first-kill cells are nonempty.

Nevertheless the left side of (5) is at most 1/(Q−1)1/(Q-1), uniformly in XX. To see this, sample nn harmonically up to XX, and then mm harmonically up to nn, as in the completion. Its guaranteed-return event is exactly (n,m)≥Q(n,m)\ge Q. For every d≥1d\ge1,

Pr⁡(d∣m ∣ n)=H⌊n/d⌋dHn≤1d,Pr⁡(d∣n)=H⌊X/d⌋dHX≤1d.\Pr(d\mid m\,\vert\,n) =\frac{H_{\lfloor n/d\rfloor}}{dH_n}\le\frac1d, \qquad \Pr(d\mid n)=\frac{H_{\lfloor X/d\rfloor}}{dH_X}\le\frac1d.

Here the first probability is conditional on the sampled integer nn. Consequently

Pr⁡((n,m)≥Q)≤∑d=Q∞Pr⁡(d∣n, d∣m)≤∑d=Q∞1d2≤1Q−1.\Pr((n,m)\ge Q) \le\sum_{d=Q}^{\infty}\Pr(d\mid n,\ d\mid m) \le\sum_{d=Q}^{\infty}\frac1{d^2}\le\frac1{Q-1}.

The deletion proportion tends to one, whereas its averaged return can therefore be as small as desired. This example does not have a small full Haar footprint, and it is not a counterexample to Problem 25. It rules out deducing the desired tail bound merely by placing a universal lower bound on this return probability, even after passing to primitive moduli or requiring private witnesses.