Haha, so I am back after a long time, it feels so nice to write something again on my good old blog. I was kind of busy with school exams and different mock exams for IIT-JEE in my coaching institute (NOT FIITJEE) and also a maths talent exam (which had a total shi**y question paper mostly full of calculations). So after all this business, I am back to maths. It’s not as if I was slacking off too much, but I really got into playing osu!
Today is the first day of Durga Puja, known as Mahalaya; and therefore a holiday. The month of November of a 12th grader in India is the busiest time of the year, full of different exams – competitive and school. So maybe it will be another long wait for this blog before it gets another update.
kk, I guess that concludes my set of excuses for not updating the blog for a long time. However, the title and the topic is totally random. Obviously it’s on inequalities(because it’s random), and it is on a method for solving problems of the type where are positive real numbers and are given constants.
I don’t consider this necessary, but probably I should show one inequality of this kind. This is an excerpt from my “Topic of Tran Quoc Anh” file, which is under development. This inequality probably inspired me to find out the technique of which I am talking now.
Hmm, now you may ask some questions, like how the hell did I come up with the exact coefficients and why did I use and not Well, when I was trying to solve it in a way other than how the author came up with the problem, I was trying different ways of reducing the variables. The strategy that I used was to boil down the inequality on 3 variables to 1 variable. The same procedure will work for our general case.
On a totally general note, this is quite useful in non-symmetric inequalities. In fact, this is one definite method which should work always. We try to reduce a variable inequality to lesser number of variables. One method that people use quite frequently is the Entirely Mixing Variables Method(EMV), and its stronger version: The Stronger Mixing Variables Method(SMV). Now, this one is quite unrelated to MV and is quite a raw form of elimination, but still quite useful.
The General Problem.
Well, it’s obvious that not all will abide by a minimum value. We consider, for the sake of simplicity that So, the problem that we will look into is:
Let be positive real numbers such that for some constants we have Then find the conditions for which the expression has a minimum and also determine the minimum.
The “General” Solution.
Again, we follow the same method as what we used for the example problem.
Note that Then,
And now we know how to eliminate from our expression. What we get after applying AM-GM is that
Hmm, this is a one-variable inequality. We have been able to generalise our method till this line, but after this I was just lucky to have stumbled upon inside the square root, but right now there is a Also, for the equality to hold till this point, we have made a hell lot of assumptions. In each step that we write a we need to verify for the equality case. So for people who are too lazy to push this thing into an elegant solution, might as well differentiate the expression. But, the AM-GM solution is way more spectacular than a calculus bash; also Cauchy-Schwarz and AM-GM are my favourite inequalities – so anyway let’s continue.
So, we want to find such that Assume that we had been able to find some suitable (I am not explaining what “suitable” means right now). Then we can get
So one thing is for sure. If we can find and if the all abide by our restrictions, then this must be the required minimum that we are seeking. So now we have to find the constraints.
Start with the first line of the solution. I suddenly wrote but this will be true only if However, is obvious. But this will help us determine from and so let’s call this constraint the – determination constraint.
Now come to the second of the solution. For equality to hold, we must have Let’s call this the – determination constraint.
Now the third prey. For equality in the Cauchy-Schwarz step; ie we can verify that the condition must follow is
Fourth condition. In the final step, for equality to hold we should have
The last two constraints will let us solve for What we get is that
Which simplifies to the following cubic in which I would like to call the Characteristic cubic of the problem:
Conditions for Minima.
So we have obtained some necessary conditions for the minimum to exist. For example, the real root of the characteristic equation must be positive; and also the that we obtain this way must give a corresponding which is verified when But, note that if is a positive root of the characteristic cubic then
so that any positive root of this cubic will always lead us to a corresponding value of thus fixing the for which the minimum is attained. So finally what we have to check for is the existence of a positive real root of the characteristic cubic.
Take Then the cubic is Now so has two real points of inflection : and Now and is increasing for so this cubic equation will always have one positive root. It may have two or no negative roots. So any satisfy and permit such a minimum value.
The value of which satisfies the cubic equation can be found out to be a huge expression.
So we can take any we like and then make a new inequality using the characteristic cubic.
This was not too tl;dr, but the method is awesome, so I wrote down this thing in an hour. The next post should be on some other more interesting topic. 🙂