How prove this the number of ordered $n$-tuples $(varepsilon_{1},cdots,varepsilon_{n})$such this following...
Interesting Question:
for any complex numbers $z_{1},z_{2},cdots,z_{n}$ such
$$begin{cases}
|z_{1}|^2+|z_{2}|^2+cdots+|z_{n}|^2=1\
|z_{i}|ledfrac{1}{10},i=1,2,cdots,n
end{cases}$$
show that the number of ordered $n$-tuples $(varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n})$such this following inequality
$$|z_{1}varepsilon_{1}+z_{2}varepsilon_{1}+cdots+z_{n}varepsilon_{n}|ledfrac{1}{3}$$
at least $2^{n-100}$
where $varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n}in {-1,1}$
This problem is from china 2014 omlypiad problem exisice it,and I find sometimes with this background:
(2004 Romania )Prove that for any complex numbers $z_{1},z_{2},cdots,z_{n}$ satisfying
$|z_{1}|^2+|z_{2}|^2+cdots+|z_{n}|^2=1$, one can selcet
$varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n}in {-1,1}$ such that
$$left|sum_{k=1}^{n}varepsilon_{k}z_{k}right|le 1$$
then I found Nearest IMRE B´ AR´ ANY, BORIS reseacher these some problem:
see:http://arxiv.org/abs/1303.2877
and
http://arxiv.org/abs/1310.0910 these two paper have some new reslut,but I read find see can't solve my problem,can someone help.Thank you
inequality contest-math
This question has an open bounty worth +50
reputation from inequality ending in 5 days.
Looking for an answer drawing from credible and/or official sources.
add a comment |
Interesting Question:
for any complex numbers $z_{1},z_{2},cdots,z_{n}$ such
$$begin{cases}
|z_{1}|^2+|z_{2}|^2+cdots+|z_{n}|^2=1\
|z_{i}|ledfrac{1}{10},i=1,2,cdots,n
end{cases}$$
show that the number of ordered $n$-tuples $(varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n})$such this following inequality
$$|z_{1}varepsilon_{1}+z_{2}varepsilon_{1}+cdots+z_{n}varepsilon_{n}|ledfrac{1}{3}$$
at least $2^{n-100}$
where $varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n}in {-1,1}$
This problem is from china 2014 omlypiad problem exisice it,and I find sometimes with this background:
(2004 Romania )Prove that for any complex numbers $z_{1},z_{2},cdots,z_{n}$ satisfying
$|z_{1}|^2+|z_{2}|^2+cdots+|z_{n}|^2=1$, one can selcet
$varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n}in {-1,1}$ such that
$$left|sum_{k=1}^{n}varepsilon_{k}z_{k}right|le 1$$
then I found Nearest IMRE B´ AR´ ANY, BORIS reseacher these some problem:
see:http://arxiv.org/abs/1303.2877
and
http://arxiv.org/abs/1310.0910 these two paper have some new reslut,but I read find see can't solve my problem,can someone help.Thank you
inequality contest-math
This question has an open bounty worth +50
reputation from inequality ending in 5 days.
Looking for an answer drawing from credible and/or official sources.
It seems that the question should be about the number of ordered $n$-tuples $(varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n})$ instead of the number of ordered $n$-tuples $(z_{1},z_{2},cdots,z_{n})$.
– Alex Ravsky
Dec 18 '14 at 15:24
Yes.that's your mean.Thank you
– math110
Dec 18 '14 at 15:32
add a comment |
Interesting Question:
for any complex numbers $z_{1},z_{2},cdots,z_{n}$ such
$$begin{cases}
|z_{1}|^2+|z_{2}|^2+cdots+|z_{n}|^2=1\
|z_{i}|ledfrac{1}{10},i=1,2,cdots,n
end{cases}$$
show that the number of ordered $n$-tuples $(varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n})$such this following inequality
$$|z_{1}varepsilon_{1}+z_{2}varepsilon_{1}+cdots+z_{n}varepsilon_{n}|ledfrac{1}{3}$$
at least $2^{n-100}$
where $varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n}in {-1,1}$
This problem is from china 2014 omlypiad problem exisice it,and I find sometimes with this background:
(2004 Romania )Prove that for any complex numbers $z_{1},z_{2},cdots,z_{n}$ satisfying
$|z_{1}|^2+|z_{2}|^2+cdots+|z_{n}|^2=1$, one can selcet
$varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n}in {-1,1}$ such that
$$left|sum_{k=1}^{n}varepsilon_{k}z_{k}right|le 1$$
then I found Nearest IMRE B´ AR´ ANY, BORIS reseacher these some problem:
see:http://arxiv.org/abs/1303.2877
and
http://arxiv.org/abs/1310.0910 these two paper have some new reslut,but I read find see can't solve my problem,can someone help.Thank you
inequality contest-math
Interesting Question:
for any complex numbers $z_{1},z_{2},cdots,z_{n}$ such
$$begin{cases}
|z_{1}|^2+|z_{2}|^2+cdots+|z_{n}|^2=1\
|z_{i}|ledfrac{1}{10},i=1,2,cdots,n
end{cases}$$
show that the number of ordered $n$-tuples $(varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n})$such this following inequality
$$|z_{1}varepsilon_{1}+z_{2}varepsilon_{1}+cdots+z_{n}varepsilon_{n}|ledfrac{1}{3}$$
at least $2^{n-100}$
where $varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n}in {-1,1}$
This problem is from china 2014 omlypiad problem exisice it,and I find sometimes with this background:
(2004 Romania )Prove that for any complex numbers $z_{1},z_{2},cdots,z_{n}$ satisfying
$|z_{1}|^2+|z_{2}|^2+cdots+|z_{n}|^2=1$, one can selcet
$varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n}in {-1,1}$ such that
$$left|sum_{k=1}^{n}varepsilon_{k}z_{k}right|le 1$$
then I found Nearest IMRE B´ AR´ ANY, BORIS reseacher these some problem:
see:http://arxiv.org/abs/1303.2877
and
http://arxiv.org/abs/1310.0910 these two paper have some new reslut,but I read find see can't solve my problem,can someone help.Thank you
inequality contest-math
inequality contest-math
edited Dec 18 '14 at 16:04
math110
asked Dec 18 '14 at 9:54
math110math110
32.5k456216
32.5k456216
This question has an open bounty worth +50
reputation from inequality ending in 5 days.
Looking for an answer drawing from credible and/or official sources.
This question has an open bounty worth +50
reputation from inequality ending in 5 days.
Looking for an answer drawing from credible and/or official sources.
It seems that the question should be about the number of ordered $n$-tuples $(varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n})$ instead of the number of ordered $n$-tuples $(z_{1},z_{2},cdots,z_{n})$.
– Alex Ravsky
Dec 18 '14 at 15:24
Yes.that's your mean.Thank you
– math110
Dec 18 '14 at 15:32
add a comment |
It seems that the question should be about the number of ordered $n$-tuples $(varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n})$ instead of the number of ordered $n$-tuples $(z_{1},z_{2},cdots,z_{n})$.
– Alex Ravsky
Dec 18 '14 at 15:24
Yes.that's your mean.Thank you
– math110
Dec 18 '14 at 15:32
It seems that the question should be about the number of ordered $n$-tuples $(varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n})$ instead of the number of ordered $n$-tuples $(z_{1},z_{2},cdots,z_{n})$.
– Alex Ravsky
Dec 18 '14 at 15:24
It seems that the question should be about the number of ordered $n$-tuples $(varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n})$ instead of the number of ordered $n$-tuples $(z_{1},z_{2},cdots,z_{n})$.
– Alex Ravsky
Dec 18 '14 at 15:24
Yes.that's your mean.Thank you
– math110
Dec 18 '14 at 15:32
Yes.that's your mean.Thank you
– math110
Dec 18 '14 at 15:32
add a comment |
1 Answer
1
active
oldest
votes
Partition ${1,dots,n}$ into thirty sets $I_1,dots,I_{30}$ such that $sum_{iin I_j}|z_i|^2<tfrac1{30}+tfrac1{100}<tfrac4{90}$ for each $1leq jleq 30.$ This can be achieved by starting with empty sets and adding greedily: the only impediment to adding a value to some $I_j$ is that $sum_{iin I_j}|z_i|^2geq tfrac1{30},$ but if that holds for all the $j$ then all the values must already be assigned.
Assume these lemmas for now:
Lemma 1. For any positive integer $N$ and any values $z_1,dots,z_N$ with $sum_{i=1}^N |z_i|^2leq 4/90,$ there exist at least $2^N/10$ tuples $(epsilon_1,dots,epsilon_N)in{-1,1}^{N}$ such that $|sum_{i=1}^{N}epsilon_iz_i|^2leq 5/90$ and $epsilon_1=1.$
Lemma 2. Given values $z_1,dots,z_N$ such that $|z_i|^2leq 5/90$ for $1leq ileq N,$ there exist $epsilon_1,dots,epsilon_Nin{-1,1}$ such that $|sum_{i=1}^Nepsilon_iz_i|leq 1/3.$ (Actually we only need the case $N=30.$)
Combining the tuples given by applying Lemma 1 to each $I_j,$ there are at least $2^n10^{-30}=2^n1000^{-10}>2^n1024^{-10}=2^{n-100}$ tuples $(epsilon_1,dots,epsilon_n)in{-1,1}^n$ such that $|sum_{iin I_j} epsilon_iz_i|^2leq 5/90$ and $epsilon_{min(I_j)}=1$ for each $j.$
For each of these tuples, by Lemma 2, we can find $(theta_1,dots,theta_{30})in{-1,1}^{30}$ such that $|sum_{j=1}^{30}theta_j(sum_{iin I_j} epsilon_iz_i)|leq 1/3.$ This gives a new tuple defined by $epsilon'_i=epsilon_itheta_j$ for each $iin I_j$ and $1leq jleq 30.$ The resulting $2^{n-100}$ tuples $epsilon'$ are distinct and satisfy $|sum_{i=1}^{n}epsilon'_iz_i|leq 1/3$ as required.
Proof of Lemma 1:
$$sum_{epsilonin{-1,1}^N}sum_{i=1}^{N}|epsilon_iz_i|^2
=sum_{epsilonin{-1,1}^N}sum_{i=1}^{N}epsilon_iz_ioverline{sum_{j=1}^{N}epsilon_jz_j}
=2^Nsum_{i=1}^{N}|z_i|^2leqtfrac{4}{90}2^N$$ because the $z_iz_j$ terms cancel. So it is not possible for more than $tfrac45 2^{N}$ tuples $epsilon$ to satisfy $|sum_{i=1}^{N}epsilon_iz_i|^2>5/90.$ (This is a form of Markov's inequality.) So at least $tfrac15 2^{N}$ must have $|sum_{i=1}^{N}epsilon_iz_i|^2leq 5/90.$ Requiring $epsilon_1=1$ halves this to $tfrac1{10} 2^{N}.$
Proof of Lemma 2: Given any three complex values I claim there are always two $z,w$ such that $|z+w|$ or $|z-w|$ is at most $max(|z|,|w|).$ This follows from the fact that some two make an angle of at most $pi/3$ after possibly negating some values: assume one value $z$ lies on the real axis, then $z$ or $-z$ makes an angle of less than $pi/3$ which anything not in the region $arg win(pi/3,2pi/3)cup (4pi/3,5pi/3)$; but any two points in this region make an angle of at most $pi/6$ with each other after possibly negating one. In algebraic terms this means $2mathrm{Re}(zoverline w)geq tfrac12 |z||w|,$ giving $|z-w|^2=|z|^2+|w|^2-2mathrm{Re}(zoverline w)leqmax(|z|,|w|).$
This lets us reduce to the case $N=2.$ Without loss of generality $z_1$ is a positive real, and negating $z_2$ if necessary we can assume $mathrm{Re}(z_2)leq 0.$ This gives $|z_1+z_2|^2leq|z_1|^2+|z_2|^2leq 10/90$ as required.
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1073141%2fhow-prove-this-the-number-of-ordered-n-tuples-varepsilon-1-cdots-vareps%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Partition ${1,dots,n}$ into thirty sets $I_1,dots,I_{30}$ such that $sum_{iin I_j}|z_i|^2<tfrac1{30}+tfrac1{100}<tfrac4{90}$ for each $1leq jleq 30.$ This can be achieved by starting with empty sets and adding greedily: the only impediment to adding a value to some $I_j$ is that $sum_{iin I_j}|z_i|^2geq tfrac1{30},$ but if that holds for all the $j$ then all the values must already be assigned.
Assume these lemmas for now:
Lemma 1. For any positive integer $N$ and any values $z_1,dots,z_N$ with $sum_{i=1}^N |z_i|^2leq 4/90,$ there exist at least $2^N/10$ tuples $(epsilon_1,dots,epsilon_N)in{-1,1}^{N}$ such that $|sum_{i=1}^{N}epsilon_iz_i|^2leq 5/90$ and $epsilon_1=1.$
Lemma 2. Given values $z_1,dots,z_N$ such that $|z_i|^2leq 5/90$ for $1leq ileq N,$ there exist $epsilon_1,dots,epsilon_Nin{-1,1}$ such that $|sum_{i=1}^Nepsilon_iz_i|leq 1/3.$ (Actually we only need the case $N=30.$)
Combining the tuples given by applying Lemma 1 to each $I_j,$ there are at least $2^n10^{-30}=2^n1000^{-10}>2^n1024^{-10}=2^{n-100}$ tuples $(epsilon_1,dots,epsilon_n)in{-1,1}^n$ such that $|sum_{iin I_j} epsilon_iz_i|^2leq 5/90$ and $epsilon_{min(I_j)}=1$ for each $j.$
For each of these tuples, by Lemma 2, we can find $(theta_1,dots,theta_{30})in{-1,1}^{30}$ such that $|sum_{j=1}^{30}theta_j(sum_{iin I_j} epsilon_iz_i)|leq 1/3.$ This gives a new tuple defined by $epsilon'_i=epsilon_itheta_j$ for each $iin I_j$ and $1leq jleq 30.$ The resulting $2^{n-100}$ tuples $epsilon'$ are distinct and satisfy $|sum_{i=1}^{n}epsilon'_iz_i|leq 1/3$ as required.
Proof of Lemma 1:
$$sum_{epsilonin{-1,1}^N}sum_{i=1}^{N}|epsilon_iz_i|^2
=sum_{epsilonin{-1,1}^N}sum_{i=1}^{N}epsilon_iz_ioverline{sum_{j=1}^{N}epsilon_jz_j}
=2^Nsum_{i=1}^{N}|z_i|^2leqtfrac{4}{90}2^N$$ because the $z_iz_j$ terms cancel. So it is not possible for more than $tfrac45 2^{N}$ tuples $epsilon$ to satisfy $|sum_{i=1}^{N}epsilon_iz_i|^2>5/90.$ (This is a form of Markov's inequality.) So at least $tfrac15 2^{N}$ must have $|sum_{i=1}^{N}epsilon_iz_i|^2leq 5/90.$ Requiring $epsilon_1=1$ halves this to $tfrac1{10} 2^{N}.$
Proof of Lemma 2: Given any three complex values I claim there are always two $z,w$ such that $|z+w|$ or $|z-w|$ is at most $max(|z|,|w|).$ This follows from the fact that some two make an angle of at most $pi/3$ after possibly negating some values: assume one value $z$ lies on the real axis, then $z$ or $-z$ makes an angle of less than $pi/3$ which anything not in the region $arg win(pi/3,2pi/3)cup (4pi/3,5pi/3)$; but any two points in this region make an angle of at most $pi/6$ with each other after possibly negating one. In algebraic terms this means $2mathrm{Re}(zoverline w)geq tfrac12 |z||w|,$ giving $|z-w|^2=|z|^2+|w|^2-2mathrm{Re}(zoverline w)leqmax(|z|,|w|).$
This lets us reduce to the case $N=2.$ Without loss of generality $z_1$ is a positive real, and negating $z_2$ if necessary we can assume $mathrm{Re}(z_2)leq 0.$ This gives $|z_1+z_2|^2leq|z_1|^2+|z_2|^2leq 10/90$ as required.
add a comment |
Partition ${1,dots,n}$ into thirty sets $I_1,dots,I_{30}$ such that $sum_{iin I_j}|z_i|^2<tfrac1{30}+tfrac1{100}<tfrac4{90}$ for each $1leq jleq 30.$ This can be achieved by starting with empty sets and adding greedily: the only impediment to adding a value to some $I_j$ is that $sum_{iin I_j}|z_i|^2geq tfrac1{30},$ but if that holds for all the $j$ then all the values must already be assigned.
Assume these lemmas for now:
Lemma 1. For any positive integer $N$ and any values $z_1,dots,z_N$ with $sum_{i=1}^N |z_i|^2leq 4/90,$ there exist at least $2^N/10$ tuples $(epsilon_1,dots,epsilon_N)in{-1,1}^{N}$ such that $|sum_{i=1}^{N}epsilon_iz_i|^2leq 5/90$ and $epsilon_1=1.$
Lemma 2. Given values $z_1,dots,z_N$ such that $|z_i|^2leq 5/90$ for $1leq ileq N,$ there exist $epsilon_1,dots,epsilon_Nin{-1,1}$ such that $|sum_{i=1}^Nepsilon_iz_i|leq 1/3.$ (Actually we only need the case $N=30.$)
Combining the tuples given by applying Lemma 1 to each $I_j,$ there are at least $2^n10^{-30}=2^n1000^{-10}>2^n1024^{-10}=2^{n-100}$ tuples $(epsilon_1,dots,epsilon_n)in{-1,1}^n$ such that $|sum_{iin I_j} epsilon_iz_i|^2leq 5/90$ and $epsilon_{min(I_j)}=1$ for each $j.$
For each of these tuples, by Lemma 2, we can find $(theta_1,dots,theta_{30})in{-1,1}^{30}$ such that $|sum_{j=1}^{30}theta_j(sum_{iin I_j} epsilon_iz_i)|leq 1/3.$ This gives a new tuple defined by $epsilon'_i=epsilon_itheta_j$ for each $iin I_j$ and $1leq jleq 30.$ The resulting $2^{n-100}$ tuples $epsilon'$ are distinct and satisfy $|sum_{i=1}^{n}epsilon'_iz_i|leq 1/3$ as required.
Proof of Lemma 1:
$$sum_{epsilonin{-1,1}^N}sum_{i=1}^{N}|epsilon_iz_i|^2
=sum_{epsilonin{-1,1}^N}sum_{i=1}^{N}epsilon_iz_ioverline{sum_{j=1}^{N}epsilon_jz_j}
=2^Nsum_{i=1}^{N}|z_i|^2leqtfrac{4}{90}2^N$$ because the $z_iz_j$ terms cancel. So it is not possible for more than $tfrac45 2^{N}$ tuples $epsilon$ to satisfy $|sum_{i=1}^{N}epsilon_iz_i|^2>5/90.$ (This is a form of Markov's inequality.) So at least $tfrac15 2^{N}$ must have $|sum_{i=1}^{N}epsilon_iz_i|^2leq 5/90.$ Requiring $epsilon_1=1$ halves this to $tfrac1{10} 2^{N}.$
Proof of Lemma 2: Given any three complex values I claim there are always two $z,w$ such that $|z+w|$ or $|z-w|$ is at most $max(|z|,|w|).$ This follows from the fact that some two make an angle of at most $pi/3$ after possibly negating some values: assume one value $z$ lies on the real axis, then $z$ or $-z$ makes an angle of less than $pi/3$ which anything not in the region $arg win(pi/3,2pi/3)cup (4pi/3,5pi/3)$; but any two points in this region make an angle of at most $pi/6$ with each other after possibly negating one. In algebraic terms this means $2mathrm{Re}(zoverline w)geq tfrac12 |z||w|,$ giving $|z-w|^2=|z|^2+|w|^2-2mathrm{Re}(zoverline w)leqmax(|z|,|w|).$
This lets us reduce to the case $N=2.$ Without loss of generality $z_1$ is a positive real, and negating $z_2$ if necessary we can assume $mathrm{Re}(z_2)leq 0.$ This gives $|z_1+z_2|^2leq|z_1|^2+|z_2|^2leq 10/90$ as required.
add a comment |
Partition ${1,dots,n}$ into thirty sets $I_1,dots,I_{30}$ such that $sum_{iin I_j}|z_i|^2<tfrac1{30}+tfrac1{100}<tfrac4{90}$ for each $1leq jleq 30.$ This can be achieved by starting with empty sets and adding greedily: the only impediment to adding a value to some $I_j$ is that $sum_{iin I_j}|z_i|^2geq tfrac1{30},$ but if that holds for all the $j$ then all the values must already be assigned.
Assume these lemmas for now:
Lemma 1. For any positive integer $N$ and any values $z_1,dots,z_N$ with $sum_{i=1}^N |z_i|^2leq 4/90,$ there exist at least $2^N/10$ tuples $(epsilon_1,dots,epsilon_N)in{-1,1}^{N}$ such that $|sum_{i=1}^{N}epsilon_iz_i|^2leq 5/90$ and $epsilon_1=1.$
Lemma 2. Given values $z_1,dots,z_N$ such that $|z_i|^2leq 5/90$ for $1leq ileq N,$ there exist $epsilon_1,dots,epsilon_Nin{-1,1}$ such that $|sum_{i=1}^Nepsilon_iz_i|leq 1/3.$ (Actually we only need the case $N=30.$)
Combining the tuples given by applying Lemma 1 to each $I_j,$ there are at least $2^n10^{-30}=2^n1000^{-10}>2^n1024^{-10}=2^{n-100}$ tuples $(epsilon_1,dots,epsilon_n)in{-1,1}^n$ such that $|sum_{iin I_j} epsilon_iz_i|^2leq 5/90$ and $epsilon_{min(I_j)}=1$ for each $j.$
For each of these tuples, by Lemma 2, we can find $(theta_1,dots,theta_{30})in{-1,1}^{30}$ such that $|sum_{j=1}^{30}theta_j(sum_{iin I_j} epsilon_iz_i)|leq 1/3.$ This gives a new tuple defined by $epsilon'_i=epsilon_itheta_j$ for each $iin I_j$ and $1leq jleq 30.$ The resulting $2^{n-100}$ tuples $epsilon'$ are distinct and satisfy $|sum_{i=1}^{n}epsilon'_iz_i|leq 1/3$ as required.
Proof of Lemma 1:
$$sum_{epsilonin{-1,1}^N}sum_{i=1}^{N}|epsilon_iz_i|^2
=sum_{epsilonin{-1,1}^N}sum_{i=1}^{N}epsilon_iz_ioverline{sum_{j=1}^{N}epsilon_jz_j}
=2^Nsum_{i=1}^{N}|z_i|^2leqtfrac{4}{90}2^N$$ because the $z_iz_j$ terms cancel. So it is not possible for more than $tfrac45 2^{N}$ tuples $epsilon$ to satisfy $|sum_{i=1}^{N}epsilon_iz_i|^2>5/90.$ (This is a form of Markov's inequality.) So at least $tfrac15 2^{N}$ must have $|sum_{i=1}^{N}epsilon_iz_i|^2leq 5/90.$ Requiring $epsilon_1=1$ halves this to $tfrac1{10} 2^{N}.$
Proof of Lemma 2: Given any three complex values I claim there are always two $z,w$ such that $|z+w|$ or $|z-w|$ is at most $max(|z|,|w|).$ This follows from the fact that some two make an angle of at most $pi/3$ after possibly negating some values: assume one value $z$ lies on the real axis, then $z$ or $-z$ makes an angle of less than $pi/3$ which anything not in the region $arg win(pi/3,2pi/3)cup (4pi/3,5pi/3)$; but any two points in this region make an angle of at most $pi/6$ with each other after possibly negating one. In algebraic terms this means $2mathrm{Re}(zoverline w)geq tfrac12 |z||w|,$ giving $|z-w|^2=|z|^2+|w|^2-2mathrm{Re}(zoverline w)leqmax(|z|,|w|).$
This lets us reduce to the case $N=2.$ Without loss of generality $z_1$ is a positive real, and negating $z_2$ if necessary we can assume $mathrm{Re}(z_2)leq 0.$ This gives $|z_1+z_2|^2leq|z_1|^2+|z_2|^2leq 10/90$ as required.
Partition ${1,dots,n}$ into thirty sets $I_1,dots,I_{30}$ such that $sum_{iin I_j}|z_i|^2<tfrac1{30}+tfrac1{100}<tfrac4{90}$ for each $1leq jleq 30.$ This can be achieved by starting with empty sets and adding greedily: the only impediment to adding a value to some $I_j$ is that $sum_{iin I_j}|z_i|^2geq tfrac1{30},$ but if that holds for all the $j$ then all the values must already be assigned.
Assume these lemmas for now:
Lemma 1. For any positive integer $N$ and any values $z_1,dots,z_N$ with $sum_{i=1}^N |z_i|^2leq 4/90,$ there exist at least $2^N/10$ tuples $(epsilon_1,dots,epsilon_N)in{-1,1}^{N}$ such that $|sum_{i=1}^{N}epsilon_iz_i|^2leq 5/90$ and $epsilon_1=1.$
Lemma 2. Given values $z_1,dots,z_N$ such that $|z_i|^2leq 5/90$ for $1leq ileq N,$ there exist $epsilon_1,dots,epsilon_Nin{-1,1}$ such that $|sum_{i=1}^Nepsilon_iz_i|leq 1/3.$ (Actually we only need the case $N=30.$)
Combining the tuples given by applying Lemma 1 to each $I_j,$ there are at least $2^n10^{-30}=2^n1000^{-10}>2^n1024^{-10}=2^{n-100}$ tuples $(epsilon_1,dots,epsilon_n)in{-1,1}^n$ such that $|sum_{iin I_j} epsilon_iz_i|^2leq 5/90$ and $epsilon_{min(I_j)}=1$ for each $j.$
For each of these tuples, by Lemma 2, we can find $(theta_1,dots,theta_{30})in{-1,1}^{30}$ such that $|sum_{j=1}^{30}theta_j(sum_{iin I_j} epsilon_iz_i)|leq 1/3.$ This gives a new tuple defined by $epsilon'_i=epsilon_itheta_j$ for each $iin I_j$ and $1leq jleq 30.$ The resulting $2^{n-100}$ tuples $epsilon'$ are distinct and satisfy $|sum_{i=1}^{n}epsilon'_iz_i|leq 1/3$ as required.
Proof of Lemma 1:
$$sum_{epsilonin{-1,1}^N}sum_{i=1}^{N}|epsilon_iz_i|^2
=sum_{epsilonin{-1,1}^N}sum_{i=1}^{N}epsilon_iz_ioverline{sum_{j=1}^{N}epsilon_jz_j}
=2^Nsum_{i=1}^{N}|z_i|^2leqtfrac{4}{90}2^N$$ because the $z_iz_j$ terms cancel. So it is not possible for more than $tfrac45 2^{N}$ tuples $epsilon$ to satisfy $|sum_{i=1}^{N}epsilon_iz_i|^2>5/90.$ (This is a form of Markov's inequality.) So at least $tfrac15 2^{N}$ must have $|sum_{i=1}^{N}epsilon_iz_i|^2leq 5/90.$ Requiring $epsilon_1=1$ halves this to $tfrac1{10} 2^{N}.$
Proof of Lemma 2: Given any three complex values I claim there are always two $z,w$ such that $|z+w|$ or $|z-w|$ is at most $max(|z|,|w|).$ This follows from the fact that some two make an angle of at most $pi/3$ after possibly negating some values: assume one value $z$ lies on the real axis, then $z$ or $-z$ makes an angle of less than $pi/3$ which anything not in the region $arg win(pi/3,2pi/3)cup (4pi/3,5pi/3)$; but any two points in this region make an angle of at most $pi/6$ with each other after possibly negating one. In algebraic terms this means $2mathrm{Re}(zoverline w)geq tfrac12 |z||w|,$ giving $|z-w|^2=|z|^2+|w|^2-2mathrm{Re}(zoverline w)leqmax(|z|,|w|).$
This lets us reduce to the case $N=2.$ Without loss of generality $z_1$ is a positive real, and negating $z_2$ if necessary we can assume $mathrm{Re}(z_2)leq 0.$ This gives $|z_1+z_2|^2leq|z_1|^2+|z_2|^2leq 10/90$ as required.
edited yesterday
answered yesterday
DapDap
14.7k635
14.7k635
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1073141%2fhow-prove-this-the-number-of-ordered-n-tuples-varepsilon-1-cdots-vareps%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
It seems that the question should be about the number of ordered $n$-tuples $(varepsilon_{1},varepsilon_{2},cdots,varepsilon_{n})$ instead of the number of ordered $n$-tuples $(z_{1},z_{2},cdots,z_{n})$.
– Alex Ravsky
Dec 18 '14 at 15:24
Yes.that's your mean.Thank you
– math110
Dec 18 '14 at 15:32