Maximizing Triangle Inequality with AM-GM

  • Thread starter Thread starter ehrenfest
  • Start date Start date
Click For Summary
SUMMARY

The discussion focuses on proving the inequality 1 < ab + bc + ca - abc ≤ 28/27 for triangle side lengths a, b, and c with a semiperimeter of 1. The AM-GM inequality is applied to derive bounds, revealing that the maximum occurs at the equilateral triangle where a = b = c = 2/3, yielding the upper limit of 28/27. The analysis also considers limiting cases and critical points, emphasizing the importance of edge conditions in the proof.

PREREQUISITES
  • Understanding of the AM-GM inequality
  • Basic knowledge of triangle properties and semiperimeter
  • Familiarity with calculus concepts such as gradients and critical points
  • Ability to manipulate algebraic expressions involving multiple variables
NEXT STEPS
  • Study the application of the AM-GM inequality in various mathematical contexts
  • Explore properties of triangles, particularly the implications of the semiperimeter
  • Learn about optimization techniques in multivariable calculus
  • Investigate the expansion of polynomial expressions like (1-a)(1-b)(1-c)
USEFUL FOR

Mathematicians, students studying inequalities, and anyone interested in advanced geometric proofs and optimization techniques.

ehrenfest
Messages
2,001
Reaction score
1

Homework Statement


Let a,b,c be the side lengths of a triangle with semiperimeter 1. Prove that

1 &lt; ab + bc + ca - abc \leq 28/27

Homework Equations


the AM-GM inequality:

If x_1,...,x_n are nonnegative real numbers, then

\frac{\sum x_i}{n} \leq \left( \Pi x_i\right)^{1/n}

The Attempt at a Solution


I can get "close" to the second inequality. Applying AM-GM to a+b-c,a-b+c,-a+b+c gives

8/27 \geq a^3 +b^3 +c^3 -2abc +a^2b+ab^2+ac^2 +a^2 c+bc^2 +b^2 c

Applying AM-GM to a,b,c gives

8/27 \geq abc

and then we can add the two inequalities to obtain16/27 \geq a^3 +b^3 +c^3 -abc +a^2b+ab^2+ac^2 +a^2 c+bc^2 +b^2 c

Ok maybe that's not really close...
 
Last edited:
Physics news on Phys.org
I would probably just look at the limiting cases.

First, arbitrarily set a <= b <= c.

What if one of the sides becomes arbitrarily small? Well, if a =~ 0, then b = c and
ab + bc + ca - abc = 0 + 1 + 0 - 0 = 1.

Since a triangle with sides of length 0, 1, 1 isn't technically a triangle, we don't include this lower limiting number.

Next, we guess the only other special triangle we can think of: the equilateral triangle. Thus a = b = c = 2/3, and ab + bc + ca - abc = 4/9 + 4/9 + 4/9 - 8/27 = 28/27. Since an equilateral triangle is a triangle, this is acceptable, and we keep the equality.

Can this reasoning be made mathematically precise? Let's see.

Let's call ab + bc + ca - abc F(a, b, c)... that is, F(a, b, c) = ab + bc + ca - abc

The gradient of F is grad F(a, b, c) = (b + c - bc, a + c - ac, a + b - ab)

The only critical point occurs where a = b = c = 2, which is outside our area of interest (namely, we want a + b + c = 2, 0 <= a <= b <= c). Thus we must only look at our function on the edges and corners... to find these, we consider the system

1) 0 <= a <= b <= c
2) c <= a + b
3) a + b + c = 2

Clearly, c <= 1, from 2) and 3). It follows that a and b are also less than 1.

I leave the rest as an exercise </lazy>
 
I know this is an old thread, but I recently ran into this problem and found its solution using AM-GM to be very nice. Anyone working on this who is stuck may want to expand (1-a)(1-b)(1-c) out and work from there.
 

Similar threads

Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 47 ·
2
Replies
47
Views
7K
Replies
4
Views
2K
Replies
1
Views
1K
Replies
5
Views
11K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 24 ·
Replies
24
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K