what is the equivalent of $xy=a$, then $y→∞$ as $x→0$ for matrices












3












$begingroup$


For scalars, given the equation $xy=a$, then $y→∞$ as $x→0$, i.e. as $x$ tends to being non-invertible.



I wanted to find an equivalent theorem for matrices. I came up with:



For matrices and vectors, given the equation $Xy=a$, then $y→∞$ as $X$ tends to being non-invertible (singular), i.e. as $X→A$, where $A$ is such that $Az=0$ has a non trivial solution.



Is this correct? Where can I find this in a book?



More interestingly, I have an idea that there are as many infinite entries in $y→∞$ as there are non-zero entries in $z$. Is this correct too? If so, how could I prove it?



Please help.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    I appreciate the curiosity behind this question, but I'm really struggling to make sense of it. When you say, "$x$ tends to being invertible", at one point you mean it tending to $0$ (the only non-invertible scalar), and at another, where $X$ tends to a singular matrix $A$. Do you mean "singular" (non-invertible) when you say "invertible"?
    $endgroup$
    – Theo Bendit
    Jan 10 at 1:30










  • $begingroup$
    Thank you for the corrections.
    $endgroup$
    – a.giannel
    Jan 10 at 1:36










  • $begingroup$
    Suppose $X$ is $ntimes m$. Then consider the $n$ rows of the matrix equation $Xy=a$. The $i$th row has the form $$sum_{j=1}^{m}x_{i,j}cdot y_j=a_i$$ If even one entry of $y$ explodes, say $y_kto infty$, then we can rewrite $$x_{i,k}cdot y_k=a_i-sum_{substack{j=1\jneq k}}^{m}x_{i,j}cdot y_j$$ so that $x_{i,j}to 0$ for every row $i$. But a matrix with a column of zeros is singular, and so not invertible.
    $endgroup$
    – nathan.j.mcdougall
    Jan 10 at 1:45












  • $begingroup$
    Very interesting and cleaver. Thank you. Do you believe that with that I can work on to find a solution the second part of the question, regarding the number of infinite entries for $y$ and zero entries for $z$?
    $endgroup$
    – a.giannel
    Jan 10 at 1:50








  • 1




    $begingroup$
    The analogy with scalars breaks down pretty quickly. For any vector $y$ you can construct a nonzero matrix $A$ such that $Ay=0$. On the flip side, you can construct $A$ such that the $i$th element of $y$ has no effect on the value of $Ay$, so you’ll need to sharpen up what you mean by $ytoinfty$.
    $endgroup$
    – amd
    Jan 10 at 3:19


















3












$begingroup$


For scalars, given the equation $xy=a$, then $y→∞$ as $x→0$, i.e. as $x$ tends to being non-invertible.



I wanted to find an equivalent theorem for matrices. I came up with:



For matrices and vectors, given the equation $Xy=a$, then $y→∞$ as $X$ tends to being non-invertible (singular), i.e. as $X→A$, where $A$ is such that $Az=0$ has a non trivial solution.



Is this correct? Where can I find this in a book?



More interestingly, I have an idea that there are as many infinite entries in $y→∞$ as there are non-zero entries in $z$. Is this correct too? If so, how could I prove it?



Please help.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    I appreciate the curiosity behind this question, but I'm really struggling to make sense of it. When you say, "$x$ tends to being invertible", at one point you mean it tending to $0$ (the only non-invertible scalar), and at another, where $X$ tends to a singular matrix $A$. Do you mean "singular" (non-invertible) when you say "invertible"?
    $endgroup$
    – Theo Bendit
    Jan 10 at 1:30










  • $begingroup$
    Thank you for the corrections.
    $endgroup$
    – a.giannel
    Jan 10 at 1:36










  • $begingroup$
    Suppose $X$ is $ntimes m$. Then consider the $n$ rows of the matrix equation $Xy=a$. The $i$th row has the form $$sum_{j=1}^{m}x_{i,j}cdot y_j=a_i$$ If even one entry of $y$ explodes, say $y_kto infty$, then we can rewrite $$x_{i,k}cdot y_k=a_i-sum_{substack{j=1\jneq k}}^{m}x_{i,j}cdot y_j$$ so that $x_{i,j}to 0$ for every row $i$. But a matrix with a column of zeros is singular, and so not invertible.
    $endgroup$
    – nathan.j.mcdougall
    Jan 10 at 1:45












  • $begingroup$
    Very interesting and cleaver. Thank you. Do you believe that with that I can work on to find a solution the second part of the question, regarding the number of infinite entries for $y$ and zero entries for $z$?
    $endgroup$
    – a.giannel
    Jan 10 at 1:50








  • 1




    $begingroup$
    The analogy with scalars breaks down pretty quickly. For any vector $y$ you can construct a nonzero matrix $A$ such that $Ay=0$. On the flip side, you can construct $A$ such that the $i$th element of $y$ has no effect on the value of $Ay$, so you’ll need to sharpen up what you mean by $ytoinfty$.
    $endgroup$
    – amd
    Jan 10 at 3:19
















3












3








3





$begingroup$


For scalars, given the equation $xy=a$, then $y→∞$ as $x→0$, i.e. as $x$ tends to being non-invertible.



I wanted to find an equivalent theorem for matrices. I came up with:



For matrices and vectors, given the equation $Xy=a$, then $y→∞$ as $X$ tends to being non-invertible (singular), i.e. as $X→A$, where $A$ is such that $Az=0$ has a non trivial solution.



Is this correct? Where can I find this in a book?



More interestingly, I have an idea that there are as many infinite entries in $y→∞$ as there are non-zero entries in $z$. Is this correct too? If so, how could I prove it?



Please help.










share|cite|improve this question











$endgroup$




For scalars, given the equation $xy=a$, then $y→∞$ as $x→0$, i.e. as $x$ tends to being non-invertible.



I wanted to find an equivalent theorem for matrices. I came up with:



For matrices and vectors, given the equation $Xy=a$, then $y→∞$ as $X$ tends to being non-invertible (singular), i.e. as $X→A$, where $A$ is such that $Az=0$ has a non trivial solution.



Is this correct? Where can I find this in a book?



More interestingly, I have an idea that there are as many infinite entries in $y→∞$ as there are non-zero entries in $z$. Is this correct too? If so, how could I prove it?



Please help.







matrices






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 10 at 1:35







a.giannel

















asked Jan 10 at 1:03









a.giannela.giannel

163




163








  • 1




    $begingroup$
    I appreciate the curiosity behind this question, but I'm really struggling to make sense of it. When you say, "$x$ tends to being invertible", at one point you mean it tending to $0$ (the only non-invertible scalar), and at another, where $X$ tends to a singular matrix $A$. Do you mean "singular" (non-invertible) when you say "invertible"?
    $endgroup$
    – Theo Bendit
    Jan 10 at 1:30










  • $begingroup$
    Thank you for the corrections.
    $endgroup$
    – a.giannel
    Jan 10 at 1:36










  • $begingroup$
    Suppose $X$ is $ntimes m$. Then consider the $n$ rows of the matrix equation $Xy=a$. The $i$th row has the form $$sum_{j=1}^{m}x_{i,j}cdot y_j=a_i$$ If even one entry of $y$ explodes, say $y_kto infty$, then we can rewrite $$x_{i,k}cdot y_k=a_i-sum_{substack{j=1\jneq k}}^{m}x_{i,j}cdot y_j$$ so that $x_{i,j}to 0$ for every row $i$. But a matrix with a column of zeros is singular, and so not invertible.
    $endgroup$
    – nathan.j.mcdougall
    Jan 10 at 1:45












  • $begingroup$
    Very interesting and cleaver. Thank you. Do you believe that with that I can work on to find a solution the second part of the question, regarding the number of infinite entries for $y$ and zero entries for $z$?
    $endgroup$
    – a.giannel
    Jan 10 at 1:50








  • 1




    $begingroup$
    The analogy with scalars breaks down pretty quickly. For any vector $y$ you can construct a nonzero matrix $A$ such that $Ay=0$. On the flip side, you can construct $A$ such that the $i$th element of $y$ has no effect on the value of $Ay$, so you’ll need to sharpen up what you mean by $ytoinfty$.
    $endgroup$
    – amd
    Jan 10 at 3:19
















  • 1




    $begingroup$
    I appreciate the curiosity behind this question, but I'm really struggling to make sense of it. When you say, "$x$ tends to being invertible", at one point you mean it tending to $0$ (the only non-invertible scalar), and at another, where $X$ tends to a singular matrix $A$. Do you mean "singular" (non-invertible) when you say "invertible"?
    $endgroup$
    – Theo Bendit
    Jan 10 at 1:30










  • $begingroup$
    Thank you for the corrections.
    $endgroup$
    – a.giannel
    Jan 10 at 1:36










  • $begingroup$
    Suppose $X$ is $ntimes m$. Then consider the $n$ rows of the matrix equation $Xy=a$. The $i$th row has the form $$sum_{j=1}^{m}x_{i,j}cdot y_j=a_i$$ If even one entry of $y$ explodes, say $y_kto infty$, then we can rewrite $$x_{i,k}cdot y_k=a_i-sum_{substack{j=1\jneq k}}^{m}x_{i,j}cdot y_j$$ so that $x_{i,j}to 0$ for every row $i$. But a matrix with a column of zeros is singular, and so not invertible.
    $endgroup$
    – nathan.j.mcdougall
    Jan 10 at 1:45












  • $begingroup$
    Very interesting and cleaver. Thank you. Do you believe that with that I can work on to find a solution the second part of the question, regarding the number of infinite entries for $y$ and zero entries for $z$?
    $endgroup$
    – a.giannel
    Jan 10 at 1:50








  • 1




    $begingroup$
    The analogy with scalars breaks down pretty quickly. For any vector $y$ you can construct a nonzero matrix $A$ such that $Ay=0$. On the flip side, you can construct $A$ such that the $i$th element of $y$ has no effect on the value of $Ay$, so you’ll need to sharpen up what you mean by $ytoinfty$.
    $endgroup$
    – amd
    Jan 10 at 3:19










1




1




$begingroup$
I appreciate the curiosity behind this question, but I'm really struggling to make sense of it. When you say, "$x$ tends to being invertible", at one point you mean it tending to $0$ (the only non-invertible scalar), and at another, where $X$ tends to a singular matrix $A$. Do you mean "singular" (non-invertible) when you say "invertible"?
$endgroup$
– Theo Bendit
Jan 10 at 1:30




$begingroup$
I appreciate the curiosity behind this question, but I'm really struggling to make sense of it. When you say, "$x$ tends to being invertible", at one point you mean it tending to $0$ (the only non-invertible scalar), and at another, where $X$ tends to a singular matrix $A$. Do you mean "singular" (non-invertible) when you say "invertible"?
$endgroup$
– Theo Bendit
Jan 10 at 1:30












$begingroup$
Thank you for the corrections.
$endgroup$
– a.giannel
Jan 10 at 1:36




$begingroup$
Thank you for the corrections.
$endgroup$
– a.giannel
Jan 10 at 1:36












$begingroup$
Suppose $X$ is $ntimes m$. Then consider the $n$ rows of the matrix equation $Xy=a$. The $i$th row has the form $$sum_{j=1}^{m}x_{i,j}cdot y_j=a_i$$ If even one entry of $y$ explodes, say $y_kto infty$, then we can rewrite $$x_{i,k}cdot y_k=a_i-sum_{substack{j=1\jneq k}}^{m}x_{i,j}cdot y_j$$ so that $x_{i,j}to 0$ for every row $i$. But a matrix with a column of zeros is singular, and so not invertible.
$endgroup$
– nathan.j.mcdougall
Jan 10 at 1:45






$begingroup$
Suppose $X$ is $ntimes m$. Then consider the $n$ rows of the matrix equation $Xy=a$. The $i$th row has the form $$sum_{j=1}^{m}x_{i,j}cdot y_j=a_i$$ If even one entry of $y$ explodes, say $y_kto infty$, then we can rewrite $$x_{i,k}cdot y_k=a_i-sum_{substack{j=1\jneq k}}^{m}x_{i,j}cdot y_j$$ so that $x_{i,j}to 0$ for every row $i$. But a matrix with a column of zeros is singular, and so not invertible.
$endgroup$
– nathan.j.mcdougall
Jan 10 at 1:45














$begingroup$
Very interesting and cleaver. Thank you. Do you believe that with that I can work on to find a solution the second part of the question, regarding the number of infinite entries for $y$ and zero entries for $z$?
$endgroup$
– a.giannel
Jan 10 at 1:50






$begingroup$
Very interesting and cleaver. Thank you. Do you believe that with that I can work on to find a solution the second part of the question, regarding the number of infinite entries for $y$ and zero entries for $z$?
$endgroup$
– a.giannel
Jan 10 at 1:50






1




1




$begingroup$
The analogy with scalars breaks down pretty quickly. For any vector $y$ you can construct a nonzero matrix $A$ such that $Ay=0$. On the flip side, you can construct $A$ such that the $i$th element of $y$ has no effect on the value of $Ay$, so you’ll need to sharpen up what you mean by $ytoinfty$.
$endgroup$
– amd
Jan 10 at 3:19






$begingroup$
The analogy with scalars breaks down pretty quickly. For any vector $y$ you can construct a nonzero matrix $A$ such that $Ay=0$. On the flip side, you can construct $A$ such that the $i$th element of $y$ has no effect on the value of $Ay$, so you’ll need to sharpen up what you mean by $ytoinfty$.
$endgroup$
– amd
Jan 10 at 3:19












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%2f3068123%2fwhat-is-the-equivalent-of-xy-a-then-y%25e2%2586%2592%25e2%2588%259e-as-x%25e2%2586%25920-for-matrices%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%2f3068123%2fwhat-is-the-equivalent-of-xy-a-then-y%25e2%2586%2592%25e2%2588%259e-as-x%25e2%2586%25920-for-matrices%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

Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

A Topological Invariant for $pi_3(U(n))$