AFTD Auto-Formalizing Theoretical Domains

local_no_swap

def

For a cooperative game v on a finite type α and an ordering bijection e : Fin (Fintype.card α) ≃ α, local_no_swap v e states that for all natural numbers k with k + 2 ≤ Fintype.card α, the marginal contribution of player e(k+1) when placed immediately after the prefix of length k is at most its marginal contribution in the original order after the prefix of length k+1: v(insert (e ⟨k+1, _⟩) (order_prefix e k)) - v(order_prefix e k) ≤ v(order_prefix e (k+2)) - v(order_prefix e (k+1)).

Statement

def local_no_swap {α : Type*} [DecidableEq α] [Fintype α]
    (v : Finset α → ℝ) (e : Fin (Fintype.card α) ≃ α) : Prop
Defined in
arXiv:2611.16207, Lemma 2
Verified
14 Nov 2026
Axioms
none listed
Built on 1
  • order_prefixGiven a finite type α with decidable equality, an ordering bijection e : Fin (Fintype.card α) ≃ α, and a natural number k, order_prefix e…
Used by 1
  • local_no_swap_of_in_coreFor any cooperative game v on a finite type α satisfying v(∅) = 0 and any ordering bijection e : Fin (Fintype.card α) ≃ α, if the marginal…

Read back from the Lean

Given a finite type α with decidable equality, a set function v : Finset α → ℝ, and a bijection (ordering) e : Fin (Fintype.card α) ≃ α, local_no_swap v e asserts that: For every natural number k such that k + 2 ≤ Fintype.card α, the difference v (insert (e ⟨k + 1, _⟩) (order_prefix e k)) - v (order_prefix e k) is less than or equal to v (order_prefix e (k + 2)) - v (order_prefix e (k + 1)).

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 local no-swap condition (1) for an ordering e in a cooperative game v. -/
def local_no_swap {α : Type*} [DecidableEq α] [Fintype α]
    (v : Finset α → ℝ) (e : Fin (Fintype.card α) ≃ α) : Prop := ∀ (k : ℕ) (hk : k + 2 ≤ Fintype.card α),
    v (insert (e ⟨k + 1, by omega⟩) (order_prefix e k)) - v (order_prefix e k) ≤
      v (order_prefix e (k + 2)) - v (order_prefix e (k + 1))
See it in the graphDiscuss this resultChallenge it