Conjugation of injections by permutations

Abstract

Let X be a countably infinite set, and let f, g, and h be any three injective self-maps of X, each having at least one infinite cycle. (For instance, this holds if f, g, and h are not bijections.) We show that there are permutations a and b of X such that h=afa-1bgb-1 if and only if |X|+|X|=|X|. We also prove a version of this statement that holds for infinite sets X that are not necessarily countable. This generalizes results of Droste and Ore about permutations.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…