An Elementary Proof of a Minimax Theorem
Jeff Calder
TL;DR
This paper provides an elementary, self-contained proof of Fan's minimax theorem in a simplified setting suitable for undergraduates. It follows Nikaido's method by introducing the Phi functional and showing its minimum is zero, which yields a saddle point and the minimax equality. It also extends the result to certain unbounded y-domains when f is quadratic in y, providing a concrete unbounded-case proof. The contribution clarifies the role of convexity, duality, and saddle points in minimax problems and offers a teaching-friendly approach.
Abstract
Here, we give a self-contained and elementary proof of a minimax theorem due to Fan in a simplified setting that can be taught in an advanced undergraduate course. Our proof follows Nikaido's argument with some simplifications.
