相关论文: Finitely additive beliefs and universal type space…

We prove that all extreme points of the unit ball of a Lipschitz-free space over a compact metric space have finite support. Combined with previous results, this completely characterizes extreme points and implies that all of them are also…

We establish fundamental mathematical limits on universal approximation theorem (UAT) system alignment by proving that catastrophic failures are an inescapable feature of any useful computational system. Our central thesis is that for any…

New fixed point results are presented for ${\cal U}_c^{\kappa}(X,X)$ maps in extension type spaces.

We prove that intersections and unions of independent random sets in finite spaces achieve a form of Lipschitz continuity. More precisely, given the distribution of a random set $\Xi$, the function mapping any random set distribution to the…

This chapter provides a overview of Bayesian inference, mostly emphasising that it is a universal method for summarising uncertainty and making estimates and predictions using probability statements conditional on observed data and an…

We present a measure-theoretic condition for a property to hold ``almost everywhere'' on an infinite-dimensional vector space, with particular emphasis on function spaces such as $C^k$ and $L^p$. Like the concept of ``Lebesgue almost…

Characterisations of metrizable topological spaces or metrizable uniform spaces are well known. A natural counterpart to being metrizable for topological spaces can be expressed in terms of probabilistic metrizability for approach spaces.…

In the affine fragment of continuous logic, type spaces are compact convex sets. I study some model theoretic properties of extreme types. It is proved that every complete theory $T$ has an extremal model, i.e. a model which realizes only…

With a simple generic approach, we develop a classification that encodes and measures the strength of completeness (or compactness) properties in various types of spaces and ordered structures. The approach also allows us to encode notions…

In 1992, Diestel asked which topological spaces could be represented as the end space of some graph. In 2023, Pitz provided a solution to this question by giving a topological characterization of end spaces using a hereditarily complete…

In this article spacelike hypersurfaces immersed in twisted product spacetimes $I\times_f F$ with complete fiber are studied. Several conditions ensuring global hyperbolicity are presented, as well as a relation that needs to hold on each…

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…

For $1<p\le \infty$, we show the existence of a Banach space which is both injectively and surjectively universal for the class of all separable Banach spaces with an equivalent $p$-asymptotically uniformly smooth norm. We prove that this…

We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…

We consider categories of relational structures that fully embed every category of universal algebras, and prove a partial characterisation of these in terms of an infinitary variant of the notion of nowhere density of Ne\v{s}et\v{r}il and…

A metric space $\mathbf{X}$ is called densely complete if there exists a dense set $D$ in $\mathbf{X}$ such that every Cauchy sequence of points of $D $ converges in $\mathbf{X}$. One of the main aims of this work is to prove that the…

Finite mixture models are statistical models which appear in many problems in statistics and machine learning. In such models it is assumed that data are drawn from random probability measures, called mixture components, which are…

The concept of entropy, firstly introduced in information theory, rapidly became popular in many applied sciences via Shannon's formula to measure the degree of heterogeneity among observations. A rather recent research field aims at…

We investigate affine Berkovich spaces over maximally complete fields and prove that they may be approximated by simpler spaces when the only functions we need to evaluate are polynomials of bounded degree. We derive applications to…