Questions: Fundamental Theorem of Algebra (Complex-Analytic Proof)

Question 1

Over the real numbers, the equation x² + 1 = 0 has no solutions. Over the complex numbers, it has solutions. What does this difference illustrate about the complex numbers as an algebraic structure?

• A. Complex numbers include irrational numbers that real numbers lack
• B. The complex numbers are algebraically closed: every non-constant polynomial has at least one complex root, so no polynomial equation forces you beyond ℂ to find a solution
• C. Complex numbers allow negative numbers to have square roots only when the polynomial has degree 2
• D. The complex plane's two-dimensional structure provides geometrically more space for roots to exist

Answer: (B)

Algebraic closure is the key property: ℂ is complete for polynomial algebra in the sense that no non-constant polynomial can be constructed whose roots require 'new' numbers beyond the complex numbers. Over ℝ, you can write equations with no real solutions (x² + 1 = 0), which historically motivated the invention of complex numbers. The Fundamental Theorem of Algebra proves that this process terminates at ℂ — you never need to go further.

Question 2

In the complex-analytic proof of the Fundamental Theorem of Algebra, what is the role of Liouville's theorem?

• A. Liouville's theorem shows that every polynomial of degree n has exactly n roots by induction on degree
• B. Liouville's theorem guarantees that 1/p(z), assumed entire under the no-roots hypothesis, must be constant — producing the contradiction that p itself would be constant
• C. Liouville's theorem establishes that polynomials are entire functions, making 1/p well-defined wherever p ≠ 0
• D. Liouville's theorem is used to construct the actual root by finding the minimum of |p(z)| on a large disk

Answer: (B)

The proof proceeds by contradiction. Assume p has no roots; then 1/p is entire (everywhere defined) because p is never zero. Since |p(z)| → ∞ as |z| → ∞, we have |1/p(z)| → 0, so 1/p is bounded. Liouville's theorem then forces 1/p to be constant, which means p is constant — contradicting the assumption that p is non-constant. Liouville is the engine that converts boundedness into constancy, making the contradiction possible.

Question 3

The complex-analytic proof of the Fundamental Theorem of Algebra establishes the existence of a root without explicitly constructing it.

• T. True
• F. False

Answer: True

This is a pure existence proof by contradiction. The argument assumes no root exists, derives a contradiction via Liouville's theorem, and concludes a root must exist — but at no point does it produce the root's location or value. This is characteristic of many complex-analytic results: the rigidity of analytic functions allows existence to be forced by global properties (boundedness, entirety) without local construction.

Question 4

An analogous proof of the Fundamental Theorem of Algebra works over the real numbers, using the real version of Liouville's theorem — that nearly every bounded differentiable function on ℝ should be constant.

• T. True
• F. False

Answer: False

There is no real analogue of Liouville's theorem in the relevant sense. Over ℝ, bounded differentiable functions need not be constant — sin(x) is bounded and differentiable on all of ℝ but is not constant. The proof requires the much stronger rigidity of complex differentiability: a bounded entire function on ℂ must be constant, a fact with no real counterpart. This is why the proof requires ℂ and cannot be reproduced within real analysis.

Question 5

Walk through the logical structure of the complex-analytic proof of the Fundamental Theorem of Algebra: what assumption is made, what does Liouville's theorem then force, and why does this produce a contradiction?

Model answer: Assume for contradiction that p(z) has no zeros anywhere in ℂ. Then 1/p(z) is defined everywhere (entire), since p is never zero. Because p has degree n ≥ 1, |p(z)| → ∞ as |z| → ∞, which means |1/p(z)| → 0 — so 1/p is bounded on the entire complex plane. Liouville's theorem states that every bounded entire function is constant. Therefore 1/p must be constant, which implies p itself is constant. But this contradicts the assumption that p is a non-constant polynomial. Therefore the assumption is false: p must have at least one root.

The elegance of the proof lies in what it uses: not a direct construction, but a global property (boundedness) combined with the remarkable rigidity of holomorphic functions (Liouville). The inductive step — getting from 'at least one root' to 'exactly n roots' — follows from polynomial division: factor out (z − z₁) and apply the argument inductively to the degree-(n−1) quotient.