Related papers: A Minimax Lemma and its Applications
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a ``topological'' game for Multiplicative Additive Linear Logic without propositional variables, including cut moves. We recast the…
I give a proof of the uniform boundedness theorem that is elementary (i.e. does not use any version of the Baire category theorem) and also extremely simple.
We prove a model theoretic Baire category theorem for $\tilde\tau_{low}^f$-sets in a countable simple theory in which the extension property is first-order and show some of its applications. We also prove a trichotomy for minimal types in…
Lower bounds involving $f$-divergences between the underlying probability measures are proved for the minimax risk in estimation problems. Our proofs just use simple convexity facts. Special cases and straightforward corollaries of our…
This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to…
We give a proof of the o-minimal version of the Whitney Extension Theorem simplified as compared to the original ones. A new simplifying ingredient is a definable variant of Urysohn's lemma for class $\mathcal{C}^q$ (see Section 3).
We prove the existence of maximizers for a general family of restrictions operators, up to the end-point. We also provide some counterxamples in the end-point case.
We study minimax testing in a statistical inverse problem when the associated operator is unknown. In particular, we consider observations from an inverse Gaussian regression model where the associated operator is unknown but contained in a…
We consider the optimal control of a differential equation that involves the suprema of the state over some part of the history. In many applications, this non-smooth functional dependence is crucial for the successful modeling of…
We prove a version of van der Corput's Lemma for polynomials over the p-adic numbers.
In this paper we present a proof of the BMZ Reduction Lemma with a motivational perspective, and state this lemma for maps to manifolds using the classical definition of cohomological dimension. The lemma, proved and utilized in [4], gives…
We give an undergraduate short and simple proof for Zariski's lemma.
The aim of this paper is to prove all well-known metrization theorems using partitions of unity. To accomplish this, we first discuss sufficient and necessary conditions for existence of $\mathcal{U}$-small partitions of unity (partitions…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
We prove a general factorization theorem for Lipschitz summing operators in the context of metric spaces which recovers several linear and nonlinear factorization theorems that have been proved recently in different environments. New…
We prove a fixed-point theorem that generalises and simplifies a number of results in the theory of $F$-contractions. We show that all of the previously imposed conditions on the operator can be either omitted or relaxed. Furthermore, our…
Theorems about characterization of finite rank Toeplitz operators in Fock-Segal-Bargmann spaces, known previously only for symbols with compact support, are carried over to symbols without that restriction, however with a rather rapid decay…
In this paper we prove a level raising theorem for some weight $2$ trivial character newforms at almost every prime $p$. This is done by ignoring the residue characteristic at which the level raising appears.
We prove a stronger version of a termination theorem appeared in the paper "On existence of log minimal models II". We essentially just get rid of the redundant assumptions so the proof is almost the same as in there. However, we give a…
We give an integrability condition on a function $\psi$ guaranteeing that for almost all (or almost no) $x\in\mathbb{R}$, the system $|qx-p|\leq \psi(t)$, $|q|<t$ is solvable in $p\in \mathbb{Z}$, $q\in \mathbb{Z}\smallsetminus \{0\}$ for…