Triangle Inequality
The triangle inequality states that the sum of the lengths of any two sides of a triangle is greater than the length of the remaining side.
It follows from the fact that a straight line is the shortest path between two points. The inequality is strict if the triangle is non-degenerate (meaning it has a non-zero area).
Contents
Examples
If two side lengths of a non-degenerate triangle are each equal to , what are the possible values for the length of the third side?
Let the third side have length , then from the triangle inequality we have and , implying So any real number such that is a possible length of the third side.
If two side lengths of a non-degenerate triangle are 9 and 15, what are the possible lengths of the third side?
Let the third side have length . The 3 sides must satisfy
The third inequality is trivially true, and the first two give .
If , , , , and is a positive integer, find .
If the three integer sides of a triangle are given by , , , what is the greatest possible value of ?
By the triangle inequality we have
which implies So the greatest possible integer value of is .
Given sticks of respective lengths and , how many distinct triangles can be formed from three of the sticks?
If one side of the triangle has a side length of , then there is no possible combination to form a triangle. In fact, if the three sides of a triangle have distinct integer lengths, then it is impossible to have one side of unit length.
If one side has a length of , the only possible combination is .
If one side has a length of , the only possible combination is .
If one side has a length of , the possible combinations are and .
If one side has a length of , the possible combinations are and .Since changing the order of the sides doesn't change the triangle itself, we can form distinct triangles.
Bob the builder has many sticks of length 3, 5, and 7. He wants to form triangles each of whose edges consists of exactly 1 stick. How many non-congruent triangles can he form with the sticks?
I was cleaning up my attic recently and found a set of at least 14 sticks which a curious Italian gentleman sold me some years ago. Trying hard to figure out why I bought it from him, I realized that the set has the incredible property that there are no sticks that can form a triangle. If the set has two sticks of length , which are the smallest, what is the least possible length of the stick?
Vectors
The triangle inequality has the following formulation in terms of vectors in :
Let and be vectors in Let denote the norm of a vector. Then
Square both sides and subtract: by the Cauchy-Schwarz inequality.
Note that equality holds in Cauchy-Schwarz if and only if the vectors are parallel, which is the condition that the triangle is degenerate.
The above proof is essentially the same as using the law of cosines: if are the sides of a triangle, and the right side is maximized when is minimized, i.e. when it is so Therefore, with equality if and only if the angle between the sides of lengths and is
Metric Spaces
Main article: Metric space
The triangle inequality is a fundamental property of generalized distance functions called metrics, which are used to construct metric spaces. A metric is a function which takes two arguments from a set and produces a nonnegative real number, with the following properties:
- if and only if
This third property is the triangle inequality, and it is important in proving many of the topological properties of metric spaces.