Discussion Overview
The discussion revolves around the theory and methods for finding eigenvalues and eigenvectors of matrices. Participants explore various approaches, including similarity transformations and the QR algorithm, while questioning the existence of a general formula for eigenvectors.
Discussion Character
- Exploratory
- Technical explanation
- Debate/contested
Main Points Raised
- One participant questions the existence of a formula for finding eigenvectors, noting that while there are many theories for eigenvalues, none seem to exist for eigenvectors.
- Another participant explains that eigenvalues must be found before eigenvectors, emphasizing that two matrices with the same eigenvalues can have different eigenvectors, and provides the definition of an eigenvector.
- A participant discusses using similarity transformations to reduce a matrix to diagonal form, stating that the resulting matrix contains the eigenvalues and that the columns of the transformation matrices yield the corresponding eigenvectors.
- Another participant points out that not all matrices are diagonalizable, providing an example and mentioning that the best alternative is to reduce to Jordan normal form.
- A later reply clarifies that the QR algorithm converges to the Schur form, which is upper triangular, and questions whether the columns of the transformation matrices are generalized eigenvectors.
- One participant asserts that not all matrices are diagonalizable, responding to a previous comment without further elaboration.
Areas of Agreement / Disagreement
Participants express differing views on the existence of a general formula for eigenvectors and the diagonalizability of matrices. The discussion remains unresolved regarding the implications of these points.
Contextual Notes
Limitations include the dependence on definitions of eigenvalues and eigenvectors, as well as the conditions under which matrices can be diagonalized or reduced to Jordan normal form.