AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.IsSingleItemAllocationRule.le_one

theoremverifiedformalizationimported Lean

A feasible single-item allocation gives each bidder probability at most 1.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
open MeasureTheory in
variable {I : Type*} in
theorem BayesianSingleItemAuction.IsSingleItemAllocationRule.le_one
    [Fintype I] [DecidableEq I] {x : (I → ℝ) → I → ℝ}
    (hx : IsSingleItemAllocationRule x) (b : I → ℝ) (i : I) :
    x b i ≤ 1
Formalizes
EconCSLib, `BayesianSingleItemAuction.IsSingleItemAllocationRule.le_one`
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
Classical.choiceQuot.soundpropext
Built on 1
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen scoped BigOperators inopen MeasureTheory invariable {I : Type*} in/-- A feasible single-item allocation gives each bidder probability at most `1`. -/theorem BayesianSingleItemAuction.IsSingleItemAllocationRule.le_one    [Fintype I] [DecidableEq I] {x : (I → ℝ) → I → ℝ}    (hx : IsSingleItemAllocationRule x) (b : I → ℝ) (i : I) :    x b i ≤ 1 := by  have hle_sum : x b i ≤ ∑ j, x b j := by    exact Finset.single_le_sum (fun j _ => hx.1 b j) (Finset.mem_univ i)  exact le_trans hle_sum (hx.2 b)
See it in the graphDiscuss this resultChallenge it