A Minimax Lemma and its Applications
arXiv:2103.16454
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 -summing operators.
arXiv:2103.16454
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 -summing operators.