The gadget at , satisfies Eq. [1]
ProvedBunkbedFalse.gadget_eq1_at_halfSection 4.2 of Gladkov--Pak--Zimin takes and and asserts that "the -percolation on satisfies conditions of Lemma 3.3". This theorem is that assertion.
For the gadget under -percolation, with the distinguished triple , , , the five partition probabilities satisfy all three conditions required by the robustness lemma:
- the symmetry ;
- strict positivity of the determinant, ;
- Eq. [1], namely .
Where the constant comes from. The hyperedge-simulation lemma gives, for and , the strict bound
and at , the bracket is
comfortably above . This is exactly why the source chooses : the bracket is at , so is the smallest value of that form clearing .
Positivity of the determinant is a separate matter and follows because is strictly positive, so the strict bound above already forces the determinant to exceed a positive quantity.
Mathematical role. This is the hinge between Sections 4 and 3 of the source. The robustness lemma says that any hyperedge whose partition probabilities satisfy these conditions can be substituted into Hollom's hypergraph while preserving the strict reversal of the bunkbed inequality; this theorem verifies the conditions for the concrete gadget used in Theorem 1.2. Note in particular that condition 2 is the hypothesis which this mission's statement of the robustness lemma adds to the published one, and which is genuinely necessary there; it is reassuring that the gadget actually satisfies it.
import Definitions.Def_BunkbedPercolation open Bunkbed Finset
namespace BunkbedFalse
/-- **The gadget at `P = 1/2` and `n = 1204` satisfies Eq. [1].** The three partition-probability
conditions required by the robustness lemma -- symmetry, strict positivity of the determinant, and
Eq. [1] with the constant 400 -- all hold for `G_1204` under `1/2`-percolation. -/
theorem gadget_eq1_at_half :
Pab_c (gadgetE 1204) (gadgetW 1204 (1 / 2)) 0 1 (Fin.last 1204)
= Pac_b (gadgetE 1204) (gadgetW 1204 (1 / 2)) 0 1 (Fin.last 1204)
∧ 0 < Pabc (gadgetE 1204) (gadgetW 1204 (1 / 2)) 0 1 (Fin.last 1204)
* Pa_b_c (gadgetE 1204) (gadgetW 1204 (1 / 2)) 0 1 (Fin.last 1204)
- Pab_c (gadgetE 1204) (gadgetW 1204 (1 / 2)) 0 1 (Fin.last 1204)
* Pac_b (gadgetE 1204) (gadgetW 1204 (1 / 2)) 0 1 (Fin.last 1204)
∧ 400 * Pa_bc (gadgetE 1204) (gadgetW 1204 (1 / 2)) 0 1 (Fin.last 1204)
≤ Pabc (gadgetE 1204) (gadgetW 1204 (1 / 2)) 0 1 (Fin.last 1204)
* Pa_b_c (gadgetE 1204) (gadgetW 1204 (1 / 2)) 0 1 (Fin.last 1204)
- Pab_c (gadgetE 1204) (gadgetW 1204 (1 / 2)) 0 1 (Fin.last 1204)
* Pac_b (gadgetE 1204) (gadgetW 1204 (1 / 2)) 0 1 (Fin.last 1204) := by
sorry
end BunkbedFalse