Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hypergraph percolation, Hollom's hypergraph, and the Wierman-Ziff model

Definition
BunkbedHypergraph

by burkh4rt · Sep 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsgraph-theorypercolationprobability

This file supplies the hypergraph side of the argument: hypergraph percolation, Hollom's example, and the Wierman–Ziff model.

A hypergraph is a finite family of hyperedges, each a set of vertices. As with graphs one forms the bunkbed hypergraph over a transversal set TTT, with two levels and posts above TTT.

In the alternative bunkbed hypergraph percolation, each hyperedge eee is retained on exactly one of the two levels and deleted on the other, the choice being a fair coin, independently across hyperedges. For a hypergraph with kkk hyperedges there are therefore 2k2^k2k equally likely configurations. Two vertices are connected when a path joins them, where all vertices of a retained hyperedge are mutually connected and posts may be used freely.

Hollom's hypergraph HHH is the 333-uniform hypergraph on u1,…,u10u_1, \dots, u_{10}u1​,…,u10​ with the six hyperedges

{u2,u1,u3},{u9,u3,u6},{u7,u6,u5},{u2,u5,u4},{u7,u4,u8},{u9,u8,u10},\{u_2,u_1,u_3\},\quad \{u_9,u_3,u_6\},\quad \{u_7,u_6,u_5\},\quad \{u_2,u_5,u_4\},\quad \{u_7,u_4,u_8\},\quad \{u_9,u_8,u_{10}\},{u2​,u1​,u3​},{u9​,u3​,u6​},{u7​,u6​,u5​},{u2​,u5​,u4​},{u7​,u4​,u8​},{u9​,u8​,u10​},

with transversal set T={u2,u7,u9}T = \{u_2, u_7, u_9\}T={u2​,u7​,u9​}. Each hyperedge contains exactly one transversal vertex, which is listed first.

The Wierman–Ziff model refines hyperedge percolation. Rather than being simply present or absent, a hyperedge (a,b,c)(a,b,c)(a,b,c) takes one of five states — it connects all three vertices, exactly one of the three pairs, or none — with prescribed probabilities summing to 111, independently across hyperedges. Ordinary hypergraph percolation is the special case in which only the all-three and none states occur. This extra freedom is what lets a hyperedge be approximated by a gadget graph, which is the crux of the whole argument, since a hyperedge cannot be simulated exactly.

Formalization Note Hyperedges are ordered triples, so that the distinguished transversal vertex is the first coordinate, matching the ordering the source fixes along its path ρ\rhoρ. The five WZ states are an inductive type with a Fintype instance, and a state determines which pairs of its hyperedge's vertices are linked at a given level. Hollom's hypergraph and the alternative-model probabilities were validated by direct computation: they reproduce Palt[u1↔u10]=12/64\mathbb{P}^{\mathrm{alt}}[u_1 \leftrightarrow u_{10}] = 12/64Palt[u1​↔u10​]=12/64 and Palt[u1↔u10′]=13/64\mathbb{P}^{\mathrm{alt}}[u_1 \leftrightarrow u'_{10}] = 13/64Palt[u1​↔u10′​]=13/64, exactly the values of Lemma 3.1.

Definition code
import Definitions.Def_BunkbedPercolation

/-!
# Hypergraph percolation, Hollom's example, and the Wierman–Ziff model

Section 3 of Gladkov–Pak–Zimin, *The bunkbed conjecture is false*, PNAS 122 (2025) e2420725122.
-/

namespace Bunkbed.Hyper

open Bunkbed SimpleGraph Finset

variable {V : Type*} [Fintype V] [DecidableEq V]

/-- The underlying vertex set of an ordered hyperedge `(a,b,c)`. -/
def tripleSet (t : V × V × V) : Finset V := {t.1, t.2.1, t.2.2}

/-- All edges of the clique on `s`, placed at level `l` of the bunkbed. -/
def cliqueAt (s : Finset V) (l : Fin 2) : Finset (Sym2 (V × Fin 2)) :=
  ((s ×ˢ s).filter (fun p => p.1 ≠ p.2)).image (fun p => s((p.1, l), (p.2, l)))

/-- The vertical posts over the transversal set `T`; these are always retained. -/
def posts (T : Finset V) : Finset (Sym2 (V × Fin 2)) := T.image (fun t => s((t, 0), (t, 1)))

/-! ## Alternative bunkbed hypergraph percolation -/

/-- In the **alternative** model each hyperedge `i` is retained on exactly one of the two
levels — `σ i` — and deleted on the other. Posts over `T` are always present. -/
abbrev altBBGraph {ι : Type*} [Fintype ι] (e : ι → Finset V) (T : Finset V) (σ : ι → Fin 2) :
    SimpleGraph (V × Fin 2) :=
  ofEdges ((Finset.univ.biUnion (fun i => cliqueAt (e i) (σ i))) ∪ posts T)

/-- `ℙᵃˡᵗ[x ↔ y]`: all `2^{|ι|}` level-assignments are equally likely. -/
def altProb {ι : Type*} [Fintype ι] [DecidableEq ι] (e : ι → Finset V) (T : Finset V)
    (x y : V × Fin 2) : ℚ :=
  (∑ σ : ι → Fin 2, if (altBBGraph e T σ).Reachable x y then (1 : ℚ) else 0)
    / 2 ^ Fintype.card ι

/-! ## Hollom's 3-uniform hypergraph (Fig. 1)

Ordered as in the path `ρ` of Eq. [5], so that in each hyperedge `(a,b,c)` the first vertex
`a` is the transversal one. Vertices `uᵢ ↦ i-1`, so `u₁ = 0`, …, `u₁₀ = 9`. -/
def hollomTriple : Fin 6 → (Fin 10 × Fin 10 × Fin 10) :=
  ![(1, 0, 2), (8, 2, 5), (6, 5, 4), (1, 4, 3), (6, 3, 7), (8, 7, 9)]

/-- The six hyperedges of Hollom's hypergraph, as vertex sets. -/
def hollomE (i : Fin 6) : Finset (Fin 10) := tripleSet (hollomTriple i)

/-- Hollom's transversal set `T = {u₂, u₇, u₉}`. -/
def hollomT : Finset (Fin 10) := {1, 6, 8}

/-! ## The Wierman–Ziff five-state model -/

/-- The five states of a hyperedge `(a,b,c)` in the WZ model: which of its vertices the
hyperedge connects. -/
inductive WZ | abc | ab_c | ac_b | a_bc | a_b_c
  deriving DecidableEq, Repr

instance : Fintype WZ := ⟨{.abc, .ab_c, .ac_b, .a_bc, .a_b_c}, by intro x; cases x <;> decide⟩

/-- The pairs of vertices that state `s` links, for the hyperedge `t = (a,b,c)` at level `l`. -/
def WZ.edges (s : WZ) (t : V × V × V) (l : Fin 2) : Finset (Sym2 (V × Fin 2)) :=
  let a : V × Fin 2 := (t.1, l)
  let b : V × Fin 2 := (t.2.1, l)
  let c : V × Fin 2 := (t.2.2, l)
  match s with
  | .abc   => {s(a, b), s(b, c), s(a, c)}
  | .ab_c  => {s(a, b)}
  | .ac_b  => {s(a, c)}
  | .a_bc  => {s(b, c)}
  | .a_b_c => ∅

/-- The graph realised by a WZ configuration `ψ`, which assigns a state to each hyperedge on
each of the two levels. Posts over `T` are always present. -/
abbrev wzGraph {ι : Type*} [Fintype ι] [DecidableEq ι] (t : ι → (V × V × V)) (T : Finset V)
    (ψ : ι × Fin 2 → WZ) : SimpleGraph (V × Fin 2) :=
  ofEdges ((Finset.univ.biUnion (fun p : ι × Fin 2 => (ψ p).edges (t p.1) p.2)) ∪ posts T)

/-- `ℙʷᶻ[x ↔ y]`, where each hyperedge on each level independently takes state `s` with
probability `P s`.

⚠️ This carries **no internal normalisation**: `P` is an arbitrary `WZ → ℚ`, so the total mass
is `(∑ s, P s) ^ (2 * |ι|)`. Comparing two values of `wzProb` is only meaningful when the caller
supplies a genuine distribution, i.e. `0 ≤ P s` for every `s` and `∑ s, P s = 1`. (Contrast
`altProb`, which normalises internally and always lands in `[0,1]`.) -/
def wzProb {ι : Type*} [Fintype ι] [DecidableEq ι] (t : ι → (V × V × V)) (T : Finset V)
    (P : WZ → ℚ) (x y : V × Fin 2) : ℚ :=
  ∑ ψ : ι × Fin 2 → WZ,
    (if (wzGraph t T ψ).Reachable x y then (1 : ℚ) else 0) * ∏ p : ι × Fin 2, P (ψ p)

end Bunkbed.Hyper
Source
N. Gladkov, I. Pak, A. Zimin, "The bunkbed conjecture is false", Proc. Natl. Acad. Sci. USA 122 (2025), no. 24, e2420725122, https://doi.org/10.1073/pnas.2420725122 - Section 3 (hypergraph percolation, Hollom's example Fig. 1, Definition 3.2 of the WZ model); hyperedge ordering from Eq. [5] on p. 5.
Read-back

What the Lean code literally says, in plain math · claude-opus-5

Read-back — Bunkbed.Hyper (file building on Bunkbed)

All declarations live in namespace Bunkbed.Hyper and import the companion file Def_BunkbedPercolation.lean. Throughout, VVV is an arbitrary finite type with decidable equality, and the ambient vertex set of every graph constructed here is the two-level set V×{0,1}V \times \{0,1\}V×{0,1} (levels written ℓ∈{0,1}\ell \in \{0,1\}ℓ∈{0,1}, i.e. Fin 2). Two pieces of imported vocabulary are used constantly and are unfolded here once:

  • ofEdges(S)\mathrm{ofEdges}(S)ofEdges(S), for a finite set SSS of unordered pairs (Sym2) of vertices, is the simple graph whose adjacency is "{u,v}∈S\{u,v\} \in S{u,v}∈S and u≠vu \ne vu=v". It is Mathlib's fromEdgeSet, so any self-loop {u,u}\{u,u\}{u,u} listed in SSS is silently discarded, and the graph is automatically symmetric.
  • Reachable is ordinary graph connectivity (existence of a walk), and is reflexive: every vertex is reachable from itself, even in the empty graph.

1. tripleSet

Given an ordered triple t=(t1,t2,t3)∈V3t = (t_1, t_2, t_3) \in V^3t=(t1​,t2​,t3​)∈V3, tripleSet(t)\mathrm{tripleSet}(t)tripleSet(t) is the finite set {t1,t2,t3}⊆V\{t_1, t_2, t_3\} \subseteq V{t1​,t2​,t3​}⊆V.

This is a set literal, so duplicates collapse: the ordering of the three coordinates is discarded, and if two or three coordinates coincide the result has cardinality 222 or 111 rather than 333. Nothing in the definition requires the three coordinates to be distinct.


2. cliqueAt

For a finite set s⊆Vs \subseteq Vs⊆V and a level ℓ∈{0,1}\ell \in \{0,1\}ℓ∈{0,1},

cliqueAt(s,ℓ)  =  { {(u,ℓ),(v,ℓ)}  :  u,v∈s, u≠v },\mathrm{cliqueAt}(s,\ell) \;=\; \bigl\{\, \{(u,\ell),(v,\ell)\} \;:\; u,v \in s,\ u \ne v \,\bigr\},cliqueAt(s,ℓ)={{(u,ℓ),(v,ℓ)}:u,v∈s, u=v},

i.e. the edge set of the complete graph on the copies of sss sitting at level ℓ\ellℓ, and nothing else. Concretely it is formed by taking the ordered pairs (u,v)∈s×s(u,v) \in s \times s(u,v)∈s×s with u≠vu \ne vu=v and mapping each to the unordered pair {(u,ℓ),(v,ℓ)}\{(u,\ell),(v,\ell)\}{(u,ℓ),(v,ℓ)}; the two orderings of a pair give the same unordered pair, so the result has exactly (∣s∣2)\binom{|s|}{2}(2∣s∣​) elements.

Every edge produced has both endpoints at the same level ℓ\ellℓ: no cross-level (post-like) edge and no edge at the opposite level 1−ℓ1-\ell1−ℓ is created. Verified by computation: for a 333-element sss one gets exactly 333 edges, all at level ℓ\ellℓ; for a 444-element sss, 666 edges. Degenerate cases: if ∣s∣≤1|s| \le 1∣s∣≤1 (in particular s=∅s = \emptysets=∅) the result is the empty edge set.


3. posts

For T⊆VT \subseteq VT⊆V,

posts(T)  =  { {(x,0),(x,1)}  :  x∈T },\mathrm{posts}(T) \;=\; \bigl\{\, \{(x,0),(x,1)\} \;:\; x \in T \,\bigr\},posts(T)={{(x,0),(x,1)}:x∈T},

the set of ∣T∣|T|∣T∣ vertical "post" edges joining each vertex of TTT to its own copy on the other level. Vertices outside TTT get no post.


4. altBBGraph — the level-assignment two-level graph

Parameters: a finite index type ι\iotaι, a family e:ι→Pfin(V)e : \iota \to \mathcal{P}_{\mathrm{fin}}(V)e:ι→Pfin​(V) of finite subsets of VVV (nothing forces them to have size 333, to be distinct, or to be non-empty), a set T⊆VT \subseteq VT⊆V, and a function σ:ι→{0,1}\sigma : \iota \to \{0,1\}σ:ι→{0,1}. Then

altBBGraph(e,T,σ)  =  ofEdges( ⋃i∈ιcliqueAt(ei, σ(i)) ∪ posts(T) ).\mathrm{altBBGraph}(e,T,\sigma) \;=\; \mathrm{ofEdges}\Bigl(\ \bigcup_{i \in \iota} \mathrm{cliqueAt}\bigl(e_i,\ \sigma(i)\bigr)\ \cup\ \mathrm{posts}(T)\ \Bigr).altBBGraph(e,T,σ)=ofEdges( i∈ι⋃​cliqueAt(ei​, σ(i)) ∪ posts(T) ).

Literally: for each index iii, the vertices of eie_iei​ are made into a clique at the single level σ(i)\sigma(i)σ(i), and no edge whatsoever is contributed by eie_iei​ at the other level 1−σ(i)1 - \sigma(i)1−σ(i) — the counterpart clique is absent, not merely optional. Cliques of different indices are unioned, so indices whose sets share a vertex and are assigned the same level have their cliques merged; a shared vertex assigned to different levels contributes no connection between the two copies except through posts. The posts over TTT are present deterministically, in every configuration σ\sigmaσ, and are the only cross-level edges in the graph. This is an abbrev (reducible), so decidability instances fire through it.


5. altProb — uniform average over level assignments

For eee, TTT as above and two two-level vertices x,y∈V×{0,1}x, y \in V \times \{0,1\}x,y∈V×{0,1},

altProb(e,T,x,y)  =  ∑σ∈{0,1}ι1[ x↔y in altBBGraph(e,T,σ) ]2∣ι∣ ∈Q.\mathrm{altProb}(e,T,x,y) \;=\; \frac{\displaystyle\sum_{\sigma \in \{0,1\}^{\iota}} \mathbf{1}\bigl[\,x \leftrightarrow y \text{ in } \mathrm{altBBGraph}(e,T,\sigma)\,\bigr]}{2^{|\iota|}} \ \in \mathbb{Q}.altProb(e,T,x,y)=2∣ι∣σ∈{0,1}ι∑​1[x↔y in altBBGraph(e,T,σ)]​ ∈Q.

The sum ranges over all 2∣ι∣2^{|\iota|}2∣ι∣ functions σ:ι→{0,1}\sigma : \iota \to \{0,1\}σ:ι→{0,1} and the denominator is exactly 2#ι2^{\#\iota}2#ι, so this is the uniform (unweighted) probability that xxx and yyy are connected when each index iii is placed independently at level 000 or level 111 with probability 12\tfrac1221​. There is no free parameter ppp: the model has no edge-percolation at all; the only randomness is the choice of level per index. The quantity therefore always lies in [0,1][0,1][0,1], and equals 111 whenever x=yx = yx=y (confirmed by evaluation). If ι\iotaι is empty the denominator is 20=12^0 = 120=1 and the single graph is ofEdges(posts(T))\mathrm{ofEdges}(\mathrm{posts}(T))ofEdges(posts(T)).


6. hollomTriple, hollomE, hollomT — the concrete instance

hollomTriple:{0,…,5}→(Z/10)3\mathrm{hollomTriple} : \{0,\dots,5\} \to (\mathbb{Z}/10)^3hollomTriple:{0,…,5}→(Z/10)3 is the explicit list of ordered triples

(1,0,2),(8,2,5),(6,5,4),(1,4,3),(6,3,7),(8,7,9),(1,0,2),\quad (8,2,5),\quad (6,5,4),\quad (1,4,3),\quad (6,3,7),\quad (8,7,9),(1,0,2),(8,2,5),(6,5,4),(1,4,3),(6,3,7),(8,7,9),

on the 101010-element vertex type {0,1,…,9}\{0,1,\dots,9\}{0,1,…,9}, and hollomE(i)=tripleSet(hollomTriple(i))\mathrm{hollomE}(i) = \mathrm{tripleSet}(\mathrm{hollomTriple}(i))hollomE(i)=tripleSet(hollomTriple(i)) is the corresponding unordered 333-element set. The distinguished set is hollomT={1,6,8}\mathrm{hollomT} = \{1,6,8\}hollomT={1,6,8}.

Computed facts (all checked by evaluation):

  • Each of the six sets has cardinality exactly 333; as sets they are {0,1,2},{2,5,8},{4,5,6},{1,3,4},{3,6,7},{7,8,9}\{0,1,2\}, \{2,5,8\}, \{4,5,6\}, \{1,3,4\}, \{3,6,7\}, \{7,8,9\}{0,1,2},{2,5,8},{4,5,6},{1,3,4},{3,6,7},{7,8,9}, and all six are pairwise distinct.
  • Their union is all ten vertices {0,1,…,9}\{0,1,\dots,9\}{0,1,…,9}.
  • Each hyperedge meets hollomT\mathrm{hollomT}hollomT in exactly one vertex: e0∩T={1}e_0 \cap T = \{1\}e0​∩T={1}, e1∩T={8}e_1 \cap T = \{8\}e1​∩T={8}, e2∩T={6}e_2 \cap T = \{6\}e2​∩T={6}, e3∩T={1}e_3 \cap T = \{1\}e3​∩T={1}, e4∩T={6}e_4 \cap T = \{6\}e4​∩T={6}, e5∩T={8}e_5 \cap T = \{8\}e5​∩T={8}.
  • In every one of the six ordered triples the first coordinate (the one that WZ.edges calls aaa) is precisely the TTT-vertex, and the second and third coordinates (bbb and ccc) are never in TTT.
  • Each element of TTT lies in exactly two hyperedges (1∈e0,e31 \in e_0,e_31∈e0​,e3​; 6∈e2,e46 \in e_2,e_46∈e2​,e4​; 8∈e1,e58 \in e_1,e_58∈e1​,e5​). Vertex-degrees (number of hyperedges containing a vertex) are 222 for vertices 1,…,81,\dots,81,…,8 and 111 for vertices 000 and 999.
  • Pairwise intersections: ∣ei∩ej∣=1|e_i \cap e_j| = 1∣ei​∩ej​∣=1 for the consecutive pairs (0,1),(1,2),(2,3),(3,4),(4,5)(0,1),(1,2),(2,3),(3,4),(4,5)(0,1),(1,2),(2,3),(3,4),(4,5) (shared vertices 2,5,4,3,72,5,4,3,72,5,4,3,7 respectively) and for the pairs (0,3),(1,5),(2,4)(0,3),(1,5),(2,4)(0,3),(1,5),(2,4) (shared TTT-vertices 1,8,61,8,61,8,6); all six remaining pairs are disjoint. In particular e5∩e0=∅e_5 \cap e_0 = \emptysete5​∩e0​=∅, so the "consecutive" chain is a path of six hyperedges, not a closed cycle, with the degree-one vertices 000 and 999 at the two ends; the closure into a cycle is provided only by the three TTT-vertices.

hollomE\mathrm{hollomE}hollomE discards the ordering of each triple, so the alternative model of §4–§5 cannot see which vertex is aaa; only the model of §8–§10, which consumes hollomTriple\mathrm{hollomTriple}hollomTriple directly, can.


7. WZ and its Fintype instance

WZ is an inductive type with exactly five constructors, named abc, ab_c, ac_b, a_bc, a_b_c, with decidable equality and a printable representation. The supplied finiteness instance lists these five as the element set and proves by case analysis that every term appears. Evaluation confirms ∣WZ∣=5|\mathrm{WZ}| = 5∣WZ∣=5, so the list has no omission and no duplicate.


8. WZ.edges — the edge set a state contributes

Given a state s∈WZs \in \mathrm{WZ}s∈WZ, an ordered triple t=(t1,t2,t3)∈V3t = (t_1,t_2,t_3) \in V^3t=(t1​,t2​,t3​)∈V3 and a level ℓ\ellℓ, write a=(t1,ℓ)a = (t_1,\ell)a=(t1​,ℓ), b=(t2,ℓ)b = (t_2,\ell)b=(t2​,ℓ), c=(t3,ℓ)c = (t_3,\ell)c=(t3​,ℓ) — all three at the same level ℓ\ellℓ. Then

edges(s,t,ℓ)={{ {a,b},{b,c},{a,c} }s=abc{ {a,b} }s=ab_c{ {a,c} }s=ac_b{ {b,c} }s=a_bc∅s=a_b_c\mathrm{edges}(s,t,\ell) = \begin{cases} \{\,\{a,b\},\{b,c\},\{a,c\}\,\} & s = \texttt{abc} \\ \{\,\{a,b\}\,\} & s = \texttt{ab\_c} \\ \{\,\{a,c\}\,\} & s = \texttt{ac\_b} \\ \{\,\{b,c\}\,\} & s = \texttt{a\_bc} \\ \emptyset & s = \texttt{a\_b\_c} \end{cases}edges(s,t,ℓ)=⎩⎨⎧​{{a,b},{b,c},{a,c}}{{a,b}}{{a,c}}{{b,c}}∅​s=abcs=ab_cs=ac_bs=a_bcs=a_b_c​

Verified by evaluation on a triple of distinct vertices: abc contributes all three pairs (cardinality 333); ab_c contributes {a,b}\{a,b\}{a,b} only; ac_b contributes {a,c}\{a,c\}{a,c} only; a_bc contributes {b,c}\{b,c\}{b,c} only; a_b_c contributes nothing; and no state ever contributes an edge at the level 1−ℓ1-\ell1−ℓ. Thus, read as partitions of {a,b,c}\{a,b,c\}{a,b,c} induced by the contributed edges in isolation, the five states realise abcabcabc, ab∣cab|cab∣c, ac∣bac|bac∣b, a∣bca|bca∣bc, a∣b∣ca|b|ca∣b∣c — the five set partitions of a 333-element set, each exactly once, matching the naming convention of the companion file's Pabc,Pab∣c,Pac∣b,Pa∣bc,Pa∣b∣cP_{abc}, P_{ab|c}, P_{ac|b}, P_{a|bc}, P_{a|b|c}Pabc​,Pab∣c​,Pac∣b​,Pa∣bc​,Pa∣b∣c​.

Caveat on the general (non-hollom) case: the definition places no distinctness hypothesis on t1,t2,t3t_1,t_2,t_3t1​,t2​,t3​. If, say, t1=t2t_1 = t_2t1​=t2​, then ab_c contributes only the self-loop {a,a}\{a,a\}{a,a}, which ofEdges deletes, making ab_c behave identically to a_b_c; and abc degenerates to a 222-element edge set. Note also that the induced partition is only "as named" in isolation: once the union with other triples' edges and with the posts is taken, aaa, bbb, ccc may well end up connected through other parts of the graph even in state a_b_c.


9. wzGraph — the state-assignment two-level graph

Parameters: a finite index type ι\iotaι with decidable equality, a family of ordered triples t:ι→V3t : \iota \to V^3t:ι→V3, a set T⊆VT \subseteq VT⊆V, and an assignment ψ:ι×{0,1}→WZ\psi : \iota \times \{0,1\} \to \mathrm{WZ}ψ:ι×{0,1}→WZ. Then

wzGraph(t,T,ψ)  =  ofEdges( ⋃(i,ℓ)∈ι×{0,1}edges(ψ(i,ℓ), ti, ℓ) ∪ posts(T) ).\mathrm{wzGraph}(t,T,\psi) \;=\; \mathrm{ofEdges}\Bigl(\ \bigcup_{(i,\ell) \in \iota \times \{0,1\}} \mathrm{edges}\bigl(\psi(i,\ell),\ t_i,\ \ell\bigr)\ \cup\ \mathrm{posts}(T)\ \Bigr).wzGraph(t,T,ψ)=ofEdges( (i,ℓ)∈ι×{0,1}⋃​edges(ψ(i,ℓ), ti​, ℓ) ∪ posts(T) ).

Note the shape of the index: a state is drawn for every pair (index, level) — that is, 2∣ι∣2|\iota|2∣ι∣ states in all — so in this model each triple receives a state at level 000 and an independent state at level 111. Nothing ties the two levels of a given iii together, and nothing deletes either copy; this differs from altBBGraph, where each index lives at exactly one level. The posts over TTT are again present deterministically in every configuration and are the only cross-level edges.


10. wzProb — weighted sum over state assignments

For ttt, TTT as above, an arbitrary function P:WZ→QP : \mathrm{WZ} \to \mathbb{Q}P:WZ→Q, and x,y∈V×{0,1}x,y \in V \times \{0,1\}x,y∈V×{0,1},

wzProb(t,T,P,x,y)  =  ∑ψ:ι×{0,1}→WZ1[ x↔y in wzGraph(t,T,ψ) ]⋅∏(i,ℓ)∈ι×{0,1}P(ψ(i,ℓ)),\mathrm{wzProb}(t,T,P,x,y) \;=\; \sum_{\psi : \iota \times \{0,1\} \to \mathrm{WZ}} \mathbf{1}\bigl[\,x \leftrightarrow y \text{ in } \mathrm{wzGraph}(t,T,\psi)\,\bigr] \cdot \prod_{(i,\ell) \in \iota \times \{0,1\}} P\bigl(\psi(i,\ell)\bigr),wzProb(t,T,P,x,y)=ψ:ι×{0,1}→WZ∑​1[x↔y in wzGraph(t,T,ψ)]⋅(i,ℓ)∈ι×{0,1}∏​P(ψ(i,ℓ)),

a sum over all 52∣ι∣5^{2|\iota|}52∣ι∣ state assignments, each weighted by the product of the 2∣ι∣2|\iota|2∣ι∣ single-state weights — i.e. the states are weighted as if independent across both indices and levels.

There is no hypothesis anywhere that PPP is a probability distribution: PPP is an arbitrary rational-valued function, not required to be non-negative and not required to satisfy ∑sP(s)=1\sum_{s} P(s) = 1∑s​P(s)=1, and there is no normalising denominator. Consequently wzProb\mathrm{wzProb}wzProb need not lie in [0,1][0,1][0,1] and need not be monotone in the event. Confirmed by evaluation on a two-triple example: with P≡15P \equiv \tfrac15P≡51​ (which does sum to 111) one gets wzProb(x,x)=1\mathrm{wzProb}(x,x) = 1wzProb(x,x)=1 as expected, whereas with P≡1P \equiv 1P≡1 one gets wzProb(x,x)=625=54\mathrm{wzProb}(x,x) = 625 = 5^{4}wzProb(x,x)=625=54. The total mass of the measure is (∑sP(s))2∣ι∣\bigl(\sum_s P(s)\bigr)^{2|\iota|}(∑s​P(s))2∣ι∣, so any downstream statement comparing two wzProb values silently depends on the caller supplying a PPP with ∑sP(s)=1\sum_s P(s) = 1∑s​P(s)=1 and P≥0P \ge 0P≥0; otherwise the "probabilities" are arbitrary rationals. By contrast, altProb carries its normalisation internally and is always a genuine probability.


11. Cross-cutting remarks

  • Neither altBBGraph/altProb nor wzGraph/wzProb contains any Bernoulli edge-percolation: the imported weight, probOf, connProb, bbProb machinery of the companion file, and its retention parameter ppp, are not used by any declaration in this file. The only randomness is, respectively, the level assignment σ\sigmaσ and the state assignment ψ\psiψ.
  • In both models the posts over TTT are present with probability 111 and are the only edges joining level 000 to level 111; hence altProb\mathrm{altProb}altProb and (for a probability vector PPP) wzProb\mathrm{wzProb}wzProb are 000 between the two copies (v,0),(v,1)(v,0),(v,1)(v,0),(v,1) of any vertex vvv that is not reachable to some TTT-vertex within a level (evaluation confirms altProb((1,0),(1,1))=0\mathrm{altProb}((1,0),(1,1)) = 0altProb((1,0),(1,1))=0 in a small example where 1∉T1 \notin T1∈/T).
  • No hypothesis anywhere requires the index families eee or ttt to be injective, to have 333-element images, or to be non-degenerate; no hypothesis requires TTT to be a transversal of the family, to be non-empty, or to be disjoint from anything. All such properties hold for the concrete hollom data (as tabulated in §6) but are not part of any definition's signature.
  • hollomTriple, hollomE, hollomT are bare data declarations: they assert nothing and are consistent by construction. They become mathematically meaningful only when fed to the models above, and note that hollomE (unordered) and hollomTriple (ordered) feed different models.
Human review
  • Endorsed by Shuze Chen · Sep 11, 2026

  • Endorsed by burkh4rt · Sep 11, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me