Finite Group Representations, Characters and Orthogonality
Finite-group representations convert group elements into matrices. Characters compress matrix information into class functions and make irreducible decomposition computable through orthogonality.
This handbook article treats Finite Group Representations, Characters and Orthogonality as a connected mathematical system rather than a list of isolated definitions. The source develops the subject through definitions, examples, structural correspondences, formulas and diagrams. The practical reading strategy is to identify the objects under discussion, state the permitted operations, separate assumptions from consequences, and then test every construction against the examples supplied in the source.
Core concepts
Linear representation
A representation assigns each group element an invertible linear transformation so that group multiplication becomes composition. Choosing a basis turns the representation into matrices.
Invariant subspaces and irreducibility
A representation is irreducible when it has no nontrivial invariant subspaces. Under suitable characteristic conditions, finite-group representations decompose as direct sums of irreducibles.
Characters
The character χ(g) is the trace of the representing matrix. It is invariant under conjugation, so it depends only on the conjugacy class of g.
Character of a direct sum and tensor product
Characters add under direct sums and multiply under tensor products. These rules translate representation operations into ordinary arithmetic on functions.
Orthogonality
Inner products of irreducible characters satisfy orthogonality relations. These relations test irreducibility and determine multiplicities of irreducible constituents.
Regular representation
The group acts on the vector space with basis indexed by group elements. Its decomposition contains each irreducible with multiplicity equal to its dimension, connecting group order to representation dimensions.
How the ideas fit together
Finite-group representations convert group elements into matrices. Characters compress matrix information into class functions and make irreducible decomposition computable through orthogonality.
The source's recurring method is structural. It begins with a class of mathematical objects and specifies operations or maps, then asks what can be proved from those rules alone. This is why definitions matter more than notation: two apparently different systems can be treated together when they satisfy the same defining laws, while two expressions that look similar can behave differently if their ambient structures differ.
Within this topic, Linear representation provides the entry point. The later ideas—Invariant subspaces and irreducibility, Characters, Character of a direct sum and tensor product, Orthogonality, Regular representation—either refine that first structure, construct new objects from it, or describe information preserved by a suitable map. Read the topic as a sequence of dependencies rather than as independent vocabulary.
Whenever the source passes to a quotient, extension, decomposition or representation, keep two questions visible: what information is deliberately forgotten? and what information is preserved? Those questions explain why quotient objects, extension structures and invariant quantities appear repeatedly across algebra. They are mechanisms for changing the form of a problem without losing the relationships that the theory is designed to study.
The examples also serve as boundary tests. A finite example can prove that an unusual structure is possible; a function-ring example can reveal zero divisors; a geometric example can show how an abstract invariant recovers visible shape; and an operator example can show why multiplication may become noncommutative. The safest study practice is therefore to move in both directions: derive consequences from the definition and then use an example to test whether the consequences have been understood correctly.
A reliable way to reason through the topic
1. Identify the ambient structure. Before manipulating symbols, determine what kind of objects are present and which operations are actually defined. In this topic, the central ideas include Linear representation, Invariant subspaces and irreducibility, Characters. Results that are valid in one algebraic setting do not automatically transfer to another simply because the notation looks similar.
2. Track closure and compatibility. Algebraic definitions are built from operations that must remain inside the chosen structure and satisfy specified laws. When a map or construction is introduced, check which laws it preserves. This prevents a common error: using an operation that exists in a familiar number system but has not been established in the current setting.
3. Separate representation from structure. A matrix, polynomial, coordinate tuple, diagram or formula may represent an object without being the object itself. Isomorphism and other structure-preserving maps are important precisely because they allow different representations to express the same underlying algebraic organisation.
4. Use examples as tests, not universal rules. The source repeatedly uses finite systems, function spaces, geometric models and operator examples to expose what a definition permits. An example demonstrates possibility and mechanism; it does not by itself turn its numerical values or special properties into a general axiom.
5. Look for invariants and quotients. Once a structure and its maps are understood, the next question is what survives a change of coordinates, decomposition or identification. Dimensions, kernels, images, quotient objects, factor structures and equivalence classes are recurring devices for retaining essential information while removing representational detail.
Key symbolic relationships
A representation is a group homomorphism into invertible linear maps.
Trace gives a basis-independent class function.
Orthogonality makes irreducible characters an algebraic basis for class functions.
Over a splitting field of suitable characteristic, squared irreducible dimensions sum to the group order.
Examples and what they demonstrate
| Example | Structural lesson |
|---|---|
| Permutation representation | A group acting on a finite set acts linearly on the vector space with one basis vector per point. |
| One-dimensional representation | A homomorphism from the group into nonzero scalars is a one-dimensional representation and its character is the homomorphism itself. |
| Character decomposition | Taking inner products of a character with irreducible characters reveals how many copies of each irreducible occur. |
How the source diagrams support the mathematics
- The source uses formulas, structural diagrams and worked examples to move from definitions to invariant properties.
- This article converts those visual and symbolic relationships into responsive cards, process sequences and formula panels rather than reproducing page images.
The web article expresses the purpose of these visuals with responsive HTML/CSS rather than embedding scanned source pages.
Common mistakes to avoid
- Treating a source example as if it were an additional axiom or a universal numerical requirement.
- Using familiar arithmetic operations before confirming that the current structure supports them.
- Confusing an object with one particular coordinate, matrix, polynomial or diagram used to represent it.
- Assuming that a property preserved by an isomorphism is also preserved by every map.
- Skipping the domain, codomain, coefficient field or scalar ring when interpreting a formula.
- Forgetting that quotient constructions identify whole equivalence classes rather than deleting inconvenient elements.
Verification questions
- Can you define the central objects in Finite Group Representations, Characters and Orthogonality without relying on a single example?
- Can you explain why Linear representation is structurally different from Regular representation?
- Can you state the role of each operation in the principal formulas and identify where it is defined?
- Can you distinguish an equality of objects from an isomorphism between differently represented objects?
- Can you reconstruct at least one source example from its defining rules rather than memorising the finished result?
- Can you identify which conclusions depend on extra hypotheses such as finiteness, irreducibility, commutativity or finite generation?