Problem related to find dimension of a subspace

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












I am studying linear algebra.
I found this exercise
Let V be a subspace of all n X n square matrices such that every nonzero element of V is invertible. Show that V is atmost n dimensional. Also prove that if n is odd then dimV =1.



I am unable to approach that exactly which type of matrices will be there in V?







share|cite|improve this question
















  • 1




    Closely related to math.stackexchange.com/q/66877/265466, from the handy list at right.
    – amd
    Aug 22 at 3:13














up vote
1
down vote

favorite












I am studying linear algebra.
I found this exercise
Let V be a subspace of all n X n square matrices such that every nonzero element of V is invertible. Show that V is atmost n dimensional. Also prove that if n is odd then dimV =1.



I am unable to approach that exactly which type of matrices will be there in V?







share|cite|improve this question
















  • 1




    Closely related to math.stackexchange.com/q/66877/265466, from the handy list at right.
    – amd
    Aug 22 at 3:13












up vote
1
down vote

favorite









up vote
1
down vote

favorite











I am studying linear algebra.
I found this exercise
Let V be a subspace of all n X n square matrices such that every nonzero element of V is invertible. Show that V is atmost n dimensional. Also prove that if n is odd then dimV =1.



I am unable to approach that exactly which type of matrices will be there in V?







share|cite|improve this question












I am studying linear algebra.
I found this exercise
Let V be a subspace of all n X n square matrices such that every nonzero element of V is invertible. Show that V is atmost n dimensional. Also prove that if n is odd then dimV =1.



I am unable to approach that exactly which type of matrices will be there in V?









share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Aug 22 at 2:59









Prakash Nainwal

265




265







  • 1




    Closely related to math.stackexchange.com/q/66877/265466, from the handy list at right.
    – amd
    Aug 22 at 3:13












  • 1




    Closely related to math.stackexchange.com/q/66877/265466, from the handy list at right.
    – amd
    Aug 22 at 3:13







1




1




Closely related to math.stackexchange.com/q/66877/265466, from the handy list at right.
– amd
Aug 22 at 3:13




Closely related to math.stackexchange.com/q/66877/265466, from the handy list at right.
– amd
Aug 22 at 3:13










1 Answer
1






active

oldest

votes

















up vote
1
down vote













Assume that $K$ is the base field. Let $m:=dim_K(V)$ and denote by $leftA_1,A_2,ldots,A_mright$ a basis of $V$. Note that the first columns of the matrices $A_i$'s must be linearly independent; otherwise, there are scalars $a_1,a_2,ldots,a_m$, not all being zero, such that the first column of $sumlimits_i=1^m,a_iA_i$ is zero. Since all nonzero elements of $V$ are invertible, we must have
$$sumlimits_i=1^m,a_iA_i=0,,$$ which contradicts the assumption that the $A_i$'s form a basis of $V$. As the first columns of the matrices $A_i$'s are linearly independent elements of $K^n$, we conclude that $mleq n$.



If $n$ is odd and $K:=mathbbR$, then note that, for any two invertible matrices $A$ and $B$, there exists $lambdainmathbbR$ such that $A-lambda,B$ is singular. This is because $A^-1B$ has a real eigenvalue and we can take $lambda$ to be such an eigenvalue. This proves that $mleq 1$ when $n$ is odd and $K$ is the field of real numbers. The same argument also shows that, if $K$ is algebraically closed (and $n$ is an arbitrary positive integer), then $mleq 1$.






share|cite|improve this answer






















  • Thanks a lot. You have explained it nicely. May I ask you one more question which is not exactly related to this, of course, that if p(x) be a polynomial with real coefficients then how many matrices will be there which satisfies this polynomial? For example how many matrices satisfies x^3 =1?
    – Prakash Nainwal
    Aug 22 at 9:01










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: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
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%2f2890586%2fproblem-related-to-find-dimension-of-a-subspace%23new-answer', 'question_page');

);

Post as a guest






























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
1
down vote













Assume that $K$ is the base field. Let $m:=dim_K(V)$ and denote by $leftA_1,A_2,ldots,A_mright$ a basis of $V$. Note that the first columns of the matrices $A_i$'s must be linearly independent; otherwise, there are scalars $a_1,a_2,ldots,a_m$, not all being zero, such that the first column of $sumlimits_i=1^m,a_iA_i$ is zero. Since all nonzero elements of $V$ are invertible, we must have
$$sumlimits_i=1^m,a_iA_i=0,,$$ which contradicts the assumption that the $A_i$'s form a basis of $V$. As the first columns of the matrices $A_i$'s are linearly independent elements of $K^n$, we conclude that $mleq n$.



If $n$ is odd and $K:=mathbbR$, then note that, for any two invertible matrices $A$ and $B$, there exists $lambdainmathbbR$ such that $A-lambda,B$ is singular. This is because $A^-1B$ has a real eigenvalue and we can take $lambda$ to be such an eigenvalue. This proves that $mleq 1$ when $n$ is odd and $K$ is the field of real numbers. The same argument also shows that, if $K$ is algebraically closed (and $n$ is an arbitrary positive integer), then $mleq 1$.






share|cite|improve this answer






















  • Thanks a lot. You have explained it nicely. May I ask you one more question which is not exactly related to this, of course, that if p(x) be a polynomial with real coefficients then how many matrices will be there which satisfies this polynomial? For example how many matrices satisfies x^3 =1?
    – Prakash Nainwal
    Aug 22 at 9:01














up vote
1
down vote













Assume that $K$ is the base field. Let $m:=dim_K(V)$ and denote by $leftA_1,A_2,ldots,A_mright$ a basis of $V$. Note that the first columns of the matrices $A_i$'s must be linearly independent; otherwise, there are scalars $a_1,a_2,ldots,a_m$, not all being zero, such that the first column of $sumlimits_i=1^m,a_iA_i$ is zero. Since all nonzero elements of $V$ are invertible, we must have
$$sumlimits_i=1^m,a_iA_i=0,,$$ which contradicts the assumption that the $A_i$'s form a basis of $V$. As the first columns of the matrices $A_i$'s are linearly independent elements of $K^n$, we conclude that $mleq n$.



If $n$ is odd and $K:=mathbbR$, then note that, for any two invertible matrices $A$ and $B$, there exists $lambdainmathbbR$ such that $A-lambda,B$ is singular. This is because $A^-1B$ has a real eigenvalue and we can take $lambda$ to be such an eigenvalue. This proves that $mleq 1$ when $n$ is odd and $K$ is the field of real numbers. The same argument also shows that, if $K$ is algebraically closed (and $n$ is an arbitrary positive integer), then $mleq 1$.






share|cite|improve this answer






















  • Thanks a lot. You have explained it nicely. May I ask you one more question which is not exactly related to this, of course, that if p(x) be a polynomial with real coefficients then how many matrices will be there which satisfies this polynomial? For example how many matrices satisfies x^3 =1?
    – Prakash Nainwal
    Aug 22 at 9:01












up vote
1
down vote










up vote
1
down vote









Assume that $K$ is the base field. Let $m:=dim_K(V)$ and denote by $leftA_1,A_2,ldots,A_mright$ a basis of $V$. Note that the first columns of the matrices $A_i$'s must be linearly independent; otherwise, there are scalars $a_1,a_2,ldots,a_m$, not all being zero, such that the first column of $sumlimits_i=1^m,a_iA_i$ is zero. Since all nonzero elements of $V$ are invertible, we must have
$$sumlimits_i=1^m,a_iA_i=0,,$$ which contradicts the assumption that the $A_i$'s form a basis of $V$. As the first columns of the matrices $A_i$'s are linearly independent elements of $K^n$, we conclude that $mleq n$.



If $n$ is odd and $K:=mathbbR$, then note that, for any two invertible matrices $A$ and $B$, there exists $lambdainmathbbR$ such that $A-lambda,B$ is singular. This is because $A^-1B$ has a real eigenvalue and we can take $lambda$ to be such an eigenvalue. This proves that $mleq 1$ when $n$ is odd and $K$ is the field of real numbers. The same argument also shows that, if $K$ is algebraically closed (and $n$ is an arbitrary positive integer), then $mleq 1$.






share|cite|improve this answer














Assume that $K$ is the base field. Let $m:=dim_K(V)$ and denote by $leftA_1,A_2,ldots,A_mright$ a basis of $V$. Note that the first columns of the matrices $A_i$'s must be linearly independent; otherwise, there are scalars $a_1,a_2,ldots,a_m$, not all being zero, such that the first column of $sumlimits_i=1^m,a_iA_i$ is zero. Since all nonzero elements of $V$ are invertible, we must have
$$sumlimits_i=1^m,a_iA_i=0,,$$ which contradicts the assumption that the $A_i$'s form a basis of $V$. As the first columns of the matrices $A_i$'s are linearly independent elements of $K^n$, we conclude that $mleq n$.



If $n$ is odd and $K:=mathbbR$, then note that, for any two invertible matrices $A$ and $B$, there exists $lambdainmathbbR$ such that $A-lambda,B$ is singular. This is because $A^-1B$ has a real eigenvalue and we can take $lambda$ to be such an eigenvalue. This proves that $mleq 1$ when $n$ is odd and $K$ is the field of real numbers. The same argument also shows that, if $K$ is algebraically closed (and $n$ is an arbitrary positive integer), then $mleq 1$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Aug 22 at 4:47

























answered Aug 22 at 4:10









Batominovski

24.7k22881




24.7k22881











  • Thanks a lot. You have explained it nicely. May I ask you one more question which is not exactly related to this, of course, that if p(x) be a polynomial with real coefficients then how many matrices will be there which satisfies this polynomial? For example how many matrices satisfies x^3 =1?
    – Prakash Nainwal
    Aug 22 at 9:01
















  • Thanks a lot. You have explained it nicely. May I ask you one more question which is not exactly related to this, of course, that if p(x) be a polynomial with real coefficients then how many matrices will be there which satisfies this polynomial? For example how many matrices satisfies x^3 =1?
    – Prakash Nainwal
    Aug 22 at 9:01















Thanks a lot. You have explained it nicely. May I ask you one more question which is not exactly related to this, of course, that if p(x) be a polynomial with real coefficients then how many matrices will be there which satisfies this polynomial? For example how many matrices satisfies x^3 =1?
– Prakash Nainwal
Aug 22 at 9:01




Thanks a lot. You have explained it nicely. May I ask you one more question which is not exactly related to this, of course, that if p(x) be a polynomial with real coefficients then how many matrices will be there which satisfies this polynomial? For example how many matrices satisfies x^3 =1?
– Prakash Nainwal
Aug 22 at 9:01












 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2890586%2fproblem-related-to-find-dimension-of-a-subspace%23new-answer', 'question_page');

);

Post as a guest













































































這個網誌中的熱門文章

tkz-euclide: tkzDrawCircle[R] not working

How to combine Bézier curves to a surface?

1st Magritte Awards