Locality: dai Li Greedy Atomic Subdivision join
ProvedQEC.Locality.daiLiGreedyAtomicSubdivision_joinlean-qecert-4a64933quantum-computingquantum-error-correction
The concrete greedy subdivision covers its atoms in their original order.
Preamble
import Definitions.Def_QEC_Locality_OptimalTradeoff_RecursivePartition
import Definitions.Def_QEC_Locality_OptimalTradeoff_BadSquareSubdivision
set_option autoImplicit false
noncomputable section
open QEC QEC.Locality
open QEC Semantics Coding PauliSymplectic
open Coding.StabilizerCode
open Coding.StabilizerCode.BinaryStabilizerPresentation
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
variable {κ : Type*} [Fintype κ]Formal statement
theorem QEC.Locality.daiLiGreedyAtomicSubdivision_join (d : Nat) (bands : List DaiLiAtomicCounter) :
(daiLiGreedyAtomicSubdivision d bands).flatten = bands := by sorrySource