Problem 9 - Algebra

Question

Let \(K\) be a field complete with respect to a discrete valuation, let o be the ring of integers of \(K\), and assume that o is compact. Let \(f_{1}, f_{2}, \ldots\) be a sequence of polynomials in \(n\) variables, with coefficients in o. Assume that all these polynomials have degree \(\leqq d\), and that they converge to a polynomial \(f\) (i.e. that \(\left|f-f_{i}\right| \rightarrow 0\) as \(i \rightarrow \infty\) ). If each \(f_{i}\) has a zero in 0 , show that \(f\) has a zero in o. If the polynomials \(f_{i}\) are homogeneous of degree \(d\), and if each \(f_{1}\) has a non-trivial zero in o, show that \(f\) has a non-trivial zero in o. [Hint: Use the compactness of o and of the units of o for the homogeneous case.]

Step-by-Step Solution

Answer

To prove that if each polynomial in the sequence has a zero in the ring of integers o, then the polynomial f also has a zero in o, we use the compactness of o. We find a convergent subsequence of zeros of the polynomials, and then show that the limit of this subsequence is a zero of f. If the polynomials are homogeneous of degree d and each has a non-trivial zero in o, we normalize these zeros by multiplying them with the units of o. Using the compactness of o and of the units of o, we find convergent subsequences for these normalized zeros and the corresponding units. Following a similar approach as before, we then show that f also has a non-trivial zero in o.

Step 1: Let \(x_i\) be a zero of the polynomial \(f_i\), i.e., \(f_i(x_i) = 0\) for all i. Since o is compact, there exists a convergent subsequence \(\{x_{i_k}\}\) of \(\{x_i\}\) such that \(x_{i_k} \to x_0\) as \(k \to \infty\). Now, for any \(\epsilon > 0\), there exists a positive integer \(N\) such that for all \(k, l \geq N\), we have \(\left| f_{i_k} - f \right| < \epsilon\) and \(\left| x_{i_k} - x_0 \right| < \epsilon\). Then, for all \(k \geq N\), we have \(\left| f(x_{i_k}) \right| = \left| f(x_{i_k}) - f_{i_k}(x_{i_k}) \right| \leq \left| f - f_{i_k} \right| \cdot \left| x_{i_k} - x_0 \right| < \epsilon^2\) As \(\epsilon\) was arbitrary, we have \(\left| f(x_{i_k}) \right| \to 0\) as \(k \to \infty\). Therefore, \(f(x_0) = 0\), so f has a zero in o. #Step 2: Proving that if the polynomials are homogeneous, and each has a non-trivial zero in o, then f also has a non-trivial zero in o#

Let's assume that \(f_i\) is a homogeneous polynomial of degree \(d\) for all i, and each \(f_i\) has a non-trivial zero \(x_i \in o\) with \(f_i(x_i) = 0\). We will use the compactness of o and of the units of o to show that f has a non-trivial zero in o. First, normalize the non-trivial zeros \(x_i\) by multiplying them with the units of o, which are also compact. Let \(u_i x_i\) be the normalized zeros of \(f_i\), where \(u_i \in o^*\) (the group of units of o). Then, the sequence \(\{u_i x_i\}\) is a sequence in the compact set \(o^n\). Since o is compact, there exist convergent subsequences \(\{u_{i_k} x_{i_k}\}\) and \(\{u_{i_k}\}\) such that \(u_{i_k} x_{i_k} \to u_0 x_0\) and \(u_{i_k} \to u_0\) as \(k \to \infty\). Now, for any \(\epsilon > 0\), there exists a positive integer \(N\) such that for all \(k, l \geq N\), we have \(\left| f_{i_k} - f \right| < \epsilon\) and \(\left| u_{i_k} x_{i_k} - u_0 x_0 \right| < \epsilon\). Then, for all \(k \geq N\), we have \(\left| f(u_{i_k} x_{i_k}) \right| = \left| f(u_{i_k} x_{i_k}) - f_{i_k}(u_{i_k} x_{i_k})\right|^d = \left| u_{i_k}^d \left( f(x_{i_k}) - f_{i_k}(x_{i_k})\right)\right| \leq \left| f - f_{i_k} \right| \cdot \left|u_{i_k}\right|^d \cdot \left| x_{i_k} \right|^d < \epsilon^d\) As \(\epsilon\) was arbitrary, we have \(\left| f(u_{i_k} x_{i_k}) \right| \to 0\) as \(k \to\infty\). Therefore, \(f(u_0 x_0) = 0\). Since \(f\) is a homogeneous polynomial, \(f(x_0)=u_0^d f(u_0 x_0)=0\). Thus, f has a non-trivial zero, \(x_0\), in o.

Step 2: Analyze the problem

To prove that if each polynomial in the sequence has a zero in the ring of integers o, then the polynomial f also has a zero in o, we use the compactness of o.

Step 3: Continue the calculation

We find a convergent subsequence of zeros of the polynomials, and then show that the limit of this subsequence is a zero of f.

Step 4: Continue the calculation

If the polynomials are homogeneous of degree d and each has a non-trivial zero in o, we normalize these zeros by multiplying them with the units of o.

Step 5: Arrive at the final answer

Using the compactness of o and of the units of o, we find convergent subsequences for these normalized zeros and the corresponding units.

Key Concepts

Compactness in Algebraic Structures

Compactness is an important concept in mathematical analysis and topology that can also be applied to algebraic structures such as rings and fields. Imagine compactness like a box that neatly contains and bounds all your other mathematical elements.
This box ensures that certain properties hold true within it. In our context, we're dealing with the compactness of the ring of integers, denoted as o, within a field that is complete with respect to a discrete valuation.

The magic of compactness here means that sequences within this structure have subsequences that converge to limits within the same structure. In simpler terms, if you have an infinite trend of values, compactness ensures that it doesn't "escape" into infinity, but instead it converges to some value inside your box.

• This property is crucial for proving the existence of zeros in polynomials.
• It guarantees convergence, which is key to demonstrating that limits exist in defined boundaries, like our ring o.

Hence, compactness becomes our ally in confirming that if each polynomial has a zero inside the ring o, then their limit does too.

Homogeneous Polynomials

Homogeneous polynomials have an exciting feature: they allow all terms to be multiplied by the same scalar factor to achieve the entire polynomial's value scaled by a power. This characteristic defines the "degree" of the polynomial, indicating how it behaves under scaling.

A polynomial is called homogeneous if each of its terms is of the same degree, that is, if you multiply each variable by a number, each term will change in a predictable, consistent fashion.

• For a homogeneous polynomial of degree d: if you replace each variable by any scalar multiple, the polynomial's entirety is scaled by that scalar raised to the power of d.
• This scaling property is integral in discussing non-trivial zeros within compact structures, ensuring that certain repeated patterns or effects occur, enabling easier simplification and solving techniques.

In algebraic structures where we handle fields complete with respect to a discrete valuation, homogeneous polynomials help in maintaining these transformation properties in detecting zeros, ensuring the presence of non-trivial zeros even in the limits.

Polynomial Convergence

Polynomial convergence is a concept that simplifies our understanding of limits when dealing with sequences of polynomials. Consider convergence as a way of ensuring that as we move further down a sequence, we approach a target point within the mathematical structure.

Here, we're discussing sequences of polynomials whose coefficients lie within the ring o, converging to a limit polynomial f as each element in the sequence becomes indistinguishably close to f.

• Each polynomial in the sequence undergoes a transformation, akin to how signals can dissipate as you get further from the source.
• For convergence, given any tiny "margin of difference," the polynomial sequence will ultimately produce elements closer to each other within this margin.

This convergence shows that if all polynomials in the sequence initially have zeros in the compact ring o, then their limit—the polynomial they converge to—will also have a zero within o, maintaining the integrity of algebraic operations across limits.