cyclic_cubic_syndrome
deforiginal
For a natural number n and a finite subset A of Fin n, cyclic_cubic_syndrome n A returns 1 in ZMod 2 if there exists j : Fin n such that A = {j, (j.val + 1) % n, (j.val + 2) % n}, and 0 in ZMod 2 otherwise.
Statement
def cyclic_cubic_syndrome (n : ℕ) (A : Finset (Fin n)) : ZMod 2- Related work
- arXiv:2610.01024
- Verified
- 29 Oct 2026
- Axioms
- none listed
- Used by 10
- cyclic_cubic_parity_repr_pair_sumFor n ≥ 6 and any distinct pair p ≠ q, the sum ∑_j c_j * s({j, p, q}) vanishes for any affine evaluation on a parity representation.
- cyclic_cubic_min_t_count_eq_of_boundsIf there exists a parity representation of cardinality k, and all parity representations have cardinality at least k, then…
- cyclic_cubic_parity_repr_orthoEvery parity representation S of cyclic_cubic_syndrome n satisfies ∑_{y ∈ S} (∑_{j ∈ y} c_j)(∑_{k ∈ y} d_k) = 0 and ∑_{y ∈ S} ∑_{j ∈ y}…
- cyclic_cubic_t_count_fiveThere exists a finite set S : Finset (Finset (Fin 5)) such that is_parity_repr S (cyclic_cubic_syndrome 5) and S.card = 11.
- cyclic_cubic_syndrome_isolatedFor n ≥ 6 and any x : Fin n, the cyclic cubic syndrome of {j, (x-1)%n, (x+1)%n} is 0 for all j ≠ x.
- cyclic_cubic_min_t_countFor a natural number n, cyclic_cubic_min_t_count n is the infimum in ℕ of the cardinalities of all parity representations S : Finset…
- cyclic_cubic_t_count_isotropy_lower_boundFor every natural number n ≥ 6 and every finite set S : Finset (Finset (Fin n)), if is_parity_repr S (cyclic_cubic_syndrome n), then 2 * n…
- cyclic_cubic_parity_repr_eval_zeroFor n ≥ 6, any affine evaluation (∑_{j ∈ y} c_j = b) on all parities y ∈ S of a parity representation S of cyclic_cubic_syndrome n forces…
- cyclic_cubic_parity_repr_nonemptyEvery parity representation S of cyclic_cubic_syndrome n for n ≥ 6 is nonempty, because cyclic_cubic_syndrome n {0, 1, 2} = 1.
- cyclic_cubic_t_count_sixThere exists a finite set S : Finset (Finset (Fin 6)) such that is_parity_repr S (cyclic_cubic_syndrome 6) and S.card = 17.
Read back from the Lean
cyclic_cubic_syndrome n A is defined as a function that takes a natural number n and a finite set A of elements of Fin n, and returns an element of ZMod 2.
It evaluates to 1 if there exists an element j : Fin n such that A is equal to the three-element (or fewer, if n ≤ 2) set {j, (j + 1) % n, (j + 2) % n} (with the coordinates interpreted in Fin n), and evaluates to 0 otherwise.
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 syndrome of the cyclic cubic form on n qubits assigns 1 to cyclic consecutive triples {j, j+1, j+2} mod n and 0 to all other subsets. -/ def cyclic_cubic_syndrome (n : ℕ) (A : Finset (Fin n)) : ZMod 2 := if ∃ j : Fin n, have hn : 0 < n := by have := j.isLt; omega A = {j, ⟨(j.val + 1) % n, Nat.mod_lt _ hn⟩, ⟨(j.val + 2) % n, Nat.mod_lt _ hn⟩} then 1 else 0