AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.IsFeasible

defimported Lean

Feasibility for a probabilistic single-item auction: * each winning probability lies in [0,1] * the total allocation probability is at most 1

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open BayesianSingleItemAuction in
open MeasureTheory in
variable {I : Type*} in
def BayesianSingleItemAuction.IsFeasible [Fintype I] (A : BayesianSingleItemAuction I) : Prop
Defined in
EconCSLib, `BayesianSingleItemAuction.IsFeasible`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. 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 7
Used by 26

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open BayesianSingleItemAuction in
open MeasureTheory in
variable {I : Type*} in
/-- Feasibility for a probabilistic single-item auction: * each winning probability lies in `[0,1]` * the total allocation probability is at most `1` -/
def BayesianSingleItemAuction.IsFeasible [Fintype I] (A : BayesianSingleItemAuction I) : Prop :=
  A.IsAllocFeasible ∧ A.RespectsSingleItemCapacity
See it in the graphDiscuss this resultChallenge it