|
Noncommutative Polynomial Ring
In mathematics, especially in the area of abstract algebra known as ring theory, a free algebra is the noncommutative analogue of a polynomial ring since its elements may be described as "polynomials" with non-commuting variables. Likewise, the polynomial ring may be regarded as a free commutative algebra. Definition For ''R'' a commutative ring, the free ( associative, unital) algebra on ''n'' indeterminates is the free ''R''-module with a basis consisting of all words over the alphabet (including the empty word, which is the unit of the free algebra). This ''R''-module becomes an ''R''-algebra by defining a multiplication as follows: the product of two basis elements is the concatenation of the corresponding words: :\left(X_X_ \cdots X_\right) \cdot \left(X_X_ \cdots X_\right) = X_X_ \cdots X_X_X_ \cdots X_, and the product of two arbitrary ''R''-module elements is thus uniquely determined (because the multiplication in an ''R''-algebra must be ''R''-bilinear). This ''R ... [...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] |
Field (mathematics)
In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational and real numbers do. 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 fields of rational functions, algebraic function fields, algebraic number fields, and ''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 elements. The relation of two fields is expressed by the notion of a field extension. Galois theory, initiated by Évariste Galois in the 1830s, is devoted to understanding the symmetries of field extensions. Among other results, thi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Noncommutative Ring
In mathematics, a noncommutative ring is a ring whose multiplication is not commutative; that is, there exist ''a'' and ''b'' in the ring such that ''ab'' and ''ba'' are different. Equivalently, a ''noncommutative ring'' is a ring that is not a commutative ring. Noncommutative algebra is the part of ring theory devoted to study of properties of the noncommutative rings, including the properties that apply also to commutative rings. Sometimes the term ''noncommutative ring'' is used instead of ''ring'' to refer to a unspecified ring which is not necessarily commutative, and hence may be commutative. Generally, this is for emphasizing that the studied properties are not restricted to commutative rings, as, in many contexts, ''ring'' is used as a shortcut for ''commutative ring''. Although some authors do not assume that rings have a multiplicative identity, in this article we make that assumption unless stated otherwise. Examples Some examples of noncommutative rings: * The ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Free Object
In mathematics, the idea of a free object is one of the basic concepts of abstract algebra. Informally, a free object over a set ''A'' can be thought of as being a "generic" algebraic structure over ''A'': the only equations that hold between elements of the free object are those that follow from the defining axioms of the algebraic structure. Examples include free groups, tensor algebras, or free lattices. The concept is a part of universal algebra, in the sense that it relates to all types of algebraic structure (with finitary operations). It also has a formulation in terms of category theory, although this is in yet more abstract terms. Definition Free objects are the direct generalization to categories of the notion of basis in a vector space. A linear function between vector spaces is entirely determined by its values on a basis of the vector space The following definition translates this to any category. A concrete category is a category that is equipped with a faithf ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tensor Algebra
In mathematics, the tensor algebra of a vector space ''V'', denoted ''T''(''V'') or ''T''(''V''), is the algebra of tensors on ''V'' (of any rank) with multiplication being the tensor product. It is the free algebra on ''V'', in the sense of being left adjoint to the forgetful functor from algebras to vector spaces: it is the "most general" algebra containing ''V'', in the sense of the corresponding universal property (see below). The tensor algebra is important because many other algebras arise as quotient algebras of ''T''(''V''). These include the exterior algebra, the symmetric algebra, Clifford algebras, the Weyl algebra and universal enveloping algebras. The tensor algebra also has two coalgebra structures; one simple one, which does not make it a bialgebra, but does lead to the concept of a cofree coalgebra, and a more complicated one, which yields a bialgebra, and can be extended by giving an antipode to create a Hopf algebra structure. ''Note'': In this article, all a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cofree Coalgebra
In algebra, the cofree coalgebra of a vector space or module is a coalgebra analog of the free algebra of a vector space. The cofree coalgebra of any vector space over a field exists, though it is more complicated than one might expect by analogy with the free algebra. Definition If ''V'' is a vector space over a field F, then the cofree coalgebra ''C'' (''V''), of ''V'', is a coalgebra together with a linear map ''C'' (''V'') → ''V'', such that any linear map from a coalgebra ''X'' to ''V'' factors through a coalgebra homomorphism from ''X'' to ''C'' (''V''). In other words, the functor ''C'' is right adjoint to the forgetful functor from coalgebras to vector spaces. The cofree coalgebra of a vector space always exists, and is unique up to canonical isomorphism. Cofree cocommutative coalgebras are defined in a similar way, and can be constructed as the largest cocommutative coalgebra in the cofree coalgebra. Construction ''C'' (''V'') may be constructed a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Free Ideal Ring
In mathematics, especially in the field of ring theory, a (right) free ideal ring, or fir, is a ring in which all right ideals are free modules with unique rank. A ring such that all right ideals with at most ''n'' generators are free and have unique rank is called an n-fir. A semifir is a ring in which all finitely generated right ideals are free modules of unique rank. (Thus, a ring is semifir if it is ''n''-fir for all ''n'' ≥ 0.) The semifir property is left-right symmetric, but the fir property is not. Properties and examples It turns out that a left and right fir is a domain. Furthermore, a commutative fir is precisely a principal ideal domain, while a commutative semifir is precisely a Bézout domain. These last facts are not generally true for noncommutative rings, however . Every principal right ideal domain ''R'' is a right fir, since every nonzero principal right ideal of a domain is isomorphic to ''R''. In the same way, a right Bézout domain is a semifir. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Division Ring
In algebra, a division ring, also called a skew field, is a nontrivial ring in which division by nonzero elements is defined. Specifically, it is a nontrivial ring in which every nonzero element has a multiplicative inverse, that is, an element usually denoted , such that . So, (right) ''division'' may be defined as , but this notation is avoided, as one may have . A commutative division ring is a field. Wedderburn's little theorem asserts that all finite division rings are commutative and therefore finite fields. Historically, division rings were sometimes referred to as fields, while fields were called "commutative fields". In some languages, such as French, the word equivalent to "field" ("corps") is used for both commutative and noncommutative cases, and the distinction between the two cases is made by adding qualificatives such as "corps commutatif" (commutative field) or "corps gauche" (skew field). All division rings are simple. That is, they have no two-sided ideal besi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Of Sets
In the mathematical field of category theory, the category of sets, denoted as Set, is the category whose objects are sets. The arrows or morphisms between sets ''A'' and ''B'' are the total functions from ''A'' to ''B'', and the composition of morphisms is the composition of functions. Many other categories (such as the category of groups, with group homomorphisms as arrows) add structure to the objects of the category of sets and/or restrict the arrows to functions of a particular kind. Properties of the category of sets The axioms of a category are satisfied by Set because composition of functions is associative, and because every set ''X'' has an identity function id''X'' : ''X'' → ''X'' which serves as identity element for function composition. The epimorphisms in Set are the surjective maps, the monomorphisms are the injective maps, and the isomorphisms are the bijective maps. The empty set serves as the initial object in Set with empty functions as morphisms. Every s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Forgetful Functor
In mathematics, in the area of category theory, a forgetful functor (also known as a stripping functor) 'forgets' or drops some or all of the input's structure or properties 'before' mapping to the output. For an algebraic structure of a given signature, this may be expressed by curtailing the signature: the new signature is an edited form of the old one. If the signature is left as an empty list, the functor is simply to take the underlying set of a structure. Because many structures in mathematics consist of a set with an additional added structure, a forgetful functor that maps to the underlying set is the most common case. Overview As an example, there are several forgetful functors from the category of commutative rings. A ( unital) ring, described in the language of universal algebra, is an ordered tuple (R,+,\times,a,0,1) satisfying certain axioms, where + and \times are binary functions on the set R, a is a unary operation corresponding to additive inverse, and 0 and 1 are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Left Adjoint
In mathematics, specifically category theory, adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems (i.e., constructions of objects having a certain universal property), such as the construction of a free group on a set in algebra, or the construction of the Stone–Čech compactification of a topological space in topology. By definition, an adjunction between categories \mathcal and \mathcal is a pair of functors (assumed to be covariant) :F: \mathcal \rightarrow \mathcal and G: \mathcal \rightarrow \mathcal and, for all objects X in \mathcal and Y in \mathcal a bijection between the respective morphism s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Universal Property
In mathematics, more specifically in category theory, a universal property is a property that characterizes up to an isomorphism the result of some constructions. Thus, universal properties can be used for defining some objects independently from the method chosen for constructing them. For example, the definitions of the integers from the natural numbers, of the rational numbers from the integers, of the real numbers from the rational numbers, and of polynomial rings from the field of their coefficients can all be done in terms of universal properties. In particular, the concept of universal property allows a simple proof that all constructions of real numbers are equivalent: it suffices to prove that they satisfy the same universal property. Technically, a universal property is defined in terms of categories and functors by mean of a universal morphism (see , below). Universal morphisms can also be thought more abstractly as initial or terminal objects of a comma category ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
