campbell_howard_conditions
The nine Campbell-Howard conditions for a logical X-matrix K of 3 rows and an X-stabilizer matrix S of s rows over ZMod 2: the logical rows have even weight (K1), even pairwise overlap (K2), and odd triple overlap (K3); logical and stabilizer rows have even pairwise overlap (KS1) and even triple overlaps (KS2, KS3); and stabilizer rows have even weight (S1), even pairwise overlap (S2), and even triple overlap (S3).
Statement
def campbell_howard_conditions {s n : ℕ} (K : Matrix (Fin 3) (Fin n) (ZMod 2)) (S : Matrix (Fin s) (Fin n) (ZMod 2)) : Prop
- Defined in
- arXiv:2610.09341 Table 1
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Used by 5
- op_159_css_ccz_no_code_s_zeroFor any block length n, no 3 by n logical X-operator matrix K and 0 by n X-stabilizer matrix S over ZMod 2 form a CSS quasi-transversal…
- css_quasi_transversal_ccz_codeA CSS quantum code of block length n specified by a 3 by n logical X-operator matrix K and an s by n X-stabilizer matrix S over ZMod 2 has…
- op_159_css_ccz_no_code_s_oneFor any block length n, no 3 by n logical X-operator matrix K and 1 by n X-stabilizer matrix S over ZMod 2 form a CSS quasi-transversal…
- not_css_quasi_transversal_ccz_code_zeroThe zero logical and stabilizer matrices over ZMod 2 do not form a CSS quasi-transversal CCZ code of any block length n and stabilizer…
- not_campbell_howard_conditions_zeroThe zero matrices do not satisfy the Campbell-Howard conditions because condition K3 requires an odd triple overlap of the logical rows,…
Read back from the Lean
The definition campbell_howard_conditions takes natural numbers $s$ and $n$ (implicitly), a $3 \times n$ matrix $K$ over $\mathbb{Z}/2\mathbb{Z}$, and an $s \times n$ matrix $S$ over $\mathbb{Z}/2\mathbb{Z}$. It defines the proposition that all of the following nine conditions hold (with all summations and arithmetic performed in $\mathbb{Z}/2\mathbb{Z}$):
1. For every row index $i \in \text{Fin } 3$, the sum of the entries in row $i$ of $K$ is $0$: $\sum_{j \in \text{Fin } n} K_{i, j} = 0$.
2. For all $i, i' \in \text{Fin } 3$ with $i < i'$, the row vectors $K_i$ and $K_{i'}$ have inner product $0$: $\sum_{j \in \text{Fin } n} K_{i, j} K_{i', j} = 0$.
3. The sum of the coordinatewise product of all three rows of $K$ is $1$: $\sum_{j \in \text{Fin } n} K_{0, j} K_{1, j} K_{2, j} = 1$.
4. For every $i \in \text{Fin } 3$ and $l \in \text{Fin } s$, the row vectors $K_i$ and $S_l$ are orthogonal: $\sum_{j \in \text{Fin } n} K_{i, j} S_{l, j} = 0$.
5. For all $i, i' \in \text{Fin } 3$ with $i < i'$ and every $l \in \text{Fin } s$, the triple product sum vanishes: $\sum_{j \in \text{Fin } n} K_{i, j} K_{i', j} S_{l, j} = 0$.
6. For every $i \in \text{Fin } 3$ and all $l, l' \in \text{Fin } s$ with $l < l'$, the triple product sum vanishes: $\sum_{j \in \text{Fin } n} K_{i, j} S_{l, j} S_{l', j} = 0$.
7. For every row index $l \in \text{Fin } s$, the sum of the entries in row $l$ of $S$ is $0$: $\sum_{j \in \text{Fin } n} S_{l, j} = 0$.
8. For all $l, l' \in \text{Fin } s$ with $l < l'$, the row vectors $S_l$ and $S_{l'}$ are orthogonal: $\sum_{j \in \text{Fin } n} S_{l, j} S_{l', j} = 0$.
9. For all $l, l', l'' \in \text{Fin } s$ with $l < l' < l''$, the triple product sum vanishes: $\sum_{j \in \text{Fin } n} S_{l, j} S_{l', j} S_{l'', j} = 0$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The nine Campbell-Howard conditions on logical and stabilizer rows for quasi-transversal CCZ on a CSS code. -/ def campbell_howard_conditions {s n : ℕ} (K : Matrix (Fin 3) (Fin n) (ZMod 2)) (S : Matrix (Fin s) (Fin n) (ZMod 2)) : Prop := (∀ i : Fin 3, ∑ j : Fin n, K i j = 0) ∧ (∀ i i' : Fin 3, i < i' → ∑ j : Fin n, K i j * K i' j = 0) ∧ ((∑ j : Fin n, K 0 j * K 1 j * K 2 j) = 1) ∧ (∀ (i : Fin 3) (l : Fin s), ∑ j : Fin n, K i j * S l j = 0) ∧ (∀ (i i' : Fin 3) (l : Fin s), i < i' → ∑ j : Fin n, K i j * K i' j * S l j = 0) ∧ (∀ (i : Fin 3) (l l' : Fin s), l < l' → ∑ j : Fin n, K i j * S l j * S l' j = 0) ∧ (∀ l : Fin s, ∑ j : Fin n, S l j = 0) ∧ (∀ l l' : Fin s, l < l' → ∑ j : Fin n, S l j * S l' j = 0) ∧ (∀ l l' l'' : Fin s, l < l' → l' < l'' → ∑ j : Fin n, S l j * S l' j * S l'' j = 0)