Concept

Additive map

In algebra, an additive map, -linear map or additive function is a function that preserves the addition operation: for every pair of elements and in the domain of For example, any linear map is additive. When the domain is the real numbers, this is Cauchy's functional equation. For a specific case of this definition, see additive polynomial. More formally, an additive map is a -module homomorphism. Since an abelian group is a -module, it may be defined as a group homomorphism between abelian groups. A map that is additive in each of two arguments separately is called a bi-additive map or a -bilinear map. Typical examples include maps between rings, vector spaces, or modules that preserve the additive group. An additive map does not necessarily preserve any other structure of the object; for example, the product operation of a ring. If and are additive maps, then the map (defined pointwise) is additive. Definition of scalar multiplication by an integer Suppose that is an additive group with identity element and that the inverse of is denoted by For any and integer let: Thus and it can be shown that for all integers and all and This definition of scalar multiplication makes the cyclic subgroup of into a left -module; if is commutative, then it also makes into a left -module. Homogeneity over the integers If is an additive map between additive groups then and for all (where negation denotes the additive inverse) and Consequently, for all (where by definition, ). In other words, every additive map is homogeneous over the integers. Consequently, every additive map between abelian groups is a homomorphism of -modules. Homomorphism of -modules If the additive abelian groups and are also a unital modules over the rationals (such as real or complex vector spaces) then an additive map satisfies: In other words, every additive map is homogeneous over the rational numbers. Consequently, every additive maps between unital -modules is a homomorphism of -modules.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.