Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The countering correspondence has nonempty values in the mixed-profile space

Proved
Nash1950.Countering.counteringSet_nonempty_subset

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

best-responsegame-theorymixed-strategiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Suppose every player has a finite, nonempty pure-strategy set. For each mixed profile PPP, the set C(P)C(P)C(P) of profiles countering PPP is nonempty and consists entirely of mixed profiles:

P∈Σ⟹C(P)≠∅ and C(P)⊆Σ.P\in\Sigma\quad\Longrightarrow\quad C(P)\ne\varnothing\ \text{and}\ C(P)\subseteq\Sigma.P∈Σ⟹C(P)=∅ and C(P)⊆Σ.

This makes CCC a correspondence from the product of mixed-strategy spaces into itself, as required for Nash's fixed-point argument.

Formalization Note. Nonemptiness of each pure-strategy set is implicit in the source's use of probability distributions and is explicit here. The player type itself may be empty.

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_Nash1950_Countering_Setting
Formal statement
namespace Nash1950.Countering

theorem counteringSet_nonempty_subset {ι : Type*} [Fintype ι] [DecidableEq ι]
    (S : ι → Type*) [∀ i, Fintype (S i)] [∀ i, Nonempty (S i)]
    (u : ι → (∀ i, S i) → ℝ) :
    ∀ P : ∀ i, S i → ℝ, AGT.IsMixedProfile P →
      (counteringSet u P).Nonempty ∧
        counteringSet u P ⊆ {Q | AGT.IsMixedProfile Q} := by sorry

end Nash1950.Countering
Source
Nash, Equilibrium points in n-person games, Proc. Natl. Acad. Sci. USA 36 (1950), p. 49, ¶3, sentence 1 (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