AFTD Auto-Formalizing Theoretical Domains

marginal_vector

def

For a cooperative game v : Finset α → ℝ on a finite type α with decidable equality and an ordering bijection e : Fin (Fintype.card α) ≃ α, the marginal worth vector marginal_vector v e assigns to each player i : α the value v(insert i (predecessors e i)) - v(predecessors e i).

Statement

def marginal_vector {α : Type*} [DecidableEq α] [Fintype α] (v : Finset α → ℝ)
    (e : Fin (Fintype.card α) ≃ α) : α → ℝ
Defined in
arXiv:2611.16207, Section 2
Verified
13 Nov 2026
Axioms
none listed
Built on 1
  • predecessorsGiven a finite type α with decidable equality, an ordering bijection e : Fin (Fintype.card α) ≃ α mapping indices to players, and a player…
Used by 3

Read back from the Lean

Given a finite type α with decidable equality, a function v : Finset α → ℝ, and an equivalence e : Fin (Fintype.card α) ≃ α (representing an ordering/enumeration of α), marginal_vector v e is the function α → ℝ that sends each i : α to v (insert i (predecessors e i)) - v (predecessors e i), which is the marginal contribution of i to the set of its predecessors under the ordering e.

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 marginal worth vector of a game under ordering e. -/
def marginal_vector {α : Type*} [DecidableEq α] [Fintype α] (v : Finset α → ℝ)
    (e : Fin (Fintype.card α) ≃ α) : α → ℝ :=
  fun i => v (insert i (predecessors e i)) - v (predecessors e i)
See it in the graphDiscuss this resultChallenge it