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.
Base change for intertwiner spaces
Statement
Let be a field extension, a group, and finite-dimensional -representations of . The map is an -linear isomorphism.
Facts & Assumptions
Given: , , , and as in the statement.
Extension of scalars sends an -linear map to (Restriction of scalars and extension of scalars along a ring homomorphism ).
An intertwiner is exactly a linear map satisfying for every (Intertwiners, the spaces and , equivalent representations, and faithful representations).
Proof
Choose -bases of and . By [L2], is the simultaneous kernel in of the maps .
Tensoring a kernel of maps between finite-dimensional -spaces with the field preserves that kernel, because tensoring with a field extension is exact. The simultaneous kernel after tensoring is, by [L2], precisely .
The resulting identification sends to the displayed map, which agrees with [L1]. Therefore it is the asserted -linear isomorphism.
Depends on
- Restriction of scalars and extension of scalars $S\otimes_RM$ along a ring homomorphism $R\to S$
- Intertwiners, the spaces $\operatorname{Hom}_G(V,W)$ and $\operatorname{End}_G(V)$, equivalent representations, and faithful representations
- A finite-dimensional representation $\rho:G\to \operatorname{GL}(V)$ over a field, and its degree
Used by
Dependency tree · two levels
14 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
- Gabor Wiese, Galois Representations, Theorem 2.2.4 (standard reference, not scraped)
- Weizhe Zheng, Lectures on Algebra, proof of Proposition 4.2.8 (standard reference, not scraped)