zero_is_three_distant_convex
The zero game, where every coalition has value zero, is 3-distant convex.
Statement
theorem zero_is_three_distant_convex {α : Type*} [DecidableEq α] : is_three_distant_convex (fun (_ : Finset α) => (0 : ℝ))
- Source
- arXiv:2611.07572 Def 1
- Verified
- 09 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- is_three_distant_convexA cooperative game v on a finite set of players is 3-distant convex if v(S) + v(T) ≤ v(S ∪ T) + v(S ∩ T) for all coalitions S and T whose…
- oriented_overlap_multiplicity_budgetSummed multiplicities and charges cost at most three times overlap when multiplicity-two edges have at most one charge.
- Used by 1
- zero_is_two_thirds_convexThe constant zero game is 2/3-convex.
Read back from the Lean
For any type α with decidable equality, the constant zero function v : Finset α → ℝ (mapping every finite subset to 0) satisfies is_three_distant_convex.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
To show that the constant zero game is 3-distant convex, we unfold the definition of 3-distant convexity. For any two coalitions whose symmetric difference has cardinality at least 3, the condition requires $0 + 0 \le 0 + 0$, which holds trivially.
The zero game satisfies 3-distant convexity. automation
Unfolding the definition of `is_three_distant_convex`, we need to show that for any two finite sets $S$ and $T$ whose symmetric difference has size at least 3, the zero game satisfies $0 + 0 \le 0 + 0$. Simplification immediately reduces this to the trivial inequality $0 \le 0$.
uses
is_three_distant_convex,oriented_overlap_multiplicity_budgetis_three_distant_convex (fun (_ : Finset α) => (0 : ℝ)) := by first | exact oriented_overlap_multiplicity_budget | (apply oriented_overlap_multiplicity_budget <;> assumption) | (apply oriented_overlap_multiplicity_budget <;> simp_all) | simpa using oriented_overlap_multiplicity_budget | (simp only [is_three_distant_convex] at *; first | exact oriented_overlap_multiplicity_budget | (apply oriented_overlap_multiplicity_budget <;> assumption) | (apply oriented_overlap_multiplicity_budget <;> simp_all) | simpa using oriented_overlap_multiplicity_budget)
is_three_distant_convex- A game $v$ is 3-distant convex if $v(S) + v(T) \le v(S \cup T) + v(S \cap T)$ whenever the symmetric difference of $S$ and $T$ has cardinality at least 3.
oriented_overlap_multiplicity_budget- An inequality bounding the sum of multiplicities and overlaps by three times the reduced multiplicity budget (syntactically supplied to the tactic, but unused by the simplification).
- The proof script was generated by an automated search or hammer script. Although `oriented_overlap_multiplicity_budget` is passed to `simpa`, it is mathematically irrelevant: unfolding `is_three_distant_convex` reduces the goal to $0 + 0 \le 0 + 0$, which `simpa` closes simply because $0 \le 0$ is trivially true.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The constant zero game is 3-distant convex. -/theorem zero_is_three_distant_convex {α : Type*} [DecidableEq α] : is_three_distant_convex (fun (_ : Finset α) => (0 : ℝ)) := by first | exact oriented_overlap_multiplicity_budget | (apply oriented_overlap_multiplicity_budget <;> assumption) | (apply oriented_overlap_multiplicity_budget <;> simp_all) | simpa using oriented_overlap_multiplicity_budget | (simp only [is_three_distant_convex] at *; first | exact oriented_overlap_multiplicity_budget | (apply oriented_overlap_multiplicity_budget <;> assumption) | (apply oriented_overlap_multiplicity_budget <;> simp_all) | simpa using oriented_overlap_multiplicity_budget)