SearcharxivSearch

arXiv · 2605.24379

On the complexity of extensions of non-archimedean Polish groups admitting a compatible complete left-invariant metric

Abstract

In this article, motivated by a problem asked by Allison and Panagiotopoulos, we study a problem concerning the complexity of group extensions within a hierarchy (denoted by $\alpha$-CLI and L-$\alpha$-CLI) on the class of non-archimedean CLI Polish groups: Given a non-archimedean Polish group $G$ and one of its closed normal subgroup $N$, suppose $N$ and $G/N$ are $\alpha$-CLI and $\beta$-CLI, respectively. Is $G$ always $(\alpha+\beta)$-CLI? We provide a positive answer under a certain additional assumption. We then construct two examples yielding negative answers: for each countably infinite ordinal $\alpha$, there exists a group $G$ that is not $\alpha$-CLI, but $G$ has a $1$-CLI normal subgroup $N$ such that $G/N$ is proper $\alpha$-CLI; there exists a proper $3$-CLI group $U$ that has an abelian normal subgroup $N$ such that $U/N$ is also abelian. These examples also provide negative answers to the original problem raised by Allison and Panagiotopoulos. Finally, we show that if $N$ and $G/N$ are $\alpha$-CLI and $\beta$-CLI with $\beta>0$, respectively, then $G$ is $\beta\cdot(\omega\cdot\alpha+1)$-CLI, which gives an upper bound on the complexity of the extended group.

Explore related subjects

Keep this discovery

BibTeXRIS

Longyun Ding, Xu Wang. 2026-05-23. On the complexity of extensions of non-archimedean Polish groups admitting a compatible complete left-invariant metric. https://arxiv.org/abs/2605.24379

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

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO