Diagonalizable group

In mathematics, an affine group is said to be diagonalizable if it is isomorphic to a subgroup of D_n, the group of diagonal matrices. A diagonalizable group defined over k is said to split over k or k-split if the isomorphism is defined over k. This coincides with the usual notion of split for an algebraic group. Every diagonalizable group splits over k_s.^[1] Any closed subgroup and image of diagonalizable groups are diagonalizable. The torsion subgroup of a diagonalizable group is dense.

The category of diagonalizable groups defined over k is equivalent to the category of finitely generated abelian group with Γ^[2]-equivariant morphisms without p-torsion. This is an analog of Poincaré duality and motivated the terminology.

A diagonalizable k-group is said to be anisotropic if it has no nontrivial k-valued character.

The so-called "rigidity" states that the identity component of the centralizer of a diagonalizable group coincides with the identity component of the normalizer of the group. The fact plays a crucial role in the structure theory of solvable groups.

A connected diagonalizable group is called an algebraic torus (which is not necessarily compact, in contrast to a complex torus). A k-torus is a torus defined over k. The centralizer of a maximal torus is called a Cartan subgroup.

Notes

1. ^ The separable closure of k.
2. ^ $\Gamma=\operatorname{Gal}(k_s / k)$

References

• Borel, A. Linear algebraic groups, 2nd ed.

This algebra-related article is a stub. You can help Wikipedia by expanding it.v · Categories: Algebraic groups Algebra stubs Wikimedia Foundation. 2010. Игры ⚽ Нужно решить контрольную? Diagonal spread Diagonella Look at other dictionaries: Diagonalizable matrix — In linear algebra, a square matrix A is called diagonalizable if it is similar to a diagonal matrix, i.e., if there exists an invertible matrix P such that P −1AP is a diagonal matrix. If V is a finite dimensional vector space, then a linear …   Wikipedia Logarithm of a matrix — In mathematics, a logarithm of a matrix is another matrix such that the matrix exponential of the latter matrix equals the original matrix. It is thus a generalization of the scalar logarithm and in some sense an inverse function of the matrix… …   Wikipedia Matrix exponential — In mathematics, the matrix exponential is a matrix function on square matrices analogous to the ordinary exponential function. Abstractly, the matrix exponential gives the connection between a matrix Lie algebra and the corresponding Lie group.… …   Wikipedia Jordan normal form — In linear algebra, a Jordan normal form (often called Jordan canonical form)[1] of a linear operator on a finite dimensional vector space is an upper triangular matrix of a particular form called Jordan matrix, representing the operator on some… …   Wikipedia Involution (mathematics) — In mathematics, an involution, or an involutary function, is a function that is its own inverse, so that: f ( f ( x )) = x for all x in the domain of f . General propertiesAny involution is a bijection.The identity map is a trivial example of an… …   Wikipedia Compact operator on Hilbert space — In functional analysis, compact operators on Hilbert spaces are a direct extension of matrices: in the Hilbert spaces, they are precisely the closure of finite rank operators in the uniform operator topology. As such, results from matrix theory… …   Wikipedia Isospectral — In mathematics, two linear operators are called isospectral or cospectral if they have the same spectrum. Roughly speaking, they are supposed to have the same sets of eigenvalues, when those are counted with multiplicity. The theory of… …   Wikipedia Matrix (mathematics) — Specific elements of a matrix are often denoted by a variable with two subscripts. For instance, a2,1 represents the element at the second row and first column of a matrix A. In mathematics, a matrix (plural matrices, or less commonly matrixes)… …   Wikipedia Unipotent — In mathematics, a unipotent element r of a ring R is one such that r − 1 is a nilpotent element, in other words such that some power ( r − 1) n is zero.In particular a square matrix M is a unipotent matrix if and only if its characteristic… …   Wikipedia Diagonal matrix — In linear algebra, a diagonal matrix is a matrix (usually a square matrix) in which the entries outside the main diagonal (↘) are all zero. The diagonal entries themselves may or may not be zero. Thus, the matrix D = (di,j) with n columns and n… …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”