Is there a value of $t$ above which these inequalities aren't jointly satisfiable
$begingroup$
Let ${a_{1}, ...., a_{8}} in [0, 1]$ be such that $sum limits_{0 < i leq 8} a_{i} = 1$ and let $t in (frac{1}{2}, 1]$. Is there a value of $t$ above which the following inequalities aren't jointly satisfiable? I know that they are all satisfiable for any value of $t leq frac{2}{3}$.
(1) $frac{a_{1} + a_{2}}{a_{1} + a_{2} + a_{3} + a_{4}} geq t$
(2) $frac{a_{1} + a_{5}}{a_{1} + a_{2} + a_{5} + a_{6}} geq t$
(3) $frac{a_{4} + a_{8}}{a_{2} + a_{4} + a_{6} + a_{8}} geq t$
(4) $frac{a_{7} + a_{8}}{a_{3} + a_{4} + a_{7} + a_{8}} geq t$
(5) $frac{a_{1} + a_{3}}{a_{1} + a_{2} + a_{3} + a_{4}} leq 1 - t$
(6) $frac{a_{6} + a_{8}}{a_{2} + a_{4} + a_{6} + a_{8}} leq 1 - t$
linear-algebra probability inequality
$endgroup$
add a comment |
$begingroup$
Let ${a_{1}, ...., a_{8}} in [0, 1]$ be such that $sum limits_{0 < i leq 8} a_{i} = 1$ and let $t in (frac{1}{2}, 1]$. Is there a value of $t$ above which the following inequalities aren't jointly satisfiable? I know that they are all satisfiable for any value of $t leq frac{2}{3}$.
(1) $frac{a_{1} + a_{2}}{a_{1} + a_{2} + a_{3} + a_{4}} geq t$
(2) $frac{a_{1} + a_{5}}{a_{1} + a_{2} + a_{5} + a_{6}} geq t$
(3) $frac{a_{4} + a_{8}}{a_{2} + a_{4} + a_{6} + a_{8}} geq t$
(4) $frac{a_{7} + a_{8}}{a_{3} + a_{4} + a_{7} + a_{8}} geq t$
(5) $frac{a_{1} + a_{3}}{a_{1} + a_{2} + a_{3} + a_{4}} leq 1 - t$
(6) $frac{a_{6} + a_{8}}{a_{2} + a_{4} + a_{6} + a_{8}} leq 1 - t$
linear-algebra probability inequality
$endgroup$
$begingroup$
Does the summation of the $a_i$ start from $0$ or $1$?
$endgroup$
– EuxhenH
Jan 8 at 14:30
$begingroup$
@EuxhenH, sorry it starts from 1, there is no $a_{0}$. I'll edit the question now.
$endgroup$
– King Kong
Jan 8 at 15:27
1
$begingroup$
@Alex Ravsky, i'm looking for the smallest $t$ such that there exist no feasible $a_{1}, ...., a_{8}$ that satisfy all six inequalities.
$endgroup$
– King Kong
Jan 14 at 14:11
add a comment |
$begingroup$
Let ${a_{1}, ...., a_{8}} in [0, 1]$ be such that $sum limits_{0 < i leq 8} a_{i} = 1$ and let $t in (frac{1}{2}, 1]$. Is there a value of $t$ above which the following inequalities aren't jointly satisfiable? I know that they are all satisfiable for any value of $t leq frac{2}{3}$.
(1) $frac{a_{1} + a_{2}}{a_{1} + a_{2} + a_{3} + a_{4}} geq t$
(2) $frac{a_{1} + a_{5}}{a_{1} + a_{2} + a_{5} + a_{6}} geq t$
(3) $frac{a_{4} + a_{8}}{a_{2} + a_{4} + a_{6} + a_{8}} geq t$
(4) $frac{a_{7} + a_{8}}{a_{3} + a_{4} + a_{7} + a_{8}} geq t$
(5) $frac{a_{1} + a_{3}}{a_{1} + a_{2} + a_{3} + a_{4}} leq 1 - t$
(6) $frac{a_{6} + a_{8}}{a_{2} + a_{4} + a_{6} + a_{8}} leq 1 - t$
linear-algebra probability inequality
$endgroup$
Let ${a_{1}, ...., a_{8}} in [0, 1]$ be such that $sum limits_{0 < i leq 8} a_{i} = 1$ and let $t in (frac{1}{2}, 1]$. Is there a value of $t$ above which the following inequalities aren't jointly satisfiable? I know that they are all satisfiable for any value of $t leq frac{2}{3}$.
(1) $frac{a_{1} + a_{2}}{a_{1} + a_{2} + a_{3} + a_{4}} geq t$
(2) $frac{a_{1} + a_{5}}{a_{1} + a_{2} + a_{5} + a_{6}} geq t$
(3) $frac{a_{4} + a_{8}}{a_{2} + a_{4} + a_{6} + a_{8}} geq t$
(4) $frac{a_{7} + a_{8}}{a_{3} + a_{4} + a_{7} + a_{8}} geq t$
(5) $frac{a_{1} + a_{3}}{a_{1} + a_{2} + a_{3} + a_{4}} leq 1 - t$
(6) $frac{a_{6} + a_{8}}{a_{2} + a_{4} + a_{6} + a_{8}} leq 1 - t$
linear-algebra probability inequality
linear-algebra probability inequality
edited Jan 15 at 11:31
Alex Ravsky
43.2k32583
43.2k32583
asked Jan 8 at 12:14
King KongKing Kong
11010
11010
$begingroup$
Does the summation of the $a_i$ start from $0$ or $1$?
$endgroup$
– EuxhenH
Jan 8 at 14:30
$begingroup$
@EuxhenH, sorry it starts from 1, there is no $a_{0}$. I'll edit the question now.
$endgroup$
– King Kong
Jan 8 at 15:27
1
$begingroup$
@Alex Ravsky, i'm looking for the smallest $t$ such that there exist no feasible $a_{1}, ...., a_{8}$ that satisfy all six inequalities.
$endgroup$
– King Kong
Jan 14 at 14:11
add a comment |
$begingroup$
Does the summation of the $a_i$ start from $0$ or $1$?
$endgroup$
– EuxhenH
Jan 8 at 14:30
$begingroup$
@EuxhenH, sorry it starts from 1, there is no $a_{0}$. I'll edit the question now.
$endgroup$
– King Kong
Jan 8 at 15:27
1
$begingroup$
@Alex Ravsky, i'm looking for the smallest $t$ such that there exist no feasible $a_{1}, ...., a_{8}$ that satisfy all six inequalities.
$endgroup$
– King Kong
Jan 14 at 14:11
$begingroup$
Does the summation of the $a_i$ start from $0$ or $1$?
$endgroup$
– EuxhenH
Jan 8 at 14:30
$begingroup$
Does the summation of the $a_i$ start from $0$ or $1$?
$endgroup$
– EuxhenH
Jan 8 at 14:30
$begingroup$
@EuxhenH, sorry it starts from 1, there is no $a_{0}$. I'll edit the question now.
$endgroup$
– King Kong
Jan 8 at 15:27
$begingroup$
@EuxhenH, sorry it starts from 1, there is no $a_{0}$. I'll edit the question now.
$endgroup$
– King Kong
Jan 8 at 15:27
1
1
$begingroup$
@Alex Ravsky, i'm looking for the smallest $t$ such that there exist no feasible $a_{1}, ...., a_{8}$ that satisfy all six inequalities.
$endgroup$
– King Kong
Jan 14 at 14:11
$begingroup$
@Alex Ravsky, i'm looking for the smallest $t$ such that there exist no feasible $a_{1}, ...., a_{8}$ that satisfy all six inequalities.
$endgroup$
– King Kong
Jan 14 at 14:11
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Let’s start a quest for a largest $t<1$ for which there exist feasible $a_1,dots, a_8$ that satisfy all six inequalities. In this quest we can drop the condition $sum a_i=1$, because if non-negative numbers $a_i$ satisfy the inequalities for some $t$ then numbers $a’_i=frac {a_i}{sum a_j}$ also satisfy the inequalities for the same $t$ and $sum a’_i=1$.
Now note that each of $a_5$ and $a_7$ occur in only one inequality, (2) and (4), respectively. Pick any of these $a_i$’s and fix all other $a_j$’s. Then when $a_i$ tends to infinity, the left hand side of the inequality, in which it occurs, tends to $1$. Since $t<1$, for all other $a_j$’s the inequality will be satisfied for sufficiently large $a_i$. Thus in our quest we can drop both $a_5$ and $a_7$ and the inequalities (2) and (4).
After routine transformations, we can simplify the remaining inequalities to the following
(1’) $a_1+a_2ge s(a_3+a_4)$
(3’) $a_4+a_8ge s(a_2+a_6)$
(5’) $a_2+a_4ge s(a_1+a_3)$
(6’) $a_2+a_4ge s(a_6+a_8)$.
Here $s=frac {t}{1-t}>0,$ because $t>frac 12$.
Since $a_3$ and $a_6$ occur only at the right hand sides of the inequalities, when we annulate them, the inequality still be satisfied.
Now the inequalities transform to
(1’’) $a_1+a_2ge sa_4$
(3’’) $a_4+a_8ge sa_2$
(5’’) $a_2+a_4ge sa_1$
(6’’) $a_2+a_4ge sa_8$.
Adding (1’’) and (3’’), we obtain $a_1+a_8ge (s-1)(a_2+a_4)$. Adding (5’’) and (6’’), we obtain $2(a_2+a_4)ge s(a_1+a_8)$. Since, by $1$, $a_1+a_2+a_3+a_4>0$, and $a_3=0$, we have that both $A=a_1+a_8$ and $B=a_2+a_4$ are positive. Since $2Age 2(s-1)Bge s(s-1)A$, we have $s(s-1)le 2$. This implies $sle 2$ and $tlefrac 23$.
In order to satisfy inequalities (1’’)-(6’’) with $s=2$ we may try to put $a_1=a_8=a$ and $a_2=a_4=b$. Then the inequalities will be satisfied iff $a=b$. If we put $a>0$, $a_3=a_6=0$, $a_5=a_7=a$, the inequalities (2) and (4) also will be satisfied. At last, to achieve $sum a_i=1$, we put $a=frac 16$.
$endgroup$
1
$begingroup$
Fantastic, thanks! So $2/3$ is the greatest value of $t$ for which the inequalities are jointly satisfiable, right?
$endgroup$
– King Kong
Jan 16 at 8:31
1
$begingroup$
Right. According to your comment, $frac 23$ is the biggest value of $t in (frac{1}{2}, 1]$ for which there exist $a_{1},dots, a_{8} in [0, 1]$ satisfying all inequalities (1)-(6) such that $sum limits_{0 < i leq 8} a_{i} = 1$.
$endgroup$
– Alex Ravsky
Jan 16 at 9:47
1
$begingroup$
cool, accepting the answer now
$endgroup$
– King Kong
Jan 16 at 10:05
add a comment |
$begingroup$
Let $a_1=a_4=frac{1}{2}$ and everything else equal $0$ (all fractions make sense for these choices since $a_1$ and $a_4$ appear in all denominators). Choose $t=1$. From $(1)$ we get $frac{1}{2}geq 1$ and from $(2)$ we get $1geq 1$, so they are not jointly satisfiable.
(Forgive me if I understood the problem wrong).
$endgroup$
$begingroup$
Thanks, you've understood correctly and that looks right. But are there any values below 1 for which they aren't satisfiable, and if so, what is the lowest such value?
$endgroup$
– King Kong
Jan 8 at 15:32
$begingroup$
Let $a_7=a_8=0$ and the other $a_ineq 0$. Then from $(4)$ we get $0geq t$. So if they will be satisfied then $tleq 0$.
$endgroup$
– EuxhenH
Jan 8 at 15:41
$begingroup$
Yes, but this doesn't tell us anything about the range of values of $t$ for which the inequalities are jointly satisfiable.
$endgroup$
– King Kong
Jan 8 at 15:50
$begingroup$
It doesn't. I am just giving an upper bound.
$endgroup$
– EuxhenH
Jan 8 at 15:56
add a comment |
Your Answer
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%2f3066099%2fis-there-a-value-of-t-above-which-these-inequalities-arent-jointly-satisfiabl%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let’s start a quest for a largest $t<1$ for which there exist feasible $a_1,dots, a_8$ that satisfy all six inequalities. In this quest we can drop the condition $sum a_i=1$, because if non-negative numbers $a_i$ satisfy the inequalities for some $t$ then numbers $a’_i=frac {a_i}{sum a_j}$ also satisfy the inequalities for the same $t$ and $sum a’_i=1$.
Now note that each of $a_5$ and $a_7$ occur in only one inequality, (2) and (4), respectively. Pick any of these $a_i$’s and fix all other $a_j$’s. Then when $a_i$ tends to infinity, the left hand side of the inequality, in which it occurs, tends to $1$. Since $t<1$, for all other $a_j$’s the inequality will be satisfied for sufficiently large $a_i$. Thus in our quest we can drop both $a_5$ and $a_7$ and the inequalities (2) and (4).
After routine transformations, we can simplify the remaining inequalities to the following
(1’) $a_1+a_2ge s(a_3+a_4)$
(3’) $a_4+a_8ge s(a_2+a_6)$
(5’) $a_2+a_4ge s(a_1+a_3)$
(6’) $a_2+a_4ge s(a_6+a_8)$.
Here $s=frac {t}{1-t}>0,$ because $t>frac 12$.
Since $a_3$ and $a_6$ occur only at the right hand sides of the inequalities, when we annulate them, the inequality still be satisfied.
Now the inequalities transform to
(1’’) $a_1+a_2ge sa_4$
(3’’) $a_4+a_8ge sa_2$
(5’’) $a_2+a_4ge sa_1$
(6’’) $a_2+a_4ge sa_8$.
Adding (1’’) and (3’’), we obtain $a_1+a_8ge (s-1)(a_2+a_4)$. Adding (5’’) and (6’’), we obtain $2(a_2+a_4)ge s(a_1+a_8)$. Since, by $1$, $a_1+a_2+a_3+a_4>0$, and $a_3=0$, we have that both $A=a_1+a_8$ and $B=a_2+a_4$ are positive. Since $2Age 2(s-1)Bge s(s-1)A$, we have $s(s-1)le 2$. This implies $sle 2$ and $tlefrac 23$.
In order to satisfy inequalities (1’’)-(6’’) with $s=2$ we may try to put $a_1=a_8=a$ and $a_2=a_4=b$. Then the inequalities will be satisfied iff $a=b$. If we put $a>0$, $a_3=a_6=0$, $a_5=a_7=a$, the inequalities (2) and (4) also will be satisfied. At last, to achieve $sum a_i=1$, we put $a=frac 16$.
$endgroup$
1
$begingroup$
Fantastic, thanks! So $2/3$ is the greatest value of $t$ for which the inequalities are jointly satisfiable, right?
$endgroup$
– King Kong
Jan 16 at 8:31
1
$begingroup$
Right. According to your comment, $frac 23$ is the biggest value of $t in (frac{1}{2}, 1]$ for which there exist $a_{1},dots, a_{8} in [0, 1]$ satisfying all inequalities (1)-(6) such that $sum limits_{0 < i leq 8} a_{i} = 1$.
$endgroup$
– Alex Ravsky
Jan 16 at 9:47
1
$begingroup$
cool, accepting the answer now
$endgroup$
– King Kong
Jan 16 at 10:05
add a comment |
$begingroup$
Let’s start a quest for a largest $t<1$ for which there exist feasible $a_1,dots, a_8$ that satisfy all six inequalities. In this quest we can drop the condition $sum a_i=1$, because if non-negative numbers $a_i$ satisfy the inequalities for some $t$ then numbers $a’_i=frac {a_i}{sum a_j}$ also satisfy the inequalities for the same $t$ and $sum a’_i=1$.
Now note that each of $a_5$ and $a_7$ occur in only one inequality, (2) and (4), respectively. Pick any of these $a_i$’s and fix all other $a_j$’s. Then when $a_i$ tends to infinity, the left hand side of the inequality, in which it occurs, tends to $1$. Since $t<1$, for all other $a_j$’s the inequality will be satisfied for sufficiently large $a_i$. Thus in our quest we can drop both $a_5$ and $a_7$ and the inequalities (2) and (4).
After routine transformations, we can simplify the remaining inequalities to the following
(1’) $a_1+a_2ge s(a_3+a_4)$
(3’) $a_4+a_8ge s(a_2+a_6)$
(5’) $a_2+a_4ge s(a_1+a_3)$
(6’) $a_2+a_4ge s(a_6+a_8)$.
Here $s=frac {t}{1-t}>0,$ because $t>frac 12$.
Since $a_3$ and $a_6$ occur only at the right hand sides of the inequalities, when we annulate them, the inequality still be satisfied.
Now the inequalities transform to
(1’’) $a_1+a_2ge sa_4$
(3’’) $a_4+a_8ge sa_2$
(5’’) $a_2+a_4ge sa_1$
(6’’) $a_2+a_4ge sa_8$.
Adding (1’’) and (3’’), we obtain $a_1+a_8ge (s-1)(a_2+a_4)$. Adding (5’’) and (6’’), we obtain $2(a_2+a_4)ge s(a_1+a_8)$. Since, by $1$, $a_1+a_2+a_3+a_4>0$, and $a_3=0$, we have that both $A=a_1+a_8$ and $B=a_2+a_4$ are positive. Since $2Age 2(s-1)Bge s(s-1)A$, we have $s(s-1)le 2$. This implies $sle 2$ and $tlefrac 23$.
In order to satisfy inequalities (1’’)-(6’’) with $s=2$ we may try to put $a_1=a_8=a$ and $a_2=a_4=b$. Then the inequalities will be satisfied iff $a=b$. If we put $a>0$, $a_3=a_6=0$, $a_5=a_7=a$, the inequalities (2) and (4) also will be satisfied. At last, to achieve $sum a_i=1$, we put $a=frac 16$.
$endgroup$
1
$begingroup$
Fantastic, thanks! So $2/3$ is the greatest value of $t$ for which the inequalities are jointly satisfiable, right?
$endgroup$
– King Kong
Jan 16 at 8:31
1
$begingroup$
Right. According to your comment, $frac 23$ is the biggest value of $t in (frac{1}{2}, 1]$ for which there exist $a_{1},dots, a_{8} in [0, 1]$ satisfying all inequalities (1)-(6) such that $sum limits_{0 < i leq 8} a_{i} = 1$.
$endgroup$
– Alex Ravsky
Jan 16 at 9:47
1
$begingroup$
cool, accepting the answer now
$endgroup$
– King Kong
Jan 16 at 10:05
add a comment |
$begingroup$
Let’s start a quest for a largest $t<1$ for which there exist feasible $a_1,dots, a_8$ that satisfy all six inequalities. In this quest we can drop the condition $sum a_i=1$, because if non-negative numbers $a_i$ satisfy the inequalities for some $t$ then numbers $a’_i=frac {a_i}{sum a_j}$ also satisfy the inequalities for the same $t$ and $sum a’_i=1$.
Now note that each of $a_5$ and $a_7$ occur in only one inequality, (2) and (4), respectively. Pick any of these $a_i$’s and fix all other $a_j$’s. Then when $a_i$ tends to infinity, the left hand side of the inequality, in which it occurs, tends to $1$. Since $t<1$, for all other $a_j$’s the inequality will be satisfied for sufficiently large $a_i$. Thus in our quest we can drop both $a_5$ and $a_7$ and the inequalities (2) and (4).
After routine transformations, we can simplify the remaining inequalities to the following
(1’) $a_1+a_2ge s(a_3+a_4)$
(3’) $a_4+a_8ge s(a_2+a_6)$
(5’) $a_2+a_4ge s(a_1+a_3)$
(6’) $a_2+a_4ge s(a_6+a_8)$.
Here $s=frac {t}{1-t}>0,$ because $t>frac 12$.
Since $a_3$ and $a_6$ occur only at the right hand sides of the inequalities, when we annulate them, the inequality still be satisfied.
Now the inequalities transform to
(1’’) $a_1+a_2ge sa_4$
(3’’) $a_4+a_8ge sa_2$
(5’’) $a_2+a_4ge sa_1$
(6’’) $a_2+a_4ge sa_8$.
Adding (1’’) and (3’’), we obtain $a_1+a_8ge (s-1)(a_2+a_4)$. Adding (5’’) and (6’’), we obtain $2(a_2+a_4)ge s(a_1+a_8)$. Since, by $1$, $a_1+a_2+a_3+a_4>0$, and $a_3=0$, we have that both $A=a_1+a_8$ and $B=a_2+a_4$ are positive. Since $2Age 2(s-1)Bge s(s-1)A$, we have $s(s-1)le 2$. This implies $sle 2$ and $tlefrac 23$.
In order to satisfy inequalities (1’’)-(6’’) with $s=2$ we may try to put $a_1=a_8=a$ and $a_2=a_4=b$. Then the inequalities will be satisfied iff $a=b$. If we put $a>0$, $a_3=a_6=0$, $a_5=a_7=a$, the inequalities (2) and (4) also will be satisfied. At last, to achieve $sum a_i=1$, we put $a=frac 16$.
$endgroup$
Let’s start a quest for a largest $t<1$ for which there exist feasible $a_1,dots, a_8$ that satisfy all six inequalities. In this quest we can drop the condition $sum a_i=1$, because if non-negative numbers $a_i$ satisfy the inequalities for some $t$ then numbers $a’_i=frac {a_i}{sum a_j}$ also satisfy the inequalities for the same $t$ and $sum a’_i=1$.
Now note that each of $a_5$ and $a_7$ occur in only one inequality, (2) and (4), respectively. Pick any of these $a_i$’s and fix all other $a_j$’s. Then when $a_i$ tends to infinity, the left hand side of the inequality, in which it occurs, tends to $1$. Since $t<1$, for all other $a_j$’s the inequality will be satisfied for sufficiently large $a_i$. Thus in our quest we can drop both $a_5$ and $a_7$ and the inequalities (2) and (4).
After routine transformations, we can simplify the remaining inequalities to the following
(1’) $a_1+a_2ge s(a_3+a_4)$
(3’) $a_4+a_8ge s(a_2+a_6)$
(5’) $a_2+a_4ge s(a_1+a_3)$
(6’) $a_2+a_4ge s(a_6+a_8)$.
Here $s=frac {t}{1-t}>0,$ because $t>frac 12$.
Since $a_3$ and $a_6$ occur only at the right hand sides of the inequalities, when we annulate them, the inequality still be satisfied.
Now the inequalities transform to
(1’’) $a_1+a_2ge sa_4$
(3’’) $a_4+a_8ge sa_2$
(5’’) $a_2+a_4ge sa_1$
(6’’) $a_2+a_4ge sa_8$.
Adding (1’’) and (3’’), we obtain $a_1+a_8ge (s-1)(a_2+a_4)$. Adding (5’’) and (6’’), we obtain $2(a_2+a_4)ge s(a_1+a_8)$. Since, by $1$, $a_1+a_2+a_3+a_4>0$, and $a_3=0$, we have that both $A=a_1+a_8$ and $B=a_2+a_4$ are positive. Since $2Age 2(s-1)Bge s(s-1)A$, we have $s(s-1)le 2$. This implies $sle 2$ and $tlefrac 23$.
In order to satisfy inequalities (1’’)-(6’’) with $s=2$ we may try to put $a_1=a_8=a$ and $a_2=a_4=b$. Then the inequalities will be satisfied iff $a=b$. If we put $a>0$, $a_3=a_6=0$, $a_5=a_7=a$, the inequalities (2) and (4) also will be satisfied. At last, to achieve $sum a_i=1$, we put $a=frac 16$.
answered Jan 15 at 11:30
Alex RavskyAlex Ravsky
43.2k32583
43.2k32583
1
$begingroup$
Fantastic, thanks! So $2/3$ is the greatest value of $t$ for which the inequalities are jointly satisfiable, right?
$endgroup$
– King Kong
Jan 16 at 8:31
1
$begingroup$
Right. According to your comment, $frac 23$ is the biggest value of $t in (frac{1}{2}, 1]$ for which there exist $a_{1},dots, a_{8} in [0, 1]$ satisfying all inequalities (1)-(6) such that $sum limits_{0 < i leq 8} a_{i} = 1$.
$endgroup$
– Alex Ravsky
Jan 16 at 9:47
1
$begingroup$
cool, accepting the answer now
$endgroup$
– King Kong
Jan 16 at 10:05
add a comment |
1
$begingroup$
Fantastic, thanks! So $2/3$ is the greatest value of $t$ for which the inequalities are jointly satisfiable, right?
$endgroup$
– King Kong
Jan 16 at 8:31
1
$begingroup$
Right. According to your comment, $frac 23$ is the biggest value of $t in (frac{1}{2}, 1]$ for which there exist $a_{1},dots, a_{8} in [0, 1]$ satisfying all inequalities (1)-(6) such that $sum limits_{0 < i leq 8} a_{i} = 1$.
$endgroup$
– Alex Ravsky
Jan 16 at 9:47
1
$begingroup$
cool, accepting the answer now
$endgroup$
– King Kong
Jan 16 at 10:05
1
1
$begingroup$
Fantastic, thanks! So $2/3$ is the greatest value of $t$ for which the inequalities are jointly satisfiable, right?
$endgroup$
– King Kong
Jan 16 at 8:31
$begingroup$
Fantastic, thanks! So $2/3$ is the greatest value of $t$ for which the inequalities are jointly satisfiable, right?
$endgroup$
– King Kong
Jan 16 at 8:31
1
1
$begingroup$
Right. According to your comment, $frac 23$ is the biggest value of $t in (frac{1}{2}, 1]$ for which there exist $a_{1},dots, a_{8} in [0, 1]$ satisfying all inequalities (1)-(6) such that $sum limits_{0 < i leq 8} a_{i} = 1$.
$endgroup$
– Alex Ravsky
Jan 16 at 9:47
$begingroup$
Right. According to your comment, $frac 23$ is the biggest value of $t in (frac{1}{2}, 1]$ for which there exist $a_{1},dots, a_{8} in [0, 1]$ satisfying all inequalities (1)-(6) such that $sum limits_{0 < i leq 8} a_{i} = 1$.
$endgroup$
– Alex Ravsky
Jan 16 at 9:47
1
1
$begingroup$
cool, accepting the answer now
$endgroup$
– King Kong
Jan 16 at 10:05
$begingroup$
cool, accepting the answer now
$endgroup$
– King Kong
Jan 16 at 10:05
add a comment |
$begingroup$
Let $a_1=a_4=frac{1}{2}$ and everything else equal $0$ (all fractions make sense for these choices since $a_1$ and $a_4$ appear in all denominators). Choose $t=1$. From $(1)$ we get $frac{1}{2}geq 1$ and from $(2)$ we get $1geq 1$, so they are not jointly satisfiable.
(Forgive me if I understood the problem wrong).
$endgroup$
$begingroup$
Thanks, you've understood correctly and that looks right. But are there any values below 1 for which they aren't satisfiable, and if so, what is the lowest such value?
$endgroup$
– King Kong
Jan 8 at 15:32
$begingroup$
Let $a_7=a_8=0$ and the other $a_ineq 0$. Then from $(4)$ we get $0geq t$. So if they will be satisfied then $tleq 0$.
$endgroup$
– EuxhenH
Jan 8 at 15:41
$begingroup$
Yes, but this doesn't tell us anything about the range of values of $t$ for which the inequalities are jointly satisfiable.
$endgroup$
– King Kong
Jan 8 at 15:50
$begingroup$
It doesn't. I am just giving an upper bound.
$endgroup$
– EuxhenH
Jan 8 at 15:56
add a comment |
$begingroup$
Let $a_1=a_4=frac{1}{2}$ and everything else equal $0$ (all fractions make sense for these choices since $a_1$ and $a_4$ appear in all denominators). Choose $t=1$. From $(1)$ we get $frac{1}{2}geq 1$ and from $(2)$ we get $1geq 1$, so they are not jointly satisfiable.
(Forgive me if I understood the problem wrong).
$endgroup$
$begingroup$
Thanks, you've understood correctly and that looks right. But are there any values below 1 for which they aren't satisfiable, and if so, what is the lowest such value?
$endgroup$
– King Kong
Jan 8 at 15:32
$begingroup$
Let $a_7=a_8=0$ and the other $a_ineq 0$. Then from $(4)$ we get $0geq t$. So if they will be satisfied then $tleq 0$.
$endgroup$
– EuxhenH
Jan 8 at 15:41
$begingroup$
Yes, but this doesn't tell us anything about the range of values of $t$ for which the inequalities are jointly satisfiable.
$endgroup$
– King Kong
Jan 8 at 15:50
$begingroup$
It doesn't. I am just giving an upper bound.
$endgroup$
– EuxhenH
Jan 8 at 15:56
add a comment |
$begingroup$
Let $a_1=a_4=frac{1}{2}$ and everything else equal $0$ (all fractions make sense for these choices since $a_1$ and $a_4$ appear in all denominators). Choose $t=1$. From $(1)$ we get $frac{1}{2}geq 1$ and from $(2)$ we get $1geq 1$, so they are not jointly satisfiable.
(Forgive me if I understood the problem wrong).
$endgroup$
Let $a_1=a_4=frac{1}{2}$ and everything else equal $0$ (all fractions make sense for these choices since $a_1$ and $a_4$ appear in all denominators). Choose $t=1$. From $(1)$ we get $frac{1}{2}geq 1$ and from $(2)$ we get $1geq 1$, so they are not jointly satisfiable.
(Forgive me if I understood the problem wrong).
answered Jan 8 at 14:36
EuxhenHEuxhenH
546212
546212
$begingroup$
Thanks, you've understood correctly and that looks right. But are there any values below 1 for which they aren't satisfiable, and if so, what is the lowest such value?
$endgroup$
– King Kong
Jan 8 at 15:32
$begingroup$
Let $a_7=a_8=0$ and the other $a_ineq 0$. Then from $(4)$ we get $0geq t$. So if they will be satisfied then $tleq 0$.
$endgroup$
– EuxhenH
Jan 8 at 15:41
$begingroup$
Yes, but this doesn't tell us anything about the range of values of $t$ for which the inequalities are jointly satisfiable.
$endgroup$
– King Kong
Jan 8 at 15:50
$begingroup$
It doesn't. I am just giving an upper bound.
$endgroup$
– EuxhenH
Jan 8 at 15:56
add a comment |
$begingroup$
Thanks, you've understood correctly and that looks right. But are there any values below 1 for which they aren't satisfiable, and if so, what is the lowest such value?
$endgroup$
– King Kong
Jan 8 at 15:32
$begingroup$
Let $a_7=a_8=0$ and the other $a_ineq 0$. Then from $(4)$ we get $0geq t$. So if they will be satisfied then $tleq 0$.
$endgroup$
– EuxhenH
Jan 8 at 15:41
$begingroup$
Yes, but this doesn't tell us anything about the range of values of $t$ for which the inequalities are jointly satisfiable.
$endgroup$
– King Kong
Jan 8 at 15:50
$begingroup$
It doesn't. I am just giving an upper bound.
$endgroup$
– EuxhenH
Jan 8 at 15:56
$begingroup$
Thanks, you've understood correctly and that looks right. But are there any values below 1 for which they aren't satisfiable, and if so, what is the lowest such value?
$endgroup$
– King Kong
Jan 8 at 15:32
$begingroup$
Thanks, you've understood correctly and that looks right. But are there any values below 1 for which they aren't satisfiable, and if so, what is the lowest such value?
$endgroup$
– King Kong
Jan 8 at 15:32
$begingroup$
Let $a_7=a_8=0$ and the other $a_ineq 0$. Then from $(4)$ we get $0geq t$. So if they will be satisfied then $tleq 0$.
$endgroup$
– EuxhenH
Jan 8 at 15:41
$begingroup$
Let $a_7=a_8=0$ and the other $a_ineq 0$. Then from $(4)$ we get $0geq t$. So if they will be satisfied then $tleq 0$.
$endgroup$
– EuxhenH
Jan 8 at 15:41
$begingroup$
Yes, but this doesn't tell us anything about the range of values of $t$ for which the inequalities are jointly satisfiable.
$endgroup$
– King Kong
Jan 8 at 15:50
$begingroup$
Yes, but this doesn't tell us anything about the range of values of $t$ for which the inequalities are jointly satisfiable.
$endgroup$
– King Kong
Jan 8 at 15:50
$begingroup$
It doesn't. I am just giving an upper bound.
$endgroup$
– EuxhenH
Jan 8 at 15:56
$begingroup$
It doesn't. I am just giving an upper bound.
$endgroup$
– EuxhenH
Jan 8 at 15:56
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.
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%2f3066099%2fis-there-a-value-of-t-above-which-these-inequalities-arent-jointly-satisfiabl%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
$begingroup$
Does the summation of the $a_i$ start from $0$ or $1$?
$endgroup$
– EuxhenH
Jan 8 at 14:30
$begingroup$
@EuxhenH, sorry it starts from 1, there is no $a_{0}$. I'll edit the question now.
$endgroup$
– King Kong
Jan 8 at 15:27
1
$begingroup$
@Alex Ravsky, i'm looking for the smallest $t$ such that there exist no feasible $a_{1}, ...., a_{8}$ that satisfy all six inequalities.
$endgroup$
– King Kong
Jan 14 at 14:11