is_cyclic_code
def
A subspace C of Fin n → F over a field F is a cyclic code if for every v in C, cyclic_shift n v is in C.
Statement
def is_cyclic_code {F : Type*} [Field F] (n : ℕ) (C : Subspace F (Fin n → F)) : Prop
- Defined in
- arXiv:2610.28047 Section 2.3
- Verified
- 21 Oct 2026
- Axioms
- none listed
- Built on 1
- cyclic_shiftThe right cyclic shift operator on a vector v : Fin n → F over a type F, mapping each index i to v ((i + n - 1) % n) when n ≠ 0, and…
- Used by 2
- is_irreducible_cyclic_codeA cyclic code C of length n over a field F is irreducible if C is nonzero and every cyclic subcode C' ≤ C satisfies C' = ⊥ or C' = C.
- is_cyclic_code_botThe zero subspace of Fin n → F is a cyclic code.
Read back from the Lean
For a field $F$, a natural number $n$, and an $F$-subspace $C$ of $\mathrm{Fin}\ n \to F$, is_cyclic_code n C asserts that for every vector $v \in C$, the cyclic shift cyclic_shift n v is also in $C$.
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
/-- A subspace is a cyclic code if it is invariant under the cyclic coordinate shift. -/ def is_cyclic_code {F : Type*} [Field F] (n : ℕ) (C : Subspace F (Fin n → F)) : Prop := ∀ v ∈ C, cyclic_shift n v ∈ C