A nonzero finitely supported sequence has no nonzero period
ProvedSmooth4Algebra.finite_support_shift_rigidityLet be any type with a distinguished zero, and let have finite support and be nonzero. If an integer satisfies
then .
The result requires no order, addition, multiplication, positivity or cancellation law on the coefficient type. It records the finite-support rigidity used for Laurent dimension polynomials.
import Mathlib.Data.Finsupp.Defs import Mathlib.Data.Int.Basic set_option autoImplicit false
theorem Smooth4Algebra.finite_support_shift_rigidity
{R : Type*} [Zero R] (f : ℤ →₀ R) (hf : f ≠ 0)
(k : ℤ) (h_shift : ∀ m : ℤ, f (m + k) = f m) : k = 0 := by sorryRead-back
What the Lean code literally says, in plain math · Codex independent blind auditor; exact model identifier unavailable
For every type with a specified element , every finitely supported function that is not identically zero, and every integer , if for every integer , then . Finite support means that only finitely many integers have a value different from the specified zero, and no addition, multiplication, or other algebraic structure on is assumed. Both positive and negative candidate shifts are included, as is the zero shift. If every element of equals its specified zero, the nonzero-function hypothesis cannot be satisfied.
Confirmed by the mission captain (proposal self-audit).