Algebraically irreducible representation of a Banach algebra Created 2026-10-14 Updated 2026-10-31
Algebraic irreducibility excludes every proper nonzero invariant vector subspace, including those that are not closed. It is stronger than topological irreducibility, which excludes only closed invariant subspaces. For a nonzero irreducible action, every nonzero vector is cyclic in the algebraic sense: .
Complete reducibility of compact-group representations Created 2026-10-14 Updated 2026-11-05
A finite-dimensional continuous complex representation of a compact group is a direct sum of irreducible representations. Average a positive Hermitian inner product over normalized Haar measure. The orthogonal complement of an invariant subspace is then invariant, so induction on dimension gives the decomposition. The same argument works for finite-dimensional real representations with a positive real inner product.
For , the complex irreducible representations are precisely the one-dimensional maps , with . Their characters have the displayed values, forming the discrete Fourier character table. Indeed a representing matrix satisfies . Applying the fundamental theorem of algebra to its characteristic polynomial gives an eigenvalue and an eigenvector over the complex numbers. Its line is an invariant subspace under every power of ; irreducibility therefore forces the entire space to be that line. Its eigenvalue is an th root of unity. Different roots give inequivalent one-dimensional representations, and there are exactly possibilities.
All conjugacy classes are singletons because the group is Abelian. The number of the displayed irreducibles equals the group order, and their squared dimensions sum to , in agreement with the sum of squares of irreducible representation dimensions. Over the real numbers, conjugate nonreal characters instead combine into the planes described by the irreducible real representations of a finite cyclic group.
A stationary iterative method for a linear system converges to its specified fixed point for every initial vector if and only if its iteration matrix satisfies , where the spectral radius is the largest modulus of an eigenvalue.[ref]
Notes for Ma221 Lecture 21, Nov 10 2009. Math 221, Matrix Computations, Fall 2009; Basic iterative methods: theorem following the spectral-radius lemmas, before the Jacobi update
For a diagonalizable matrix, write . Then , so each eigenvector coefficient tends to zero exactly when its eigenvalue has modulus less than one. For a general matrix, the Jordan normal form gives the same result: a Jordan block with a nilpotent matrix of size satisfiesIf , every coefficient tends to zero because exponential decay beats any fixed polynomial in ; if , the block vanishes once . Conversely, an eigenvector with provides an initial error that cannot tend to zero. For a real matrix with complex eigenvalues, the same obstruction appears in the real invariant subspace spanned by the real and imaginary parts of an eigenvector.
The words "every initial vector" matter. For example, fails the criterion, but still tends to zero. Here a generic initial error has a nonzero first coordinate and diverges; the exceptional errors lie on the second coordinate axis. With , generic errors oscillate rather than diverge in norm, while the same exceptional axis still converges. Both are valid matrix splittings with and . In general the convergent errors form the direct sum of the generalized eigenspaces for ; if , this is a proper linear subspace.
A small spectral radius describes eventual convergence, but does not imply that the Euclidean norm of the error decreases on every step for a non-normal matrix. An operator norm bound does give the stepwise estimate . For a real symmetric matrix, the matrix 2-norm equals its spectral radius, making this particularly direct.
Diagonalizable restriction lemma 2026-10-31
If is an invariant subspace for a finite-dimensional diagonalizable linear map , its restriction is diagonalizable over the same field. The minimal polynomial of divides that of : an annihilating polynomial for still annihilates the restriction, and polynomial division by its minimal polynomial proves divisibility. A divisor of a product of distinct linear polynomials remains a product of distinct linear polynomials, proving the assertion. This is the key step in simultaneous diagonalization of commuting linear maps.
Eigenline Created 2026-10-14 Updated 2026-10-25
An eigenline is a one-dimensional vector subspace spanned by an eigenvector. If with , then for every scalar , so the line is an invariant subspace. It can be contained in an eigenspace of larger dimension; an eigenline need not be the whole eigenspace.
Eigenvalue deflation by an invariant subspace Created 2026-10-03 Updated 2026-11-05
If a -dimensional invariant subspace is mapped to the span of the first coordinate vectors by a similarity transformation, the transformed matrix has block formIts characteristic polynomial factors as , so its eigenvalues are the eigenvalues of the two diagonal blocks, counted with algebraic multiplicity.
Fixed-point subspace of a group action Created 2026-10-14 Updated 2026-11-05
For a linear group representation, the common fixed vectors of a subgroup form an invariant subspace for any equivariant map restricted to it. Its dimension is central to symmetry-based branching theorems. It need not be invariant under the entire group; conjugate subgroups have conjugate fixed-point subspaces.
Flag (linear algebra) Created 2026-10-07 Updated 2026-10-31
A flag is a strictly nested chain of vector subspaces of a fixed vector space. A complete flag contains a subspace of every possible dimension. For an action by linear maps, an invariant flag means that each of its vector subspaces is an invariant subspace. A basis adapted to an invariant complete flag makes all these maps upper triangular, connecting complete flags to simultaneous triangularization of a Lie algebra representation.
Floquet growth rate Created 2026-10-06 Updated 2026-10-14
The Floquet growth rate measures the exponential trend of a periodic linear differential equation over many coefficient periods. A Floquet multiplier measures the factor per period ; the corresponding rate per unit time iswhere is a Floquet exponent. Taking the real part removes the ambiguity in the complex logarithm.
For the scalar example under periodic solution, and the Floquet growth rate is , independently of . Indeed,The instantaneous logarithmic derivative keeps oscillating even though its average over complete periods is exactly . Sampling at the same phase in each period removes the modulation altogether: .
For the general finite-dimensional homogeneous linear differential equation , assume that is continuous on the real line and -periodic, with . Normalize its fundamental matrix by and set . The maximal asymptotic exponential rate, using any induced matrix norm, isHere is the spectral radius, are the Floquet multipliers, and invertibility gives . This concerns growth of the solution operator; it does not say that every initial condition attains the maximum.[ref]
To prove the formula, write with . Periodicity and uniqueness giveBoth and have uniformly bounded matrix norms on a period. Consequently differs from by at most fixed multiplicative factors. The spectral radius formula gives , proving the claimed limit without choosing a matrix logarithm.
For a particular nonzero initial condition , decompose into the generalized eigenspaces of over the complex numbers. The rate of is the largest among components that are nonzero. Generic data have a component in the dominant generalized eigenspaces and attain ; data contained in the sum of the subdominant generalized eigenspaces have a smaller rate. For example, with , the maximal rate is , while decays at rate . These invariant subspaces describe initial data at phase zero. Their transported versions can vary with time and satisfy .
A negative Floquet growth rate allows temporary amplification. For the constant non-normal matrixthe initial condition has Euclidean norm , which rises from to about at before eventually decaying. Its exponential rate is still : the Jordan block contributes a polynomial factor, whose logarithm divided by tends to zero. At a unit-modulus Floquet multiplier, such polynomial growth can even be unbounded with zero exponential rate; gives . Thus zero Floquet growth rate alone proves neither boundedness nor a periodic solution.
Four-point regular representation of the Klein four-group Created 2026-10-18 Updated 2026-10-25
The permutation matrices of the three displayed double transpositions, together with , form a faithful representation of the Klein four-group. They satisfy and . Every nonidentity element fixes no basis vector, so this is its four-dimensional regular representation.
The constant vector spans a nonzero proper invariant subspace, proving reducibility. More completely, the columns ofform a common orthonormal basis of eigenvectors. Direct multiplication gives and . Thus the representation splits into the four distinct real one-dimensional characters, each once. The basis change is a normalized Hadamard matrix.
Haar averaging produces invariant complements Created 2026-10-07 Updated 2026-11-05
For a finite-dimensional continuous complex representation of a compact group, normalize Haar measure to mass one and average any positive-definite Hermitian inner product:The resulting inner product is positive-definite and invariant. If is an invariant subspace, then is invariant as well, since . Thus . Restriction to a compact real form, followed by integration of a Lie-algebra representation, proves the Weyl complete reducibility theorem.
Here a Hilbert space module means a Hilbert space with a unital star-representation of a Von Neumann algebra, rather than a Hilbert C-star module with an algebra-valued inner product. A closed invariant subspace is reducing because the algebra is closed under adjoints. Module equivalence means an intertwining unitary. The polar decomposition of a bounded operator converts an intertwiner into a unitary between its initial and final support subspaces.
Induced linear map on a quotient vector space Created 2026-10-25 Updated 2026-11-05
For a linear map and an invariant subspace , the rule defines a linear map on the quotient vector space . Indeed, two representatives differ by an element of , so their images also differ by an element of . Conversely, this rule is well-defined only if , by comparing every with zero.
Infinite-dimensional simple module for the two-dimensional affine Lie algebra Created 2026-10-07 Updated 2026-10-14
The solvable Lie algebra , with , has an infinite-dimensional Irreducible Lie algebra representation on : and . Indeed . An invariant subspace is an ideal because it is invariant under multiplication by . Shift invariance gives , hence and is constant. This shows why the Lie theorem needs finite-dimensional representations, even when the algebra itself is finite-dimensional.
Invariant subspaces and annihilators Created 2026-10-25 Updated 2026-10-31
For a linear map , an invariant subspace has an annihilator of a vector subspace invariant under the dual map . Indeed, for and ,For a finite-dimensional vector space, the converse also holds. If , every vanishes on for each . The dual basis description of shows that the common zero set of its linear functionals is exactly , so . ThusThe dimension identity exchanges a one-dimensional invariant subspace with an invariant hyperplane in the dual space.
For a quarter-turn rotation of about a unit axis vector , the only real invariant subspaces are , the axis , its perpendicular plane , and all of .
Indeed fixes the axis and negates the perpendicular plane. Hence is the linear projection onto the axis, while is the linear projection onto the perpendicular plane. An invariant subspace is preserved by these polynomials in , soThe first intersection is either zero or the axis. If the second contains a nonzero , it also contains . These are perpendicular nonzero vectors, so they span the perpendicular plane. This proves the classification.
Over the complex numbers the situation changes: the rotation matrix has eigenvalues , giving three one-dimensional eigenspaces. The absence of real eigenvalues on the perpendicular plane explains why it has no real one-dimensional invariant subspace.
Irreducible representation Created 2026-09-24 Updated 2026-10-14
An irreducible group representation is nonzero and has no nonzero proper invariant subspace. These are the pieces that cannot be decomposed further by taking a smaller symmetry-preserved vector space.
The real two-dimensional rotation through degrees illustrates the role of the coefficient field. A one-dimensional real invariant subspace would supply a real eigenvector, but the characteristic polynomial has no real root. The representation is therefore irreducible over the real numbers. Over the complex numbers, that polynomial has distinct roots of unity and , giving two invariant eigenlines. Irreducibility over the real numbers does not imply absolute irreducibility.
Every algebraically irreducible representation of a Banach algebra that is normed is continuous. The continuous orbit vectors form an invariant subspace. If all nonzero orbit maps were discontinuous, apply the countable annihilation sequence in an irreducible Banach module and the gliding-hump continuity principle to right multiplication on the algebra and evaluation of the operator-valued representation. Off-diagonal maps vanish, whereas diagonal maps are discontinuous, a contradiction. Once every orbit map is continuous, the Uniform boundedness principle on the Banach algebra gives the common operator-norm bound. Completing the original normed representation space supplies the Banach operator space needed in the argument.
Operator theory Created 2026-09-24 Updated 2026-11-05
Linear operator theory studies linear maps, their spectra, invariant subspaces, and normal forms such as Jordan normal form. In a finite-dimensional vector space, eigenvalues identify parameters for which a shifted linear operator cannot be inverted. In an infinite-dimensional vector space, inversion can fail even without an eigenvector. The spectrum of a bounded operator captures this larger obstruction and connects linear algebra with the approximation questions of functional analysis.
