Wiki
Wiki

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

Updated


Statement

Setting (pp. 276--277). The random model declares each Gaussian integer zz with ∣z∣>2|z|>2 open, independently, with probability 2/(πlog⁡∣z∣)2/(\pi\log|z|): for distinct Gaussian integers z1,…,zn,z1′,…,zm′z_1,\ldots,z_n,z'_1,\ldots,z'_m of modulus above 22, the probability that all zjz_j are open and all zk′z'_k closed is

∏j=1n2πlog⁡∣zj∣ ∏k=1m(1−2πlog⁡∣zk′∣).\prod_{j=1}^{n}\frac{2}{\pi\log|z_j|}\ \prod_{k=1}^{m} \Bigl(1-\frac{2}{\pi\log|z'_k|}\Bigr).

Section 4 (p. 281) restates the model with ∣z∣>1|z|>1 in place of ∣z∣>2|z|>2. The constant λc\lambda_c (p. 276) is the critical intensity of the Poisson blob model of continuum percolation: a Poisson process of intensity λ\lambda in the plane, a disk of radius one about each point, and an unbounded connected set of disks with probability one for λ>λc\lambda>\lambda_c and probability zero for λ<λc\lambda<\lambda_c (Zuev and Sidorenko, 1985). The paper reports that λc\lambda_c is believed to be about 0.350.35 (p. 276) and that the best proved bounds are 0.174<λc<0.8430.174<\lambda_c<0.843 (Hall, 1985; p. 281).

Theorem 1.1 (p. 277, quoted). "Consider the Gaussian integers with the above probability model and consider walks of step size at most klog⁡∣z∣k\sqrt{\log|z|} at zz, where kk is a constant. Then for k<2πλck<\sqrt{2\pi\lambda_c}, with probability one, there is no unbounded open component, and for k>2πλck>\sqrt{2\pi\lambda_c}, with probability one, there is an unbounded open component."

The step bound grows with the modulus of the point; the theorem says nothing at k=2πλck=\sqrt{2\pi\lambda_c}, and it is a statement about the random model, not about the Gaussian primes. Its transfer to the Gaussian primes is Conjecture 1.3.

Source. Ilan Vardi, Prime percolation, Experimental Mathematics 7 (1998), no. 3, 275--289, doi:10.1080/10586458.1998.10504373: the model and Theorem 1.1 on pp. 276--277, the proof in Section 5, pp. 282--283. The edition read is identified on the source card.

Read depth. Claims checked: the model and the statement were read clause by clause on the printed pages. The proof was read for its structure only; no step was checked. Nothing here is independently reviewed.

Proof pointer

Section 5 (pp. 282--283). The map fs(z)=z/(slog⁡∣z∣)f_s(z)=z/(s\sqrt{\log|z|}) carries the open points of the model approximately to a Poisson process of intensity λ=2s2/π\lambda=2s^2/\pi, and a disk of radius slog⁡∣z∣s\sqrt{\log|z|} about zz to a disk of radius about one, so the critical value is sc=πλc/2s_c=\sqrt{\pi\lambda_c/2}; a walk of step klog⁡∣z∣k\sqrt{\log|z|} corresponds to overlapping disks of radius k/2k/2, giving k=2sc=2πλck=2s_c=\sqrt{2\pi\lambda_c}. Part (a) treats s>πλc/2s>\sqrt{\pi\lambda_c/2} by carrying an infinite component of a Poisson blob model of intensity λ1\lambda_1, with λ>λ1>λc\lambda>\lambda_1>\lambda_c, back to the Gaussian integers; part (b) treats s<πλc/2s<\sqrt{\pi\lambda_c/2} by contradiction, comparing with the subcritical blob model of intensity 2s12/π2s_1^2/\pi for some s<s1<πλc/2s<s_1<\sqrt{\pi\lambda_c/2}.

Dependencies

The continuum percolation theorem of Zuev and Sidorenko (Teoret. Mat. Fiz. 62 (1985), 76--86), cited through Grimmett's Percolation, Section 10.5.

Bears on

  • #952: none as a proof. The theorem concerns a random model with step bounds growing like log⁡∣z∣\sqrt{\log|z|}; the paper draws from it Conjecture 1.3 (p. 277), whose first half would give the negative answer to the problem, and it establishes nothing about the Gaussian primes themselves.