Quadratic equation/Advanced: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Barry R. Smith
(problem with numbers of square roots.)
imported>Todd Coles
No edit summary
 
(8 intermediate revisions by 3 users not shown)
Line 1: Line 1:
In [[mathematics]], or more specifically [[algebra]], a '''quadratic equation''' is one involving only [[polynomial]]s of the second degree. Quadratic equations are a common part of mathematical solutions to real-world problems in a huge variety of situations.  Fortunately, there exists a simple closed formula for finding the [[root_(mathematics)|root]]s of such an equation, the '''quadratic formula'''.
{{subpages}}
In [[mathematics]], or more specifically [[algebra]], a '''quadratic equation''' is one involving only [[polynomial]]s of the second degree. Quadratic equations are a common part of mathematical solutions to real-world problems in a huge variety of situations.  Quadratic equations occurring in applications typically involve [[real number]] [[coefficient]]s.
However, one can algebraically manipulate polynomial equations in the usual way as long as the coefficients can be added  and multiplied together.  Please see the [[quadratic equation|main page]] for a discussion of polynomials with real coefficients.


Quadratic equations occurring in applications typically involve [[real number]] [[coefficient]]s.  However, one can manipulate polynomials in the usual way as long as the coefficients can be added  and multiplied together.  Please see the [[quadratic equation|main page]] for a discussion of polynomials with real coefficients.
The most general mathematical context that deals with systems of objects that can be added and multiplied together is [[ring (mathematics)|ring]] theory.  One can define polynomials, and in particular quadratic polynomial equations, as long as the coefficients are in a ring.  The real numbers is an example of a ring.  Another example, important in [[coding theory]], is polynomials with coefficients in the ring <math>\mathbb{Z}_2 = \{ \, \overline{0}, \overline{1} \, \}</math>.  You add and multiply in this ring in the same way you add or multiply the integers <math>\{ \, 0, 1, \, \}</math> with one exception:  since <math>\mathbb{Z}_2</math> does not have a "two" in it, we set <math>\overline{1} + \overline{1} = \overline{0}</math>.   
 
The most general mathematical context that deals with systems of objects that can be added and multiplied together is [[ring (mathematics)]] theory.  One can work with polynomials, and in particular quadratic polynomial equations, as long as the coefficients are in a ring.  The real numbers is an example of a ring.  Another example, important in [[coding theory]], is polynomials with coefficients in the ring <math>\mathbb{Z}_2 = \{ \, \overline{0}, \overline{1} \, \}</math>.  You add and multiply in this ring in the same way you add or multiply the integers <math>\{ \, 0, 1, \, \}</math> with one exception:  since <math>\mathbb{Z}_2</math> does not have a "two" in it, we set <math>\overline{1} + \overline{1} = \overline{0}</math>.   




Line 20: Line 20:
If <math>R</math> is an arbitrary ring, however, there are several problems with this formula.  The derivation of the formula typically involves [[completing the square]].  Looking at the derivation on the [[quadratic equation|main page]], the first problem arises when the factoring is performed.  If <math>R</math> is not [[commutative ring|commutative]], this step is not valid.  For the rest of this section, we assume that <math>R</math> is a commutative ring.
If <math>R</math> is an arbitrary ring, however, there are several problems with this formula.  The derivation of the formula typically involves [[completing the square]].  Looking at the derivation on the [[quadratic equation|main page]], the first problem arises when the factoring is performed.  If <math>R</math> is not [[commutative ring|commutative]], this step is not valid.  For the rest of this section, we assume that <math>R</math> is a commutative ring.


The next problem in the derivation of the quadratic formula for commutative rings arises when the square root is taken.  This is a problem already familiar from the situation where the coefficients are real numbers:  if the [[discriminant]] is negative, then there are no real solutions.  Otherwise, there are one or two solutions.  If the coefficients are in a general commutative ring, the discriminant can have 0, 1, 2, or even more solutions.   
The next problem in the derivation of the quadratic formula for commutative rings arises when the square root is taken.  This is a problem already familiar from the situation where the coefficients are real numbers:  if the [[discriminant]] is negative, then there are no real solutions.  Otherwise, there are one or two solutions.  If the coefficients are in a general commutative ring, the discriminant can have 0, 1, 2, or even more square roots. 
 
For example, let <math>R</math> be the ring of integers [[modular arithmetic|modulo 15]],
 
: <math> \mathbb{Z}_{15} = \{ \, \overline{0}, \overline{1}, \overline{2}, \overline{3}, \overline{4}, \overline{5}, \overline{6}, \overline{7}, \overline{8}, \overline{9}, \overline{10}, \overline{11}, \overline{12}, \overline{13}, \overline{14} \, \}</math>
 
Multiplication in this ring is performed by multiplying the representative integers and taking the remainder upon dividing the result by 15.  Using this procedure, we calculate the squares of the elements in this ring
 
: <math> \overline{0}^2 = \overline{0} \qquad \qquad \, \, \, \overline{5}^2 = \overline{25} = \overline{10} \qquad \qquad \overline{10}^2 = \overline{100} = \overline{10} </math>
: <math> \overline{1}^2 = \overline{1} \qquad \qquad \, \, \, \overline{6}^2 = \overline{36} = \overline{6} \qquad \qquad \, \, \, \overline{11}^2 = \overline{121} = \overline{1}</math>
: <math> \overline{2}^2 = \overline{4} \qquad \qquad \, \, \, \overline{7}^2 = \overline{49} = \overline{4} \qquad \qquad \, \, \, \overline{12}^2 = \overline{144} = \overline{9} </math>
: <math> \overline{3}^2 = \overline{9} \qquad \qquad \, \, \, \overline{8}^2 = \overline{64} = \overline{4} \qquad \qquad \, \, \, \overline{13}^2 = \overline{169} = \overline{4} </math>
: <math> \overline{4}^2 = \overline{16} = \overline{1} \qquad \overline{9}^2 = \overline{81} = \overline{6} \qquad \qquad \, \, \, \overline{14}^2 = \overline{196} = \overline{1}</math>
 
 
We see that the elements <math> \overline{2}, \overline{3}, \overline{5}, \overline{7}, \overline{8}, \overline{11}, \overline{12}, \overline{13}</math> and <math>\overline{14}</math> have no square roots in the ring, while <math> \overline{1} </math> has four distinct square roots! 
 
When working with real coefficients, we can work around the case where the discriminant is negative by allowing solutions in the larger ring of complex numbers.  In the above example, it is not clear how to enlarge the ring of integers modulo 15 to ensure that the discriminant has a square root.  However, when the ring of coefficients is a [[field (mathematics)|field]], one can ensure that there are solutions for every quadratic equation by allowing solutions to be in an [[algebraic closure]] of the field (see below).
 
When <math>R</math> is an arbitrary commutative ring and we seek solutions in the same ring, we simply say that the equation is ''unsolvable'' over <math>R</math> if the discriminant does not have a square root in the ring.
 
The final problem with the derivation of the quadratic formula over a general commutative ring is the final division by <math>2a</math>.  Since division is not a ring operation, we must be careful to view this step as a multiplication by the multiplicative inverse of <math>2a</math>It is very possible that <math>2a</math> is not invertible.  In particular, this happens if the [[characteristic (ring)|characteristic]] of the ring is divisible by two .  However, if both 2 and ''a'' are both units in <math>R</math>, then this step can be performed.
 
In summary, the quadratic formula is valid for quadratic equations over a general ring <math>R</math> with the following caveats:
 
* <math>R</math> must be commutative
* <math>2</math> and <math>a</math> must be units in <math>R</math>, so in particular <math>R</math> must not have characteristic divisible by two.
* The term <math>\sqrt{b^2-4ac}</math> must be allowed to take all possible square roots (sometimes more than two!) in <math>R</math>


For example, let <math>R</math> be the ring of integers [[modular arithmetic|modulo 8]],
=== Example ===


: <math> \mathbb{Z}_8 = \{ \, \overline{0}, \overline{1}, \overline{2}, \overline{3}, \overline{4}, \overline{5}, \overline{6}, \overline{7} \, \}</math>
Let us use the quadratic formula to find all solutions of the quadratic equation


Multiplication in this ring is performed by multiplying the representative integers and taking the remainder upon dividing the result by 8.  Using this procedure, we calculate the squares of the elements in this ring
: <math> \overline{4} x^2 + \overline{2} x + \overline{3} = \overline{0} </math>


: <math> \overline{0}^2 = \overline{0} </math>
over the ring of integers modulo 15.  As discussed above, we cannot apply the formula unless ''2a'' is a unit in the ring.  In this example, <math>2a=\overline{8}</math>, which is a unit in <math>\mathbb{Z}_{15}</math> with inverse <math>\overline{2}</math> (since <math>\overline{8} \cdot \overline{2} = \overline{16} = \overline{1}</math>).  The quadratic formula then says
: <math> \overline{1}^2 = \overline{1} </math>
: <math> \overline{2}^2 = \overline{4} </math>
: <math> \overline{3}^2 = \overline{9} = \overline{1} </math> (working modulo 8),
: <math> \overline{4}^2 = \overline{16} = \overline{0} </math>
: <math> \overline{5}^2 = \overline{25} = \overline{1} </math>
: <math> \overline{6}^2 = \overline{36} = \overline{4} </math>
: <math> \overline{7}^2 = \overline{49} = \overline{1} </math>


We see that the elements <math> \overline{2}, \overline{3}, \overline{5}, \overline{6},</math> and <math>\overline{7}</math> have no square roots in the ring, while <math> \overline{1} </math> has four distinct square roots! 
: <math> x = \left( -\overline{2} + \sqrt{\overline{2}^2 - 4 \cdot\overline{4} \cdot \overline{3}} \right) * (2 \cdot \overline{4})^{-1} = \left( - \overline{2} + \sqrt{\overline{1}} \right) * \overline{2} </math>


When working with real coefficients, we can work around the case where the discriminant is negative by allowing solutions in the larger ring of complex numbersIn the above example, it is not clear how to enlarge the ring of integers modulo 8 to ensure that the discriminant has a square rootHowever, when the ring of coefficients is a [[field (mathematics)|field]], one can ensure that there are solutions for every quadratic equation by allowing solutions to be in an [[algebraic closure]] of the field (see below).
Recalling that we must consider all possible square roots here, and consulting the table of squares in <math>\mathbb{Z}_{15}</math> above, we see that there are four possible values for <math>\sqrt{\overline{1}}</math>:  <math>\overline{1}, \overline{4}, \overline{11}</math> and <math>\overline{14}</math>Substituting each of these in for the square root above and simplifying, we find that the four solutions <math>x = \overline{3}, \overline{4}, \overline{9}</math>, and <math>\overline{13}</math>Substituting these back into the original equation shows that they are indeed solutions.


When <math>R</math> is an arbitrary commutative ring and we seek solutions in the same ring, we simply say that the equation is unsolvable over <math>R</math> if the discriminant does not have a square root in the ring.


==General fields==
==General fields==
Line 60: Line 79:
In the case of binary fields, extensions by square roots are not the most general form of quadratic extension.  The map <math>X \mapsto X^2</math> is always [[injective function|injective]], and in the case of [[finite field]]s it is therefore also [[surjective function|surjective]] (it is the [[Frobenius automorphism]]).   
In the case of binary fields, extensions by square roots are not the most general form of quadratic extension.  The map <math>X \mapsto X^2</math> is always [[injective function|injective]], and in the case of [[finite field]]s it is therefore also [[surjective function|surjective]] (it is the [[Frobenius automorphism]]).   


To obtain the most general quadratic extension, consider the ''Artin-Schreier polynomial''
To obtain the most general quadratic extension, consider the ''[[Artin-Schreier polynomial]]''


:<math>A_\alpha(X) = X^2 + X - \alpha \,</math>
:<math>A_\alpha(X) = X^2 + X + \alpha \,</math>


for α in ''F''.  The function <math>A : X \mapsto X^2 + X</math> is two-to-one since <math>A(x) = A(x+1)</math>.  It is in fact <math>\mathbf{F}_2</math>-linear on ''F'' as a [[vector space]].  
for α in ''F''.  The function <math>A : X \mapsto X^2 + X</math> is two-to-one since <math>A(x) = A(x+1)</math>.  It is in fact <math>\mathbf{F}_2</math>-linear on ''F'' as a [[vector space]].  

Latest revision as of 07:52, 4 March 2009

This article is developed but not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
Advanced [?]
 
An advanced level version of Quadratic equation.

In mathematics, or more specifically algebra, a quadratic equation is one involving only polynomials of the second degree. Quadratic equations are a common part of mathematical solutions to real-world problems in a huge variety of situations. Quadratic equations occurring in applications typically involve real number coefficients. However, one can algebraically manipulate polynomial equations in the usual way as long as the coefficients can be added and multiplied together. Please see the main page for a discussion of polynomials with real coefficients.

The most general mathematical context that deals with systems of objects that can be added and multiplied together is ring theory. One can define polynomials, and in particular quadratic polynomial equations, as long as the coefficients are in a ring. The real numbers is an example of a ring. Another example, important in coding theory, is polynomials with coefficients in the ring . You add and multiply in this ring in the same way you add or multiply the integers with one exception: since does not have a "two" in it, we set .


Solutions of quadratic equations

When working with polynomials over a specific ring , one usually looks for solutions in the same ring . The main exception to this is the most common case, where a polynomial has integer coefficients but one desires real number solutions. If, instead, one demands solutions of the same type as the polynomial coefficients, namely integers, the equation becomes a Diophantine equation. In this article, we assume that the desired solutions are in the same ring that the coefficients are drawn from.

Every polynomial equation with coefficients in a ring can be put into the form:

with a, b and c in and . When the coefficients are real numbers, the quadratic formula specifies the roots of this equation as

If is an arbitrary ring, however, there are several problems with this formula. The derivation of the formula typically involves completing the square. Looking at the derivation on the main page, the first problem arises when the factoring is performed. If is not commutative, this step is not valid. For the rest of this section, we assume that is a commutative ring.

The next problem in the derivation of the quadratic formula for commutative rings arises when the square root is taken. This is a problem already familiar from the situation where the coefficients are real numbers: if the discriminant is negative, then there are no real solutions. Otherwise, there are one or two solutions. If the coefficients are in a general commutative ring, the discriminant can have 0, 1, 2, or even more square roots.

For example, let be the ring of integers modulo 15,

Multiplication in this ring is performed by multiplying the representative integers and taking the remainder upon dividing the result by 15. Using this procedure, we calculate the squares of the elements in this ring


We see that the elements and have no square roots in the ring, while has four distinct square roots!

When working with real coefficients, we can work around the case where the discriminant is negative by allowing solutions in the larger ring of complex numbers. In the above example, it is not clear how to enlarge the ring of integers modulo 15 to ensure that the discriminant has a square root. However, when the ring of coefficients is a field, one can ensure that there are solutions for every quadratic equation by allowing solutions to be in an algebraic closure of the field (see below).

When is an arbitrary commutative ring and we seek solutions in the same ring, we simply say that the equation is unsolvable over if the discriminant does not have a square root in the ring.

The final problem with the derivation of the quadratic formula over a general commutative ring is the final division by . Since division is not a ring operation, we must be careful to view this step as a multiplication by the multiplicative inverse of . It is very possible that is not invertible. In particular, this happens if the characteristic of the ring is divisible by two . However, if both 2 and a are both units in , then this step can be performed.

In summary, the quadratic formula is valid for quadratic equations over a general ring with the following caveats:

  • must be commutative
  • and must be units in , so in particular must not have characteristic divisible by two.
  • The term must be allowed to take all possible square roots (sometimes more than two!) in

Example

Let us use the quadratic formula to find all solutions of the quadratic equation

over the ring of integers modulo 15. As discussed above, we cannot apply the formula unless 2a is a unit in the ring. In this example, , which is a unit in with inverse (since ). The quadratic formula then says

Recalling that we must consider all possible square roots here, and consulting the table of squares in above, we see that there are four possible values for : and . Substituting each of these in for the square root above and simplifying, we find that the four solutions , and . Substituting these back into the original equation shows that they are indeed solutions.


General fields

Let Δ be the discriminant,

This pair of solutions, which may be verified by completing the square, are valid when the characteristic of F is not 2: we shall assume this for now and deal with binary fields below.

If Δ is a square in F then the quadratic equation splits completely in F: that is, both roots lie in F.

In Δ is not a square in F then the field extension is quadratic over F: both roots of the equation lie in the extension, which is thus a splitting field for the equation and hence a Galois extension.

We observe that in this case, the quadratic equations is soluble by radicals: in this case, square roots.

Characteristic two

In the case of binary fields, extensions by square roots are not the most general form of quadratic extension. The map is always injective, and in the case of finite fields it is therefore also surjective (it is the Frobenius automorphism).

To obtain the most general quadratic extension, consider the Artin-Schreier polynomial

for α in F. The function is two-to-one since . It is in fact -linear on F as a vector space.

Finite fields

Suppose that F is finite, of characteristic two. The Frobenius map is an automorphism and so its inverse, the square root map is defined everywhere, and square roots do not generate any non-trivial extensions.

If F is finite, then A is exactly 2-to-1 and the image of A is a -subspace of codimension 1. There is always some element α of F not in the image of A, and so the corresponding Artin-Schreier polynomial has no root in F: it is therefore an irreducible polynomial and the quotient ring is a field which is a quadratic extension of F. Since finite fields of the same order are unique up to isomorphism, we may say that this is "the" quadratic extension of F. As before, both roots of the equation lie in the extension, which is thus a splitting field for the equation and hence a Galois extension: in this case the roots are of the form .