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).
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).
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".
Future historyA future history is a postulated history of the future and is used by authors of science fiction and other speculative fiction to construct a common background for fiction. Sometimes the author publishes a timeline of events in the history, while other times the reader can reconstruct the order of the stories from information provided therein. The term appears to have been coined by John W. Campbell, Jr., the editor of Astounding Science Fiction, in the February 1941 issue of that magazine, in reference to Robert A.
MorphismIn mathematics, particularly in , a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms are functions; in linear algebra, linear transformations; in group theory, group homomorphisms; in analysis and topology, continuous functions, and so on.
Flat morphismIn mathematics, in particular in the theory of schemes in algebraic geometry, a flat morphism f from a scheme X to a scheme Y is a morphism such that the induced map on every stalk is a flat map of rings, i.e., is a flat map for all P in X. A map of rings is called flat if it is a homomorphism that makes B a flat A-module. A morphism of schemes is called faithfully flat if it is both surjective and flat. Two basic intuitions regarding flat morphisms are: flatness is a generic property; and the failure of flatness occurs on the jumping set of the morphism.
FutureThe future is the time after the past and present. Its arrival is considered inevitable due to the existence of time and the laws of physics. Due to the apparent nature of reality and the unavoidability of the future, everything that currently exists and will exist can be categorized as either permanent, meaning that it will exist forever, or temporary, meaning that it will end. In the Occidental view, which uses a linear conception of time, the future is the portion of the projected timeline that is anticipated to occur.
Group isomorphismIn abstract algebra, a group isomorphism is a function between two groups that sets up a one-to-one correspondence between the elements of the groups in a way that respects the given group operations. If there exists an isomorphism between two groups, then the groups are called isomorphic. From the standpoint of group theory, isomorphic groups have the same properties and need not be distinguished.
Étale morphismIn algebraic geometry, an étale morphism (etal) is a morphism of schemes that is formally étale and locally of finite presentation. This is an algebraic analogue of the notion of a local isomorphism in the complex analytic topology. They satisfy the hypotheses of the implicit function theorem, but because open sets in the Zariski topology are so large, they are not necessarily local isomorphisms. Despite this, étale maps retain many of the properties of local analytic isomorphisms, and are useful in defining the algebraic fundamental group and the étale topology.
EndomorphismIn mathematics, an endomorphism is a morphism from a mathematical object to itself. An endomorphism that is also an isomorphism is an automorphism. For example, an endomorphism of a vector space V is a linear map f: V → V, and an endomorphism of a group G is a group homomorphism f: G → G. In general, we can talk about endomorphisms in any . In the , endomorphisms are functions from a set S to itself. In any category, the composition of any two endomorphisms of X is again an endomorphism of X.
Endomorphism ringIn mathematics, the endomorphisms of an abelian group X form a ring. This ring is called the endomorphism ring of X, denoted by End(X); the set of all homomorphisms of X into itself. Addition of endomorphisms arises naturally in a pointwise manner and multiplication via endomorphism composition. Using these operations, the set of endomorphisms of an abelian group forms a (unital) ring, with the zero map as additive identity and the identity map as multiplicative identity.
Zero morphismIn , a branch of mathematics, a zero morphism is a special kind of morphism exhibiting properties like the morphisms to and from a zero object. Suppose C is a , and f : X → Y is a morphism in C. The morphism f is called a constant morphism (or sometimes left zero morphism) if for any W in C and any g, h : W → X, fg = fh. Dually, f is called a coconstant morphism (or sometimes right zero morphism) if for any object Z in C and any g, h : Y → Z, gf = hf. A zero morphism is one that is both a constant morphism and a coconstant morphism.
Automorphism groupIn mathematics, the automorphism group of an object X is the group consisting of automorphisms of X under composition of morphisms. For example, if X is a finite-dimensional vector space, then the automorphism group of X is the group of invertible linear transformations from X to itself (the general linear group of X). If instead X is a group, then its automorphism group is the group consisting of all group automorphisms of X. Especially in geometric contexts, an automorphism group is also called a symmetry group.
AutomorphismIn mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphisms of an object forms a group, called the automorphism group. It is, loosely speaking, the symmetry group of the object. In the context of abstract algebra, a mathematical object is an algebraic structure such as a group, ring, or vector space.
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.
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.
Inner automorphismIn abstract algebra an inner automorphism is an automorphism of a group, ring, or algebra given by the conjugation action of a fixed element, called the conjugating element. They can be realized via simple operations from within the group itself, hence the adjective "inner". These inner automorphisms form a subgroup of the automorphism group, and the quotient of the automorphism group by this subgroup is defined as the outer automorphism group.
Examples of groupsSome elementary examples of groups in mathematics are given on Group (mathematics). Further examples are listed here. Dihedral group of order 6 Consider three colored blocks (red, green, and blue), initially placed in the order RGB. Let a be the operation "swap the first block and the second block", and b be the operation "swap the second block and the third block". We can write xy for the operation "first do y, then do x"; so that ab is the operation RGB → RBG → BRG, which could be described as "move the first two blocks one position to the right and put the third block into the first position".
Frobenius endomorphismIn commutative algebra and field theory, the Frobenius endomorphism (after Ferdinand Georg Frobenius) is a special endomorphism of commutative rings with prime characteristic p, an important class which includes finite fields. The endomorphism maps every element to its p-th power. In certain contexts it is an automorphism, but this is not true in general. Let R be a commutative ring with prime characteristic p (an integral domain of positive characteristic always has prime characteristic, for example).
Equivalence relationIn mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. Each equivalence relation provides a partition of the underlying set into disjoint equivalence classes. Two elements of the given set are equivalent to each other if and only if they belong to the same equivalence class.
