Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Actual bounded execution of the native weighted approximation command

Proved
Lax263307Proofs.NativeWeightedExecution.command_spec

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmscomputational-complexitygraph-theory

For a fixed implementation of a hereditary separator class, every member GGG, rational weight vector www and rational 0<ε<10<\varepsilon<10<ε<1 has an independent-set approximation III for which the actual weighted command terminates within its declared instruction bound:

w(I)≥(1−ε)αw(G).w(I)\ge(1-\varepsilon)\alpha_w(G).w(I)≥(1−ε)αw​(G).

The execution starts from the encoded weighted input, produces the encoded membership output, and obeys the explicit workspace and word-width bounds.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeSchemeInterfaces
Formal statement
theorem Lax263307Proofs.NativeWeightedExecution.command_spec : ∀ {C : Lax263307.GraphClasses.GraphClass} (i : Lax263307Proofs.NativeQptasImplementation.Fixed C) {n : ℕ}
  (G : SimpleGraph (Fin n)) [inst : DecidableRel G.Adj],
  G ∈ C n →
    ∀ (weights : Fin n → ℚ) (ε : ℚ),
      0 < ε →
        ε < 1 →
          ∃ (I : Finset (Fin n)) (ext : String → ℕ),
            Lax263307.WeightedIndependentSet.IsApproximation G weights ε I ∧
              Lax808846Proofs.Reasoning.Spec (2 ^ Lax263307Proofs.NativeQptasWordBounds.width i weights ε)
                (fun (σ : Lax808846Proofs.Imp.Env) =>
                  σ = Lax808846Proofs.Imp.initEnv ext (Lax263307.IndependentSetEncoding.encodeInput G weights ε))
                (Lax263307Proofs.NativeWeightedExecution.command i)
                (fun (x τ : Lax808846Proofs.Imp.Env) => τ.out = Lax263307.IndependentSetEncoding.encodeOutput I)
                (Lax263307Proofs.NativeWeightedExecution.cost i weights ε) := by sorry
Source
https://github.com/EdouardBonnet/lax-263307/blob/68b2d26aa2075e2ef80fd9d355ea748d2a818fd1/proofs/Lax263307Proofs/NativeWeightedExecution.lean, theorem command_spec; Bonnet–Chang, source PDF Section 6, pp.19–20

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