Loading…
Loading…
Connect polynomial structure, inequalities and rectangular loci, with optional conic enrichment.
We assume Chapter 1's domains, equation equivalence, intervals and functions. This chapter strengthens algebra and geometry before calculus. You will derive the quadratic formula, use polynomial factors to analyze signs, preserve exclusions in rational functions, and translate geometric descriptions into equations.
Scientific formulas often become manageable only after a structural rewrite. Completing a square can reveal a circle or a minimum. Factoring can expose repeated roots and sign changes. A domain check can separate a removable hole from a permitted input. These are mathematical decisions, not just mechanical simplifications.
Proposition
A nonzero polynomial , , has degree . Polynomial division by gives
Proof
where is constant. Substituting proves . Thus is a root exactly when is a factor. Repeated division proves that a nonzero degree- polynomial has at most distinct real roots: each distinct root removes one degree while remaining roots still belong to the quotient.
Proof
Here all polynomial coefficients and are real. Division by follows from finite algebra, rather than a root-finding assumption. For ,
Expanding the right side cancels all intermediate terms. Applying this identity to every term of gives
This constructs and the constant remainder , including a constant polynomial via the empty sum . For , has degree and leading coefficient . If two such divisions existed, substituting would give the same remainder; subtracting would then give as a polynomial, forcing by its leading coefficient. If is another root and , substitution gives , hence . Induction on degree, starting with a nonzero constant having no root, proves the distinct-root bound.
Worked example
Worked example 1: a cubic without guessing all roots. Let . Grouping gives
The roots are , and the factorization proves there are no others. Expanding it is an independent algebra check. Finding a single root numerically would not identify the full set.
Definition
For a positive integer and polynomial , a root has multiplicity if with . Near , the nonzero continuous factor keeps its sign. The factor changes sign for odd and does not for even . Thus an even-multiplicity zero can touch an axis without crossing it, even before derivatives are introduced.
Proof
The sign assertion needs no calculus. Write and fix real with . Let and . For , the difference-of-powers identity gives
If , is constant. Otherwise choose . For , the difference is smaller than , so has the same sign as . Thus, for a positive integer multiplicity and polynomial quotient , the only local sign change comes from : odd reverses the sign, even preserves it. This also supplies the continuity-based sign fact used in the definition above.
Proposition
For ,
Setting the expression to zero and taking square roots yields
For real roots require discriminant . A zero discriminant gives one repeated real root; a negative discriminant gives no real roots. For an equation in a physical quantity, admissibility may exclude some real roots afterward.
Worked example
Worked example 2: a minimum without calculus. The calibration penalty equals . Thus its unique minimum over all real inputs is three at . On a restricted domain , the closest allowed input to two is three, giving minimum five instead. The model domain changes the answer while the square identity stays true.
The same rewrite helps graph a parabola. The point is its vertex; sign of determines opening direction. It is not necessary to infer shape from a handful of sampled points.
For a factored polynomial or rational function, list all real zeros and denominator zeros. These divide the line into intervals on which no factor can change sign. Determine the sign on each interval, include numerator zeros when the inequality allows equality, and always exclude denominator zeros.
Worked example
Worked example 3: a repeated zero inside a negative interval. Solve
The domain excludes three. Away from , the squared factor is positive, so signs are governed by : positive left of , negative between and three, and positive right of three. Equality also occurs at and at the repeated zero . Therefore the solution is
Common mistake
The isolated solution one would be missed by dividing out without separately retaining its zero case.
A common factor in a quotient cancels only where it is nonzero. For , cancellation gives the values of when , but does not fill the original hole. By contrast is unbounded near , where its denominator vanishes, rather than having a cancelled factor; the two structures should not be confused.
The squared distance between and is . A circle of radius and centre is
Worked example
Worked example 4: identify the geometry. The equation becomes
It is a circle centred at with radius two. If the right side after completing squares were negative, the real locus would be empty; if zero, it would be a single point rather than a positive-radius circle.
A line can be written with . This includes vertical lines that cannot be written as . For two nonvertical lines, unequal slopes guarantee one intersection; equal slopes require checking whether the equations describe the same line or distinct parallel lines.
To find intersections of a line and circle, substitution produces a quadratic. A positive, zero or negative discriminant describes two intersections, tangency, or no real intersection. All candidates must satisfy both original equations.
Worked example
Worked example 5: intersection rather than a sketch. For and , substitution gives , so or . The points are and . Each has squared distance five from the origin and lies on the line. A single plotted crossing would be incomplete.
Optional: conic sections. Focus-directrix descriptions and conic classifications connect geometry with coordinate equations. Exercises 8–9 explore these ideas.
A parabola consists of points equidistant from a focus and a directrix line. With focus and directrix , where , equating squared distances gives
hence . Squaring is equivalent here because both quantities being compared are distances and therefore nonnegative. The vertex is , opening upward for and downward for .
An axis-aligned ellipse has equation with . Its horizontal and vertical semiaxes are . A hyperbola with equation is unbounded and has two branches. These equations are distinct geometric models; similar-looking squared terms do not make all conics circles.
Worked example
Worked example 6: a scaled ellipse. For , the intercepts are . Solving for the upper branch gives with domain . The full ellipse is not a single function of because most interior horizontal inputs have both a positive and a negative output. Choosing a branch is a domain/output decision, not merely a graphical preference.
For , . Subtracting times the sum from the sum proves it. A discrete repeated contribution with multiplier therefore has total over terms. At , the correct total is ; the quotient formula must not be evaluated by division by zero.
Finite-sum algebra prepares for sequences and integrals; it does not by itself establish convergence of an infinite total.
Foundation
Checkpoint
Checkpoint
Checkpoint
Core
Checkpoint
Checkpoint
Checkpoint
Checkpoint
Checkpoint
Synthesis
Checkpoint
Checkpoint
Completing the square gives more than an answer for the minimum. Begin a sketch at the vertex . A horizontal displacement changes the penalty to , so equal displacements to either side have equal heights, and the factor two fixes the vertical scale. This explains the symmetry and shape without relying on a calculator's arbitrary sampling density. Mark the model's included endpoints and then retain only the portion over its admissible input interval. A plotting window and a mathematical domain are different: the edge of an image does not itself exclude an input.
Now draw the horizontal comparison line. If it lies below the vertex it has no intersections; at the vertex it touches once; above the vertex the unrestricted parabola has two crossings. A restricted domain may keep both, one or neither. Determine crossings algebraically and intersect the resulting set with the model domain. A narrow sketch can hide a second crossing, so the plot supports the argument but does not replace the complete solution set.
Checkpoint
A parabola is not yet a model domain
A calibration uses a normalized concentration , where is a fixed reference concentration and has the same units. Thus is dimensionless. The instrument permits . Its dimensionless calibration penalty is

The coefficient of the square is positive, so the parabola opens upward. Its vertex is . The admissible input domain is , and the minimum penalty three is attained at . On that domain, , so , with equality at . Every value between three and eleven occurs: for , the input lies in and has penalty . Therefore the admissible range is exactly . The unrestricted polynomial instead has domain and range ; the scientific restriction must not be inferred from the polynomial alone.
The solid curve lies on or below the horizontal boundary between the two crossings. Algebraically,
Intersecting with the admissible domain leaves . Both endpoints are included because each has penalty exactly five and the requested comparison is non-strict. At the penalty is eleven, so that endpoint is not accepted by this tolerance.
Solving gives or , both admissible. The original model is not injective: distinct concentrations on opposite sides of the vertex can have the same penalty. Restricting inputs to makes the penalty strictly increasing, with range . Its inverse is
The positive branch is selected by ; it is not a rule that square-root equations have only one candidate. Alternatively, restricting to gives the negative branch and inverse domain . Returning to physical concentration requires .
The dashed continuation shows values of the polynomial, not an enlarged scientific operating domain. Negative would violate nonnegative concentration, and would exceed the stated instrument range. A real value of at such an input establishes algebraic definability, not physical admissibility or calibration validity.
Factors reveal roots and sign changes, while repeated roots require separate zero cases. Completing squares derives quadratic roots, extrema and geometric forms. Rational exclusions survive cancellation. Coordinate equations describe loci that need not be single-valued functions. Finite geometric sums provide exact discrete accumulation without introducing differential or integral calculus.