A Minimax Lemma and its Applications
Abstract
We prove an easy version of the minimax theorem with no topological assumption. We deduce from it some domination criteria as well as an application to p-summing operators.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.