Locality: dai Li Corrected Family Count lt budget div
ProvedQEC.Locality.daiLiCorrectedFamilyCount_lt_budget_divlean-qecert-4a64933quantum-computingquantum-error-correction
Arithmetic handoff for #386. Under its still-required global incidence
budget 50 * totalF <= budget, d <= budget, and the actual nonempty-bad
alternative, the corrected factor-30 subdivision count still gives the strict
rectangle budget M < budget / d. The alternative is essential because Nat
division rounds down: either no rectangle was produced, or a bad square gives
d <= 10 * totalF. For the Dai--Li application, budget is max(k, d).
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.daiLiCorrectedFamilyCount_lt_budget_div
(M totalF d budget : Nat) (hD : 0 < d) (hDLeBudget : d ≤ budget)
(hCount : M * d ≤ 30 * totalF) (hTotal : 50 * totalF ≤ budget)
(hEmptyOrBad : M = 0 ∨ d ≤ 10 * totalF) :
M < budget / d := by sorrySource