Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

A group G is called completely reducible if it is a direct product of simple groups. It is known that a Krull-Schmidt Remak type unicity for the decomposition in the direct product of simple groups hold. The proof s of this facts can be found for example in Chapter 3 of D. Robinson's book A Course in the Theory of Groups

My questions are the following:

  1. Are any known characterizations for finite completely reducible groups given in the literature? Given a finite group how can one decide whether the group is completely reducible or not?, of course without searching for direct product decompositions if possible.

  2. If one replaces the direct product decomposition with iterated crossed product decomposition is anything known about unicity in this case?

share|improve this question
    
Nothing else known about completely reducible groups? –  anonymus Mar 6 '11 at 9:33

1 Answer 1

up vote 2 down vote accepted

Well, it depends what you are prepared to accept as a reasonable answer. A finite group is completely reducible if and only if the intersection of all its maximal normal subgroups is trivial. This is presumably a lot of work to check for any reasonably sized group. On the other hand, you can regard the intersection of the maximal normal subgroups as a kind of "radical" of a finite group, and the above characterization seems reasonable. One (fairly obvious) fact to use in proving that a finite group is NOT completely reducible is that if G is completely reducible, then so are all its non-trivial normal subgroups. Checking minimal normal subgroups is no help here, of course.

share|improve this answer
    
Thank you very much for the answer! –  anonymus Apr 18 '11 at 11:34

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.