ccz_layer_syndrome_across_blocks
Sanity check: for two CCZ gates the syndrome vanishes on a triple meeting both blocks.
Statement
theorem ccz_layer_syndrome_across_blocks : ccz_layer_syndrome 2 {0, 1, 3} = 0- 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 syndrome of a CCZ layer with m blocks takes value 1 if the input set A is one of the disjoint triples {3j, 3j+1, 3j+2} for some j < m, and 0 otherwise. For m = 2, the valid triples are {0, 1, 2} and {3, 4, 5}. The triple {0, 1, 3} straddles both blocks and equals neither, so the existential condition is false and the syndrome evaluates to 0 by finite computation.
ccz_layer_syndrome 2 {0, 1, 3} = 0 automation
By definition, `ccz_layer_syndrome 2 A` evaluates to 1 if `A` equals the block {0, 1, 2} (when j = 0) or {3, 4, 5} (when j = 1), and 0 otherwise. Since {0, 1, 3} matches neither block, the existential condition is false. Because all sets and types involved are finite, the `decide` tactic resolves this by direct computation.
theorem ccz_layer_syndrome_across_blocks : ccz_layer_syndrome 2 {0, 1, 3} = 0 := by decide
- The proof is closed entirely by computation: `decide` unfolds the finite definitions and exhaustively checks both values of `j : Fin 2`.
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_across_blocks : ccz_layer_syndrome 2 {0, 1, 3} = 0 := by decide