Division Theorem Proof
📂Abstract AlgebraDivision Theorem Proof
Theorem
Given an=0 and bm=0, as well as n>m>0, let the two elements of F[x] be
f(x)=anxn+⋯+a1x+a0g(x)=bmxm+⋯+b1x+b0.
Then, there exists a unique q(x),r(x)∈F[x] that satisfies f(x)=g(x)q(x)+r(x). The degree of r is less than that of m.
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]}.
Saying 0∈S means that there exists s(x) satisfying f(x)−g(x)s(x)=0. In this case, simply setting q(x)=s(x) and r(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 S as r(x). Essentially, this means for some q(x)=s(x), it’s r(x)=f(x)−g(x)s(x).
Assuming that r(x):=ctxt+⋯+c1x+c0 equates to t≥m,
===f(x)−q(x)g(x)−bmctxt−mg(x)r(x)−bmctxt−mg(x)r(x)−bmctxt−m(bmxm+⋯+b1x+b0)r(x)−ctxt−bmctxt−m(bm−1xm−1+⋯+b1x+b0)
Therefore, the degree of f(x)−q(x)g(x)−bmctxt−mg(x) is less than that of t. However,
f(x)−[q(x)+bmctxt−m]g(x)∈S
implies a contradiction to the assumption that r(x) has the smallest degree among the polynomials in S.
Part 2. Uniqueness
Assuming q1=q2 and r1=r2 equate to {f(x)=g(x)q1(x)+r1(x)f(x)=g(x)q2(x)+r2(x) and subtracting one from the other gives
g(x)[q2(x)−q1(x)]=r2(x)−r1(x)
Since the degree of r2(x)−r1(x) is less than that of g(X), it must be q2−q1=0. Therefore, this contradicts the assumption, as it implies r2(x)−r1(x)=0.
■