Related papers: A Minimax Lemma and its Applications

Game-theoretic probability uses the structure of gambles to define a concept like probability, but which is more flexible and robust. We show that results in game-theoretic probability can be thought of as minimax theorems for specific…

We discuss some key results from convex analysis in the setting of topological groups and monoids. These include separation theorems, Krein-Milman type theorems, and minimax theorems.

We consider how mathematical models enable predictions for conditions that are qualitatively different from the training data. We propose techniques based on information topology to find models that can apply their learning in regimes for…

This article presents a clear proof of the Riemann Mapping Theorem via Riemann's method, uncompromised by any appeals to topological intuition.

We present methods that provide all zeroes and extrema of a function that do not require differentiation. Using point process theory, we are able to describe the locations of zeroes or maxima, their number, as well as their distribution…

In this article we derive, using standard methods of Toeplitz theory, an asymptotic formula for certain large minors of Toeplitz matrices. D. Bump and P. Diaconis obtained the same asymptotics using representation theory, with an answer…

In this paper, we will study the existence problem of minmax minimal torus. We use classical conformal invariant geometric variational methods. We prove a theorem about the existence of minmax minimal torus in Theorem 5.1. Firstly we prove…

This paper proves, in very general settings, that convex risk minimization is a procedure to select a unique conditional probability model determined by the classification problem. Unlike most previous work, we give results that are general…

In this work, a convergence lemma for function $f$ being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of $\delta$-stationary points near an isolated local minimum point $x^*$ is…

We prove a global domination principle in the setting of P-pluripotential theory. This has many applications including a general product property for P-extremal functions. The key ingredient is the proof of the existence of a strictly…

The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial…

We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.

We give conditions that ensure that an operator satisfying a Piestch domination in a given setting also satisfies a Piestch domination in a different setting. From this we derive that a bounded mutlilinear operator $T$ is Lipschitz…

This paper gives a generic form of the diamond lemma, which includes support for additive and topological structures of the base set, and which does not require any further structure (e.g. an associative multiplication operation) to be…

Given a subset $A\times B$ of a locally convex space $X\times Y$ (with $A$ compact) and a function $f:A\times B\rightarrow\overline{\mathbb{R}}$ such that $f(\cdot,y),$ $y\in B,$ are concave and upper semicontinuous, the minimax inequality…

An elementary application of Fatou's lemma gives a strengthened version of the monotone convergence theorem. We call this the convergence from below theorem. We make the case that this result should be better known, and deserves a place in…

We apply the geometric approach provided by $\Sigma$-operators to develop a theory of $p$-summability for multilinear operators. In this way, we introduce the notion of Lipschitz $p$-summing multilinear operators and show that it is…

We discuss the so-called "simplifying assumption" of conditional copulas in a general framework. We introduce several tests of the latter assumption for non- and semiparametric copula models. Some related test procedures based on…

We present a constructive proof of Brouwer's fixed point theorem with sequentially at most one fixed point, and apply it to the mini-max theorem of zero-sum games.

We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…