AFTD Auto-Formalizing Theoretical Domains

chore_residual_cost

def

Given a type α with decidable equality, a cost function c : α → NNReal taking values in the non-negative reals, a natural number k : ℕ, and a bundle S : Finset α, the k-chore residual cost chore_residual_cost c k S is defined as the supremum in NNReal over all sub-bundles T in the subtype {T : Finset α // T ⊆ S ∧ T.card = min k S.card} of the remaining cost ∑ x ∈ S \ T.val, c x.

Statement

noncomputable def chore_residual_cost {α : Type*} [DecidableEq α] (c : α → NNReal) (k : ℕ) (S : Finset α) : NNReal
Defined in
arXiv:2611.07468 Def. 2.1
Verified
08 Nov 2026
Axioms
none listed
Used by 4
  • chore_residual_cost_of_card_leGiven a type α with decidable equality, a cost function c : α → NNReal, a natural number k : ℕ, and a bundle S : Finset α with S.card ≤ k,…
  • block_insertion_residual_cost_bound_of_gtGiven a type α with decidable equality, a cost function c : α → NNReal, a natural number k : ℕ with 1 ≤ k, a bundle B : Finset α with k ≤…
  • block_insertion_residual_cost_bound_of_leGiven a type α with decidable equality, a cost function c : α → NNReal, a natural number k : ℕ, a bundle B : Finset α with k ≤ B.card, and…
  • block_insertion_residual_cost_boundGiven a type α with decidable equality, a cost function c : α → NNReal, a natural number k : ℕ with 1 ≤ k, a bundle B : Finset α with k ≤…

Read back from the Lean

Given a type α with decidable equality, a cost function c : α → ℝ≥0 (or NNReal), a natural number k : ℕ, and a finite set S : Finset α, chore_residual_cost c k S is defined as the supremum (in ℝ≥0) over all subsets T ⊆ S satisfying T.card = min k S.card of the sum $\sum_{x \in S \setminus T} c(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 k-chore residual cost of a bundle S under additive cost c: the maximum cost of S after removing min(k, |S|) chores. -/
noncomputable def chore_residual_cost {α : Type*} [DecidableEq α] (c : α → NNReal) (k : ℕ) (S : Finset α) : NNReal := ⨆ T : {T : Finset α // T ⊆ S ∧ T.card = min k S.card}, ∑ x ∈ S \ T.val, c x
See it in the graphDiscuss this resultChallenge it