infinite upper triangular modules has no simple submodules











up vote
2
down vote

favorite












Let $k$ be a field. Let $R$ be the set of infinite upper triangular matrices (columns and row are indexed by $mathbb{Z}$) with only finitely many nonzero entries in any row or column. Then let $V$ be the vector space of infinite column vectors (indexed by $mathbb{Z}$) with finitely many nonzero entries. Then we can view $V$ as an $R$-module with action given by matrix multiplication.



Then I would like to show that $V$ has no simple submodules.



However, to me, this is not intuitively correct. For example, let $W$ consists the vectors with some entries at the first row and zeros elsewhere. Then $W$ has only finitely many nonzero entries (1 or 0 entry) and it is closed under addition. Also for any $Ain R$, $AWsubseteq W$. So it appears to me that $W$ is a submodule, and it is one-dimensional. So it must be simple.



What the role of infinity here?



Because if we consider the finite case (finite upper triangular matrix $R$, finite column vectors space $V$, the submodule $W$ I mentioned before is the only simple submodule of $V$. right?) Why this is not true in infinite case? What I missed?



Thanks!










share|cite|improve this question
























  • Could it be that you want the rows and columns of your matrices indexed by $mathbb{Z}$ (that is, bidirectionally infinite matrices)?
    – darij grinberg
    Nov 14 at 0:05










  • I just checked. You are right, the rows and columns are indexed by $mathbb{Z}$. But how this helps? Thanks.
    – Abigail
    Nov 14 at 0:50






  • 1




    I don't know how it helps, but it explains why @rschwieb is getting a different answer.
    – darij grinberg
    Nov 14 at 0:50






  • 2




    For each $g in mathbb{Z}$, let $V_g$ be the subspace of $V$ consisting of all vectors $left(ldots, v_{-1}, v_0, v_1, ldotsright)$ such that all $i geq g$ satisfy $v_i = 0$. The trick is to prove that each nontrivial proper $A$-submodule of $V$ is $V_g$ for some $g in mathbb{Z}$. It is clear that none of the $V_g$'s is simple.
    – darij grinberg
    Nov 14 at 1:07










  • Ah! I think I know what I am messing up. I was assuming that we start from row 1 and goes to infinity (I was assuming col and rows are indexed by natural number!). But we are indexed by $mathbb{Z}$, so it is not reasonable to start from 1. Thus the submodule I mentioned is not a valid choice! Thanks!!!
    – Abigail
    Nov 14 at 1:25















up vote
2
down vote

favorite












Let $k$ be a field. Let $R$ be the set of infinite upper triangular matrices (columns and row are indexed by $mathbb{Z}$) with only finitely many nonzero entries in any row or column. Then let $V$ be the vector space of infinite column vectors (indexed by $mathbb{Z}$) with finitely many nonzero entries. Then we can view $V$ as an $R$-module with action given by matrix multiplication.



Then I would like to show that $V$ has no simple submodules.



However, to me, this is not intuitively correct. For example, let $W$ consists the vectors with some entries at the first row and zeros elsewhere. Then $W$ has only finitely many nonzero entries (1 or 0 entry) and it is closed under addition. Also for any $Ain R$, $AWsubseteq W$. So it appears to me that $W$ is a submodule, and it is one-dimensional. So it must be simple.



What the role of infinity here?



Because if we consider the finite case (finite upper triangular matrix $R$, finite column vectors space $V$, the submodule $W$ I mentioned before is the only simple submodule of $V$. right?) Why this is not true in infinite case? What I missed?



Thanks!










share|cite|improve this question
























  • Could it be that you want the rows and columns of your matrices indexed by $mathbb{Z}$ (that is, bidirectionally infinite matrices)?
    – darij grinberg
    Nov 14 at 0:05










  • I just checked. You are right, the rows and columns are indexed by $mathbb{Z}$. But how this helps? Thanks.
    – Abigail
    Nov 14 at 0:50






  • 1




    I don't know how it helps, but it explains why @rschwieb is getting a different answer.
    – darij grinberg
    Nov 14 at 0:50






  • 2




    For each $g in mathbb{Z}$, let $V_g$ be the subspace of $V$ consisting of all vectors $left(ldots, v_{-1}, v_0, v_1, ldotsright)$ such that all $i geq g$ satisfy $v_i = 0$. The trick is to prove that each nontrivial proper $A$-submodule of $V$ is $V_g$ for some $g in mathbb{Z}$. It is clear that none of the $V_g$'s is simple.
    – darij grinberg
    Nov 14 at 1:07










  • Ah! I think I know what I am messing up. I was assuming that we start from row 1 and goes to infinity (I was assuming col and rows are indexed by natural number!). But we are indexed by $mathbb{Z}$, so it is not reasonable to start from 1. Thus the submodule I mentioned is not a valid choice! Thanks!!!
    – Abigail
    Nov 14 at 1:25













up vote
2
down vote

favorite









up vote
2
down vote

favorite











Let $k$ be a field. Let $R$ be the set of infinite upper triangular matrices (columns and row are indexed by $mathbb{Z}$) with only finitely many nonzero entries in any row or column. Then let $V$ be the vector space of infinite column vectors (indexed by $mathbb{Z}$) with finitely many nonzero entries. Then we can view $V$ as an $R$-module with action given by matrix multiplication.



Then I would like to show that $V$ has no simple submodules.



However, to me, this is not intuitively correct. For example, let $W$ consists the vectors with some entries at the first row and zeros elsewhere. Then $W$ has only finitely many nonzero entries (1 or 0 entry) and it is closed under addition. Also for any $Ain R$, $AWsubseteq W$. So it appears to me that $W$ is a submodule, and it is one-dimensional. So it must be simple.



What the role of infinity here?



Because if we consider the finite case (finite upper triangular matrix $R$, finite column vectors space $V$, the submodule $W$ I mentioned before is the only simple submodule of $V$. right?) Why this is not true in infinite case? What I missed?



Thanks!










share|cite|improve this question















Let $k$ be a field. Let $R$ be the set of infinite upper triangular matrices (columns and row are indexed by $mathbb{Z}$) with only finitely many nonzero entries in any row or column. Then let $V$ be the vector space of infinite column vectors (indexed by $mathbb{Z}$) with finitely many nonzero entries. Then we can view $V$ as an $R$-module with action given by matrix multiplication.



Then I would like to show that $V$ has no simple submodules.



However, to me, this is not intuitively correct. For example, let $W$ consists the vectors with some entries at the first row and zeros elsewhere. Then $W$ has only finitely many nonzero entries (1 or 0 entry) and it is closed under addition. Also for any $Ain R$, $AWsubseteq W$. So it appears to me that $W$ is a submodule, and it is one-dimensional. So it must be simple.



What the role of infinity here?



Because if we consider the finite case (finite upper triangular matrix $R$, finite column vectors space $V$, the submodule $W$ I mentioned before is the only simple submodule of $V$. right?) Why this is not true in infinite case? What I missed?



Thanks!







abstract-algebra modules






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 14 at 0:51

























asked Nov 13 at 16:17









Abigail

527




527












  • Could it be that you want the rows and columns of your matrices indexed by $mathbb{Z}$ (that is, bidirectionally infinite matrices)?
    – darij grinberg
    Nov 14 at 0:05










  • I just checked. You are right, the rows and columns are indexed by $mathbb{Z}$. But how this helps? Thanks.
    – Abigail
    Nov 14 at 0:50






  • 1




    I don't know how it helps, but it explains why @rschwieb is getting a different answer.
    – darij grinberg
    Nov 14 at 0:50






  • 2




    For each $g in mathbb{Z}$, let $V_g$ be the subspace of $V$ consisting of all vectors $left(ldots, v_{-1}, v_0, v_1, ldotsright)$ such that all $i geq g$ satisfy $v_i = 0$. The trick is to prove that each nontrivial proper $A$-submodule of $V$ is $V_g$ for some $g in mathbb{Z}$. It is clear that none of the $V_g$'s is simple.
    – darij grinberg
    Nov 14 at 1:07










  • Ah! I think I know what I am messing up. I was assuming that we start from row 1 and goes to infinity (I was assuming col and rows are indexed by natural number!). But we are indexed by $mathbb{Z}$, so it is not reasonable to start from 1. Thus the submodule I mentioned is not a valid choice! Thanks!!!
    – Abigail
    Nov 14 at 1:25


















  • Could it be that you want the rows and columns of your matrices indexed by $mathbb{Z}$ (that is, bidirectionally infinite matrices)?
    – darij grinberg
    Nov 14 at 0:05










  • I just checked. You are right, the rows and columns are indexed by $mathbb{Z}$. But how this helps? Thanks.
    – Abigail
    Nov 14 at 0:50






  • 1




    I don't know how it helps, but it explains why @rschwieb is getting a different answer.
    – darij grinberg
    Nov 14 at 0:50






  • 2




    For each $g in mathbb{Z}$, let $V_g$ be the subspace of $V$ consisting of all vectors $left(ldots, v_{-1}, v_0, v_1, ldotsright)$ such that all $i geq g$ satisfy $v_i = 0$. The trick is to prove that each nontrivial proper $A$-submodule of $V$ is $V_g$ for some $g in mathbb{Z}$. It is clear that none of the $V_g$'s is simple.
    – darij grinberg
    Nov 14 at 1:07










  • Ah! I think I know what I am messing up. I was assuming that we start from row 1 and goes to infinity (I was assuming col and rows are indexed by natural number!). But we are indexed by $mathbb{Z}$, so it is not reasonable to start from 1. Thus the submodule I mentioned is not a valid choice! Thanks!!!
    – Abigail
    Nov 14 at 1:25
















Could it be that you want the rows and columns of your matrices indexed by $mathbb{Z}$ (that is, bidirectionally infinite matrices)?
– darij grinberg
Nov 14 at 0:05




Could it be that you want the rows and columns of your matrices indexed by $mathbb{Z}$ (that is, bidirectionally infinite matrices)?
– darij grinberg
Nov 14 at 0:05












I just checked. You are right, the rows and columns are indexed by $mathbb{Z}$. But how this helps? Thanks.
– Abigail
Nov 14 at 0:50




I just checked. You are right, the rows and columns are indexed by $mathbb{Z}$. But how this helps? Thanks.
– Abigail
Nov 14 at 0:50




1




1




I don't know how it helps, but it explains why @rschwieb is getting a different answer.
– darij grinberg
Nov 14 at 0:50




I don't know how it helps, but it explains why @rschwieb is getting a different answer.
– darij grinberg
Nov 14 at 0:50




2




2




For each $g in mathbb{Z}$, let $V_g$ be the subspace of $V$ consisting of all vectors $left(ldots, v_{-1}, v_0, v_1, ldotsright)$ such that all $i geq g$ satisfy $v_i = 0$. The trick is to prove that each nontrivial proper $A$-submodule of $V$ is $V_g$ for some $g in mathbb{Z}$. It is clear that none of the $V_g$'s is simple.
– darij grinberg
Nov 14 at 1:07




For each $g in mathbb{Z}$, let $V_g$ be the subspace of $V$ consisting of all vectors $left(ldots, v_{-1}, v_0, v_1, ldotsright)$ such that all $i geq g$ satisfy $v_i = 0$. The trick is to prove that each nontrivial proper $A$-submodule of $V$ is $V_g$ for some $g in mathbb{Z}$. It is clear that none of the $V_g$'s is simple.
– darij grinberg
Nov 14 at 1:07












Ah! I think I know what I am messing up. I was assuming that we start from row 1 and goes to infinity (I was assuming col and rows are indexed by natural number!). But we are indexed by $mathbb{Z}$, so it is not reasonable to start from 1. Thus the submodule I mentioned is not a valid choice! Thanks!!!
– Abigail
Nov 14 at 1:25




Ah! I think I know what I am messing up. I was assuming that we start from row 1 and goes to infinity (I was assuming col and rows are indexed by natural number!). But we are indexed by $mathbb{Z}$, so it is not reasonable to start from 1. Thus the submodule I mentioned is not a valid choice! Thanks!!!
– Abigail
Nov 14 at 1:25










1 Answer
1






active

oldest

votes

















up vote
2
down vote













I'm doing everything assuming that the sides of $R$ are indexed by $mathbb N$, and so are the positions of $V$, and that is how matrix multiplication is defined.



The subspace ${(lambda, 0, 0ldots)^Tmid lambda in k}$ appears to be a simple submodule of $_RV$.



(N.B. At the time of this answer, the indexing by $mathbb Z$ was not mentioned.)






share|cite|improve this answer























  • Maybe there is a mixup in the problem setup? or maybe I am doing something silly...
    – rschwieb
    Nov 13 at 19:12










  • Hi, in fact, the subspace you mentioned is exactly I was guessing to be the simple submodule. But it appears that the rows and columns are indexed by $mathbb{Z}$, does this condition gives us a different answer? (sorry I did not mention this earlier...I didn't expect this to be important)
    – Abigail
    Nov 14 at 0:56










  • And I suppose that if we indexed by $mathbb{N}$, then ${(lambda,0,0,ldots)^T}$ should be the unique simple submodule?
    – Abigail
    Nov 14 at 2:09










  • @Abigail the indexing issue would be good to clarify. I think the last claim you mentioned is correct.
    – rschwieb
    Nov 14 at 4:48











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',
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%2f2996928%2finfinite-upper-triangular-modules-has-no-simple-submodules%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
2
down vote













I'm doing everything assuming that the sides of $R$ are indexed by $mathbb N$, and so are the positions of $V$, and that is how matrix multiplication is defined.



The subspace ${(lambda, 0, 0ldots)^Tmid lambda in k}$ appears to be a simple submodule of $_RV$.



(N.B. At the time of this answer, the indexing by $mathbb Z$ was not mentioned.)






share|cite|improve this answer























  • Maybe there is a mixup in the problem setup? or maybe I am doing something silly...
    – rschwieb
    Nov 13 at 19:12










  • Hi, in fact, the subspace you mentioned is exactly I was guessing to be the simple submodule. But it appears that the rows and columns are indexed by $mathbb{Z}$, does this condition gives us a different answer? (sorry I did not mention this earlier...I didn't expect this to be important)
    – Abigail
    Nov 14 at 0:56










  • And I suppose that if we indexed by $mathbb{N}$, then ${(lambda,0,0,ldots)^T}$ should be the unique simple submodule?
    – Abigail
    Nov 14 at 2:09










  • @Abigail the indexing issue would be good to clarify. I think the last claim you mentioned is correct.
    – rschwieb
    Nov 14 at 4:48















up vote
2
down vote













I'm doing everything assuming that the sides of $R$ are indexed by $mathbb N$, and so are the positions of $V$, and that is how matrix multiplication is defined.



The subspace ${(lambda, 0, 0ldots)^Tmid lambda in k}$ appears to be a simple submodule of $_RV$.



(N.B. At the time of this answer, the indexing by $mathbb Z$ was not mentioned.)






share|cite|improve this answer























  • Maybe there is a mixup in the problem setup? or maybe I am doing something silly...
    – rschwieb
    Nov 13 at 19:12










  • Hi, in fact, the subspace you mentioned is exactly I was guessing to be the simple submodule. But it appears that the rows and columns are indexed by $mathbb{Z}$, does this condition gives us a different answer? (sorry I did not mention this earlier...I didn't expect this to be important)
    – Abigail
    Nov 14 at 0:56










  • And I suppose that if we indexed by $mathbb{N}$, then ${(lambda,0,0,ldots)^T}$ should be the unique simple submodule?
    – Abigail
    Nov 14 at 2:09










  • @Abigail the indexing issue would be good to clarify. I think the last claim you mentioned is correct.
    – rschwieb
    Nov 14 at 4:48













up vote
2
down vote










up vote
2
down vote









I'm doing everything assuming that the sides of $R$ are indexed by $mathbb N$, and so are the positions of $V$, and that is how matrix multiplication is defined.



The subspace ${(lambda, 0, 0ldots)^Tmid lambda in k}$ appears to be a simple submodule of $_RV$.



(N.B. At the time of this answer, the indexing by $mathbb Z$ was not mentioned.)






share|cite|improve this answer














I'm doing everything assuming that the sides of $R$ are indexed by $mathbb N$, and so are the positions of $V$, and that is how matrix multiplication is defined.



The subspace ${(lambda, 0, 0ldots)^Tmid lambda in k}$ appears to be a simple submodule of $_RV$.



(N.B. At the time of this answer, the indexing by $mathbb Z$ was not mentioned.)







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Nov 14 at 14:42

























answered Nov 13 at 19:11









rschwieb

103k1299238




103k1299238












  • Maybe there is a mixup in the problem setup? or maybe I am doing something silly...
    – rschwieb
    Nov 13 at 19:12










  • Hi, in fact, the subspace you mentioned is exactly I was guessing to be the simple submodule. But it appears that the rows and columns are indexed by $mathbb{Z}$, does this condition gives us a different answer? (sorry I did not mention this earlier...I didn't expect this to be important)
    – Abigail
    Nov 14 at 0:56










  • And I suppose that if we indexed by $mathbb{N}$, then ${(lambda,0,0,ldots)^T}$ should be the unique simple submodule?
    – Abigail
    Nov 14 at 2:09










  • @Abigail the indexing issue would be good to clarify. I think the last claim you mentioned is correct.
    – rschwieb
    Nov 14 at 4:48


















  • Maybe there is a mixup in the problem setup? or maybe I am doing something silly...
    – rschwieb
    Nov 13 at 19:12










  • Hi, in fact, the subspace you mentioned is exactly I was guessing to be the simple submodule. But it appears that the rows and columns are indexed by $mathbb{Z}$, does this condition gives us a different answer? (sorry I did not mention this earlier...I didn't expect this to be important)
    – Abigail
    Nov 14 at 0:56










  • And I suppose that if we indexed by $mathbb{N}$, then ${(lambda,0,0,ldots)^T}$ should be the unique simple submodule?
    – Abigail
    Nov 14 at 2:09










  • @Abigail the indexing issue would be good to clarify. I think the last claim you mentioned is correct.
    – rschwieb
    Nov 14 at 4:48
















Maybe there is a mixup in the problem setup? or maybe I am doing something silly...
– rschwieb
Nov 13 at 19:12




Maybe there is a mixup in the problem setup? or maybe I am doing something silly...
– rschwieb
Nov 13 at 19:12












Hi, in fact, the subspace you mentioned is exactly I was guessing to be the simple submodule. But it appears that the rows and columns are indexed by $mathbb{Z}$, does this condition gives us a different answer? (sorry I did not mention this earlier...I didn't expect this to be important)
– Abigail
Nov 14 at 0:56




Hi, in fact, the subspace you mentioned is exactly I was guessing to be the simple submodule. But it appears that the rows and columns are indexed by $mathbb{Z}$, does this condition gives us a different answer? (sorry I did not mention this earlier...I didn't expect this to be important)
– Abigail
Nov 14 at 0:56












And I suppose that if we indexed by $mathbb{N}$, then ${(lambda,0,0,ldots)^T}$ should be the unique simple submodule?
– Abigail
Nov 14 at 2:09




And I suppose that if we indexed by $mathbb{N}$, then ${(lambda,0,0,ldots)^T}$ should be the unique simple submodule?
– Abigail
Nov 14 at 2:09












@Abigail the indexing issue would be good to clarify. I think the last claim you mentioned is correct.
– rschwieb
Nov 14 at 4:48




@Abigail the indexing issue would be good to clarify. I think the last claim you mentioned is correct.
– rschwieb
Nov 14 at 4:48


















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2996928%2finfinite-upper-triangular-modules-has-no-simple-submodules%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...