In nearest-neighbor Bernoulli bond percolation on , each lattice edge is independently open with probability . In Bernoulli site percolation on the same lattice, each vertex is independently open with probability . An open site path requires every vertex, including both endpoints, to be open. For either model, write for its product law. Define . The critical parameter of each model is , with the bond and site thresholds defined separately. The question is whether an infinite open cluster can exist at the critical parameter.
The preprint proves that at the bond critical parameter every open bond cluster in is almost surely finite. The preprint proves the corresponding statement for site percolation at the site critical parameter. The preprint also derives for either model, a consequence not contained in the Lean library.
The Lean library CriticalZ3 contains the critical nonpercolation theorem together with the finite connection comparisons and lattice estimates. Lean has checked every result of the Lean library, so the Lean library is the reference for the statements on these pages. Each result has the Lean library’s statement and a link to the corresponding Lean declaration. Where the preprint states a result differently, the Lean library’s statement is given with the preprint’s beside it. The preprint is a guide only, supplying the order and names of the results.
CriticalZ3 is a Lean library: 19 items, in six groups. Each has a page written by OctoInform, listed below.
No item matches.