One quasipolynomial resource envelope for every child order
ProvedLax263307Proofs.NativeRootResource.uniform_nativealgorithmscomputational-complexitygraph-theory
Fix natural structural parameters with . There are positive natural constants , chosen before all orders and precision denominators, such that for every and the child resource demand is bounded by the root envelope. If is the published integer logarithmic parameter, then
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 sorrySource