not_css_quasi_transversal_ccz_code_zero
The zero logical and stabilizer matrices over ZMod 2 do not form a CSS quasi-transversal CCZ code of any block length n and stabilizer rank s.
Statement
theorem not_css_quasi_transversal_ccz_code_zero (n s : ℕ) :
¬ css_quasi_transversal_ccz_code n s 0 0- Source
- arXiv:2610.09341 Table 1
- Verified
- 20 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- 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…
- 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,…
- campbell_howard_conditionsThe 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…
- css_z_distance_ge_threeA CSS quantum code specified by a k by n logical X-operator matrix K and an s by n X-stabilizer matrix S over ZMod 2 has Z-distance at…
Read back from the Lean
For all natural numbers n and s, it is not the case that the 3 × n zero matrix and the s × n zero matrix over ZMod 2 form a CSS quasi-transversal CCZ code (that is, they do not satisfy css_quasi_transversal_ccz_code n s 0 0).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The proof is by contradiction. By definition, a CSS quasi-transversal CCZ code requires its logical and stabilizer matrices to satisfy the Campbell-Howard conditions. Assuming that the zero matrices form such a code provides a proof that zero matrices satisfy these conditions, which directly contradicts not_campbell_howard_conditions_zero.
Assume for contradiction that the zero matrices form a CSS quasi-transversal CCZ code.
To prove the negated proposition, we introduce the assumption h that the zero logical matrix and zero stabilizer matrix form a CSS quasi-transversal CCZ code of block length n and stabilizer rank s, leaving False as the goal.
intro hDerive a contradiction because zero matrices cannot satisfy the Campbell-Howard conditions.
By definition, css_quasi_transversal_ccz_code is a conjunction whose second component requires the matrices to satisfy campbell_howard_conditions. The projection h.2 extracts this property for the zero matrices. Applying the lemma not_campbell_howard_conditions_zero to h.2 produces the required contradiction.
uses
not_campbell_howard_conditions_zeroexact not_campbell_howard_conditions_zero s n h.2
not_campbell_howard_conditions_zero- For any stabilizer rank s and block length n, the zero logical and stabilizer matrices cannot satisfy the Campbell-Howard conditions.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Zero matrices do not satisfy the CSS quasi-transversal CCZ conditions. -/theorem not_css_quasi_transversal_ccz_code_zero (n s : ℕ) : ¬ css_quasi_transversal_ccz_code n s 0 0 := by intro h exact not_campbell_howard_conditions_zero s n h.2