Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.1 (used in the proof of Theorem 1.3) — Deterministic extraction correctness

Open
OddPermSum.Evaluation.Supplement.lemma_6_1

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

algebracomplexity-theorylinear-algebrap2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Fix a loopless simple digraph DDD, any characteristic-two field FFF, any weight assignment β∈FE\beta\in F^Eβ∈FE, and complete vertex and arc orders. Suppose that the candidate length rrr equals the shortest even-cycle length ℓ\ellℓ and that an initial arc coefficient αe=[zr](zβeG(I+zWβ)v,u)\alpha_e=[z^r](z\beta_eG(I+zW_\beta)_{v,u})αe​=[zr](zβe​G(I+zWβ​)v,u​) is nonzero. Then the specified extraction function returns a verified simple directed cycle of length exactly ℓ\ellℓ after exactly

ℓ−1\ell-1ℓ−1

extensions following the initial arc. There is no randomness or genericity hypothesis on β\betaβ.

The assertion concerns the pure procedure of §6.1, including its actual choices and failure checks; its time-efficient implementation is the subject of the companion theorem.

Differences from the source:

  • encoding: vertices indexed by [n] and cycles up to rotation → vertices indexed by Fin n and cycles represented by their directed arc sets; reason: zero-based relabeling and rotation quotient preserve every directed cycle, including length two
  • generalization: the field F_{2^d} chosen for the graph application → every field of characteristic two; reason: the coefficient identities and deterministic extraction are field-independent and include the chosen finite fields
  • encoding: execution over R_r and a selected initial arc with nonzero coefficient → full-polynomial pure execution and existence of a nonzero initial coefficient; reason: all degree-r tests commute with truncation and a complete arc order selects a nonzero initial arc exactly when one exists
Preamble
import Definitions.Def_OddPermSum_Evaluation_Supplement_extraction

set_option autoImplicit false
Formal statement
namespace OddPermSum.Evaluation.Supplement

theorem lemma_6_1 {F : Type*} [Field F] [CharP F 2] {n : ℕ}
    (D : Digraph n) (ord : ExtractionOrders D) (β : D.Arc → F)
    (ℓ r : ℕ) (hℓ : IsShortest D ℓ) (hr : r = ℓ)
    (hα : ∃ e : D.Arc, initialCoefficient D β r e ≠ 0) :
    ∃ p, extract D ord β r = (some p,ℓ-1) ∧ ValidCycle D ℓ p := by sorry

end OddPermSum.Evaluation.Supplement
Source
Boxuan Chen, Bin Cui, Hanqing Li, Xupeng Miao, Haoze Wang, STOC 2027 submission #716 (October 2026), p. 18, Lemma 6.1

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