Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Preimage test, p. 3 (corrected: the preimage interval exists for s in the image) — the preimage-interval table evaluates δ′(σ, ·) exactly

Proved
MonoReset.IntervalBFS.preimage_test

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

automatamonotonic-automatonp2o-batch-pfp2ap2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-v1reset-sequencerunning-timesynchronizing-word

Let (S,Σ,δ)(S, \Sigma, \delta)(S,Σ,δ) be monotonic and σ∈Σ\sigma \in \Sigmaσ∈Σ. Then:

  1. for every state sss in the image of δ(σ,⋅)\delta(\sigma, \cdot)δ(σ,⋅), the preimage δ−1(σ,s)\delta^{-1}(\sigma, s)δ−1(σ,s) is an interval, so the preimage table stores an interval for sss;
  2. if σ\sigmaσ maps both endpoints of an interval III to the same state sss, then
δ′(σ,I)≠∞  ⟺  I⊆δ−1(σ,s)(as sets of states);\delta'(\sigma, I) \ne \infty \iff I \subseteq \delta^{-1}(\sigma, s) \quad\text{(as sets of states)};δ′(σ,I)=∞⟺I⊆δ−1(σ,s)(as sets of states);
  1. the table-based evaluation of the algorithm (compare the endpoint images; if they coincide at sss, look up the stored interval PPP for δ−1(σ,s)\delta^{-1}(\sigma, s)δ−1(σ,s) and answer [s,s][s, s][s,s] exactly when PPP represents SSS or I≺PI \prec PI≺P) agrees with δ′(σ,⋅)\delta'(\sigma, \cdot)δ′(σ,⋅) on every state of S′S'S′, ∞\infty∞ included.

Clause 3 is the paper's claim that the set containment in clause 2 "can be calculated using a constant number of comparisons between interval endpoints to determine interval containment, together with a test for the special case that δ−1(σ,s)=S\delta^{-1}(\sigma, s) = Sδ−1(σ,s)=S". It is what lets the breadth-first search evaluate each transition in constant time.

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:

  • correction: for each σ ∈ Σ and s ∈ S the interval δ−1(σ, s) must exist by Lemma 1 → preimTable δ a s ≠ none for every s in the image of δ a; reason: the preimage of a state outside the image is empty, not an interval (n = 2, δ(σ, ·) ≡ s1, s = s2); the table is only consulted at s = δ(σ, s_i), which lies in the image
  • reading: the containment can be calculated using a constant number of endpoint comparisons together with a test for δ−1(σ, s) = S → dPrimeFast δ a = dPrime1 δ a, where dPrimeFast uses only the endpoint images, one table entry, the test (P.2 − P.1) mod n = n − 1 and the comparison I ≺ P; reason: the computational claim is stated as the equality of the constant-step evaluation with δ′; its unit charges are counted in the goal's bfsCost
  • encoding: this construction takes time O(n) per interval, O(kn^2) in total → charged k·n·n units in bfsCost (definition item), bounded in the goal's cost clause; reason: no machine model is formalized; the time claim is the source's own unit count
  • 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 preimage_test {n k : ℕ} (δ : Fin k → Fin n → Fin n) (hδ : ∀ a, IsMonotonic (δ a))
    (a : Fin k) :
    (∀ s : Fin n, (∃ x, δ a x = s) → preimTable δ a s ≠ none) ∧
    (∀ I : Fin n × Fin n, δ a I.1 = δ a I.2 →
        (dPrime1 δ a (some I) ≠ none ↔
          ivSet I ⊆ Finset.univ.filter (fun x => δ a x = δ a I.1))) ∧
    dPrimeFast δ a = dPrime1 δ a := 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), unnumbered (construction of δ′ from the preimage intervals δ−1(σ, s))
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