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 standard -dimensional representation of inside the permutation representation on is irreducible
Example
Let act on by permuting the standard basis vectors . The line is invariant, and its invariant complement is the standard -dimensional representation. This representation is irreducible.
Facts & Assumptions
Given: The permutation representation of on .
A permutation action on a finite set gives a permutation representation on the free vector space with that basis (The trivial representation, the regular representation, and permutation representations from finite -sets).
A representation is irreducible exactly when it has no proper nonzero subrepresentation (Subrepresentations, direct sums of representations, and irreducibility).
Verification
By [L1], the action of on extends to by permuting coordinates. The vector is fixed by every permutation, so is invariant. The coordinate sum is also permutation-invariant, so is invariant and .
Suppose is a nonzero invariant line, and choose . Because is invariant under the transposition , one has for some scalar , and forces . If , then and the relation gives . If , then and , so .
The -cycle sends to and to , and neither image is a scalar multiple of the original vector. Thus neither of the two possibilities from step 2.1 can span an invariant line. So has no proper nonzero invariant line, and by [L2] it is irreducible.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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.3 (standard reference, not scraped)
- Pavel Etingof et al., Introduction to Representation Theory, Section 3.3 (standard reference, not scraped)