Lemma 3.1 (Hollom) — vs
ProvedBunkbedFalse.hollom_alt_probsLet be Hollom's -uniform hypergraph on with six hyperedges, and let be its transversal set. Consider the alternative bunkbed hypergraph percolation, in which each hyperedge is retained on exactly one of the two levels, chosen by a fair coin. Then
In particular the bunkbed inequality fails for hypergraphs: crossing to the other level is more likely than staying. This is Hollom's refutation of the -uniform hypergraph version of the conjecture, and it is the seed of the whole construction — though it does not by itself settle the graph case, since a hyperedge cannot be simulated exactly by bond percolation.
Formalization Note There are exactly configurations, which is why both probabilities have denominator ; the source calls the computation "small enough to be checked by hand". One caveat for solvers: Mathlib's decision procedure for SimpleGraph.Reachable enumerates walks and is far too slow to close this by decide on the -vertex bunkbed. A linear-time reachability procedure, together with a proof that it agrees with Reachable, is the recommended route and is reusable elsewhere.
import Definitions.Def_BunkbedHypergraph open Bunkbed Bunkbed.Hyper SimpleGraph Finset
namespace BunkbedFalse
/-- **Lemma 3.1** (Hollom; quoted p. 2). In the alternative bunkbed hypergraph percolation on
Hollom's hypergraph, `ℙᵃˡᵗ[u₁ ↔ u₁₀] = 12/64` while `ℙᵃˡᵗ[u₁ ↔ u'₁₀] = 13/64`. -/
theorem hollom_alt_probs :
altProb hollomE hollomT ((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (0 : Fin 2)) = 12 / 64 ∧
altProb hollomE hollomT ((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (1 : Fin 2)) = 13 / 64 := by
sorry
end BunkbedFalseRead-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back — BunkbedFalse.hollom_alt_probs
What the statement asserts
The declaration is a closed (parameter-free) conjunction of two exact equalities between rational numbers. There are no binders, no hypotheses, and no typeclass assumptions: everything is a concrete numeral computation over a fixed 20-vertex model.
Both sides are rationals, so the first claim is the assertion in lowest terms; the literal 12 / 64 is genuine rational division, not truncating integer division.
Unfolding the model
The ground set. (Fin 10), thought of as . The percolation lives on the bunkbed vertex set , i.e. vertices: each has a "lower" copy and an "upper" copy .
The six index sets. The index type is Fin 6, and is obtained by forgetting the order of six ordered triples:
Each has exactly elements (no triple degenerates), and the ordering information in the triples is discarded entirely by this theorem — only the underlying -element sets are used. Every vertex lies in at least one ( and in exactly one each; in exactly two each).
The distinguished vertex set. , a -element subset of . It is exactly the set of first coordinates of the six ordered triples (), one distinguished vertex per hyperedge, but the theorem only ever uses as the flat set .
The randomness. The only random object is a level assignment
one bit per index set. There is no edge-level Bernoulli percolation here and no parameter : given , the graph on is determined, with edge set
In words: index set contributes a complete triangle on its three vertices, placed entirely on level , and contributes nothing at all on the other level. So each of the six triangles appears on exactly one of the two levels, and the two levels together always carry exactly six triangles. Additionally, three vertical posts , , are present with probability in every configuration. The construction takes these edges as an edge set of a simple graph, so loops are discarded (the filter already prevents them) and duplicate edges coalesce.
How many configurations. There are level assignments, and they are taken to be equally likely: the definition is the count of favourable divided by . Hence both claimed values are of the form (integer), and the claims are equivalent to the combinatorial counts and .
The event. "" is ordinary graph reachability (existence of a walk) in , on the full 20-vertex bunkbed.
Which pairs are compared. Both probabilities start at the same source, the lower copy of , namely . The two targets are:
- same level: — the lower copy of — claimed value ;
- opposite levels: — the upper copy of — claimed value .
So the comparison is lower--to-lower- versus lower--to-upper-.
Verification by computation
I reimplemented the model from the definitions in Python (all assignments enumerated; for each, the six triangles placed on level plus the three posts; connectivity computed twice, once by BFS and once independently by union–find, with agreeing results).
| claim | computed count / 64 | computed value | verdict |
|---|---|---|---|
| CORRECT | |||
| CORRECT |
Both claimed values are exactly right; I found no wrong value.
The two values are not equal: they differ by exactly , and the opposite-level probability is the larger of the two, strictly exceeding the same-level probability . (For the record, the favourable assignments for the same-level event, written as bit strings , are ; the for the opposite-level event are .)
Degeneracies
- Endpoints are distinct in both probabilities: and , since in . In particular neither probability is the trivial "reachable from itself" case.
- Neither endpoint lies in the distinguished set: and . So there is no post at or at , and the upper copy is not joined to by a forced edge.
- Neither probability is trivially or : both lie strictly between, at and . Neither counting numerator is or .
- The statement is not vacuous — there are no hypotheses at all, so nothing can be vacuously satisfied; it is a pure numerical identity.
- The theorem's body is
sorry, so as written it is an unproved assertion (the file admits it as an axiom-like hole rather than deriving it). - Note that the second claimed value is already in lowest terms while the first, , is not; the equality is nonetheless the correct rational statement since and denote the same rational number.
- Unused vocabulary: the theorem imports the Wierman–Ziff five-state machinery, the ordered-triple structure, and the Bernoulli/
bbProbbunkbed apparatus, but exercises none of it — only the deterministic-triangle "alternative" model with uniform measure on level assignments.
Confirmed by the mission captain (proposal self-audit).