One quasipolynomial resource envelope for every child order
OpenLax263307Proofs.NativeRootResource.uniformalgorithmscomputational-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.
Retired because the namespace-wrapped declaration compiled during publication but the proof-comparison parser rejects that header (expected token / unknown full theorem identifier). The mathematically identical, fully qualified declaration is Lax263307Proofs.NativeRootResource.uniform_native.
Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeDetailedInterfaces
Formal statement
namespace Lax263307Proofs.NativeRootResource
theorem uniform : ∀ (a K b : Nat),
Nat.lt ((0:Nat)) K →
∃ (C : Nat) (d : Nat),
And (Nat.lt ((0:Nat)) C)
(And (Nat.lt ((0:Nat)) d)
(∀ (n D m : Nat),
Nat.lt ((0:Nat)) D →
Nat.lt ((0:Nat)) m →
Nat.le m n →
Nat.le (Lax263307.ParameterResources.resource a K b m D)
(Lax263307Proofs.NativeRootResource.envelope C d n D))) := by sorry
end Lax263307Proofs.NativeRootResource
Source