Representation type of a (usually finite‑dimensional) algebra is the classification invariant that records whether the isomorphism classes of indecomposable modules form a finite set (representation‑finite), a union of finitely many one‑parameter families plus finitely many exceptions (tame), or include families as complicated as the representations of the free algebra in two generators (wild).

Principle

Distinguishes algebras by the complexity of their module categories: finite = fully classifiable list, tame = classifiable by finitely many one‑parameter families, wild = as hard as classifying arbitrary pairs of matrices up to simultaneous similarity.

Demonstration

Example: Path algebras of Dynkin quivers (ADE) over an algebraically closed field are representation‑finite; Euclidean (extended Dynkin) quivers are tame; the free algebra k and many other algebras are wild so their indecomposable classification subsumes arbitrary finite‑dimensional algebra problems.

Misapplication

Declaring an algebra wild merely because it has infinitely many indecomposables without showing a wild embedding, or conflating tame with having only one‑parameter families — some tame situations still admit discrete infinite families of certain sizes.

Consequence

If an algebra is wild then no reasonable classification of indecomposables by explicit lists or one‑parameter families exists (problem is algorithmically as hard as classifying pairs of matrices); finite type allows complete classification and explicit module tables.

Reversal

Moving from finite to wild inverts the classification outlook: finite type gives full control, wild type yields intractability and universality of representation problems.

Boundary

Typically formulated for finite‑dimensional algebras over algebraically closed fields and for module categories of finite length; notions must be adapted for infinite‑dimensional algebras, derived categories, or when base fields are not algebraically closed.

Semantic Tension

Tension appears between coarse categorical measures (finite/tame/wild) and finer invariants (e.g. derived equivalence, stable equivalence): two algebras with the same representation type can have very different homological behavior.

Synthesis

Representation type compresses the complexity of an algebra's indecomposable modules into three qualitative classes—finite, tame, wild—guiding whether explicit classification is feasible or intrinsically intractable.