Related papers: Compactness Arguments in Real Analysis
We introduce some classical concepts in the representation theory of compact groups, in order to use them for a new generalization of the Peter-Weyl Theorem. We mostly deal with functions on locally compact groups possessing large…
We develop and investigate a general theory of representations of second-order functionals, based on a notion of a right comodule for a monad on the category of containers. We show how the notion of comodule representability naturally…
Based on rectangle theory of formal concept and set covering theory, the concept reduction preserving binary relations is investigated in this paper. It is known that there are three types of formal concepts: core concepts, relative…
In this article, we consider a simple representation for real numbers and propose top-down procedures to approximate various algebraic and transcendental operations with arbitrary precision. Detailed algorithms and proofs are provided to…
We introduce the class of unshreddable theories, which contains the simple and NIP theories, and prove that such theories have exactly saturated models in singular cardinals, satisfying certain set-theoretic hypotheses. We also give…
We prove an abstract theorem on keeping the compactness property of a linear operator after interpolation in Banach spaces. No analytical presentation of operators, spaces and interpolation functor is required. We use only some little-known…
We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e.…
We prove the existence of minimizers of causal variational principles on second countable, locally compact Hausdorff spaces. Moreover, the corresponding Euler-Lagrange equations are derived. The method is to first prove the existence of…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
We prove the existence and uniqueness of geometric models of local isometry classes of locally homogeneous spaces with sectional curvature $|\operatorname{sec}|\leq 1$. Moreover, we show that the set of geometric models is compact in the…
Argumentation accommodates various rhetorical devices, such as questions, reported speech, and imperatives. These rhetorical tools usually assert argumentatively relevant propositions rather implicitly, so understanding their true meaning…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
We show that absolutely minimizing functions relative to a convex Hamiltonian $H:\mathbb{R}^n \to \mathbb{R}$ are uniquely determined by their boundary values under minimal assumptions on $H.$ Along the way, we extend the known equivalences…
We prove a compactness result with respect to $\Gamma$-convergence for a class of integral functionals which are expressed as a sum of a local and a non-local term. The main feature is that, under our hypotheses, the local part of the…
In this paper, we use purely complex analytic techniques to prove two results of the first author which were hitherto given only probabilistic proofs. A general form of the Phragm\'en-Lindel\"of principle states that if the…
Motivated by recent work of Boney, Dimopoulos, Gitman and Magidor, we characterize the existence of weak compactness cardinals for all abstract logics through combinatorial properties of the class of ordinals. This analysis is then used to…
We propose for the Effective Topos an alternative construction: a realisability framework composed of two levels of abstraction. This construction simplifies the proof that the Effective Topos is a topos (equipped with natural numbers),…
We prove a Model Existence Theorem for a fully infinitary logic for metric structures. This result is based on a generalization of the notions of approximate formulas and approximate truth in normed structures introduced by Henson and…
We describe a numerical algorithm for evaluating the numbers of roots minus the number of poles contained in a region based on the argument principle with the function of interest being written as a Mellin transformation of a usually…
We give an alternative proof of a fact that a finite continuous non-decreasing submodular set function on a measurable space can be expressed as a supremum of measures dominated by the function, if there exists a class of sets which is…