##  [Endomorphism Algebra](/endomorphism-algebra-0) 

 Definition

The associative algebra consisting of all endomorphisms of a fixed object (typically a vector space or module) with addition given pointwise and multiplication given by composition; concretely realized as a matrix algebra once a basis is chosen.

 

 

 

 

 

 





## Principle

Principle

Organize linear self-maps into an algebraic structure where composition encodes successive application and addition encodes superposition, so representation-theoretic and module actions are expressed by algebra modules over the endomorphism algebra.

 

 

 

 

 





## Demonstration

Demonstration

For a finite-dimensional vector space V over a field k, End_k(V) is isomorphic to the full matrix algebra M_n(k) under the choice of a basis, and its elements act on V by left multiplication of column vectors.

 

 

 

 

## Misapplication

Misapplication

Treating End(V) as commutative or assuming that pointwise addition and composition commute in a way that would allow elementwise division; such misuse ignores noncommutativity and the absence of multiplicative inverses for noninvertible endomorphisms.

 

 

 

 

 





## Consequence

Consequence

Correct identification of an endomorphism algebra enables classification of module decompositions, description of centralizers, and formulation of dualities (e.g., Schur's lemma yields that endomorphism rings of simple modules are division rings).

 

 

 

 

## Reversal

Reversal

Instead of collecting self-maps with composition as multiplication, consider the coalgebra of linear functionals with comultiplication; reversing arrows leads to studying coalgebras or comodule structures rather than endomorphism algebras.

 

 

 

 

 





## Boundary

Boundary

Applies to endomorphisms of a single fixed object; does not automatically encode morphisms between different objects (those form Hom-sets) and excludes additional structure unless specified (topology, grading, *-structure must be added explicitly).

 

 

 

 

 





## Semantic Tension

Semantic Tension

Competes with 'matrix algebra' as a concrete presentation: matrix algebra is a model of End(V) after choosing a basis, but End(V) emphasizes basis-free, functorial properties and intrinsic module actions.

 

 

 

 

 





## Synthesis

Synthesis

The endomorphism algebra is the basis-free associative algebra of linear self-maps of an object; its noncommutative multiplication by composition and pointwise addition organize internal symmetries and module actions, while concrete matrix realizations give computational access.