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.
A left transversal identifies with a direct sum of copies of
Statement
Let be a commutative ring, let be a group, let , let be an -linear -module, and let meet each left coset in exactly one point. Then evaluation on defines an -module isomorphism
In particular .
Facts & Assumptions
Given: A commutative ring , a group , a subgroup , an -linear -module , and a left transversal for .
The induced module consists of the functions satisfying , with pointwise -module structure (The induced -linear -module as -covariant functions on ).
The left cosets of are the subsets of (Left and right cosets and of a subgroup).
For a finite index set, the direct sum is the module of tuples with coordinatewise operations (The direct sum of an indexed family of modules).
Proof
Because meets each left coset in exactly one point, every can be written uniquely as with and .
The map is -linear because [F1] and [F3] define both module structures coordinatewise.
Define by . Step 1.1 makes this well defined, and the displayed formula satisfies the covariance condition of [F1], so .
The map is -linear because the -action on is -linear and the formula of step 2.1 is coordinatewise in the tuple entries.
For , because .
For and as in step 1.1, one has , where the third equality is the covariance condition from [F1]. Hence .
Steps 3.2 and 3.3 show that and are inverse -module isomorphisms. Since has one element on each left coset, its cardinality is .
Depends on
Used by
Dependency tree · two levels
9 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
- Peter Webb, A Course in Finite Group Representation Theory, Proposition 4.5.1 (standard reference, not scraped)
- Anupam Singh, Representation Theory of Finite Groups, Chapter 17 (standard reference, not scraped)