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 coset basis makes a monomial representation monomial matrices
Statement
Let be a finite group, , and a linear character. Fix a left transversal of in .
-
has a basis indexed by (equivalently, by the left cosets ), and for every the matrix of in that basis is monomial: it has exactly one nonzero entry in each row and exactly one nonzero entry in each column, each of them a value of .
-
Conversely, suppose is an irreducible finite-dimensional complex -representation with a basis such that every permutes the lines and acts on each of them by a scalar, that is with and a permutation of . Let be the stabilizer of the line , with its linear character . Then and . In particular such a is monomial.
Facts & Assumptions
Given: For claim 1, a finite group , a subgroup , a linear character , and a left transversal meeting every left coset in exactly one point. For claim 2, an irreducible finite-dimensional complex -representation with a basis which every permutes up to nonzero scalars.
for a complex -module , with module structure pointwise and . (The induced -linear -module as -covariant functions on ).
Evaluation on gives a -linear isomorphism , , and . (A left transversal identifies with a direct sum of copies of ).
A left coset is (Left and right cosets and of a subgroup). Every belongs to , and if , then , so . Thus left cosets partition ; since meets each coset once, for holds exactly when .
is irreducible when and and are its only -invariant subspaces. (Subrepresentations, direct sums of representations, and irreducibility).
is a linear character of , so the one-dimensional -module is with , and denotes . (Monomial representations, monomial characters, and M-groups).
Left multiplication by a fixed maps left cosets bijectively to left cosets: , and implies .
Proof
The symbols and are local to each claim: in claim 1 they are the given subgroup and character, and in claim 2 they are the line stabilizer and its character from step 1.2. The transversal is used only for claim 1.
For define by for , and for . This is well defined because a decomposition with , is unique ([F3]), and lies in : for and one has and , while for also and both sides vanish.
For claim 2 put and . This is a subgroup of containing , and each acts on the line by a nonzero scalar; writing for defines a group homomorphism , because the action of on is a group action. Thus is a linear character of and is a one-dimensional -module.
For claim 2 let be the span of all lines with . Each spanning line is one of the basis lines , because the action permutes the basis lines, so ; and is -invariant with , since and . Irreducibility of forces , so every basis line equals some and the distinct lines , , are exactly the basis lines.
The function of step 1.1 takes the value at and the value at every other element of ; hence is the -th standard basis vector of . By [F2] the map is an isomorphism, so is a basis of and .
Fix and . By [A1] there are unique and with . For the value is nonzero exactly when , that is , hence exactly when . At that point by the relation , so .
For claim 2 choose a left transversal of the stabilizer from step 1.2. Such an exists by choosing one representative from each of the finitely many nonempty cosets in the finite group ; no axiom of choice is needed. The coset argument in [F3] applies to this and . The map , , is a well-defined bijection: it is well defined because for ; it is injective because gives , that is , hence by [F3]; and it is surjective because every can be written with , , giving . By step 1.3 the translates , , are exactly the basis lines, and , each having a unique expression with .
Thus the matrix of in the basis has its only possibly nonzero entry in the column indexed by at the row indexed by , where , and that entry equals . The map is a permutation of by [A1], so every row also receives exactly one nonzero entry, namely from the unique with . Hence the matrix is monomial with nonzero entries among the values of , which proves claim 1.
Define by for , , where is the unique expression of step 2.3. This is well defined by [F3], it satisfies the covariance law for , , and so lies in as in [F1]; the assignment is -linear because the coordinates depend linearly on .
For put , an element of by step 2.3, and is -linear. For step 3.2 gives , so . Conversely, for and the definition of gives , and both and satisfy the covariance law [F1], so they agree on ; hence is surjective and .
is -equivariant. Let and ; for each write uniquely with , , so that has -component . By step 3.2, , while the function takes the value at by [F1]; as runs over so does , so and agree on and both satisfy the covariance law, hence they agree on .
Steps 4.1 and 4.2 exhibit as a -equivariant -linear bijection, where is the linear character of step 1.2, so is monomial in the sense of [F5]. Together with step 3.1 this proves both assertions.
Depends on
- Monomial representations, monomial characters, and M-groups
- A left transversal identifies $\operatorname{Ind}_H^G W$ with a direct sum of $[G:H]$ copies of $W$
- The induced $R$-linear $G$-module $\operatorname{Ind}_H^G W$ as $H$-covariant functions on $G$
- Subrepresentations, direct sums of representations, and irreducibility
- Left and right cosets $gH$ and $Hg$ of a subgroup
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 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
- Tammo tom Dieck, Representation Theory — §4.3, printed pp. 57–58 (standard reference, not scraped)
- Wen-Wei Li, Yanqi Lake Lectures on Algebra I — Definition 12.5.1 and the discussion of monomial matrices, printed p. 146 (standard reference, not scraped)