Related papers: Almost everywhere continuity of conditional expect…
We define a general notion of "summability" of a set $I\subseteq\mathbb{C^{N}}$ and show that some trivial condition necessary for a set to be summable, is also sufficient. We deduce some intresting corollaries.
We study $\Sigma^1_2$ definable counterparts for some algebraic equivalent forms of the Continuum Hypothesis. All turn out to be equivalent to "all reals are constructible".
Let $D \subseteq A$ be an inclusion of unital abelian $C^*$-algebras. In this note we characterize (in topological terms) when there is a unique conditional expectation $E:A \to D$, at least when $A$ is separable. As an application, we…
Absolute continuity implies uniform continuity, but generally not vice versa. In this short note, we present one sufficient condition for a uniformly continuous function to be absolutely continuous, which is the following theorem: For a…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
In this paper, we investigate and find a necessary and sufficient condition for a function to be absolutely continuous over $\mathbb{R}$ (denoted by $AC(\mathbb{R})$) or any unbounded interval in $\mathbb{R}$ . Note that the Lebesgue's…
A set of sequences is said to converge simultaneously if there exists an infinite subset $H$ of the index set $\omega$ such that all sequences converge when restricted to $H$. We discuss simultaneous convergence of sequences in the same or…
Universal Approximation Theorems establish the density of various classes of neural network function approximators in $C(K, \mathbb{R}^m)$, where $K \subset \mathbb{R}^n$ is compact. In this paper, we aim to extend these guarantees by…
The main result presented in this article is that probability can fundamentally be characterized as a subset of conditional expectation induced by a plausible preorder on random quantities. This is justified by the fact that probability is…
This article establishes a real-variable argument for Zygmund's theorem on almost everywhere convergence of strong arithmetic means of partial sums of Fourier series on $\mathbb{T}$, up to passing to a subsequence. Our approach extends to,…
A sequence $\mathbf{A}$ is said to be realizable if satisfies so called sign and Dold conditions. We will say that a sequence almost satisfies the Dold condition if there exists a constant $c\in\mathbb{N}_+$ such that…
The linear conditional expectation (LCE) provides a best linear (or rather, affine) estimate of the conditional expectation and hence plays an important r\^ole in approximate Bayesian inference, especially the Bayes linear approach. This…
The main subject of the paper is everywhere complex sequences. An everywhere complex sequence is a sequence that does not contain substrings of Kolmogorov complexity less than $\alpha n-O(1)$ where $n$ is the length of substring and…
We describe $\sigma$-matching, interchangeable and, as a consequence, totally compatible products on some classes of associative algebras, including unital algebras, the semigroup algebras of rectangular bands, algebras with enough…
The predictability of a sequence is defined as the asymptotic performance of the best performing predictor in a given class. The value of the predictability of a sequence will in general depend on the choice of this predictor class. The…
An equivalent condition for the product of elements of an independent random sample on a compact algebraic group converging in distribution to some random variable as the sample size increases is obtained. Namely, a limit distribution…
For a conditional expectation E on a (unital) C*-algebra A there exists a real number K>=1 such that the mapping (K.E-id_A) is positive if and only if there exists a real number L>=1 such that the mapping (L.E-id_A) is completely positive,…
Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…
We prove that finiteness of the index of the intersection of a finite set of finite index subalgebras in a von Neumann algebra (with small centre) is equivalent to the finite dimensionality of the algebra generated by the conditional…
In the paper the main attention is paid to conditions on algebras from a given variety which provide coincidence of their algebraic geometries. The main part here play the notions mentioned in the title of the paper.