AFTD Auto-Formalizing Theoretical Domains

CostM.IsPolyBounded

defimported Lean

Specialization of Bounded for C = ℕ: cost is polynomial in input size.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
variable {C : Type*} {A B : Type u} in
def CostM.IsPolyBounded {Input Output : Type*}
    (alg : Input → CostM ℕ Output) (size : Input → ℕ) : Prop
Defined in
EconCSLib, `CostM.IsPolyBounded`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2025 Sorrachai Yingchareonthawornhcai. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 31

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
variable {C : Type*} {A B : Type u} in
/-- Specialization of `Bounded` for `C = ℕ`: cost is polynomial in input size. -/
def CostM.IsPolyBounded {Input Output : Type*}
    (alg : Input → CostM ℕ Output) (size : Input → ℕ) : Prop :=
  ∃ c k, Bounded alg size (fun n => c * n^k)
See it in the graphDiscuss this resultChallenge it