Mathematics Exam  >  Mathematics Notes  >  Algebra  >  Unique Factorization Domain

Unique Factorization Domain | Algebra - Mathematics PDF Download

4.1 Unique Factorization Domains (UFDs)

Throughout this section R will denote an integral domain (i.e. a commutative ring with identity containing no zero-divisors). Recall that a unit of R is an element that has an inverse with respect to multiplication. If a is any element of R and u is a unit, we can write

a = u(u -1a):

This is not considered to be a proper factorization of a. For example we do not consider 5 = 1(5) or 5 = (-1)(-5) to be proper factorizations of 5 in Z. We do not consider to be a proper factorization of x2 + 2 in Q[x].

Unique Factorization Domain | Algebra - Mathematics

Definition 4.1.1 An element a in an integral domain R is called irreducible if it is not zero or a unit, and if whenever a is written as the product of two elements of R, one of these is a unit.

An element p of an integral domain R is cal led prime if p is not zero or a unit, and whenever p divides ab for elements a; b of R, either p divides a or p divides b.

Note

1. Elements r and s are called associates of each other if s = ur for a unit u of R. So a ∈ R irreducible if it can only be factorized as the product of a unit and one of its own associates.

2. If R is an integral domain, every prime element of R is irreducible. To see this let p ∈ R be prime and suppose that p = rs is a factorisation of p in R. Then since p divides rs, either p divides r or p|s. There is no loss of generality in assuming p divides r. Then r = pa for some element a of R, and p = rs so p = pas. Then p pas = 0 so p(1 - as) = 0 in R. Thus as = 1 since R is an integral domain and p ≠ 0. Then s is a unit and p = rs is not a proper factorisation of p. Hence p is irreducible in R.

It is not true that every irreducible element of an integral domain must be prime, as we will shortly see.

Examples:

1. In Z the units are 1 and 1 and each non-zero non-unit element has two associates, namely itself and its negative. SO 5 and -5 are associates, 6 and -6 are associates, and so on. The irreducible elements of Z are p and -p, for p prime.

2. In Q[x], the units are the non-zero constant polynomials. The associates of a non-zero non-constant polynomial f (x) are the polynomials of the form af (x) where a ∈ Qx .
So x2 + 2 is associate to Unique Factorization Domain | Algebra - Mathematics .

3. In Z the irreducible elements are the integers p and -p where p is a prime numbers. The prime elements of Z are exactly the irreducible elements - the prime numbers and their negatives.

Definition 4.1.2 An integral domain R is a unique factorization domain if the following conditions hold for each element a of R that is neither zero nor a unit.

1. a can be written as the product of a nite number of irreducible elements of R.

2. This can be done in an essential ly unique way. If a = p1 p2 ... pr and a = q1 q2 ... qs are two expressions for a as a product of irreducible elements, then s = r and q1 ... qs can be reordered so that for each i, qi is an associate of pi.

Example 4.1.3 Z is a UFD.

(This is the Fundamental Theorem of Arithmetic). 

Example 4.1.4 Let Unique Factorization Domain | Algebra - Mathematics  denote the set of complex numbers of the form Unique Factorization Domain | Algebra - Mathematics where a and b are integers and Unique Factorization Domain | Algebra - Mathematics denotes the complex number Unique Factorization Domain | Algebra - Mathematics. We will show that Unique Factorization Domain | Algebra - Mathematics is not a UFD (it is easily shown to be a ring under the usual addition and multiplication of complex numbers).

Claim: Unique Factorization Domain | Algebra - Mathematics is not a UFD.

The proof if this claim will involve a number of steps.

1. We define a function Unique Factorization Domain | Algebra - Mathematics denotes the complex conjugate of a. thus

Unique Factorization Domain | Algebra - Mathematics

Unique Factorization Domain | Algebra - Mathematics

Unique Factorization Domain | Algebra - Mathematics

So φ is multiplicative.

2. Suppose α is a unit of Unique Factorization Domain | Algebra - Mathematics and let β be its inverse.  Unique Factorization Domain | Algebra - MathematicsUnique Factorization Domain | Algebra - Mathematics are positive integers this means Unique Factorization Domain | Algebra - Mathematics So φ(α) = 1 whenever α is a unit.

On the other hand Unique Factorization Domain | Algebra - Mathematics for integers a and b which means b = 0 and a = ±1. So the only units of Z[Unique Factorization Domain | Algebra - Mathematics] are 1 and -1.

3. 3. Suppose φ(α) = 9 for some a ∈ Z[Unique Factorization Domain | Algebra - Mathematics], If a is not irreducible in Z[Unique Factorization Domain | Algebra - Mathematics] then it factorizes as α1α2 where a\ and a2 are non-units. Then we must have

Unique Factorization Domain | Algebra - Mathematics

Now this would means 3 = c2 + 5d2 for integers c and d which is impossible. So if φ(α) = 9 then α is irreducible in Z[Unique Factorization Domain | Algebra - Mathematics].

4. Now 9 = 3 x 3 and 9 = (2 + Unique Factorization Domain | Algebra - Mathematics)(2 -Unique Factorization Domain | Algebra - Mathematics) in Z[Unique Factorization Domain | Algebra - Mathematics]. The elements (3, 2 + Unique Factorization Domain | Algebra - Mathematics) and 2 - Unique Factorization Domain | Algebra - Mathematics) are all irreducible in Z[Unique Factorization Domain | Algebra - Mathematics] by item 3. above. Furthermore 3 is not an associate of either 2 + Unique Factorization Domain | Algebra - Mathematics or 2 -Unique Factorization Domain | Algebra - Mathematics as the only units in Z[Unique Factorization Domain | Algebra - Mathematics] are 1 and -1. We conclude that the factorizations of 9 above are genuinely different, and Z[Unique Factorization Domain | Algebra - Mathematics] is not a UFD.

Note that 3 is an example of an element of Z[Unique Factorization Domain | Algebra - Mathematics] that is irreducible but not prime.

Remark: The ring Z[i] = {a + bi : a; b ∈ Z} is a UFD.

Theorem 4 .1.5 Let F be a eld. Then the polynomial ring F [x] is a UFD.

Proof: We need to show that every non-zero non-unit in F[x] can be written as a product of irreducible polynomials in a manner that is unique up to order and associates.
So let f (x) be a polynomial of degree n > 1 in F [x]. If f (x) is irreducible there is nothing to do. If not then  f (x) = g(x)h(x) where g(x)  and h(x) both have degree less than n. If
g(x) or h(x) is reducible further factorization is possible; the process ends after at most n steps with an expression for f (x) as a product of irreducibles.

To see the uniqueness, suppose that

f (x) = p1 (x)p2 (x) .... pr (x) and

f (x) = q1 (x)q2 (x) : : : qs (x)

are two such expressions, with s > r. Then q1 (x)q2 (x)... qs (x) belongs to the ideal (p1 (x)) of F[x]. Since this ideal is prime (as p1(x) is irreducible) this means that either q1(x) ∈ (p1(x)) or q2(x)... qs(x) ∈ (p1(x)). Repeating this step leads to the conclusion that at least one of the qi (x) belongs to (p1(x)). After reordering the qi(x) if necessary we have q1(x) ∈ (p1(x)). Since q1 (x) is irreducible this means q1(x) = u1p1(x) for some unit u1. Then

Pl1(x)p2(x) ...pr(x) = u1p1(x)q2(x) ...qs(x).

Since F [x] is an integral domain we can cancel p1(x) from both sides to obtain
P2(x) .. .P1(x) = u1q2(x) . .. qs(x).

After repeating this step a further r - 1 times we have
1 = u1u2 . . . ur qr + 1(x) . .. qs(x),
where u1,... ,ur are units in F[x] (i.e. non-zero elements of F). This means s = r, since the polynomial on the right in the above expression must have degree zero. We conclude that qi (x),..., qs (x) are associates (in some order) of p1 (x),..., pr (x). This completes the proof.

The document Unique Factorization Domain | Algebra - Mathematics is a part of the Mathematics Course Algebra.
All you need of Mathematics at this link: Mathematics
161 videos|58 docs

FAQs on Unique Factorization Domain - Algebra - Mathematics

1. What is a Unique Factorization Domain (UFD) in mathematics?
Ans. A Unique Factorization Domain (UFD) is an integral domain in which every non-zero non-unit element can be uniquely expressed as a product of irreducible elements, up to order and units. This property is known as unique factorization theorem or prime factorization.
2. What are the main properties of a Unique Factorization Domain (UFD)?
Ans. The main properties of a Unique Factorization Domain (UFD) are: - Every non-zero non-unit element can be factored into irreducible elements. - The factorization is unique up to order and units. - The irreducible elements in a UFD are prime elements. - If two elements have a greatest common divisor, then their greatest common divisor can be expressed as a product of irreducible elements.
3. How does a Unique Factorization Domain (UFD) differ from a Euclidean Domain?
Ans. A Unique Factorization Domain (UFD) is a more specific type of integral domain compared to a Euclidean Domain. While both domains allow for division with remainder, a UFD also guarantees the unique factorization property. In a UFD, every non-zero non-unit element can be uniquely expressed as a product of irreducible elements, whereas in a Euclidean Domain, this uniqueness is not necessarily guaranteed.
4. What are some examples of Unique Factorization Domains (UFDs)?
Ans. Some examples of Unique Factorization Domains (UFDs) include: - The ring of integers (Z) - The ring of polynomials over a field (F[x]) - The ring of Gaussian integers (Z[i]), where i is the imaginary unit These examples satisfy the properties of a UFD, where every non-zero non-unit element can be uniquely factored into irreducible elements.
5. How is the concept of Unique Factorization Domain (UFD) important in number theory and algebraic geometry?
Ans. The concept of Unique Factorization Domain (UFD) plays a crucial role in number theory and algebraic geometry. In number theory, UFDs provide a foundation for prime factorization and the study of divisibility properties. They allow for the analysis of prime numbers, greatest common divisors, and prime factorization algorithms. In algebraic geometry, UFDs are used to study algebraic curves and varieties. They help in understanding the geometric properties of equations and provide tools for solving equations and analyzing their solutions. UFDs serve as a fundamental framework for studying algebraic structures and their properties in both number theory and algebraic geometry.
161 videos|58 docs
Download as PDF
Explore Courses for Mathematics exam
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Related Searches

mock tests for examination

,

Sample Paper

,

MCQs

,

Viva Questions

,

Unique Factorization Domain | Algebra - Mathematics

,

Objective type Questions

,

Semester Notes

,

Summary

,

study material

,

Extra Questions

,

shortcuts and tricks

,

Free

,

Previous Year Questions with Solutions

,

Unique Factorization Domain | Algebra - Mathematics

,

pdf

,

ppt

,

Exam

,

practice quizzes

,

video lectures

,

past year papers

,

Unique Factorization Domain | Algebra - Mathematics

,

Important questions

;