Hjdcti

I was trying to get an intuitive grasp about what the the generalized eigenvector intuitively is. I read this nice answer, so I understand that in the basis given by the generalized eigenvectors, a jordan block is a linear map that is the sum of a stretch by a factor $lambda$ (eigenvalue associated to the block) and a "collapse", but I don't understand the conclusion on what these famous generalized eigenvectors actually are...

Thus the kernel of $(T−λI)k$ picks up all the Jordan blocks associated with eigenvalue $λ$ and, speaking somewhat loosely, each generalized eigenvector gets rescaled by $λ$, up to some "error" term generated by certain of the other generalized eigenvectors.

Maybe someone that actually understand the last argument can care to explain with some more detail? Thank you.

Don't look for anything particularly deep or fancy here.

If you have a calculation to do that involves some vectors and a linear operator $T$ that you apply perhaps to several of the vectors or more several times in sequence, then it can simplify the calculation if you represent the vectors in an eigenbasis -- since then we have
$$ T(x_1,x_2,ldots,x_n) = (lambda_1x_1, lambda_2x_2, ldots, lambda_n x_n) $$
Each component of the vector just gets multiplied by its associated eigenvalue and the different components don't interact with each other at all.

Unfortunately, not all operators can be written in this nice form, because there may not be enough eigenvectors to combine into a basis. In that case the "next best thing" we can do is choosing a basis where the matrix of $T$ is in Jordan form. Then each component of $T(x_1,x_2,ldots,x_n)$ is either $lambda_i x_i$ or $lambda_i x_i + x_i+1$, which is still somewhat simpler than multiplication by an arbitrary matrix.

Since this gives us some of what a basis consisting entirely of eigenvectors gives us, in terms of computational simplicity, if seems reasonable to describe them as a generalization of eigenvectors. Especially since in the case where we do have enough eigenvectors for an eigenbasis, generalized eigenvectors are the same as eigenvectors.

I see generalized eigenvectors as an attempt to patch up the discrepancy between geometric multipicity and algebraic multiplicity of eigenvalues. This discrepancy is most easily observed as a result of skew transformations (and looking at Jordan normal forms, we see that skew transformations are in some sense at the core of any such discrepancy).

For instance, take the skew transformation given by the matrix
$$
beginbmatrix1&1\0&1endbmatrix
$$
It has eigenvalue $1$ with algebraic multiplicity $2$ (the characteristic polynomial is $(lambda - 1)^2$, which has a double root at $1$), but geometric multiplicity $1$ (the eigenspace has dimension $1$, as it just the $x$-axis).

However, the space of generalized eigenvectors is the entire plane, which is 2-dimensional, and more in line with the algebraic multiplicity of the eigenvalue.

Consider the matrix $$A= beginbmatrix3 & 1 \ 0 & 3 endbmatrix$$. Obviously 3 is the only eigenvalue with "algebraic multiplicity" 2. It is also easy to find the eigenvectors $$beginbmatrix3 & 1 \ 0 & 3 endbmatrixbeginbmatrixx\ yendbmatrix= beginbmatrix3x+ y \ 3yendbmatrix= beginbmatrix3x \ 3y endbmatrix$$ so that we have 3x+ y= 3x and 3y= 3y. The first equation gives y= 0 and the second is satisfied for any x. So any eigenvector is of the form $$beginbmatrixx \ 0 endbmatrix= xbeginbmatrix1 \ 0 endbmatrix$$. So the subspace of all eigenvectors has dimension 1 (the geometric multiplicity is 1).

$$v= beginbmatrix0 \ 1 endbmatrix$$ is NOT an eigenvector: $$(A- 3I)v= beginbmatrix0 & 1 \ 0 & 0 endbmatrixbeginbmatrix 0 \ 1 endbmatrix= beginbmatrix1 \ 0endbmatrix$$, NOT the zero vector. But it does give the previous eigenvector so that applying A- 3I again would give the 0 vector it is a "generalized eigenvector.