The six-step transfer matrix for Hollom's hypergraph
ProvedBunkbedTM.transfer_evalSumming any function of the induced profile against the Wierman--Ziff weight of a level configuration collapses from configurations onto the reachable profiles.
Hollom's six hyperedges can be listed along the path of Eq. [5], , so that every intermediate path vertex lies in exactly two consecutive hyperedges. Sweeping them in that order, the only information that must be carried forward is the partition induced on the four special vertices together with the current path vertex — five slots — and a spent path vertex can be forgotten as soon as its second hyperedge has been processed. That is the transfer matrix step.
Iterating it six times from the initial state visits only distinct states, and the total weight accumulated at each of the terminal profiles is a homogeneous polynomial of degree in the four state probabilities , , , — recorded as wFinal. The hypothesis hsym is the symmetry under which the model has four rather than five parameters.
import Definitions.Def_BunkbedTransferTables open Bunkbed Bunkbed.Hyper Bunkbed.TM SimpleGraph Finset
theorem BunkbedTM.transfer_eval (P : WZ → ℚ) (hsym : P WZ.ab_c = P WZ.ac_b)
(G : St → ℚ) :
(∑ t₀ : WZ, ∑ t₁ : WZ, ∑ t₂ : WZ, ∑ t₃ : WZ, ∑ t₄ : WZ, ∑ t₅ : WZ,
(P t₀ * P t₁ * P t₂ * P t₃ * P t₄ * P t₅)
* G (step 5 t₅ (step 4 t₄ (step 3 t₃ (step 2 t₂ (step 1 t₁ (step 0 t₀ stInit)))))))
= ∑ j : Fin 47, wFinal j (P WZ.abc) (P WZ.a_b_c) (P WZ.a_bc) (P WZ.ab_c)
* G (stFinal j) := by sorry