Induced representation¶

Extend a subgroup representation to the ambient group through a universal construction on cosets or tensoring over group algebras.

Version: v1 · 2026-08-30 · History
Domain-specific #: 2055
Origin domain: mathematics
Subdomain: representation induction
Aliases: Induction of representations, Induced module, Ind from H to G

Core Idea¶

Let \(H\le G\) and let \(V\) be a representation of \(H\) over a field \(K\). The algebraic induced representation is \(\operatorname{Ind}_H^G V=K[G]\otimes_{K[H]}V\), with \(G\) acting by left multiplication on the first factor. For finite groups, choosing coset representatives identifies the space with a direct sum of copies of \(V\). The construction does not literally extend the same action on the same vector space; it builds a generally larger \(G\)-module with a universal relation to restriction.^[1]

Tensoring balances the right \(K[H]\)-action on \(K[G]\) against the given action on \(V\). Coset representatives provide coordinates, but changing representatives yields an isomorphic representation rather than a different induced object. Frobenius reciprocity relates \(G\)-maps out of the induced representation to \(H\)-maps out of \(V\) into a restricted representation. For topological or locally compact groups, function spaces, continuity, measures, and unitary structure replace the finite algebraic direct sum and must be specified.^[2]

Induction differs from restriction, which forgets part of a group action, and from extending a representation on the same vector space, which may be impossible. It is not matrix induction, mathematical induction, or merely taking a direct sum. Left versus right cosets and action conventions change formulas but not the isomorphism class when handled consistently. Infinite and locally compact groups require analytic hypotheses; the finite-group tensor formula cannot be transferred without topology and measure.^[3]

Structural Signature¶

Ambient group. A group \(G\) supplies the target action.
Subgroup. A specified \(H\le G\) carries the known representation.
Subgroup module. The vector space \(V\) has a declared \(H\)-action.
Group algebra. The bimodule \(K[G]\) transports the action.
Balanced tensor product. Relations identify subgroup multiplication with its action on \(V\).
Coset coordinates. Representatives organize finite-dimensional copies.
Ambient action. Left multiplication defines the induced \(G\)-representation.
Reciprocity. A natural Hom-space relation characterizes the construction.

What It Is Not¶

Not restriction. Restriction moves from \(G\) to \(H\) without enlarging the space.
Not same-space extension. Induction generally builds a larger representation.
Not mathematical induction. The shared word has no proof-by-successor meaning.
Not direct sum alone. Coset-indexed copies need the transported group action.
Not coinduction in every setting. Induction and coinduction can differ outside special finite contexts.
Not a unique matrix formula. Coordinates depend on bases and coset representatives.

Scope of Application¶

The abstraction is literal wherever practitioners can identify the same constitutive roles, apply the same boundary tests, and obtain the same kind of output. The following habitats are uses of Induced representation itself, not metaphors based only on resemblance.

Finite groups. Constructing representations from subgroup data.
Character theory. Computing induced characters and applying reciprocity.
Permutation representations. Inducing a trivial subgroup representation to coset action.
Monomial representations. Inducing one-dimensional representations.
Harmonic analysis. Building representations of locally compact groups under analytic hypotheses.
Mackey theory. Analyzing restriction of induced representations through double cosets.

Clarity¶

A clear account of Induced representation must preserve the recognition invariant stated in the Core Idea rather than rely on the title alone. State \(G\), \(H\), field, module, and left/right action conventions. Distinguish the invariant construction from a chosen coset basis. Use the correct algebraic, smooth, compact, or unitary induction setting. Do not describe induction as an extension on the unchanged vector space. These declarations are not editorial extras: each changes what observations count, which transformations are licensed, and what conclusion can be drawn. A reader should be able to reconstruct the input, the operative rule, the output, and at least one defeater from the account without consulting an implementation or guessing an unstated convention.

Manages Complexity¶

Induced representation manages complexity by replacing a diffuse field of observations or possible operations with a bounded role structure: ambient group supplies a group \(G\) supplies the target action.; subgroup supplies a specified \(H\le G\) carries the known representation.; subgroup module supplies the vector space \(V\) has a declared \(H\)-action.; group algebra supplies the bimodule \(K[G]\) transports the action.; balanced tensor product supplies relations identify subgroup multiplication with its action on \(V\).. The compression is useful because it localizes disagreement. One can ask whether the input was properly formed, whether a constitutive relation held, whether an alternative explanation defeats the inference, or whether the output was overinterpreted. The same compression can mislead when its discarded detail is exactly what the decision requires. A reference-grade use therefore reports both the invariant retained and the information intentionally lost.

Abstract Reasoning¶

Verify that \(V\) carries a well-defined representation of \(H\).
Give \(K[G]\) its compatible group-algebra bimodule structure.
Form the balanced tensor product over \(K[H]\).
Define the ambient \(G\)-action by multiplication.
Choose coset representatives only to compute coordinates.
Check dimension and characters in the finite case.
Use Frobenius reciprocity or Mackey decomposition under exact hypotheses.
Test the candidate interpretation against the nearest named confusable rather than accepting a shared surface feature.
State the conclusion at the same scope as the source conditions, and retain uncertainty or nonuniqueness where the construct does not remove it.

Knowledge Transfer¶

The strict upward abstraction is Representation. Induced Representation instantiates Representation because it constructs a linear action of the ambient group, specialized by transport from subgroup action. Within representation induction, the full mechanism transfers literally when the same roles and boundary tests recur. Beyond that domain, only the parent-level skeleton should travel. Reusing the label Induced representation after removing its constitutive vocabulary would hide a change of mechanism behind an analogy. The honest transfer rule is therefore two-stage: recognize the domain-specific pattern first, then lift only the parent relation that remains invariant under a substrate change.

Examples¶

Canonical¶

Inducing the trivial representation of \(H\) to a finite group \(G\) produces the permutation representation on the coset space \(G/H\). Its dimension is \([G:H]\), and different lists of coset representatives give different coordinate bases for the same isomorphism class.

Mapped back: input and conventions → constitutive role test → bounded output → explicit interpretation and defeater check.

Applied / In Practice¶

A finite-group calculation starts with a one-dimensional character of a subgroup. The induced character is computed by summing conjugates whose group elements meet the subgroup. Irreducible multiplicities are then checked through Frobenius reciprocity rather than inferred from the construction's dimension alone.

Mapped back: field observation or problem → candidate recognition → confusable and limit checks → appropriately scoped conclusion.

Structural Tensions¶

T1: Universal object versus coordinates. Coset choices make formulas look noncanonical. Diagnostic: Compare constructions through an explicit isomorphism.
T2: Extension language versus larger space. Informal wording suggests the original vector space persists. Diagnostic: Write the tensor product and dimension.
T3: Finite algebra versus analytic induction. Infinite groups require topology and measure. Diagnostic: Name the representation category and completion.
T4: Left versus right convention. Mixed conventions reverse formulas. Diagnostic: Test the action law on generators.
T5: Induction versus coinduction. They coincide only under appropriate finite or Frobenius conditions. Diagnostic: State the theorem rather than assume equivalence.
T6: Autonomy versus generic representation. Representation supplies a group action; induction adds subgroup transport with a universal reciprocity property. Diagnostic: Remove the subgroup and tensor relation and test whether generic representation remains.

Structural–Framed Character¶

Subgroup, balanced tensor, and ambient action are structural; bases, coset representatives, and analytic category are framed choices. The five framing criteria point in a consistent direction. Evaluative weight is limited to whether the defining conditions are met, not whether the outcome is desirable. Human practice matters to the extent that experts choose conventions, instruments, or reporting thresholds, but those choices do not make every verdict arbitrary. Institutional history explains the name and standard use; it does not replace the recognition rule. The operative vocabulary travels within the home field and closely adjacent subfields, while transfer farther away requires translation to the parent prime. Thus recognition remains disciplined even where interpretation is defeasible.

Structural Core vs. Domain Accent¶

What is skeletal. Induced Representation instantiates Representation because it constructs a linear action of the ambient group, specialized by transport from subgroup action. This is the part that can be expressed without the candidate's specialist nouns.

What is domain-bound. The domain accent includes groups, subgroups, group algebras, modules, cosets, tensor products, characters, restriction, reciprocity, and locally compact analysis. Remove those elements and the result is no longer Induced representation; it is only the parent relation or a loose analogy.

Why this does not clear the prime bar. The name does not recur with unchanged diagnostics across three independent domains. What transfers is already represented by prime:representation. The candidate remains autonomous because its in-domain recognition rule, failure modes, and consequences are stable, but its vocabulary and interventions do not float free of the home substrate.

Induced Representation instantiates Representation because it constructs a linear action of the ambient group, specialized by transport from subgroup action.

The prospective workspace queue contains one strict upward edge to prime:representation. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Induced representation Domain-specific

Parents (1) — more general patterns this builds on

Induced representation is a kind of Representation Prime

Induced Representation instantiates Representation because it constructs a linear action of the ambient group, specialized by transport from subgroup action.

Hierarchy path (1) — routes to 1 parentless root

Induced representation → Representation → Abstraction

Neighborhood in Abstraction Space¶

Induced representation sits in a sparse region of the domain-specific corpus (78^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Topological Groups & Homotopy Actions (11 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Restricted representation. Forgets from an ambient group to a subgroup.
Extended representation. Seeks an action on the same vector space.
Coinduced representation. Uses a Hom construction and can differ in infinite settings.
Permutation representation. A special case obtained from the trivial subgroup representation.
Tensor product representation. Combines representations of a common group rather than changing groups.
Mathematical induction. A proof method unrelated to representation theory.

References¶

[1] Serre, J.-P. (1977). Linear Representations of Finite Groups. Springer. https://doi.org/10.1007/978-1-4684-9458-7 registry ↩

[2] Fulton, W., and Harris, J. (1991). Representation Theory: A First Course. Springer. https://doi.org/10.1007/978-1-4612-0979-9 registry ↩

[3] Mackey, G. W. (1952). ‘Induced Representations of Locally Compact Groups I.’ Annals of Mathematics 55(1), 101–139. https://doi.org/10.2307/1969423 registry ↩