|
Polynomial Identity Algebra
In ring theory, a branch of mathematics, a ring ''R'' is a polynomial identity ring if there is, for some ''N'' > 0, an element ''P'' ≠ 0 of the free algebra, Z, over the ring of integers in ''N'' variables ''X''1, ''X''2, ..., ''X''''N'' such that :P(r_1, r_2, \ldots, r_N) = 0 for all ''N''-tuples ''r''1, ''r''2, ..., ''r''''N'' taken from ''R''. Strictly the ''X''''i'' here are "non-commuting indeterminates", and so "polynomial identity" is a slight abuse of language, since "polynomial" here stands for what is usually called a "non-commutative polynomial". The abbreviation PI-ring is common. More generally, the free algebra over any ring ''S'' may be used, and gives the concept of PI-algebra. If the degree of the polynomial ''P'' is defined in the usual way, the polynomial ''P'' is called monic if at least one of its terms of highest degree has coefficient equal to 1. Every commutative ring is a PI-ring, satisfying the polynomial identity ''XY'' − ''YX'' = 0. Therefore, PI ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Leibniz Formula For Determinants
In algebra, the Leibniz formula, named in honor of Gottfried Leibniz, expresses the determinant of a square matrix in terms of permutations of the matrix elements. If A is an n \times n matrix, where a_ is the entry in the i-th row and j-th column of A, the formula is :\det(A) = \sum_ \sgn(\tau) \prod_^n a_ = \sum_ \sgn(\sigma) \prod_^n a_ where \sgn is the sign function of permutations in the permutation group S_n, which returns +1 and -1 for even and odd permutations, respectively. Another common notation used for the formula is in terms of the Levi-Civita symbol and makes use of the Einstein summation notation, where it becomes : \det(A) = \epsilon_ _ \cdots _, which may be more familiar to physicists. Directly evaluating the Leibniz formula from the definition requires \Omega(n! \cdot n) operations in general—that is, a number of operations asymptotically proportional to n factorial—because n! is the number of order-n permutations. This is impractically difficult for eve ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Basis (linear Algebra)
In mathematics, a Set (mathematics), set of elements of a vector space is called a basis (: bases) if every element of can be written in a unique way as a finite linear combination of elements of . The coefficients of this linear combination are referred to as components or coordinates of the vector with respect to . The elements of a basis are called . Equivalently, a set is a basis if its elements are linearly independent and every element of is a linear combination of elements of . In other words, a basis is a linearly independent spanning set. A vector space can have several bases; however all the bases have the same number of elements, called the dimension (vector space), dimension of the vector space. This article deals mainly with finite-dimensional vector spaces. However, many of the principles are also valid for infinite-dimensional vector spaces. Basis vectors find applications in the study of crystal structures and frame of reference, frames of reference. De ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vector Space
In mathematics and physics, a vector space (also called a linear space) is a set (mathematics), set whose elements, often called vector (mathematics and physics), ''vectors'', can be added together and multiplied ("scaled") by numbers called scalar (mathematics), ''scalars''. The operations of vector addition and scalar multiplication must satisfy certain requirements, called ''vector axioms''. Real vector spaces and complex vector spaces are kinds of vector spaces based on different kinds of scalars: real numbers and complex numbers. Scalars can also be, more generally, elements of any field (mathematics), field. Vector spaces generalize Euclidean vectors, which allow modeling of Physical quantity, physical quantities (such as forces and velocity) that have not only a Magnitude (mathematics), magnitude, but also a Orientation (geometry), direction. The concept of vector spaces is fundamental for linear algebra, together with the concept of matrix (mathematics), matrices, which ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dimension (vector Space)
In mathematics, the dimension of a vector space ''V'' is the cardinality (i.e., the number of vectors) of a Basis (linear algebra), basis of ''V'' over its base Field (mathematics), field. p. 44, §2.36 It is sometimes called Hamel dimension (after Georg Hamel) or algebraic dimension to distinguish it from other types of dimension. For every vector space there exists a basis, and all bases of a vector space have equal cardinality; as a result, the dimension of a vector space is uniquely defined. We say V is if the dimension of V is wiktionary:finite, finite, and if its dimension is infinity, infinite. The dimension of the vector space V over the field F can be written as \dim_F(V) or as [V : F], read "dimension of V over F". When F can be inferred from context, \dim(V) is typically written. Examples The vector space \R^3 has \left\ as a standard basis, and therefore \dim_(\R^3) = 3. More generally, \dim_(\R^n) = n, and even more generally, \dim_(F^n) = n for any Field (mathe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Countably Infinite
In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function from it into the natural numbers; this means that each element in the set may be associated to a unique natural number, or that the elements of the set can be counted one at a time, although the counting may never finish due to an infinite number of elements. In more technical terms, assuming the axiom of countable choice, a set is ''countable'' if its cardinality (the number of elements of the set) is not greater than that of the natural numbers. A countable set that is not finite is said to be countably infinite. The concept is attributed to Georg Cantor, who proved the existence of uncountable sets, that is, sets that are not countable; for example the set of the real numbers. A note on terminology Although the terms "countable" and "countably infinite" as defin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Exterior Algebra
In mathematics, the exterior algebra or Grassmann algebra of a vector space V is an associative algebra that contains V, which has a product, called exterior product or wedge product and denoted with \wedge, such that v\wedge v=0 for every vector v in V. The exterior algebra is named after Hermann Grassmann, and the names of the product come from the "wedge" symbol \wedge and the fact that the product of two elements of V is "outside" V. The wedge product of k vectors v_1 \wedge v_2 \wedge \dots \wedge v_k is called a ''blade (geometry), blade of degree k'' or ''k-blade''. The wedge product was introduced originally as an algebraic construction used in geometry to study areas, volumes, and their higher-dimensional analogues: the magnitude (mathematics), magnitude of a bivector, -blade v\wedge w is the area of the parallelogram defined by v and w, and, more generally, the magnitude of a k-blade is the (hyper)volume of the Parallelepiped#Parallelotope, parallelotope defined by the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Field (mathematics)
In mathematics, a field is a set (mathematics), set on which addition, subtraction, multiplication, and division (mathematics), division are defined and behave as the corresponding operations on rational number, rational and real numbers. A field is thus a fundamental algebraic structure which is widely used in algebra, number theory, and many other areas of mathematics. The best known fields are the field of rational numbers, the field of real numbers and the field of complex numbers. Many other fields, such as field of rational functions, fields of rational functions, algebraic function fields, algebraic number fields, and p-adic number, ''p''-adic fields are commonly used and studied in mathematics, particularly in number theory and algebraic geometry. Most cryptographic protocols rely on finite fields, i.e., fields with finitely many element (set), elements. The theory of fields proves that angle trisection and squaring the circle cannot be done with a compass and straighte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Amitsur–Levitzki Theorem
In algebra, the Amitsur–Levitzki theorem states that the algebra of ''n'' × ''n'' matrices over a commutative ring satisfies a certain identity of degree 2''n''. It was proved by . In particular matrix rings are polynomial identity rings such that the smallest identity they satisfy has degree exactly 2''n''. Statement The standard polynomial of degree ''n'' is :S_n(x_1,\dots,x_n) = \sum_\text(\sigma)x_ \cdots x_ in non-commuting variables ''x''1, ..., ''x''''n'', where the sum is taken over all ''n''! elements of the symmetric group ''S''''n''. The Amitsur–Levitzki theorem states that for ''n'' × ''n'' matrices ''A''1, ..., ''A''2''n'' whose entries are taken from a commutative ring then :S_(A_1,\dots,A_) = 0. Proofs gave the first proof. deduced the Amitsur–Levitzki theorem from the Koszul–Samelson theorem about primitive cohomology of Lie algebras. and gave a simple combinatorial proof as follows. By linearity it is enough to prov ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matrix Ring
In abstract algebra, a matrix ring is a set of matrices with entries in a ring ''R'' that form a ring under matrix addition and matrix multiplication. The set of all matrices with entries in ''R'' is a matrix ring denoted M''n''(''R'') (alternative notations: Mat''n''(''R'') and ). Some sets of infinite matrices form infinite matrix rings. A subring of a matrix ring is again a matrix ring. Over a rng, one can form matrix rngs. When ''R'' is a commutative ring, the matrix ring M''n''(''R'') is an associative algebra over ''R'', and may be called a matrix algebra. In this setting, if ''M'' is a matrix and ''r'' is in ''R'', then the matrix ''rM'' is the matrix ''M'' with each of its entries multiplied by ''r''. Examples * The set of all square matrices over ''R'', denoted M''n''(''R''). This is sometimes called the "full ring of ''n''-by-''n'' matrices". * The set of all upper triangular matrices over ''R''. * The set of all lower triangular matrices over ''R''. * The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Signature Of A Permutation
In mathematics, when ''X'' is a finite set with at least two elements, the permutations of ''X'' (i.e. the bijective functions from ''X'' to ''X'') fall into two classes of equal size: the even permutations and the odd permutations. If any total ordering of ''X'' is fixed, the parity (oddness or evenness) of a permutation \sigma of ''X'' can be defined as the parity of the number of inversions for ''σ'', i.e., of pairs of elements ''x'', ''y'' of ''X'' such that and . The sign, signature, or signum of a permutation ''σ'' is denoted sgn(''σ'') and defined as +1 if ''σ'' is even and −1 if ''σ'' is odd. The signature defines the alternating character of the symmetric group S''n''. Another notation for the sign of a permutation is given by the more general Levi-Civita symbol (''ε''''σ''), which is defined for all maps from ''X'' to ''X'', and has value zero for non-bijective maps. The sign of a permutation can be explicitly expressed as : where ''N''('' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Permutation
In mathematics, a permutation of a set can mean one of two different things: * an arrangement of its members in a sequence or linear order, or * the act or process of changing the linear order of an ordered set. An example of the first meaning is the six permutations (orderings) of the set : written as tuples, they are (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). Anagrams of a word whose letters are all different are also permutations: the letters are already ordered in the original word, and the anagram reorders them. The study of permutations of finite sets is an important topic in combinatorics and group theory. Permutations are used in almost every branch of mathematics and in many other fields of science. In computer science, they are used for analyzing sorting algorithms; in quantum physics, for describing states of particles; and in biology, for describing RNA sequences. The number of permutations of distinct objects is factorial, us ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
