not_campbell_howard_conditions_zero
The zero matrices do not satisfy the Campbell-Howard conditions because condition K3 requires an odd triple overlap of the logical rows, whereas the zero matrix has triple overlap 0.
Statement
theorem not_campbell_howard_conditions_zero (s n : ℕ) :
¬ campbell_howard_conditions (0 : Matrix (Fin 3) (Fin n) (ZMod 2)) (0 : Matrix (Fin s) (Fin n) (ZMod 2))- Source
- arXiv:2610.09341 Table 1
- Verified
- 19 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- 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…
- Used by 1
- 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…
Read back from the Lean
For all natural numbers $s$ and $n$, the zero matrix of dimension $3 \times n$ over $\mathbb{Z}/2\mathbb{Z}$ and the zero matrix of dimension $s \times n$ over $\mathbb{Z}/2\mathbb{Z}$ do not satisfy the Campbell-Howard conditions (campbell_howard_conditions).
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 proceeds by contradiction. If the zero matrices satisfied the Campbell-Howard conditions, condition K3 would require the triple overlap of the three logical rows to equal 1 in ZMod 2. However, every entry of the zero matrix is 0, making the sum evaluate to 0 and yielding the contradiction 0 = 1.
Assuming the zero matrices satisfy the Campbell-Howard conditions, condition K3 asserts that the triple overlap of the logical rows equals 1.
We assume for contradiction that the zero matrices satisfy the Campbell-Howard conditions (labeled h). From this conjunction, we extract its third conjunct (K3), which specifies that the componentwise triple product of the three logical rows sums to 1 in ZMod 2, giving ∑ j, 0 * 0 * 0 = 1.
intro h have h3 := h.2.2.1
A contradiction is reached because 0 = 1. automation
Simplification evaluates the products and the finite sum of zeros to 0 in ZMod 2, turning the equality into 0 = 1. Because 0 ≠ 1 in ZMod 2, this produces False and completes the proof.
simp at h3
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.
/-- The zero matrices do not satisfy the Campbell-Howard conditions. -/theorem not_campbell_howard_conditions_zero (s n : ℕ) : ¬ campbell_howard_conditions (0 : Matrix (Fin 3) (Fin n) (ZMod 2)) (0 : Matrix (Fin s) (Fin n) (ZMod 2)) := by intro h have h3 := h.2.2.1 simp at h3