Related papers: An Elementary Proof of a Minimax Theorem
The first aim of this note is to give a concise, but complete and self-contained, presentation of the fundamental theorems of Mori theory - the nonvanishing, base point free, rationality and cone theorems - using modern methods of…
In adaptive data analysis, the user makes a sequence of queries on the data, where at each step the choice of query may depend on the results in previous steps. The releases are often randomized in order to reduce overfitting for such…
We give a simple proof of the exponential de Finetti theorem due to Renner. Like Renner's proof, ours combines the post-selection de Finetti theorem, the Gentle Measurement lemma, and the Chernoff bound, but avoids virtually all…
In this short note, we mimic the proof of the simplicity of the theory ACFA of generic difference fields in order to provide a criterion, valid for certain theories of pure fields and fields equipped with operators, which shows that a…
In this paper we prove genus bounds for closed embedded minimal surfaces in a closed 3-dimensional manifold constructed via min-max arguments. A stronger estimate was announced by Pitts and Rubistein but to our knowledge its proof has never…
We study test sets: subfamilies of sequences converging to a point P that still suffice to detect every discontinuity of real-valued functions at P. Ordered by inclusion, these test sets form a poset. Under natural hypotheses at P, we prove…
We present a prototype of an integrated reasoning environment for educational purposes. The presented tool is a fragment of a proof assistant and automated theorem prover. We describe the existing and planned functionality of the theorem…
Elementary proofs are given for sums of Schur functions over partitions into at most n parts each less than or equal to m for which i) all parts are even, ii) all parts of the conjugate partition are even. Also, an elementary proof of a…
The theorem like Pontryagin's maximum principle for multiple integrals is proved. Unlike the usual maximum principle, the maximum should be taken not over all matrices, but only on matrices of rank one. Examples are given.
We suggest a modified and briefer version for the proof of Higman's embedding theorem stating that a finitely generated group can be embedded in a finitely presented group if and only if it is recursively presented. In particular, we…
The minimization principle $\textsf{MIN}(\triangleleft)$ studied in bounded arithmetic says that a strict linear ordering $\triangleleft$ on any finite interval $[0,\dots,n)$ has the minimal element. We shall prove that bounded arithmetic…
In this paper we survey with complete proofs some well--known, but hard to find, results about constructing closed embedded minimal surfaces in a closed 3-dimensional manifold via min--max arguments. This includes results of J. Pitts, F.…
In this paper, we prove a fine condensation theorem. This is quite similar to condensation theorems for pure extender mice in the literature, except that condensation for iteration strategies has been added to the mix.
We prove an enumerative min-max theorem that relates the number of genus g minimal surfaces in 3-manifolds of positive Ricci curvature to topological properties of the set of embedded surfaces of genus $\leq g$, possibly with finitely many…
Our main theorem is an extension of the well-known Mizoguchi-Takahaashi's fixed point theorem [N. Mizogochi and W. Takahashi, Fixed point theorems for multi-valued mappings on complete metric space, {\it J. Math. Anal. Appl.} 141 (1989)…
This note is devotes to some remarks regarding the use of variational methods, of minimax type, to establish continuity type results
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 strengthen "The Free Will Theorem" [1] in several ways, by replacing the axiom FIN by a weaker axiom MIN, and also by allowing the particles' responses to depend on past half-spaces rather than on on past light cones. This change allows…
We present a natural restriction of Hindman's Finite Sums Theorem that admits a simple combinatorial proof (one that does not also prove the full Finite Sums Theorem) and low computability-theoretic and proof-theoretic upper bounds, yet…
We present an alternative proof of Sanov's theorem for Polish spaces in the weak topology that follows via discretization arguments. We combine the simpler version of Sanov's Theorem for discrete finite spaces and well chosen finite…