|
Separable Algebra
In mathematics, a separable algebra is a kind of semisimple algebra. It is a generalization to associative algebras of the notion of a separable field extension. Definition and first properties A homomorphism of (unital, but not necessarily commutative) rings : K \to A is called ''separable'' if the multiplication map : \begin \mu :& A \otimes_K A &\to& A \\ & a \otimes b &\mapsto & ab \end admits a section : \sigma: A \to A \otimes_K A that is a homomorphism of ''A''-''A''-bimodules. If the ring K is commutative and K \to A maps K into the center of A, we call A a ''separable algebra over'' K. It is useful to describe separability in terms of the element : p := \sigma(1) = \sum a_i \otimes b_i \in A \otimes_K A The reason is that a section ''σ'' is determined by this element. The condition that ''σ'' is a section of ''μ'' is equivalent to : \sum a_i b_i = 1 and the condition that σ is a homomorphism of ''A''-''A''-bimodules ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
étale Algebra
In commutative algebra, an étale algebra over a field is a special type of algebra, one that is isomorphic to a finite product of finite separable field extensions. An étale algebra is a special sort of commutative separable algebra. Definitions Let be a field. Let be a commutative unital associative -algebra. Then is called an ''étale -algebra'' if any one of the following equivalent conditions holds: Examples The \mathbb-algebra \mathbb(i) is étale because it is a finite separable field extension. The \mathbb-algebra \mathbb (x^2) of dual numbers is not étale, since \mathbb (x^2)\otimes_\mathbb\mathbb \simeq \mathbb (x^2). Properties Let denote the absolute Galois group of . Then the category of étale -algebras is equivalent to the category of finite -sets with continuous -action. In particular, étale algebras of dimension are classified by conjugacy classes of continuous group homomorphisms from to the symmetric group . These globalize to e.g. the def ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Primitive Element (field Theory)
In field theory (mathematics), field theory, a simple extension is a field extension that is generated by the adjunction (field theory), adjunction of a single element, called a ''primitive element''. Simple extensions are well understood and can be completely classified. The primitive element theorem provides a characterization of the finite extension, finite simple extensions. Definition A field extension is called a simple extension if there exists an element in ''L'' with :L = K(\theta). This means that every element of can be expressed as a rational fraction in , with coefficients in ; that is, it is produced from and elements of by the field operations +, −, •, / . Equivalently, is the smallest field that contains both ' and . There are two different kinds of simple extensions (see below): # The element may be transcendental element, transcendental over , which means that it is not a zero of a function, root of any polynomial with coefficients in . In this case ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Ring
In algebra, a group ring is a free module and at the same time a ring, constructed in a natural way from any given ring and any given group. As a free module, its ring of scalars is the given ring, and its basis is the set of elements of the given group. As a ring, its addition law is that of the free module and its multiplication extends "by linearity" the given group law on the basis. Less formally, a group ring is a generalization of a given group, by attaching to each element of the group a "weighting factor" from a given ring. If the ring is commutative then the group ring is also referred to as a group algebra, for it is indeed an algebra over the given ring. A group algebra over a field has a further structure of a Hopf algebra; in this case, it is thus called a group Hopf algebra. The apparatus of group rings is especially useful in the theory of group representations. Definition Let G be a group, written multiplicatively, and let R be a ring. The group ring of G ove ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Order (group Theory)
In mathematics, the order of a finite group is the number of its elements. If a group is not finite, one says that its order is ''infinite''. The ''order'' of an element of a group (also called period length or period) is the order of the subgroup generated by the element. If the group operation is denoted as a multiplication, the order of an element of a group, is thus the smallest positive integer such that , where denotes the identity element of the group, and denotes the product of copies of . If no such exists, the order of is infinite. The order of a group is denoted by or , and the order of an element is denoted by or , instead of \operatorname(\langle a\rangle), where the brackets denote the generated group. Lagrange's theorem states that for any subgroup of a finite group , the order of the subgroup divides the order of the group; that is, is a divisor of . In particular, the order of any element is a divisor of . Example The symmetric group S3 ha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Group
In abstract algebra, a finite group is a group whose underlying set is finite. Finite groups often arise when considering symmetry of mathematical or physical objects, when those objects admit just a finite number of structure-preserving transformations. Important examples of finite groups include cyclic groups and permutation groups. The study of finite groups has been an integral part of group theory since it arose in the 19th century. One major area of study has been classification: the classification of finite simple groups (those with no nontrivial normal subgroup) was completed in 2004. History During the twentieth century, mathematicians investigated some aspects of the theory of finite groups in great depth, especially the local theory of finite groups and the theory of solvable and nilpotent groups. As a consequence, the complete classification of finite simple groups was achieved, meaning that all those simple groups from which all finite groups can be bu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraically Closed Field
In mathematics, a field is algebraically closed if every non-constant polynomial in (the univariate polynomial ring with coefficients in ) has a root in . In other words, a field is algebraically closed if the fundamental theorem of algebra holds for it. Every field K is contained in an algebraically closed field C, and the roots in C of the polynomials with coefficients in K form an algebraically closed field called an algebraic closure of K. Given two algebraic closures of K there are isomorphisms between them that fix the elements of K. Algebraically closed fields appear in the following chain of class inclusions: Examples As an example, the field of real numbers is not algebraically closed, because the polynomial equation x^2+1=0 has no solution in real numbers, even though all its coefficients (1 and 0) are real. The same argument proves that no subfield of the real field is algebraically closed; in particular, the field of rational numbers is not algebraically cl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Field
In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field (mathematics), field that contains a finite number of Element (mathematics), elements. As with any field, a finite field is a Set (mathematics), set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are the integers mod n, integers mod p when p is a prime number. The ''order'' of a finite field is its number of elements, which is either a prime number or a prime power. For every prime number p and every positive integer k there are fields of order p^k. All finite fields of a given order are isomorphism, isomorphic. Finite fields are fundamental in a number of areas of mathematics and computer science, including number theory, algebraic geometry, Galois theory, finite geometry, cryptography and coding theory. Properties A finite field is a finite set that is a fiel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Characteristic (algebra)
In mathematics, the characteristic of a ring , often denoted , is defined to be the smallest positive number of copies of the ring's multiplicative identity () that will sum to the additive identity (). If no such number exists, the ring is said to have characteristic zero. That is, is the smallest positive number such that: : \underbrace_ = 0 if such a number exists, and otherwise. Motivation The special definition of the characteristic zero is motivated by the equivalent definitions characterized in the next section, where the characteristic zero is not required to be considered separately. The characteristic may also be taken to be the exponent of the ring's additive group, that is, the smallest positive integer such that: : \underbrace_ = 0 for every element of the ring (again, if exists; otherwise zero). This definition applies in the more general class of rngs (see '); for (unital) rings the two definitions are equivalent due to their distributive law. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Perfect Field
In algebra, a field ''k'' is perfect if any one of the following equivalent conditions holds: * Every irreducible polynomial over ''k'' has no multiple roots in any field extension ''F/k''. * Every irreducible polynomial over ''k'' has non-zero formal derivative. * Every irreducible polynomial over ''k'' is separable. * Every finite extension of ''k'' is separable. * Every algebraic extension of ''k'' is separable. * Either ''k'' has characteristic 0, or, when ''k'' has characteristic , every element of ''k'' is a ''p''th power. * Either ''k'' has characteristic 0, or, when ''k'' has characteristic , the Frobenius endomorphism is an automorphism of ''k''. * The separable closure of ''k'' is algebraically closed. * Every reduced commutative ''k''-algebra ''A'' is a separable algebra; i.e., A \otimes_k F is reduced for every field extension ''F''/''k''. (see below) Otherwise, ''k'' is called imperfect. In particular, all fields of characteristic zero and all finite fields ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Division Algebra
In the field of mathematics called abstract algebra, a division algebra is, roughly speaking, an algebra over a field in which division, except by zero, is always possible. Definitions Formally, we start with a non-zero algebra ''D'' over a field. We call ''D'' a division algebra if for any element ''a'' in ''D'' and any non-zero element ''b'' in ''D'' there exists precisely one element ''x'' in ''D'' with ''a'' = ''bx'' and precisely one element ''y'' in ''D'' such that . For associative algebras, the definition can be simplified as follows: a non-zero associative algebra over a field is a division algebra if and only if it has a multiplicative identity element 1 and every non-zero element ''a'' has a multiplicative inverse (i.e. an element ''x'' with ). Associative division algebras The best-known examples of associative division algebras are the finite-dimensional real ones (that is, algebras over the field R of real numbers, which are finite- dimensional as a vector space ... [...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] |
Matrix Algebra
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] |
