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.
If , the augmentation ideal of has no -module complement in the regular representation
Statement
Let be a finite group and let be a field with . If is the augmentation ideal of , then there is no left -submodule with
Facts & Assumptions
Given: A finite group , a field with , the augmentation map , and the augmentation ideal .
The augmentation map satisfies for every , is a ring homomorphism, and has kernel (The augmentation map and the augmentation ideal ).
In the regular representation, for and (The trivial representation, the regular representation, and permutation representations from finite -sets).
Because , the scalar is in .
Proof
Assume, for contradiction, that for some left -submodule . Since by [L1], one has , so . The restriction is injective because . It is also nonzero, for otherwise . Choose with , and replace by so that .
For each , the element lies in because is a -submodule by [L2]. Also by [L1], so and therefore . Since both and lie in , one also has . Thus , so for every .
Write For any , step 2.1 gives Comparing coefficients in the basis of shows for all , so all coefficients are equal to one scalar . Hence by [L1] and [A1], a contradiction. Therefore no such complement exists.
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, Example 1.1.7 (standard reference, not scraped)
- Pavel Etingof et al., Introduction to Representation Theory, Proposition 3.2 (standard reference, not scraped)