Coding: exists algebraic CSSMinimum Distance of exists logical
ProvedQEC.Coding.exists_algebraicCSSMinimumDistance_of_exists_logicallean-qecert-4a64933quantum-computingquantum-error-correction
Any nonempty union of the two finite CSS logical sectors has an attained algebraic minimum distance.
Preamble
import Definitions.Def_QEC_Semantics_Core_Definitions import Definitions.Def_QEC_Coding_Core_Definitions set_option autoImplicit false open QEC open QEC.Coding universe u v w x
Formal statement
theorem QEC.Coding.exists_algebraicCSSMinimumDistance_of_exists_logical
{F : Type u} {ι : Type v} [Field F] [Fintype F]
[DecidableEq F] [Fintype ι]
(xCode zCode : LinearCode F ι)
(hne : ∃ x : Word F ι,
(x ∈ zCode.dual.carrier ∧ x ∉ xCode.carrier) ∨
(x ∈ xCode.dual.carrier ∧ x ∉ zCode.carrier)) :
∃ d : Nat, AlgebraicCSSMinimumDistance xCode zCode d := by sorrySource