Math Problem Statement

Suppose p,q \in P(\mathbb{C}) are nonconstant polynomials with no zeros in common. Let r \in P_{n-1}(\mathbb{C}) and s \in P_{m-1}(\mathbb{C}). Let m = deg(p) and n = deg(q). Define T : P_{n-1}(\mathbb{C}) \times P_{m-1}(\mathbb{C}) \rightarrow P_{m+n-1}(\mathbb{C}) by T(r,s) = rp + sq. Show that the linear map T is injective and surjective.

Solution

To show that the linear map T:Pn1(C)×Pm1(C)Pm+n1(C)T : P_{n-1}(\mathbb{C}) \times P_{m-1}(\mathbb{C}) \to P_{m+n-1}(\mathbb{C}), defined by T(r,s)=rp+sqT(r, s) = rp + sq, is injective and surjective, we proceed as follows:


1. Definitions and Notations

  • Pk(C)P_k(\mathbb{C}): the space of polynomials with complex coefficients of degree at most kk.
  • deg(p)=m\deg(p) = m, deg(q)=n\deg(q) = n, with m,n1m, n \geq 1.
  • pp and qq are nonconstant polynomials with no common roots.

Injectivity

We need to show that T(r,s)=0T(r, s) = 0 implies r=0r = 0 and s=0s = 0.

Proof:

  1. Suppose T(r,s)=rp+sq=0T(r, s) = rp + sq = 0.
  2. Since rprp and sqsq are multiples of pp and qq, respectively, the roots of pp and qq impose constraints:
    • rprp has all roots of pp, and sqsq has all roots of qq.
    • Because pp and qq have no common roots, rprp and sqsq have disjoint sets of roots.
  3. The equality rp+sq=0rp + sq = 0 implies that rprp and sqsq must both be zero since their roots are disjoint.
    • For rp=0rp = 0, since pp is nonconstant, r=0r = 0.
    • For sq=0sq = 0, since qq is nonconstant, s=0s = 0.
  4. Hence, r=0r = 0 and s=0s = 0.

Thus, TT is injective.


Surjectivity

We need to show that for any polynomial hPm+n1(C)h \in P_{m+n-1}(\mathbb{C}), there exist rPn1(C)r \in P_{n-1}(\mathbb{C}) and sPm1(C)s \in P_{m-1}(\mathbb{C}) such that T(r,s)=rp+sq=hT(r, s) = rp + sq = h.

Proof:

  1. Let hPm+n1(C)h \in P_{m+n-1}(\mathbb{C}). We aim to solve rp+sq=hrp + sq = h for rPn1(C)r \in P_{n-1}(\mathbb{C}) and sPm1(C)s \in P_{m-1}(\mathbb{C}).
  2. The degrees of rprp and sqsq are as follows:
    • deg(rp)n1+m=m+n1\deg(rp) \leq n-1 + m = m+n-1.
    • deg(sq)m1+n=m+n1\deg(sq) \leq m-1 + n = m+n-1.
  3. Therefore, rp+sqrp + sq has degree at most m+n1m+n-1, matching the degree of hh.
  4. Construct a basis for Pm+n1(C)P_{m+n-1}(\mathbb{C}) using the bases of Pn1(C)P_{n-1}(\mathbb{C}) and Pm1(C)P_{m-1}(\mathbb{C}):
    • Let {1,x,,xn1}\{1, x, \dots, x^{n-1}\} be the basis for Pn1(C)P_{n-1}(\mathbb{C}).
    • Let {1,x,,xm1}\{1, x, \dots, x^{m-1}\} be the basis for Pm1(C)P_{m-1}(\mathbb{C}).
  5. By choosing appropriate coefficients rr and ss, any polynomial hh can be written as a linear combination of rprp and sqsq. This follows from the fact that pp and qq have no common roots, ensuring that their contributions are linearly independent.

Thus, TT is surjective.


Conclusion

Since TT is both injective and surjective, it is a linear isomorphism. This establishes the result.


Would you like further clarifications or examples? Here are some related questions to explore:

  1. What are the implications of pp and qq having no common roots in this problem?
  2. How does the degree constraint on rr and ss affect the proof of surjectivity?
  3. Can the result extend to polynomials over other fields, like R\mathbb{R} or Q\mathbb{Q}?
  4. What happens if pp and qq do share a common root? How does it affect TT?
  5. How does the structure of TT depend on the choice of basis for the polynomial spaces?

Tip: When proving injectivity, always ensure the disjoint nature of constraints imposed by linearly independent terms!

Ask a new question for Free

By Image

Drop file here or Click Here to upload

Math Problem Analysis

Mathematical Concepts

Linear Algebra
Polynomial Spaces
Injective and Surjective Functions

Formulas

T(r, s) = rp + sq
Degree constraints: \deg(rp) \leq m+n-1, \deg(sq) \leq m+n-1

Theorems

Injectivity Criterion: If T(x) = 0 implies x = 0, T is injective.
Surjectivity Criterion: For any y in the target space, there exists x in the domain such that T(x) = y.

Suitable Grade Level

Graduate Level (Advanced Mathematics)