Parthasarathy's Theorem¶
A minimax theorem for bounded unit-square games with finitely many curve discontinuities, obtaining a mixed value when one player is restricted to Lebesgue-absolutely-continuous strategies.
Core Idea¶
Parthasarathy's theorem treats a continuum zero-sum game whose payoff need not be continuous everywhere. Boundedness and confinement of discontinuities to finitely many continuous curves keep the irregularity controlled.
The key asymmetry is strategic: one player may use any probability measure, while the other must use a distribution absolutely continuous with respect to Lebesgue measure. Under those exact conditions, the max–inf and inf–max expected payoffs coincide.
Scope of Application¶
- Game theory. Establishes values in discontinuous continuum games.
- Minimax analysis. Shows how strategy restrictions restore equality.
- Probability measures. Uses absolute continuity and integration.
- Economic theory. Models randomized continuous actions under density constraints.
Clarity¶
State action spaces, payoff sign, boundedness, every discontinuity curve and continuity domain, measure spaces, which player is restricted, reference Lebesgue measure, expected-payoff integral, and max/inf attainment convention. Inclusion test: Require the unit-square action domains, bounded kernel, only finitely many stated continuous-curve discontinuities, correct mixed-measure classes, and the asymmetric absolute-continuity restriction. Exclusion test: Exclude unconstrained von Neumann minimax invoked for discontinuous infinite games, both players allowed arbitrary measures, pure-strategy value claims, and absolute continuity left unspecified. Nearest boundary: Von Neumann's finite-game theorem allows all probability vectors; Parthasarathy handles this continuum/discontinuity setting by restricting one strategy class. Exit condition: The conclusion is not licensed if discontinuities exceed the stated form, boundedness fails, or the restricted player is allowed singular/pure measures. Common misclassifications: It is not the unrestricted finite-game minimax theorem. It does not allow both players arbitrary measures under the same conclusion. It is not a pure-strategy saddle-point result. Arbitrary discontinuities are not covered. Nearest named distinctions: Von Neumann minimax: Classically covers finite games without this curve-discontinuity setup. Sion minimax: Uses convexity and semicontinuity hypotheses. Pure-strategy equilibrium: Does not follow from a mixed value. Absolute-continuity of payoff: Is different from absolute continuity of a strategy measure.
Manages Complexity¶
The theorem balances payoff irregularity against a restriction preventing one player from concentrating mass on problematic thin sets.
Abstract Reasoning¶
- Verify unit-interval action domains.
- Prove payoff boundedness and locate discontinuities.
- Confirm finitely many continuous graph curves.
- Assign full and absolutely continuous strategy classes correctly.
- Apply the exact minimax equality without extending it beyond hypotheses.
Knowledge Transfer¶
The result transfers only when transformed domains, reference measures, regularity of exceptional sets, boundedness, and allowed strategy classes preserve the proof's measure-theoretic structure.
Relationships to Other Abstractions¶
Current abstraction Parthasarathy's Theorem Domain-specific
Parents (1) — more general patterns this builds on
-
Parthasarathy's Theorem is a kind of Minimax Theorem Domain-specific
Parthasarathy's Theorem is a strict kind of Minimax Theorem: it is a minimax existence result for a specified class of discontinuous unit-square games.
Hierarchy path (1) — routes to 1 parentless root
- Parthasarathy's Theorem → Minimax Theorem → Minimax Strategy → Optimization
Neighborhood in Abstraction Space¶
Parthasarathy's Theorem sits in a moderately populated region (48th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Combinatorial Optimization & Game Problems (12 abstractions)
Nearest neighbors
- Maximising measure — 0.87
- Radon Measure — 0.87
- Graphical Game Theory — 0.86
- Path Integral Formulation — 0.86
- Topological Dynamical System — 0.86
Computed from structural-signature embeddings · 2026-10-08