Search arXiv⌕ Search

arXiv · math/0701172

On embeddings of proper and equicontinuous actions in zero-dimensional compactifications

Abstract

We provide a tool for studying properly discontinuous actions of non-compact groups on locally compact, connected and paracompact spaces, by embedding such an action in a suitable zero-dimensional compactification of the underlying space with pleasant properties. Precisely, given such an action $(G,X)$ we construct a zero-dimensional compactification $μX$ of $X$ with the properties: (a) there exists an extension of the action on $μX$, (b) if $μL\subseteq μX\setminus X$ is the set of the limit points of the orbits of the initial action in $μX$, then the restricted action $(G,μX\setminus μL)$ remains properly discontinuous, is indivisible and equicontinuous with respect to the uniformity induced on $μX\setminus μL$ by that of $μX$, and (c) $μX$ is the maximal among the zero-dimensional compactifications of $X$ with these properties. Proper actions are usually embedded in the end point compactification $εX$ of $X$, in order to obtain topological invariants concerning the cardinality of the space of the ends of $X$, provided that $X$ has an additional "nice" property of rather local character ("property Z", i.e., every compact subset of $X$ is contained in a compact and connected one). If the considered space has this property, our new compactification coincides with the end point one. On the other hand, we give an example of a space not having the "property Z" for which our compactification is different from the end point compactification. As an application, we show that the invariant concerning the cardinality of the ends of $X$ holds also for a class of actions strictly containing the properly discontinuous ones and for spaces not necessarily having "property Z".

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antonios Manoussos, Polychronis Strantzalos. 2007-01-05. On embeddings of proper and equicontinuous actions in zero-dimensional compactifications. https://arxiv.org/abs/math/0701172

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

KEEP EXPLORING

Related papers

A study for well-filtered spaces

In this paper, we focus on well-filtered spaces. By using the Rudin sets and WD sets, we obtain the following results: (1) The product of arbitrarily many Scott well-filtered dcpos is still well-filtered with respect to the Scott topology. Thus we give positive answers for two questions proposed by Xu and Zhao; (2) Let $P$ be a dcpo with $ΣK(P)$ being well-filtered and $Q$ an RB-domain. Then $ΣK(P\times Q)$ is well-filtered if $K(P\times Q)$ is a dcpo; (3) An intrinsic characterization of the $WD$ sets is given in terms of Scott open filters.

math.GN↗

Homogeneous linearly ordered spaces

Every compact subspace $K$ of a homogeneous generalized ordered (GO) space $X$ satisfies $χ(K)\leqω_1$ and $|K|\leq 2^{ω_1}$. If $χ(K)>ω$ for some such $K$, then $χ(X)=ω_1$ and $πχ(X)=ω$. We construct a homogeneous $σ$-compact linearly ordered topological space (LOTS) $\mathbf{H}$ with a compact subspace $K$ such that $χ(x,K)=ω_1$ for every $x\in K$ and $c(K)=w(K)=|K|=2^{ω_1}$, where $c(K)$ denotes cellularity. Thus both bounds are attained by the same compact space. Every semitopological group that is a GO space is hereditarily paracompact and has metrizable compact subspaces. If it is not a $P$-space, it is also first countable and submetrizable. A semitopological group that is a LOTS, or a topological group that is a GO space, is either metrizable or is a $P$-space. We also show that in an order-homogeneous LOTS every compact subset is first countable.

math.GN↗

Extending graph metrics to hyperspaces of vertex sets: optimization and reinforcement learning applications

An undirected connected graph can be interpreted as a metric space by considering the path distance between its vertices. Extending this perspective, we explore how walks in the graph, viewed as sequences of subsets of vertices $V$, fit into a more general framework where the path distance emerges as a special case of broader metrics that define hypertopologies on the space of subsets of $V$. In this paper, we propose a general framework to address this issue, motivated by the extension of recent reinforcement learning algorithms on graphs through Lipschitz function extensions. Our approach demonstrates how models for dynamical systems and related machine learning techniques can be adapted to (quasi-pseudo-metric) hyperspaces, offering a novel perspective for the analysis and modeling of dynamical systems. Finally, we illustrate the practical relevance of our theoretical contributions through a concrete graph optimization example, highlighting the utility and effectiveness of our proposed approach.

math.GN↗