Mind map
Abstract Algebra

Map content
Abstract Algebra
Integers
- Divisibility
- Division Algorithm
- Let a,b ∈ ℤ with b > 0. Then there exists unique integers q and r such that a = bq + r and 0 ≤ r < b
- Greatest Common Divisor
- Theorem 1.2: Let a,b ∈ ℤ with a,b ≠ 0, and let d be their greatest common divisor. Then there exist (not necessarily unique) integers u and v such that d = au + bv.
- Theorem 1.4: If a|bc and (a,b) = 1, then a|c.
- Let a,b ∈ ℤ with a,b ≠ 0. The greatest common divisor (gcd) of a and be is the largest integer, d, that divides both a and b.
- Theorem 1.2: Let a,b ∈ ℤ with a,b ≠ 0, and let d be their greatest common divisor. Then there exist (not necessarily unique) integers u and v such that d = au + bv.
- Let a,b ∈ ℤ with b ≠ 0. We say that b divides a if a = bc for some integer c.
- Division Algorithm
- Prime Integer
- Theorem 1.5: Let p be an integer with p ≠ 0, ±1. Then p is prime if and only if p has this property: whenever p|bc, then p|b or p|c.
- Theorem 1.7: Every integer n except 0, ±1 is a product of primes.
- An integer p is said to be prime if p ≠ 0, ±1 and the only divisors of p are ±1 and ±p.
- Congruence
- Let a, b, n be integers with n > 0. Then a is congruent to b modulo n [written “a ≡ b (mod n)”], provided that n divides a - b.
- Congruence Class
- Let a and n be integers with n > 0. The congruence class of a modulo n (denoted [a]) is the set of all those integers that are congruent to a modulo n, that is, [a] = {b|b ∈ ℤ and b ≡ a (mod n)}.
- Theorem 2.3: a ≡ c (mod n) if and only if [a] = [c].
- The set of all congruence classes modulo n is denoted ℤn.
- Modular Arithmetic
- Addition in ℤn: [a] ⊕ [c] = [a + c]
- Multiplication in ℤn: [a] ⊙ [c] = [ac]
- Theorem 2.9: Let a,n be integers with n > 1. Then the equation [a]x = [1] has a solution in ℤn if and only if (a, n) = 1 in ℤ.
- Unit
- An element a in ℤn is called a unit if the equation ax = 1 has a solution.
- Theorem 2.10: Let a,n be integers with n > 1. Then [a] is a unit in ℤn if and only if (a, n) = 1 in ℤ.
- Zero Divisor
- A nonzero element a of ℤn is called a zero divisor if the equation ax = 0 has a nonzero solution (that is, if there is a nonzero element c in ℤn such that ac = 0).
- Divisibility
Polynomials
- Let R be any ring. A polynomial with coefficients in R is an expression of the form
- Leading Coefficient
- a_n
- Degree
- deg(f) = n
- Theorem 4.2: If R is an integral domain and f(x), g(x) are nonzero polynomials in R[x], then deg[f(x)g(x)] = deg f(x) + deg g(x).
- Divisibility in F[x]
- Let F be a field and a(x),b(x) ∈ F[x] with b(x) nonzero. We say that b(x) divides a(x) if a(x) = b(x)h(x) for some h(x) ∈ F[x].
- Division Algorithm in F[x]
- Let F be a field and f(x), g(x) ∈ F[x] with g(x) ≠ 0_F. Then there exist unique polynomials q(x) and r(x) such that f(x) = g(x)q(x) + r(x) and either r(x) = 0_F or deg r(x) < deg g(x).
- Greatest Common Divisor in F[x]
- Let F be a field and a(x),b(x) ∈ F[x], not both zero. The greatest common divisor (gcd) of a(x) and b(x) is the monic polynomial of highest degree that divides both a(x) and b(x).
- Monic
- A polynomial in F[x] is monic if it has a leading coefficient of 1_F.
- Theorem 4.10: Let F be a field and a(x),b(x),c(x) ∈ F[x]. If a(x)|b(x)c(x) and a(x) and b(x) are relatively prime, then a(x)|c(x).
- Irreducible
- Let F be a field. A nonconstant polynomial p(x) in F[x] is said to be irreducible if its only divisors are its associates and the nonzero constant polynomials (units). A polynomial is reducible if it is not irreducible.
- Theorem 4.11: Let F be a field. A nonzero polynomial f(x) is reducible in F[x] if and only if f(x) can be written as the product of two polynomials of lower degree.
- Roots in F[x]
- Let R be a commutative ring and f(x) ∈ R[x]. An element a of R is said to be a root (or zero) of the polynomial f(x) if f(a) = 0_R.
- Remainder Theorem: Let F be a field, f(x) ∈ F[x], and a ∈ F. The remainder when f(x) is divided by the polynomial x - a is f(a).
- Factor Theorem: Let F be a field, f(x) ∈ F[x], and a ∈ F. Then a is a root of the polynomial f(x) if and only if x - a is a factor of f(x) in F[x]
- Congruence in F[x]
- Let F be a field and f(x),g(x),p(x) ∈ F[x] with p(x) nonzero. Then f(x) ≡ g(x) (mod p(x)) provided that p(x) divides f(x) - g(x).
- Congruence Classes in F[x]
- Let F be a field and f(x),p(x) ∈ F[x] with p(x) nonzero. The congruence class of f(x) modulo p(x) is denoted [f(x)] and consists of all polynomials in F[x] that are congruent to f(x) modulo p(x), that is, [f(x)] = {g(x) | g(x) ∈ F[x] and g(x) ≡ f(x) (mod p(x))}.
- Theorem 5.3: f(x) ≡ g(x) (mod p(x)) if and only if [f(x)] = [g(x)].
- Polynomial Quotient Ring
- Given F a field and p(x) a nonzero element of F[x], the polynomial quotient ring F[x]/(p(x)) = {the set of all congruence classes mod p(x)}.
Rings
- A ring is a nonempty set R equipped with two operations* (usually written as addition and multiplication) that satisfy the following axioms. For all a,b,c ∈ R:
- Closure for Addition, Associative Addition, Commutative Addition, Additive Identity, Additive Inverse, Closure for Multiplication, Associative Multiplication, Distributive Laws
- Commutative Ring
- ab = ba for all a,b ∈ R.
- Ring with Identity
- a · 1_R = a = 1_R · a for all a ∈ R.
- Integral Domain
- An integral domain is a commutative ring R with identity 1_R ≠ 0_R that satisfies this axiom: Whenever a, b ∈ R and ab = 0_R, then a = 0_R or b = 0_R.
- Field
- A field is a commutative ring R with identity 1_R ≠ 0_R that satisfies this axiom: For each a ≠ 0_R in R,the equation ax = 1_R has a solution in R.
- Subrings
- When a subset S of a ring R is itself a ring under the addition and multiplication in R, then we say that S is a subring of R.
- Theorem 3.2: Suppose that R is a ring and that S is a subset of R such that S is closed under addition, S is closed under multiplication, 0_R is in S, and if a is in S then the solution ax = 0_R is in S, then S is a subring.
- Theorem 3.6: Let S be a nonempty subset of a ring R such that S is closed under subtraction and S is closed under multiplication, then S is a subring.
- Unit
- An element a in a ring R with identity is called a unit if there exists u in R such that au = 1_R = ua.
- Zero Divisor
- An element a in a ring R is a zero divisor provided that a ≠ 0_R and there exists a nonzero element c in R such that ac = 0_R or ca = 0R.
- Homomorphism
- Isomorphism
- A ring R is isomorphic to a ring S if there is a function f:R -> S such that f is injective, f is surjective, f(a+b) = f(a) + f(b) and f(ab) = f(a) · f(b) for all a,b in R. In this case the function f is called an isomorphism.
- Let R and S be rings. A function f:R -> S is said to be a homomorphism if f(a+b) = f(a) + f(b) and f(ab) = f(a) · f(b) for all a,b in R.
- Isomorphism
- A ring is a nonempty set R equipped with two operations* (usually written as addition and multiplication) that satisfy the following axioms. For all a,b,c ∈ R:
Ideals
- A subring I of a ring R is an ideal provided: Whenever r ∈ R and a ∈ I, then ra ∈ I and ar ∈ I.
- Theorem 6.1: A nonempty subset I of a ring R is an ideal if and only if it has these properties: if a,b ∈ I, then a – b ∈ I and if r ∈ R and a ∈ I, then ra ∈ I and ar ∈ I.
- Let I be an ideal in a ring R and let a,b ∈ R. Then a ≡ b (mod I) provided that a - b ∈ I.
- Prime Ideal
- An ideal P in a commutative ring R is said to be prime if P ∈ R and whenever bc ∈ P, then b ∈ P or c ∈ P.
Kernel
- Let f:R -> S be a homomorphism of rings. Then the kernel of f is the set K = {r in R | f(r) = 0_S}.
- Theorem 6.10: Let f:R -> S be a homomorphism of rings. Then the kernel K of f is an ideal in the ring R.
- Theorem 6.13: Let f:R -> S be a surjective homomorphism of rings with kernel K. Then the quotient ring R/K is isomorphic to S.
Maximal
- An ideal M in a ring R is said to be maximal if M ≠ R and whenever J is an ideal such that M ⊆ J ⊆ R, then M = J or J = R.
- Theorem 6.15: Let M be an ideal in a commutative ring R with identity. Then M is a maximal ideal if and only if the quotient ring R/M is a field.
Images and files in the map
Information
- Description
- Mind Map on Abstract Algebra, created by Kyle Liberatore on 11/12/2024.
- Created by
- Kyle Liberatore
- Views
- 3
- Rating