AFTD Auto-Formalizing Theoretical Domains

is_cyclic_code_bot

lemmaverified

The zero subspace of Fin n → F is a cyclic code.

Statement

theorem is_cyclic_code_bot {F : Type*} [Field F] (n : ℕ) : is_cyclic_code n (⊥ : Subspace F (Fin n → F))
Source
arXiv:2610.28047 Section 2.3
Verified
21 Oct 2026
Axioms
Quot.soundpropext
Built on 2
  • 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…
  • 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

For any field $F$ and any natural number $n$, the trivial (zero) subspace $\bot$ of the vector space $\mathrm{Fin}\ n \to F$ is a cyclic code under is_cyclic_code.

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 zero code is cyclic. -/
theorem is_cyclic_code_bot {F : Type*} [Field F] (n : ℕ) : is_cyclic_code n (⊥ : Subspace F (Fin n → F)) := by
  intro v hv
  rw [Submodule.mem_bot] at hv
  rw [Submodule.mem_bot]
  subst hv
  unfold cyclic_shift
  split_ifs with hn <;> rfl
See it in the graphDiscuss this resultChallenge it