Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Annihilator (ring theory)
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Category-theoretic description for commutative rings== When ''R'' is commutative and ''M'' is an ''R''-module, we may describe Ann<sub>''R''</sub>(''M'') as the [[Kernel (algebra)|kernel]] of the action map {{nowrap|''R'' β End<sub>''R''</sub>(''M'')}} determined by the [[Adjunction (category theory)|adjunct map]] of the [[identity map|identity]] {{nowrap|''M'' β ''M''}} along the [[Hom-tensor adjunction]]. More generally, given a [[bilinear map]] of modules <math>F\colon M \times N \to P</math>, the annihilator of a subset <math>S \subseteq M</math> is the set of all elements in <math>N</math> that annihilate <math>S</math>: :<math>\operatorname{Ann}(S) := \{ n \in N \mid \forall s \in S: F(s,n) = 0 \} .</math> Conversely, given <math>T \subseteq N</math>, one can define an annihilator as a subset of <math>M</math>. The annihilator gives a [[Galois connection]] between subsets of <math>M</math> and <math>N</math>, and the associated [[closure operator]] is stronger than the span. In particular: * annihilators are submodules * <math>\operatorname{Span}S \leq \operatorname{Ann}(\operatorname{Ann}(S))</math> * <math>\operatorname{Ann}(\operatorname{Ann}(\operatorname{Ann}(S))) = \operatorname{Ann}(S)</math> An important special case is in the presence of a [[nondegenerate form]] on a [[vector space]], particularly an [[inner product]]: then the annihilator associated to the map <math>V \times V \to K</math> is called the [[orthogonal complement]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)