Locality: grid Interior edge vertex cover
ProvedQEC.Locality.gridInterior_edge_vertex_coverlean-qecert-4a64933quantum-computingquantum-error-correction
In the d >= k branch, where DL24 proves there are no bad rectangles,
the actual grid predicates form the source A/B/C partition.
Preamble
import Definitions.Def_QEC_Locality_CorrectableRegions_CorrectableRegionClosure
import Definitions.Def_QEC_Locality_OptimalTradeoff_PackingTiling
import Definitions.Def_QEC_Locality_OptimalTradeoff_RecursivePartition
set_option autoImplicit false
noncomputable section
open MeasureTheory Set Metric
open QEC QEC.Locality
open QEC Semantics Coding PauliSymplectic
open Coding.StabilizerCode
open Coding.StabilizerCode.BinaryStabilizerPresentation
universe u v
variable {ι : Type u} [Fintype ι] [DecidableEq ι]
variable {κ : Type v} [Fintype κ]
attribute [local instance] QEC.Locality.instClassicalDecidableRecursiveFormal statement
theorem QEC.Locality.gridInterior_edge_vertex_cover
(embedding : UnitSeparatedEmbedding2D ι) (w ell : ℝ)
(t : GridTranslation w) :
gridInteriorQubits embedding w ell t ∪
gridEdgeBufferQubits embedding w ell t ∪
gridVertexBufferQubits embedding w ell t = Finset.univ := by sorrySource