A supercritical nonuniqueness example on a graph roughly isometric to the square lattice
An infinite graph can retain the square lattice’s large-scale geometry and still have more than one infinite open cluster at a fixed supercritical parameter. This note gives an explicit deterministic example with maximum degree four. At p = 19/20, the probability of at least two infinite clusters is greater than one third, while the critical probability is at most 9/10.
Which uniqueness claim is addressed?
Benjamini’s 2013 Problem 9.6 asks about bounded-degree graphs roughly isometric to a Euclidean lattice, but its sentence leaves the probability parameter unstated. The note addresses an explicitly declared interpretation: for every admissible graph and each fixed p with pc(G) < p ≤ 1, there is almost surely exactly one infinite open cluster.
The example refutes that interpretation. It does not determine the author’s unexpressed intent or refute the weaker possibility of uniqueness only sufficiently near one. The result is positive-probability nonuniqueness at one fixed parameter, not almost-sure multiplicity.
Read the paper
Open the original PDF · Download the PDF · Zenodo record and DOI · BibTeX
The unchanged manuscript and native record identify version 1.0.0, dated 22 October 2026.
The exact result
There is a countable, simple, undirected, connected deterministic graph G of maximum degree four, roughly isometric to the nearest-neighbor square lattice Z² with multiplicative-plus-additive constant C = 100, such that ordinary iid bond percolation satisfies
pc(G) ≤ 9/10 < 19/20,
P19/20(N∞ ≥ 2) > 2200741829/6461571200 > 1/3.
Here each actual edge is independently retained with the same probability p, and N∞ counts infinite open components. At p = 9/10, every vertex already has positive probability of belonging to an infinite open cluster. The critical probability is the infimum of parameters with positive survival probability; connectedness makes it independent of the chosen root.
The theorem gives a threshold upper bound and a nonuniqueness probability lower bound. It does not compute either exact value, prescribe an exact number of infinite clusters, or assert almost-sure multiplicity.
Two strong quadrants, bounded-length connections
Start with the nearest-neighbor square lattice. Keep edges internal to the quadrant A = {(x,y): x ≥ 1, y ≥ 1} and edges internal to its opposite quadrant B = {(x,y): x ≤ −1, y ≤ −1}. Replace every other lattice edge by a private path of exactly 100 edges, with 99 new internal vertices. There are no other edges.
Original vertices have degree four and new vertices have degree two. The subdivision length is uniformly bounded everywhere. Sending a new path vertex to a nearer original endpoint, with ties chosen consistently, gives a surjective map f with
dZ²(f(x),f(y)) ≤ dG(x,y)
≤ 100 dZ²(f(x),f(y)) + 100.
These inequalities imply the stated rough-isometry convention, including the strict 100-net condition and path midpoints. The graph keeps the lattice’s coarse geometry even though the open connections behave differently in different regions.
A retained lattice edge is open with probability p. A replaced edge connects its endpoints only when all 100 actual bonds are open, with probability p100. The coarse edge states are independent because their underlying bond sets are disjoint. This is an exact series reduction of the common-parameter iid model on G. Infinite components in the actual and coarse models correspond bijectively.
Why two infinite clusters can remain separate
An elementary dual-parity count gives survival probability at least 143/245 from the corner of either strong quadrant at p = 9/10. Survival is increasing in p, so that lower bound remains valid at 19/20.
Any connection between the quadrants produces a finite all-weak coarse path after taking its last departure from A before reaching B and removing loops. Summing over every boundary start and every path length bounds the probability of such a connection strictly below 27/107648 at p = 19/20. This argument has no finite-window cutoff or assumed uniform closed barrier.
The two quadrant-survival events and the absence of a weak connection use three disjoint families of actual bonds. Independence then gives the displayed positive lower bound for two separate infinite clusters. The argument uses neither transitivity nor a zero–one–infinity law or monotonicity of uniqueness.
The source package includes finite exact diagnostic controls. They supplement the written proof of the unbounded path sums, infinite events and all-vertex metric bounds; finite samples do not establish those universal assertions.
Scope and prior work
Bounded subdivision, series reduction, parity, path counting and product independence are established tools. The contribution is this explicit deterministic graph and quantitative proof in the stated model, with the source question’s probability interpretation declared. It makes no claim to a new general probabilistic mechanism.
Benjamini–Schramm’s older supercritical nonuniqueness example has an enhanced-tree, hyperbolic-sector setting and a site-percolation distinction. Benjamini–Kozma’s product example concerns critical nonuniqueness without the required square-lattice rough-isometry assertion.
High-density uniqueness results of Teixeira, Candellero–Teixeira and Hutchcroft–Tointon have their own geometric, uniformity, dependence and site/bond hypotheses. Their thresholds below one are not automatically the critical threshold. Hilário–Sá–Sanchis–Teixeira explicitly use power-of-p series reduction; their cited full-supercritical uniqueness statement concerns an annealed stretched-lattice law with averaged translation invariance, ergodicity and finite energy, not every deterministic angular stretching pattern. No comparison theorem is imported into this construction’s proof.
The source question and rough-isometry convention are taken from Benjamini’s author manuscript dated 30 October 2013; the published chapter has different pagination, and exact publisher-body equivalence is not asserted. Comparisons with Teixeira and Candellero–Teixeira use available precursor statements, without certifying final-journal byte equivalence. Selected comparison statements were examined, not every cited proof. Source-access and version limits remain part of the literature comparison.
No exclusive historical priority, exhaustive novelty or current worldwide openness is certified. The theorem does not address critical nonuniqueness, almost-sure multiplicity, an exact cluster count or a simultaneous-in-p law. It remains compatible with a weaker near-one uniqueness question.
Original manuscript abstract
We give an explicit deterministic graph of maximum degree four, roughly isometric to the square lattice, on which iid bond percolation has at least two infinite clusters with probability greater than one third at parameter 19/20, while its critical probability is at most 9/10. Edges internal to two opposite quadrants are retained; every other lattice edge is replaced by a path of length 100. Elementary dual parity and all-distance path bounds prove the assertions without a lattice threshold formula or a transitivity assumption. The example refutes the explicitly declared all-supercritical interpretation of Benjamini's 2013 Problem 9.6. The original question omits its probability quantifier; no unique author intent, exclusive priority, or current open status is asserted.
Background and sources
- I. Benjamini, Coarse Geometry and Randomness (2013), author manuscript dated 30 October 2013, Definition 1.25 and Problem 9.6. Published chapter.
- I. Benjamini and O. Schramm, Percolation beyond Zd, many questions and a few answers (1996). Primary PDF.
- I. Benjamini and G. Kozma, Uniqueness of percolation on products with Z (2013). Primary PDF.
- A. Teixeira, Percolation and local isoperimetric inequalities (2016). Published article.
- E. Candellero and A. Teixeira, Percolation and isoperimetry on roughly transitive graphs (2018). Published article.
- T. Hutchcroft and M. Tointon, Non-triviality of the phase transition for percolation on finite transitive graphs (2025). Published article.
- M. Hilário, M. Sá, R. Sanchis and A. Teixeira, Percolation on stretched lattices: a static renormalization approach (2026). Published article.
Original files and citation
The original files are available here and from Zenodo, in the native record’s order:
- supercritical-nonuniqueness.pdf (67,272 bytes) · Zenodo original PDF
- supercritical-nonuniqueness-source-and-verification.zip (103,935 bytes) · Zenodo original ZIP
Kriebel, Alec. A supercritical nonuniqueness example on a graph roughly isometric to the square lattice. Version 1.0.0, 22 October 2026. doi:10.5281/zenodo.23573603. Download BibTeX.
The authored paper, mathematical prose, metadata and source text use CC BY 4.0. Authored code is separately MIT licensed. Third-party works retain their original rights; the archive is not assigned one blanket license.
Status and collaboration
AI tools were used extensively in planning, mathematical exploration, proof development and reconstruction, computation, literature investigation, writing, editing and adversarial checking. Alec Kriebel is the named human author and is responsible for the work. This is an unrefereed preprint without conventional independent human or journal peer review, journal acceptance or formal proof-assistant certification. Internal AI reviews do not supply those certifications.
Independent verification, substantive mathematical extensions and work toward a journal submission are welcome. Collaboration and any authorship would reflect actual scholarly contributions.