AFTD Auto-Formalizing Theoretical Domains

IsESS.isNSS

theoremverifiedformalizationimported Lean

Every ESS is neutrally stable.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {S : Type*} {u : S → S → ℝ} in
theorem IsESS.isNSS {s : S} (h : IsESS u s) : IsNSS u s
Formalizes
EconCSLib, `IsESS.isNSS`
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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • IsNSSA strategy s is neutrally stable (NSS) if: 1. u(s,s) ≥ u(t,s) for all t 2. If u(s,s) = u(t,s) then u(s,t) ≥ u(t,t)
  • IsESSA strategy s is an evolutionarily stable strategy (ESS) if: 1. u(s,s) ≥ u(t,s) for all t (Nash condition) 2. If u(s,s) = u(t,s)…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {S : Type*} {u : S → S → ℝ} in/-- Every ESS is neutrally stable. -/theorem IsESS.isNSS {s : S} (h : IsESS u s) : IsNSS u s := by  exact ⟨h.1, fun t heq => by    by_cases hs : s = t    · subst hs; exact le_refl _    · exact le_of_lt (h.2 t heq hs)⟩
See it in the graphDiscuss this resultChallenge it