AFTD Auto-Formalizing Theoretical Domains

word_suffixes

def

The set Suf(w) of nonempty suffixes of a word w.

Statement

def word_suffixes {α : Type*} (w : List α) : Set (List α)
Defined in
arXiv:2611.15074, Section 3.2, lines 808-812
Verified
13 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

Given a type α and a list w : List α, word_suffixes w is the set of all lists u : List α such that u is a suffix of w (u <:+ w) and u is non-empty (u ≠ []).

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

/-- Nonempty suffixes of a list. -/
def word_suffixes {α : Type*} (w : List α) : Set (List α) := {u | u <:+ w ∧ u ≠ []}
See it in the graphDiscuss this resultChallenge it