Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with linear-algebra
Search options not deleted
user 817600
For questions on linear algebra, including vector spaces, linear transformations, systems of linear equations, spanning sets, bases, dimensions and vector subspaces.
4
votes
Accepted
In computing eigenvalues, why does $A− \lambda I$ have to be a singular matrix?
Start with $Av=\lambda v$. Equivalently, we could write $Av=\lambda Iv$, since $Iv=v$. Then we can bring both terms to the left to get $Av-\lambda Iv=0$, or equivalently,
$$(A-\lambda I)v=0.$$
This me …
