This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| PSL(n,q) | |
|---|---|
| Name | Projective Special Linear Group |
| Notation | PSL(n,q) |
| Type | Finite simple group (often) |
| Parameters | n (integer ≥ 2), q (prime power) |
| Related | PGL, SL, GL, PSU, PSp, E8, Sporadic groups |
PSL(n,q)
PSL(n,q) is the projective special linear group derived from n×n matrices over the finite field of order q; it is central to the classification of finite simple groups and appears across algebraic geometry, combinatorics, and number theory. Originating from work on linear algebraic groups by Élie Cartan and Claude Chevalley, PSL(n,q) interrelates with groups studied by Galois and used in constructions by Klein, Dickson, and the authors of the Atlas of Finite Groups.
For integer n≥2 and prime power q, form the general linear group GL(n,q) of invertible n×n matrices over the finite field GF(q) studied by Galois and Évariste Galois. The subgroup SL(n,q) of matrices of determinant 1 was classically considered by Jordan and Cauchy; quotienting SL(n,q) by its center (scalar matrices) yields the projective special linear group, which generalizes projective transformations in the manner of Pappus of Alexandria and Desargues. Construction uses concepts from Chevalley groups, algebraic group theory as developed by Borel and Tits, and employs fields and automorphisms treated by Artin and Steinitz.
PSL(n,q) is a subgroup of the projective general linear group PGL(n,q) related to GL(n,q) as in the work of Dickson; its order equals |SL(n,q)| divided by gcd(n,q−1), a formula appearing in results by Burnside and Frobenius. The precise order is q^{n(n−1)/2} ∏_{i=2}^n (q^i−1)/g where g=gcd(n,q−1); these counting techniques mirror enumerations in combinatorics by Erdős and Rényi and rely on field counting from Stewart and Weil. For small parameters PSL(2,q) recovers groups intimately related to Ahlfors's and Poincaré's work on Möbius transformations and connects to classical groups like A5 for q=4 or 5 as noted by Galois and Lagrange.
For n≥2 and (n,q) not equal to exceptional small pairs, PSL(n,q) is simple, a theorem established in the classification program contributed to by Feit, Thompson, Gorenstein, and Aschbacher. Exceptional nonsimple cases occur at low ranks and small fields such as PSL(2,2) and PSL(2,3), which are isomorphic to symmetric and alternating groups studied by Cayley and Burnside; these exceptions link to historical examples like S_3 and A_4. Proofs use character theory as developed by Brauer and local analysis introduced by Brauer–Fowler and later refined in the Classification of Finite Simple Groups.
PSL(n,q) admits linear and permutation representations; permutation actions on projective (n−1)-space over GF(q) trace back to projective geometry of Pascal and Desargues, while linear representations feature in modular representation theory advanced by Green and Alperin. Actions on combinatorial structures like generalized polygons studied by Tits and designs investigated by Fisher and Erdős produce rank and primitive actions analyzed in work by Cameron and Higman. Representations over complex fields connect to character tables cataloged in the Atlas of Finite Groups and harmonic analysis approaches influenced by Brauer and Schur.
Maximal subgroups of PSL(n,q) include parabolic subgroups tied to flag stabilizers from the theory of Borel and Tits, classical subgroups isomorphic to other classical groups studied by Witt and Weyl, and almost simple subgroups related to sporadic groups cataloged by Conway and Thompson. Subgroup classification draws on geometric subgroup structure investigated by Aschbacher and on exceptional isomorphisms noticed by Dickson and Jordan–Hölder theory; computational work by authors of the Atlas of Finite Groups supplies many explicit subgroup lists. Maximal tori, unipotent radicals, and Levi complements feature in descriptions inspired by Cartan decomposition and root system analysis of Humphreys and Bourbaki.
PSL(n,q) connects to groups of Lie type such as PSU, PSp, and orthogonal groups studied by Chevalley and Steinberg, and it appears in the construction of sporadic groups as in discoveries by Griess and Fischer. Applications span coding theory influenced by Hamming, combinatorial designs from Kirkman and Steiner, cryptographic schemes building on ideas by Diffie and Hellman, and geometric constructions in algebraic geometry used by Grothendieck and Serre. PSL(n,q) also provides symmetry groups in finite incidence geometries examined by Buekenhout and is used in number-theoretic monodromy examples related to work by Deligne and Weil.
Category:Finite simple groups