Search arXivSearch

arXiv · 1705.01884

The structure of random homeomorphisms

Abstract

In order to understand the structure of the "typical" element of a homeomorphism group, one has to study how large the conjugacy classes of the group are. When typical means generic in the sense of Baire category, this is well understood, see e.g. the works of Glasner and Weiss, and Kechris and Rosendal. Following Dougherty and Mycielski we investigate the measure theoretic dual of this problem, using Christensen's notion of Haar null sets. When typical means random, that is, almost every with respect to this notion of Haar null sets, the behaviour of the homeomorphisms is entirely different from the generic case. For $\text{Homeo}^+([0,1])$ we describe the non-Haar null conjugacy classes and also show that their union is co-Haar null, for $\text{Homeo}^+(\mathbb{S}^1)$ we describe the non-Haar null conjugacy classes, and for $\mathcal{U}(\ell^2)$ we show that, apart from the classes of the multishifts, all conjugacy classes are Haar null. As an application we affirmatively answer the question whether these groups can be written as the union of a meagre and a Haar null set.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Udayan B. Darji, Márton Elekes, Kende Kalina, Viktor Kiss, Zoltán Vidnyánszky. 2018-08-16. The structure of random homeomorphisms. https://doi.org/10.1007/s11856-020-2001-4

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO