ccz_layer_syndrome_one_block
Sanity check: for two CCZ gates the syndrome is 1 on the first block {0, 1, 2}.
Statement
theorem ccz_layer_syndrome_one_block : ccz_layer_syndrome 2 {0, 1, 2} = 1- Source
- sanity check of the definition ccz_layer_syndrome (arXiv:2610.01024 Theorem 40 / Corollary 83 setting)
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- ccz_layer_syndromeThe syndrome of the layer of m disjoint CCZ gates on 3m qubits (blocks {3j, 3j+1, 3j+2}): 1 on each block triple and 0 on every other…
The proof, explained
The theorem asserts that the syndrome for m = 2 CCZ blocks evaluated on {0, 1, 2} equals 1 in ZMod 2. By definition, the syndrome is 1 when the input subset coincides with {3j, 3j + 1, 3j + 2} for some block index j, which holds for j = 0. The result follows by finite computational evaluation via `decide`.
ccz_layer_syndrome 2 {0, 1, 2} = 1 automation
By definition, `ccz_layer_syndrome 2 {0, 1, 2}` evaluates to 1 if there exists an index j in {0, 1} such that {0, 1, 2} equals {3j, 3j + 1, 3j + 2}, and to 0 otherwise. For j = 0, this set is exactly {0, 1, 2}. Because the domain Fin 2 is finite and equality of finite sets is decidable, `decide` verifies the existential condition by exhaustive evaluation and reduces the expression to 1.
theorem ccz_layer_syndrome_one_block : ccz_layer_syndrome 2 {0, 1, 2} = 1 := by decide
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). 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.
theorem ccz_layer_syndrome_one_block : ccz_layer_syndrome 2 {0, 1, 2} = 1 := by decide