Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9 — Schewe's acceptance criterion

Proved
BuchiRabinIndex.LowerBound.lemma_9

by mikedeng1 · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

automata-theoryfinite-combinatoricsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1rabin-index

Let BBB be any nondeterministic Büchi automaton with finite nonempty state set QQQ and finite alphabet Σ\SigmaΣ, and let α:N→Σ\alpha:\mathbb N\to\Sigmaα:N→Σ. Then

α∈L(B)⟺∃ρ,τ: ρ is the infinite history trace of α, τ is eventually always stable and infinitely often accepting.\alpha\in L(B)\quad\Longleftrightarrow\quad \exists\rho,\tau:\ \rho\text{ is the infinite history trace of }\alpha,\ \tau\text{ is eventually always stable and infinitely often accepting}.α∈L(B)⟺∃ρ,τ: ρ is the infinite history trace of α, τ is eventually always stable and infinitely often accepting.

Here stability means absence from the unstable annotation at every sufficiently late transition; infinite acceptance means presence in the accepting annotation arbitrarily late.

This is Schewe’s criterion quoted as Lemma 9 in the submission. It is stated for every NBW, including empty initial or accepting sets, rather than only the full automata. Its language side is independently defined by Büchi runs.

Differences from the source:

  • encoding: nodes are finite words of positive integers → List Nat with positivity in node and tree predicates; reason: children retain the source’s indices starting at 1
  • encoding: labels are functions defined on the node set → labels extend by the empty set outside the node set, with a validity subtype; reason: the extension is unique and adds no histories or transitions
  • encoding: deterministic transitions may fail to have a successor → Option history trees, with a dying trace rejected by every condition; reason: root deletion has no history-tree successor; no sink is added
  • reading: step 4 calls nodes whose descendants are deleted accepting → only the topmost resetting nodes survive to receive accepting annotations; reason: a nested reset below one of these nodes is deleted and any old such node is unstable
Preamble
import Definitions.Def_BuchiRabinIndex_LowerBound_Rabin

set_option autoImplicit false
Formal statement
namespace BuchiRabinIndex.LowerBound

/-- STOC 2027 submission #1731, lemma 9; statement only. -/
theorem lemma_9 {Q Sigma : Type} [Fintype Q] [Nonempty Q] [Fintype Sigma]
    (B : NBW Q Sigma) (α : ℕ → Sigma) :
    α ∈ language B ↔ ∃ (ρ : ℕ → History Q) (x : Node),
      Positive x ∧ IsTrace B α ρ ∧
      (∃ N, ∀ i ≥ N, x ∉ unstable B (ρ i) (α i)) ∧
      (∀ N, ∃ i ≥ N, x ∈ acceptingNodes B (ρ i) (α i)) := by sorry

end BuchiRabinIndex.LowerBound
Source
Cong Tian, Runzhe Ma, Wensheng Wang, Zhenhua Duan, Büchi Determinization with Optimal States and Square Root Index Improvement, STOC 2027 submission #1731 (October 2026), Lemma 9, p. 9; https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/1731.pdf
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 10, 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