Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 4 — τ resets X iff δ′(τ, ·) sends one of the minimal intervals [s_{i_j}, s_{i_{j−1}}] containing X to a singleton

Proved
MonoReset.IntervalBFS.minimal_interval_reduction

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

automatamonotonic-automatonp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1reset-sequencesynchronizing-word

Let (S,Σ,δ)(S, \Sigma, \delta)(S,Σ,δ) be monotonic and X={si1,si2,… }⊆SX = \{s_{i_1}, s_{i_2}, \dots\} \subseteq SX={si1​​,si2​​,…}⊆S, listed in cyclic order. The minimal intervals containing XXX are the intervals [sij,sij−1][s_{i_j}, s_{i_{j-1}}][sij​​,sij−1​​] (indices of XXX taken cyclically), i.e. the intervals with both endpoints in XXX that contain XXX. For every word τ∈Σ∗\tau \in \Sigma^*τ∈Σ∗,

∣δ(τ,X)∣=1  ⟺  ∃ I minimal interval containing X, ∃ s∈S: δ′(τ,I)=[s,s].|\delta(\tau, X)| = 1 \iff \exists\, I \text{ minimal interval containing } X,\ \exists\, s \in S:\ \delta'(\tau, I) = [s, s].∣δ(τ,X)∣=1⟺∃I minimal interval containing X, ∃s∈S: δ′(τ,I)=[s,s].

In particular the minimum length of a reset sequence of XXX equals the minimum length of a path in the interval automaton from a minimal interval containing XXX to a singleton interval, which is what the breadth-first search computes. For X=∅X = \emptysetX=∅ both sides are false.

Formalization Note States are Fin n, with sis_isi​ the element i−1i-1i−1 and the cyclic order 0→1→⋯→n−1→00 \to 1 \to \cdots \to n-1 \to 00→1→⋯→n−1→0; letters are Fin k; a word is a list read left to right. An interval [si,sj][s_i, s_j][si​,sj​] is its pair of endpoints, and ∞ is none. Monotonicity is read cyclically (see the definition item).

Differences from the source:

  • generalization: a minimum reset sequence is a minimum length path from some interval containing X to a singleton interval, and vice versa; only the minimal intervals [s_{i_j}, s_{i_{j−1}}] need be considered → for every word τ: IsResetSeq δ X τ ↔ ∃ I ∈ minIntervals X, ∃ s, dPrime δ τ (some I) = some (s, s); reason: the per-word equivalence implies the source's equality of minimum lengths (and its 'vice versa') by taking minima on both sides
  • encoding: minimal intervals [s_{i_j}, s_{i_{j−1}}] for X = {s_{i_1}, s_{i_2}, …} → minIntervals X = pairs (x, y) ∈ X × X with X ⊆ ivSet (x, y); reason: for x ∈ X the only y ∈ X with X ⊆ [x, y] is the cyclic predecessor of x in X, so the two sets coincide; for X = {x} both are {[x, x]}
  • reading: δ monotonic: δ(σ, s1), …, δ(σ, sn), after removal of adjacent duplicate states, is a subsequence of a cyclic permutation of s1, …, sn → IsMonotonic (δ a) for every letter a: n = 0, or for some start m the cyclic offsets (δ a (m + i) − δ a m) mod n are nondecreasing in i; reason: 'adjacent' is read cyclically, as 'preserves the cyclic order' requires; this reading admits more automata than the linear one (s1→s1, s2→s2, s3→s1), so the statement is the stronger one; checked equal to the cyclic de-duplication reading for every map with n ≤ 6
  • encoding: states s1, …, sn in cyclic order, letters σ1, …, σk, words in Σ∗ with δ(τ1τ2, s) = δ(τ2, δ(τ1, s)) → states Fin n with s_i = i − 1 and the cyclic order of Fin n, letters Fin k, words List (Fin k) read left to right (run = left fold); reason: relabelling; same instances
  • encoding: interval [s_i, s_j] and the symbol ∞ → endpoint pair (i, j) : Fin n × Fin n with state set ivSet (i, j); ∞ is none in Option (Fin n × Fin n); reason: same objects; the n representations of S stay distinct pairs, as in the source
Preamble
import Mathlib
import Definitions.Def_MonoReset_IntervalBFS_Model
import Definitions.Def_MonoReset_IntervalBFS_Algorithm
Formal statement
namespace MonoReset.IntervalBFS

theorem minimal_interval_reduction {n k : ℕ} (δ : Fin k → Fin n → Fin n)
    (hδ : ∀ a, IsMonotonic (δ a)) (X : Finset (Fin n)) (τ : List (Fin k)) :
    IsResetSeq δ X τ ↔ ∃ I ∈ minIntervals X, ∃ s : Fin n, dPrime δ τ (some I) = some (s, s) := by sorry

end MonoReset.IntervalBFS
Source
Eppstein, Reset Sequences for Monotonic Automata, author manuscript of 7 Feb 1990 (SIAM J. Comput. 19, doi:10.1137/0219033; PDF sha256 6d8caa76…), p. 4 (PDF 5), proof of Theorem 1 ("By lemma 5, … and vice versa. By lemma 3, … these minimal intervals can be found as [s_{i_j}, s_{i_{j−1}}].")
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me