Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fact 30 — order facts

Proved
BuchiRabinIndex.LowerBound.fact_30

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

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

For positive-index words x,yx,yx,y, the relation y≺xy\prec xy≺x implies y≺prexy\prec_{\rm pre}xy≺pre​x, and xxx is the preorder-last element of C(x)C(x)C(x). Membership y∈C(x)y\in C(x)y∈C(x) implies C(y)⊆C(x)C(y)\subseteq C(x)C(y)⊆C(x), while mutual membership implies x=yx=yx=y.

Each C(x)C(x)C(x) is an ordered tree, every ordered tree containing xxx contains C(x)C(x)C(x), and C(x)∪C(y)C(x)\cup C(y)C(x)∪C(y) is an ordered tree. Also,

x≠ϵ⟹{ϵ,1}⊆C(x).x\ne\epsilon\quad\Longrightarrow\quad \{\epsilon,1\}\subseteq C(x).x=ϵ⟹{ϵ,1}⊆C(x).

Finally, the preorder-last node of any ordered tree is a leaf, and if it is not the root it is the youngest child of its parent.

All four lettered clauses are included; the root has no parent, so only the parent clause is conditional at the singleton tree.

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: the last node is the youngest child of its parent → the parent clause is conditional on the last node not being the root; reason: the root of the singleton tree has no parent
Preamble
import Definitions.Def_BuchiRabinIndex_LowerBound_Nodes

set_option autoImplicit false
Formal statement
namespace BuchiRabinIndex.LowerBound

/-- STOC 2027 submission #1731, fact 30; statement only. -/
theorem fact_30 (x y : Node) (hx : Positive x) (hy : Positive y) :
    (Prec y x → PreLt y x) ∧ Last (chain x) x ∧
    (y ∈ chain x → chain y ⊆ chain x) ∧
    (x ∈ chain y → y ∈ chain x → x = y) ∧
    Ordered (chain x) ∧
    (∀ T, Ordered T → x ∈ T → chain x ⊆ T) ∧
    Ordered (chain x ∪ chain y) ∧
    (x ≠ [] → ({[], [1]} : Finset Node) ⊆ chain x) ∧
    (∀ T z, Ordered T → Last T z → Leaf T z ∧ (z ≠ [] → Youngest T z)) := 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), Fact 30, p. 25; 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