Conjugation of injections by permutations. (Q711605)

Let \(\Omega\) be a countably infinite set, \(\text{Inj}(\Omega)\) the monoid of all injective endomaps of \(\Omega\), and \(\text{Sym}(\Omega)\) the group of all permutations of \(\Omega\). A map \(f\in\text{Inj}(\Omega)\) is said to have an infinite cycle if there exists \(\alpha\in\Omega\) such that \(\alpha\neq(\alpha)f^i\) for all positive integers \(i\). The main theorem proves that for any three elements \(f,g,h\in\text{Inj}(\Omega)\), each having at least one infinite cycle, there exist permutations \(a,b\in\text{Sym}(\Omega)\) such that \(h=afa^{-1}bgb^{-1}\) if and only if \(|\Omega\setminus(\Omega)f|+|\Omega\setminus(\Omega)g|=|\Omega\setminus(\Omega)h|\). This result is generalized to arbitrary infinite sets \(\Omega\) that are not necessarily countable. As a consequence of the main theorem, the following generalization of Ore's Theorem is obtained: an element \(h\in\text{Inj}(\Omega)\) can be expressed in the form \(h=afa^{-1}bfb^{-1}\), for some \(f\in\text{Inj}(\Omega)\) and \(a,b\in\text{Sym}(\Omega)\), if and only if \(|\Omega\setminus(\Omega)h|\) is either an even integer or infinite.