Element orders and character codegrees. (Q658320): Difference between revisions

Let \(g\in G\), where \(G\) is an arbitrary finite group. Then there exists \(\chi\in\text{Irr}(G)\) such that \(\ker(\chi)\cap\langle g\rangle=1\) and every prime divisor of the order \(o(g)\) divides \(|G:\ker(\chi)|/|\chi(1)|\). This improves a result of \textit{G. Qian}, in which \(G\) was assumed to be solvable; [view Arch. Math. 97, No. 2, 99-103 (2011; Zbl 1232.20014)]. Moreover, the proof of Isaacs as to the general case as obtained here, is easier than Qian's proof of the solvable case, too.