Twist Graph: neighbor Incidence Count univ
ProvedQEC.Coding.FiberBundle.TwistGraph.neighborIncidenceCount_univlean-qecert-4a64933quantum-computingquantum-error-correction
Every layer has exactly two directed incidences per type.
Preamble
import Definitions.Def_QEC_Coding_FiberBundle_TwistGraphLTC import Definitions.Def_QEC_Coding_FiberBundle_TwistGraphMixing set_option autoImplicit false open QEC QEC.Coding QEC.Coding.FiberBundle QEC.Coding.FiberBundle.TwistGraph open scoped BigOperators
Formal statement
theorem QEC.Coding.FiberBundle.TwistGraph.neighborIncidenceCount_univ
{r typeCount ell : Nat}
[NeZero ell]
(twistSample : RandomTwist.Sample r typeCount ell)
(u : ZMod ell) :
neighborIncidenceCount twistSample Finset.univ u =
2 * typeCount := by sorrySource