AFTD Auto-Formalizing Theoretical Domains

rich_word_critical_exponents

def

For any positive integer d, the set S_d of critical exponents of uniformly recurrent d-ary rich words is the collection of all real numbers E(w) where w : ℕ → Fin d is a uniformly recurrent rich word.

Statement

def rich_word_critical_exponents (d : ℕ) : Set ℝ
Defined in
arXiv:2611.13676 Sec. 8
Verified
12 Nov 2026
Axioms
none listed
Built on 3
  • is_uniformly_recurrent_wordAn infinite word w : ℕ → α is uniformly recurrent if for every finite factor u of w, there exists a bound N such that every window of…
  • is_rich_wordAn infinite word w is rich in palindromes if every complete return word to a palindromic factor of w is itself a palindrome.
  • word_critical_exponentThe critical exponent of an infinite word w : ℕ → α is the supremum over all nonempty words x and factors y of w that are prefixes of…
Used by 2

Read back from the Lean

Given d : ℕ, rich_word_critical_exponents d is the set of real numbers e : ℝ such that there exists an infinite word w : ℕ → Fin d (over an alphabet of size d) that is uniformly recurrent, rich, and has critical exponent equal to e.

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 set S_d of critical exponents of uniformly recurrent d-ary rich words. -/
def rich_word_critical_exponents (d : ℕ) : Set ℝ := { e : ℝ | ∃ w : ℕ → Fin d, is_uniformly_recurrent_word w ∧ is_rich_word w ∧ e = word_critical_exponent w }
See it in the graphDiscuss this resultChallenge it