Constructive Membership Testing in Classical Groups

Abstract

Let G be a perfect classical group defined over a finite field F and generated by a set of standard generators X. Let E be the image of an absolutely irreducible representation of G by matrices over a field of the natural characteristic. Given the image of X in E, we present algorithms that write an arbitrary element of E as a straight-line programme in this image of X in E. The algorithms run in polynomial time.