|
Symplectic Group
In mathematics, the name symplectic group can refer to two different, but closely related, collections of mathematical groups, denoted and for positive integer ''n'' and field F (usually C or R). The latter is called the compact symplectic group and is also denoted by \mathrm(n). Many authors prefer slightly different notations, usually differing by factors of . The notation used here is consistent with the size of the most common matrices which represent the groups. In Cartan's classification of the simple Lie algebras, the Lie algebra of the complex group is denoted , and is the compact real form of . Note that when we refer to ''the'' (compact) symplectic group it is implied that we are talking about the collection of (compact) symplectic groups, indexed by their dimension . The name "symplectic group" is due to Hermann Weyl as a replacement for the previous confusing names (line) complex group and Abelian linear group, and is the Greek analog of "complex". The metaple ... [...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 mathematical analysis, 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 mathematical object, abstract objects and the use of pure reason to proof (mathematics), prove them. These objects consist of either abstraction (mathematics), abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of inference rule, deductive rules to already established results. These results include previously proved theorems, axioms ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bilinear Form
In mathematics, a bilinear form is a bilinear map on a vector space (the elements of which are called '' vectors'') over a field ''K'' (the elements of which are called '' scalars''). In other words, a bilinear form is a function that is linear in each argument separately: * and * and The dot product on \R^n is an example of a bilinear form. The definition of a bilinear form can be extended to include modules over a ring, with linear maps replaced by module homomorphisms. When is the field of complex numbers , one is often more interested in sesquilinear forms, which are similar to bilinear forms but are conjugate linear in one argument. Coordinate representation Let be an -dimensional vector space with basis . The matrix ''A'', defined by is called the ''matrix of the bilinear form'' on the basis . If the matrix represents a vector with respect to this basis, and analogously, represents another vector , then: B(\mathbf, \mathbf) = \mathbf^\textsf A\ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Connected Space
In topology and related branches of mathematics, a connected space is a topological space that cannot be represented as the union of two or more disjoint non-empty open subsets. Connectedness is one of the principal topological properties that are used to distinguish topological spaces. A subset of a topological space X is a if it is a connected space when viewed as a subspace of X. Some related but stronger conditions are path connected, simply connected, and n-connected. Another related notion is '' locally connected'', which neither implies nor follows from connectedness. Formal definition A topological space X is said to be if it is the union of two disjoint non-empty open sets. Otherwise, X is said to be connected. A subset of a topological space is said to be connected if it is connected under its subspace topology. Some authors exclude the empty set (with its unique topology) as a connected space, but this article does not follow that practice. For a topol ... [...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. ... [...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 r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Number
In mathematics, a real number is a number that can be used to measure a ''continuous'' one-dimensional quantity such as a distance, duration or temperature. Here, ''continuous'' means that values can have arbitrarily small variations. Every real number can be almost uniquely represented by an infinite decimal expansion. The real numbers are fundamental in calculus (and more generally in all mathematics), in particular by their role in the classical definitions of limits, continuity and derivatives. The set of real numbers is denoted or \mathbb and is sometimes called "the reals". The adjective ''real'' in this context was introduced in the 17th century by René Descartes to distinguish real numbers, associated with physical reality, from imaginary numbers (such as the square roots of ), which seemed like a theoretical contrivance unrelated to physical reality. The real numbers include the rational numbers, such as the integer and the fraction . The rest of the rea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
If And Only If
In logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false. The connective is biconditional (a statement of material equivalence), and can be likened to the standard material conditional ("only if", equal to "if ... then") combined with its reverse ("if"); hence the name. The result is that the truth of either one of the connected statements requires the truth of the other (i.e. either both statements are true, or both are false), though it is controversial whether the connective thus defined is properly rendered by the English "if and only if"—with its pre-existing meaning. For example, ''P if and only if Q'' means that ''P'' is true whenever ''Q'' is true, and the only case in which ''P'' is true is if ''Q'' is also true, whereas in the case of ''P if Q'', there could be other scenarios where ''P'' is true and ''Q' ... [...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' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subgroup
In group theory, a branch of mathematics, given a group ''G'' under a binary operation ∗, a subset ''H'' of ''G'' is called a subgroup of ''G'' if ''H'' also forms a group under the operation ∗. More precisely, ''H'' is a subgroup of ''G'' if the restriction of ∗ to is a group operation on ''H''. This is often denoted , read as "''H'' is a subgroup of ''G''". The trivial subgroup of any group is the subgroup consisting of just the identity element. A proper subgroup of a group ''G'' is a subgroup ''H'' which is a proper subset of ''G'' (that is, ). This is often represented notationally by , read as "''H'' is a proper subgroup of ''G''". Some authors also exclude the trivial group from being proper (that is, ). If ''H'' is a subgroup of ''G'', then ''G'' is sometimes called an overgroup of ''H''. The same definitions apply more generally when ''G'' is an arbitrary semigroup, but this article will only deal with subgroups of groups. Subgroup tests Suppose ... [...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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transpose
In linear algebra, the transpose of a matrix is an operator which flips a matrix over its diagonal; that is, it switches the row and column indices of the matrix by producing another matrix, often denoted by (among other notations). The transpose of a matrix was introduced in 1858 by the British mathematician Arthur Cayley. In the case of a logical matrix representing a binary relation R, the transpose corresponds to the converse relation RT. Transpose of a matrix Definition The transpose of a matrix , denoted by , , , A^, , , or , may be constructed by any one of the following methods: # Reflect over its main diagonal (which runs from top-left to bottom-right) to obtain #Write the rows of as the columns of #Write the columns of as the rows of Formally, the -th row, -th column element of is the -th row, -th column element of : :\left mathbf^\operatorname\right = \left mathbf\right. If is an matrix, then is an matrix. In the case of square matrices, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nonsingular Matrix
In linear algebra, an -by- square matrix is called invertible (also nonsingular or nondegenerate), if there exists an -by- square matrix such that :\mathbf = \mathbf = \mathbf_n \ where denotes the -by- identity matrix and the multiplication used is ordinary matrix multiplication. If this is the case, then the matrix is uniquely determined by , and is called the (multiplicative) ''inverse'' of , denoted by . Matrix inversion is the process of finding the matrix that satisfies the prior equation for a given invertible matrix . A square matrix that is ''not'' invertible is called singular or degenerate. A square matrix is singular if and only if its determinant is zero. Singular matrices are rare in the sense that if a square matrix's entries are randomly selected from any finite region on the number line or complex plane, the probability that the matrix is singular is 0, that is, it will "almost never" be singular. Non-square matrices (-by- matrices for which ) do no ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
;_Cayley_table.svg "Click for more on -> Special Linear Group")
