Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 35 — adjacency through the decomposition

Proved
BuchiRabinIndex.LowerBound.corollary_35

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≥2n\ge2n≥2 and let x≠yx\ne yx=y be node names. For either decomposition part TiT_iTi​, if x,y∈Tix,y\in T_ix,y∈Ti​, then

x∼y in Gn⟺ϕi(x)∼ϕi(y) in Gn−1.x\sim y\text{ in }G_n\quad\Longleftrightarrow\quad \phi_i(x)\sim\phi_i(y)\text{ in }G_{n-1}.x∼y in Gn​⟺ϕi​(x)∼ϕi​(y) in Gn−1​.

For x∈T1x\in T_1x∈T1​ and y∈T2y\in T_2y∈T2​,

x∼y in Gn⟺weight⁡(x)+weight⁡(y)≤n.x\sim y\text{ in }G_n\quad\Longleftrightarrow\quad \operatorname{weight}(x)+\operatorname{weight}(y)\le n.x∼y in Gn​⟺weight(x)+weight(y)≤n.

These are equivalences in both directions, identifying adjacency within and across the two parts.

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 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
Preamble
import Definitions.Def_BuchiRabinIndex_LowerBound_Nodes

set_option autoImplicit false
Formal statement
namespace BuchiRabinIndex.LowerBound

/-- STOC 2027 submission #1731, corollary 35; statement only. -/
theorem corollary_35 (n : ℕ) (hn : 2 ≤ n) (x y : Node) (hne : x ≠ y) :
    (x ∈ part1 n → y ∈ part1 n → (Adj n x y ↔ Adj (n - 1) (phi1 x) (phi1 y))) ∧
    (x ∈ part2 n → y ∈ part2 n → (Adj n x y ↔ Adj (n - 1) (phi2 x) (phi2 y))) ∧
    (x ∈ part1 n → y ∈ part2 n → (Adj n x y ↔ weight x + weight y ≤ n)) := 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), Corollary 35, p. 26; 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