Gelfand: Chunk 14 - Polynomial Division

February 23, 2017

A Quick Note - Monomial Degrees

This concept actually is a very simple one Unlike some seemingly simple concepts which in fact turn out to be nebulously nightmarish.

It is however, a fundamental one, hence why I’ve chosen to highlight it. Why fundamental? Because in order to bootstrap your mind into the next set of chunks, you’ll need to be able to snap your fingers at any time and point to the degree of a given monomial (and thence the entire polynomial to which it belongs).

So what is the degree of of a monomial? Here it is, in textual form first:From Gelfand pp 61

“If a polynomial contains only one variable, it’s standard form consists of it’s monomials written in order of decreasing degrees. The monomial having the highest degree is called the ‘first monomial’. It’s degree is called the ‘degree of the polynomial.”

Now let’s break this into pieces and show it visually

Firstly “… a polynomial contains only one variable…” - i.e. “”. That means meets this criteria, as does but does not.

Secondly “Standard Form” - We discussed this at length in Chunk 8 - ‘Nomials. I added at the time that it was nice to order things decreasing by degree. That’ll be helpful in the next step. This also means that while and are equivalent, but only the latter is in Standard Form.

Third “the monomial having the highest degree is called the ‘first monomial’” - See the reason for ordering? It will literally be the first monomial in your polynomial if you’ve done this. Therefore in the first monomial is , and in the first monomial is .

Finally “it’s degree (the first monomial) is called the ‘degree of the polynomial’” - That means that in the degree is , and in the degree is .

A First Subtlety - Constants

What if there are no variables? (N.b. this is just equivalent to a polynomial where all variables have co-efficients of value ). In these circumstances, your degree is too.

Remember

A Second Subtlety - Undefined Degrees

What about monomials with zero-co-efficients? (I.e. with a co-efficient of ). These monomials are ignored, and their degrees (the monomials) are “undefined” (which means you may then fall back on the degree of a constant).

Extending the example we just saw

Degree Consequences

With all this in place, things start to get useful.If also a bit meta Via the medium of problems,Problems 137 and 138 Gelfand gets us to realise the following rules:

Tricks Arising

You Can Represent a Whole Polynomial as a Single Variable

This powerful concept was snuck in by Gelfand in his further discussions of Rational ExpressionsSection 34, pp 56-57 but he didnt ask you to manipulate them in any way so I didn’t bring them up until now. However, in problem 137 you have to make this mental leap for yourself.

It looks a little scary,Not so much perhaps for programmers who are used to multiple levels of abstraction but it’s fine. Go on, nothing’s stopping you.

This means that we can take and replace it with . But remember, is a variable too. We’ve specified that is “any polynomial with degree ” so could just as easily represent or even . It couldn’t however represent , nor could it represent as these don’t meet the criteria for being an . The degree here is key for us as we’ve specified it in our -rules.And for this they must be a polynomial in one variable - though I’m a little shaky on this, perhaps polynomials in multiple variables have multiple degrees, I’ll come back here if I’m wrong and update this.

See now why I said grokking degrees solidly was handy?

N.b. Durham does this a lot in his later solutions, so it’s worth getting comfortable with it before progressing.

Proper and Improper Fractions

Fractions again. Urgh. And it turns out they get even more complicated with the concepts of “proper” and “improper” ones. Luckily, this is super-easy to grokk.And not much harder to commit to memory.

As we’re building on previous blocks again mathematicians have come up with a nice short-hard to flag if a fraction really is just a fraction or if it is in fact a whole number and a fraction.

If something is just a fraction then the numeratorThe bit on the top. will be smaller than the denominator.The bit on the bottom.

If something is a whole number and a fraction then the numerator will be greater than or equal to the denominator.

Any improper fraction can therefore simply be broken out into a whole number, and the remaining proper fraction. It’s what you get from long division in factThe one you know from school, and that we revised in Chunk 1 - Fundamentals.

Proper and Improper and Fractions and Polynomials

What happens when you divide two polynomials in one variable? It’s the same as regular numbers. You can have improper and improper fractions, and you can convert the former to the latter in the same way.

You can use a very similar method to do the work of division too, using a form of the long-division algorithm. There is even a definitionThe first of these that we come across in Gelfand if I recall correctly.

Assume that we have two polynomials (both in the same, single variable), called the dividend and the divisior. To perform a division means to find two other polynomials , called the quotient and the remainder such that (dividend) = (quotient).(divisor) + remainder) where the degree of the remainder is less than the degree of the degree of the divisor (or is zero)

For super-clarity,

Polynomial Division - Worked Examples

Given my history, the very concept of “Polynomial Division” sounded horrifing to me when I first thought if it, but compared to the actual physical pain that factoring can cause you this is actually a nice return to the world of mechanistically applying a set of steps to something to achive an end result. Nice.

Now we have all the elements in place to dive into this, lets see a few worked examples, taken from Gelfand, but with more inline explanation than might to help things embed mentally.Props by the way to Davide Cervone for his very handy answer on the tex.stackexchange.com forums.

Example from Page 63

Which means our answer is

Which is the way things are stated in the definition above.

For some of you there might be enough in the above to work things through. But it’s nice to pull out the key steps. We start with our divisor () and our dividend (). We then repeat the following steps, again and again to slowly reveal our quotient, and eventually distill out our remainder.

We begin by getting our , and to do this we need to multiply enough to get this. We can get there by multiplying it by . That gives us . We put our up atop everything as the first part of our quotient. (I’ve tried to lay things out as nicely as Gelfand does to keep all this clean. The final step is to then see what we have left of our dividend, and we get this by subtracting from

From this point on it’s just rinse and repeat. Your new dividend is .

I’ll work through the next two in sub-Gelfand detail too.

First Example from Page 64

The difference between this one and the example before is that the subtractions to get the remaining dividend are a little more complicated. Not much though. I’ve tried to push the right a bit in the example above so the columns stay lined up and you can follow things through.

Second Example from Page 64

As previously, here’s the deeply-worked example first.

So what’s interesting here? This time we’ve had to jump through fraction-hoops a little to get the pieces we want. It looks complicated, but if we pull out the first one for you and show you it in isolation, all should become a lot clearer.

OK, so we need to get an , and we have . What do we need to do to the latter, to get some of the former? Half it then multiply by , or in other words, multiply by .

If you take this method and work it all the way through the rest of the example (perhaps moving things to one side to figure things out in this way) it should all fall into place.

Commentary - The “Important Things to Notice” Problems

As is his way, Gelfand closes out the section with some semi-abstract problems to which you are supposed to have “ah-ha!” moments. I know to my detrimentI’m not re-reading his book, blogging it as I go for no reason. that you misapprehendOr heaven-forbid skip. these at your peril. So what are we supposed to grok here?

The Relationships Between Degrees

This is covered in Problems 140 and 142. There are some “Laws” hidden in there; things that always hold true, and which, no doubt, will be relied upon in a higher algebraic-storey which builds upon them.

The laws are as follows:

Firstly, if the degree of the dividend is larger than the degree of the divisor the degree of the quotient will clearly be the degree of the dividend polynomial minus the degree of the divisor polynomial. The degree of the remainder may then be undefined (there is no remainder) or it may be anywhere from to (where is the degree of the quotient).

Secondly if, on the other hand, the degree of the dividend is smaller than the degree of the divisor, the fraction is already proper. In this case the quotient is equal to zero and the remainder is equal to the dividend.

The Uniqueness of Resulting Quotients and Remainders

This is covered in Problem 141. The aim here is for Gelfand to show us that the quotient and remainders which we produced via the method he outlinedAnd which I’ve gone into more detail on in the majority of this post. are unique. That is to say, the quotient produced is the only quotient in the circumstances, and the remainder is the only remainder.

That’s actually quite reassuring, especially having just come from Factoring-land where you’re never quite sure if there’s something else just around the corner to find, if only you were a bit better at all that stuff…

The way Gelfand proves it is pretty interesting too.Sometimes the method is as important as the end result, and you’re supposed to be always paying attention. The following things are of note:

Firstly, he’s gone all meta, representing polynomials in a single variable as individual variables againWith capital letters again too - I smell a convention here…

Secondly the variables he uses are actually quite simple. is the dividend, is the divisor, is the quotient and is the remainder. If and have such intuitive names, why then have and ? I could thrown up my hands and exclaim “mathematicians” but remember, both the others start with “D”, and and do make a nice alphabetical run…

Thirdly, the formula is simple too.It even works for non-polynomial division. Any number () is equal to two other numbers multiplied by each other ( the quotient and the divisor) and a remainder ()

Finally, the approach to the proof is to begin by making an assumption (in this case that there might be more than one Quotient, and , and more than one Remainder, and ) and then logically follow the implications of that assumption. In this case that and

Another Pseudo-Conclusion

We’re not really completely done with Polynomial Division. Gelfand has a few more tricks up his sleeve which I’ll cover next in Chunk 15 - Polynomial Division Addendum. But this is a good place to stop for now.

Gelfand: Chunk 14 - Polynomial Division - February 23, 2017 - {"name"=>"Andrew Harmel-Law", "github"=>"andrewharmellaw", "twitter"=>"al94781"}