AFTD Auto-Formalizing Theoretical Domains

bundle_remove_k_value

def

Given a type of goods α with decidable equality, a valuation function v : Finset α → ℝ, a natural number k : ℕ, and a bundle S : Finset α, bundle_remove_k_value v k S is defined as the indexed infimum ⨅ X : {X : Finset α // X ⊆ S ∧ X.card ≤ k}, v (S \ X.val) over the subtype of sub-bundles X : Finset α satisfying X ⊆ S and X.card ≤ k.

Statement

noncomputable def bundle_remove_k_value {α : Type*} [DecidableEq α] (v : Finset α → ℝ) (k : ℕ) (S : Finset α) : ℝ
Defined in
arXiv:2610.34625, Section 2.1
Verified
29 Oct 2026
Axioms
none listed
Used by 3
  • eefx_bundle_imp_approx_efkLet n ≥ 3 and let σ be an allocation of m goods among n agents with nonnegative additive valuations u such that every agent's bundle is…
  • is_alpha_efk_allocationAn allocation σ : Fin m → Fin n of m goods among n agents is α-EFk under valuations v : Fin n → Finset (Fin m) → ℝ if for all distinct…
  • bundle_remove_k_value_leGiven a type of goods α with decidable equality, a valuation function v : Finset α → ℝ, a natural number k : ℕ, a bundle S : Finset α, and…

Read back from the Lean

Given a type α with decidable equality, a function v : Finset α → ℝ, a natural number k : ℕ, and a finite subset S : Finset α, bundle_remove_k_value v k S is the real number defined as the infimum (indexed over all X : Finset α such that X ⊆ S and X.card ≤ k) of v (S \ X).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The value of a bundle S after removing the k most valuable goods under valuation v, defined as the infimum of v(S \ X) over sub-bundles X ⊆ S with |X| ≤ k. -/
noncomputable def bundle_remove_k_value {α : Type*} [DecidableEq α] (v : Finset α → ℝ) (k : ℕ) (S : Finset α) : ℝ :=
  ⨅ X : {X : Finset α // X ⊆ S ∧ X.card ≤ k}, v (S \ X.val)
See it in the graphDiscuss this resultChallenge it