What is the defining property of reductive groups and why are they important?












9












$begingroup$


Having read (skimmed more like) many surveys of the Langlands Program and similar, it seems the related ideas apply exclusively to groups that are "reductive".



But nowhere, either in these surveys or elsewhere, have I been able to find a simple and compelling definition of what it means for a group to be reductive and why this property is important and why Langlands was naturally led to frame his conjectures for them and not, say, for any group.



Any suggestions or links?










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    For me, the most characteristic feature to remember is that reductive groups are quotients of a product of a torus and a semisimple group by a finite central subgroup.
    $endgroup$
    – მამუკა ჯიბლაძე
    11 hours ago








  • 1




    $begingroup$
    See also mathoverflow.net/questions/223584/….
    $endgroup$
    – Guntram
    6 hours ago










  • $begingroup$
    For me, a striking feature of reductive groups is that reductive groups over (any) algebraically closed field are classified by root data - a purely combinatorial structure (the same data also classifies compact Lie groups). This gives the subject a highly structured and combinatorial flavour. In particular, the Langlands dual reductive group (which plays a key role in the Langlands program) is defined in terms of the root data.
    $endgroup$
    – Sam Gunningham
    2 hours ago
















9












$begingroup$


Having read (skimmed more like) many surveys of the Langlands Program and similar, it seems the related ideas apply exclusively to groups that are "reductive".



But nowhere, either in these surveys or elsewhere, have I been able to find a simple and compelling definition of what it means for a group to be reductive and why this property is important and why Langlands was naturally led to frame his conjectures for them and not, say, for any group.



Any suggestions or links?










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    For me, the most characteristic feature to remember is that reductive groups are quotients of a product of a torus and a semisimple group by a finite central subgroup.
    $endgroup$
    – მამუკა ჯიბლაძე
    11 hours ago








  • 1




    $begingroup$
    See also mathoverflow.net/questions/223584/….
    $endgroup$
    – Guntram
    6 hours ago










  • $begingroup$
    For me, a striking feature of reductive groups is that reductive groups over (any) algebraically closed field are classified by root data - a purely combinatorial structure (the same data also classifies compact Lie groups). This gives the subject a highly structured and combinatorial flavour. In particular, the Langlands dual reductive group (which plays a key role in the Langlands program) is defined in terms of the root data.
    $endgroup$
    – Sam Gunningham
    2 hours ago














9












9








9


5



$begingroup$


Having read (skimmed more like) many surveys of the Langlands Program and similar, it seems the related ideas apply exclusively to groups that are "reductive".



But nowhere, either in these surveys or elsewhere, have I been able to find a simple and compelling definition of what it means for a group to be reductive and why this property is important and why Langlands was naturally led to frame his conjectures for them and not, say, for any group.



Any suggestions or links?










share|cite|improve this question











$endgroup$




Having read (skimmed more like) many surveys of the Langlands Program and similar, it seems the related ideas apply exclusively to groups that are "reductive".



But nowhere, either in these surveys or elsewhere, have I been able to find a simple and compelling definition of what it means for a group to be reductive and why this property is important and why Langlands was naturally led to frame his conjectures for them and not, say, for any group.



Any suggestions or links?







gr.group-theory algebraic-groups reductive-groups






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 15 hours ago









Martin Sleziak

2,96532028




2,96532028










asked 17 hours ago









John R RamsdenJohn R Ramsden

906515




906515








  • 2




    $begingroup$
    For me, the most characteristic feature to remember is that reductive groups are quotients of a product of a torus and a semisimple group by a finite central subgroup.
    $endgroup$
    – მამუკა ჯიბლაძე
    11 hours ago








  • 1




    $begingroup$
    See also mathoverflow.net/questions/223584/….
    $endgroup$
    – Guntram
    6 hours ago










  • $begingroup$
    For me, a striking feature of reductive groups is that reductive groups over (any) algebraically closed field are classified by root data - a purely combinatorial structure (the same data also classifies compact Lie groups). This gives the subject a highly structured and combinatorial flavour. In particular, the Langlands dual reductive group (which plays a key role in the Langlands program) is defined in terms of the root data.
    $endgroup$
    – Sam Gunningham
    2 hours ago














  • 2




    $begingroup$
    For me, the most characteristic feature to remember is that reductive groups are quotients of a product of a torus and a semisimple group by a finite central subgroup.
    $endgroup$
    – მამუკა ჯიბლაძე
    11 hours ago








  • 1




    $begingroup$
    See also mathoverflow.net/questions/223584/….
    $endgroup$
    – Guntram
    6 hours ago










  • $begingroup$
    For me, a striking feature of reductive groups is that reductive groups over (any) algebraically closed field are classified by root data - a purely combinatorial structure (the same data also classifies compact Lie groups). This gives the subject a highly structured and combinatorial flavour. In particular, the Langlands dual reductive group (which plays a key role in the Langlands program) is defined in terms of the root data.
    $endgroup$
    – Sam Gunningham
    2 hours ago








2




2




$begingroup$
For me, the most characteristic feature to remember is that reductive groups are quotients of a product of a torus and a semisimple group by a finite central subgroup.
$endgroup$
– მამუკა ჯიბლაძე
11 hours ago






$begingroup$
For me, the most characteristic feature to remember is that reductive groups are quotients of a product of a torus and a semisimple group by a finite central subgroup.
$endgroup$
– მამუკა ჯიბლაძე
11 hours ago






1




1




$begingroup$
See also mathoverflow.net/questions/223584/….
$endgroup$
– Guntram
6 hours ago




$begingroup$
See also mathoverflow.net/questions/223584/….
$endgroup$
– Guntram
6 hours ago












$begingroup$
For me, a striking feature of reductive groups is that reductive groups over (any) algebraically closed field are classified by root data - a purely combinatorial structure (the same data also classifies compact Lie groups). This gives the subject a highly structured and combinatorial flavour. In particular, the Langlands dual reductive group (which plays a key role in the Langlands program) is defined in terms of the root data.
$endgroup$
– Sam Gunningham
2 hours ago




$begingroup$
For me, a striking feature of reductive groups is that reductive groups over (any) algebraically closed field are classified by root data - a purely combinatorial structure (the same data also classifies compact Lie groups). This gives the subject a highly structured and combinatorial flavour. In particular, the Langlands dual reductive group (which plays a key role in the Langlands program) is defined in terms of the root data.
$endgroup$
– Sam Gunningham
2 hours ago










2 Answers
2






active

oldest

votes


















7












$begingroup$

For algebraic groups over $mathbb{C}$, we have the following deep theorem of Cartan, Chevalley and Mostow describing concretely the reductive groups:



For an algebraic subgroup $G$ of $mathrm{GL}_n(mathbb{C})$, the following conditions are equivalent:





  1. $G$ is reductive.


  2. $G$ has a subgroup $K$ which is compact for the usual topology, and Zariski-dense in $G$.


  3. $G$ is conjugate to a subgroup of $mathrm{GL}_n(mathbb{C})$ which is self-adjoint, that is stable under $g mapsto g^* := overline{g}^T$.


The basic examples to have in mind: $mathrm{GL}_n(mathbb{C})$ and $mathrm{SL}_n(mathbb{C})$ are reductive, while the subgroup of upper-triangular matrices is not reductive (when $n geq 2$).



As Ben McKay explained, a complex algebraic group is reductive if and only if all its algebraic representations are semi-simple.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Is there a relationship between this self-adjointness criterion and Hilbert-Polya's conjecture ?
    $endgroup$
    – Sylvain JULIEN
    14 hours ago






  • 1




    $begingroup$
    @SylvainJULIEN I don't think so: the Riemann zeta function is associated to the trivial automorphic representation of $mathrm{GL}_1$, and self-adjointness is rather trivial in this case.
    $endgroup$
    – François Brunault
    13 hours ago



















5












$begingroup$

A linear algebraic group is unipotent if it consists entirely of unipotent linear transformations, i.e. $I+N$ with $N$ nilpotent.
A linear algebraic group is reductive if its unipotent radical is trivial, or equivalently if it has no connected normal unipotent abelian subgroup except ${I}$.
See Armand Borel, Linear Algebraic Groups, p. 158.



But the essential idea is that a reductive group (over the complex numbers) has all finite dimensional representations completely reducible, so behaves like a finite group.



A motivating example: the matrices $begin{pmatrix}1&x\0&1end{pmatrix}$ form a group of matrices acting on the plane, preserving the vertical axis, but not any complementary line. So this is not reductive. A linear algebraic group is reductive if it has no normal subgroups like this. Clearly such a subgroup gets in the way of having all representations completely reducible.



Another: the group $GL(2)$ of all $2 times 2$ complex matrices is reductive, because it contains the unitary group $U(2)$, which is compact (so behaves like a finite group), as a Zariski dense subgroup, i.e. any holomorphic function $f$ defined on an open set $W subset GL(2)$ with $W cap U(2) ne emptyset$, and vanishing on that intersect, vanishes. So holomorphic representations of $GL(2)$ determine and are determined by continuous representations of $U(2)$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    The definition should be "has no non-trivial connected normal unipotent subgroup".
    $endgroup$
    – spin
    15 hours ago










  • $begingroup$
    @spin: thanks; corrected.
    $endgroup$
    – Ben McKay
    15 hours ago










  • $begingroup$
    You still need to add the normal assumption to the definition. Reductive groups do have non-trivial connected abelian unipotent subgroups. The root subgroups are such. They're just not normal.
    $endgroup$
    – Jay Taylor
    13 hours ago











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "504"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f321096%2fwhat-is-the-defining-property-of-reductive-groups-and-why-are-they-important%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









7












$begingroup$

For algebraic groups over $mathbb{C}$, we have the following deep theorem of Cartan, Chevalley and Mostow describing concretely the reductive groups:



For an algebraic subgroup $G$ of $mathrm{GL}_n(mathbb{C})$, the following conditions are equivalent:





  1. $G$ is reductive.


  2. $G$ has a subgroup $K$ which is compact for the usual topology, and Zariski-dense in $G$.


  3. $G$ is conjugate to a subgroup of $mathrm{GL}_n(mathbb{C})$ which is self-adjoint, that is stable under $g mapsto g^* := overline{g}^T$.


The basic examples to have in mind: $mathrm{GL}_n(mathbb{C})$ and $mathrm{SL}_n(mathbb{C})$ are reductive, while the subgroup of upper-triangular matrices is not reductive (when $n geq 2$).



As Ben McKay explained, a complex algebraic group is reductive if and only if all its algebraic representations are semi-simple.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Is there a relationship between this self-adjointness criterion and Hilbert-Polya's conjecture ?
    $endgroup$
    – Sylvain JULIEN
    14 hours ago






  • 1




    $begingroup$
    @SylvainJULIEN I don't think so: the Riemann zeta function is associated to the trivial automorphic representation of $mathrm{GL}_1$, and self-adjointness is rather trivial in this case.
    $endgroup$
    – François Brunault
    13 hours ago
















7












$begingroup$

For algebraic groups over $mathbb{C}$, we have the following deep theorem of Cartan, Chevalley and Mostow describing concretely the reductive groups:



For an algebraic subgroup $G$ of $mathrm{GL}_n(mathbb{C})$, the following conditions are equivalent:





  1. $G$ is reductive.


  2. $G$ has a subgroup $K$ which is compact for the usual topology, and Zariski-dense in $G$.


  3. $G$ is conjugate to a subgroup of $mathrm{GL}_n(mathbb{C})$ which is self-adjoint, that is stable under $g mapsto g^* := overline{g}^T$.


The basic examples to have in mind: $mathrm{GL}_n(mathbb{C})$ and $mathrm{SL}_n(mathbb{C})$ are reductive, while the subgroup of upper-triangular matrices is not reductive (when $n geq 2$).



As Ben McKay explained, a complex algebraic group is reductive if and only if all its algebraic representations are semi-simple.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Is there a relationship between this self-adjointness criterion and Hilbert-Polya's conjecture ?
    $endgroup$
    – Sylvain JULIEN
    14 hours ago






  • 1




    $begingroup$
    @SylvainJULIEN I don't think so: the Riemann zeta function is associated to the trivial automorphic representation of $mathrm{GL}_1$, and self-adjointness is rather trivial in this case.
    $endgroup$
    – François Brunault
    13 hours ago














7












7








7





$begingroup$

For algebraic groups over $mathbb{C}$, we have the following deep theorem of Cartan, Chevalley and Mostow describing concretely the reductive groups:



For an algebraic subgroup $G$ of $mathrm{GL}_n(mathbb{C})$, the following conditions are equivalent:





  1. $G$ is reductive.


  2. $G$ has a subgroup $K$ which is compact for the usual topology, and Zariski-dense in $G$.


  3. $G$ is conjugate to a subgroup of $mathrm{GL}_n(mathbb{C})$ which is self-adjoint, that is stable under $g mapsto g^* := overline{g}^T$.


The basic examples to have in mind: $mathrm{GL}_n(mathbb{C})$ and $mathrm{SL}_n(mathbb{C})$ are reductive, while the subgroup of upper-triangular matrices is not reductive (when $n geq 2$).



As Ben McKay explained, a complex algebraic group is reductive if and only if all its algebraic representations are semi-simple.






share|cite|improve this answer









$endgroup$



For algebraic groups over $mathbb{C}$, we have the following deep theorem of Cartan, Chevalley and Mostow describing concretely the reductive groups:



For an algebraic subgroup $G$ of $mathrm{GL}_n(mathbb{C})$, the following conditions are equivalent:





  1. $G$ is reductive.


  2. $G$ has a subgroup $K$ which is compact for the usual topology, and Zariski-dense in $G$.


  3. $G$ is conjugate to a subgroup of $mathrm{GL}_n(mathbb{C})$ which is self-adjoint, that is stable under $g mapsto g^* := overline{g}^T$.


The basic examples to have in mind: $mathrm{GL}_n(mathbb{C})$ and $mathrm{SL}_n(mathbb{C})$ are reductive, while the subgroup of upper-triangular matrices is not reductive (when $n geq 2$).



As Ben McKay explained, a complex algebraic group is reductive if and only if all its algebraic representations are semi-simple.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 14 hours ago









François BrunaultFrançois Brunault

12.9k23569




12.9k23569












  • $begingroup$
    Is there a relationship between this self-adjointness criterion and Hilbert-Polya's conjecture ?
    $endgroup$
    – Sylvain JULIEN
    14 hours ago






  • 1




    $begingroup$
    @SylvainJULIEN I don't think so: the Riemann zeta function is associated to the trivial automorphic representation of $mathrm{GL}_1$, and self-adjointness is rather trivial in this case.
    $endgroup$
    – François Brunault
    13 hours ago


















  • $begingroup$
    Is there a relationship between this self-adjointness criterion and Hilbert-Polya's conjecture ?
    $endgroup$
    – Sylvain JULIEN
    14 hours ago






  • 1




    $begingroup$
    @SylvainJULIEN I don't think so: the Riemann zeta function is associated to the trivial automorphic representation of $mathrm{GL}_1$, and self-adjointness is rather trivial in this case.
    $endgroup$
    – François Brunault
    13 hours ago
















$begingroup$
Is there a relationship between this self-adjointness criterion and Hilbert-Polya's conjecture ?
$endgroup$
– Sylvain JULIEN
14 hours ago




$begingroup$
Is there a relationship between this self-adjointness criterion and Hilbert-Polya's conjecture ?
$endgroup$
– Sylvain JULIEN
14 hours ago




1




1




$begingroup$
@SylvainJULIEN I don't think so: the Riemann zeta function is associated to the trivial automorphic representation of $mathrm{GL}_1$, and self-adjointness is rather trivial in this case.
$endgroup$
– François Brunault
13 hours ago




$begingroup$
@SylvainJULIEN I don't think so: the Riemann zeta function is associated to the trivial automorphic representation of $mathrm{GL}_1$, and self-adjointness is rather trivial in this case.
$endgroup$
– François Brunault
13 hours ago











5












$begingroup$

A linear algebraic group is unipotent if it consists entirely of unipotent linear transformations, i.e. $I+N$ with $N$ nilpotent.
A linear algebraic group is reductive if its unipotent radical is trivial, or equivalently if it has no connected normal unipotent abelian subgroup except ${I}$.
See Armand Borel, Linear Algebraic Groups, p. 158.



But the essential idea is that a reductive group (over the complex numbers) has all finite dimensional representations completely reducible, so behaves like a finite group.



A motivating example: the matrices $begin{pmatrix}1&x\0&1end{pmatrix}$ form a group of matrices acting on the plane, preserving the vertical axis, but not any complementary line. So this is not reductive. A linear algebraic group is reductive if it has no normal subgroups like this. Clearly such a subgroup gets in the way of having all representations completely reducible.



Another: the group $GL(2)$ of all $2 times 2$ complex matrices is reductive, because it contains the unitary group $U(2)$, which is compact (so behaves like a finite group), as a Zariski dense subgroup, i.e. any holomorphic function $f$ defined on an open set $W subset GL(2)$ with $W cap U(2) ne emptyset$, and vanishing on that intersect, vanishes. So holomorphic representations of $GL(2)$ determine and are determined by continuous representations of $U(2)$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    The definition should be "has no non-trivial connected normal unipotent subgroup".
    $endgroup$
    – spin
    15 hours ago










  • $begingroup$
    @spin: thanks; corrected.
    $endgroup$
    – Ben McKay
    15 hours ago










  • $begingroup$
    You still need to add the normal assumption to the definition. Reductive groups do have non-trivial connected abelian unipotent subgroups. The root subgroups are such. They're just not normal.
    $endgroup$
    – Jay Taylor
    13 hours ago
















5












$begingroup$

A linear algebraic group is unipotent if it consists entirely of unipotent linear transformations, i.e. $I+N$ with $N$ nilpotent.
A linear algebraic group is reductive if its unipotent radical is trivial, or equivalently if it has no connected normal unipotent abelian subgroup except ${I}$.
See Armand Borel, Linear Algebraic Groups, p. 158.



But the essential idea is that a reductive group (over the complex numbers) has all finite dimensional representations completely reducible, so behaves like a finite group.



A motivating example: the matrices $begin{pmatrix}1&x\0&1end{pmatrix}$ form a group of matrices acting on the plane, preserving the vertical axis, but not any complementary line. So this is not reductive. A linear algebraic group is reductive if it has no normal subgroups like this. Clearly such a subgroup gets in the way of having all representations completely reducible.



Another: the group $GL(2)$ of all $2 times 2$ complex matrices is reductive, because it contains the unitary group $U(2)$, which is compact (so behaves like a finite group), as a Zariski dense subgroup, i.e. any holomorphic function $f$ defined on an open set $W subset GL(2)$ with $W cap U(2) ne emptyset$, and vanishing on that intersect, vanishes. So holomorphic representations of $GL(2)$ determine and are determined by continuous representations of $U(2)$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    The definition should be "has no non-trivial connected normal unipotent subgroup".
    $endgroup$
    – spin
    15 hours ago










  • $begingroup$
    @spin: thanks; corrected.
    $endgroup$
    – Ben McKay
    15 hours ago










  • $begingroup$
    You still need to add the normal assumption to the definition. Reductive groups do have non-trivial connected abelian unipotent subgroups. The root subgroups are such. They're just not normal.
    $endgroup$
    – Jay Taylor
    13 hours ago














5












5








5





$begingroup$

A linear algebraic group is unipotent if it consists entirely of unipotent linear transformations, i.e. $I+N$ with $N$ nilpotent.
A linear algebraic group is reductive if its unipotent radical is trivial, or equivalently if it has no connected normal unipotent abelian subgroup except ${I}$.
See Armand Borel, Linear Algebraic Groups, p. 158.



But the essential idea is that a reductive group (over the complex numbers) has all finite dimensional representations completely reducible, so behaves like a finite group.



A motivating example: the matrices $begin{pmatrix}1&x\0&1end{pmatrix}$ form a group of matrices acting on the plane, preserving the vertical axis, but not any complementary line. So this is not reductive. A linear algebraic group is reductive if it has no normal subgroups like this. Clearly such a subgroup gets in the way of having all representations completely reducible.



Another: the group $GL(2)$ of all $2 times 2$ complex matrices is reductive, because it contains the unitary group $U(2)$, which is compact (so behaves like a finite group), as a Zariski dense subgroup, i.e. any holomorphic function $f$ defined on an open set $W subset GL(2)$ with $W cap U(2) ne emptyset$, and vanishing on that intersect, vanishes. So holomorphic representations of $GL(2)$ determine and are determined by continuous representations of $U(2)$.






share|cite|improve this answer











$endgroup$



A linear algebraic group is unipotent if it consists entirely of unipotent linear transformations, i.e. $I+N$ with $N$ nilpotent.
A linear algebraic group is reductive if its unipotent radical is trivial, or equivalently if it has no connected normal unipotent abelian subgroup except ${I}$.
See Armand Borel, Linear Algebraic Groups, p. 158.



But the essential idea is that a reductive group (over the complex numbers) has all finite dimensional representations completely reducible, so behaves like a finite group.



A motivating example: the matrices $begin{pmatrix}1&x\0&1end{pmatrix}$ form a group of matrices acting on the plane, preserving the vertical axis, but not any complementary line. So this is not reductive. A linear algebraic group is reductive if it has no normal subgroups like this. Clearly such a subgroup gets in the way of having all representations completely reducible.



Another: the group $GL(2)$ of all $2 times 2$ complex matrices is reductive, because it contains the unitary group $U(2)$, which is compact (so behaves like a finite group), as a Zariski dense subgroup, i.e. any holomorphic function $f$ defined on an open set $W subset GL(2)$ with $W cap U(2) ne emptyset$, and vanishing on that intersect, vanishes. So holomorphic representations of $GL(2)$ determine and are determined by continuous representations of $U(2)$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 13 hours ago

























answered 16 hours ago









Ben McKayBen McKay

14.1k22759




14.1k22759












  • $begingroup$
    The definition should be "has no non-trivial connected normal unipotent subgroup".
    $endgroup$
    – spin
    15 hours ago










  • $begingroup$
    @spin: thanks; corrected.
    $endgroup$
    – Ben McKay
    15 hours ago










  • $begingroup$
    You still need to add the normal assumption to the definition. Reductive groups do have non-trivial connected abelian unipotent subgroups. The root subgroups are such. They're just not normal.
    $endgroup$
    – Jay Taylor
    13 hours ago


















  • $begingroup$
    The definition should be "has no non-trivial connected normal unipotent subgroup".
    $endgroup$
    – spin
    15 hours ago










  • $begingroup$
    @spin: thanks; corrected.
    $endgroup$
    – Ben McKay
    15 hours ago










  • $begingroup$
    You still need to add the normal assumption to the definition. Reductive groups do have non-trivial connected abelian unipotent subgroups. The root subgroups are such. They're just not normal.
    $endgroup$
    – Jay Taylor
    13 hours ago
















$begingroup$
The definition should be "has no non-trivial connected normal unipotent subgroup".
$endgroup$
– spin
15 hours ago




$begingroup$
The definition should be "has no non-trivial connected normal unipotent subgroup".
$endgroup$
– spin
15 hours ago












$begingroup$
@spin: thanks; corrected.
$endgroup$
– Ben McKay
15 hours ago




$begingroup$
@spin: thanks; corrected.
$endgroup$
– Ben McKay
15 hours ago












$begingroup$
You still need to add the normal assumption to the definition. Reductive groups do have non-trivial connected abelian unipotent subgroups. The root subgroups are such. They're just not normal.
$endgroup$
– Jay Taylor
13 hours ago




$begingroup$
You still need to add the normal assumption to the definition. Reductive groups do have non-trivial connected abelian unipotent subgroups. The root subgroups are such. They're just not normal.
$endgroup$
– Jay Taylor
13 hours ago


















draft saved

draft discarded




















































Thanks for contributing an answer to MathOverflow!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f321096%2fwhat-is-the-defining-property-of-reductive-groups-and-why-are-they-important%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Histoire des bourses de valeurs

Why is there Russian traffic in my log files?

Rename multiple files to decrement number in file name?