简单代数群上简单模张量积的完全可约性

J. Gruber
{"title":"简单代数群上简单模张量积的完全可约性","authors":"J. Gruber","doi":"10.1090/btran/58","DOIUrl":null,"url":null,"abstract":"<p>Let <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G\">\n <mml:semantics>\n <mml:mi>G</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">G</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> be a simply connected simple algebraic group over an algebraically closed field <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"k\">\n <mml:semantics>\n <mml:mi>k</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">k</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> of characteristic <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"p greater-than 0\">\n <mml:semantics>\n <mml:mrow>\n <mml:mi>p</mml:mi>\n <mml:mo>></mml:mo>\n <mml:mn>0</mml:mn>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">p>0</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>. The category of rational <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G\">\n <mml:semantics>\n <mml:mi>G</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">G</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>-modules is not semisimple. We consider the question of when the tensor product of two simple <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G\">\n <mml:semantics>\n <mml:mi>G</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">G</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>-modules <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper L left-parenthesis lamda right-parenthesis\">\n <mml:semantics>\n <mml:mrow>\n <mml:mi>L</mml:mi>\n <mml:mo stretchy=\"false\">(</mml:mo>\n <mml:mi>λ<!-- λ --></mml:mi>\n <mml:mo stretchy=\"false\">)</mml:mo>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">L(\\lambda )</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> and <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper L left-parenthesis mu right-parenthesis\">\n <mml:semantics>\n <mml:mrow>\n <mml:mi>L</mml:mi>\n <mml:mo stretchy=\"false\">(</mml:mo>\n <mml:mi>μ<!-- μ --></mml:mi>\n <mml:mo stretchy=\"false\">)</mml:mo>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">L(\\mu )</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> is completely reducible. Using some technical results about weakly maximal vectors (i.e. maximal vectors for the action of the Frobenius kernel <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G 1\">\n <mml:semantics>\n <mml:msub>\n <mml:mi>G</mml:mi>\n <mml:mn>1</mml:mn>\n </mml:msub>\n <mml:annotation encoding=\"application/x-tex\">G_1</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> of <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G\">\n <mml:semantics>\n <mml:mi>G</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">G</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>) in tensor products, we obtain a reduction to the case where the highest weights <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"lamda\">\n <mml:semantics>\n <mml:mi>λ<!-- λ --></mml:mi>\n <mml:annotation encoding=\"application/x-tex\">\\lambda</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> and <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"mu\">\n <mml:semantics>\n <mml:mi>μ<!-- μ --></mml:mi>\n <mml:annotation encoding=\"application/x-tex\">\\mu</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> are <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"p\">\n <mml:semantics>\n <mml:mi>p</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">p</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>-restricted. In this case, we also prove that <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper L left-parenthesis lamda right-parenthesis circled-times upper L left-parenthesis mu right-parenthesis\">\n <mml:semantics>\n <mml:mrow>\n <mml:mi>L</mml:mi>\n <mml:mo stretchy=\"false\">(</mml:mo>\n <mml:mi>λ<!-- λ --></mml:mi>\n <mml:mo stretchy=\"false\">)</mml:mo>\n <mml:mo>⊗<!-- ⊗ --></mml:mo>\n <mml:mi>L</mml:mi>\n <mml:mo stretchy=\"false\">(</mml:mo>\n <mml:mi>μ<!-- μ --></mml:mi>\n <mml:mo stretchy=\"false\">)</mml:mo>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">L(\\lambda )\\otimes L(\\mu )</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> is completely reducible as a <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G\">\n <mml:semantics>\n <mml:mi>G</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">G</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>-module if and only if <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper L left-parenthesis lamda right-parenthesis circled-times upper L left-parenthesis mu right-parenthesis\">\n <mml:semantics>\n <mml:mrow>\n <mml:mi>L</mml:mi>\n <mml:mo stretchy=\"false\">(</mml:mo>\n <mml:mi>λ<!-- λ --></mml:mi>\n <mml:mo stretchy=\"false\">)</mml:mo>\n <mml:mo>⊗<!-- ⊗ --></mml:mo>\n <mml:mi>L</mml:mi>\n <mml:mo stretchy=\"false\">(</mml:mo>\n <mml:mi>μ<!-- μ --></mml:mi>\n <mml:mo stretchy=\"false\">)</mml:mo>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">L(\\lambda )\\otimes L(\\mu )</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> is completely reducible as a <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G 1\">\n <mml:semantics>\n <mml:msub>\n <mml:mi>G</mml:mi>\n <mml:mn>1</mml:mn>\n </mml:msub>\n <mml:annotation encoding=\"application/x-tex\">G_1</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>-module.</p>","PeriodicalId":377306,"journal":{"name":"Transactions of the American Mathematical Society, Series B","volume":"181 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On complete reducibility of tensor products of simple modules over simple algebraic groups\",\"authors\":\"J. Gruber\",\"doi\":\"10.1090/btran/58\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Let <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G\\\">\\n <mml:semantics>\\n <mml:mi>G</mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">G</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula> be a simply connected simple algebraic group over an algebraically closed field <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"k\\\">\\n <mml:semantics>\\n <mml:mi>k</mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">k</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula> of characteristic <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"p greater-than 0\\\">\\n <mml:semantics>\\n <mml:mrow>\\n <mml:mi>p</mml:mi>\\n <mml:mo>></mml:mo>\\n <mml:mn>0</mml:mn>\\n </mml:mrow>\\n <mml:annotation encoding=\\\"application/x-tex\\\">p>0</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>. The category of rational <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G\\\">\\n <mml:semantics>\\n <mml:mi>G</mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">G</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>-modules is not semisimple. We consider the question of when the tensor product of two simple <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G\\\">\\n <mml:semantics>\\n <mml:mi>G</mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">G</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>-modules <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper L left-parenthesis lamda right-parenthesis\\\">\\n <mml:semantics>\\n <mml:mrow>\\n <mml:mi>L</mml:mi>\\n <mml:mo stretchy=\\\"false\\\">(</mml:mo>\\n <mml:mi>λ<!-- λ --></mml:mi>\\n <mml:mo stretchy=\\\"false\\\">)</mml:mo>\\n </mml:mrow>\\n <mml:annotation encoding=\\\"application/x-tex\\\">L(\\\\lambda )</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula> and <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper L left-parenthesis mu right-parenthesis\\\">\\n <mml:semantics>\\n <mml:mrow>\\n <mml:mi>L</mml:mi>\\n <mml:mo stretchy=\\\"false\\\">(</mml:mo>\\n <mml:mi>μ<!-- μ --></mml:mi>\\n <mml:mo stretchy=\\\"false\\\">)</mml:mo>\\n </mml:mrow>\\n <mml:annotation encoding=\\\"application/x-tex\\\">L(\\\\mu )</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula> is completely reducible. Using some technical results about weakly maximal vectors (i.e. maximal vectors for the action of the Frobenius kernel <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G 1\\\">\\n <mml:semantics>\\n <mml:msub>\\n <mml:mi>G</mml:mi>\\n <mml:mn>1</mml:mn>\\n </mml:msub>\\n <mml:annotation encoding=\\\"application/x-tex\\\">G_1</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula> of <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G\\\">\\n <mml:semantics>\\n <mml:mi>G</mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">G</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>) in tensor products, we obtain a reduction to the case where the highest weights <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"lamda\\\">\\n <mml:semantics>\\n <mml:mi>λ<!-- λ --></mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">\\\\lambda</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula> and <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"mu\\\">\\n <mml:semantics>\\n <mml:mi>μ<!-- μ --></mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">\\\\mu</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula> are <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"p\\\">\\n <mml:semantics>\\n <mml:mi>p</mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">p</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>-restricted. In this case, we also prove that <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper L left-parenthesis lamda right-parenthesis circled-times upper L left-parenthesis mu right-parenthesis\\\">\\n <mml:semantics>\\n <mml:mrow>\\n <mml:mi>L</mml:mi>\\n <mml:mo stretchy=\\\"false\\\">(</mml:mo>\\n <mml:mi>λ<!-- λ --></mml:mi>\\n <mml:mo stretchy=\\\"false\\\">)</mml:mo>\\n <mml:mo>⊗<!-- ⊗ --></mml:mo>\\n <mml:mi>L</mml:mi>\\n <mml:mo stretchy=\\\"false\\\">(</mml:mo>\\n <mml:mi>μ<!-- μ --></mml:mi>\\n <mml:mo stretchy=\\\"false\\\">)</mml:mo>\\n </mml:mrow>\\n <mml:annotation encoding=\\\"application/x-tex\\\">L(\\\\lambda )\\\\otimes L(\\\\mu )</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula> is completely reducible as a <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G\\\">\\n <mml:semantics>\\n <mml:mi>G</mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">G</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>-module if and only if <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper L left-parenthesis lamda right-parenthesis circled-times upper L left-parenthesis mu right-parenthesis\\\">\\n <mml:semantics>\\n <mml:mrow>\\n <mml:mi>L</mml:mi>\\n <mml:mo stretchy=\\\"false\\\">(</mml:mo>\\n <mml:mi>λ<!-- λ --></mml:mi>\\n <mml:mo stretchy=\\\"false\\\">)</mml:mo>\\n <mml:mo>⊗<!-- ⊗ --></mml:mo>\\n <mml:mi>L</mml:mi>\\n <mml:mo stretchy=\\\"false\\\">(</mml:mo>\\n <mml:mi>μ<!-- μ --></mml:mi>\\n <mml:mo stretchy=\\\"false\\\">)</mml:mo>\\n </mml:mrow>\\n <mml:annotation encoding=\\\"application/x-tex\\\">L(\\\\lambda )\\\\otimes L(\\\\mu )</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula> is completely reducible as a <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G 1\\\">\\n <mml:semantics>\\n <mml:msub>\\n <mml:mi>G</mml:mi>\\n <mml:mn>1</mml:mn>\\n </mml:msub>\\n <mml:annotation encoding=\\\"application/x-tex\\\">G_1</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>-module.</p>\",\"PeriodicalId\":377306,\"journal\":{\"name\":\"Transactions of the American Mathematical Society, Series B\",\"volume\":\"181 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions of the American Mathematical Society, Series B\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/btran/58\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions of the American Mathematical Society, Series B","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/btran/58","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

设G G是特征为p>0的代数闭域k k上的一个单连通简单代数群。有理G -模的范畴不是半简单的。研究两个简单G -模L(λ) L(\lambda)和L(μ) L(\mu)的张量积何时是完全可约的问题。利用张量积中弱极大向量(即G G的Frobenius核g1 G_1作用的极大向量)的一些技术结果,我们得到了最高权值λ \lambda和μ \mu受p p限制的情形的约简。在这种情况下,我们还证明了L(λ)⊗L(μ) L(\lambda) \otimes L(\mu)是G G -模完全可约的当且仅当L(λ)⊗L(μ) L(\lambda) \otimes L(\mu)是G 1 G_1 -模完全可约。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On complete reducibility of tensor products of simple modules over simple algebraic groups

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

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.70
自引率
0.00%
发文量
0
期刊最新文献
Duality theorems for curves over local fields Density of continuous functions in Sobolev spaces with applications to capacity 𝐶⁰-limits of Legendrian knots Multiple orthogonal polynomials, 𝑑-orthogonal polynomials, production matrices, and branched continued fractions Closed 𝑘-Schur Katalan functions as 𝐾-homology Schubert representatives of the affine Grassmannian
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1