AFTD Auto-Formalizing Theoretical Domains

EconCSLib.StrategicGame.IsConstantSum.neg

theoremverifiedformalizationimported Lean

In a constant-sum game, player 1's payoff is c minus player 0's. AddCommGroup is needed (not just AddGroup): the RHS uses Sub, which AddGroup defines as c - a = c + -a; matching it to -a + c (the canonical rearrangement of a + b = c) requires commutativity.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {U : Type*} in
theorem EconCSLib.StrategicGame.IsConstantSum.neg [AddCommGroup U]
    {G : EconCSLib.StrategicGame (Fin 2) U} {c : U} (hcs : IsConstantSum G c) (σ : G.Profile) :
    G.payoff σ 1 = c - G.payoff σ 0
Formalizes
EconCSLib, `StrategicGame.IsConstantSum.neg`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
What was changed in EconCSLib.StrategicGame.IsConstantSum.neg
--- EconCSLib/GameTheory/StrategicGame/ZeroSum/Basic.lean:107 (StrategicGame.IsConstantSum.neg)
+++ as compiled here
@@ -1,8 +1,6 @@
-/-- In a constant-sum game, player 1's payoff is `c` minus player 0's.
-
-`AddCommGroup` is needed (not just `AddGroup`): the RHS uses `Sub`, which
-`AddGroup` defines as `c - a = c + -a`; matching it to `-a + c` (the canonical
-rearrangement of `a + b = c`) requires commutativity. -/
-theorem IsConstantSum.neg [AddCommGroup U]
-    {G : StrategicGame (Fin 2) U} {c : U} (hcs : IsConstantSum G c) (σ : G.Profile) :
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+variable {U : Type*} in
+theorem EconCSLib.StrategicGame.IsConstantSum.neg [AddCommGroup U]
+    {G : EconCSLib.StrategicGame (Fin 2) U} {c : U} (hcs : IsConstantSum G c) (σ : G.Profile) :
     G.payoff σ 1 = c - G.payoff σ 0 :=
Verified
08 Oct 2026
Axioms
propext
Built on 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {U : Type*} in
/-- In a constant-sum game, player 1's payoff is `c` minus player 0's. `AddCommGroup` is needed (not just `AddGroup`): the RHS uses `Sub`, which `AddGroup` defines as `c - a = c + -a`; matching it to `-a + c` (the canonical rearrangement of `a + b = c`) requires commutativity. -/
theorem EconCSLib.StrategicGame.IsConstantSum.neg [AddCommGroup U]
    {G : EconCSLib.StrategicGame (Fin 2) U} {c : U} (hcs : IsConstantSum G c) (σ : G.Profile) :
    G.payoff σ 1 = c - G.payoff σ 0 :=
  eq_sub_of_add_eq' (hcs σ)
See it in the graphDiscuss this resultChallenge it