Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 41 — sandwiched rejecting cycle

Proved
BuchiRabinIndex.LowerBound.lemma_41

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

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

Let n≥1n\ge1n≥1, let SSS be a clique of GnG_nGn​, and take distinct x,y∈Sx,y\in Sx,y∈S. For the constructed witness cycles Cx,CyC_x,C_yCx​,Cy​, there exists a rejecting cycle DDD such that

Cy⊆D⊆Cx∪CyorCx⊆D⊆Cx∪Cy.C_y\subseteq D\subseteq C_x\cup C_y\quad\text{or}\quad C_x\subseteq D\subseteq C_x\cup C_y.Cy​⊆D⊆Cx​∪Cy​orCx​⊆D⊆Cx​∪Cy​.

Rejecting means every infinite realization of DDD spells a word outside the run-defined L(Fn)L(F_n)L(Fn​), and the conclusion also requires DDD to be a genuine cycle.

The witnesses Cx,CyC_x,C_yCx​,Cy​ are the concrete cycles of §6.3, not arbitrary accepting cycles supplied as independent parameters.

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: states q_1,...,q_n and alphabet 2^(Q×Q) → Fin n with q_i represented by i−1 and Finset transition relations; reason: this is a bijective indexing of all states and letters
  • 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
  • encoding: the unique n-full ordered tree of Definition 12 → the explicitly enumerated positive words of weight at most n−1; reason: this is the same finite tree; no size is fixed
  • encoding: sets of actual history-tree transitions → sets in the ambient carrier of history/letter/history triples, with actual successors enforced in traces and cycles; reason: nonactual triples never occur in a trace or cycle; source transition sets embed unchanged
  • encoding: the canonical histories H(T) used by the witness construction → the optional validity-checked Htree constructor, used at the specified chain and union trees; reason: the clique hypotheses ensure these trees are nonempty, ordered and have at most n nodes; Lemma 40 explicitly concludes constructor success, and no replacement history is introduced
Preamble
import Definitions.Def_BuchiRabinIndex_LowerBound_Witness

set_option autoImplicit false
Formal statement
namespace BuchiRabinIndex.LowerBound

/-- STOC 2027 submission #1731, lemma 41; statement only. -/
theorem lemma_41 (n : ℕ) (hn : 1 ≤ n) (S : Finset Node)
    (hS : S ⊆ fullTree n) (hclique : ∀ x ∈ S, ∀ y ∈ S, x ≠ y → Adj n x y)
    (x y : Node) (hx : x ∈ S) (hy : y ∈ S) (hne : x ≠ y) :
    ∃ D, RejectingCycle (fullBuchi n hn) D ∧
      ((Ccycle n hn S y ⊆ D ∧ D ⊆ Ccycle n hn S x ∪ Ccycle n hn S y) ∨
       (Ccycle n hn S x ⊆ D ∧ D ⊆ Ccycle n hn S x ∪ Ccycle n hn S y)) := 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 41, p. 28; 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