Community

Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.
Login Register Memberlist Search AoPS Blogs Contests Galleries Forum Index
The time now is Sun Nov 08, 2009 11:24 am
All times are UTC - 8
View posts since last visit
View unanswered posts
Trig problem
Moderators: High School Olympiad Moderators, Arne, blahblahblah, Cezar Lupu, darij grinberg, harazi, Megus, N.T.TUAN, orl, pbornsztein, pvthuan
Post new topic   Reply to topic View previous topicView next topic
35 Posts • Page 2 of 2 • Previous 1, 2
Author Message
Peter Scholze
Yang-Mills Theory
Yang-Mills Theory


Offline
Joined: 03 Jun 2004
Posts: 674
Germany

To rate posts you must be logged in
#21
i never tried to prove muirhead with AM-GM(had other jobs to do) but everything i could prove with muirhead i was also able to prove with AM-GM. let me think of it for a moment, maybe i can show you a proof of muirhead tomorrow(don't think i'll do that today).

Peter

PostPosted: Sun Jul 04, 2004 8:19 am  Back to top 
  ProfilePMICQ
manlio
Navier-Stokes Equations
Navier-Stokes Equations

Offline
Joined: 28 Apr 2004
Posts: 2047
Location: Italy

To rate posts you must be logged in
#22
I am VERY VERY VERY interested in this equivalence between Muirhead and

AM-GM that I have never thought possible.

I have always considered AM-GM and Muirhead as two distinct statements so if

you can prove they are equivalent I will be astonished and very happy.

PostPosted: Sun Jul 04, 2004 8:35 am  Back to top 
  ProfilePM
Peter Scholze
Yang-Mills Theory
Yang-Mills Theory


Offline
Joined: 03 Jun 2004
Posts: 674
Germany

To rate posts you must be logged in
#23
don't hope too much, i may be absolutely wrong...i will try to proof while greece wins i hope Wink (but it's not that bad if they don't...one student in my class must color his hair pink if portugal wins Mr. Green )

Peter

PostPosted: Sun Jul 04, 2004 9:04 am  Back to top 
  ProfilePMICQ
Peter Scholze
Yang-Mills Theory
Yang-Mills Theory


Offline
Joined: 03 Jun 2004
Posts: 674
Germany

To rate posts you must be logged in
#24
one can actually prove muirhead using AM-GM(or, to be precise the weighted version of it: if \sum^n_{i=1}w_i=1, then w_1a_1+...w_na_n\geq a_1^{w_1}\cdot...\cdot a_n^{w_n}: one can either prove it explicitly or use the normal AM-GM to prove it for rational w_i's, and then extend to irrational by continuity).
so, let's proof muirhead by induction on the number n of variables.
n=2: nearly trivial(let the exponents be x_1,x_2, y_1,y_2 where x_1\geq y_1\geq y_2\geq x_2 and x_1+x_2=y_1+y_2). then there exist w_1,w_2 such that 0\leq w_1,w_2\leq 1, w_1+w_2=1 and y_1=w_1x_1+w_2x_2, thus we also have y_2=w_2x_1+w_1x_2. let a,b be arbitrary positive reals. then \displaystyle a^{x_1}b^{x_2}+a^{x_2}b^{x_1}=(w_1a^{x_1}b^{x_2}+w_2a^{x_2}b^{x_1})+(w_2a^{x_1}b^{x_2}+w_1a^{x_2}b^{x_1})\geq a....
(n-1)->n: let x_1,...,x_n and y_1,...y_n be the exponents with the muirhead conditions. since x_1\geq y_1 and x_n\leq y_n, there is some k such that x_k\geq y_k, x_{k+1}\leq y_{k+1}. then by the case n=2, we may decrease x_k and increase x_{k+1} such that their sum is invariant until either x_k=y_k or x_{k+1}=y_{k+1}. it is clear that the muirhead conditions are still satisfied. so suppose two of the exponents are equal, x_k=y_k. now consider those terms of the symmetric sum where the k-th exponent has the same variable. then using muirhead for the other n-1 variables(the other n-1 exponents satisfy the muirhead conditions as well), we get the desired inequality.

it is clear that muirhead implies AM-GM.

(btw: two true statements are always equivalent Mr. Green )

Peter

PostPosted: Sun Jul 04, 2004 11:03 am  Back to top 
  ProfilePMICQ
darij grinberg
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer


Offline
Joined: 10 Feb 2004
Posts: 5754
Location: Karlsruhe / Munich

To rate posts you must be logged in
#25
Peter, I think your induction step needs a few modifications. For instance, when you say that "we may decrease x_k and increase x_{k+1} such that their sum is invariant until either x_k=y_k or x_{k+1}=y_{k+1}. it is clear that
the muirhead conditions are still satisfied
.", I think you make an additional assumption, namely that for every i \leq k, we have x_i \geq y_i. Hence, it is not enough to say "there is some k such that x_k\geq y_k, x_{k+1}\leq y_{k+1}", but you also must point out that you take the first such k.

Then I have some little notes on your last argument, when you use the n-1 assumption. I'll post all this later.

Meanwhile, I just wanted to note that you don't need any AM-GM for n = 2. In fact, from the conditions x_1 \geq y_1 \geq y_2 \geq x_2 and x_1 + x_2 = y_1 + y_2, it follows that y_1-x_2\geq 0 and y_2-x_2\geq 0, so that b \geq a entails b^{y_{1}-x_{2}}-a^{y_{1}-x_{2}} \geq 0 and b^{y_{2}-x_{2}}-a^{y_{2}-x_{2}} \geq 0, while b \leq a yields b^{y_{1}-x_{2}}-a^{y_{1}-x_{2}} \leq 0 and b^{y_{2}-x_{2}}-a^{y_{2}-x_{2}} \leq 0. In both cases, we have \left( b^{y_{1}-x_{2}}-a^{y_{1}-x_{2}}\right) \left( b^{y_{2}-x_{2}}-a^{y_{2}-x_{2}}\right) \geq 0. Now,

0\leq a^{x_{2}}b^{x_{2}}\left( b^{y_{1}-x_{2}}-a^{y_{1}-x_{2}}\right) \left( b^{y_{2}-x_{2}}-a^{y_{2}-x_{2}}\right)
=a^{x_{2}}b^{x_{2}}\left( b^{y_{1}+y_{2}-2x_{2}}-b^{y_{1}-x_{2}}a^{y_{2}-x_{2}}-a^{y_{1}-x_{2}}b^{y_{2}-x_{2}}+a^{y_{1}+y_{2}...
=a^{x_{2}}b^{x_{2}}\left( b^{x_{1}-x_{2}}-b^{y_{1}-x_{2}}a^{y_{2}-x_{2}}-a^{y_{1}-x_{2}}b^{y_{2}-x_{2}}+a^{x_{1}-x_{2}}\right...
=a^{x_{2}}b^{x_{1}}-a^{y_{2}}b^{y_{1}}-a^{y_{1}}b^{y_{2}}+a^{x_{1}}b^{x_{2}}.

Darij
_________________
Now the die is cast, the first step taken, a glimmer of hope lights up our lives
Visions of the past, dreams forsaken forming right under our eyes
We are alive...

PostPosted: Mon Jul 05, 2004 4:21 am  Back to top 
  ProfilePMWWW
Peter Scholze
Yang-Mills Theory
Yang-Mills Theory


Offline
Joined: 03 Jun 2004
Posts: 674
Germany

To rate posts you must be logged in
#26
[quote="darij grinberg"] I think you make an additional assumption, namely that for every i \leq k, we have x_i \geq y_i. [/qoute]

i don't think so. actually, since their sum is invariant, we don't have problems for larger smaller indices where only their sum influences the inequalities of muirhead and for larger indices, these terms don't play any role in the muirhead conditions. but maybe my mind is a bit blocked.
to your proof of muirhead for n=2: that is just the proof for AM-GM for n=2. muirhead is in my opinion that easy to proof that one can't say that it is "equivalent" to some other inequality.

what are your comments to using the inequality for n-1 variables?

Peter

PostPosted: Mon Jul 05, 2004 5:20 am  Back to top 
  ProfilePMICQ
manlio
Navier-Stokes Equations
Navier-Stokes Equations

Offline
Joined: 28 Apr 2004
Posts: 2047
Location: Italy

To rate posts you must be logged in
#27
Dear Peter , I have studied deeply your proof but it is not clear when you say:

....then by the case n=2 we may decrease x_k and increase x_k+1 such that their sum is invariant until either x_k=y_k or x_k+1=y_k+1. It is clear that the muirhead conditions are still satisfied....

can you please detail better this fundamental step as I want to understand entirely your proof which seems very interesting.


Thank you very much.

PostPosted: Mon Jul 05, 2004 8:22 am  Back to top 
  ProfilePM
darij grinberg
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer


Offline
Joined: 10 Feb 2004
Posts: 5754
Location: Karlsruhe / Munich

To rate posts you must be logged in
#28
Peter Scholze wrote:
i don't think so. actually, since their sum is invariant, we don't have problems for larger smaller indices where only their sum influences the inequalities of muirhead and for larger indices, these terms don't play any role in the muirhead conditions.


Well, your "smaller indices" are those smaller than x_k, and your "larger indices" are those larger than x_k. But what about x_k itself? Note that you decrease it, so I don't see why it is so sure that the condition x_1 + x_2 + ... + x_k \geq y_1 + y_2 + ... + y_k remains valid!

Actually, my mind can be blocked as well. I also see you have let out many steps in your proof. I really dislike the way mathematicians call facts "trivial", "obvious", "easy" which are anything but trivial if one has taken a different ansatz, or is inexperienced, or doesn't have the same ingenious idea that the author had, etc., although I must say your proofs are usually clear. Actually, in 5-20 minutes, I will post what I think is a complete version of your proof.

Darij
_________________
Now the die is cast, the first step taken, a glimmer of hope lights up our lives
Visions of the past, dreams forsaken forming right under our eyes
We are alive...

PostPosted: Mon Jul 05, 2004 9:58 am  Back to top 
  ProfilePMWWW
Peter Scholze
Yang-Mills Theory
Yang-Mills Theory


Offline
Joined: 03 Jun 2004
Posts: 674
Germany

To rate posts you must be logged in
#29
i do not need that assertion, darij. actually, i wrote down my muirhead conditions another way(it is equivalent): x_n\leq y_n, x_{n-1}+x_n\leq y_{n-1}+y_n, ..., x_1+...+x_n=y_1+...+y_n where x_1\geq x_2\geq ... \geq x_n and y_1\geq y_2\geq ... \geq y_n. now for indices i\leq k these conditions are sure still satisfied since the sum is invariant. for i>k+1 it is also clear since we change nothing. so look at x_{k+1}+...+x_n\leq y_{k+1}+...+y_n. we have x_{k+2}+...x_n\leq y_{k+2}+...y_n and x_{k+1}\leq y_{k+1}(after the increasion of x_{k+1} as well, since we stop when we have inequality), so that's clear. it is clear as well that x_1\geq x_2\geq ... \geq x_n is still satisfied since x_k\geq y_k\geq y_{k+1}\geq x_{k+1}. so i think there are no problems. but i could be wrong Sad

Peter

PostPosted: Mon Jul 05, 2004 10:20 am  Back to top 
  ProfilePMICQ
Peter Scholze
Yang-Mills Theory
Yang-Mills Theory


Offline
Joined: 03 Jun 2004
Posts: 674
Germany

To rate posts you must be logged in
#30
for manlio: i may decrease x_k and increase x_{k+1} such that their sum is invariant because looking at the symmetric sum where the other exponents have the same variables and the k-th and k+1-th exponent change their variables, we may use the muirhead for n=2. that gives that these terms are greater than when decreasing x_k and increasing x_{k+1}, so it suffices to show the inequality for the case when x_k=y_k or x_{k+1}=y_{k+1}, where we can use muirhead for n-1 variables.
example(i think you understand what i mean, but maybe it helps to understand the idea): we want to prove \sum a^3b^3\geq \sum a^2b^2c^2. now, after muirhead for n=2, we have b^3+c^3\geq b^2c+c^2b, but the left side is a^3(b^3+c^3)+b^3(a^3+c^3)+c^3(a^3+b^3)\geq a^3b^2c+a^3bc^2+b^3a^2c+b^3ac^2+c^3a^2b+c^3ab^2=\sum a^3b^2c. but after muirhead for n-1=2 variables, we have a^3c+ac^3\geq a^2c^2+a^2c^2, which gives the desired inequality.
basically, we are just moving the weights down the variables to get \{x_k\} to be the same as \{y_k\} where moving the weights is justified with AM-GM.

Peter

PostPosted: Mon Jul 05, 2004 10:29 am  Back to top 
  ProfilePMICQ
darij grinberg
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer


Offline
Joined: 10 Feb 2004
Posts: 5754
Location: Karlsruhe / Munich

To rate posts you must be logged in
#31
[Edit: I have slightly simplified an easy step now.]

Peter Scholze wrote:
i do not need that assertion, darij.


You are right, Peter.

Here is, finally, my Bourbakized version of your induction step:

We are given the Muirhead inequality for n-1 variables, and we must show it for n variables.

Call X=\left( x_{1};\;x_{2};\;...;\;x_{n}\right) and Y=\left( y_{1};\;y_{2};\;...;\;y_{n}\right) two n-variable number arrays satisfying X\succ Y. This means that the following Muirhead conditions are fulfilled:

x_{1}\geq x_{2}\geq ...\geq x_{n};
y_{1}\geq y_{2}\geq ...\geq y_{n};
x_{1}+x_{2}+...+x_{i}\geq y_{1}+y_{2}+...+y_{i} for any 1\leq i\leq n-1 (or \leq n, if you want Mr. Green );
x_{1}+x_{2}+...+x_{n}=y_{1}+y_{2}+...+y_{n}.

We have to prove that the symmetric polynomial

S_{X}\left( a_{1};\;a_{2};\;...;\;a_{n}\right) =\sum_{\sigma \left( X\right) }a_{1}^{\sigma \left( x_{1}\right) }a_{2}^{\sigm...

of n positive variables a_1, a_2, ..., a_n is always greater or equal to the symmetric polynomial

S_{Y}\left( a_{1};\;a_{2};\;...;\;a_{n}\right) =\sum_{\sigma \left( Y\right) }a_{1}^{\sigma \left( y_{1}\right) }a_{2}^{\sigm....

At first, we will prove this for the case when the arrays X and Y have two elements in common. In fact, we will prove:

Lemma 1. If our number arrays X and Y satisfy and X\succ Y and there exists a natural t such that x_t=y_t, then we have

S_{X}\left( a_{1};\;a_{2};\;...;\;a_{n}\right) \geq S_{Y}\left( a_{1};\;a_{2};\;...;\;a_{n}\right).

Proof. We have

S_{X}\left( a_{1};\;a_{2};\;...;\;a_{n}\right) =\sum\limits_{\sigma \left( X\right) }a_{1}^{\sigma \left( x_{1}\right) }a_{2}...
=\sum\limits_{u\in X}\left( a_{u}^{x_{t}}\sum\limits_{\sigma \left( X\backslash \left\{ t\right\} \right) }a_{u-t+1}^{\sigma ...

with cyclic indices modulo n. (What we have done? We have just grouped all terms of the polynomial S_X by putting aside the brackets the variable with power x_t.)

Now, we easily see that X\succ Y and x_t = y_t entail X\backslash \left\{ x_{t}\right\} \succ Y\backslash \left\{ y_{t}\right\}, so that we can apply Muirhead for n-1 variables to X\backslash \left\{ x_{t}\right\} and Y\backslash \left\{ y_{t}\right\}, and get

S_{X}\left( a_{1};\;a_{2};\;...;\;a_{n}\right)
=\sum\limits_{u\in X}\left( a_{u}^{x_{t}}\sum\limits_{\sigma \left( X\backslash \left\{ t\right\} \right) }a_{u-t+1}^{\sigma ...
\geq \sum\limits_{u\in Y}\left( a_{u}^{x_{t}}\sum\limits_{\sigma \left( Y\backslash \left\{ t\right\} \right) }a_{u-t+1}^{\si...
=\sum\limits_{u\in Y}\left( a_{u}^{y_{t}}\sum\limits_{\sigma \left( Y\backslash \left\{ t\right\} \right) }a_{u-t+1}^{\sigma ...
=\sum\limits_{\sigma \left( Y\right) }a_{1}^{\sigma \left( y_{1}\right) }a_{2}^{\sigma \left( y_{2}\right) }...a_{n}^{\sigma ...,

so Lemma 1 is proven.

Now, the Muirhead conditions imply x_1 \geq y_1 and x_n \leq y_n. There exist one or more natural numbers i such x_{i+1} \leq y_{i+1}. (For instance, take i = n-1). Take the least of these numbers i, and denote it by k. Then, we have x_{k+1} \leq y_{k+1}, while for every j \leq k, we have x_j \geq y_j. This includes x_k \geq y_k. (Actually, we will only need x_{k+1} \leq y_{k+1} and x_k \geq y_k in our proof.)

Since x_k \geq y_k, y_k \geq y_{k+1} and x_{k+1} \leq y_{k+1}, we have x_k \geq y_k \geq y_{k+1} \geq x_{k+1}.

Now, assume that x_k - y_k \geq y_{k+1} - x_{k+1}. Then, consider the number array

X^{\prime }=\left( x_{1}^{\prime };\;x_{2}^{\prime };\;...;\;x_{n}^{\prime }\right),

where x_{i}^{\prime }=x_{i} for any i\notin \left\{ k;\;k+1\right\}, and x_{k}^{\prime }=x_{k}-y_{k+1}+x_{k+1} and x_{k+1}^{\prime }=y_{k+1}.

What we will do is showing that X\succ X^{\prime } and X^{\prime }\succ Y. In fact, once this will be proved, we will be able to apply Lemma 1, since the arrays X and X' have two numbers in common (just take a t such that t\notin \left\{ k;\;k+1\right\}, and you'll have x_{t}=x_{t}^{\prime }), and the arrays X' and Y have two numbers in common (x_{k+1}^{\prime }=y_{k+1}). Then, Lemma 1 will yield

S_{X}\left( a_{1};\;a_{2};\;...;\;a_{n}\right) \geq S_{X^{\prime }}\left( a_{1};\;a_{2};\;...;\;a_{n}\right) \geq S_{Y}\left(...,

and this will complete the proof.

So it remains to show that X\succ X^{\prime } and X^{\prime }\succ Y.

At first, we will show that, just like the arrays X and Y, the array X' is decreasing. This means that x_{1}^{\prime }\geq x_{2}^{\prime }\geq ...\geq x_{k-2}^{\prime }\geq x_{k-1}^{\prime }\geq x_{k}^{\prime }\geq x_{k+1}^{\pri.... Indeed, proving this is simple: x_{k-1}^{\prime }\geq x_{k}^{\prime } is equivalent to x_{k-1}\geq x_{k}-y_{k+1}+x_{k+1} and follows from x_{k-1}\geq x_{k} and 0\geq -y_{k+1}+x_{k+1}; then, x_{k}^{\prime }\geq x_{k+1}^{\prime } is equivalent to x_{k}-y_{k+1}+x_{k+1}\geq y_{k+1}, what follows from x_{k}-y_{k+1}\geq x_{k}-y_{k}\geq y_{k+1}-x_{k+1}; finally, x_{k+1}^{\prime }\geq x_{k+2}^{\prime } results from x_{k+1}^{\prime }=y_{k+1}\geq x_{k+1}\geq x_{k+2}=x_{k+2}^{\prime }, and all the rest is trivial again.

Now we are going to show X\succ X^{\prime }.

- The sum of the elements of X' equals to the sum of the elements of X (since x_{k}^{\prime }+x_{k+1}^{\prime }=\left( x_{k}-y_{k+1}+x_{k+1}\right) +y_{k+1}=x_{k}+x_{k+1}).

- For every i, the sum of the first i elements of X is greater or equal to the sum of the first i elements of X' (in fact, if i\leq k-1, then we have equality; if i = k, it follows from x_{k} \geq x_{k}-y_{k+1}+x_{k+1}, what itself is because y_{k+1} \geq x_{k+1}; and if i\geq k+1, it's trivial again since x_{k}^{\prime }+x_{k+1}^{\prime }=x_{k}+x_{k+1}).

Hence, the Muirhead conditions are fulfilled and we get X\succ X^{\prime }.

Also:

- The sum of the elements of X' equals to the sum of the elements of Y (since the sum of the elements of X' equals to that of X, and that of X to that of Y).

- For every i, the sum of the first i elements of X' is greater or equal to the sum of the first i elements of Y (in fact, if i < k, then x_{1}^{\prime }+x_{2}^{\prime }+...+x_{i}^{\prime }\geq y_{1}+y_{2}+...+y_{i} is simply equivalent to x_{1}+x_{2}+...+x_{i}\geq y_{1}+y_{2}+...+y_{i}; if i\geq k+1, then the sum of the first i elements of X' equals to the sum of the first i elements of X - since x_{k}^{\prime }+x_{k+1}^{\prime }=x_{k}+x_{k+1}; finally, if i = k, then we have x_{1}^{\prime }+x_{2}^{\prime }+...+x_{k}^{\prime }=\left( x_{1}^{\prime }+x_{2}^{\prime }+...+x_{k}^{\prime }+x_{k+1}^{\prim...).

Hence, X^{\prime }\succ Y. This completes the proof for the case x_k - y_k \geq y_{k+1} - x_{k+1}.

Now consider the case x_k - y_k \leq y_{k+1} - x_{k+1}. In this case, define the auxiliary array

X^{\prime }=\left( x_{1}^{\prime };\;x_{2}^{\prime };\;...;\;x_{n}^{\prime }\right)

by x_{i}^{\prime }=x_{i} for any i\notin \left\{ k;\;k+1\right\}, and x_{k}^{\prime }=y_{k} and x_{k+1}^{\prime }=x_{k+1}-y_{k}+x_{k}. Again, x_{k}^{\prime }+x_{k+1}^{\prime }=y_{k}+\left( x_{k+1}-y_{k}+x_{k}\right) =x_{k}+x_{k+1}. Just as in the former case, you can show X\succ X^{\prime } and X^{\prime }\succ Y. I won't show you my transformations, but believe me they are just analogous.

BTW I have a strong feeling that this all is just a clumsy version of the original proof of Muirhead's theorem (although I have not read this proof, but I can remember it used three lemmas, let me look whether I can find it again).

Darij
_________________
Now the die is cast, the first step taken, a glimmer of hope lights up our lives
Visions of the past, dreams forsaken forming right under our eyes
We are alive...
Last edited by darij grinberg on Wed Jul 07, 2004 6:44 am; edited 3 times in total 
PostPosted: Mon Jul 05, 2004 10:41 am  Back to top 
  ProfilePMWWW
galois
Riemann Hypothesis
Riemann Hypothesis

Offline
Joined: 11 Jul 2003
Posts: 394
India

To rate posts you must be logged in
#32
hey i think there is aproof of muirhead's theorem in kedlaya's packet on inequalities and it seems to be shorter than dg's monstrous version Mr. Green (no offence intended mate)
_________________
reality continues to ruin my life

PostPosted: Mon Jul 05, 2004 10:55 am  Back to top 
  ProfilePMBlog
darij grinberg
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer


Offline
Joined: 10 Feb 2004
Posts: 5754
Location: Karlsruhe / Munich

To rate posts you must be logged in
#33
darij grinberg wrote:
BTW I have a strong feeling that this all is just a clumsy version of the original proof of Muirhead's theorem (although I have not read this proof, but I can remember it used three lemmas, let me look whether I can find it again).


Actually I have found a part of the proof (in German):

http://hydra.nat.uni-magdeburg.de/math4u/var/PU5.html

There are missing some conditions in the definition of majorizing sequences (this is caused by an error in the TeX compiling). The three lemmas are there, with their proofs, but the proof of the Muirhead theorem itself is missing (and it is NOT an obvious corollary of U.78, as one could think at the first sight).

The Lemma 1 I used is the so-called "Expansion Lemma", as I see. The "Transformation Lemma" follows from the Expansion Lemma 2 and the n = 2 case of Muirhead.

Darij
_________________
Now the die is cast, the first step taken, a glimmer of hope lights up our lives
Visions of the past, dreams forsaken forming right under our eyes
We are alive...

PostPosted: Mon Jul 05, 2004 10:59 am  Back to top 
  ProfilePMWWW
fuzzylogic
Yang-Mills Theory
Yang-Mills Theory

Offline
Joined: 24 Mar 2004
Posts: 719

To rate posts you must be logged in
#34
The proof of Muirhead in Kiran Kedlaya's Inequality notes is very short, but it relies on a fact which he didn't include a proof.

If s majorizes t, then there exist nonnegative constants k_{\sigma}, as \sigma ranges over the permutations of \{1, \dots, n\}, whose sum is 1 and such that

\sum_\sigma k_{\sigma} (s_{\sigma(1)}, \dots, s_{\sigma(n)})
= (t_1, \dots, t_n)

Armed with this fact, the proof of Muirhead is almost trivial by weighted AM-GM.

This fact can also be used to prove the Majorization Inequality (aka Karamata Inequality).

PostPosted: Mon Aug 02, 2004 2:34 pm  Back to top 
  ProfilePM
perfect_radio
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer


Offline
Joined: 04 Feb 2005
Posts: 2614
Location: Bucharest
Romania

To rate posts you must be logged in
#35
Does anyone know a proof for the lemma Kedlaya used in proving Muirhead?

(i recently downloaded his ineq notes and i was quite interested in the proof of muirhead; the one given here seems pretty simple, but i want to know more about this other approach)
_________________
"Germany has offered to send troops to the Lebanon border. I bet Israel's breathing a sigh of relief there. Nothing makes Jewish people feel safer and more secure than the German Army marching on their border."

PostPosted: Thu Aug 04, 2005 6:02 pm  Back to top 
  ProfilePMWWWYMBlogAlbum
Display posts from previous:   Sort by:   
35 Posts • Page 2 of 2 • Previous 1, 2
Post new topic   Reply to topic View previous topicView next topic
Jump to:  

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum
You cannot post calendar events in this forum


© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us