HomomorphismIn algebra, a homomorphism is a structure-preserving map between two algebraic structures of the same type (such as two groups, two rings, or two vector spaces). The word homomorphism comes from the Ancient Greek language: ὁμός () meaning "same" and μορφή () meaning "form" or "shape". However, the word was apparently introduced to mathematics due to a (mis)translation of German ähnlich meaning "similar" to ὁμός meaning "same". The term "homomorphism" appeared as early as 1892, when it was attributed to the German mathematician Felix Klein (1849–1925).
Group homomorphismIn mathematics, given two groups, (G, ∗) and (H, ·), a group homomorphism from (G, ∗) to (H, ·) is a function h : G → H such that for all u and v in G it holds that where the group operation on the left side of the equation is that of G and on the right side that of H. From this property, one can deduce that h maps the identity element eG of G to the identity element eH of H, and it also maps inverses to inverses in the sense that Hence one can say that h "is compatible with the group structure".
Fundamental theorem on homomorphismsIn abstract algebra, the fundamental theorem on homomorphisms, also known as the fundamental homomorphism theorem, or the first isomorphism theorem, relates the structure of two objects between which a homomorphism is given, and of the kernel and of the homomorphism. The homomorphism theorem is used to prove the isomorphism theorems. Given two groups G and H and a group homomorphism f : G → H, let N be a normal subgroup in G and φ the natural surjective homomorphism G → G/N (where G/N is the quotient group of G by N).
Kernel (algebra)In algebra, the kernel of a homomorphism (function that preserves the structure) is generally the of 0 (except for groups whose operation is denoted multiplicatively, where the kernel is the inverse image of 1). An important special case is the kernel of a linear map. The kernel of a matrix, also called the null space, is the kernel of the linear map defined by the matrix. The kernel of a homomorphism is reduced to 0 (or 1) if and only if the homomorphism is injective, that is if the inverse image of every element consists of a single element.
Module homomorphismIn algebra, a module homomorphism is a function between modules that preserves the module structures. Explicitly, if M and N are left modules over a ring R, then a function is called an R-module homomorphism or an R-linear map if for any x, y in M and r in R, In other words, f is a group homomorphism (for the underlying additive groups) that commutes with scalar multiplication. If M, N are right R-modules, then the second condition is replaced with The of the zero element under f is called the kernel of f.
Ring homomorphismIn ring theory, a branch of abstract algebra, a ring homomorphism is a structure-preserving function between two rings. More explicitly, if R and S are rings, then a ring homomorphism is a function f : R → S such that f is: addition preserving: for all a and b in R, multiplication preserving: for all a and b in R, and unit (multiplicative identity) preserving: Additive inverses and the additive identity are part of the structure too, but it is not necessary to require explicitly that they too are respected, because these conditions are consequences of the three conditions above.
Presentation of a groupIn mathematics, a presentation is one method of specifying a group. A presentation of a group G comprises a set S of generators—so that every element of the group can be written as a product of powers of some of these generators—and a set R of relations among those generators. We then say G has presentation Informally, G has the above presentation if it is the "freest group" generated by S subject only to the relations R. Formally, the group G is said to have the above presentation if it is isomorphic to the quotient of a free group on S by the normal subgroup generated by the relations R.
Finite groupIn 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.
IsomorphismIn 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).
Abelian groupIn mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is commutative. With addition as an operation, the integers and the real numbers form abelian groups, and the concept of an abelian group may be viewed as a generalization of these examples. Abelian groups are named after early 19th century mathematician Niels Henrik Abel.
Finitely generated abelian groupIn abstract algebra, an abelian group is called finitely generated if there exist finitely many elements in such that every in can be written in the form for some integers . In this case, we say that the set is a generating set of or that generate . Every finite abelian group is finitely generated. The finitely generated abelian groups can be completely classified. The integers, , are a finitely generated abelian group. The integers modulo , , are a finite (hence finitely generated) abelian group.
Group theoryIn abstract algebra, group theory studies the algebraic structures known as groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as rings, fields, and vector spaces, can all be seen as groups endowed with additional operations and axioms. Groups recur throughout mathematics, and the methods of group theory have influenced many parts of algebra. Linear algebraic groups and Lie groups are two branches of group theory that have experienced advances and have become subject areas in their own right.
Euler's totient functionIn number theory, Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. It is written using the Greek letter phi as or , and may also be called Euler's phi function. In other words, it is the number of integers k in the range 1 ≤ k ≤ n for which the greatest common divisor gcd(n, k) is equal to 1. The integers k of this form are sometimes referred to as totatives of n. For example, the totatives of n = 9 are the six numbers 1, 2, 4, 5, 7 and 8.
Isomorphism theoremsIn mathematics, specifically abstract algebra, the isomorphism theorems (also known as Noether's isomorphism theorems) are theorems that describe the relationship between quotients, homomorphisms, and subobjects. Versions of the theorems exist for groups, rings, vector spaces, modules, Lie algebras, and various other algebraic structures. In universal algebra, the isomorphism theorems can be generalized to the context of algebras and congruences.
Kernel (category theory)In and its applications to other branches of mathematics, kernels are a generalization of the kernels of group homomorphisms, the kernels of module homomorphisms and certain other kernels from algebra. Intuitively, the kernel of the morphism f : X → Y is the "most general" morphism k : K → X that yields zero when composed with (followed by) f. Note that kernel pairs and difference kernels (also known as binary equalisers) sometimes go by the name "kernel"; while related, these aren't quite the same thing and are not discussed in this article.
Torsion-free abelian groupIn mathematics, specifically in abstract algebra, a torsion-free abelian group is an abelian group which has no non-trivial torsion elements; that is, a group in which the group operation is commutative and the identity element is the only element with finite order. While finitely generated abelian groups are completely classified, not much is known about infinitely generated abelian groups, even in the torsion-free countable case. Abelian group An abelian group is said to be torsion-free if no element other than the identity is of finite order.
Elementary abelian groupIn mathematics, specifically in group theory, an elementary abelian group is an abelian group in which all elements other than the identity have the same order. This common order must be a prime number, and the elementary abelian groups in which the common order is p are a particular kind of p-group. A group for which p = 2 (that is, an elementary abelian 2-group) is sometimes called a Boolean group. Every elementary abelian p-group is a vector space over the prime field with p elements, and conversely every such vector space is an elementary abelian group.
Cyclic groupIn group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted Cn, that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element g such that every other element of the group may be obtained by repeatedly applying the group operation to g or its inverse. Each element can be written as an integer power of g in multiplicative notation, or as an integer multiple of g in additive notation.
Finitely generated groupIn algebra, a finitely generated group is a group G that has some finite generating set S so that every element of G can be written as the combination (under the group operation) of finitely many elements of S and of inverses of such elements. By definition, every finite group is finitely generated, since S can be taken to be G itself. Every infinite finitely generated group must be countable but countable groups need not be finitely generated. The additive group of rational numbers Q is an example of a countable group that is not finitely generated.
Jordan's totient functionLet be a positive integer. In number theory, the Jordan's totient function of a positive integer equals the number of -tuples of positive integers that are less than or equal to and that together with form a coprime set of integers. Jordan's totient function is a generalization of Euler's totient function, which is given by . The function is named after Camille Jordan. For each , Jordan's totient function is multiplicative and may be evaluated as where ranges through the prime divisors of .
