Fix a prime number . Take the full subcategory of finitely generated abelian groups with no element of order . It is closed under finite direct sums and subgroups. If is the -primary torsion subgroup, the map is a reflection into this subcategory: every map to an allowed group kills . Therefore ordinary kernels in a category and reflected cokernels in a category supply all finite categorical limits and colimits. No nonzero finitely generated group has zero reflection, so the epimorphisms are precisely surjections and are all conormal epimorphisms. Multiplication by on is a monomorphism but not a normal monomorphism: its cokernel here is , whose kernel is , not . Multiplication by is normal; composing it with itself gives this nonnormal monomorphism.
Baer sum 2026-10-06
To add two extensions of by , take their direct sum, form a pullback in a category along the diagonal , and form a pushout in a category along addition . This produces another extension of by and defines addition in . In a quiver representation, vertexwise splittings express the two extensions by off-diagonal arrow matrices, and the Baer sum adds those matrices modulo the extension complex of quiver representations coboundaries.
Every vector bundle on the projective line over a field splits as a direct sum of line bundles. Choose the largest integer with . A corresponding map is saturated, since saturation otherwise increases its degree. Inductively split its quotient as . Twisting the exact sequence by and using gives . Hence all extension groups vanish, and the sequence splits. The multiset of degrees is determined by the dimensions of all twisted global-section spaces.
Block diagonal matrix Created 2026-09-24 Updated 2026-10-31
A block matrix is block diagonal if all off-diagonal blocks vanish. It represents independent actions on a direct sum of vector spaces. Its determinant is the product of the diagonal-block determinants.
For any group, take the group-algebra image on the direct sum of two finite-dimensional complex semisimple representations. Its radical annihilates their simple summands and hence the faithful direct sum, so the image algebra is semisimple. Equality of traces on group elements gives equality on their linear span. Traces on primitive central blocks then recover every simple multiplicity, proving that equal characters imply isomorphism.
Write the Klein four-group as . Its four one-dimensional irreducible representations independently assign signs to , so the displayed characters have . The character table is
Every conjugacy class is a singleton because the group is abelian. The four rows exhaust the complex irreducibles by the equality between their number and the number of classes. If is this table, proves character orthogonality. The diagonal three-dimensional representation by half-turns about the coordinate axes is the direct sum of the three nontrivial characters, with total character .
For the defining sl2 Lie algebra module with basis , put and . The raising operator has and ; the lowering operator has and . The highest-weight vectors and generate irreducible submodules of highest weights four and two. Bases are respectively and . Their vectors are independent in every weight space, proving the displayed direct sum without only comparing dimensions.
For a vector subspace of , its codimension is the dimension of the quotient vector space . This definition also applies when is infinite-dimensional. If is a direct sum, the map is a linear isomorphism from to , so . In particular, the kernel of a nonzero linear functional has codimension one: normalize and write .
For closed subspaces of a Hilbert space, set . The two positive cosines bound and its adjoint operator below. The first bound gives a closed range and injectivity; the second makes the range dense by image-kernel orthogonality for an adjoint. Thus is a bounded bijection, and yields the unique direct sum decomposition . In equal finite dimensions, a lower bound on alone suffices by the rank-nullity theorem.
Complemented subspace 2026-10-14
A closed vector subspace of a Banach space is complemented if a bounded linear operator satisfies and . Equivalently, is the topological direct sum of and a closed subspace: a projection gives , and the coordinate projection of such a decomposition is bounded.
If one-dimensional smooth linear characters of a local multiplicative group have conductors tending to infinity, their direct sum can be admissible. Its algebraic dual is the product of inverse linear characters, but a smooth vector in this product has only finitely many nonzero coordinates. A common open stabilizer contains one fixed principal-unit subgroup, on which every sufficiently ramified linear character is nontrivial. Thus the smooth dual is again a direct sum.
For the defining -dimensional special linear Lie algebra module, with , write . The equivariant contraction is . The map is also equivariant, since is an invariant identity tensor. Direct differentiation gives , so the displayed direct sum follows. Its trace-free part is an irreducible representation of highest weight . Its highest-weight vector is ; the Weyl dimension formula gives dimension , exactly .
// Target: semisimple-lie-algebra.bigb
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]
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 satisfies
If , 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.
Let be cyclic and let carry the regular permutation action. Invariants are constant coefficient vectors, which are the images of the norm operator. A vector with coefficient sum zero is the difference of a vector and its cyclic translate, by successively solving the coordinate differences. Thus the norm group kernel equals . Both cyclic Tate cohomology groups vanish. This applies to and , and to finite direct sums of regular lattices.
Diagonalizable matrix Created 2026-09-24 Updated 2026-10-14
A finite-dimensional linear operator is diagonalizable over a specified field when it has an eigenbasis. Equivalently, its matrix admits
where is an invertible matrix whose columns are eigenvectors, and is a diagonal matrix of the corresponding eigenvalues. This change of basis reveals a linear map as independent one-dimensional scalings. The matrix may look coupled in the original coordinates, but each coordinate in the eigenbasis evolves on its own.
For the symmetric matrix computed in eigenvector, take
Then , hence . The orthonormal basis version is , an orthogonal matrix satisfying . Every real symmetric matrix has an orthonormal eigenbasis by the spectral theorem; a general diagonalizable matrix need not have orthogonal eigenvectors.
The immediate payoff is repeated application: adjacent factors cancel, giving . In this example,
The component in grows while the component in stays fixed. After division by its Euclidean norm, this particular sequence approaches . This is the mechanism behind the power method; an initial vector entirely in would stay there and never find the dominant eigenvalue .
Figure 1.
Repeated maps: eigenvalue growth, alignment, and the exceptional starting direction
. Details.
Two different obstructions deserve comparison. The planar rotation in eigenvector is diagonalizable over but not over , because its eigenvalues are and . By contrast, the shear mapping
has only , of algebraic multiplicity two, and , of geometric multiplicity one. There is no second independent eigenvector, even over . This is a defective matrix, already a two-dimensional Jordan block. Its powers are
Thus even though both eigenvalues are one, repeated application can produce growth. Eigenvalues alone miss the coupling recorded by a Jordan block. A repeated eigenvalue is harmless when it has enough independent eigenvectors, as demonstrates. More generally, a matrix is diagonalizable exactly when its characteristic polynomial splits over the chosen field and every eigenvalue has equal geometric multiplicity and algebraic multiplicity. The proof outline is to join bases of the distinct eigenspaces; their direct sum fills the space exactly under these conditions.
A physical motivation is the separation of normal modes. Consider two equal masses between three identical springs of stiffness , with the outer ends fixed. By Hooke's law and Newton's second law, the displacement vector obeys
The eigenvectors and have eigenvalues and : the masses move together in the first normal mode and oppositely in the second. Writing separates the coupled equations into two harmonic oscillators,
Their angular frequencies are and ; the eigenvalues give squared angular frequencies after multiplication by . This is the beauty of diagonalization: finding the right directions turns interacting motions into independent patterns. For a physical treatment, see Yen-Jie Lee's "Coupled Oscillators, Normal Modes" (MIT 8.03SC, 2016), and the local article normal modes of two equal masses between three springs.[ref]
Eigenspace Created 2026-09-24 Updated 2026-10-14
For an eigenvalue of a linear operator , its eigenspace is
It contains all eigenvectors for and the zero vector. Including zero makes this a linear subspace: if , then for any scalars . Every nonzero vector in this linear subspace has the same scaling under . Its dimension is the geometric multiplicity of the eigenvalue. If is not an eigenvalue, the shifted kernel is only .
For the symmetric matrix from eigenvector,
Each eigenspace is a line. An eigenspace can also be a plane or the whole vector space: for , is a plane of dimension two, while for every vector belongs to . A repeated eigenvalue therefore need not prevent diagonalizability.
The useful unit of information is the whole eigenspace, rather than a particular choice of eigenvectors inside it. On , is simply multiplication by . Distinct eigenspaces fit together as a direct sum, and a finite-dimensional linear operator is diagonalizable exactly when they fill the whole vector space. For the example above, every vector splits uniquely as
This decomposition makes the independent scalings visible without multiplying out the original matrix again.