A self-dual CSS code has equal primal and dual logical weight spectra.
ProvedToricCode.BinaryCSS.SelfDual.logicalWeights_eqaether-cataloggeometry
A self-dual CSS code has equal primal and dual logical weight spectra. Not merely equal minima: the two sets of achievable logical weights coincide.
theorem ToricCode.BinaryCSS.SelfDual.logicalWeights_eq(S : SelfDual C) :
C.dualLogicalWeights = C.logicalWeights := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Geometry/ToricCode/SelfDuality.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Geometry/ToricCode/SelfDuality.lean
import Mathlib
import Definitions.Def_Geometry_ToricCode_Dual
import Definitions.Def_Geometry_ToricCode_SelfDuality
/-!
# Abstract self-duality: when are the `X`- and `Z`-spectra equal?
`ToricCode.dualLogicalWeights_eq` proved that the primal and dual logical weight
spectra of the square-grid torus coincide, by exhibiting one explicit
quarter-turn permutation of the qubit set. This file isolates *exactly* what
that argument used, answering sub-conjecture 3 of the previous cycle's
`FUTURE_DIRECTIONS.md`.
We introduce
* `BinaryCSS V E F` — a three-term binary chain complex `𝔽₂^F → 𝔽₂^E → 𝔽₂^V`
given by two matrices with `A * B = 0`, i.e. a CSS code with qubit set `E`,
`Z`-checks `V` and `X`-checks `F`;
* `BinaryCSS.SelfDual` — the *data* of a weight-preserving self-duality: a
permutation `τ` of the qubits together with bijections `σ : F ≃ V` and
`ρ : V ≃ F` of the two check sets, satisfying the two intertwining identities
`Bᵀ(z ∘ τ) = (A z) ∘ σ` and `(B g) ∘ τ = Aᵀ (g ∘ ρ)`.
The main theorem `BinaryCSS.SelfDual.logicalWeights_eq` says that such data
forces the *full* primal and dual logical weight spectra to be equal as subsets
of `ℕ` — hence in particular `d_X = d_Z` (`SelfDual.dualDistance_eq`). No
finiteness of the field, no surface, no locality is used: the statement is pure
linear algebra over `𝔽₂` plus a bijection.
Finally `toricSelfDual` exhibits the `M × N` torus as an instance, so the
concrete result of `ToricCode.Dual` is recovered from the general principle.
-/
open Matrix
open ToricCode
open BinaryCSS
variable {V E F : Type*} [Fintype V] [Fintype E] [Fintype F] [DecidableEq E]
variable (C : BinaryCSS V E F)
open SelfDual
variable {C}Formal statement
theorem ToricCode.BinaryCSS.SelfDual.logicalWeights_eq(S : SelfDual C) :
C.dualLogicalWeights = C.logicalWeights := by sorrySource