Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execute a light native collection iteration

Proved
Lax263307Proofs.NativeCollectionContext.light_iteration_native

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

algorithmscomputational-complexitygraph-theory

Under the full stored collection context and the source's graph, bounded-weight, part-index, accuracy and workspace guards, suppose the current part CiC_iCi​ satisfies

∑v∈Cixv≤k4nD.\sum_{v\in C_i}x_v\le\frac{k}{4nD}.v∈Ci​∑​xv​≤4nDk​.

Two native phase transitions advance the collection index to i+1i+1i+1 with its current union unchanged and preserve the collection anchor. Their time is at most 43n+37+Tcomponent(n,h)43n+37+T_{\rm component}(n,h)43n+37+Tcomponent​(n,h). This handles a light part without a recursive child call.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeBlockInterfaces
namespace Lax263307Proofs.NativeCollectionContext
end Lax263307Proofs.NativeCollectionContext
Formal statement
theorem Lax263307Proofs.NativeCollectionContext.light_iteration_native : ∀ (n D k r fuel stride h : Nat) (cfg : Lax263307Proofs.NativeCoreMachine.Config) (G : SimpleGraph (Fin n))
  [inst : @DecidableRel (Fin n) (Fin n) (@SimpleGraph.Adj (Fin n) G)] (x : Fin n → NNRat)
  (parts : List (Finset (Fin n))) (A : Finset (Fin n)) (extent : String → Nat) (front : List Nat),
  @LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) n →
    @LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) D →
      (∀ (v : Fin n),
          Lax263307Proofs.NativeSignedArithmetic.Bounded
            (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
              (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) h)
            (@NNRat.cast Rat Rat.instNNRatCast (x v))) →
        ∀ (w : Nat),
          @LE.le Nat instLENat (Lax263307Proofs.NativeComponentDecision.wordHeight n D k h) w →
            @LE.le Nat instLENat (@List.length (Finset (Fin n)) parts)
                (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n
                  (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))) →
              ∀ (i : Nat) (hi : @LT.lt Nat instLTNat i (@List.length (Finset (Fin n)) parts)),
                @LT.lt Nat instLTNat
                    (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                      (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) i (@List.length (Finset (Fin n)) parts))
                      (@OfNat.ofNat Nat (nat_lit 12) (instOfNatNat (nat_lit 12))))
                    (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                      (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w) →
                  @LE.le Nat instLENat n (extent "subset.bits") →
                    @LE.le Nat instLENat n (extent "restrict.vertices") →
                      @LT.lt Nat instLTNat
                          (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                            (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))) n)
                          (extent "lp.word") →
                        @LE.le Nat instLENat
                            (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                              (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))) n)
                            (extent "sum.input") →
                          Not
                              (@LT.lt Rat Rat.instLT
                                (@HDiv.hDiv Rat Rat Rat (@instHDiv Rat Rat.instDiv)
                                  (@HMul.hMul Rat Rat Rat (@instHMul Rat Rat.instMul)
                                    (@HDiv.hDiv Rat Rat Rat (@instHDiv Rat Rat.instDiv)
                                      (@OfNat.ofNat Rat (nat_lit 1) (@Rat.instOfNat (nat_lit 1)))
                                      (@Nat.cast Rat Rat.instNatCast D))
                                    (@Nat.cast Rat Rat.instNatCast k))
                                  (@HMul.hMul Rat Rat Rat (@instHMul Rat Rat.instMul)
                                    (@OfNat.ofNat Rat (nat_lit 4) (@Rat.instOfNat (nat_lit 4)))
                                    (@Nat.cast Rat Rat.instNatCast n)))
                                (∑
                                  v ∈
                                    @GetElem.getElem (List (Finset (Fin n))) Nat (Finset (Fin n))
                                      (fun (as : List (Finset (Fin n))) (i : Nat) =>
                                        @LT.lt Nat instLTNat i (@List.length (Finset (Fin n)) as))
                                      (@List.instGetElemNatLtLength (Finset (Fin n))) parts i hi,
                                  @NNRat.cast Rat Rat.instNNRatCast (x v))) →
                            ∀ (U : Finset (Fin n)) (σ : Lax808846Proofs.Imp.Env),
                              @Lax263307Proofs.NativeCollectionTrace.At n
                                  (@Lax263307Proofs.NativeCollectionContext.Context n
                                    (@HPow.hPow Nat Nat Nat
                                      (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                                      (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w)
                                    D k r fuel stride G inst x parts A extent front)
                                  i U σ →
                                ∃ (τ : Lax808846Proofs.Imp.Env),
                                  And
                                    (Lax263307Proofs.NativeMachineSegment.Segment
                                      (@HPow.hPow Nat Nat Nat
                                        (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                                        (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w)
                                      (Lax263307Proofs.NativeCoreMachine.phases cfg)
                                      (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
                                      (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                                        (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                                          (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                                            (@OfNat.ofNat Nat (nat_lit 43) (instOfNatNat (nat_lit 43))) n)
                                          (@OfNat.ofNat Nat (nat_lit 37) (instOfNatNat (nat_lit 37))))
                                        (Lax263307Proofs.NativeComponentDecision.timeBound n h))
                                      σ τ)
                                    (And
                                      (@Lax263307Proofs.NativeCollectionTrace.At n
                                        (@Lax263307Proofs.NativeCollectionContext.Context n
                                          (@HPow.hPow Nat Nat Nat
                                            (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                                            (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w)
                                          D k r fuel stride G inst x parts A extent front)
                                        (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) i
                                          (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
                                        U τ)
                                      (Lax263307Proofs.NativeCollectionAnchor.Anchor σ τ)) := by sorry
Source
https://github.com/EdouardBonnet/lax-263307/blob/68b2d26aa2075e2ef80fd9d355ea748d2a818fd1/proofs/Lax263307Proofs/NativeCollectionContext.lean, theorem Lax263307Proofs.NativeCollectionContext.light_iteration, line 110

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