Prove subset of transformations is a group












0












$begingroup$


I'm trying to prove that the subset of linear transformations given below is a group:



Let $T^n$ denote the n-fold composition of any $T∈ℒ(V)$. For instance, the two fold composition $Tcirc T$ is denoted $T^2$.



Let $T∈ℒ(V)$ such that $T≠I$ and $T^n=I$. Show that $C_n={I^{},T^{},T^2,...T^{n−1}}$ is a group.










share|cite|improve this question









$endgroup$












  • $begingroup$
    Which of the group axioms can't you prove?
    $endgroup$
    – Rob Arthan
    Dec 2 '18 at 23:26










  • $begingroup$
    Closure under composition
    $endgroup$
    – courtorder52
    Dec 2 '18 at 23:35










  • $begingroup$
    Given $T^n=I$, that shouldn't be too difficult though. Note that $T^iT^j=T^{i+j}$, because of associativity of composition.
    $endgroup$
    – Jean-Claude Arbaut
    Dec 2 '18 at 23:36












  • $begingroup$
    Why though? I'm taking $T^n$ to refer to a specific transformation, not as the definition for all transformations.
    $endgroup$
    – courtorder52
    Dec 2 '18 at 23:40










  • $begingroup$
    Sure. You are wondering why the set is closed under composition. Prove that the composition of two of its elements is still in it. But the elements can be written $T^i$ and $T^j$, and the composition is $T^{i+j}$. Either $i+jle n$ and there is nothing to prove, either $i+j>n$ but then $T^{i+j}=T^nT^{i+j-n}$. Is it clearer now?
    $endgroup$
    – Jean-Claude Arbaut
    Dec 2 '18 at 23:45
















0












$begingroup$


I'm trying to prove that the subset of linear transformations given below is a group:



Let $T^n$ denote the n-fold composition of any $T∈ℒ(V)$. For instance, the two fold composition $Tcirc T$ is denoted $T^2$.



Let $T∈ℒ(V)$ such that $T≠I$ and $T^n=I$. Show that $C_n={I^{},T^{},T^2,...T^{n−1}}$ is a group.










share|cite|improve this question









$endgroup$












  • $begingroup$
    Which of the group axioms can't you prove?
    $endgroup$
    – Rob Arthan
    Dec 2 '18 at 23:26










  • $begingroup$
    Closure under composition
    $endgroup$
    – courtorder52
    Dec 2 '18 at 23:35










  • $begingroup$
    Given $T^n=I$, that shouldn't be too difficult though. Note that $T^iT^j=T^{i+j}$, because of associativity of composition.
    $endgroup$
    – Jean-Claude Arbaut
    Dec 2 '18 at 23:36












  • $begingroup$
    Why though? I'm taking $T^n$ to refer to a specific transformation, not as the definition for all transformations.
    $endgroup$
    – courtorder52
    Dec 2 '18 at 23:40










  • $begingroup$
    Sure. You are wondering why the set is closed under composition. Prove that the composition of two of its elements is still in it. But the elements can be written $T^i$ and $T^j$, and the composition is $T^{i+j}$. Either $i+jle n$ and there is nothing to prove, either $i+j>n$ but then $T^{i+j}=T^nT^{i+j-n}$. Is it clearer now?
    $endgroup$
    – Jean-Claude Arbaut
    Dec 2 '18 at 23:45














0












0








0





$begingroup$


I'm trying to prove that the subset of linear transformations given below is a group:



Let $T^n$ denote the n-fold composition of any $T∈ℒ(V)$. For instance, the two fold composition $Tcirc T$ is denoted $T^2$.



Let $T∈ℒ(V)$ such that $T≠I$ and $T^n=I$. Show that $C_n={I^{},T^{},T^2,...T^{n−1}}$ is a group.










share|cite|improve this question









$endgroup$




I'm trying to prove that the subset of linear transformations given below is a group:



Let $T^n$ denote the n-fold composition of any $T∈ℒ(V)$. For instance, the two fold composition $Tcirc T$ is denoted $T^2$.



Let $T∈ℒ(V)$ such that $T≠I$ and $T^n=I$. Show that $C_n={I^{},T^{},T^2,...T^{n−1}}$ is a group.







linear-algebra abstract-algebra group-theory cyclic-groups






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 2 '18 at 23:21









courtorder52courtorder52

11




11












  • $begingroup$
    Which of the group axioms can't you prove?
    $endgroup$
    – Rob Arthan
    Dec 2 '18 at 23:26










  • $begingroup$
    Closure under composition
    $endgroup$
    – courtorder52
    Dec 2 '18 at 23:35










  • $begingroup$
    Given $T^n=I$, that shouldn't be too difficult though. Note that $T^iT^j=T^{i+j}$, because of associativity of composition.
    $endgroup$
    – Jean-Claude Arbaut
    Dec 2 '18 at 23:36












  • $begingroup$
    Why though? I'm taking $T^n$ to refer to a specific transformation, not as the definition for all transformations.
    $endgroup$
    – courtorder52
    Dec 2 '18 at 23:40










  • $begingroup$
    Sure. You are wondering why the set is closed under composition. Prove that the composition of two of its elements is still in it. But the elements can be written $T^i$ and $T^j$, and the composition is $T^{i+j}$. Either $i+jle n$ and there is nothing to prove, either $i+j>n$ but then $T^{i+j}=T^nT^{i+j-n}$. Is it clearer now?
    $endgroup$
    – Jean-Claude Arbaut
    Dec 2 '18 at 23:45


















  • $begingroup$
    Which of the group axioms can't you prove?
    $endgroup$
    – Rob Arthan
    Dec 2 '18 at 23:26










  • $begingroup$
    Closure under composition
    $endgroup$
    – courtorder52
    Dec 2 '18 at 23:35










  • $begingroup$
    Given $T^n=I$, that shouldn't be too difficult though. Note that $T^iT^j=T^{i+j}$, because of associativity of composition.
    $endgroup$
    – Jean-Claude Arbaut
    Dec 2 '18 at 23:36












  • $begingroup$
    Why though? I'm taking $T^n$ to refer to a specific transformation, not as the definition for all transformations.
    $endgroup$
    – courtorder52
    Dec 2 '18 at 23:40










  • $begingroup$
    Sure. You are wondering why the set is closed under composition. Prove that the composition of two of its elements is still in it. But the elements can be written $T^i$ and $T^j$, and the composition is $T^{i+j}$. Either $i+jle n$ and there is nothing to prove, either $i+j>n$ but then $T^{i+j}=T^nT^{i+j-n}$. Is it clearer now?
    $endgroup$
    – Jean-Claude Arbaut
    Dec 2 '18 at 23:45
















$begingroup$
Which of the group axioms can't you prove?
$endgroup$
– Rob Arthan
Dec 2 '18 at 23:26




$begingroup$
Which of the group axioms can't you prove?
$endgroup$
– Rob Arthan
Dec 2 '18 at 23:26












$begingroup$
Closure under composition
$endgroup$
– courtorder52
Dec 2 '18 at 23:35




$begingroup$
Closure under composition
$endgroup$
– courtorder52
Dec 2 '18 at 23:35












$begingroup$
Given $T^n=I$, that shouldn't be too difficult though. Note that $T^iT^j=T^{i+j}$, because of associativity of composition.
$endgroup$
– Jean-Claude Arbaut
Dec 2 '18 at 23:36






$begingroup$
Given $T^n=I$, that shouldn't be too difficult though. Note that $T^iT^j=T^{i+j}$, because of associativity of composition.
$endgroup$
– Jean-Claude Arbaut
Dec 2 '18 at 23:36














$begingroup$
Why though? I'm taking $T^n$ to refer to a specific transformation, not as the definition for all transformations.
$endgroup$
– courtorder52
Dec 2 '18 at 23:40




$begingroup$
Why though? I'm taking $T^n$ to refer to a specific transformation, not as the definition for all transformations.
$endgroup$
– courtorder52
Dec 2 '18 at 23:40












$begingroup$
Sure. You are wondering why the set is closed under composition. Prove that the composition of two of its elements is still in it. But the elements can be written $T^i$ and $T^j$, and the composition is $T^{i+j}$. Either $i+jle n$ and there is nothing to prove, either $i+j>n$ but then $T^{i+j}=T^nT^{i+j-n}$. Is it clearer now?
$endgroup$
– Jean-Claude Arbaut
Dec 2 '18 at 23:45




$begingroup$
Sure. You are wondering why the set is closed under composition. Prove that the composition of two of its elements is still in it. But the elements can be written $T^i$ and $T^j$, and the composition is $T^{i+j}$. Either $i+jle n$ and there is nothing to prove, either $i+j>n$ but then $T^{i+j}=T^nT^{i+j-n}$. Is it clearer now?
$endgroup$
– Jean-Claude Arbaut
Dec 2 '18 at 23:45










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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3023364%2fprove-subset-of-transformations-is-a-group%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
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3023364%2fprove-subset-of-transformations-is-a-group%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

Plaza Victoria

In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...