Eigenvector of the sum of two skew symmetric matrices

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 trying to understand how a perturbation of a skew symmetric matrix by another skew symmetric matrix affects the dominant eigenvector corresponding to $lambda=0$.



Specifically, let $S$ be an $n times n$ real-valued skew symmetric matrix , with $n$ being odd. Assume $S$ has eigenvectors $(e_1,...,e_n)$ and corresponding eigenvalues $(lambda_1,...,lambda_n)$, sorted such that $e_1=0$ (which is guaranteed because $n$ is odd). Thus, $e_1$ is the fixed point solution of $S$.



Let $M$ be another skew symmetric matrix of size $ntimes n$, with eigenvalues $(b_1,...,b_n)$ and eigenvalues $(theta_1,...,theta_n)$.



For some small $0<epsilonll1$, define:



$B=S+epsilon M$



Then $B$ is likewise skew symmetric, and can be thought of as the perturbation of $S$ by the matrix $M$. Can we approximate or calculate the leading eigenvector of $B$, corresponding to $lambda=0$, using the eigenvalue distribution of $B$ and $M$? In other words, can we approximate how much the fixed point of $S$ changes when perturbed by $M$?







share|cite|improve this question






















  • How do you know that $0$ is an eigenvalue? Are you assuming $n$ is odd?
    – Robert Israel
    Aug 17 at 23:16










  • And what precisely do you mean by "the elements of $M$ are an order of magnitude smaller than the elements of $S$"? They can't be smaller than all the elements of $S$, because the diagonal elements of $S$ are $0$.
    – Robert Israel
    Aug 17 at 23:22










  • @RobertIsrael Context makes it clear he means a perturbative ordering where $B = S + epsilon M$.
    – eyeballfrog
    Aug 18 at 0:30










  • Thanks, I've clarified the wording to specify n being odd and using the ϵ formulation
    – user3037237
    Aug 20 at 13:46














up vote
1
down vote

favorite












I am trying to understand how a perturbation of a skew symmetric matrix by another skew symmetric matrix affects the dominant eigenvector corresponding to $lambda=0$.



Specifically, let $S$ be an $n times n$ real-valued skew symmetric matrix , with $n$ being odd. Assume $S$ has eigenvectors $(e_1,...,e_n)$ and corresponding eigenvalues $(lambda_1,...,lambda_n)$, sorted such that $e_1=0$ (which is guaranteed because $n$ is odd). Thus, $e_1$ is the fixed point solution of $S$.



Let $M$ be another skew symmetric matrix of size $ntimes n$, with eigenvalues $(b_1,...,b_n)$ and eigenvalues $(theta_1,...,theta_n)$.



For some small $0<epsilonll1$, define:



$B=S+epsilon M$



Then $B$ is likewise skew symmetric, and can be thought of as the perturbation of $S$ by the matrix $M$. Can we approximate or calculate the leading eigenvector of $B$, corresponding to $lambda=0$, using the eigenvalue distribution of $B$ and $M$? In other words, can we approximate how much the fixed point of $S$ changes when perturbed by $M$?







share|cite|improve this question






















  • How do you know that $0$ is an eigenvalue? Are you assuming $n$ is odd?
    – Robert Israel
    Aug 17 at 23:16










  • And what precisely do you mean by "the elements of $M$ are an order of magnitude smaller than the elements of $S$"? They can't be smaller than all the elements of $S$, because the diagonal elements of $S$ are $0$.
    – Robert Israel
    Aug 17 at 23:22










  • @RobertIsrael Context makes it clear he means a perturbative ordering where $B = S + epsilon M$.
    – eyeballfrog
    Aug 18 at 0:30










  • Thanks, I've clarified the wording to specify n being odd and using the ϵ formulation
    – user3037237
    Aug 20 at 13:46












up vote
1
down vote

favorite









up vote
1
down vote

favorite











I am trying to understand how a perturbation of a skew symmetric matrix by another skew symmetric matrix affects the dominant eigenvector corresponding to $lambda=0$.



Specifically, let $S$ be an $n times n$ real-valued skew symmetric matrix , with $n$ being odd. Assume $S$ has eigenvectors $(e_1,...,e_n)$ and corresponding eigenvalues $(lambda_1,...,lambda_n)$, sorted such that $e_1=0$ (which is guaranteed because $n$ is odd). Thus, $e_1$ is the fixed point solution of $S$.



Let $M$ be another skew symmetric matrix of size $ntimes n$, with eigenvalues $(b_1,...,b_n)$ and eigenvalues $(theta_1,...,theta_n)$.



For some small $0<epsilonll1$, define:



$B=S+epsilon M$



Then $B$ is likewise skew symmetric, and can be thought of as the perturbation of $S$ by the matrix $M$. Can we approximate or calculate the leading eigenvector of $B$, corresponding to $lambda=0$, using the eigenvalue distribution of $B$ and $M$? In other words, can we approximate how much the fixed point of $S$ changes when perturbed by $M$?







share|cite|improve this question














I am trying to understand how a perturbation of a skew symmetric matrix by another skew symmetric matrix affects the dominant eigenvector corresponding to $lambda=0$.



Specifically, let $S$ be an $n times n$ real-valued skew symmetric matrix , with $n$ being odd. Assume $S$ has eigenvectors $(e_1,...,e_n)$ and corresponding eigenvalues $(lambda_1,...,lambda_n)$, sorted such that $e_1=0$ (which is guaranteed because $n$ is odd). Thus, $e_1$ is the fixed point solution of $S$.



Let $M$ be another skew symmetric matrix of size $ntimes n$, with eigenvalues $(b_1,...,b_n)$ and eigenvalues $(theta_1,...,theta_n)$.



For some small $0<epsilonll1$, define:



$B=S+epsilon M$



Then $B$ is likewise skew symmetric, and can be thought of as the perturbation of $S$ by the matrix $M$. Can we approximate or calculate the leading eigenvector of $B$, corresponding to $lambda=0$, using the eigenvalue distribution of $B$ and $M$? In other words, can we approximate how much the fixed point of $S$ changes when perturbed by $M$?









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 20 at 13:46

























asked Aug 17 at 23:01









user3037237

607




607











  • How do you know that $0$ is an eigenvalue? Are you assuming $n$ is odd?
    – Robert Israel
    Aug 17 at 23:16










  • And what precisely do you mean by "the elements of $M$ are an order of magnitude smaller than the elements of $S$"? They can't be smaller than all the elements of $S$, because the diagonal elements of $S$ are $0$.
    – Robert Israel
    Aug 17 at 23:22










  • @RobertIsrael Context makes it clear he means a perturbative ordering where $B = S + epsilon M$.
    – eyeballfrog
    Aug 18 at 0:30










  • Thanks, I've clarified the wording to specify n being odd and using the ϵ formulation
    – user3037237
    Aug 20 at 13:46
















  • How do you know that $0$ is an eigenvalue? Are you assuming $n$ is odd?
    – Robert Israel
    Aug 17 at 23:16










  • And what precisely do you mean by "the elements of $M$ are an order of magnitude smaller than the elements of $S$"? They can't be smaller than all the elements of $S$, because the diagonal elements of $S$ are $0$.
    – Robert Israel
    Aug 17 at 23:22










  • @RobertIsrael Context makes it clear he means a perturbative ordering where $B = S + epsilon M$.
    – eyeballfrog
    Aug 18 at 0:30










  • Thanks, I've clarified the wording to specify n being odd and using the ϵ formulation
    – user3037237
    Aug 20 at 13:46















How do you know that $0$ is an eigenvalue? Are you assuming $n$ is odd?
– Robert Israel
Aug 17 at 23:16




How do you know that $0$ is an eigenvalue? Are you assuming $n$ is odd?
– Robert Israel
Aug 17 at 23:16












And what precisely do you mean by "the elements of $M$ are an order of magnitude smaller than the elements of $S$"? They can't be smaller than all the elements of $S$, because the diagonal elements of $S$ are $0$.
– Robert Israel
Aug 17 at 23:22




And what precisely do you mean by "the elements of $M$ are an order of magnitude smaller than the elements of $S$"? They can't be smaller than all the elements of $S$, because the diagonal elements of $S$ are $0$.
– Robert Israel
Aug 17 at 23:22












@RobertIsrael Context makes it clear he means a perturbative ordering where $B = S + epsilon M$.
– eyeballfrog
Aug 18 at 0:30




@RobertIsrael Context makes it clear he means a perturbative ordering where $B = S + epsilon M$.
– eyeballfrog
Aug 18 at 0:30












Thanks, I've clarified the wording to specify n being odd and using the ϵ formulation
– user3037237
Aug 20 at 13:46




Thanks, I've clarified the wording to specify n being odd and using the ϵ formulation
– user3037237
Aug 20 at 13:46










2 Answers
2






active

oldest

votes

















up vote
0
down vote













Suppose $ker(S)$ is spanned by a single vector $bf u$ (in particular $n$ must be odd). Let $S^+$ be the Moore-Penrose pseudo-inverse of $S$.



Now it will be more convenient to write the perturbed matrix as $S + epsilon M$ where $epsilon$ is a parameter. Then it turns out that the following series (convergent for sufficiently small $epsilon$) gives us a vector in $ker(S+epsilon M)$:



$$ sum_k=0^infty epsilon^k (-S^+ M)^k bf u $$






share|cite|improve this answer




















  • Thanks --- I tried this computationally and unfortunately it doesn't give a good approximation. It generally end up being a near-constant vector of $approx (1/n,....1/n)$ regardless of choose of S and M.
    – user3037237
    Aug 20 at 13:46










  • If $epsilon$ is small it will be close to $bf u$, which is what you want.
    – Robert Israel
    Aug 20 at 15:52










  • Right, but the ultimate goal is trying to quantify how close to $vecu$, and whether or not this proximity can be inferred from the structure of $S$.
    – user3037237
    Aug 20 at 20:33

















up vote
0
down vote













The physicist's approach to such problems is to do first-order perturbation theory (below). I am not terribly confident in the applicability of this method because of the facts that (1) the matrices are skew-symmetric and therefore must have pairs of eigenvalues of equal magnitude and (2) $S$ is not invertible by assumption. However, this answer may still be helpful.



The typical argument goes like this. For parallel notation, I'll use $Delta S$ instead of $M$, and I'll call the eigenvector in question $v$ instead of $e_1$. Then we know $S v = 0$ and we want to find the solution to the new eigenvalue equation



$$ (S + Delta S)(v + Delta v) = Delta lambda (v + Delta v) $$



All terms that are first-order perturbations have a $Delta$. Now if we expand, use $Sv=0$, and retain only terms with a single $Delta$, we get



$$ S Delta v + Delta S v = Delta lambda v $$



The next step is to multiply through by $v^T$, since we know by the fact that $S$ is skew-symmetric that $v^T S$ is also $0$. Then we get



$$ v^T Delta S v = Delta lambda v^T v $$
or
$$ Delta lambda = fracv^T Delta S vv^T v = 0 $$



where the last equality follows from $Delta S$ being skew-symmetric.



At this point, the original equation has become



$$ (S + Delta S)(v + Delta v) = 0 $$



If we also assume that $lambda=0$ has multiplicity 1 in $S+Delta S$, this implies that $Delta v$ is parallel to $v$. Otherwise, following a suggestion from the comments and from another answer, we could apply $Sv=0$ and then try to use the Roger-Penrose pseudo-inverse as an inverse for $(S+Delta S)$. This would give



$$ Delta v = -v - (S + Delta S)^+ Delta S v $$



However, I do not personally know of any theorem that would guarantee that this gives a reasonable result. I suspect that because the eigenvalue is zero, there may be problems with applying perturbation theory here in general.






share|cite|improve this answer






















  • It should follow that △λ=0, given that e1=0. Since n is odd, there is always going to be one eigenvalue of zero. So I think you're on the right track, but the question I'm really interested in is the eigenvector. S is generally not invertible, but maybe the pseud-inverse could be used, as in the response below?
    – user3037237
    Aug 20 at 13:48










  • Sorry, I had missed the part about $e_1$ being $0$. I am not sure that this makes sense, given that part of the definition of an eigenvector is that it cannot be the zero vector. However, I realized while looking at this again that since $Delta S$ is skew-symmetric as well, then the expression $v^T Delta S v$ is zero for any vector, so I will edit the answer accordingly.
    – sasquires
    Aug 21 at 17:14










  • I also added a comment about the pseudo-inverse, but I have no idea if it will actually work or not. I have only used pseudo-inverses in very specific circumstances that do not apply here.
    – sasquires
    Aug 21 at 17:24










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%2f2886270%2feigenvector-of-the-sum-of-two-skew-symmetric-matrices%23new-answer', 'question_page');

);

Post as a guest






























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
0
down vote













Suppose $ker(S)$ is spanned by a single vector $bf u$ (in particular $n$ must be odd). Let $S^+$ be the Moore-Penrose pseudo-inverse of $S$.



Now it will be more convenient to write the perturbed matrix as $S + epsilon M$ where $epsilon$ is a parameter. Then it turns out that the following series (convergent for sufficiently small $epsilon$) gives us a vector in $ker(S+epsilon M)$:



$$ sum_k=0^infty epsilon^k (-S^+ M)^k bf u $$






share|cite|improve this answer




















  • Thanks --- I tried this computationally and unfortunately it doesn't give a good approximation. It generally end up being a near-constant vector of $approx (1/n,....1/n)$ regardless of choose of S and M.
    – user3037237
    Aug 20 at 13:46










  • If $epsilon$ is small it will be close to $bf u$, which is what you want.
    – Robert Israel
    Aug 20 at 15:52










  • Right, but the ultimate goal is trying to quantify how close to $vecu$, and whether or not this proximity can be inferred from the structure of $S$.
    – user3037237
    Aug 20 at 20:33














up vote
0
down vote













Suppose $ker(S)$ is spanned by a single vector $bf u$ (in particular $n$ must be odd). Let $S^+$ be the Moore-Penrose pseudo-inverse of $S$.



Now it will be more convenient to write the perturbed matrix as $S + epsilon M$ where $epsilon$ is a parameter. Then it turns out that the following series (convergent for sufficiently small $epsilon$) gives us a vector in $ker(S+epsilon M)$:



$$ sum_k=0^infty epsilon^k (-S^+ M)^k bf u $$






share|cite|improve this answer




















  • Thanks --- I tried this computationally and unfortunately it doesn't give a good approximation. It generally end up being a near-constant vector of $approx (1/n,....1/n)$ regardless of choose of S and M.
    – user3037237
    Aug 20 at 13:46










  • If $epsilon$ is small it will be close to $bf u$, which is what you want.
    – Robert Israel
    Aug 20 at 15:52










  • Right, but the ultimate goal is trying to quantify how close to $vecu$, and whether or not this proximity can be inferred from the structure of $S$.
    – user3037237
    Aug 20 at 20:33












up vote
0
down vote










up vote
0
down vote









Suppose $ker(S)$ is spanned by a single vector $bf u$ (in particular $n$ must be odd). Let $S^+$ be the Moore-Penrose pseudo-inverse of $S$.



Now it will be more convenient to write the perturbed matrix as $S + epsilon M$ where $epsilon$ is a parameter. Then it turns out that the following series (convergent for sufficiently small $epsilon$) gives us a vector in $ker(S+epsilon M)$:



$$ sum_k=0^infty epsilon^k (-S^+ M)^k bf u $$






share|cite|improve this answer












Suppose $ker(S)$ is spanned by a single vector $bf u$ (in particular $n$ must be odd). Let $S^+$ be the Moore-Penrose pseudo-inverse of $S$.



Now it will be more convenient to write the perturbed matrix as $S + epsilon M$ where $epsilon$ is a parameter. Then it turns out that the following series (convergent for sufficiently small $epsilon$) gives us a vector in $ker(S+epsilon M)$:



$$ sum_k=0^infty epsilon^k (-S^+ M)^k bf u $$







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Aug 18 at 0:31









Robert Israel

305k22201443




305k22201443











  • Thanks --- I tried this computationally and unfortunately it doesn't give a good approximation. It generally end up being a near-constant vector of $approx (1/n,....1/n)$ regardless of choose of S and M.
    – user3037237
    Aug 20 at 13:46










  • If $epsilon$ is small it will be close to $bf u$, which is what you want.
    – Robert Israel
    Aug 20 at 15:52










  • Right, but the ultimate goal is trying to quantify how close to $vecu$, and whether or not this proximity can be inferred from the structure of $S$.
    – user3037237
    Aug 20 at 20:33
















  • Thanks --- I tried this computationally and unfortunately it doesn't give a good approximation. It generally end up being a near-constant vector of $approx (1/n,....1/n)$ regardless of choose of S and M.
    – user3037237
    Aug 20 at 13:46










  • If $epsilon$ is small it will be close to $bf u$, which is what you want.
    – Robert Israel
    Aug 20 at 15:52










  • Right, but the ultimate goal is trying to quantify how close to $vecu$, and whether or not this proximity can be inferred from the structure of $S$.
    – user3037237
    Aug 20 at 20:33















Thanks --- I tried this computationally and unfortunately it doesn't give a good approximation. It generally end up being a near-constant vector of $approx (1/n,....1/n)$ regardless of choose of S and M.
– user3037237
Aug 20 at 13:46




Thanks --- I tried this computationally and unfortunately it doesn't give a good approximation. It generally end up being a near-constant vector of $approx (1/n,....1/n)$ regardless of choose of S and M.
– user3037237
Aug 20 at 13:46












If $epsilon$ is small it will be close to $bf u$, which is what you want.
– Robert Israel
Aug 20 at 15:52




If $epsilon$ is small it will be close to $bf u$, which is what you want.
– Robert Israel
Aug 20 at 15:52












Right, but the ultimate goal is trying to quantify how close to $vecu$, and whether or not this proximity can be inferred from the structure of $S$.
– user3037237
Aug 20 at 20:33




Right, but the ultimate goal is trying to quantify how close to $vecu$, and whether or not this proximity can be inferred from the structure of $S$.
– user3037237
Aug 20 at 20:33










up vote
0
down vote













The physicist's approach to such problems is to do first-order perturbation theory (below). I am not terribly confident in the applicability of this method because of the facts that (1) the matrices are skew-symmetric and therefore must have pairs of eigenvalues of equal magnitude and (2) $S$ is not invertible by assumption. However, this answer may still be helpful.



The typical argument goes like this. For parallel notation, I'll use $Delta S$ instead of $M$, and I'll call the eigenvector in question $v$ instead of $e_1$. Then we know $S v = 0$ and we want to find the solution to the new eigenvalue equation



$$ (S + Delta S)(v + Delta v) = Delta lambda (v + Delta v) $$



All terms that are first-order perturbations have a $Delta$. Now if we expand, use $Sv=0$, and retain only terms with a single $Delta$, we get



$$ S Delta v + Delta S v = Delta lambda v $$



The next step is to multiply through by $v^T$, since we know by the fact that $S$ is skew-symmetric that $v^T S$ is also $0$. Then we get



$$ v^T Delta S v = Delta lambda v^T v $$
or
$$ Delta lambda = fracv^T Delta S vv^T v = 0 $$



where the last equality follows from $Delta S$ being skew-symmetric.



At this point, the original equation has become



$$ (S + Delta S)(v + Delta v) = 0 $$



If we also assume that $lambda=0$ has multiplicity 1 in $S+Delta S$, this implies that $Delta v$ is parallel to $v$. Otherwise, following a suggestion from the comments and from another answer, we could apply $Sv=0$ and then try to use the Roger-Penrose pseudo-inverse as an inverse for $(S+Delta S)$. This would give



$$ Delta v = -v - (S + Delta S)^+ Delta S v $$



However, I do not personally know of any theorem that would guarantee that this gives a reasonable result. I suspect that because the eigenvalue is zero, there may be problems with applying perturbation theory here in general.






share|cite|improve this answer






















  • It should follow that △λ=0, given that e1=0. Since n is odd, there is always going to be one eigenvalue of zero. So I think you're on the right track, but the question I'm really interested in is the eigenvector. S is generally not invertible, but maybe the pseud-inverse could be used, as in the response below?
    – user3037237
    Aug 20 at 13:48










  • Sorry, I had missed the part about $e_1$ being $0$. I am not sure that this makes sense, given that part of the definition of an eigenvector is that it cannot be the zero vector. However, I realized while looking at this again that since $Delta S$ is skew-symmetric as well, then the expression $v^T Delta S v$ is zero for any vector, so I will edit the answer accordingly.
    – sasquires
    Aug 21 at 17:14










  • I also added a comment about the pseudo-inverse, but I have no idea if it will actually work or not. I have only used pseudo-inverses in very specific circumstances that do not apply here.
    – sasquires
    Aug 21 at 17:24














up vote
0
down vote













The physicist's approach to such problems is to do first-order perturbation theory (below). I am not terribly confident in the applicability of this method because of the facts that (1) the matrices are skew-symmetric and therefore must have pairs of eigenvalues of equal magnitude and (2) $S$ is not invertible by assumption. However, this answer may still be helpful.



The typical argument goes like this. For parallel notation, I'll use $Delta S$ instead of $M$, and I'll call the eigenvector in question $v$ instead of $e_1$. Then we know $S v = 0$ and we want to find the solution to the new eigenvalue equation



$$ (S + Delta S)(v + Delta v) = Delta lambda (v + Delta v) $$



All terms that are first-order perturbations have a $Delta$. Now if we expand, use $Sv=0$, and retain only terms with a single $Delta$, we get



$$ S Delta v + Delta S v = Delta lambda v $$



The next step is to multiply through by $v^T$, since we know by the fact that $S$ is skew-symmetric that $v^T S$ is also $0$. Then we get



$$ v^T Delta S v = Delta lambda v^T v $$
or
$$ Delta lambda = fracv^T Delta S vv^T v = 0 $$



where the last equality follows from $Delta S$ being skew-symmetric.



At this point, the original equation has become



$$ (S + Delta S)(v + Delta v) = 0 $$



If we also assume that $lambda=0$ has multiplicity 1 in $S+Delta S$, this implies that $Delta v$ is parallel to $v$. Otherwise, following a suggestion from the comments and from another answer, we could apply $Sv=0$ and then try to use the Roger-Penrose pseudo-inverse as an inverse for $(S+Delta S)$. This would give



$$ Delta v = -v - (S + Delta S)^+ Delta S v $$



However, I do not personally know of any theorem that would guarantee that this gives a reasonable result. I suspect that because the eigenvalue is zero, there may be problems with applying perturbation theory here in general.






share|cite|improve this answer






















  • It should follow that △λ=0, given that e1=0. Since n is odd, there is always going to be one eigenvalue of zero. So I think you're on the right track, but the question I'm really interested in is the eigenvector. S is generally not invertible, but maybe the pseud-inverse could be used, as in the response below?
    – user3037237
    Aug 20 at 13:48










  • Sorry, I had missed the part about $e_1$ being $0$. I am not sure that this makes sense, given that part of the definition of an eigenvector is that it cannot be the zero vector. However, I realized while looking at this again that since $Delta S$ is skew-symmetric as well, then the expression $v^T Delta S v$ is zero for any vector, so I will edit the answer accordingly.
    – sasquires
    Aug 21 at 17:14










  • I also added a comment about the pseudo-inverse, but I have no idea if it will actually work or not. I have only used pseudo-inverses in very specific circumstances that do not apply here.
    – sasquires
    Aug 21 at 17:24












up vote
0
down vote










up vote
0
down vote









The physicist's approach to such problems is to do first-order perturbation theory (below). I am not terribly confident in the applicability of this method because of the facts that (1) the matrices are skew-symmetric and therefore must have pairs of eigenvalues of equal magnitude and (2) $S$ is not invertible by assumption. However, this answer may still be helpful.



The typical argument goes like this. For parallel notation, I'll use $Delta S$ instead of $M$, and I'll call the eigenvector in question $v$ instead of $e_1$. Then we know $S v = 0$ and we want to find the solution to the new eigenvalue equation



$$ (S + Delta S)(v + Delta v) = Delta lambda (v + Delta v) $$



All terms that are first-order perturbations have a $Delta$. Now if we expand, use $Sv=0$, and retain only terms with a single $Delta$, we get



$$ S Delta v + Delta S v = Delta lambda v $$



The next step is to multiply through by $v^T$, since we know by the fact that $S$ is skew-symmetric that $v^T S$ is also $0$. Then we get



$$ v^T Delta S v = Delta lambda v^T v $$
or
$$ Delta lambda = fracv^T Delta S vv^T v = 0 $$



where the last equality follows from $Delta S$ being skew-symmetric.



At this point, the original equation has become



$$ (S + Delta S)(v + Delta v) = 0 $$



If we also assume that $lambda=0$ has multiplicity 1 in $S+Delta S$, this implies that $Delta v$ is parallel to $v$. Otherwise, following a suggestion from the comments and from another answer, we could apply $Sv=0$ and then try to use the Roger-Penrose pseudo-inverse as an inverse for $(S+Delta S)$. This would give



$$ Delta v = -v - (S + Delta S)^+ Delta S v $$



However, I do not personally know of any theorem that would guarantee that this gives a reasonable result. I suspect that because the eigenvalue is zero, there may be problems with applying perturbation theory here in general.






share|cite|improve this answer














The physicist's approach to such problems is to do first-order perturbation theory (below). I am not terribly confident in the applicability of this method because of the facts that (1) the matrices are skew-symmetric and therefore must have pairs of eigenvalues of equal magnitude and (2) $S$ is not invertible by assumption. However, this answer may still be helpful.



The typical argument goes like this. For parallel notation, I'll use $Delta S$ instead of $M$, and I'll call the eigenvector in question $v$ instead of $e_1$. Then we know $S v = 0$ and we want to find the solution to the new eigenvalue equation



$$ (S + Delta S)(v + Delta v) = Delta lambda (v + Delta v) $$



All terms that are first-order perturbations have a $Delta$. Now if we expand, use $Sv=0$, and retain only terms with a single $Delta$, we get



$$ S Delta v + Delta S v = Delta lambda v $$



The next step is to multiply through by $v^T$, since we know by the fact that $S$ is skew-symmetric that $v^T S$ is also $0$. Then we get



$$ v^T Delta S v = Delta lambda v^T v $$
or
$$ Delta lambda = fracv^T Delta S vv^T v = 0 $$



where the last equality follows from $Delta S$ being skew-symmetric.



At this point, the original equation has become



$$ (S + Delta S)(v + Delta v) = 0 $$



If we also assume that $lambda=0$ has multiplicity 1 in $S+Delta S$, this implies that $Delta v$ is parallel to $v$. Otherwise, following a suggestion from the comments and from another answer, we could apply $Sv=0$ and then try to use the Roger-Penrose pseudo-inverse as an inverse for $(S+Delta S)$. This would give



$$ Delta v = -v - (S + Delta S)^+ Delta S v $$



However, I do not personally know of any theorem that would guarantee that this gives a reasonable result. I suspect that because the eigenvalue is zero, there may be problems with applying perturbation theory here in general.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Aug 21 at 17:30

























answered Aug 18 at 0:29









sasquires

198110




198110











  • It should follow that △λ=0, given that e1=0. Since n is odd, there is always going to be one eigenvalue of zero. So I think you're on the right track, but the question I'm really interested in is the eigenvector. S is generally not invertible, but maybe the pseud-inverse could be used, as in the response below?
    – user3037237
    Aug 20 at 13:48










  • Sorry, I had missed the part about $e_1$ being $0$. I am not sure that this makes sense, given that part of the definition of an eigenvector is that it cannot be the zero vector. However, I realized while looking at this again that since $Delta S$ is skew-symmetric as well, then the expression $v^T Delta S v$ is zero for any vector, so I will edit the answer accordingly.
    – sasquires
    Aug 21 at 17:14










  • I also added a comment about the pseudo-inverse, but I have no idea if it will actually work or not. I have only used pseudo-inverses in very specific circumstances that do not apply here.
    – sasquires
    Aug 21 at 17:24
















  • It should follow that △λ=0, given that e1=0. Since n is odd, there is always going to be one eigenvalue of zero. So I think you're on the right track, but the question I'm really interested in is the eigenvector. S is generally not invertible, but maybe the pseud-inverse could be used, as in the response below?
    – user3037237
    Aug 20 at 13:48










  • Sorry, I had missed the part about $e_1$ being $0$. I am not sure that this makes sense, given that part of the definition of an eigenvector is that it cannot be the zero vector. However, I realized while looking at this again that since $Delta S$ is skew-symmetric as well, then the expression $v^T Delta S v$ is zero for any vector, so I will edit the answer accordingly.
    – sasquires
    Aug 21 at 17:14










  • I also added a comment about the pseudo-inverse, but I have no idea if it will actually work or not. I have only used pseudo-inverses in very specific circumstances that do not apply here.
    – sasquires
    Aug 21 at 17:24















It should follow that △λ=0, given that e1=0. Since n is odd, there is always going to be one eigenvalue of zero. So I think you're on the right track, but the question I'm really interested in is the eigenvector. S is generally not invertible, but maybe the pseud-inverse could be used, as in the response below?
– user3037237
Aug 20 at 13:48




It should follow that △λ=0, given that e1=0. Since n is odd, there is always going to be one eigenvalue of zero. So I think you're on the right track, but the question I'm really interested in is the eigenvector. S is generally not invertible, but maybe the pseud-inverse could be used, as in the response below?
– user3037237
Aug 20 at 13:48












Sorry, I had missed the part about $e_1$ being $0$. I am not sure that this makes sense, given that part of the definition of an eigenvector is that it cannot be the zero vector. However, I realized while looking at this again that since $Delta S$ is skew-symmetric as well, then the expression $v^T Delta S v$ is zero for any vector, so I will edit the answer accordingly.
– sasquires
Aug 21 at 17:14




Sorry, I had missed the part about $e_1$ being $0$. I am not sure that this makes sense, given that part of the definition of an eigenvector is that it cannot be the zero vector. However, I realized while looking at this again that since $Delta S$ is skew-symmetric as well, then the expression $v^T Delta S v$ is zero for any vector, so I will edit the answer accordingly.
– sasquires
Aug 21 at 17:14












I also added a comment about the pseudo-inverse, but I have no idea if it will actually work or not. I have only used pseudo-inverses in very specific circumstances that do not apply here.
– sasquires
Aug 21 at 17:24




I also added a comment about the pseudo-inverse, but I have no idea if it will actually work or not. I have only used pseudo-inverses in very specific circumstances that do not apply here.
– sasquires
Aug 21 at 17:24












 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2886270%2feigenvector-of-the-sum-of-two-skew-symmetric-matrices%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