logo

Division Theorem Proof 📂Abstract Algebra

Division Theorem Proof

Theorem 1

Given an0a_{n} \ne 0 and bm0b_{m} \ne 0, as well as n>m>0n > m > 0, let the two elements of F[x]F [ x ] be f(x)=anxn++a1x+a0g(x)=bmxm++b1x+b0 f(x) = a_{n} x^{n} + \cdots + a_{1} x + a_{0} \\ g(x) = b_{m} x^{m} + \cdots + b_{1} x + b_{0} . Then, there exists a unique q(x),r(x)F[x]q(x), r(x) \in F [ x ] that satisfies f(x)=g(x)q(x)+r(x)f(x) = g(x) q(x) + r(x). The degree of rr is less than that of mm.

Explanation

This fact doesn’t necessarily require a theorem but holds significant value in its algebraically rigorous proof.

Proof

Let’s set S:={f(x)g(x)s(x) : s(x)F[x]} S : = \left\{ f(x) - g(x) s(x) \ : \ s(x) \in F [ x ] \right\} . Saying 0S0 \in S means that there exists s(x)s(x) satisfying f(x)g(x)s(x)=0f(x) - g(x) s(x) = 0. In this case, simply setting q(x)=s(x)q(x) = s(x) and r(x)=0r(x) = 0 suffices, and it’s also necessary to check other conditions for consistency.


Part 1. Existence

Let’s name the polynomial with the lowest degree in SS as r(x)r(x). Essentially, this means for some q(x)=s(x)q(x) = s(x), it’s r(x)=f(x)g(x)s(x)r(x) = f(x) - g(x) s(x).

Assuming that r(x):=ctxt++c1x+c0r(x) := c_{t} x^{t} + \cdots + c_{1} x + c_{0} equates to tmt \ge m, f(x)q(x)g(x)ctbmxtmg(x)=r(x)ctbmxtmg(x)=r(x)ctbmxtm(bmxm++b1x+b0)=r(x)ctxtctbmxtm(bm1xm1++b1x+b0) \begin{align*} & f(x) - q(x) g(x) - {{c_{t}} \over {b_{m}}} x^{t-m} g(x) \\ =& r(x) - {{c_{t}} \over {b_{m}}} x^{t-m} g(x) \\ =& r(x) - {{c_{t}} \over {b_{m}}} x^{t-m} \left( b_{m} x^{m} + \cdots + b_{1} x + b_{0} \right) \\ =& r(x) -c_{t} x^{t} - {{c_{t}} \over {b_{m}}} x^{t-m} \left( b_{m-1} x^{m-1} + \cdots + b_{1} x + b_{0} \right) \end{align*} Therefore, the degree of f(x)q(x)g(x)ctbmxtmg(x)\displaystyle f(x) - q(x) g(x) - {{c_{t}} \over {b_{m}}} x^{t-m} g(x) is less than that of tt. However, f(x)[q(x)+ctbmxtm]g(x)S f(x) - \left[ q(x) + {{c_{t}} \over {b_{m}}} x^{t-m} \right] g(x) \in S implies a contradiction to the assumption that r(x)r(x) has the smallest degree among the polynomials in SS.


Part 2. Uniqueness

Assuming q1q2q_{1} \ne q_{2} and r1r2r_{1} \ne r_{2} equate to {f(x)=g(x)q1(x)+r1(x)f(x)=g(x)q2(x)+r2(x)\begin{cases} f(x) = g(x) q_{1} (x) + r_{1} (x) \\ f(x) = g(x) q_{2} (x) + r_{2} (x) \end{cases} and subtracting one from the other gives g(x)[q2(x)q1(x)]=r2(x)r1(x) g(x) [ q_{2}(x) - q_{1}(x) ] = r_{2}(x) - r_{1}(x) Since the degree of r2(x)r1(x)r_{2}(x) - r_{1}(x) is less than that of g(X)g( X), it must be q2q1=0q_{2} - q_{1} = 0. Therefore, this contradicts the assumption, as it implies r2(x)r1(x)=0r_{2}(x) - r_{1}(x) = 0.


  1. Fraleigh. (2003). A first course in abstract algebra(7th Edition): p210. ↩︎