word_critical_exponent
The critical exponent of an infinite word w : ℕ → α is the supremum over all nonempty words x and factors y of w that are prefixes of powers of x of the ratio |y|/|x|.
Statement
noncomputable def word_critical_exponent {α : Type*} (w : ℕ → α) : ℝ
- Defined in
- arXiv:2611.13676 Sec. 1
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Used by 3
- op_1458_asymptotic_critical_exponent_le_critical_exponentFor every infinite word w, the asymptotic critical exponent of w is at most the critical exponent of w in ℝ.
- rich_word_critical_exponentsFor any positive integer d, the set S_d of critical exponents of uniformly recurrent d-ary rich words is the collection of all real…
- op_1458_rich_repetition_threshold_le_asymptotic_of_projectionFor any integer d ≥ 2, if there exist a morphism π : Fin (2 * d - 1) → List (Fin d) and an infinite word z : ℕ → Fin d such that z is the…
Read back from the Lean
For a type α and an infinite word w : ℕ → α, word_critical_exponent w is defined as the real supremum (sSup) of the set of all e : ℝ such that there exist lists x, y : List α and a natural number m : ℕ satisfying:
1. x ≠ [] (x is non-empty);
2. there exists i : ℕ such that y is equal to (List.range y.length).map (fun j => w (i + j)) (that is, y is the contiguous factor of w of length y.length starting at position i);
3. y is a prefix of (List.replicate m x).flatten (that is, y is a prefix of the m-fold concatenation of x with itself); and
4. 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 critical exponent of an infinite word is the supremum of rational powers |y|/|x| over all factors y with period x. -/ noncomputable def word_critical_exponent {α : Type*} (w : ℕ → α) : ℝ := sSup { e : ℝ | ∃ (x y : List α) (m : ℕ), x ≠ [] ∧ (∃ i : ℕ, y = (List.range y.length).map (fun j => w (i + j))) ∧ y <+: (List.replicate m x).flatten ∧ e = (y.length : ℝ) / (x.length : ℝ) }