Let ϕ∈End(G) s.t. ∃n≥0,ker(ϕn)=G If kerϕ or [G:Inϕ] is finite, then G is finite.
Carla Murphy
Answered question
2022-01-12
Let
s.t.
If or is finite, then G is finite.
Answer & Explanation
psor32
Beginner2022-01-13Added 33 answers
Step 1
Assume that has finite kernel. Consider the map
.
It has finite kernel. So if it has finite range, it has finite domain. By induction, if is finite, so is every and in particular G.
If the image of has finite index, then has finite index in for all k. It follows that has finite index in G so that G is finite.
aquariump9
Beginner2022-01-14Added 40 answers
Step 1
For the case where is finite:
Note that if then
,
by the isomorphism theorems.
Now,
Thus, in particular,
So if is finite, then so is . Now proceed by induction to show that is finite.
If has finite index, we can proceed similarly. Note that for arbitrary H and K, we know that
So
So the also has finite index. Proceed by induction to conclude that G is finite.