AFTD Auto-Formalizing Theoretical Domains

word_asymptotic_critical_exponent

def

The asymptotic critical exponent of an infinite word w is the real number defined as the real infimum (sInf) over all natural numbers N ≥ 1 of the real supremum (sSup) of the set of length ratios |y|/|x| in ℝ for all nonempty words x with length at least N and all factors y of w that are prefixes of finite powers of x.

Statement

noncomputable def word_asymptotic_critical_exponent {α : Type*} (w : ℕ → α) : ℝ
Defined in
arXiv:2611.13676 Sec. 1
Verified
15 Nov 2026
Axioms
none listed
Used by 2

Read back from the Lean

Given a type α and a sequence (infinite word) w : ℕ → α, word_asymptotic_critical_exponent w is the real number defined as the infimum (sInf) of the set of all r : ℝ such that there exists an integer N ≥ 1 with r equal to the supremum (sSup) of the set of all e : ℝ for which there exist lists x, y : List α and a natural number m : ℕ such that: 1. x ≠ [], 2. the length of x is at least N (N ≤ x.length), 3. y is a contiguous factor of w (there exists i : ℕ such that y equals the list [w (i), w (i + 1), …, w (i + y.length - 1)]), 4. y is a prefix of m copies of x concatenated together (y <+: (List.replicate m x).flatten), and 5. e = (y.length : ℝ) / (x.length : ℝ).

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 asymptotic critical exponent of an infinite word as a real number. -/
noncomputable def word_asymptotic_critical_exponent {α : Type*} (w : ℕ → α) : ℝ := sInf { r : ℝ | ∃ N : ℕ, 1 ≤ N ∧
    r = sSup { e : ℝ | ∃ (x y : List α) (m : ℕ), x ≠ [] ∧ N ≤ x.length ∧
      (∃ i : ℕ, y = (List.range y.length).map (fun j => w (i + j))) ∧
      y <+: (List.replicate m x).flatten ∧ e = (y.length : ℝ) / (x.length : ℝ) } }
See it in the graphDiscuss this resultChallenge it