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.
Expansion of a root-group translate of a weight vector
Statement
Assume the Axiom of Choice inherited from the named suppliers. Let be a rational representation of a split reductive group , let be a weight vector, and let with root-group isomorphism (Root subgroups of a split reductive group). These coordinates satisfy over every -algebra. Then there are vectors (), only finitely many nonzero, such that for every (and every -algebra after base change). In particular the orbit map is polynomial with constant term and higher coefficients in the stated weight spaces.
Facts & Assumptions
Given: A split reductive group with root , the root-group isomorphism , a rational representation and a weight vector (Weights, dominant weights and the highest-weight order of a rational representation).
Finite-dimensional orbit. The vector lies in a finite-dimensional subcomodule ; the action of preserves , so for all (Every element of a comodule lies in a finite-dimensional subcomodule, Rational representations and comodules of an affine group scheme).
Rational action is polynomial. For a finite-dimensional rational representation of the matrix coefficients of are polynomial functions of ; hence is given by a polynomial in with values in , and a basis of exhibits it as with , only finitely many nonzero (Rational representations and comodules of an affine group scheme).
Conjugation formula. For and one has (Root subgroups of a split reductive group, Roots and root groups of a split reductive group). To justify the formula from the supplied -stability and Lie weight, work with the universal torus point over , a domain. Conjugation induces a polynomial automorphism of fixing ; its polynomial inverse and the degree-of-composition identity over a domain force it to be , with a unit. Its differential at is the adjoint character , hence . This universal identity specializes to every , including nonreduced base algebras.
Weight vectors. for all , and the weight spaces are the eigenspaces of the -action (Weights, dominant weights and the highest-weight order of a rational representation).
Proof
By [F1] and [F2] there is a finite expansion with and only finitely many nonzero. Setting gives .
For one has using [F3] and [F4].
On the other hand by linearity of the action over . Comparing coefficients of in the two polynomial expressions for all -points shows for every , that is, : the character with satisfies for all and all . Together with step 1.1 this gives the asserted expansion.
Since and for with only finitely many nonzero, the orbit map is polynomial with constant term and higher coefficients in the stated weight spaces.
Remarks
- The base-change clause of the statement is included because the computation is carried out for an arbitrary -algebra of values of and points ; the expansion is the same polynomial for every .
- If for all the vector is fixed by ; the vanishing of all higher coefficients is what makes a primitive vector fixed by every positive root group.
Depends on
- The Axiom of Choice
- Rational representations and comodules of an affine group scheme
- Roots and root groups of a split reductive group
- Weights, dominant weights and the highest-weight order of a rational representation
- Root subgroups of a split reductive group
- Every element of a comodule lies in a finite-dimensional subcomodule
- Increasing-index wedges of a basis form a basis of $\Lambda^kV$
Used by
Dependency tree · two levels
45 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
- J. S. Milne, Algebraic Groups (corrected 2022 printing, Cambridge University Press) (standard reference, not scraped)
- Robert Steinberg, Lectures on Chevalley Groups (Yale University, 1967; notes prepared by J. Faulkner and R. Wilson) (standard reference, not scraped)