Related papers: Extension of Zorn's lemma to arbitrary binary rela…
Zorn's Lemma is a well-known equivalent of the Axiom of Choice. It is usually regarded as a topic in axiomatic set theory, and its historically standard proof (from the Axiom of Choice) relies on transfinite recursion, a non-elementary…
Szpilrajn's Lemma entails that each partial order extends to a linear order. Dushnik and Miller use Szpilrajn's Lemma to show that each partial order has a relizer. Since then, many authors utilize Szpilrajn's Theorem and the Well-ordering…
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…
We introduce the notion of additive filter and present a new proof of the existence of idempotent ultrafilters on N without any use of Zorn's Lemma, and where one only assumes the Ultrafilter Theorem for the continuum.
Urysohn's Lemma is a crucial property of normal spaces that deals with separation of closed sets by continuous functions. It is also a fundamental ingredient in proving the Tietze Extension Theorem, another property of normal spaces that…
The well-known Leibniz theorem (Leibniz Criterion or alternating series test) of convergence of alternating series is generalized for the case when the absolute value of terms of series are "not absolutely monotonously" convergent to zero.…
A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…
This article presents an elementary proof of Zorn's Lemma under the Axiom of Choice, simplifying and supplying necessary details in the original proof by Paul R. Halmos in his book, Naive Set Theory. Also provided, is a preamble to Zorn's…
It was shown recently that Birkhoff's theorem for doubly stochastic matrices can be extended to unitary matrices with equal line sums whenever the dimension of the matrices is prime. We prove a generalization of the Birkhoff theorem for…
We prove an extension of the Bourgain-Sarnak-Ziegler theorem and then apply it to bound certain polynomial exponential sums with modular coefficients.
We propose a fairly simple and natural extension of Stollmann's lemma to correlated random variables. This extension allows (just as the original Stollmann's lemma does) to obtain Wegner-type estimates even in some problems of spectral…
In this paper, we introduce the method of adding additional factors and a parameter to multiple zeta values and prove some generalizations of the duality theorem and several relations among multiple zeta values. In particular, we are able…
We survey a few strengthenings and generalizations of the Combinatorial Nullstellensatz of Alon and the Schwartz-Zippel Lemma. These lemmas guarantee the existence of (a certain number of) nonzeros of a multivariate polynomial when the…
A central limit theorem for arrays of symmetric row-wise exchangeable random variables is presented. The result is valid for finite and infinite extendable and non-extendable sequences. Unlike most reported versions of the central limit…
In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is…
It is shown that under certain boundary conditions the virial theorem has to be modified. We analyze the origin of the extra term and compute it in particular examples. The Coulomb and harmonic oscillator with point interaction have been…
We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…
The purpose of this paper is to generalize the classical Mazur's lemma from the classical convex analysis to the framework of locally $L^0$-convex modules. In this version an extra condition of countable concatenation is included. We…
Border's theorem gives an intuitive linear characterization of the feasible interim allocation rules of a Bayesian single-item environment, and it has several applications in economic and algorithmic mechanism design. All known…
We derive new bounds of the remainder in a combinatorial central limit theorem without assumptions on independence and existence of moments of summands. For independent random variables our theorems imply Esseen and Berry-Esseen type…