Lemma 5.3 —
ProvedBunkbedFalse.gadget_sepIn the gadget graph , for and ,
In words: the probability that and lie in a common component which does not contain . Such a component must contain the whole path , which requires its edges to be open, and every one of the spokes at must be closed; these events have probabilities and respectively.
Formalization Note This is the partition probability for , , . Note is natural-number subtraction, which is harmless since .
import Definitions.Def_BunkbedHypergraph open Bunkbed Bunkbed.Hyper SimpleGraph Finset
namespace BunkbedFalse
/-- **Lemma 5.3** (p. 8). `ℙ_P(a ↮ v₁ ↔ vₙ) = P^{2n-1}`. -/
theorem gadget_sep (n : ℕ) (P : ℚ) (hn : 3 ≤ n) (hP0 : 0 < P) (hP1 : P < 1) :
Pa_bc (gadgetE n) (gadgetW n P) 0 1 (Fin.last n) = P ^ (2 * n - 1) := by sorry
end BunkbedFalseRead-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back — BunkbedFalse.gadget_sep
Setting and vocabulary. Fix a natural number and a rational number . The declaration concerns a fixed finite graph , the gadget, whose vertex set is . Write and for . Its edge set (gadgetE n) consists of exactly the unordered pairs
so is a fan: a path together with a hub joined to every . (Verified: , e.g. .)
Each edge carries the weight (gadgetW n P)
For a subset of open edges, the configuration weight is , and for a decidable event on subsets, . This is ordinary independent Bernoulli bond percolation on in which each spoke is open with probability and each path edge is open with probability ; no hypothesis forces these to be probabilities, and there is no internal normalisation. Reachability "" means and lie in the same connected component of the graph on whose edge set is exactly (so always holds).
The quantity Pa_bc E w a b c is, by definition, the probability of the event
Note precisely which relations occur: the asserted reachability is between the second and third arguments, and the negated one is between the first and second. The pair is not mentioned. (Logically the negation of follows by transitivity, and numerically the variant negating instead gives identical values — e.g. for , — but literally the statement negates only.)
The assertion. With the three distinguished vertices instantiated as , , , the theorem states: for every natural number and every rational such that
- ,
- ,
- ,
one has the exact closed-form identity
where the exponent is truncated natural-number subtraction.
Degenerate cases and hypothesis usage.
- The exponent's natural subtraction is safe under the stated hypotheses: forces , so no truncation occurs. Truncation happens only at , where evaluates to .
- is genuinely excluded by and the identity fails there: the vertex type collapses to a single point, so , the event becomes , which is unsatisfiable, and the left side is while the right side is . Numerically, at : .
- The hypothesis is nevertheless stronger than necessary: the identity also holds at (left right at ; here , so the asserted reachability is trivial) and at (both sides at ).
- The hypotheses and appear to be unused: both sides are polynomials in , and the identity was confirmed numerically at (both ), (both ), (both ) and (both ), i.e. outside the stated range in each direction. Note also that at or one of the two edge weights is and at the "weights" are not probabilities, but the identity is insensitive to this.
- No connectivity, distinctness, or non-degeneracy hypothesis is imposed on the three vertices beyond what implies; is connected as a graph by construction.
Numerical verification. HOLDS. A scratch file evaluated both sides for all of with and (13 combinations); the list of mismatches was empty and the conjunction of all equality tests returned true. Representative values:
| left side | |||
|---|---|---|---|
| 3 | |||
| 3 | |||
| 3 | |||
| 3 | |||
| 4 | |||
| 4 | |||
| 4 | |||
| 5 | |||
| 5 | |||
| 5 |
No counterexample was found in the range permitted by the hypotheses. The mechanism is transparent from the edge count: the event forces every one of the edges into a determined state — all path edges open (each probability ) and all spokes closed (each probability ) — giving .
For contrast, the sibling quantities at , are , , and , none of which equals .
Confirmed by the mission captain (proposal self-audit).