Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

In the question

Classifying the irreducible representations of $\mathbb{Z}/p\mathbb{Z}\rtimes \mathbb{Z}/n \mathbb{Z}$

the author is talking about irreducible representations of a semi-direct product. Does he mean representations over $\mathbb{C}, \mathbb{Z}, \mathbb{F}_p, \ldots$? Or would the way to construct them be the same?

I'm not sure if it is allowed to re-ask a question. If not. I'm sorry.

share|improve this question
1  
Over a field ofcharacteristic $p,$ the normal subgroup of order $p$ will act trivially, so you are looking at the irreducible representations of the cyclic group of order $n$. Over fields of other characteristics, one can proceed via Cliffords theorem in a reasonably uniform way, although when the characteristic divides $n$ the theory is a little different, but not too significantly. –  Geoff Robinson Jul 17 '12 at 18:04
    
The old answer is talking about $\mathbb{C}$, though the ideas can be applied more generally. –  Jack Schmidt Jul 17 '12 at 18:06
    
Are there more literature which refers to irred. representations of $\mathbb{Z}/p \mathbb{Z} \rtimes \mathbb{Z}/n \mathbb{Z}$ over $\mathbb{F}_q$ for a prime $q$? I could not find anything in the library. –  guest Jul 17 '12 at 18:15
    
guest look up modular representation theory. –  JSchlather Jul 17 '12 at 18:56
add comment

1 Answer

As Jack Schmidt said: "The old answer is talking about $\mathbb C$, though the ideas can be applied more generally."

(It seems this question has been answered in the comments; in order for the question to be marked as answered, I copied the answer above and made this CW.)

share|improve this answer
add comment

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.