Searcharxiv⌕ Search

arXiv subjects

Jarosław Swaczyna

Publications and source records attributed to Jarosław Swaczyna.

13 recordsLinked to original sources

Bourgain-uo sequential completeness in vector lattices

We revisit Bourgain's 1981 counterexample to the sequential completeness of the `pointwise plus domination' convergence on $\ell_1$ from the perspective of vector lattices. In this setting, we show that for sequences the associated notion of Bourgain--uo convergence coincides with ordinary order convergence. Motivated by Bourgain's construction, we introduce a strengthened, subsequence-invariant notion of Cauchy sequence: a sequence $(x_n)$ in a vector lattice $E$ is called Buo-Cauchy if for every strictly increasing sequence $(n_k)$ the differences $x_{n_{k+1}}-x_{n_k}$ converge to $0$ in order in $E$. We first show that sequential Buo-completeness forces $σ$-order completeness. Thus every non-$σ$-order complete vector lattice fails sequential \Buo-completeness. In particular, free Banach lattices $\mathrm{FBL}(E)$ are not sequentially Buo-complete whenever $\dim E>1$. On the positive side, we prove that the classical sequence lattices $c_0$ and $\ell_\infty$ are sequentially Buo-complete: every Buo-Cauchy sequence converges in order, and hence in the Buo sense. Finally, we obtain a sharp metric characterisation for bounded Lipschitz function lattices: the vector lattice $\mathrm{Lip}_b(X)$ of bounded Lipschitz functions on a metric space $(X,d)$ is sequentially Buo-complete if and only if $X$ is uniformly discrete.

math.FA↗

Infinite random graphs

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of points are all equal. We give examples of such generalized random graphs, and show that the class of graphs under consideration has a two-element basis.

math.CO↗

Zoo of ideal Schauder basis

We investigate the notion of filter (equivalently: ideal) Schauder basis of a Banach space. We do so by providing bunch of new examples of such bases that are not the standard ones, especially within classical Banach spaces ($\ell_p$, $c_0$, James' space). Those examples lead to distinguishing and characterizing filters (equivalently: ideals) in terms of Schauder bases. We investigate the relationship between possibly basic sequences and filters (equivalently: ideals) on the set of natural numbers.

math.FA↗

The $π$-property of a Banach space along a filter

We examine the analyticity of the class of separable Banach spaces possessing the $π$-property, defined in terms of convergence along a filter. Our results establish that this class is $Σ^1_3$ whenever the underlying filter is analytic (as a subset of the Cantor set $Δ$). Furthermore, we demonstrate that if the filter is countably generated, the class of such spaces is $Σ^1_2$ with respect to any admissible Polish topology on the family of closed subspaces of $C(Δ)$.

math.FA↗

How to get the random graph with non-uniform probabilities?

The Rado Graph, sometimes also known as the (countable) Random Graph, can be generated almost surely by putting an edge between any pair of vertices with some fixed probability $p \in (0, 1)$, independently of other pairs. In this article, we study the influence of allowing different probabilities for each pair of vertices. More specifically, we characterize for which sequences $(p_n)_{n\in \mathbb{N}}$ of values in $[0, 1]$ there exists a bijection f from pairs of vertices in $\mathbb{N}$ to $\mathbb{N}$ such that if we put an edge between $v$ and $w$ with probability $p_{f(\{v,w\})}$, independently of other pairs, then the Random Graph arises almost surely.

math.CO↗

Free group of Hamel functions

We construct a free group of continuum many generators among those autobijections of $\mathbb{R}$ which are also Hamel bases of $\mathbb{R}^2$, with identity function included. We also observe two new cases when a real function is a composition of two real functions which are Hamel bases of $\mathbb{R}^2$.

math.GR↗

Continuity of coordinate functionals of filter bases in Banach spaces

We prove that the coordinate functionals associated with filter bases in Banach spaces are continuous as long as the underlying filter is analytic. This removes the large-cardinal hypothesis from the result established by the two last-named authors ([Bull. Lond. Math. Soc. 53 (2021)]) at the expense of reducing the generality from projective to analytic. In particular, we obtain a ZFC solution to Kadets' problem of continuity of coordinate functionals associated with bases with respect to the filter of statistical convergence. Even though the automatic continuity of coordinate functionals beyond the projective class remains a mystery, we prove that a basis with respect to an arbitrary filter that has continuous coordinate functionals is also a basis with respect to a filter that is analytic.

math.FA↗

Large cardinals and continuity of coordinate functionals of filter bases in Banach spaces

Assuming the existence of certain large cardinal numbers, we prove that for every projective filter $\mathscr F$ over the set of natural numbers, $\mathscr{F}$-bases in Banach spaces have continuous coordinate functionals. In particular, this applies to the filter of statistical convergence, thereby we solve a problem by V. Kadets (at least under the presence of certain large cardinals). In this setting, we recover also a result of Kochanek who proved continuity of coordinate functionals for countably generated filters (Studia Math., 2012).

math.FA↗

Haar-$\mathcal I$ sets: looking at small sets in Polish groups through compact glasses

Generalizing Christensen's notion of a Haar-null set and Darji's notion of a Haar-meager set, we introduce and study the notion of a Haar-$\mathcal I$ set in a Polish group. Here $\mathcal I$ is an ideal of subsets of some compact metrizable space $K$. A Borel subset $B\subset X$ of a Polish group $X$ is called Haar-$\mathcal I$ if there exists a continuous map $f:K\to X$ such that $f^{-1}(B+x)\in\mathcal I$ for all $x\in X$. Moreover, $B$ is generically Haar-$\mathcal I$ if the set of witness functions $\{f\in C(K,X):\forall x\in X\;\;f^{-1}(B+x)\in\mathcal I\}$ is comeager in the function space $C(K,X)$. We study (generically) Haar-$\mathcal I$ sets in Polish groups for many concrete and abstract ideals $\mathcal I$, and construct the corresponding distinguishing examples. We prove some results on Borel hull of Haar-$\mathcal I$ sets, generalizing results of Solecki, Elekes, Vidnyánszky, Doležal, Vlasǎk on Borel hulls of Haar-null and Haar-meager sets. Also we establish various Steinhaus properties of the families of (generically) Haar-$\mathcal I$ sets in Polish groups for various ideals $\mathcal I$.

math.GN↗

Properties of simple density ideals

Let $G$ consist of all functions $g \colon ω\to [0,\infty)$ with $g(n) \to \infty$ and $\frac{n}{g(n)} \nrightarrow 0$. Then for each $g\in G$ the family $\mathcal{Z}_g=\{A\subseteqω:\ \lim_{n\to\infty}\frac{\text{card}(A\cap n)}{g(n)}=0\}$ is an ideal associated to the notion of so-called upper density of weight $g$. Although those ideals have recently been extensively studied, they do not have their own name. In this paper, for Reader's convenience, we propose to call them simple density ideals. We show that there are $\mathfrak{c}$ many non-isomorphic (in fact even incomparable with respect to Katětov order) simple density ideals. Moreover, we prove that for a given $A\subset G$ with $\text{card}(A)<\mathfrak{b}$ one can construct a family of cardinality $\mathfrak{c}$ of pairwise incomparable (with respect to inclusion) simple density ideals which additionally are incomparable with all $\mathcal{Z}_g$ for $g\in A$. We show that this cannot be generalized to Katětov order as the ideal $\mathcal{Z}$ of sets of asymptotic density zero is maximal in the sense of Katětov order among all simple density ideals. We examine how many substantially different functions $g$ can generate the same ideal $\mathcal{Z}_g$ -- it turns out that the answer is either $1$ or $\mathfrak{c}$ (depending on $g$).

math.FA↗

Connectedness of attractors of a certain family of IFSs

Let $X$ be a Banach space and $f,g:X\rightarrow X$ be contractions. We investigate the set $$ C_{f,g}:=\{w\in X:\m{ the attractor of IFS }\F_w=\{f,g+w\}\m{ is connected}\}. $$ The motivation for our research comes from papers of Mihail and Miculescu, where it was shown that $C_{f,g}$ is a countable union of compact sets, provided $f,g$ are linear bounded operators with $\pa f\pa,\pa g\pa<1$ and such that $f$ is compact. Moreover, in the case when $X$ is finitely dimensional, such sets have been intensively investigated in the last years, especially when $f$ and $g$ are affine maps. As we will be mostly interested in infinite dimensional spaces, our results can be also viewed as a next step into extending of such studies into infinite dimensional setting. In particular, unlike in the finitely dimensional case, if $X$ has infinite dimension then $C_{f,g}$ is very small set (at least nowhere dense) provided $f,g$ satisfy some natural conditions.

math.DS↗

A code space for a generalized IFS

We study the concept of a code (or shift) space for a generalized iterated function system (GIFS in short). We prove that relations between GIFSs and their code spaces are analogous to the case of classical IFSs. As an application, we consider the problem of connectedness of attractors of GIFSs. Many of our results are strengthenings of the ones proved recently by Mihail, Miculescu and Secelean, but some are completely new.

math.GT↗