Questions about proof of the division article.

Click For Summary
SUMMARY

The discussion centers on the proof of the division algorithm for polynomials, specifically addressing the theorem that states for polynomials f and g in R[X], there exist unique polynomials q and r such that f = gq + r with deg(r) < deg(g). The user questions the setting of q = a_m/b_m in the base case when the degrees of f and g are equal. Another user clarifies that in this case, q is a constant rather than a polynomial function. Additionally, the discussion touches on the induction step and the transformation of f into f_1, which relates to the long division process of polynomials.

PREREQUISITES
  • Understanding of polynomial functions in R[X]
  • Familiarity with polynomial division and the concept of degrees
  • Knowledge of mathematical induction
  • Basic algebraic manipulation of fractions and polynomials
NEXT STEPS
  • Study the concept of polynomial long division in detail
  • Learn about mathematical induction and its applications in proofs
  • Explore the properties of polynomial degrees and their implications in algebra
  • Review examples of the division algorithm for polynomials in R[X]
USEFUL FOR

Mathematics students, educators, and anyone interested in understanding polynomial algebra and the division algorithm in depth.

Dafe
Messages
144
Reaction score
0
(Thread should be named: Question about proof of the division algorithm, sorry about that)
Hi,

I am reading this proof of the division article:
http://xmlearning.maths.ed.ac.uk/lecture_notes/polynomials/division_algorithm/division_algorithm.php"

I will write some of it here in case you don't want to click on any links.
Theorem: Let [tex]f,g \in R[X][/tex] be polynomials with [tex]g \neq[/tex].
Then there exist unique polynomials [tex]q,r \in R[X][/tex] such that [tex]f=gq+r[/tex] and [tex]deg(r)<deg(g)[/tex].

Proof: We first prove existence of [tex]q,r[/tex].
If [tex]deg(g)>deg(f)[/tex] then we set [tex]q=0[/tex] and [tex]r=f[/tex].
Otherwise, [tex]deg(f) \geq deg(g)[/tex]

Let,
[tex]f=a_0+...+a_mX^m[/tex] where [tex]a_m \neq 0[/tex].
and
[tex]g=b_0+...+b_nX^n[/tex] where [tex]b_n \neq 0[/tex].

Define the integer [tex]d=m-n \geq 0[/tex]. We will use induction in [tex]d[/tex].

Base step: Let [tex]d=0[/tex], then [tex]m=n[/tex]. We set [tex]q=\frac{a_m}{b_m}[/tex].

I will stop there.
How come they set [tex]q=\frac{a_m}{b_m}[/tex]?
Since [tex]f(x)=q(x)g(x)+r(x)[/tex] isn't then
[tex]q(x)=\frac{f(x)}{g(x)} - \frac{r(x)}{g(x)}[/tex] ?

Thank you for your time.
 
Last edited by a moderator:
Physics news on Phys.org
Dafe said:
(Thread should be named: Question about proof of the division algorithm, sorry about that)
Hi,

I am reading this proof of the division article:
http://xmlearning.maths.ed.ac.uk/lecture_notes/polynomials/division_algorithm/division_algorithm.php"

I will write some of it here in case you don't want to click on any links.
Theorem: Let [tex]f,g \in R[X][/tex] be polynomials with [tex]g \neq[/tex].
Then there exist unique polynomials [tex]q,r \in R[X][/tex] such that [tex]f=gq+r[/tex] and [tex]deg(r)<deg(g)[/tex].

Proof: We first prove existence of [tex]q,r[/tex].
If [tex]deg(g)>deg(f)[/tex] then we set [tex]q=0[/tex] and [tex]r=f[/tex].
Otherwise, [tex]deg(f) \geq deg(g)[/tex]

Let,
[tex]f=a_0+...+a_mX^m[/tex] where [tex]a_m \neq 0[/tex].
and
[tex]g=b_0+...+b_nX^n[/tex] where [tex]b_n \neq 0[/tex].

Define the integer [tex]d=m-n \geq 0[/tex]. We will use induction in [tex]d[/tex].


Base step: Let [tex]d=0[/tex], then [tex]m=n[/tex]. We set [tex]q=\frac{a_m}{b_m}[/tex].

I will stop there.
How come they set [tex]q=\frac{a_m}{b_m}[/tex]?
Since [tex]f(x)=q(x)g(x)+r(x)[/tex] isn't then
[tex]q(x)=\frac{f(x)}{g(x)} - \frac{r(x)}{g(x)}[/tex] ?

Thank you for your time.
In this "base case", d= 0, the two polynomials have the same degree and so their quotient is a number, not a function of x. For example, if [itex]f(x)= ax^2+ bx+ c[/itex] and [itex]g(x)= ex^2+ fx+ g[/itex] then
[tex]\frac{ax^2+ bx+ c}{ex^2+ fx+ g}[/tex]
is just the number a/e with a first degree remainder.
 
Last edited by a moderator:
Thank you :blushing:

One more question (kind of the same):
The article goes on with the induction step:

Now we assume that this is true whenever [tex]d<k[/tex] and let [tex]d=k[/tex], so that
[tex]m=n+k[/tex]. Let [tex]f_1=f-(\frac{a_m}{b_n}x^{m-n}g)[/tex].

I do not understand this last step.
Since [tex]\frac{a_m}{b_n}x^{m-n}[/tex] would be the first step of long division, does [tex]f_1[/tex] somehow refer to this?

Feeling quite stupid here. Good thing it's Christmas soon, will drown my sorrows in food and drink.

Thanks again!
 

Similar threads

Replies
48
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
11
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K