Finding the minimum value that an expression can take.

Click For Summary

Discussion Overview

The discussion revolves around finding the minimum value of the expression k + k^-1, particularly through the use of inequalities. Participants explore the mathematical derivation and reasoning behind the inequalities used, as well as the generalization of such methods for similar problems.

Discussion Character

  • Mathematical reasoning
  • Conceptual clarification
  • Debate/contested

Main Points Raised

  • One participant references a method for maximizing power in a component and seeks clarification on the derivation of the inequality (k-1)^2 ≥ 0 used to find the minimum value of k + k^-1.
  • Another participant asserts that the proof showing k + 1/k ≥ 2 is straightforward, assuming k > 0.
  • Some participants suggest using the arithmetic mean being greater than the geometric mean as a basis for the inequality.
  • There is a discussion on the manipulation of the quadratic inequality and the necessity of ensuring k > 0 during the process.
  • A participant expresses uncertainty about how to derive useful inequalities for different scenarios, questioning whether there is a generalizable method for creating such inequalities.
  • Another participant proposes a generalization using (k-n)² ≥ 0 to derive k + n²/k ≥ 2n, though its applicability remains uncertain.

Areas of Agreement / Disagreement

Participants express differing levels of understanding regarding the derivation of the inequality and its generalization. While some find the derivation trivial, others seek deeper insight into how to formulate useful inequalities for various contexts. The discussion remains unresolved regarding the generalization of the method.

Contextual Notes

Participants highlight the importance of assumptions, such as k being greater than zero, and the need for careful selection of inequalities to achieve desired results. There is also mention of potential limitations in the original paper's explanation.

HuaYongLi
Messages
16
Reaction score
0
I've recently come across a http://technologyinterface.nmsu.edu/Spring08/" for why power is maximised in a component when its resistance [tex]R_L[/tex] equals the internal resistance [tex]R[/tex].
But in part (5) of method 1, we need to find the minimum non-negative value that the expression [tex]k+k^-^1[/tex] can take. For this they use the inequality [tex](k-1)^2 \geq 0[/tex] and then expand it to [tex]k^2-2k+1 \geq 0[/tex] which is then in turn divided by [tex]k[/tex] and rearranged to get [tex]k+k^-^1 \geq 2[/tex]
The problem I have grasping is the part where they come up with the inequality to solve this problem. This is a step I have never come across, and I was wondering if this method had a name.

Thanks
 
Last edited by a moderator:
Mathematics news on Phys.org
Are you asking a physics question, i.e. where did the question about k + 1/k come from?
The math proof ( ≥ 2) is simple enough (assuming k > 0).
 
Maths
 
Use that the arithmetic mean is larger than the geometric mean.
 
HuaYongLi said:
Maths

(k-1)2 ≥ 0

expand quadratic

k2 -2k + 1 ≥ 0

divide through by k (need k > 0)

k - 2 + 1/k ≥ 0

add 2 to both sides

k + 1/k ≥ 2
 
HuaYongLi said:
I've recently come across a http://technologyinterface.nmsu.edu/Spring08/" for why power is maximised in a component when its resistance [tex]R_L[/tex] equals the internal resistance [tex]R[/tex].
But in part (5) of method 1, we need to find the minimum non-negative value that the expression [tex]k+k^-^1[/tex] can take. For this they use the inequality [tex](k-1)^2 \geq 0[/tex] and then expand it to [tex]k^2-2k+1 \geq 0[/tex] which is then in turn divided by [tex]k[/tex] and rearranged to get [tex]k+k^-^1 \geq 2[/tex]
The problem I have grasping is the part where they come up with the inequality to solve this problem. This is a step I have never come across, and I was wondering if this method had a name.

Thanks
If you're asking where the initial inequality comes from, any real number squared is always greater than or equal to zero. That's the reason for saying [itex](k-1)^2 \geq 0[/itex].
 
Last edited by a moderator:
Yes, but is this a matter of just thinking of a quadratic inequality that when manipulated will give desired terms k and 1/k?
 
HuaYongLi said:
Yes, but is this a matter of just thinking of a quadratic inequality that when manipulated will give desired terms k and 1/k?

The last two replies seem to make it as clear as possible. It is a trivial derivation. What don't you get?
 
I know the inequality can be used to find the minimum and how to manipulate it. My problem is how to actually come up with an inequality that will be of use in the first place, say I have [tex](k-2)^{2}\geq0[/tex] - it's not going to be useful for our purposes when manipulated. Well, obviously one can see that the first (k-1) inequality will be the one to choose. I want to know whether this can be generalised for any quadratic inequality where you want to find not just x is more than/less than a; but x and another non constant term.
It just seems to me that some steps are being skipped in the paper.
 
  • #10
You can generalize with (k-n)2 ≥ 0 to get k + n2/k ≥ 2n.

Where it might be used I don't know.
 
  • #11
Thank you, I've gotten what I need to know.
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K