filmov
tv
Abstr Alg, 26B: Division Algorithm & Corollaries, Irreducible Polynomials over Field, Maximal Ideals
Показать описание
Abstract Algebra, Lecture 26B, Division Algorithm and Corollaries, Irreducible Polynomials over a Field and Maximal Ideals.
(0:00) Meaning of the long division from the end of lecture A in terms of the division algorithm equation.
(1:30) Definition of what it means for one polynomial to divide another in D[x], where D is an integral domain.
(2:36) Definition of a zero (or root) and a zero of multiplicity k.
(5:22) Remainder Theorem (relate to the example), Factor Theorem, and a theorem giving an upper bound of the number of zeros of a polynomial over a field, counting multiplicity (the upper bound is the degree of the polynomial).
(9:01) Ideals in a ring of polynomials over a field are generated by nonzero polynomials of minimum degree in that ideal (and a reminder of what a principal ideal is and note that F[x] is a principal ideal domain (PID)...an analog in ring theory of a cyclic group in group theory).
(14:28) Irreducibility/reducibility of a polynomial over a field (generalizes the concept of a prime number).
(16:21) Reducibility/Irreducibility Test for a degree 2 or 3 polynomial over a field.
(16:51) Consider whether f(x) = x^2 + 1 is reducible or irreducible over Z2 and Z3 (the answers are different).
(20:43) Relate the results to factor rings and maximal ideals (a principal ideal generated by p(x) in F[x] is maximal iff p(x) is irreducible over F iff the factor ring F[x]/A is a field, where A is the principal ideal generated by p(x)).
(22:01) Calculation of the multiplicative inverse of x + A in the factor ring (quotient ring) Z3[x]/A, where A is the principal ideal generated by x^2 + 1.
AMAZON ASSOCIATE
As an Amazon Associate I earn from qualifying purchases.
Комментарии