AFTD Auto-Formalizing Theoretical Domains

is_irreducible_cyclic_code

def

A 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.

Statement

def is_irreducible_cyclic_code {F : Type*} [Field F] (n : ℕ) (C : Subspace F (Fin n → F)) : Prop
Defined in
arXiv:2610.28047 Definition 2.6
Verified
21 Oct 2026
Axioms
none listed
Built on 1
  • is_cyclic_codeA 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.

Read back from the Lean

Given a field F, a natural number n, and an F-subspace C of Fin n → F, is_irreducible_cyclic_code n C asserts that: 1. C is a cyclic code of length n (is_cyclic_code n C), 2. C is non-zero (C ≠ ⊥), and 3. for every subspace C' of Fin n → F, if C' ≤ C and C' is also a cyclic code of length n, then C' = ⊥ or C' = C (i.e., C contains no non-trivial proper cyclic subcode).

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 cyclic code is irreducible if it is nonzero and contains no proper non-trivial cyclic subcodes. -/
def is_irreducible_cyclic_code {F : Type*} [Field F] (n : ℕ) (C : Subspace F (Fin n → F)) : Prop := is_cyclic_code n C ∧ C ≠ ⊥ ∧
    ∀ C' : Subspace F (Fin n → F), C' ≤ C → is_cyclic_code n C' → C' = ⊥ ∨ C' = C
See it in the graphDiscuss this resultChallenge it