Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. On complete reducibility of tensor products of simple modules over simple algebraic groups
 
research article

On complete reducibility of tensor products of simple modules over simple algebraic groups

Gruber, Jonathan  
2021
Transactions of the American Mathematical Society, Series

Let G be a simply connected simple algebraic group over an al- gebraically closed field k of characteristic p > 0. The category of rationalG-modules is not semisimple. We consider the question of when the tensorproduct of two simple G-modules L(λ) and L(μ) is completely reducible. Using some technical results about weakly maximal vectors (i.e. maximal vectors for the action of the Frobenius kernel G1 of G) in tensor products, we obtain a reduction to the case where the highest weights λ and μ are p-restricted. In this case, we also prove that L(λ)⊗L(μ) is completely reducible as a G-module if and only if L(λ) ⊗ L(μ) is completely reducible as a G1 -module.

  • Details
  • Metrics
Type
research article
DOI
10.1090/btran/58
Author(s)
Gruber, Jonathan  
Date Issued

2021

Published in
Transactions of the American Mathematical Society, Series
Volume

B8

Issue

8

Start page

249

End page

276

Subjects

algebraic group

•

representation

•

semisimple

•

tensor product

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
GR-TES  
Available on Infoscience
July 25, 2023
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/199360
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés