How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The induced -linear -module as -covariant functions on
Definition
Let be a commutative ring, let be a group, let be a subgroup (Subgroup), and let be an -linear -module (An -linear action of on a left -module, and a -module over ).
The induced -linear -module is the set
where is the set of all functions (The set of all functions ).
Pointwise addition and scalar multiplication make an -module:
The left action of on this module is
This action is well defined on the displayed subset because
and each operator is -linear by the pointwise definitions. Thus is an -linear -module.
Remarks
-
The covariance condition is written on the right, so the values of an induced function are determined by one value on each left coset .
-
When is a field and is finite-dimensional, this construction is the induced representation of from the representation of on .
Depends on
Used by
- The induced character Ind_H^Gχ of a complex character Definition
- A left transversal identifies Ind_H^G W with a direct sum of [G:H] copies of W Proposition
- The function model of induction agrees with the tensor-product model k[G]⊗_k[H]W Remark
- Inducing the trivial representation gives the permutation representation on G/H Theorem
- Induction is left adjoint to restriction for finite-group modules over a commutative ring Theorem
- Induction is transitive along subgroup chains Theorem
Dependency tree · two levels
13 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Pavel Etingof et al., Introduction to Representation Theory, Definition 4.28 (standard reference, not scraped)
- Peter Webb, A Course in Finite Group Representation Theory, Section 4.3 (standard reference, not scraped)