91Ó°ÊÓ

The norm of a Gaussian integer is a fundamental concept when working with these complex integers. A Gaussian integer is expressed in the form \(a + bi\), where \(a\) and \(b\) are both integers and \(i\) is the imaginary unit with the property \(i^2 = -1\). The norm, denoted \(N(a + bi)\), is defined as \(a^2 + b^2\). This takes the real part squared plus the imaginary part squared, giving a real number. The norm is never negative and can be thought of as a measure of distance or size. It's crucial because it helps us determine divisibility and find factors, especially when exploring factorizations in \(\mathbb{Z}[i]\). For instance, for the Gaussian integer \(4 + 3i\), the norm is calculated as follows: \[N(4+3i) = 4^2 + 3^2 = 16 + 9 = 25.\] This norm plays an important role in identifying potential factors that are irreducible in the context of Gaussian integers.

In the realm of Gaussian integers, understanding irreducible factors is key to mastering factorization. An irreducible factor is a Gaussian integer that cannot be factored further within the set \(\mathbb{Z}[i]\), except by units (\(1, -1, i, -i\)) and itself. Determining which integers are irreducible requires examining their norms. Specifically, an irreducible factor must have a norm greater than \(1\) and must divide the norm of the original Gaussian integer we're interested in factoring.

For example, in factoring \(4+3i\), we found the norm to be \(25\). This tells us that any irreducible factor must either have a norm of \(5\) (since \(25\) factors as \(5 \times 5\)) or an equivalent associated prime norm. In Gaussian integers, primes like \(2+i\), \(2-i\), \((-2)+i\), and \((-2)-i\) all possess a norm of \(5\). To confirm irreducibility, divide the original integer by these candidates and check if the quotient remains in \(\mathbb{Z}[i]\). Only then can we claim these factors as irreducible in Gaussian integers.

Factorization in \(\mathbb{Z}[i]\), or the set of Gaussian integers, involves breaking down a Gaussian integer into its irreducible components. This process is analogous to factoring integers into prime numbers but involves some complexity due to the presence of imaginary components. The objective is to express any given Gaussian integer as a product of irreducible factors. To do this effectively, one should first compute the norm of the original integer, as it provides a bound for possible factors.

Taking \(4+3i\) as an example, its norm is \(25\). Possible irreducible factors need a norm that divides \(25\) and is greater than \(1\). By attempting divisions using Gaussian primes such as \(1+2i\), one might discover that it divides \(4+3i\) without leaving a remainder outside \(\mathbb{Z}[i]\). This valid division leads to factorization: \(4+3i = (1+2i)(2-i)\). Both \(1+2i\) and \(2-i\) are irreducible, confirming the successful factorization. This simplification into only non-further-factored Gaussian primes showcases the utility and necessity of understanding norms and irreducibility for effective factorization in \(\mathbb{Z}[i]\).