Understanding UFD's with Quadratic Integer & Norm Questions

In summary: Z}[i].Since 7 and 24 are both odd, we can write \alpha = (a + bi)^2 for some integers a and b. Using the binomial expansion, we get\alpha = a^2 - b^2 + 2abi.We can equate the real and imaginary parts of this expression to get the system of equationsa^2 - b^2 = 72ab = 24.Solving this system gives a = 5 and b = 2, which means \alpha = (5 + 2i)^2 = 25 +
  • #1
Brimley
77
0
Hello PhysicsForums!

I was reading up on UFD's and I came up with a few quick questions.

1. Why don't the integers of [itex]Q[\sqrt{-5}][/itex] form a UFD? I was trying to tie in the quadratic integers that divide 6 to help me understand this, but I am stuck.

2. Why is [itex]Z[/itex] a UFD?

3. Assuming [itex]Q[\sqrt{d}][/itex] is a UFD, [itex] \alpha [/itex] is an integer in [itex]Q[\sqrt{d}][/itex] so that [itex]\alpha[/itex] and [itex]\bar{\alpha}[/itex] have no common factor. The norm of [itex]\alpha[/itex], [itex]N(\alpha)[/itex], is a perfect square in [itex]Z[/itex]. Is [itex]\alpha[/itex] a perfect square in the quadratic integers in [itex]Q[\sqrt{d}][/itex]? I believe I saw a proof for this idea somewhere on the web but now I can't find it, however I do remember that it revealed that the variable was indeed a perfect square as described above, however I just forgot why. Can anyone explain this?

Thank you :-)
 
Physics news on Phys.org
  • #2
Is anyone able to help with these? It seems like UFD's are a fairly common subject. I hope somebody will chime in.

Thank you, --Brim
 
  • #3
1. In [itex]\mathbb{Q}(\sqrt{-5})[/itex], we have

[tex]6 = 2 \times 3 = (1 + \sqrt{-5})(1 - \sqrt{-5})[/tex]

and all four of the factors are non-associated primes in [itex]\mathbb{Q}(\sqrt{-5})[/itex].

2. It follows from the Fundamental Theorem of Arithmetic.

3. Something isn't right here. Consider the Gaussian integers [itex]\mathbb{Z}[/itex]. They form a UFD. Let [itex]\alpha = 2 + i[/itex]. Then [itex]\bar{\alpha} = 2 - i[/itex]. The two numbers are non-associated primes and hence have no common factor. But N([itex]\alpha) = (2 + i)(2 - i) = 5[/itex] isn't a perfect square in [itex]\mathbb{Z}[/itex]. Also, since [itex]\alpha[/itex] is a prime, it isn't a perfect square in [itex]\mathbb{Z}[/itex].
 
  • #4
Petek said:
1. In [itex]\mathbb{Q}(\sqrt{-5})[/itex], we have

[tex]6 = 2 \times 3 = (1 + \sqrt{-5})(1 - \sqrt{-5})[/tex]

and all four of the factors are non-associated primes in [itex]\mathbb{Q}(\sqrt{-5})[/itex].

2. It follows from the Fundamental Theorem of Arithmetic.

3. Something isn't right here. Consider the Gaussian integers [itex]\mathbb{Z}[/itex]. They form a UFD. Let [itex]\alpha = 2 + i[/itex]. Then [itex]\bar{\alpha} = 2 - i[/itex]. The two numbers are non-associated primes and hence have no common factor. But N([itex]\alpha) = (2 + i)(2 - i) = 5[/itex] isn't a perfect square in [itex]\mathbb{Z}[/itex]. Also, since [itex]\alpha[/itex] is a prime, it isn't a perfect square in [itex]\mathbb{Z}[/itex].


2. Okay, I found a few things that were useful from that link:
- A ring in which the Fundamental Theorem of Arithmetic holds is called a unique factorization domain.
- A ring is said to be a unique factorization domain if the Fundamental theorem of arithmetic (for non-zero elements) holds there. For example, any Euclidean domain or principal ideal domain is necessarily a unique factorization domain. Specifically, a field is trivially a unique factorization domain.

And from the UFD page I found:
- In UFDs, every irreducible element is prime. (In any integral domain, every prime element is irreducible, but the converse does not always hold.) Note that this has a partial converse: any Noetherian domain is a UFD if every irreducible element is prime.

While all of this information is useful, I can't tie it together with why Z is a UFD directly. However, I'm pretty sure with the three above statements that someone might know how to explain this.

3. So you believe this fails and that there is no general solution? Is there an example where this is indeed true and [itex]\alpha[/itex] is indeed a perfect square in the quadratic integers of [itex]Q[\sqrt{d}][/itex] ?
 
  • #5
Regarding Z being a UFD: I like to be helpful, and I don't want to come across as being impatient, but this can be found in just about any undergraduate texts on abstract algebra and number theory. It's also correctly discussed on Wikipedia. If you're not getting it, you need to sit down with a book or two and start with the basics: Read the definitions of ring, integral domain, unique factorization domain, and so on. It's unrealistic to expect to ask about UFDs without knowing the basic concepts.

On the third topic, yes there are algebraic integers that satisfy the properties you stated. For example, let [itex]\alpha = 7 + 24i \ in \ \mathbb{Z}[/itex]. Try to prove that [itex]\alpha[/itex] is a perfect square, that it has no factors in common with its conjugate and that its norm is a perfect square. If you need help with this, please show what you tried and where you got stuck.
 
  • #6
Petek said:
Regarding Z being a UFD: I like to be helpful, and I don't want to come across as being impatient, but this can be found in just about any undergraduate texts on abstract algebra and number theory. It's also correctly discussed on Wikipedia. If you're not getting it, you need to sit down with a book or two and start with the basics: Read the definitions of ring, integral domain, unique factorization domain, and so on. It's unrealistic to expect to ask about UFDs without knowing the basic concepts.

On the third topic, yes there are algebraic integers that satisfy the properties you stated. For example, let [itex]\alpha = 7 + 24i \ in \ \mathbb{Z}[/itex]. Try to prove that [itex]\alpha[/itex] is a perfect square, that it has no factors in common with its conjugate and that its norm is a perfect square. If you need help with this, please show what you tried and where you got stuck.


Well here is my attempt at both of them (Respectively):

1. Z is a UFD because the Fundamental Theorem of Arithemtic holds, and every irreducible element in Z is prime. However, I don't believe that is enough in case I wanted to really explain why, or is it? If not, could someone explain why it is?

2. So here we go:
[itex]\alpha = 7 + 24i[/itex]
[itex]\bar{\alpha} = 7 - 24i[/itex]

Neither of them have common factors

[itex] N(\alpha)=(7+24i)(7-24i)[/itex]
[itex]= 49 -576 (i^2)[/itex]
[itex]= 49+576[/itex]
[itex]= 625 [/itex]
[itex] \sqrt{625} = 25 [/itex].

Does that seem correct?
 
Last edited:
  • #7
He also asks about showing the existence of an a+bi, who's square is 7+24i.
 
  • #8
robert Ihnot said:
He also asks about showing the existence of an a+bi, who's square is 7+24i.

Yes, [itex]\sqrt{(7+24i)}=4+3i[/itex]. What does this change?
 
  • #9
Re: [itex]\mathbb{Z}[/itex] is a UFD. Let's write out the definitions. Perhaps that will make it more clear.

Definition: An integral domain, R, is a unique factorization domain if

(a) any nonzero element in R is either a unit or can be written as the product of a finite number of irreducible elements of R;
(b) the decomposition in part (a) is unique up to the order and association of the irreducible elements.

Definition: A commutative ring with unity is an integral domain if it has no zero-divisors.

Definition: An element a that is not a unit in a ring R will be called irreducible if whenever a = bc with both b, c in R, then one of b or c must be a unit in R.

Note: In the context of UFDs, the terms prime element and irreducible element are equivalent. Therefore, in the preceding definition you can replace irreducible with prime.

Can you now see that [itex]\mathbb{Z}[/itex] is a UFD because it is an integral domain whose elements (the integers) satisfy the requirements of parts (a) and (b) above (with prime replacing irreducibles)?

Yes, [itex]\sqrt{(7+24i)}=4+3i[/itex] . What does this change?

One of your requirements in the original post was that [itex]\alpha[/itex] be a perfect square.

2. So here we go:
[tex]\alpha = 7 + 24i[/tex]
[tex]\bar{\alpha} = 7 - 24i[/tex]

Neither of them have common factors

The last statement requires proof. I made the example slightly more difficult than intended, so I'll sketch the proof. The basic idea is to calculate the prime decompositions of 7 + 24i and 7 - 24i, observe that they have no prime factors in common, and conclude that they have no common factors. I'll work with 7 + 24i. The same arguments apply to 7 - 24i.

We know that [itex]7 + 24i = (4 + 3i)^2[/itex]. Is 4 + 3i prime? No, as some quick calculations show that [itex]4 + 3i = -i(1 + 2i)^2[/itex]. Is 1 + 2i prime? Yes. Here's the proof:

Suppose that 1 + 2i = (a + bi)(c + di) with neither factor a unit in [itex]\mathbb{Z}[/itex] and a, b, c, d all integers. Taking the norm of both sides of the equality, we see that

[tex]N(1 + 2i) = 5 = (a^2 + b^2)(c^2 + d^2)[/tex]

It's obvious that the only solutions to this equation imply that one of the factors a + bi or c + di is a unit, contrary to assumption. Therefore, 1 + 2i is prime in [itex]\mathbb{Z}[/itex]. Putting this together, we have

[tex]7 + 24i = (4 + 3i)^2 = [-i(1 + 2i)^2]^2 = -(1 + 2i)^4[/tex]

and similarly

[tex]7 - 24i = -(1 - 2i)^4[/tex].

After checking that 1 + 2i and 1 - 2i aren't associates, we can conclude that [itex]\alpha[/itex] and [itex]\bar \alpha[/itex] have no common factors.
 
  • #10
Petek said:
Re: [itex]\mathbb{Z}[/itex] is a UFD. Let's write out the definitions. Perhaps that will make it more clear.

Definition: An integral domain, R, is a unique factorization domain if

(a) any nonzero element in R is either a unit or can be written as the product of a finite number of irreducible elements of R;
(b) the decomposition in part (a) is unique up to the order and association of the irreducible elements.

Definition: A commutative ring with unity is an integral domain if it has no zero-divisors.

Definition: An element a that is not a unit in a ring R will be called irreducible if whenever a = bc with both b, c in R, then one of b or c must be a unit in R.

Note: In the context of UFDs, the terms prime element and irreducible element are equivalent. Therefore, in the preceding definition you can replace irreducible with prime.

Can you now see that [itex]\mathbb{Z}[/itex] is a UFD because it is an integral domain whose elements (the integers) satisfy the requirements of parts (a) and (b) above (with prime replacing irreducibles)?



One of your requirements in the original post was that [itex]\alpha[/itex] be a perfect square.



The last statement requires proof. I made the example slightly more difficult than intended, so I'll sketch the proof. The basic idea is to calculate the prime decompositions of 7 + 24i and 7 - 24i, observe that they have no prime factors in common, and conclude that they have no common factors. I'll work with 7 + 24i. The same arguments apply to 7 - 24i.

We know that [itex]7 + 24i = (4 + 3i)^2[/itex]. Is 4 + 3i prime? No, as some quick calculations show that [itex]4 + 3i = -i(1 + 2i)^2[/itex]. Is 1 + 2i prime? Yes. Here's the proof:

Suppose that 1 + 2i = (a + bi)(c + di) with neither factor a unit in [itex]\mathbb{Z}[/itex] and a, b, c, d all integers. Taking the norm of both sides of the equality, we see that

[tex]N(1 + 2i) = 5 = (a^2 + b^2)(c^2 + d^2)[/tex]

It's obvious that the only solutions to this equation imply that one of the factors a + bi or c + di is a unit, contrary to assumption. Therefore, 1 + 2i is prime in [itex]\mathbb{Z}[/itex]. Putting this together, we have

[tex]7 + 24i = (4 + 3i)^2 = [-i(1 + 2i)^2]^2 = -(1 + 2i)^4[/tex]

and similarly

[tex]7 - 24i = -(1 - 2i)^4[/tex].

After checking that 1 + 2i and 1 - 2i aren't associates, we can conclude that [itex]\alpha[/itex] and [itex]\bar \alpha[/itex] have no common factors.


Thank you Petek, the breakdown was very thorough and simple to follow.
 

Related to Understanding UFD's with Quadratic Integer & Norm Questions

1. What is a UFD?

A UFD, or unique factorization domain, is a type of mathematical structure where every element can be expressed as a unique product of prime elements. In other words, there is only one way to break down a number into its prime factors.

2. What are quadratic integers?

Quadratic integers are numbers that can be expressed in the form a + bi, where a and b are integers and i is the imaginary unit (√-1). These numbers have properties similar to regular integers, but they also have a unique set of algebraic properties.

3. What is the norm of a quadratic integer?

The norm of a quadratic integer is a function that maps a quadratic integer to its corresponding real number. It can be thought of as the "size" or "magnitude" of a quadratic integer. The norm of a quadratic integer is calculated by taking the product of the quadratic integer and its complex conjugate.

4. How do I determine if a quadratic integer is a UFD?

To determine if a quadratic integer is a UFD, you can use the fundamental theorem of arithmetic, which states that every positive integer can be expressed as a unique product of prime numbers. If a quadratic integer follows this same principle, then it is a UFD.

5. Why is understanding UFDs with quadratic integers important?

Understanding UFDs with quadratic integers has many applications in number theory, algebra, and cryptography. It allows for efficient factorization and can be used to solve complex mathematical problems. Additionally, it has practical applications in encryption and coding theory.

Similar threads

Replies
7
Views
927
  • Precalculus Mathematics Homework Help
Replies
20
Views
1K
  • Precalculus Mathematics Homework Help
Replies
12
Views
2K
  • Advanced Physics Homework Help
Replies
19
Views
1K
  • Precalculus Mathematics Homework Help
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
20
Views
4K
  • Linear and Abstract Algebra
Replies
9
Views
3K
Replies
4
Views
2K
Replies
23
Views
5K
  • Linear and Abstract Algebra
Replies
1
Views
1K
Back
Top