Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 3 — if δ′(τ, I) ≠ ∞ then δ(τ, I) ⊆ δ′(τ, I)

Proved
MonoReset.IntervalBFS.lemma_2

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

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

Let (S,Σ,δ)(S, \Sigma, \delta)(S,Σ,δ) be monotonic. For every word τ∈Σ∗\tau \in \Sigma^*τ∈Σ∗ and every interval III, if δ′(τ,I)=J≠∞\delta'(\tau, I) = J \ne \inftyδ′(τ,I)=J=∞ then

δ(τ,I)={δ(τ,s):s∈I}⊆J.\delta(\tau, I) = \{\delta(\tau, s) : s \in I\} \subseteq J .δ(τ,I)={δ(τ,s):s∈I}⊆J.

So the interval automaton over-approximates the image of an interval; this is the direction of Lemma 5 that turns a path to a singleton interval into a reset sequence.

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:

  • reading: δ(τ, I) ⊂ δ′(τ, I) → (ivSet I).image (run δ τ) ⊆ ivSet J; reason: the paper writes ⊂ for ⊆ throughout (e.g. X ⊂ S for an arbitrary set of initial states, p. 1)
  • 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
Formal statement
namespace MonoReset.IntervalBFS

theorem lemma_2 {n k : ℕ} (δ : Fin k → Fin n → Fin n) (hδ : ∀ a, IsMonotonic (δ a))
    (τ : List (Fin k)) (I J : Fin n × Fin n) (hJ : dPrime δ τ (some I) = some J) :
    (ivSet I).image (run δ τ) ⊆ ivSet J := 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. 3 (PDF 4), Lemma 2
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