The Triangle Inequality
Progress can't be saved in this browser, so this lesson's status can't be set.
Watch the video explainer
Learning goals
- Prove why two sides of a triangle together exceed its third side
- Classify positive side triples, distinguishing triangles from flat boundary arrangements
- Determine strict third-side ranges, including restrictions on variable lengths
- Compare direct and broken paths using triangle and polygon inequalities
When three sides can close
Two sides of a triangle together are longer than the third side. For lengths , , and , the two shorter rods have a combined length of , leaving room to bend while their free ends still reach the endpoints of the -unit base.
Now keep the rods of lengths and , but use a base of length . The rods meet only when laid along the base. This is a degenerate triangle, a flat boundary arrangement with collinear vertices. An ordinary, nondegenerate triangle has three noncollinear vertices and positive side lengths.
With a base of length , even the fully stretched rods leave a gap of . Bending them cannot make them reach farther.
The triangle inequality says that in every nondegenerate triangle, the sum of any two side lengths is strictly greater than the third. Here names the length of segment . For triangle :
Also,
And,
Why the inequality is strict
In the previous lesson, a larger angle in one triangle faced a longer side. Equal sides also gave equal opposite angles in an isosceles triangle.
We can turn a sum of two sides into one straight segment by extending a side. That gives a comparison inside one larger triangle.
Two sides together exceed the third side#
First follow a numerical instance. Extend beyond to , copying onto , and join to . In an instance where angle is and angle is , the equal sides and make angle measure too.
The whole angle at is
Thus it measures , larger than the angle at . In triangle , side is therefore longer than . But consists of followed by a copy of , giving the desired sum.
Now take any nondegenerate triangle . On ray beyond , choose so that
The order is , and is off their line. Join .
Triangle is isosceles, so
Ray coincides with ray , so angle is angle . Also, ray lies inside angle : the segment from vertex to the interior point of side splits that angle. The other part, angle , is positive because is nondegenerate, so
Therefore angle is greater than angle . Apply the larger-angle result in triangle :
Segment addition and the copied length give
Hence,
Nothing depended on the numbers and . The strict step used a positive angle at , which every nondegenerate triangle has. Relabeling the vertices proves the other two side-sum inequalities.
Check your understanding
In the extension proof, B, A, and D lie in that order, and AD is a copy of AC. Which fact makes angle BCD strictly larger than angle BDC?
The equal sides AC and AD give equal base angles ACD and ADC. Ray DA is ray DB, so ADC is also BDC.
The whole angle BCD contains ACD plus the positive angle BCA. This proves the angle comparison before we compare BD and BC.
Test a proposed set of lengths
Positive lengths make a triangle exactly when each pair adds to more than the remaining length. To see why lengths passing the test can close, join the two shorter rods at a movable joint. We accept the geometric continuity fact that as the joint turns, the distance between the free ends takes every value from their difference when folded back to their sum when straight. Every distance strictly between those endpoints occurs with a bend. Because both rods are positive, their difference is strictly less than the longer rod. The longest requested length is at least as long as that rod, and passing the longest-side test puts it below their sum. It therefore lies strictly between the endpoints and can be fitted between the free ends.
For a numerical test, first identify a longest length. You need check only whether the other two add to more than that length. The other sums automatically exceed a smaller length because every length is positive.
Worked example 1 Distinguish a triangle, a flat boundary, and a gap
Problem. Classify each proposed side triple as a nondegenerate triangle, a flat boundary arrangement, or an impossible assembly. All lengths are in the same unit.
Case A: , , .
Case B: , , .
Case C: , , .
Solution. Case A: Compare the sum of the two shorter lengths with the longest:
The lengths make a nondegenerate triangle.
Case B: The comparison is equality:
The pieces can only meet flat, so they do not make an ordinary triangle.
Case C: The pieces are too short even when stretched straight:
They cannot close.
The positivity condition matters. A zero or negative proposed side fails before any triangle test. Also, checking an arbitrary pair can miss the problem: lengths , , and satisfy the comparison of with , but the two shorter lengths cannot span .
Check your understanding
Which positive side triple makes a nondegenerate triangle?
For 6, 8, and 13, the shorter lengths satisfy
The 4, 8, 12 case is flat. In each remaining case, the shorter lengths add to less than the longest.
Find the whole third-side range
The third-side range lists every possible length for a third side when the other two are fixed. With sides and , the third side must be less than their sum, . It must also be greater than their difference, , so the -unit side and the proposed third side together exceed the -unit side.
Worked example 2 Keep both strict bounds
Problem. Two sides of a triangle measure centimeters and centimeters. Find the range of the third side , and list the possible integer values.
Solution. The sum comparison gives the upper bound:
The inequality involving the longest fixed side gives the lower bound:
The remaining comparison, , holds automatically for every positive .
Together these give
The integer lengths are , , , , , , , , , , , , centimeters. Neither endpoint belongs: or would make a flat arrangement.
For any positive fixed lengths and , the same three comparisons reduce to
The absolute value means the larger fixed length minus the smaller. If the fixed lengths match, the lower bound is zero, still excluded because a side must be positive.
Worked example 3 Let all three lengths depend on a variable
Problem. Proposed side lengths are , , and units. Find every real value of for which they make a nondegenerate triangle.
Solution. Since the longest expression may change, check all three inequalities.
First comparison:
This simplifies to
Second comparison:
This gives
Third comparison:
This gives
All three hold exactly when
Throughout this interval, all side expressions are positive.
At the lower endpoint, , the lengths are , , and , which are flat.
At the upper endpoint, , they are , , and , also flat.
Check your understanding
Two sides have lengths 9 and 14 units. What is the complete range of possible third-side lengths x?
The lower boundary is the difference, 5, and the upper boundary is the sum, 23.
Both endpoints are excluded because they make a flat arrangement.
Direct segments and broken paths
A broken path is a route made from consecutive straight segments. Between distinct points and , a two-segment route through a point off line is strictly longer than the direct segment:
This is the triangle inequality in triangle .
If is between and , segment addition gives equality.
If is on their line beyond either endpoint, the path doubles back and is longer. Collinearity by itself does not guarantee equality.
The same comparison works for any finite number of legs. For instance, if the three legs from through and to measure , , and , first replace and by . That replacement cannot increase the length. Then replace and by , giving a direct distance at most .
In general, repeated applications of the two-leg result give
Equality holds exactly when the intermediate points lie on the direct segment in travel order, without backtracking. A turn off the segment or a reversal makes the path longer. We allow the non-strict symbol here because a path may include straight, forward steps.
A polygon inequality compares one side of a closed polygon with all the other sides together. Traveling around those other sides gives a broken path between the chosen side’s endpoints. A nondegenerate polygon cannot have all its vertices on one line, so that route cannot be the same forward straight segment, and its length strictly exceeds the chosen side.
Worked example 4 Bound a polygon side without measuring it
Problem. A nondegenerate quadrilateral has three consecutive sides of lengths , , and units, in that order. Give a strict upper bound for side . Explain whether a claimed length of units is possible.
Solution. The route around the other three sides has length
The polygon inequality gives
A claimed length of would require the route from through and to to lie straight in travel order. That would be flat, so it cannot describe the stated quadrilateral.
Check your understanding
A route goes from A to P to Q to B with positive leg lengths. Which condition makes its total length equal to AB?
A forward route along the direct segment adds to AB by segment addition.
A reversal adds extra distance, and leaving the line creates a strict triangle inequality. Equality therefore needs both collinearity and the stated travel order.