Irreducible components of the subvariety of matrices s.t. $M^n=mathbb{I}$
$begingroup$
Fixed $ninmathbb{N}$, describe the irreducible components, and prove that there are ${n+1choose{2}}$ of them, of the following algebraic variety:
$$V={Ain M_{2}(mathbb{C})mid A^n=mathbb{I}}$$
For $n=2$, the components are ${mathbb{I}}$, ${-mathbb{I}}$ and
$$ left{ begin{pmatrix} a & b\ c & d end{pmatrix}: a=-d , a^2+bc=1 right}$$
For the other values of $n$, I don't have idea how to proceed
algebraic-geometry affine-varieties
$endgroup$
add a comment |
$begingroup$
Fixed $ninmathbb{N}$, describe the irreducible components, and prove that there are ${n+1choose{2}}$ of them, of the following algebraic variety:
$$V={Ain M_{2}(mathbb{C})mid A^n=mathbb{I}}$$
For $n=2$, the components are ${mathbb{I}}$, ${-mathbb{I}}$ and
$$ left{ begin{pmatrix} a & b\ c & d end{pmatrix}: a=-d , a^2+bc=1 right}$$
For the other values of $n$, I don't have idea how to proceed
algebraic-geometry affine-varieties
$endgroup$
$begingroup$
So you have for $n=2$ three components: these are distinguished by their eigenvalues, respectively $(1,1)$, $(-1,-1)$ and $(1,-1)$, and therefore also by their characteristic equations.
$endgroup$
– Lord Shark the Unknown
Jan 6 at 5:37
$begingroup$
Ok, so the minimal polinomial of A must divide $x^n-1$. Let $a_{1}$...$a_{n}$ be the roots of the unity. Then, if the minimal polinomial is linear, we obtain $A=a_imathbb{I}$, and thus $P_A(x)=(x-a_i)^2$ . Otherwise, in order to buld a possible characteristical polynomial we have to chose two differents roots, no matter the order. In total, we obtain $(n+1chose2)$ different polynomials. Each of one determines an irreducible component. If I am right I will edit the answer
$endgroup$
– jonlajoye
Jan 6 at 6:06
add a comment |
$begingroup$
Fixed $ninmathbb{N}$, describe the irreducible components, and prove that there are ${n+1choose{2}}$ of them, of the following algebraic variety:
$$V={Ain M_{2}(mathbb{C})mid A^n=mathbb{I}}$$
For $n=2$, the components are ${mathbb{I}}$, ${-mathbb{I}}$ and
$$ left{ begin{pmatrix} a & b\ c & d end{pmatrix}: a=-d , a^2+bc=1 right}$$
For the other values of $n$, I don't have idea how to proceed
algebraic-geometry affine-varieties
$endgroup$
Fixed $ninmathbb{N}$, describe the irreducible components, and prove that there are ${n+1choose{2}}$ of them, of the following algebraic variety:
$$V={Ain M_{2}(mathbb{C})mid A^n=mathbb{I}}$$
For $n=2$, the components are ${mathbb{I}}$, ${-mathbb{I}}$ and
$$ left{ begin{pmatrix} a & b\ c & d end{pmatrix}: a=-d , a^2+bc=1 right}$$
For the other values of $n$, I don't have idea how to proceed
algebraic-geometry affine-varieties
algebraic-geometry affine-varieties
edited Jan 6 at 5:33
jonlajoye
asked Jan 6 at 5:16
jonlajoyejonlajoye
13
13
$begingroup$
So you have for $n=2$ three components: these are distinguished by their eigenvalues, respectively $(1,1)$, $(-1,-1)$ and $(1,-1)$, and therefore also by their characteristic equations.
$endgroup$
– Lord Shark the Unknown
Jan 6 at 5:37
$begingroup$
Ok, so the minimal polinomial of A must divide $x^n-1$. Let $a_{1}$...$a_{n}$ be the roots of the unity. Then, if the minimal polinomial is linear, we obtain $A=a_imathbb{I}$, and thus $P_A(x)=(x-a_i)^2$ . Otherwise, in order to buld a possible characteristical polynomial we have to chose two differents roots, no matter the order. In total, we obtain $(n+1chose2)$ different polynomials. Each of one determines an irreducible component. If I am right I will edit the answer
$endgroup$
– jonlajoye
Jan 6 at 6:06
add a comment |
$begingroup$
So you have for $n=2$ three components: these are distinguished by their eigenvalues, respectively $(1,1)$, $(-1,-1)$ and $(1,-1)$, and therefore also by their characteristic equations.
$endgroup$
– Lord Shark the Unknown
Jan 6 at 5:37
$begingroup$
Ok, so the minimal polinomial of A must divide $x^n-1$. Let $a_{1}$...$a_{n}$ be the roots of the unity. Then, if the minimal polinomial is linear, we obtain $A=a_imathbb{I}$, and thus $P_A(x)=(x-a_i)^2$ . Otherwise, in order to buld a possible characteristical polynomial we have to chose two differents roots, no matter the order. In total, we obtain $(n+1chose2)$ different polynomials. Each of one determines an irreducible component. If I am right I will edit the answer
$endgroup$
– jonlajoye
Jan 6 at 6:06
$begingroup$
So you have for $n=2$ three components: these are distinguished by their eigenvalues, respectively $(1,1)$, $(-1,-1)$ and $(1,-1)$, and therefore also by their characteristic equations.
$endgroup$
– Lord Shark the Unknown
Jan 6 at 5:37
$begingroup$
So you have for $n=2$ three components: these are distinguished by their eigenvalues, respectively $(1,1)$, $(-1,-1)$ and $(1,-1)$, and therefore also by their characteristic equations.
$endgroup$
– Lord Shark the Unknown
Jan 6 at 5:37
$begingroup$
Ok, so the minimal polinomial of A must divide $x^n-1$. Let $a_{1}$...$a_{n}$ be the roots of the unity. Then, if the minimal polinomial is linear, we obtain $A=a_imathbb{I}$, and thus $P_A(x)=(x-a_i)^2$ . Otherwise, in order to buld a possible characteristical polynomial we have to chose two differents roots, no matter the order. In total, we obtain $(n+1chose2)$ different polynomials. Each of one determines an irreducible component. If I am right I will edit the answer
$endgroup$
– jonlajoye
Jan 6 at 6:06
$begingroup$
Ok, so the minimal polinomial of A must divide $x^n-1$. Let $a_{1}$...$a_{n}$ be the roots of the unity. Then, if the minimal polinomial is linear, we obtain $A=a_imathbb{I}$, and thus $P_A(x)=(x-a_i)^2$ . Otherwise, in order to buld a possible characteristical polynomial we have to chose two differents roots, no matter the order. In total, we obtain $(n+1chose2)$ different polynomials. Each of one determines an irreducible component. If I am right I will edit the answer
$endgroup$
– jonlajoye
Jan 6 at 6:06
add a comment |
0
active
oldest
votes
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: "69"
};
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3063521%2firreducible-components-of-the-subvariety-of-matrices-s-t-mn-mathbbi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- 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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3063521%2firreducible-components-of-the-subvariety-of-matrices-s-t-mn-mathbbi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
$begingroup$
So you have for $n=2$ three components: these are distinguished by their eigenvalues, respectively $(1,1)$, $(-1,-1)$ and $(1,-1)$, and therefore also by their characteristic equations.
$endgroup$
– Lord Shark the Unknown
Jan 6 at 5:37
$begingroup$
Ok, so the minimal polinomial of A must divide $x^n-1$. Let $a_{1}$...$a_{n}$ be the roots of the unity. Then, if the minimal polinomial is linear, we obtain $A=a_imathbb{I}$, and thus $P_A(x)=(x-a_i)^2$ . Otherwise, in order to buld a possible characteristical polynomial we have to chose two differents roots, no matter the order. In total, we obtain $(n+1chose2)$ different polynomials. Each of one determines an irreducible component. If I am right I will edit the answer
$endgroup$
– jonlajoye
Jan 6 at 6:06