Eigenvalues and Eigenvectors
[157/55%]Find the eigenvalues and normalized eigenvectors of the matrix
Are the eigenvectors orthogonal to each other?
Find the eigenvalues and normalized eigenvectors of the matrix
Consider the normalized vector in
Calculate the matrix , where are the Pauli spin matrices. Is the matrix unitary? Find the trace and the determinant. Is the matrix hermitian? Find the eigenvalues and normalized eigenvectors of .
Find all solutions of the linear equation
with the condition that and , i.e. the vector must be normalized. What type of equation is (1)?
Let . Find the eigenvalues and eigenvectors of the matrix
For we obtain the Pauli spin matrix , for we have the Hadamard matrix and for we obtain the Pauli spin matrix .
Let . Find the eigenvalues and eigenvectors of the matrix
The matrices and are connected via the invertible transformation .
Let be a matrix. Assume that and . What can be said about the eigenvalues of ?
Find all matrices over which admit the normalized eigenvectors
with the corresponding eigenvalues and .
Find the eigenvalues and normalized eigenvectors of the matrix
Extend the problem to the matrix
This matrix contains the Pauli spin matrices for ; ; .
Let . Consider the matrix
Find the trace and determinant of .
Find the eigenvalues of .
Any positive semidefinite matrix over can be written in this form. Try the matrix with all entries .
Let . Consider the matrices
Find the trace and determinant of these matrices. Show that for the matrix the eigenvalues depend on but the eigenvectors do not. Show that for the matrix the eigenvalues do not depend on but the eigenvectors do.
Let . Consider the matrices
Find the trace and determinant of these matrices. Show that for the matrix the eigenvalues depend on but the eigenvectors do not. Show that for the matrix the eigenvalues do not depend on but the eigenvectors do.
Let and . Consider the hermitian matrix
with the real eigenvalues and . What conditions are imposed on the matrix elements of if ?
Let . Find the eigenvalues of the matrix and the matrix .
Let be a nonzero column vector in . Then is an matrix and is a real number. Show that is an eigenvalue of and is the corresponding eigenvector.
Let be a nonzero column vector in and . Consider the matrix . Find one nonzero eigenvalue and the corresponding eigenvector of this matrix.
Consider the Pauli spin matrix with the eigenvalues and and the corresponding normalized eigenvectors
With the two normalized eigenvectors we form the unitary matrix
Find the eigenvalues and normalized eigenvectors of .
Let be the Pauli spin matrices. Find the eigenvalues and normalized eigenvectors of the nonnormal matrix
Find all matrices over that admit only one eigenvector.
Consider the matrix
Can one find a condition on the parameter so that has only one eigenvector?
Find all matrices over which commute with
What is the relation between the eigenvectors of these matrices?
Let , be matrices over and vectors , in such that , , and , . Show that and have an eigenvalue .
Find all matrices , which satisfy the conditions given in (i). Use
Let be a normal nonsymmetric matrix over the real numbers. Show that
is an eigenvector of .
Let and consider the symmetric matrix
Show that is an eigenvalue of and find the corresponding eigenvector. Find the two other eigenvalues and normalized eigenvectors.
Let . Find the eigenvalues of
Do the eigenvalues cross as a function of ?
Let . Find the eigenvalues and eigenvectors of the matrix
Discuss the dependence of the eigenvalues and eigenvectors on .
Let . Find the eigenvalues of the symmetric matrix
Discuss the eigenvalues as functions of .
Consider the following matrix and vector in
where and with . Show that using this vector we can find the eigenvalues and eigenvectors of . Start of with .
Consider the symmetric matrix over
Find an invertible matrix such that is a diagonal matrix. Construct the matrix from the normalized eigenvectors of .
Find the eigenvalues of the symmetric matrix over
using the trace and the determinant of the matrix and the information that two eigenvalues are the same.
Consider the symmetric matrix
over . Write down the characteristic polynomial and express it using the trace and determinant of .
Consider the quadratic form
Write this equation in matrix form and find the eigenvalues and normalized eigenvectors of the matrix.
Let be an matrix over . Assume that is hermitian and unitary. What can be said about the eigenvalues of ?
An matrix such that is called idempotent. What can be said about the eigenvalues of such a matrix?
An matrix for which , where is a positive integer, is called nilpotent. What can be said about the eigenvalues of such a matrix?
An matrix such that is called involutory. What can be said about the eigenvalues of such a matrix?
Let be an matrix over . Show that the eigenvectors corresponding to distinct eigenvalues are linearly independent.
Show that eigenvectors of a normal matrix corresponding to distinct eigenvalues are orthogonal.
Let be an hermitian matrix, i.e. . Assume that all eigenvalues are different. Then the normalized eigenvectors form an orthonormal basis in . Consider
where denotes the scalar product in and are real constants with . Show that if no eigenvalue lies between and , then .
Let be an arbitrary matrix over . Let
Let be an eigenvalue of and be the corresponding normalized eigenvector (column vector).
Show that .
Show that the real part of the eigenvalue is given by and the imaginary part is given by .
Let and be the eigenvalues of the matrix
Find without calculating the eigenvalues of or .
Consider the column vectors and in
where and .
Calculate .
Calculate .
Calculate the matrix , and . Discuss.
Let be a nonzero column vector in . Consider the matrix
Is an eigenvector of this matrix? If so what is the eigenvalue?
Let be nonzero column vectors in and . Consider the matrix over
Find the nonzero eigenvalues of and the corresponding eigenvector. Note that .
Let be an matrix over . We define
Show that each eigenvalue of satisfies at least one of the following inequalities
In other words show that all eigenvalues of can be found in the union of disks
This is Gersgorin disk theorem.
Apply this theorem to the unitary matrix
Apply this theorem to the nonnormal matrix
Let be a normal matrix over , i.e. . Show that if is an eigenvector of with eigenvalue , then is an eigenvector of with eigenvalue .
Show that an matrix is singular if and only if at least one eigenvalue is .
Let be an invertible matrix. Show that if is an eigenvector of with eigenvalue , then is an eigenvector of with eigenvalue .
Let be an matrix over . Show that and have the same eigenvalues.
Let be an real symmetric matrix and
The following statements hold (maximum principle)
-
is the largest eigenvalue of the matrix and is the eigenvector corresponding to eigenvalue .
-
(inductive statement). Let subject to the constraints
-
, .
-
.
Then is the th eigenvalue of , and is the corresponding eigenvectors of . Apply the maximum principle to the symmetric matrix
-
Let be an matrix. An matrix can have at most linearly independent eigenvectors. Now assume that has eigenvectors (at least one must be linearly dependent) such that any of them are linearly independent. Show that is a scalar multiple of the identity matrix .
An stochastic matrix satisfies the following conditions
and
Show that a stochastic matrix always has at least one eigenvalue equal to one.
The matrix difference equation
with the column vector (vector of probabilities)
and the matrix
plays a role in random walk in one dimension. is called the transition probability matrix and denotes the probability that at a given time step the particle jumps to either of its nearest neighbor sites and the probability that the particle does not jump either to the right of left is . The matrix is of the type known as circulant matrix. Such an matrix is of the form
with the normalized eigenvectors
Use this result to find the eigenvalues of the matrix .
Use (i) to find the eigenvalues of the matrix .
Use (ii) to find (), where we expand the initial distribution vector in terms of the eigenvectors
Assume that . Give the time evolution of .
Let be a positive integer. Consider the matrix with rows of elements summing to unity
where the values of are such that , , , . Thus the matrix is a stochastic matrix. Find the eigenvalues of .
Let be a unitary matrix and an eigenvector of with the corresponding eigenvalue , i.e. .
Show that .
Let be distinct eigenvalues of a unitary matrix with the corresponding eigenvectors and , i.e. , . Show that .
Let be matrices over and . Let and assume that is chosen so that and exist. Show that
This is called the second resolvent identity.
An matrix is called a Hadamard matrix if each entry of is or and if the rows or columns of are orthogonal, i.e.
Note that and are equivalent. Hadamard matrices of order can be generated recursively by defining
for . Show that the eigenvalues of are given by and each of multiplicity .
An matrix over the complex numbers is called positive semidefinite (written as ), if
Show that for every , there exists a unique so that . Thus is a square root of .
Consider the polynomial , . Find a matrix such that its characteristic polynomial is .
Consider the polynomial , . Find a matrix such that its characteristic polynomial is .
Calculate the eigenvalues of the matrix
by calculating the eigenvalues of .
If is a commuting family of matrices that is to say for every pair from the set, then there exists a unitary matrix such that for all in the set the matrix is upper triangular. Apply this to the matrices
Let be an matrix over . The spectral radius of the matrix is the non-negative number defined by
where are the eigenvalues of . We define the norm of as
where denotes the Euclidean norm of the vector .
Show that .
Consider the matrix
Now . If , then . Calculate . Calculate .
Let be an matrix with entries and with positive spectral radius . Then there is a (column) vector with and a (column) vector such that the following conditions hold
Consider the symmetric matrix
Show that has a positive spectral radius. Find the vectors and .
Consider a symmetric matrix over with , , and for . Is the matrix positive definite?
Let be a positive definite matrix. Show that exists and is also positive definite.
Find the eigenvalues of the symmetric matrices
Consider the cyclic matrix
where . Show that
is a normalized eigenvector of . Find the eigenvalues.
Let . Find on inspection two eigenvectors and the corresponding eigenvalues of the symmetric matrix
Let . Find on inspection two eigenvectors and the corresponding eigenvalues of the matrix
Consider the two permutation matrices
Show that the two matrices have the same (normalized) eigenvectors. Find the commutator .
Let . Consider the symmetric matrix
Find the characteristic equation.
Show that
where denote the eigenvalues.
Let be a matrix with eigenvalues and . Find the eigenvalues of the matrix
Let be an eigenvector of with eigenvalue . What can be said about an eigenvector of the matrix given by eigenvector and eigenvalue of ?
Let be two matrices over . The set of all matrices of the form with is said to be a pencil. The eigenvalues of the pencil are elements of the set defined by
If and , then is referred to as an eigenvector of . Note that may be finite, empty or infinite. Let
Find the eigenvalue of the pencil.
Let be an matrix with eigenvalues . Let . What are the eigenvalues of ?
Let be matrices over . Let . Assume that and and . What can be said about the eigenvalues of ?
Let be matrices. Show that and have the same eigenvalues.
Can we conclude that every eigenvector of is also an eigenvector of ?
Show that if is an matrix and if is an matrix, then is an eigenvalue of the matrix if and only if is an eigenvalue of the matrix . Show that if then the conclusion is true even for .
Let be an matrix () over . Show that at least one eigenvalue of the matrix is equal to . Show that the eigenvalues of the matrix are also eigenvalues of .
We know that a hermitian matrix has only real eigenvalues. Can we conclude that a matrix with only real eigenvalues is hermitian?
Let be an matrix over . Show that the eigenvalues of are nonnegative.
Let be a positive integer. Consider the matrix
Show that the eigenvalues of are real and not of absolute value .
Let be the matrix
Find the eigenvalues.
Let be an matrix over . Assume that . What can be said about the eigenvalues of ?
Consider the symmetric matrix over
This matrix plays a role in the construction of the icosahedron which is a regular polyhedron with identical equilateral triangular faces, edges and vertices.
Find the eigenvalues of this matrix.
Consider the matrix . Find the eigenvalues.
The matrix induces an Euclidean structure on the quotient space . Find the dimension of .
Let be an matrix over . Let be an eigenvalue of . A generalized eigenvector of corresponding to the eigenvalue is a nontrivial solution of
for some , where is the -dimensional zero vector. For we find the eigenvectors. It follows that is a generalized eigenvector of corresponding to if and only if
Find the eigenvectors and generalized eigenvectors of the nonnormal matrix
Consider the matrix
A matrix is called a symplectic matrix if .
Show that symplectic matrices are nonsingular.
Show that the product of two symplectic matrices and is also symplectic.
Show that if is symplectic and are also symplectic.
Let be a symplectic matrix. Show that if , then , where denotes the spectrum of .
Let be matrices over and a nonzero vector in . Assume that and . Find .
Let be matrices over with . Then , where . Let be an eigenvector of the matrix with eigenvalue . Show that is also an eigenvector of , where .
Let be an normal matrix over . How would one apply genetic algorithms to find the eigenvalues of . This means we have to construct a fitness function with the minima as the eigenvalues. The eigenvalue equation is given by ( and with ). The characteristic equation is . What would be a fitness function? Apply it to the matrices
Let be a nonzero column vector in . Matrix multiplication is associative. Then we have . Discuss.
Let and even. Consider an hermitian matrix . Thus the eigenvalues are real. Assume we have the information that if is an eigenvalue then is also an eigenvalue of . How can the calculation of the eigenvalues be simplified with this information?
Let be two nonzero matrices over . Let be the eigenvalue equation for . Assume that . Then from it follows that
Therefore . If we find that is an eigenvector of with eigenvalue . Apply it to and .
Let be two nonzero matrices over . Let be the eigenvalue equation for . Assume that . Then from it follows that
Therefore . If we have an eigenvalue equation with eigenvalue . Apply it to and , where .
Consider the real symmetric matrices
Find the eigenvalues and normalized eigenvectors for the matrices and .
Find the commutator .
Discuss the results from (ii) and (i) with respect to the eigenvectors.
Consider the Pauli spin matrix with the eigenvalues and the corresponding normalized eigenvectors
Then admits the eigenvalues (twice) and (twice). Show that there are product states as eigenvectors and two sets of entangled eigenvectors for .
Let be an invertible matrix. Given the eigenvalues and eigenvectors of . What can be said about the eigenvalues of ?
Let and be a normal matrix. Assume that is invertible. The eigenvalue equation is given by for and for all . Find all the eigenvalues and eigenvectors of the matrix
Find and .
Let be an matrix over given by
where is a diagonal matrix over and are column vectors in . The eigenvalue equation is given by
Assume that . Show that
where are the diagonal elements of .
Let be an matrix over with eigenvalues . Find the eigenvalues of the matrix
Is this matrix skew-symmetric over ?
Consider the nonnormal matrix
For , let be the greatest common divisor of the entries of . Show that
Use the eigenvalues of and the characteristic polynomial.
The matrix
is the starting matrix in the construction of the Hironaka curve utilizing the Kronecker product.
Find and the rank of and .
Find and the eigenvalues of . Find and the eigenvalues of . Compare the eigenvalues of and . Discuss.
Calculate and . Calculate the eigenvalues of
Consider the unitary matrix
Find the eigenvalues and normalized eigenvectors of .
Can the normalized eigenvectors of be written as Kronecker product of two normalized vectors in . If so they are not entangled.
Consider the Hilbert space . Let be matrices acting in . We consider the nonlinear eigenvalue problem
where and . Let be the Pauli spin matrices. Find the solutions of the nonlinear eigenvalue problem
where and .
Let be an symmetric matrix over . Since is symmetric over there exists a set of orthonormal eigenvectors which form an orthonormal basis in . Let be a reasonably good approximation to an eigenvector, say . Calculate
The quotient is called Rayleigh quotient. Discuss.
Let . Find the trace, determinant, eigenvalues and eigenvectors of the matrices
Find the eigenvalues and normalized eigenvectors of the matrix ()
Is the matrix invertible? Make the decision by looking at the eigenvalues. If so find the inverse matrix.
Let . Find the eigenvalues and eigenvectors of
For which is not invertible? Let . Consider the matrix
For we have the Pauli spin matrix and for we have the Hadamard matrix. Find the eigenvalues and eigenvectors of .
Let . Find the eigenvalues and normalized eigenvectors of the matrix
Find the shortest distance between and .
Let . Show that the eigenvalues of the hermitian matrix
are given by and thus cannot be negative.
Let be the golden ratio. Consider the modular matrix
Show that the eigenvalues are given by and , where and the normalized eigenvectors are
Consider the two matrices
Show that , , , and that the eigenvalues of the two matrices are the same, namely
The symmetric matrix over
plays a role for the chemical compounds and . Find the eigenvalues and eigenvectors of . Then find the inverse of . Find all such that .
Let . Find the eigenvalues and eigenvectors of the symmetric matrix
The characteristic equation is .
Find the eigenvalues and eigenvectors of the orthogonal matrices
Find the eigenvalues and eigenvectors of .
Find the eigenvalues and eigenvectors of the matrices
Let be a normal matrix over with eigenvalues and corresponding eigenvectors , respectively. Let . What can be said about the eigenvalues and eigenvectors of the matrices
Let . Find the eigenvalues and eigenvectors of the matrices
Consider the matrix
Show that the characteristic polynomial is given by . Find the eigenvalues. Calculate , , . Then identify with a black square and with a white square. Draw the pictures.
Let and . Consider the three matrices
Find the eigenvalues and eigenvectors of the matrices. These matrices play a role for the Majorana neutrino.
Let .
Find the eigenvalues and eigenvectors of the matrices
Extend to matrices.
Find the eigenvalues and eigenvectors of the matrices
Extend to the case.
Consider the matrix
Find the eigenvalues of the matrices and by only calculating the eigenvalues of .
Let say we want to calculate the eigenvalues of the matrix
How could we utilize the facts that
and and thus avoid solving ?
Let be an diagonalizable matrix with distinct eigenvalues (). Show that the Vandermonde matrix
is nonsingular.
Let be the Pauli spin matrices. Solve the nonlinear eigenvalue problem
where and .
Solve the nonlinear eigenvalue problem
where and . Compare the result to (i). Discuss.
Let be matrices over . We define the star product
Thus the right-hand side is an matrix. Assume we know the eigenvalues and eigenvectors of the two matrices on the left-hand side. What can be said about the eigenvalues and eigenvectors of the matrix of the right-hand side?
Consider a matrix over with
What can be said about the eigenvalues of such a matrix?
Consider the Hadamard matrix
The eigenvalues of the Hadamard matrix are given by and with the corresponding normalized eigenvectors
How can this information be used to find the eigenvalues and eigenvectors of the Bell matrix
Let be an unitary matrix. Assume that , i.e. the matrix is also skew-hermitian. Find the eigenvalues of such a matrix.
Let be an unitary matrix. What can be concluded about the eigenvalues of if ?
Find the eigenvalues of the staircase matrices
Let be hermitian matrices over and eigenvalues and , respectively. Assume that (scalar product). What can be said about the eigenvalues of ?
Consider the reverse-diagonal unitary matrix
where (). Find the eigenvalues and eigenvectors.
Let be matrices over . The two matrices and have a common eigenvector if and only if the matrix
is singular, i.e. the determinant is equal to .
Apply the theorem to the matrices
Apply the theorem to the matrices
Let . Consider the matrix (correlation matrix) with the entries , . Find the eigenvalues of . Show that if the distribution of its eigenvalues becomes a continuous function of
Let be an matrix over . Show that is normal if and only if there exists an unitary matrix and an diagonal matrix such that . Note that .
Let be a normal matrix over . Show that has a set of orthonormal eigenvectors. Show that if has a set of orthonormal eigenvectors, then is normal.
The symplectic matrix is defined by
The matrix is unitary and skew-hermitian. Find the eigenvalues of from this information.
Find the eigenvalues of the matrix
Let be an matrix over . Let be the eigenvalues. What can be said about the eigenvalues of the matrix
Given the matrix
Prove or disprove that exactly two eigenvalues are .
Let be an matrix over . What is the condition on such that all eigenvalues are and admits only one eigenvector?
Consider the matrix
Hence an arbitrary Jordan block is given by , where . Find the eigenvalues of
Let be the identity matrix, be the zero matrix and be the Pauli spin matrix.
Find the eigenvalues and normalized eigenvectors of the matrix
Find the eigenvalues and normalized eigenvectors of the matrix
Can the results from (i) be utilized here?
Find the eigenvalues of the matrices
Let . Consider the tridiagonal matrix
with (). It has in general complex eigenvalues the roots of the characteristic polynomial . Show that this polynomial can be evaluated by the recursive formula
Consider an symmetric tridiagonal matrix over . Let and
for and , . Then
for . Find for the matrix
Let with . Consider the tridiagonal hermitian matrix
Find the eigenvalues and eigenvectors. Let be an eigenvectors. Find , , .
Let be an invertible matrix with eigenvalues (counting degeneracy). Find the eigenvalues of
Let be an semi-positive definite matrix with for . Show that for all eigenvalues of .
Given an permutation matrix .
Assume that is even and . Can we conclude that half of the eigenvalues of such a matrix are and the other half are ?
Assume that is odd and . Can we conclude that the eigenvalues are given by the solutions of ?
Let be an matrix over . The characteristic polynomial of is defined by
The eigenvalues of are the solutions of the characteristic equation . The coefficients () are given by
Another set of symmetric polynomials is given by the traces of powers of the matrix , namely
One has (so-called Newton relation)
where . Consider the matrix
Calculate from the traces of the powers of . Then apply the Newton relation to find .
Is the stochastic matrix
diagonalizable? First find the eigenvalues and normalized eigenvectors.
Find the eigenvalues and eigenvectors of the stochastic matrix
Find the eigenvalues and eigenvectors of the stochastic matrix
where , , .
Find the eigenvalues of the double stochastic matrices
Let . Find the eigenvalues of the matrices
Generalize to the case. Note that for the matrix we find
Show that the eigenvalues the matrix
are given by (2 times) and . Find the eigenvectors.
Consider the matrices
Find the eigenvalues of and and the eigenvalues of the commutator . Are the matrices and similar?
What can be said about the eigenvalues and eigenvectors of a nonzero hermitian matrix with and . Give one eigenvalue of . Give one eigenvalue of . Consider the case for the matrix . Find all the eigenvalues and eigenvectors.
Let be an matrix over . Show that the matrix admits the inverse matrix iff implies . Note that from it follows that and then .
Let and be matrices and
These are eigenvalue equations. Show that
and
Let and . Consider the matrix
Show that the eigenvalues of and are given by . Find the normalized eigenvectors.
Let . Consider the matrix over . Then is an matrix over and is an matrix over . Show that the eigenvalues of are also eigenvalues of and additionally admits the eigenvalue .
Let be matrices. We define the composition
Let
Find the eigenvalues of and .
Let . Find the eigenvalues of the matrix with .
Compare the lowest eigenvalues of the two matrices
Let be the matrices of the form
Thus the even dimensional matrix has along the skew-diagonal and along the lower main diagonal. Otherwise the entries are . The odd dimensional matrix has along the skew-diagonal except at the centre and along the lower main diagonal. Otherwise the entries are . Find the eigenvalues of these matrices.
Show that the eigenvalues are
Show that the eigenvalues are
Show that for the eigenvalues are
twice each.
Show that for we have the same eigenvalues as for and additional the eigenvalue . Extend to general .
Let and . Consider
Write down the matrix for and find the eigenvalues and normalized eigenvectors. Write down the matrix for and find the eigenvalues and normalized eigenvectors.
Find the spectrum of the matrix ()
Let be a unitary matrix. Assume that each column vector (which obviously is normalized) of can be written as the Kronecker product of two normalized vectors in .
Can we conclude that the eigenvectors of such a unitary matrix can also be written a Kronecker product of two vectors in ?
Can the matrix be written as a Kronecker product of two matrices?
Let be an matrix, be an matrix, be an matrix and be the matrices (). Let be a normalized eigenvector of with eigenvalue , be a normalized eigenvector of with eigenvalue and be a normalized eigenvector with eigenvalue . Consider
Show that is a normalized eigenvector of . Find the corresponding eigenvalue.
Let be an eigenvalue of the matrix with normalized eigenvector and be an eigenvalue of the matrix with normalized eigenvector . Show that is an eigenvalue of with normalized eigenvector .
Let be matrices over . Let be an eigenvalue of with corresponding normalized eigenvector and be an eigenvalue of with corresponding normalized eigenvector . Let be the Kronecker product of and . Then is an eigenvalue of with corresponding normalized eigenvector . Let be the direct sum of and . Then we have
Consequently
Thus the vector would be an eigenvector of if . Let be the star product
Thus the vector would be an eigenvector of if .
Study the eigenvalue problem for .
Apply the result to and , where denote the Pauli spin matrices. Both admit the eigenvalues .
Given the eigenvalues of the matrix . Find the eigenvalues of
Let and be normal matrices with eigenvalues and , respectively. Find the eigenvalues of .
Let . Consider the symmetric matrix
Show that an invertible matrix and diagonal matrix such that are given by
Let be an matrix with eigenvalue and eigenvector , i.e. , . Consider the matrix
where each term has Kronecker products. Show that
i.e. is an eigenvalue.
Consider the matrix
where and are vectors with complex entries, denoting the conjugate transpose of . Show that the characteristic polynomial is given by
Let and even. Find the eigenvalues of the matrices
Let . Write down the matrix with the entries
and find the eigenvalues.
Let be a hermitian matrix and an unitary matrix such that . We call invariant under . From it follows that . If is an eigenvector of , i.e. , then is also an eigenvector of since
The set of all unitary matrices () that leave a given hermitian matrix invariant, i.e. () form a group under matrix multiplication.
Find all hermitian matrices such that , where .
Find all hermitian matrices such that , where .
Find all hermitian matrices such that , where .
Find all hermitian matrices such that , where .
The Cartan matrix of a rank root system of a semi-simple Lie algebra is an matrix whose entries are derived from the simple roots. The entries of the Cartan matrix are given by
where is the Euclidean inner product and are the simple roots. The entries are independent of the choice of simple roots (up to ordering).
The Cartan matrix of the Lie algebra is given by the matrix
Show that the trace is equal to . Show that the determinant is equal to . Find the eigenvalues and eigenvectors of the matrix.
The Lie algebra is the rank Lie algebra with Cartan matrix
Find the eigenvalues and normalized eigenvectors of .
Let . Find the eigenvalues and eigenvectors of the three Cartan matrices
Let be an matrix. Let be the matrix with 's in the counter diagonal and 's otherwise. Let , . What can be said about the eigenvalues of ? Consider first the cases and .
Let be an matrix over . Let . We define
Given the eigenvalues of . What can be said about the eigenvalues of ?
Let be matrices over . Assume we know the eigenvalues and eigenvectors of and . What can be said about the eigenvalues and eigenvectors of and ?
Let be a unitary matrix. Assume that each column (vector) can be written as the Kronecker product of two vectors in . Can we conclude that the eigenvectors of such a unitary matrix can also be written a Kronecker product of two vectors in ?
Let be normal matrices. Consider the normal matrices
Given the eigenvalues and eigenvectors of , i.e. () and the eigenvalues and eigenvectors of , i.e. (). Then the eigenvalues and eigenvectors of are given by , . Assume that
i.e. considering the Hilbert space of the matrices with the scalar product the matrices and are orthogonal. What can be said about the eigenvalues and eigenvectors of ?
Let . Show that the four eigenvalues of the matrix
are given by .
Let . Show that the lowest eigenvalue of the symmetric matrix ()
is given by
Let be an normal matrix, i.e. . Let be an eigenvector of , i.e. . Show that is also an eigenvector of with eigenvalue , i.e.
Apply .
Let be an normal matrix. Assume that () are the eigenvalues of . Calculate
without using the eigenvalues. Apply the identity
Let be an matrix over , which satisfies , where is a constant. Obviously the equation is satisfied by the zero matrix. Assume that . Then we have a "type of eigenvalue equation".
Is an eigenvalue of ?
Take the determinant of both sides of the equation. Discuss. Study the cases that is invertible and non-invertible. If the matrix is invertible it follows that and . Taking the determinant yields
Study the case
and show that
where together with are the eigenvalues of .
Study .
Let be a matrix and be the star product. Study the case .
Study the case that .
The additive inverse eigenvalue problem is as follows: Let be an symmetric matrix over with for . Find a real diagonal matrix such that the matrix has the prescribed eigenvalues . The number of solutions for the real matrix varies from to . Consider the matrix and the prescribed eigenvalues , . Can one find a ? We have
Let be an normal matrix with pairwise different eigenvalues. Are the matrices
projection matrices?
Consider the hermitian matrix
Find and . We know that
Use Newton's method to solve this system of three equations to find the eigenvalues of .
Consider an permutation matrix . Obviously is always an eigenvalue since the column vector with all entries equal to is an eigenvector. Apply a brute force method and give a C++ implementation to figure out whether is an eigenvalue. We run over all column vectors of length , where the entries can only be or , where of course the cases with all entries or all entries can be omitted. Thus the number of column vectors we have to run through are . The condition then to be checked is . If true we have an eigenvalues with the corresponding eigenvector .
The power method is the simplest algorithm for computing eigenvectors and eigenvalues. Consider the vector space with the Euclidean norm of a vector . The iteration is as follows: Given a nonsingular matrix and a vector with . One defines
This defines a dynamical system on the sphere . Since is invertible we have
Apply the power method to the nonnormal matrix
Apply the power method to the Bell matrix
Consider the symmetric matrix over
Find the largest eigenvalue and the corresponding eigenvector using the power method. Start from the vector
The largest eigenvalue is with the eigenvector .
Let be an matrix over . Then any eigenvalue of satisfies the inequality
Write a C++ program that calculates the right-hand side of the inequality for a given matrix. Apply the complex class of STL. Apply it to the matrix