Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sequential closedness of the countering correspondence

Proved
Nash1950.Countering.counters_of_tendsto

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

best-responseclosed-graphgame-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Pk,QkP_k,Q_kPk​,Qk​ be sequences of mixed-strategy profiles in a finite game, converging respectively to PPP and QQQ. If QkQ_kQk​ counters PkP_kPk​ at every index, then QQQ counters PPP:

Pk→P,Qk→Q,∀k  Qk∈C(Pk)⟹Q∈C(P).P_k\to P,\quad Q_k\to Q,\quad \forall k\;Q_k\in C(P_k)\quad\Longrightarrow\quad Q\in C(P).Pk​→P,Qk​→Q,∀kQk​∈C(Pk​)⟹Q∈C(P).

This is Nash's explicit sequential formulation of the closed-graph property.

Formalization Note. Convergence uses the product topology on the finite product of real strategy vectors. The sequence index is kkk to distinguish it from the number of players. Each PkP_kPk​ is explicitly a mixed profile; each QkQ_kQk​ is one by the definition of countering.

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_Nash1950_Countering_Setting

open Filter
Formal statement
namespace Nash1950.Countering

theorem counters_of_tendsto {ι : Type*} [Fintype ι] [DecidableEq ι]
    (S : ι → Type*) [∀ i, Fintype (S i)]
    (u : ι → (∀ i, S i) → ℝ) :
    ∀ (P Q : ℕ → ∀ i, S i → ℝ) (P₀ Q₀ : ∀ i, S i → ℝ),
      (∀ k, AGT.IsMixedProfile (P k)) →
      Tendsto P atTop (nhds P₀) → Tendsto Q atTop (nhds Q₀) →
      (∀ k, Counters u (P k) (Q k)) → Counters u P₀ Q₀ := by sorry

end Nash1950.Countering
Source
Nash, Equilibrium points in n-person games, Proc. Natl. Acad. Sci. USA 36 (1950), p. 49, ¶3, sentences 3–4 (PDF p. 3)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me