1/47
Vocabulary practice flashcards covering group isomorphism theorems, normal subgroups, ring properties, polynomial and matrix rings, ideal structures, Euclidean domains, PIDs, and UFDs.
First Isomorphism Theorem (for Groups)
If ϕ:G→G′ is a group homomorphism, then ker(ϕ)⊴G, Im(ϕ)≤G′, and G/ker(ϕ)≅Im(ϕ).
Second Isomorphism Theorem (for Groups)
Let G be a group with A≤G and N⊴G. Then AN≤G, N⊴AN, A∩N⊴A, and AN/N≅A/(A∩N).
Third Isomorphism Theorem (for Groups)
Let G be a group with normal subgroups A⊴G and B⊴G. If A⊆B, then A⊴B, B/A⊴G/A, and (G/A)/(B/A)≅G/B.
Cayley's Theorem
Every group is isomorphic to a subgroup of a permutation group; specifically, for any group G, there exists a set X and a subgroup H≤SX such that G≅H.
Normal Subgroup
A subgroup N of G satisfying xNx−1⊆N for all x∈G (equivalently, xNx−1=N, xN=Nx, or xy−1∈N⟺y−1x∈N), denoted N⊴G.
Quotient Group
The group of left cosets G/N={xN∣x∈G} formed by a normal subgroup N⊴G, where the binary operation is given by coset multiplication (xN)(yN)=(xy)N.
Kernel (Group Homomorphism)
For a group homomorphism ϕ:G→G′, the set of all elements in G sent to the identity of G′, denoted ker(ϕ)={x∈G∣ϕ(x)=1}.
Image (Group Homomorphism)
For a group homomorphism ϕ:G→G′, the subgroup of G′ defined by Im(ϕ)={ϕ(x)∈G′∣x∈G}.
Fiber
For a group homomorphism ϕ:G→G′ and an element y∈Im(ϕ), the preimage set defined by ϕ−1(y)={x∈G∣ϕ(x)=y}.
Ring
A set R equipped with addition and multiplication such that (R,+) is an Abelian group, multiplication is associative, and the distributive laws hold for all elements.
Commutative Ring
A ring R in which multiplication is commutative, meaning a⋅b=b⋅a for all a,b∈R.
Division Ring
A ring with identity 1=0 in which every nonzero element has a multiplicative inverse.
Field
A commutative division ring; that is, a commutative ring with non-zero identity in which every non-zero element has a multiplicative inverse.
Zero Divisor
A nonzero element a of a ring R for which there exists a nonzero element b∈R such that ab=0 or ba=0.
Unit (of a Ring)
An element a in a ring R with identity that has a multiplicative inverse, meaning there exists b∈R such that ab=ba=1.
Integral Domain
A commutative ring with identity that contains no zero divisors.
Subring
A subgroup S of (R,+) that is closed under the multiplication of R, so a⋅b∈S for all a,b∈S.
Center (of a Ring)
The subring of a ring A consisting of elements a∈A such that ax=xa for all x∈A.
Ring Homomorphism
A map ϕ:R→S between rings that preserves addition and multiplication: ϕ(a+b)=ϕ(a)+ϕ(b) and ϕ(ab)=ϕ(a)ϕ(b) for all a,b∈R.
Kernel (Ring Homomorphism)
For a ring homomorphism ϕ:R→S, the set of elements in R mapped to the additive identity of S, given by Ker(ϕ)={a∈R∣ϕ(a)=0}.
Ideal (Two-Sided Ideal)
A subring I of a ring R that is closed under both left and right multiplication by elements of R, meaning rI⊆I and Ir⊆I for all r∈R.
Quotient Ring
The ring of cosets R/I of an ideal I⊆R under the operations (r+I)+(s+I)=(r+s)+I and (r+I)(s+I)=rs+I.
First Isomorphism Theorem for Rings
If ϕ:R→S is a ring homomorphism, then Ker(ϕ) is an ideal of R, Im(ϕ) is a subring of S, and R/Ker(ϕ)≅Im(ϕ).
Second Isomorphism Theorem for Rings
Let R be a ring, A a subring, and B an ideal of R. Then A+B is a subring of R, A∩B is an ideal of A, and (A+B)/B≅A/(A∩B).
Third Isomorphism Theorem for Rings
Let I and J be ideals of a ring R such that I⊆J. Then J/I is an ideal of R/I and (R/I)/(J/I)≅R/J.
Fourth Isomorphism Theorem for Rings
For an ideal I of R, the correspondence A↦A/I is an inclusion-preserving bijection between subrings (or ideals) of R containing I and subrings (or ideals) of R/I.
Polynomial Ring (R[x])
The ring formed by infinite sequences a=(a0,a1,a2,…) in R with an=0 for almost all n, under component-wise addition and convolution multiplication cn=∑i+j=naibj.
Indeterminate (x)
The specific sequence in R[x] defined by x=(0,1,0,0,…), having 1 in the second slot and 0 everywhere else.
Degree (of a Polynomial)
For a nonzero polynomial a(x)∈R[x], the largest integer n such that an=0, where an is the leading coefficient.
General Linear Group (GLn(R))
The group of units of the matrix ring Mn(R), consisting of all invertible n×n matrices with entries in R.
Special Linear Group (SLn(R))
The subgroup of GLn(R) consisting of all n×n matrices with determinant equal to 1.
Group Ring (RG)
For a commutative ring with identity R and a finite group G={g1,…,gn}, the ring of formal sums RG={a1g1+⋯+angn∣ai∈R,gi∈G} with component-wise addition and multiplication (agi)(bgj)=(ab)(gigj).
Augmentation Map
The ring homomorphism from the group ring RG to R defined by ∑i=1naigi↦∑i=1nai.
Ideal Generated by a Subset
For a subset A⊆R, the smallest ideal of R containing A, denoted (A), which is equal to the intersection of all ideals containing A.
Principal Ideal
An ideal generated by a single element, denoted (a), which in a commutative ring with 1 is given by (a)={ar∣r∈R} .
Prime Ideal
A proper ideal P of a commutative ring R such that whenever ab∈P, then a∈P or b∈P for any a,b∈R.
Maximal Ideal
A proper ideal M of a ring R such that if I is an ideal of R with M⊆I⊆R, then M=I or I=R.
Norm (on an Integral Domain)
A map of sets N:R→N∪{0} on an integral domain R such that for any nonzero a,b∈R, N(a)≤N(ab).
Euclidean Domain
An integral domain R equipped with a norm N such that for any a,b∈R with b=0, there exist q,r∈R such that a=qb+r, where r=0 or N(r)<N(b).
Euclidean Algorithm
A sequence of successive division steps in a Euclidean domain that terminates at the last nonzero remainder rn, which satisfies rn=gcd(a,b).
Greatest Common Divisor (in a Ring)
A nonzero element d∈R such that d∣a and d∣b, and if c∣a and c∣b, then c∣d.
Bezout Domain
An integral domain in which every ideal generated by two elements is principal.
Principal Ideal Domain (PID)
An integral domain in which every ideal is principal.
Ascending Chain Condition (ACC)
The condition on a ring R that every chain of ideals I1⊆I2⊆I3⊆… terminates, meaning there exists N∈N such that In=In+1 for all n≥N.
Noetherian Ring
A ring that satisfies the ascending chain condition (ACC) on its ideals.
Prime Element
A nonzero element p in an integral domain R such that the principal ideal (p) is a prime ideal, or equivalently, if p∣ab, then p∣a or p∣b.
Irreducible Element
A nonzero non-unit element q in an integral domain R such that whenever q=ab, either a or b is a unit in R.
Unique Factorization Domain (UFD)
An integral domain D in which every nonzero non-unit element can be factored into a product of irreducible elements uniquely up to order and associate units.