An affine algebraic group over is an affine variety equipped with multiplication , inversion , and an identity element satisfying the group axioms, with multiplication and inversion both regular maps. Dually, the coordinate ring is a commutative Hopf algebra: multiplication on induces the comultiplication , inversion induces the antipode, and evaluation at the identity is the counit.
Solved by gpt-5.6-sol high.
Choose algebra generators of the finitely generated coordinate ring . The right regular action is locally finite: writing
shows that every right translate of lies in the finite span of the . Hence all the lie in some finite-dimensional translation-stable subspace .
This gives a rational representation . If , then for every and . Setting gives for every algebra generator, and therefore for every regular function on . Regular functions separate closed points of an affine variety, so . Thus is a faithful representation of an affine algebraic group.
Solved by gpt-5.6-sol high.
For , write . Under the left-right regular representation of an affine algebraic group,
so the action factors through the difference map . The degree filtration
is stable and has trivial one-dimensional successive quotients. The module is indecomposable; every nonzero submodule contains a nonzero translation difference of lower degree and, on iteration using suitable translations, meets the unique invariant line .
For every finite-dimensional rational -module , the matrix-coefficient construction gives
On the other hand,
Indeed, a nonzero finite-dimensional quotient of would have a simple quotient. Every simple rational representation of the unipotent algebraic group is trivial, so this would give a nonzero translation-invariant functional on . No such functional exists: if is its first nonzero value on a monomial, translating a sufficiently high monomial produces a nonzero coefficient times , contradicting invariance.
Solved by gpt-5.6-sol high.
For , write . Since
the weight-space decomposition is
as a -representation.
If is the weight decomposition of a finite-dimensional -module, the matrix-coefficient argument again gives . A map from to is independently determined by the image in of the basis vector ; only finitely many are nonzero. Thus
as vector spaces.
Solved by gpt-5.6-sol high.
An element is semisimple when its image in a faithful finite-dimensional representation is diagonalizable, and unipotent when that image has every eigenvalue equal to one. These conditions are independent of the faithful representation. The Jordan decomposition in an affine algebraic group is the unique factorization
with semisimple and unipotent.
In , matrices with two distinct eigenvalues form a dense open subset and are semisimple, so semisimple elements are dense. Their full locus is not open: a scalar matrix is semisimple, but every neighbourhood of it contains a nontrivial Jordan block. The group also has nonidentity unipotent matrices.
For a contrasting example take . Its semisimple locus is , which is closed and not dense, while for is unipotent and for is semisimple.
Solved by gpt-5.6-sol high.
The derived subgroup of an affine algebraic group is the closed subgroup generated by the commutators . If is connected, the image of every finite product of commutator maps is connected and contains the identity. The closures of these images form an increasing sequence; once their dimensions stabilize, the stable member is closed under products and inverses and equals . Hence is connected.
Now suppose the connected group is solvable. The Lie-Kolchin theorem conjugates a faithful representation of into the upper triangular matrices. Every commutator then has all diagonal entries equal to one, so every element of is unipotent. Moreover lies in the upper unitriangular group, whose superdiagonal filtration is a central series. It is therefore a nilpotent group.
A diagonalizable algebraic group is a closed subgroup of a product of copies of . A unipotent algebraic group has only unipotent elements, while a semisimple algebraic group here means one all of whose elements are semisimple. A reductive algebraic group is smooth, connected, affine, and has trivial connected normal unipotent radical.
Solved by gpt-5.6-sol high.
The Kolchin theorem conjugates a faithful representation of a unipotent algebraic group into the upper unitriangular group . Let consist of matrices whose first superdiagonals vanish. Matrix multiplication gives
Since , this filtration is a finite central series, so and every subgroup of it are nilpotent groups. Hence is nilpotent.
The converse fails: is abelian, hence nilpotent, but its nonidentity points are semisimple rather than unipotent.
Solved by gpt-5.6-sol high.
Let . Choose finitely many generators of and a finite-dimensional -submodule containing them, using local finiteness of the right regular action. Set . Right translation by preserves , so stabilizes . Conversely, if , every chosen generator has , and evaluation at the identity gives . Thus , and .
Put and take . The line
determines uniquely, so its stabilizer is the stabilizer of , namely .
Solved by gpt-5.6-sol high.
A flat algebraic-group torsor is a faithfully flat morphism with a right -action for which
is an isomorphism.
The orbit is a locally closed subvariety of by the orbit theorem for algebraic-group actions. The fibers of the orbit map are precisely the right cosets of , and the displayed action map is therefore an isomorphism. The theorem on quotients of affine algebraic groups by closed subgroups says that exists and is faithfully flat; the induced map is an isomorphism. Hence the orbit map is a flat -torsor.
Solved by gpt-5.6-sol high.
For and the upper triangular Borel subgroup , the quotient is : a matrix is sent to the line spanned by its first column. Over use the section
and over use
Every matrix above is uniquely with . Thus each inverse image is , proving that is a Zariski -torsor.
Solved by gpt-5.6-sol high.
For and , the quotient is
It is a faithfully flat -torsor, including in characteristic two where is nonreduced. It is not a Zariski torsor: a local section over any nonempty open set would put a square root of the coordinate in the function field , but is not a square there.
Take with acting by , and let . The equality holds exactly when , so the scheme-theoretic stabilizer is .
Solved by gpt-5.6-sol high.
Embed the space of complete isotropic flags into
The incidence conditions and isotropy equations are closed polynomial conditions. Since the Grassmannian is projective, is a projective algebraic variety.
Every complete isotropic flag extends to a symplectic basis. A symplectic change of basis carries any such flag to any other, so acts transitively. The stabilizer of the standard flag consists of the upper triangular symplectic matrices. It is closed, connected, and solvable. The Lie-Kolchin theorem shows that every connected solvable subgroup fixes a complete flag in ; preservation of the symplectic form makes the resulting flag isotropic after taking its first half. Such a subgroup is conjugate into , so is maximal and hence a Borel subgroup.
Solved by gpt-5.6-sol high.
Choose the maximal torus
and write . Then
where the type- root system is
Here and . The root datum has
with the corresponding negatives.
Solved by gpt-5.6-sol high.
The normalizer of permutes the symplectic coordinate planes and may interchange the two basis vectors in each plane. Modulo , these operations give every signed permutation of . Therefore
the signed symmetric group, generated by adjacent coordinate transpositions and one sign change.
Solved by gpt-5.6-sol high.
For each signed permutation , choose its symplectic signed-permutation matrix . The Bruhat decomposition of a reductive algebraic group is the explicit disjoint union
To prove existence, compare the standard isotropic flag with . The ranks
together with the symplectic orthogonality relations determine a unique signed permutation . Symplectic row and column operations from then reduce to , so . Conversely, the same intersection dimensions are constant on a double coset and recover , proving disjointness. This is symplectic Gaussian elimination and establishes the claimed decomposition.
Solved by gpt-5.6-sol high.
Put and . The stabilizer
is the standard parabolic subgroup containing obtained by allowing arbitrary changes of basis inside the successive blocks. Its Levi subgroup is
The fiber of over the displayed partial flag is . Choosing a complete refinement amounts to choosing complete flags in every quotient and a complete isotropic flag in . Hence
the flag variety of an algebraic group ; explicitly it is the product of the complete flag varieties of the listed general linear and symplectic factors.
Solved by gpt-5.6-sol high.
The center consists of scalar symplectic transformations:
This description retains the nonreduced center in characteristic two. Since is a finite central subgroup scheme, the invariant ring is finitely generated and
is an affine algebraic group; the quotient map is finite and faithfully flat.
The quotient torus is . Its character and cocharacter lattices are
The roots and coroots are the same type- sets written in part (ii), now regarded in these lattices. This is the adjoint root datum of type .
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.