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.
Intertwiners, the spaces and , equivalent representations, and faithful representations
Definition
Let and be representations of over the same field .
A linear map (Linear map between vector spaces over the same field) is an intertwiner, or -equivariant map, when Equivalently,
Write for the set of all intertwiners. It is a subset of the vector space of all linear maps (The space of linear maps with pointwise addition and scalar multiplication). When , write
The two representations are equivalent if there is an invertible intertwiner .
A representation is faithful when implies .
Remarks
-
Faithfulness says that the action remembers every group element.
-
The equality is the representation-language form of a module homomorphism condition.
Depends on
Used by
- A splitting field for a finite group: every irreducible representation has scalar endomorphism ring Definition
- The real 2-dimensional irreducible representation of C₃ has endomorphism ring ℂ Example
- FALSE: every representation is faithful False statement
- Hom_G(V,W) is a k-vector space and End_G(V) is a k-algebra Proposition
- Equivalence classes of degree-one representations are exactly homomorphisms G→ k^×; equivalently they factor through G/G', and they form an abelian group Theorem
- The regular representation is faithful Theorem
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, Chapter 2 Section 2.1 (standard reference, not scraped)