probability-statistics / Percolation theory; mathematical statistical mechanics

Absence of critical Bernoulli bond percolation on Zd\mathbb Z^d in every dimension d≥2d \ge 2

Claims θ(pc)=0\theta(p_c) = 0 for every d≥2d \ge 2, by proving Kozma-Nitzan Conjecture 3 and its reduction to critical percolation. The previously open dimensions 3≤d≤103 \le d \le 10 are included. The formal statement concerns vanishing at pcp_c; continuity of θ\theta on the whole interval is a classical consequence rather than the formal target. No claim is intended concerning site percolation or other lattices. A stronger claim, no infinite cluster at p_c for bond percolation on every infinite connected locally finite quasi-transitive graph with p_c < 1 (which includes Z^d for every d >= 2), appeared in OpenAI's math release on 24 September 2026 with a Lean challenge; see benjamini-schramm-criticality-bond.

78Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

probability-statisticsSep 3, 2026Significance 78/100Registry: lean verified

Absence of critical Bernoulli bond percolation on Zd\mathbb Z^d in every dimension d≥2d \ge 2

Prior state unknown→proved

Claims θ(pc)=0\theta(p_c) = 0 for every d≥2d \ge 2, by proving Kozma-Nitzan Conjecture 3 and its reduction to critical percolation. The previously open dimensions 3≤d≤103 \le d \le 10 are included. The formal statement concerns vanishing at pcp_c; continuity of θ\theta on the whole interval is a classical consequence rather than the formal target. No claim is intended concerning site percolation or other lattices. A stronger…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Claims θ(pc)=0\theta(p_c) = 0 for every d≥2d \ge 2, by proving Kozma-Nitzan Conjecture 3 and its reduction to critical percolation. The previously open dimensions 3≤d≤103 \le d \le 10 are included. The formal statement concerns vanishing at pcp_c; continuity of θ\theta on the whole interval is a classical consequence rather than the formal target. No claim is intended concerning site percolation or other lattices. A stronger claim, no infinite cluster at p_c for bond percolation on every infinite connected locally finite quasi-transitive graph with p_c < 1 (which includes Z^d for every d >= 2), appeared in OpenAI's math release on 24 September 2026 with a Lean challenge; see benjamini-schramm-criticality-bond.

Claims θ(pc)=0\theta(p_c) = 0 for every d≥2d \ge 2, by proving Kozma-Nitzan Conjecture 3 and its reduction to critical percolation. The previously open dimensions 3≤d≤103 \le d \le 10 are included. The formal statement concerns vanishing at pcp_c; continuity of θ\theta on the whole interval is a classical consequence rather than the formal target. No claim is intended concerning site percolation or other lattices. A stronger claim, no infinite cluster at p_c for bond percolation on every infinite connected locally finite quasi-transitive graph with p_c < 1 (which includes Z^d for every d >= 2), appeared in OpenAI's math release on 24 September 2026 with a Lean challenge; see benjamini-schramm-criticality-bond.

Recorded attempts

Evidence graph

Connected research record