Related papers: A Minimax Lemma and its Applications
We begin with a context more general than set theory. The basic ingredients are essentially the object and functor primitives of category theory, and the logic is weak, requiring neither the Law of Excluded Middle nor quantification. Inside…
Quite recently, a new property related to norm-attaining operators has been introduced: the weak maximizing property (WMP). In this note, we define a generalised version of it considering other topologies than the weak one (mainly the…
We consider the problem of formalizing the familiar notion of widening in abstract interpretation in higher-order logic. It turns out that many axioms of widening (e.g. widening sequences are ascending) are not useful for proving…
We construct the universal type structure for conditional probability systems without any topological assumption, namely a type structure that is terminal, belief-complete, and non-redundant. In particular, in order to obtain the…
The argmax theorem is a useful result for deriving the limiting distribution of estimators in many applications. The conclusion of the argmax theorem states that the argmax of a sequence of stochastic processes converges in distribution to…
We present a simple yet rigorous theory of integration that is based on two axioms rather than on a construction involving Riemann sums. With several examples we demonstrate how to set up integrals in applications of calculus without using…
This short note has a twofold purpose: (i) to solve the question that motivates a recent paper of D. Popa on multilinear variants of Pietsch's composition theorem for absolutely summing operators. More precisely, we remark that there is a…
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlying a theorem prover. We also show a close relation with the…
We prove a reconstruction theorem for homeomorphism groups of open sets in metrizable locally convex topological vector spaces. We show that certain small subgroups of the full homeomorphism group obey the conditions of the above theorem.
This paper shows an elementary and direct proof of the Fundamental Theorem of Algebra, via Bolzano-Weierstrass Theorem on Minima and the Binomial Formula, that avoids: any root extraction other than the one used to define the modulus…
We derive basic properties of minimal extensions of local rings and their restrictions to subrings. Some applications are included to subrings of truncated polynomial rings.
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…
We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\LA$ with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over…
In this note we prove an abstract version of a result from 2002 due to Delgado and Pi\~{n}ero on absolutely summing operators. Several applications are presented; some of them in the multilinear framework and some in a completely nonlinear…
Topologies on algebraic and equational theories are used to define germ determined, near-point determined, and point determined rings of smooth functions, without requiring them to be finitely generated. It is proved, that any commutative…
We explore some variants of the Boman covering lemma, and their relationship to the boundedness properties of the maximal operator. Let $1 < p < \infty$ and let $q$ be its conjugate exponent. We prove that the strong type $(q,q)$ of the…
A re-construction of the fundamentals of programming as a small mathematical theory (PRISM) based on elementary set theory. Highlights: $\bullet$ Zero axioms. No properties are assumed, all are proved (from standard set theory). $\bullet$ A…
In the study of smooth functions on manifolds, min-max theory provides a mechanism for identifying critical values of a function. In this paper we introduce a discretized version of this theory associated to a discrete Morse function on a…
We study a class of statistical inverse problems with non-linear pointwise operators motivated by concrete statistical applications. A two-step procedure is proposed, where the first step smoothes the data and inverts the non-linearity.…
In this paper, we apply our minimax theory ([4], [5], [6]) with the one developed by A. Moameni in [2] to formalize a general scheme giving the multiplicity of critical points. Here is a sample of application of the scheme to a critical…