21.2.1. Proof of Roots Upper Bound

Now based on this factor theorem what we define is the root of a polynomial. So, a value α from the field will be considered as the root of this equation f(x) = 0 where f(x) is a polynomial over the field provided the polynomial evaluated at α gives you the value 0 over the field.

In this chunk, we're introduced to the concept of a polynomial root. Specifically, a root is a value α from a certain number field that solves the equation f(x) = 0. This means that when we plug in α into the polynomial f(x), the output must be zero. This definition extends the familiar idea of roots that we already learn about in elementary algebra.

Think of roots like the solutions to a puzzle where the goal is to reach a certain point—zero in this case. Just like finding the right combination of numbers in a safe to unlock it, identifying a root means inserting the correct value into the polynomial to reach exactly zero.

Now the next question is that how many roots I can have if my polynomial has degree n, so I can prove a familiar result. So, we know that for the regular polynomials if we have degree n then it can have at most n roots in the same way I can show that if my polynomial is over a field then this equation f(x) = 0 can have at most n roots.

This part discusses how many roots a polynomial can have based on its degree n. For any polynomial of degree n, it is known that there can be at most n roots. This holds true for polynomials over fields as well, which means the behavior of polynomials can be generalized across different number systems.

Imagine a box with n compartments. If the number of items you can fit in the box is equal to the number of compartments, you cannot have more than n items in the box. Similarly, a polynomial can have as many roots as it has degrees but cannot exceed that number.

Now imagine that α1 to αm are the roots of your equation f(x) = 0. And we want to show that m is less than equal to n upper bounded by n that is my goal.

Here, we consider m roots (α1, α2,..., αm) of the polynomial f(x). The goal is to demonstrate that the number of these roots, m, cannot exceed n, which is the degree of the polynomial. This statement stems from the factors introduced by the roots as outlined by the factor theorem.

Think of a class of 30 students; if you organize them into groups based on their homework scores, you can only create as many groups as there are scores, which is equivalent to the highest unique score (like the degree of a polynomial). You can’t have more groups than unique scores.

Since αα each of them is a root I know that the f polynomial evaluated at α1, f polynomial evaluated at α2,... all of them will give you the value 0 over the field.

This chunk explains the consequence of having roots. Since each αi is a root, when evaluated in the polynomial f(x), it yields zero. This leads us to conclude that each polynomial corresponding to the roots (like (x - α1), (x - α2),...) can be considered divisors of f(x) as supported by the factor theorem.

Imagine a team of chefs, where each chef specializes in turning a particular recipe into a dish. If each chef's dish (root) is made correctly, they are all part of the final dinner (the whole polynomial). When each dish is done right, the dinner is perfectly cooked (evaluated to zero).

An important thing to notice here is that each of these polynomials (x - α1), (x - α2),..., they are irreducible polynomials because they are already any how polynomials of degree 1.

This emphasizes that the factors derived from the roots (of degree 1) are irreducible polynomials. Each root contributes a degree of 1 to the overall polynomial f(x). Therefore, if we write f(x) in terms of its factors, the total degree must equal n.

Consider a set of toy blocks, where each block can stand alone as a piece of art (degree 1). If you want to build a structure (the polynomial), the number of blocks needs to match the height of the tower (the total degree). The height of the tower can’t exceed the number of blocks available.

So, now I can say that definitely n is greater than equal to m which is what I wanted to show because each of these factors contribute 1 to the overall degree of f(x) which is n.

Finally, this concludes the proof, confirming that the maximum number of roots that a polynomial can contain (m) does not exceed its degree (n). This fundamental result is vital in understanding polynomial behavior.

This can be likened to a race where the number of finishers (roots) cannot exceed the total number of starting lanes (degree). Even if all racers start strong, the number of lanes limits how many can finish.

--