zero_is_two_thirds_convex
The constant zero game is 2/3-convex.
Statement
theorem zero_is_two_thirds_convex {α : Type*} [DecidableEq α] : is_two_thirds_convex (fun (_ : Finset α) => (0 : ℝ))
- Source
- folklore
- Verified
- 13 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- is_two_thirds_convexA cooperative game v : Finset α → ℝ is 2/3-convex if for every three distinct coalitions S₁, S₂, S₃, at least two of the three pairs…
- zero_is_three_distant_convexThe zero game, where every coalition has value zero, is 3-distant convex.
Read back from the Lean
For any type α with decidable equality, the constant zero function Finset α → ℝ (mapping every finite subset of α to 0) satisfies is_two_thirds_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 2/3-convex, we unfold the definition of 2/3-convexity. For the constant zero function, the required convexity inequalities all reduce to $0 + 0 \ge 0 + 0$. Simplification evaluates these trivial inequalities to true and closes the goal.
The constant zero game satisfies 2/3-convexity. automation
Unfolding the definition `is_two_thirds_convex` expresses the goal as showing that for any three pairwise distinct sets $S_1, S_2, S_3$, at least two pairs satisfy $0 + 0 \ge 0 + 0$. Simplification reduces $0 + 0 \ge 0 + 0$ to true and closes the goal by elementary propositional logic and real arithmetic.
uses
is_two_thirds_convex,zero_is_three_distant_convexis_two_thirds_convex (fun (_ : Finset α) => (0 : ℝ)) := by first | exact zero_is_three_distant_convex | (apply zero_is_three_distant_convex <;> assumption) | (apply zero_is_three_distant_convex <;> simp_all) | simpa using zero_is_three_distant_convex | (simp only [is_two_thirds_convex] at *; first | exact zero_is_three_distant_convex | (apply zero_is_three_distant_convex <;> assumption) | (apply zero_is_three_distant_convex <;> simp_all) | simpa using zero_is_three_distant_convex)
is_two_thirds_convex- A game $v$ is 2/3-convex if for any three pairwise distinct sets $S_1, S_2, S_3$, at least two of the pairs satisfy $v(S_i \cup S_j) + v(S_i \cap S_j) \ge v(S_i) + v(S_j)$.
zero_is_three_distant_convex- The constant zero game is 3-distant-convex, meaning $v(S) + v(T) \le v(S \cup T) + v(S \cap T)$ whenever $|S \symmDiff T| \ge 3$.
- The proof is written as an automated fallback search (`first | ...`). The branch that succeeds unfolds `is_two_thirds_convex` and runs `simpa using zero_is_three_distant_convex`. The lemma `zero_is_three_distant_convex` is not actually needed mathematically; simplification alone reduces the goal to trivial inequalities $0 + 0 \ge 0 + 0$ and closes it.
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 zero game is 2/3-convex. -/theorem zero_is_two_thirds_convex {α : Type*} [DecidableEq α] : is_two_thirds_convex (fun (_ : Finset α) => (0 : ℝ)) := by first | exact zero_is_three_distant_convex | (apply zero_is_three_distant_convex <;> assumption) | (apply zero_is_three_distant_convex <;> simp_all) | simpa using zero_is_three_distant_convex | (simp only [is_two_thirds_convex] at *; first | exact zero_is_three_distant_convex | (apply zero_is_three_distant_convex <;> assumption) | (apply zero_is_three_distant_convex <;> simp_all) | simpa using zero_is_three_distant_convex)