AFTD Auto-Formalizing Theoretical Domains

CostM.Bounded

defimported Lean

The cost of alg i is bounded by bound (size i) for every input i.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
variable {C : Type*} {A B : Type u} in
def CostM.Bounded {Input Output : Type*} [LE C]
    (alg : Input → CostM C Output) (size : Input → ℕ) (bound : ℕ → C) : Prop
Defined in
EconCSLib, `CostM.Bounded`
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 30
Used by 1

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
/-- The cost of `alg i` is bounded by `bound (size i)` for every input `i`. -/
def CostM.Bounded {Input Output : Type*} [LE C]
    (alg : Input → CostM C Output) (size : Input → ℕ) (bound : ℕ → C) : Prop :=
  ∀ i, (alg i).cost ≤ bound (size i)
See it in the graphDiscuss this resultChallenge it