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.
Modular trace depends only on the p-regular part
Statement
Let be finite, have characteristic , and be a finite-dimensional representation. Each has commuting factors , with of order prime to and of -power order, and .
Facts & Assumptions
Given: , and of characteristic .
The action is a homomorphism into the invertible linear maps of a finite-dimensional space (A finite-dimensional representation over a field, and its degree).
Coprime integers admit an integral linear combination equal to one (Bézout's identity: for integers not both zero, is the least positive element of ; in particular has an integer solution).
An independent spanning list is a basis (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
Independent lists in a space with a finite spanning set have bounded length (If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with ).
Proof
Write with . Choose with , and set , . Their product is and they commute; . This also covers and .
Put . The commuting binomial identity in characteristic , iterated times, gives . Since , the map satisfies . Moreover .
A nilpotent map has trace zero over itself. To see this, extend an independent list successively along . At each stage, if the current list does not span that kernel, append a vector outside its span. The dimension bound forces this finite procedure to terminate. Since , its matrix in the resulting basis has zero diagonal. The trace is independent of basis: , so .
By additivity of the diagonal sum, . For both sums are empty and zero. No assertion that is needed.
Depends on
- A finite-dimensional representation $\rho:G\to \operatorname{GL}(V)$ over a field, and its degree
- Bézout's identity: for integers $a, b$ not both zero, $\gcd(a,b)$ is the least positive element of $\{\, ax + by : x, y \in \mathbb{Z} \,\}$; in particular $ax + by = \gcd(a,b)$ has an integer solution
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- If $V$ has a spanning set with $n$ elements, then every linearly independent subset of $V$ is finite with at most $n$ elements; in particular $V$ has no linearly independent subset equinumerous with $\mathbb{N}$
Used by
Dependency tree · two levels
38 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
- Pound/Martin, Modular Representation Theory, Lemma 6.6, p.18 (standard reference, not scraped)