Algebraic structureIn mathematics, an algebraic structure consists of a nonempty set A (called the underlying set, carrier set or domain), a collection of operations on A (typically binary operations such as addition and multiplication), and a finite set of identities, known as axioms, that these operations must satisfy. An algebraic structure may be based on other algebraic structures with operations and axioms involving several structures.
Group cohomologyIn mathematics (more specifically, in homological algebra), group cohomology is a set of mathematical tools used to study groups using cohomology theory, a technique from algebraic topology. Analogous to group representations, group cohomology looks at the group actions of a group G in an associated G-module M to elucidate the properties of the group. By treating the G-module as a kind of topological space with elements of representing n-simplices, topological properties of the space may be computed, such as the set of cohomology groups .
Product of ringsIn mathematics, a product of rings or direct product of rings is a ring that is formed by the Cartesian product of the underlying sets of several rings (possibly an infinity), equipped with componentwise operations. It is a direct product in the . Since direct products are defined up to an isomorphism, one says colloquially that a ring is the product of some rings if it is isomorphic to the direct product of these rings.
Cartan matrixIn mathematics, the term Cartan matrix has three meanings. All of these are named after the French mathematician Élie Cartan. Amusingly, the Cartan matrices in the context of Lie algebras were first investigated by Wilhelm Killing, whereas the Killing form is due to Cartan. A (symmetrizable) generalized Cartan matrix is a square matrix with integral entries such that For diagonal entries, . For non-diagonal entries, . if and only if can be written as , where is a diagonal matrix, and is a symmetric matrix.
Lattice of subgroupsIn mathematics, the lattice of subgroups of a group is the lattice whose elements are the subgroups of , with the partial order relation being set inclusion. In this lattice, the join of two subgroups is the subgroup generated by their union, and the meet of two subgroups is their intersection. The dihedral group Dih4 has ten subgroups, counting itself and the trivial subgroup. Five of the eight group elements generate subgroups of order two, and the other two non-identity elements both generate the same cyclic subgroup of order four.
Exact functorIn mathematics, particularly homological algebra, an exact functor is a functor that preserves short exact sequences. Exact functors are convenient for algebraic calculations because they can be directly applied to presentations of objects. Much of the work in homological algebra is designed to cope with functors that fail to be exact, but in ways that can still be controlled. Let P and Q be abelian categories, and let F: P→Q be a covariant additive functor (so that, in particular, F(0) = 0).
Permutation groupIn mathematics, a permutation group is a group G whose elements are permutations of a given set M and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself). The group of all permutations of a set M is the symmetric group of M, often written as Sym(M). The term permutation group thus means a subgroup of the symmetric group. If M = {1, 2, ..., n} then Sym(M) is usually denoted by Sn, and may be called the symmetric group on n letters.
Burnside ringIn mathematics, the Burnside ring of a finite group is an algebraic construction that encodes the different ways the group can act on finite sets. The ideas were introduced by William Burnside at the end of the nineteenth century. The algebraic ring structure is a more recent development, due to Solomon (1967). Given a finite group G, the generators of its Burnside ring Ω(G) are the formal sums of isomorphism classes of finite G-sets. For the ring structure, addition is given by disjoint union of G-sets and multiplication by their Cartesian product.
Cartan's criterionIn mathematics, Cartan's criterion gives conditions for a Lie algebra in characteristic 0 to be solvable, which implies a related criterion for the Lie algebra to be semisimple. It is based on the notion of the Killing form, a symmetric bilinear form on defined by the formula where tr denotes the trace of a linear operator. The criterion was introduced by .
Ramification groupIn number theory, more specifically in local class field theory, the ramification groups are a filtration of the Galois group of a local field extension, which gives detailed information on the ramification phenomena of the extension. In mathematics, the ramification theory of valuations studies the set of extensions of a valuation v of a field K to an extension L of K. It is a generalization of the ramification theory of Dedekind domains. The structure of the set of extensions is known better when L/K is Galois.
