Is \(\mathbb{Q}(\sqrt{5})\) a Unique Factorization Domain?

  • Context: Graduate 
  • Thread starter Thread starter math_grl
  • Start date Start date
  • Tags Tags
    Domain Factorization
Click For Summary
SUMMARY

The discussion confirms that \(\mathbb{Q}(\sqrt{5})\) is a Unique Factorization Domain (UFD). The proof involves demonstrating that any element of the form \(a + b\sqrt{5}\) can be uniquely factored into primes, similar to the fundamental theorem of arithmetic. By reducing the problem to integer coefficients and ensuring that the greatest common divisor (gcd) of the coefficients is 1, the uniqueness of factorization is established. The discussion also acknowledges potential complications with negative integers but maintains that the core principles apply.

PREREQUISITES
  • Understanding of Unique Factorization Domains (UFDs)
  • Familiarity with the fundamental theorem of arithmetic
  • Knowledge of algebraic structures, specifically fields and rings
  • Basic concepts of gcd and its implications in factorization
NEXT STEPS
  • Study the properties of Unique Factorization Domains in algebraic number theory
  • Explore the implications of the fundamental theorem of arithmetic in different number systems
  • Investigate the factorization of elements in other quadratic fields, such as \(\mathbb{Q}(\sqrt{-5})\)
  • Learn about the role of gcd in polynomial factorization and its applications
USEFUL FOR

Mathematicians, algebraists, and students of number theory interested in understanding the structure of quadratic fields and their factorization properties.

math_grl
Messages
46
Reaction score
0
So you see it all over the place, \mathbb{Q}(\sqrt{-5}) is not a UFD by finding an element such that it has two distinct prime factorizations...but what about showing that \mathbb{Q}(\sqrt{5}) is a UFD?

I'm only concerned with this particular example, I might have questions later on regarding a general method.
 
Physics news on Phys.org
Isn't the proof goes like the proof of the fundamental theorem of arithmetic? the uniqueness part.
 
I guess it could be. So you are saying that you take some random element a + b\sqrt{5} \in \mathbb{Q}(\sqrt{5}) and claim there are two distinct prime factorizations and show they actually differ by a unit?
 
Well if you show it for the integers coeffiecients then it will obviously follow for rational coeffiecnts (I am referring to a,b), by taking common denominator in both sides and then multiply by the lcm of the two denominators of both sides we reducing the problem to integer coeffiecints.

I believe that because Q(\sqrt 5) is spanned by 1 and \sqrt 5
It's enough to show that (a+b\sqrt 5) c \sqrt 5=d+e\sqrt 5 and (a+b\sqrt 5) c =d+e\sqrt 5, where all the parameters are integers, is uniquely factorised (this obviously follows from the uniquness in simple integers).
Obviously in the proof we should impose the condition that gcd(a,b,c)=1 otherwise we can divide both sides by gcd(a,b,c).

I am just not sure how this will follow for negative integers, maybe this works upto a sign in the whole integers.
 

Similar threads

  • · Replies 21 ·
Replies
21
Views
1K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 5 ·
Replies
5
Views
998
Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
4K
Replies
3
Views
2K
Replies
1
Views
2K