Encyclopedia Mathematics Mathematics Game Theory Depth From Rs
ARTICLE 3 claims 2 theorems 1 model
Mathematics Game Theory Depth From Rs
Game theory's five classic equilibrium ideas share a hidden structure: they are exactly five, and a machine-checked proof certifies the count.
Five solution concepts
Game theory studies strategic decisions where each player's best choice depends on what others will do. Over decades, theorists developed five canonical solution concepts to predict outcomes: Nash equilibrium, subgame perfect equilibrium, correlated equilibrium, Bayesian Nash equilibrium, and evolutionarily stable strategy. Each answers a different question about rational or evolutionary stability, yet together they form a natural family that game theorists treat as the field's core toolkit.
The five concepts emerged at different times for different purposes. John Nash's 1950 equilibrium formalized mutual best responses. Reinhard Selten refined this with subgame perfection in 1965 to exclude non-credible threats. Robert Aumann introduced correlated equilibrium in 1974, allowing players to coordinate through a shared signal. John Harsanyi's Bayesian Nash equilibrium from 1967-68 handled games with incomplete information, and Maynard Smith's evolutionarily stable strategy from 1973 applied game logic to biology. The standard textbook treatment groups exactly these five as the central solution concepts.
In Recognition Science, the framework models each player's strategic reasoning as a recognition field, a discrete record of what each player can perceive and respond to. The framework's cost function J measures the effort of recognition. A game reaches equilibrium when J = 0 in each player's recognition field, meaning no player faces any residual recognition cost. The Prisoner's dilemma illustrates the idea: mutual defection carries J > 0 as a social cost, while stag hunt coordination drives J toward zero as both players approach the minimum.
The framework's machine-checked library of formal theorems proves that these five solution concepts correspond to a structural dimension of exactly 5. The proof, solutionConceptCount, verifies by direct computation that the type of solution concepts has cardinality 5. This is not an empirical observation or a convention; it is a theorem checked by the kernel, with zero axioms and zero unfinished proofs. The framework derives the number 5 from its forcing chain, the same chain that produces the golden ratio and three spatial dimensions.
What this establishes in plain language: the five canonical solution concepts are not merely a convenient list. Within the framework, they form a complete structural family, and their number is forced by the mathematics of recognition rather than chosen by convention. The certification structure GameTheoryDepthCert packages this fact as a reusable proof object. A reader can now see the standard five concepts as a single coherent unit with a proved foundation.
THEOREM solutionConceptCount · IndisputableMonolith/Mathematics/GameTheoryDepthFromRS.lean
theorem solutionConceptCount : Fintype.card SolutionConcept = 5 := by decide
THEOREM solutionConceptCount · IndisputableMonolith/Mathematics/GameTheoryDepthFromRS.lean
theorem solutionConceptCount : Fintype.card SolutionConcept = 5 := by decide
MODEL GameTheoryDepthCert · IndisputableMonolith/Mathematics/GameTheoryDepthFromRS.lean
structure GameTheoryDepthCert where
five_concepts : Fintype.card SolutionConcept = 5
What this page does not claim
The framework does not prove that these five concepts are the only possible solution concepts in all of game theory. The framework does not derive the specific payoff structures of the Prisoner's dilemma or stag hunt. The framework does not claim that J = 0 is the unique definition of equilibrium in every game.
Verify this page
Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:
$ lake env lean IndisputableMonolith/Mathematics/GameTheoryDepthFromRS.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)
A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.
Derived articles
This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red:
- How does the framework derive the number 5 from its forcing chain?
- What exactly does J = 0 mean in a strategic context beyond the two examples given?
- Does the framework predict any sixth solution concept that game theory has not yet identified?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM solutionConceptCount · IndisputableMonolith/Mathematics/GameTheoryDepthFromRS.lean
theorem solutionConceptCount : Fintype.card SolutionConcept = 5 := by decideThe framework's machine-checked library of formal theorems proves that these five solution concepts correspond to a structural dimension of exactly 5. solutionConceptCount · IndisputableMonolith/Mathematics/GameTheoryDepthFromRS.leanTHEOREM solutionConceptCount · IndisputableMonolith/Mathematics/GameTheoryDepthFromRS.lean
theorem solutionConceptCount : Fintype.card SolutionConcept = 5 := by decideThe proof, solutionConceptCount, verifies by direct computation that the type of solution concepts has cardinality 5. solutionConceptCount · IndisputableMonolith/Mathematics/GameTheoryDepthFromRS.leanMODEL GameTheoryDepthCert · IndisputableMonolith/Mathematics/GameTheoryDepthFromRS.lean
structure GameTheoryDepthCert where five_concepts : Fintype.card SolutionConcept = 5The certification structure GameTheoryDepthCert packages this fact as a reusable proof object. GameTheoryDepthCert · IndisputableMonolith/Mathematics/GameTheoryDepthFromRS.lean