|
Associator
In abstract algebra, the term associator is used in different ways as a measure of the associativity, non-associativity of an algebraic structure. Associators are commonly studied as triple systems. Ring theory For a non-associative ring or non-associative algebra, algebra R, the associator is the multilinear map [\cdot,\cdot,\cdot] : R \times R \times R \to R given by :[x,y,z] = (xy)z - x(yz). Just as the commutator : [x, y] = xy - yx measures the degree of commutativity, non-commutativity, the associator measures the degree of non-associativity of R. For an associative ring or associative algebra, algebra the associator is identically zero. The associator in any ring obeys the identity :w[x,y,z] + [w,x,y]z = [wx,y,z] - [w,xy,z] + [w,x,yz]. The associator is alternating form, alternating precisely when R is an alternative ring. The associator is symmetric in its two rightmost arguments when R is a pre-Lie algebra. The nucleus is the set (mathematics), set of elements that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-associative Algebra
A non-associative algebra (or distributive algebra) is an algebra over a field where the binary operation, binary multiplication operation is not assumed to be associative operation, associative. That is, an algebraic structure ''A'' is a non-associative algebra over a field (mathematics), field ''K'' if it is a vector space over ''K'' and is equipped with a ''K''-bilinear map, bilinear binary multiplication operation ''A'' × ''A'' → ''A'' which may or may not be associative. Examples include Lie algebras, Jordan algebras, the octonions, and three-dimensional Euclidean space equipped with the cross product operation. Since it is not assumed that the multiplication is associative, using parentheses to indicate the order of multiplications is necessary. For example, the expressions (''ab'')(''cd''), (''a''(''bc''))''d'' and ''a''(''b''(''cd'')) may all yield different answers. While this use of ''non-associative'' means that associativity is not assumed, it does not mean that ass ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-associative Ring
A non-associative algebra (or distributive algebra) is an algebra over a field where the binary multiplication operation is not assumed to be associative. That is, an algebraic structure ''A'' is a non-associative algebra over a field ''K'' if it is a vector space over ''K'' and is equipped with a ''K''- bilinear binary multiplication operation ''A'' × ''A'' → ''A'' which may or may not be associative. Examples include Lie algebras, Jordan algebras, the octonions, and three-dimensional Euclidean space equipped with the cross product operation. Since it is not assumed that the multiplication is associative, using parentheses to indicate the order of multiplications is necessary. For example, the expressions (''ab'')(''cd''), (''a''(''bc''))''d'' and ''a''(''b''(''cd'')) may all yield different answers. While this use of ''non-associative'' means that associativity is not assumed, it does not mean that associativity is disallowed. In other words, "non-associative" means "not n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-associative Algebra
A non-associative algebra (or distributive algebra) is an algebra over a field where the binary operation, binary multiplication operation is not assumed to be associative operation, associative. That is, an algebraic structure ''A'' is a non-associative algebra over a field (mathematics), field ''K'' if it is a vector space over ''K'' and is equipped with a ''K''-bilinear map, bilinear binary multiplication operation ''A'' × ''A'' → ''A'' which may or may not be associative. Examples include Lie algebras, Jordan algebras, the octonions, and three-dimensional Euclidean space equipped with the cross product operation. Since it is not assumed that the multiplication is associative, using parentheses to indicate the order of multiplications is necessary. For example, the expressions (''ab'')(''cd''), (''a''(''bc''))''d'' and ''a''(''b''(''cd'')) may all yield different answers. While this use of ''non-associative'' means that associativity is not assumed, it does not mean that ass ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triple System
In algebra, a triple system (or ternar) is a vector space ''V'' over a field F together with a F-trilinear map : (\cdot,\cdot,\cdot) \colon V\times V \times V\to V. The most important examples are Lie triple systems and Jordan triple systems. They were introduced by Nathan Jacobson in 1949 to study subspaces of associative algebras closed under triple commutators ''u'', ''v'' ''w''] and triple Commutator, anticommutators . In particular, any Lie algebra defines a Lie triple system and any Jordan algebra defines a Jordan triple system. They are important in the theories of symmetric spaces, particularly Hermitian symmetric spaces and their generalizations (symmetric R-spaces and their noncompact duals). Lie triple systems A triple system is said to be a ''Lie triple system'' if the trilinear map, denoted cdot,\cdot,\cdot, satisfies the following identities: : ,v,w= - ,u,w : ,v,w+ ,u,v+ ,w,u= 0 : ,x,y.html"_;"title=",v,[w,x,y">,v,[w,x,y_=_u,v,wx,y.html" ;"title=",x,y">,v, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Commutator
In mathematics, the commutator gives an indication of the extent to which a certain binary operation fails to be commutative. There are different definitions used in group theory and ring theory. Group theory The commutator of two elements, and , of a group , is the element : . This element is equal to the group's identity if and only if and commute (from the definition , being equal to the identity if and only if ). The set of all commutators of a group is not in general closed under the group operation, but the subgroup of ''G'' generated by all commutators is closed and is called the ''derived group'' or the '' commutator subgroup'' of ''G''. Commutators are used to define nilpotent and solvable groups and the largest abelian quotient group. The definition of the commutator above is used throughout this article, but many other group theorists define the commutator as :. Identities (group theory) Commutator identities are an important tool in group theory. Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Commutator
In mathematics, the commutator gives an indication of the extent to which a certain binary operation fails to be commutative. There are different definitions used in group theory and ring theory. Group theory The commutator of two elements, and , of a group , is the element : . This element is equal to the group's identity if and only if and commute (from the definition , being equal to the identity if and only if ). The set of all commutators of a group is not in general closed under the group operation, but the subgroup of ''G'' generated by all commutators is closed and is called the ''derived group'' or the '' commutator subgroup'' of ''G''. Commutators are used to define nilpotent and solvable groups and the largest abelian quotient group. The definition of the commutator above is used throughout this article, but many other group theorists define the commutator as :. Identities (group theory) Commutator identities are an important tool in group theory. Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Abstract Algebra
In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures. Algebraic structures include groups, rings, fields, modules, vector spaces, lattices, and algebras over a field. The term ''abstract algebra'' was coined in the early 20th century to distinguish this area of study from older parts of algebra, and more specifically from elementary algebra, the use of variables to represent numbers in computation and reasoning. Algebraic structures, with their associated homomorphisms, form mathematical categories. Category theory is a formalism that allows a unified way for expressing properties and constructions that are similar for various structures. Universal algebra is a related subject that studies types of algebraic structures as single objects. For example, the structure of groups is a single object in universal algebra, which is called the '' variety of groups''. History Before the nineteenth century, alge ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binary Operation
In mathematics, a binary operation or dyadic operation is a rule for combining two elements (called operands) to produce another element. More formally, a binary operation is an operation of arity two. More specifically, an internal binary operation ''on a set'' is a binary operation whose two domains and the codomain are the same set. Examples include the familiar arithmetic operations of addition, subtraction, and multiplication. Other examples are readily found in different areas of mathematics, such as vector addition, matrix multiplication, and conjugation in groups. An operation of arity two that involves several sets is sometimes also called a ''binary operation''. For example, scalar multiplication of vector spaces takes a scalar and a vector to produce a vector, and scalar product takes two vectors to produce a scalar. Such binary operations may be called simply binary functions. Binary operations are the keystone of most algebraic structures that are studie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monoidal Category
In mathematics, a monoidal category (or tensor category) is a category \mathbf C equipped with a bifunctor :\otimes : \mathbf \times \mathbf \to \mathbf that is associative up to a natural isomorphism, and an object ''I'' that is both a left and right identity for ⊗, again up to a natural isomorphism. The associated natural isomorphisms are subject to certain coherence conditions, which ensure that all the relevant diagrams commute. The ordinary tensor product makes vector spaces, abelian groups, ''R''-modules, or ''R''-algebras into monoidal categories. Monoidal categories can be seen as a generalization of these and other examples. Every ( small) monoidal category may also be viewed as a " categorification" of an underlying monoid, namely the monoid whose elements are the isomorphism classes of the category's objects and whose binary operation is given by the category's tensor product. A rather different application, of which monoidal categories can be considered an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Functor
In mathematics, specifically category theory, a functor is a mapping between categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) are associated to topological spaces, and maps between these algebraic objects are associated to continuous maps between spaces. Nowadays, functors are used throughout modern mathematics to relate various categories. Thus, functors are important in all areas within mathematics to which category theory is applied. The words ''category'' and ''functor'' were borrowed by mathematicians from the philosophers Aristotle and Rudolf Carnap, respectively. The latter used ''functor'' in a linguistic context; see function word. Definition Let ''C'' and ''D'' be categories. A functor ''F'' from ''C'' to ''D'' is a mapping that * associates each object X in ''C'' to an object F(X) in ''D'', * associates each morphism f \colon X \to Y in ''C'' to a morphism F(f) \colon F(X) \to F(Y) in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Theory
Category theory is a general theory of mathematical structures and their relations that was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Nowadays, category theory is used in almost all areas of mathematics, and in some areas of computer science. In particular, many constructions of new mathematical objects from previous ones, that appear similarly in several contexts are conveniently expressed and unified in terms of categories. Examples include quotient spaces, direct products, completion, and duality. A category is formed by two sorts of objects: the objects of the category, and the morphisms, which relate two objects called the ''source'' and the ''target'' of the morphism. One often says that a morphism is an ''arrow'' that ''maps'' its source to its target. Morphisms can be ''composed'' if the target of the first morphism equals the source of the second one, and morphism com ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isomorphism
In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word isomorphism is derived from the Ancient Greek: ἴσος ''isos'' "equal", and μορφή ''morphe'' "form" or "shape". The interest in isomorphisms lies in the fact that two isomorphic objects have the same properties (excluding further information such as additional structure or names of objects). Thus isomorphic structures cannot be distinguished from the point of view of structure only, and may be identified. In mathematical jargon, one says that two objects are . An automorphism is an isomorphism from a structure to itself. An isomorphism between two structures is a canonical isomorphism (a canonical map that is an isomorphism) if there is only one isomorphism between the two structures (as it is the case for solutions of a uni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
