Clump labels are freely indexed at the starts of wire runs
ProvedHardyFLocal.clump_coordinate_equivalencelinear-algebramathematical-physics
The actual finset of fiducial clump labels is in bijection with independent choices of a one-qubit index at each clump start, distinguishing the two wires at a crossing. The forward bijection reads the actual decoded fiducial value at each start.
Preamble
import Mathlib import Definitions.Def_HardyFLocal_ClumpCausaloid import Theorems.Thm_HardyFLocal_eq20_two_qubit_expansion open HardyCausaloid open Classical
Formal statement
namespace HardyFLocal
open Classical in
theorem clump_coordinate_equivalence {m n : ℕ} (S : FiducialFamily)
(L : ∀ x : X m n, Ω × Ω → Label (Setting m n) (Outcome m n) x) (hL : IsFiducialLabels S L)
(O : Finset (X m n)) :
∃ e : omegaC L O ≃ ({i : O × Bool // IsClumpStart O
(if i.2 then Sum.inl i.1.val.1 else Sum.inr i.1.val.2) i.1.val} → Ω),
∀ k i, e k i = (if i.val.2 then (famPairs L O k.val i.val.1.val).1
else (famPairs L O k.val i.val.1.val).2) := by sorry
end HardyFLocalSource
Hardy, arXiv:0804.0054, section 5, clumping steps 1 and 2.