Section 4.1 Basic Definitions
Listed in alphabetical order.
Definition 4.1.1.
Two elements
\(a,b\) in a ring (with identity)
\(R\) are called
associates if
\(a = ubv\) for some
units \(u,v\) in
\(R\text{.}\) In a commutative ring, we can simply write
\(a=bv.\)
Definition 4.1.2.
Let \(R\) be a commutative ring with identity. Then two ideals \(I,J\) of \(R\) are said to be comaximal iff \(I+J = R.\)
Definition 4.1.3.
Let \(X\) be a non-empty set. A relation on \(X\) is a subset \(R\subseteq X\times X\text{,}\) that is a collection of ordered pairs. Often instead of saying \((x,y)\in R\text{,}\) write \(x \sim y\) and say \(x\) is related to \(y.\)
An equivalence relation on \(X\) is a relation which satisfies three properties:
\(x\sim x\) (i.e., \((x,x) \in R\)) for all \(x\in X\text{.}\) This is called the reflexive property of the relation.
If \(x\sim y,\) then \(y \sim x\text{,}\) that is, whenever the ordered pair \((x,y) \in R\text{,}\) then also \((y,x) \in R.\) This is called the symmetric property of the relation.
If \(x \sim y\) and \(y \sim z\text{,}\) then \(x\sim z\text{,}\) that is, if \((x,y), (y,z) \in R\text{,}\) then so it \((x,z).\) This is called the transitive property of the relation.
Definition 4.1.4.
An integral domain \(R\) is a Euclidean domain if it is equipped with a function (norm) \(d:R\setminus\{0\} \to \Z_{\ge
0}\) so that given two elements \(a,b \in R\) with \(b
\ne0\text{,}\) there exist \(q,r \in R\) with \(a=bq+r\text{,}\) and either \(r=0\) or \(d(r) \lt d(b).\)
Definition 4.1.5.
Let \(G\) be a group, and \(x\in G\text{.}\) Any positive integer \(n\) for which \(x^n = e\) is called an exponent for the element; the smallest exponent is called its order. The order may be infinite.
If there is a positive integer \(n\) so that \(x^n =
e\) for every \(x \in G\text{,}\) then \(n\) is called an exponent for the group.
Definition 4.1.6.
A group is a nonempty set \(G\) with a binary operation \(*\) satisfying the properties:
\(G\) is closed under the operation, that is for \(a, b \in G\) we have \(a*b \in
G\text{.}\)
\(*\) is an associative operation.
There exists an identity element, that is there exists an element \(e\in G\text{,}\) so that \(e*g = g*e = g\) for all \(g\in G.\)
Every element has an inverse, that is, for every \(g\in G,\) there exists an \(h \in G\) with \(g*h = h*g = e\text{.}\) One shows that the inverse of an element is unique, so we denote the inverse of \(g\) by \(g^{-1}.\)
Definition 4.1.7.
Let \(R\) be an integral domain, and \(a,b \in R\text{,}\) not both zero. A greatest common divisor of \(a,b\) is an element \(d\in R\) satisfying
\(d\mid a\) and \(d\mid b\) (i.e., \(d\) is a common divisor)
If \(d'\mid a\) and \(d'\mid b\text{,}\) then \(d'\mid
d\text{,}\) meaning any other common divisor divides \(d\text{,}\) making \(d\) the greatest in terms of divisibility.
Definition 4.1.8.
Let
\(R\) be a
ring. A subset
\(I\subseteq R\) is called an
ideal if
\(I\) is an additive subgroup of
\(R\text{,}\) with the property that
\(R\cdot I
\subseteq I\) and
\(I\cdot R\subset I.\) This is also called a
two-sided ideal. There are also left and right ideals in which only one condition holds. Of course in a commutative ring, all ideals are two-sided.
Recall that the property of being a (two-sided) ideal is precisely the condition required to make the quotient \(R/I\) a ring with well-defined operations on the cosets.
Definition 4.1.9.
Let \(R\) be a ring. An element \(s\in R\) is an idempotent if \(s^2 = s.\)
Definition 4.1.10.
A function \(f:X\to Y\) between sets \(X\) and \(Y\) is injective if for every \(x, x' \in
X\text{,}\) \(f(x) = f(x')\) implies \(x=x'\text{.}\)
Definition 4.1.11.
Let \(F\) denote the field of real or complex numbers. For \(z = a + bi \in \C\) (\(a,b \in \R\) and \(i^2 =
-1\)), we have the notion of the complex conjugate of \(z\text{,}\) denoted \(\overline z =
a-bi.\) Note that when \(z\in \R\text{,}\) that is \(z = a = a
+ 0i \in \C\text{,}\) we have \(z = \overline z.\) The magnitude (norm, \(absolute
value\)) of \(z=a+bi\) is \(|z| = \sqrt{a^2 + b^2}.\)
Let \(V\) be a vector space over the field \(F.\) An inner product is a function:
\begin{equation*}
\la \cdot, \cdot \ra : V\times V \to F
\end{equation*}
so that for all \(u,v,w \in V\) and \(\lambda \in F:\)
\(\displaystyle \la u+v,w\ra = \la u,w\ra + \la v,w\ra\)
\(\displaystyle \la \lambda v,w\ra = \lambda\la v,w\ra\)
\(\overline{\la v,w\ra} = \la w,v\ra\text{,}\) where the bar denotes complex conjugate.
\(\la v,v\ra\) is a positive real number for all \(v\ne 0.\)
Definition 4.1.12.
An
inner product space is a vector space
\(V\) defined over a field
\(F = \R\) or
\(\C\) to which is associated an
inner product. If
\(F=\R\text{,}\) \(V\) is called a
real inner product space, and if
\(F=\C\text{,}\) then
\(V\) is called a
complex inner product space.
Definition 4.1.13.
Let \(R\) be a commutative ring with identity. An element \(\pi \in R\) is said to be irreducible if \(\pi \ne 0\text{,}\) \(\pi \not\in
R^\times\text{,}\) and whenever we write \(\pi = ab\text{,}\) either \(a\) or \(b\) is a unit in \(R.\)
Definition 4.1.14.
The Kronecker delta is defined by
\begin{equation*}
\delta_{ij} =
\begin{cases}
1\amp \text{if }i=j\\
0\amp \text{otherwise.}
\end{cases}
\end{equation*}
Definition 4.1.15.
Let \(R\) be a commutative ring with identity, and \(M\) an ideal of \(R.\) Then \(M\) is a maximal ideal iff
Definition 4.1.16.
Let \(G\) be a group and \(H\) a subgroup of \(G.\) The following conditions are equivalent and define what it means for \(H\) normal subgroup of \(G\text{.}\)
\(gHg^{-1} = H\) for all \(g \in G\)
\(gH =Hg\) for all \(g \in G\)
\(gHg^{-1} \subseteq H\) for all \(g \in G\)
Definition 4.1.17.
Let \(G\) be a group and \(H\) a subgroup of \(G.\) The normalizer of \(H\) in \(G\) is
\begin{equation*}
N_G(H) = \{g\in G\mid gHg^{-1} = H\}\text{.}
\end{equation*}
In particular,
\(K\) is a
normal subgroup of
\(G\) iff
\(N_G(K)
= G.\)
Definition 4.1.18.
Let \(X\) be a non-empty set. A partition of \(X\) is a collection \(P=\{X_i\mid i \in I\}\) of nonempty subsets so that
Definition 4.1.19.
Let \(R\) be a commutative ring with identity. An element \(\pi \in R\) is said to be prime if \(\pi \ne 0\text{,}\) \(\pi \not\in R^\times\text{,}\) and given \(a,b \in R\) with \(\pi \mid ab\text{,}\) then \(\pi \mid
a\) or \(\pi \mid b.\)
Definition 4.1.20.
Let \(R\) be a commutative ring with identity, and \(P\) an ideal of \(R.\) Then \(P\) is a prime ideal iff
We remark that in a noncommutative ring, a different definition is required: \(P\) is a prime ideal iff \(P\) is proper and for any ideals \(I,J \subset R\text{,}\) \(IJ \subseteq P\) implies \(I \subseteq P\) or \(J \subseteq P.\) If the ring is commutative, this definition is equivalent to the previous one.
Definition 4.1.21.
Let \(R\) be a UFD, and \(p(x) = a_0 + a_1x+ \cdots + a_n
x^n \in R[x].\) We say that \(p\) is a primitive polynomial if \(\gcd(a_1, \dots, a_n)
=1,\) that is there is no common divisor of all the coefficients except for units. It is immediate that for any \(p \in R[x]\) that \(p = c(p) p_0\) where \(p_0\) is primitive and \(c(p) \in R\) which is usually referred to as the content of \(p\text{.}\)
Definition 4.1.22.
A ring is a nonempty set \(R\) with two binary operations, \(+\text{,}\)\(\times\) so that
\((R,+)\) is an abelian group
\(\times\) is an associative operation
\(\displaystyle (a+b)\times c = (a\times c) + (b\times c)\)
\(\displaystyle a\times (b+c) = (a\times b) + (a\times c)\)
It is a commutative ring if \(\times\) is commutative. The ring \(R\) has an identity if there is an element \(1\in R\) so that \(1\times r =
r\times 1 = r\) for all \(r\in R.\) Generally, we write \(rs\) instead of \(r\times s.\)
For an element \(r \in R,\) \(-r\) is its additive inverse, and \(r^{-1}\) is its multiplicative inverse (if it exists). We denote by \(R^\times\) the unit group of a ring \(R\) with identity.
Definition 4.1.23.
A nonempty subset \(H\) of a group \(G\) is a subgroup of \(G\) if it is closed under products and inverses. More succinctly, it is a subgroup if for every \(x,y \in H\text{,}\) \(xy^{-1} \in H.\) It is usually denoted \(H\le G\) or \(H \lt G\) for a proper subgroup.
Definition 4.1.24.
A function \(f:X\to Y\) between sets \(X\) and \(Y\) is surjective if for every \(y\in
Y\text{,}\) there exists an \(x \in X\) such that \(f(x)=y\text{.}\)
Definition 4.1.25.
Let \(R\) be a ring with 1. An element \(u \in R\) is a unit if there exists an inverse in \(R,\) that is there exists an element \(v\in R,\) with
\begin{equation*}
uv = vu = 1.
\end{equation*}
Definition 4.1.26.
A vector space is a non-empty set \(V\) and an associated field of scalars \(F\text{,}\) having operations of vector addition, denoted \(+\text{,}\) and scalar multiplication, denoted by juxtaposition, satisfying the following properties: For all vectors \(u, v, w \in V\text{,}\) and scalars \(\lambda, \mu \in F\)
closure under vector addition
\(\displaystyle u+v \in V\)
addition is commutative
\(\displaystyle u+v = v+u \)
addition is associative
\(\displaystyle (u+v)+w = u+(v+w) \)
additive identity
There is a vector \(\mathbf 0\in V\) so that \(\mathbf 0 + u = u.\)
additive inverses
For each \(u\in V\text{,}\) there is a vector denoted \(-u\in V\) so that \(u+ -u = \mathbf 0.\)
closure under scalar multiplication
\(\displaystyle \lambda u \in V. \)
scalar multiplication distributes across vector addition
\(\displaystyle \lambda(u+v) = \lambda u+\lambda v \)
distributes over scalar addition
\(\displaystyle (\lambda + \mu)v = \lambda v + \mu v \)
scalar associativity
\(\displaystyle (\lambda \mu)v = \lambda(\mu v) \)
\(V\)is unital
The field element \(1 \in F\) satisfies \(1 v = v.\)
Definition 4.1.27.
A nonzero element \(a\) in a ring \(R\) is a zero divisor if there is a nonzero \(b \in
R\) with \(ab=0\) or \(ba=0\text{.}\) In noncommative rings, one condition may hold, but not the other (e.g., in matrix rings). If desired, one can talk about left and right zero divisors, though that will not be our focus.