AFTD Auto-Formalizing Theoretical Domains

is_two_thirds_convex

def

A cooperative game v : Finset α → ℝ is 2/3-convex if for every three distinct coalitions S₁, S₂, S₃, at least two of the three pairs satisfy v(Sᵢ ∪ Sⱼ) + v(Sᵢ ∩ Sⱼ) ≥ v(Sᵢ) + v(Sⱼ).

Statement

def is_two_thirds_convex {α : Type*} [DecidableEq α] (v : Finset α → ℝ) : Prop
Defined in
arXiv:2611.16207, Definition 1
Verified
13 Nov 2026
Axioms
none listed
Used by 3

Read back from the Lean

Given a type α with decidable equality and a function v : Finset α → ℝ, is_two_thirds_convex v is the proposition that for all finite subsets S₁, S₂, and S₃ of α, if S₁ ≠ S₂, S₁ ≠ S₃, and S₂ ≠ S₃, then at least one of the following three pairs of inequalities holds: 1. v (S₁ ∪ S₂) + v (S₁ ∩ S₂) ≥ v S₁ + v S₂ and v (S₁ ∪ S₃) + v (S₁ ∩ S₃) ≥ v S₁ + v S₃ 2. v (S₁ ∪ S₂) + v (S₁ ∩ S₂) ≥ v S₁ + v S₂ and v (S₂ ∪ S₃) + v (S₂ ∩ S₃) ≥ v S₂ + v S₃ 3. v (S₁ ∪ S₃) + v (S₁ ∩ S₃) ≥ v S₁ + v S₃ and v (S₂ ∪ S₃) + v (S₂ ∩ S₃) ≥ v S₂ + v S₃ (Equivalently, among the three pairs formed by S₁, S₂, and S₃, the supermodular inequality v (A ∪ B) + v (A ∩ B) ≥ v A + v B holds for at least two of the pairs.)

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

/-- A cooperative game is 2/3-convex if for every three distinct coalitions, at least two pairs satisfy the supermodular inequality. -/
def is_two_thirds_convex {α : Type*} [DecidableEq α] (v : Finset α → ℝ) : Prop :=
  ∀ S₁ S₂ S₃ : Finset α, S₁ ≠ S₂ → S₁ ≠ S₃ → S₂ ≠ S₃ →
    (v (S₁ ∪ S₂) + v (S₁ ∩ S₂) ≥ v S₁ + v S₂ ∧ v (S₁ ∪ S₃) + v (S₁ ∩ S₃) ≥ v S₁ + v S₃) ∨
    (v (S₁ ∪ S₂) + v (S₁ ∩ S₂) ≥ v S₁ + v S₂ ∧ v (S₂ ∪ S₃) + v (S₂ ∩ S₃) ≥ v S₂ + v S₃) ∨
    (v (S₁ ∪ S₃) + v (S₁ ∩ S₃) ≥ v S₁ + v S₃ ∧ v (S₂ ∪ S₃) + v (S₂ ∩ S₃) ≥ v S₂ + v S₃)
See it in the graphDiscuss this resultChallenge it