SearcharxivSearch

arXiv · 1807.04992

Groups with irreducibly unfaithful subsets for unitary representations

Abstract

Let $G$ be a group. A subset $F \subset G$ is called irreducibly faithful if there exists an irreducible unitary representation $\pi$ of $G$ such that $\pi(x) \neq \mathrm{id}$ for all $x \in F \smallsetminus \{e\}$. Otherwise $F$ is called irreducibly unfaithful. Given a positive integer $n$, we say that $G$ has Property $P(n)$ if every subset of size $n$ is irreducibly faithful. Every group has $P(1)$, by a classical result of Gelfand and Raikov. Walter proved that every group has $P(2)$. It is easy to see that some groups do not have $P(3)$. We provide a complete description of the irreducibly unfaithful subsets of size $n$ in a countable group $G$ (finite or infinite) with Property $P(n-1)$: it turns out that such a subset is contained in a finite elementary abelian normal subgroup of $G$ of a particular kind. We deduce a characterization of Property $P(n)$ purely in terms of the group structure. It follows that, if a countable group $G$ has $P(n-1)$ and does not have $P(n)$, then $n$ is the cardinality of a projective space over a finite field. A group $G$ has Property $Q(n)$ if, for every subset $F \subset G$ of size at most $n$, there exists an irreducible unitary representation $\pi$ of $G$ such that $\pi(x) \ne \pi(y)$ for any distinct $x, y$ in $F$. Every group has $Q(2)$. For countable groups, it is shown that Property $Q(3)$ is equivalent to $P(3)$, Property $Q(4)$ to $P(6)$, and Property $Q(5)$ to $P(9)$. For $m, n \ge 4$, the relation between Properties $P(m)$ and $Q(n)$ is closely related to a well-documented open problem in additive combinatorics.

Explore related subjects

Keep this discovery

BibTeXRIS

Pierre-Emmanuel Caprace, Pierre de la Harpe. 2018-07-13. Groups with irreducibly unfaithful subsets for unitary representations. https://arxiv.org/abs/1807.04992

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR