Rings and Modules Flashcards
Define a ring
A ring is a datum (R, +, ×, 0, 1) where R is a set, 1, 0 ∈ R and + and x are binary operations on R such that:
1. R is an abelian group under + with identity element 0.
2. R is a monoid under x, that is x is associative and has identity 1.
3. Multiplication distributes over addition: x(y + z) = xy + xz, (x + y)z = xz + yz, for all x, y, z ∈ R.
Define a commutative ring
A ring where x is commutative.
Define the direct sum of rings
Let R and S be rings, then the ring R⊕S is given by the pairs (r, s), r ∈ R and s ∈ S and addition and multiplication are given component-wise.
Define a subring
If R is a ring, a subset S ⊆ R is a subring if 0, 1 ∈ S and S is closed under the addition and multiplication operations in R.
Define a ring homomorphism
A map f: R → S between rings R and S is a ring homomorphism if:
1. f(1_R) = 1_S
2. f(r1 + r2) = f(r1) + f(r2)
3. f(r1.r2) = f(r1). f(r2)
Define the image of a ring homomorphism
Given a ring homomorphism f: R→S, im(f) = {s ∈ S: ∃r ∈ R such that f(r) = s}.
Define the kernel of a ring homomorphism
Given a ring homomorphism f: R→S, ker(f) = {r ∈ R: f(r) = 0}.
Define a ring isomorphism
A homomorphism f: R→S is an isomorphism if there exists another homomorphism g: S→R such that f◦g = id_S and g◦f = id_R.
Define the characteristic of a ring
The minimum d such that 1+1+…+1 (d times) = 0 if such a d exists, otherwise the characteristic is 0.
Define a zero divisor
If R is a ring, then an element a ∈ R{0} is said to be a zero-divisor if there is some b ∈ R{0} such that a.b = 0.
Define an integral domain
An integral domain is a ring which is not the zero ring and has no zero-divisors is called an integral domain.
Define a unit
Let R be a ring. The subset R× = {r ∈ R : ∃s ∈ R such that r.s = 1}, is called the group of units in R.
Define an ideal
Let R be a ring. A subset I ⊆ R is called an ideal if it is a subgroup of (R, +) and for any a ∈ I and r ∈ R, a.r ∈ I.
Define a generated ideal
Given any subset T of R, the ideal generated by T is given by <T> = intersection of all I (where I is an ideal) such that T⊆I.</T>
Define a principal ideal
An ideal generated by a single element.
Define associate elements
Two elements a, b ∈ R are said to be associates if there is a unit u ∈ R× such that a = u.b.
Give the universal property of quotients
Suppose that R is a ring, I is an ideal of R, and q: R → R/I the quotient homomorphism. If ϕ: R → S is a ring homomorphism such that I ⊆ ker(ϕ), then there is a unique ring homomorphism ϕ’: R/I → S such that ϕ’◦q = ϕ. Moreover ker(ϕ’) is the ideal ker(ϕ)/I = {m + I : m ∈ ker(ϕ)}.
Give the first isomorphism theorem of rings
If ϕ: R → S is a homomorphism then ϕ induces an isomorphism ϕ’: R/ker(ϕ) → im(ϕ).
Give the second isomorphism theorem of rings
If R is a ring, A is a subring of R and I an ideal of R, then (A + I)/I is isomorphic to A/(A ∩ I)
Give the third isomorphism theorem of rings
Suppose that I1 ⊆ I2 are ideals in R. Then (R/I1)/(I2/I1) is isomorphic to R/I2.
Give the Chinese remainder theorem for rings
Let R be a ring, and I, J ideals of R such that I + J = R. Then R/(I∩J) is isomorphic to R/I⊕R/J.
Define a maximal ideal
Let R be a ring, and I an ideal of R. I is a maximal ideal of R if it is not strictly contained in any proper ideal of R.
Define a prime ideal
Let R be a ring, and I an ideal of R. I is a prime ideal of R if I ≠ R and for all a, b ∈ R, whenever a.b ∈ I then either a ∈ I or b ∈ I.
Define a prime element
If a prime ideal I is principal any generator of I is said to be a prime element of R.
Define the degree of a polynomial
If R is a ring and f ∈ R[t] is nonzero, then we may write f = the sum over i from 0 to n of (a_i)(t^i), where a_n ≠ 0. Then, the degree deg(f) of f is n.
Give the division algorithm
Let R be a ring and f = the sum over i from 0 to n of (a_i)(t^i) ∈ R[t], where a_n ∈ R×. Then if g ∈ R[t] is any polynomial, there are unique polynomials q, r ∈ R[t] such that either r = 0 or deg(r) < deg(f) and g = q.f + r.
Define a Euclidean Domain
Let R be an integral domain. R is a Euclidean domain if there exists a function N: R{0} → Natural numbers such that given any a, b ∈ R with b ≠ ,0 there are q,r ∈ R such that a = b.q + r and either r = 0 or N(r) < N(b).
Define a principal ideal domain
A principal ideal domain is an integral domain in which every ideal is principal.
Define an irreducible element
Let R be an integral domain. A nonzero element r ∈ R is said to be irreducible if whenever r = a.b then exactly one of a or b is a unit.
Define a field extension
If E, F are any fields and F ⊆ E we call E a field extension of F and write E/F.
Define the degree of a field extension
If E is finite dimensional as an F-vector space, we write [E : F] = dim(E) for this dimension and call it the degree of the field extension E/F.
State the tower law
Let F ⊂ E ⊂ K be fields, then [K : F] is finite if and only if both degrees [E : F], [K : E] are, and when they are finite we have [K : F] = [E : F][K : E]
Define an algebraic number
Let α ∈ C. We say that α is algebraic over Q if there is a field E which is a finite extension of Q containing α.
Define a transcendental number
Let α ∈ C. We say that α is transcendental over Q if there are no fields E which are a finite extension of Q containing α.
Define the minimal polynomial
Given α ∈ C, the irreducible polynomial f for which Q(α) is isomorphic to Q[t]/⟨f⟩ is called the minimal polynomial of α over Q.
Define a factor
Let R be an integral domain. If a, b ∈ R we say that a is a factor of b, and write a|b, if there is some c ∈ R such that b = a.c.
Define a common factor
Let R be an integral domain. We say c ∈ R is a common factor of a, b ∈ R if c|a and c|b.
Define the highest common factor
c is the highest common factor of a and b if whenever d is a common factor of a and b, d|c.
Define a common multiple
Let R be an integral domain. We say that k ∈ R is a common multiple if a|k and b|k.
Define the lowest common multiple
The least common multiple is a common multiple which is a factor of every common multiple.
Define a unique factorisation domain
An integral domain R is said to be an unique factorisation domain if every element of R{0} is either a unit, or can be written uniquely up to reordering and units as a product of irreducible elements.
Define a Noetherian ring
A ring is Noetherian if any nested ascending chain of ideals stabilises.
Define content in the integer field
If f ∈ Z[t] then the content c(f) of f is the highest common factor of the coefficients of f.
State Gauss’ content lemma
Let f, g ∈ Z[t]. Then c(f.g) = c(f).c(g).
Define content in the rational field
Suppose f ∈ Q[t] is nonzero. Then there is a unique α ∈ Q>0 such that f = αf′ where f′ ∈ Z[t] and c(f′) = 1. We write c(f) = α.
State Eisenstein’s criterion
Suppose that f ∈ Z[t] has c(f) = 1, and f = (a_n)(t^n) + a_(n−1)t^(n−1) + … + (a_1)t + a_0. Then if there is a prime p ∈ Z such that p|ai for all i, 0 ≤ i ≤ n − 1 but p does not divide an and p^2 does not divide a0 then f is irreducible in Z[t] and Q[t].
Define a module
Let R be a ring with identity 1. A module over R is an abelian group (M, +) and R’s multiplication action a: R x M → M, written (r, m) → r.m satisfying:
1. 1.m = m, for all m ∈ M
2. (r1.r2).m = r1.(r2.m), for all r1,r2 ∈ R, m ∈ M
3. (r1 + r2).m = r1.m + r2.m for all r1,r2 ∈ R and m ∈ M
4. r.(m1 + m2) = r.m1 + r.m2 for all r ∈ R and m1, m2 ∈ M
Define a submodule
If M is an R-module, a subset N ⊆ M is called a submodule if it is an abelian subgroup of M and whenever r ∈ R and n ∈ N then r.n ∈ N.
Define a generated module
If X is any subset of an R-module M then the submodule generated by X is defined to be: ⟨X⟩ = Intersection of all submodules N of M containing X.
Define a linearly independent set
If M is a module over R, we say a set S ⊆ M is linearly independent if whenever we have an equation r1.s1 + r2.s2 + … + rk.sk = 0 for ri ∈ R, si ∈ S, then r1 = r2 = . . .rk = 0.
Define a basis
We say that a set S is a basis for a module M if and only if it is linearly independent and it generates M.
Define a free module
Any module which has a basis is called a free module.
Define a finitely generated module
A module is finitely generated if it is generated by a finite subset.
Define a quotient module
Let N is a submodule of M, and if r ∈ R and m + N ∈ M/N then define r.(m + N) = r.m + N. This module M/N is called the quotient module of M by N.
Define a module homomorphism
If M1, M2 are R-modules, then ϕ: M1 → M2 is an R-module homomorphism if: ϕ(m1 + m2) = ϕ(m1) + ϕ(m2) for all m1, m2 ∈ M1 and ϕ(r.m) = r.ϕ(m), for all r ∈ R, m ∈ M1.
Define an element’s annhilator
Let M be an R-module and suppose that m ∈ M. Then the annihilator of m is {r ∈ R : r.m = 0}.
Define a torsion element
Let M be an R-module and suppose that m ∈ M. Then, m is a torsion element if AnnR(m) is nonzero.
Define a torsion module
A module M is torsion if every m ∈ M is a torsion element.
Define a torsion-free module
A module M is torsion if there are no non-zero torsion elements.
Define a cyclic module
A cyclic module is a module generated by a single element.
Define the rank of a module
Let M be a finitely generated free R-module. Then the size of a basis of M is the rank rk(M) of M.
Define an elementary row operation
Let A ∈ Mm,n(R) be a matrix, and let r1,r2, … ,rm be the rows of A, which are row vectors in R^n. An elementary row operation on a matrix A ∈ Mm,k(R) is an operation of the form:
1. Swap two rows ri and rj .
2. Replace one row, row i say, with a new row r′i = ri + crj for some c ∈ R, and j, i.
Define equivalent matrices
If A, B ∈ Mn,m(R) we say that A and B are equivalent if B = PAQ where P ∈ Mn,n(R) and Q ∈ Mm,m(R) are invertible matrices.
Give the Smith Normal Form Theorem
Suppose that A ∈ Mn,m(R) is a matrix. Then A is equivalent to a diagonal matrix D where if k = min{m, n} then there are d1, d2, …, dk on the diagonal, where d1|d2|…|dk and this choice is unique up to units.
Define a presentation
Let M be a finitely generated R-module. The pair of maps ϕ, ψ defined such that im(ϕ) = M and ψ: R^m → R^n has image im(ψ) = ker(ϕ) is called a presentation of the finitely generated modules M.
Define a resolution
A presentation where the map ψ, where im(ψ) = ker(ϕ) for ϕ such that im(ϕ) = M can be chosen to be injective is called a resolution of the module M.
State the structure theorem
Suppose that M is a finitely generated module over a Euclidean domain R. Then there is an integer s and nonzero non-units c1, c2,… , cr ∈ R, where c1|c2| . . . |cr and M is isomorphic to (The direct sum from 1 to r of R/ciR) ⊕ R^s.
State the structure theorem of finitely generated abelian groups
Let A be a finitely generated abelian group. Then there exists an integer r ∈ Z≥0 and integers c1, c2,… , ck ∈ Z greater than 1 such that c1|c2| . . . |ck and A is isomorphis to Z^r ⊕ (Z/c1Z) ⊕ … ⊕ (Z/ckZ). Moreover the integers r, c1, . . . , ck are uniquely determined.
State the structure theorem in primary decomposition form
Let R be a Euclidean domain and suppose that M is a finitely generated R-module. Then there are irreducibles p1,… , pk ∈ R and integers s, ri for 1 ≤ i ≤ k, such that: M is isomorphic to the direct sum from 1 to k of (R/pi^(ri)R) ⊕ R s . Moreover, the pairs (pi ,ri) are uniquely determined up to units (where the units act on the pi only).
Define the companion matrix
For a monic polynomial f = t^n + a_(n-1)t^(n−1) + … + a_0 of degree n ≥ 1, the n × n matrix is given by the identity shifted down one row and the final column being -a_(i-1) for row i.
State the rational canonical form theorem
Suppose that V is a nonzero finite dimensional k-vector space and T: V → V is a linear map. Then there are unique nonconstant monic polynomials f1,…, fk ∈ k[t] such that f1| f2| . . . | fk and a basis of V with respect to which T has matrix which is block diagonal with blocks C(fi).
