In algebra, a quadratic function, a quadratic polynomial, a polynomial of degree 2, or simply a quadratic, is a polynomial function with one or more variables in which the highest-degree term is of the second degree.
For example, a univariate (single-variable) quadratic function has the form
The bivariate case in terms of variables x and y has the form
A quadratic function in three variables x, y, and z contains exclusively terms x2, y2, z2, xy, xz, yz, x, y, z, and a constant:
with at least one of the coefficients a, b, c, d, e, or f of the second-degree terms being non-zero.
In general there can be an arbitrarily large number of variables, in which case the resulting surface of setting a quadratic function to zero is called a quadric, but the highest degree term must be of degree 2, such as x2, xy, yz, etc.
When using the term "quadratic polynomial", authors sometimes mean "having degree exactly 2", and sometimes "having degree at most 2". If the degree is less than 2, this may be called a "degenerate case". Usually the context will establish which of the two is meant.
Sometimes the word "order" is used with the meaning of "degree", e.g. a second-order polynomial.
A quadratic polynomial may involve a single variable x (the univariate case), or multiple variables such as x, y, and z (the multivariate case).
The one-variable case
Any single-variable quadratic polynomial may be written as
where x is the variable, and a, b, and c represent the coefficients. In elementary algebra, such polynomials often arise in the form of a quadratic equation . The solutions to this equation are called the roots of the quadratic polynomial, and may be found through factorization, completing the square, graphing, Newton's method, or through the use of the quadratic formula. Each quadratic polynomial has an associated quadratic function, whose graph is a parabola.
Any quadratic polynomial with two variables may be written as
where x and y are the variables and a, b, c, d, e, and f are the coefficients. Such polynomials are fundamental to the study of conic sections, which are characterized by equating the expression for f (x, y) to zero. Similarly, quadratic polynomials with three or more variables correspond to quadric surfaces and hypersurfaces. In linear algebra, quadratic polynomials can be generalized to the notion of a quadratic form on a vector space.
Forms of a univariate quadratic function
A univariate quadratic function can be expressed in three formats:
- is called the standard form,
- is called the factored form, where r1 and r2 are the roots of the quadratic function and the solutions of the corresponding quadratic equation.
- is called the vertex form, where h and k are the x and y coordinates of the vertex, respectively.
The coefficient a is the same value in all three forms. To convert the standard form to factored form, one needs only the quadratic formula to determine the two roots r1 and r2. To convert the standard form to vertex form, one needs a process called completing the square. To convert the factored form (or vertex form) to standard form, one needs to multiply, expand and/or distribute the factors.
Graph of the univariate function
Regardless of the format, the graph of a univariate quadratic function is a parabola (as shown at the right). Equivalently, this is the graph of the bivariate quadratic equation .
- If a > 0, the parabola opens upwards.
- If a < 0, the parabola opens downwards.
The coefficient a controls the degree of curvature of the graph; a larger magnitude of a gives the graph a more closed (sharply curved) appearance.
The coefficients b and a together control the location of the axis of symmetry of the parabola (also the x-coordinate of the vertex and the h parameter in the vertex form) which is at
The coefficient c controls the height of the parabola; more specifically, it is the height of the parabola where it intercepts the y-axis.
The vertex of a parabola is the place where it turns; hence, it is also called the turning point. If the quadratic function is in vertex form, the vertex is (h, k). Using the method of completing the square, one can turn the standard form
so the vertex, (h, k), of the parabola in standard form is
If the quadratic function is in factored form
the average of the two roots, i.e.,
is the x-coordinate of the vertex, and hence the vertex (h, k) is
The vertex is also the maximum point if a < 0, or the minimum point if a > 0.
The vertical line
that passes through the vertex is also the axis of symmetry of the parabola.
Maximum and minimum points
x is a root of f '(x) if f '(x) = 0 resulting in
with the corresponding function value
so again the vertex point coordinates, (h, k), can be expressed as
Roots of the univariate function
The roots (or zeros), r1 and r2, of the univariate quadratic function
are the values of x for which f(x) = 0.
Upper bound on the magnitude of the roots
The square root of a univariate quadratic function
If then the equation describes a hyperbola, as can be seen by squaring both sides. The directions of the axes of the hyperbola are determined by the ordinate of the minimum point of the corresponding parabola . If the ordinate is negative, then the hyperbola's major axis (through its vertices) is horizontal, while if the ordinate is positive then the hyperbola's major axis is vertical.
If then the equation describes either a circle or other ellipse or nothing at all. If the ordinate of the maximum point of the corresponding parabola is positive, then its square root describes an ellipse, but if the ordinate is negative then it describes an empty locus of points.
To iterate a function , one applies the function repeatedly, using the output from one iteration as the input to the next.
One cannot always deduce the analytic form of , which means the nth iteration of . (The superscript can be extended to negative numbers, referring to the iteration of the inverse of if the inverse exists.) But there are some analytically tractable cases.
For example, for the iterative equation
So by induction,
can be obtained, where can be easily computed as
Finally, we have
as the solution.
The logistic map
with parameter 2<r<4 can be solved in certain cases, one of which is chaotic and one of which is not. In the chaotic case r=4 the solution is
where the initial condition parameter is given by . For rational , after a finite number of iterations maps into a periodic sequence. But almost all are irrational, and, for irrational , never repeats itself – it is non-periodic and exhibits sensitive dependence on initial conditions, so it is said to be chaotic.
The solution of the logistic map when r=2 is
for . Since for any value of other than the unstable fixed point 0, the term goes to 0 as n goes to infinity, so goes to the stable fixed point
Bivariate (two variable) quadratic function
A bivariate quadratic function is a second-degree polynomial of the form
where A, B, C, D, and E are fixed coefficients and F is the constant term. Such a function describes a quadratic surface. Setting equal to zero describes the intersection of the surface with the plane , which is a locus of points equivalent to a conic section.
If the function has no maximum or minimum; its graph forms a hyperbolic paraboloid.
If the function has a minimum if A>0, and a maximum if A<0; its graph forms an elliptic paraboloid. In this case the minimum or maximum occurs at where:
If and the function has no maximum or minimum; its graph forms a parabolic cylinder.
If and the function achieves the maximum/minimum at a line—a minimum if A>0 and a maximum if A<0; its graph forms a parabolic cylinder.
- Quadratic form
- Quadratic equation
- Matrix representation of conic sections
- Periodic points of complex quadratic mappings
- List of mathematical functions
- "Quadratic Equation from Wolfram MathWorld". Retrieved January 6, 2013.
- Hughes-Hallett, Deborah; Connally, Eric; McCallum, William G. (2007), College Algebra, John Wiley & Sons Inc., p. 205, ISBN 9780471271758, Search result
- "Complex Roots Made Visible – Math Fun Facts". Retrieved 1 October 2016.
- Lord, Nick, "Golden bounds for the roots of quadratic equations", Mathematical Gazette 91, November 2007, 549.