Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One quasipolynomial resource envelope for every child order

Proved
Lax263307Proofs.NativeRootResource.uniform_native

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

algorithmscomputational-complexitygraph-theory

Fix natural structural parameters a,K,ba,K,ba,K,b with K>0K>0K>0. There are positive natural constants C,dC,dC,d, chosen before all orders and precision denominators, such that for every D>0D>0D>0 and 0<m≤n0<m\le n0<m≤n the child resource demand is bounded by the root envelope. If h(n)h(n)h(n) is the published integer logarithmic parameter, then

resource⁡(a,K,b,m,D)≤2C(Dh(n))d.\operatorname{resource}(a,K,b,m,D)\le 2^{C(Dh(n))^d}.resource(a,K,b,m,D)≤2C(Dh(n))d.

This is a reusable source interface for composing the complete finite-program implementation.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeDetailedInterfaces
namespace Lax263307Proofs.NativeRootResource
end Lax263307Proofs.NativeRootResource
Formal statement
theorem Lax263307Proofs.NativeRootResource.uniform_native : ∀ (a K b : Nat),
  @LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) K →
    ∃ (C : Nat) (d : Nat),
      And (@LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) C)
        (And (@LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) d)
          (∀ (n D m : Nat),
            @LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) D →
              @LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) m →
                @LE.le Nat instLENat m n →
                  @LE.le Nat instLENat (Lax263307.ParameterResources.resource a K b m D)
                    (Lax263307Proofs.NativeRootResource.envelope C d n D))) := by sorry
Source
https://github.com/EdouardBonnet/lax-263307/blob/68b2d26aa2075e2ef80fd9d355ea748d2a818fd1/proofs/Lax263307Proofs/NativeRootResource.lean, theorem uniform (lines 21–27)

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