|
Matrix Group
In mathematics, a matrix group is a group ''G'' consisting of invertible matrices over a specified field ''K'', with the operation of matrix multiplication. A linear group is a group that is isomorphic to a matrix group (that is, admitting a faithful, finite-dimensional representation over ''K''). Any finite group is linear, because it can be realized by permutation matrices using Cayley's theorem. Among infinite groups, linear groups form an interesting and tractable class. Examples of groups that are not linear include groups which are "too big" (for example, the group of permutations of an infinite set), or which exhibit some pathological behavior (for example, finitely generated infinite torsion groups). Definition and basic examples A group ''G'' is said to be ''linear'' if there exists a field ''K'', an integer ''d'' and an injective homomorphism from ''G'' to the general linear group GL''d''(''K'') (a faithful linear representation of dimension ''d'' over ''K''): i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Homomorphism
In mathematics, given two groups, (''G'', ∗) and (''H'', ·), a group homomorphism from (''G'', ∗) to (''H'', ·) is a function ''h'' : ''G'' → ''H'' such that for all ''u'' and ''v'' in ''G'' it holds that : h(u*v) = h(u) \cdot h(v) where the group operation on the left side of the equation is that of ''G'' and on the right side that of ''H''. From this property, one can deduce that ''h'' maps the identity element ''eG'' of ''G'' to the identity element ''eH'' of ''H'', : h(e_G) = e_H and it also maps inverses to inverses in the sense that : h\left(u^\right) = h(u)^. \, Hence one can say that ''h'' "is compatible with the group structure". Older notations for the homomorphism ''h''(''x'') may be ''x''''h'' or ''x''''h'', though this may be confused as an index or a general subscript. In automata theory, sometimes homomorphisms are written to the right of their arguments without parentheses, so that ''h''(''x'') becomes simply xh. In areas of mathematics where one ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unitary Group
In mathematics, the unitary group of degree ''n'', denoted U(''n''), is the group of unitary matrices, with the group operation of matrix multiplication. The unitary group is a subgroup of the general linear group . Hyperorthogonal group is an archaic name for the unitary group, especially over finite fields. For the group of unitary matrices with determinant 1, see Special unitary group. In the simple case , the group U(1) corresponds to the circle group, consisting of all complex numbers with absolute value 1, under multiplication. All the unitary groups contain copies of this group. The unitary group U(''n'') is a real Lie group of dimension ''n''2. The Lie algebra of U(''n'') consists of skew-Hermitian matrices, with the Lie bracket given by the commutator. The general unitary group (also called the group of unitary similitudes) consists of all matrices ''A'' such that ''A''∗''A'' is a nonzero multiple of the identity matrix, and is just the product of the unitary gr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orthogonal Group
In mathematics, the orthogonal group in dimension , denoted , is the Group (mathematics), group of isometry, distance-preserving transformations of a Euclidean space of dimension that preserve a fixed point, where the group operation is given by Function composition, composing transformations. The orthogonal group is sometimes called the general orthogonal group, by analogy with the general linear group. Equivalently, it is the group of orthogonal matrix, orthogonal matrices, where the group operation is given by matrix multiplication (an orthogonal matrix is a real matrix whose invertible matrix, inverse equals its transpose). The orthogonal group is an algebraic group and a Lie group. It is compact group, compact. The orthogonal group in dimension has two connected component (topology), connected components. The one that contains the identity element is a normal subgroup, called the special orthogonal group, and denoted . It consists of all orthogonal matrices of determinant ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Algebraic Group
In mathematics, a linear algebraic group is a subgroup of the group of invertible n\times n matrices (under matrix multiplication) that is defined by polynomial equations. An example is the orthogonal group, defined by the relation M^TM = I_n where M^T is the transpose of M. Many Lie groups can be viewed as linear algebraic groups over the field of real or complex numbers. (For example, every compact Lie group can be regarded as a linear algebraic group over R (necessarily R-anisotropic and reductive), as can many noncompact groups such as the simple Lie group SL(''n'',R).) The simple Lie groups were classified by Wilhelm Killing and Élie Cartan in the 1880s and 1890s. At that time, no special use was made of the fact that the group structure can be defined by polynomials, that is, that these are algebraic groups. The founders of the theory of algebraic groups include Maurer, Chevalley, and . In the 1950s, Armand Borel constructed much of the theory of algebraic groups as it ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Classical Group
In mathematics, the classical groups are defined as the special linear groups over the reals , the complex numbers and the quaternions together with special automorphism groups of symmetric or skew-symmetric bilinear forms and Hermitian or skew-Hermitian sesquilinear forms defined on real, complex and quaternionic finite-dimensional vector spaces. Of these, the complex classical Lie groups are four infinite families of Lie groups that together with the exceptional groups exhaust the classification of simple Lie groups. The compact classical groups are compact real forms of the complex classical groups. The finite analogues of the classical groups are the classical groups of Lie type. The term "classical group" was coined by Hermann Weyl, it being the title of his 1939 monograph ''The Classical Groups''. The classical groups form the deepest and most useful part of the subject of linear Lie groups. Most types of classical groups find application in classical and modern physics. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Number
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the form a + bi, where and are real numbers. Because no real number satisfies the above equation, was called an imaginary number by René Descartes. For the complex number a+bi, is called the , and is called the . The set of complex numbers is denoted by either of the symbols \mathbb C or . Despite the historical nomenclature "imaginary", complex numbers are regarded in the mathematical sciences as just as "real" as the real numbers and are fundamental in many aspects of the scientific description of the natural world. Complex numbers allow solutions to all polynomial equations, even those that have no solutions in real numbers. More precisely, the fundamental theorem of algebra asserts that every non-constant polynomial equation with real or ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lie Group
In mathematics, a Lie group (pronounced ) is a group that is also a differentiable manifold. A manifold is a space that locally resembles Euclidean space, whereas groups define the abstract concept of a binary operation along with the additional properties it must have to be thought of as a "transformation" in the abstract sense, for instance multiplication and the taking of inverses (division), or equivalently, the concept of addition and the taking of inverses (subtraction). Combining these two ideas, one obtains a continuous group where multiplying points and their inverses are continuous. If the multiplication and taking of inverses are smooth (differentiable) as well, one obtains a Lie group. Lie groups provide a natural model for the concept of continuous symmetry, a celebrated example of which is the rotational symmetry in three dimensions (given by the special orthogonal group \text(3)). Lie groups are widely used in many parts of modern mathematics and physics. Lie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Index Set
In mathematics, an index set is a set whose members label (or index) members of another set. For instance, if the elements of a set may be ''indexed'' or ''labeled'' by means of the elements of a set , then is an index set. The indexing consists of a surjective function from onto , and the indexed collection is typically called an '' (indexed) family'', often written as . Examples *An enumeration of a set gives an index set J \sub \N, where is the particular enumeration of . *Any countably infinite set can be (injectively) indexed by the set of natural numbers \N. *For r \in \R, the indicator function on is the function \mathbf_r\colon \R \to \ given by \mathbf_r (x) := \begin 0, & \mbox x \ne r \\ 1, & \mbox x = r. \end The set of all such indicator functions, \_ , is an uncountable set indexed by \mathbb. Other uses In computational complexity theory and cryptography, an index set is a set for which there exists an algorithm that can sample the set efficiently; e. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangular Matrix
In mathematics, a triangular matrix is a special kind of square matrix. A square matrix is called if all the entries ''above'' the main diagonal are zero. Similarly, a square matrix is called if all the entries ''below'' the main diagonal are zero. Because matrix equations with triangular matrices are easier to solve, they are very important in numerical analysis. By the LU decomposition algorithm, an invertible matrix may be written as the product of a lower triangular matrix ''L'' and an upper triangular matrix ''U'' if and only if all its leading principal minors are non-zero. Description A matrix of the form :L = \begin \ell_ & & & & 0 \\ \ell_ & \ell_ & & & \\ \ell_ & \ell_ & \ddots & & \\ \vdots & \vdots & \ddots & \ddots & \\ \ell_ & \ell_ & \ldots & \ell_ & \ell_ \end is called a lower triangular matrix or left triangular matrix, and a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Determinant
In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. It characterizes some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants (the preceding property is a corollary of this one). The determinant of a matrix is denoted , , or . The determinant of a matrix is :\begin a & b\\c & d \end=ad-bc, and the determinant of a matrix is : \begin a & b & c \\ d & e & f \\ g & h & i \end= aei + bfg + cdh - ceg - bdi - afh. The determinant of a matrix can be defined in several equivalent ways. Leibniz formula expresses the determinant as a sum of signed products of matrix entries such that each summand is the product of different entries, and the number of these summands is n!, the factorial of (t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Special Linear Group
In mathematics, the special linear group of degree ''n'' over a field ''F'' is the set of matrices with determinant 1, with the group operations of ordinary matrix multiplication and matrix inversion. This is the normal subgroup of the general linear group given by the kernel of the determinant :\det\colon \operatorname(n, F) \to F^\times. where ''F''× is the multiplicative group of ''F'' (that is, ''F'' excluding 0). These elements are "special" in that they form an algebraic subvariety of the general linear group – they satisfy a polynomial equation (since the determinant is polynomial in the entries). When ''F'' is a finite field of order ''q'', the notation is sometimes used. Geometric interpretation The special linear group can be characterized as the group of ''volume and orientation preserving'' linear transformations of R''n''; this corresponds to the interpretation of the determinant as measuring change in volume and orientation. Lie subgroup When ''F'' is R ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
;_Cayley_table.svg "Click for more on -> Special Linear Group")