Prove that 0 is in the convex hull of points chosen from each orthant
Clash Royale CLAN TAG#URR8PPP
$begingroup$
If we arbitrarily choose a point from each orthant in $mathbbR^n$, that is we choose $2^n$ points in total, how do we prove that 0 is in the convex hull of these $2^n$ points? It seems obvious, but when I sit down and start thinking about it, I couldn't definitely find a set of $lambda_i, i = 1,2,cdots,2^n$ such that $0 leq lambda_i leq 1, sum_i lambda_i = 1$ and $0 = sum_i lambda_i x_i$, where $x_i, i = 1,2,cdots,2^n$ are any set of points satisfying the condition.
convex-analysis convex-geometry convex-hulls
asked Jan 28 at 18:03
Sean IanSean Ian
1035
$endgroup$
add a comment |
$begingroup$
If we arbitrarily choose a point from each orthant in $mathbbR^n$, that is we choose $2^n$ points in total, how do we prove that 0 is in the convex hull of these $2^n$ points? It seems obvious, but when I sit down and start thinking about it, I couldn't definitely find a set of $lambda_i, i = 1,2,cdots,2^n$ such that $0 leq lambda_i leq 1, sum_i lambda_i = 1$ and $0 = sum_i lambda_i x_i$, where $x_i, i = 1,2,cdots,2^n$ are any set of points satisfying the condition.
convex-analysis convex-geometry convex-hulls
asked Jan 28 at 18:03
Sean IanSean Ian
1035
$endgroup$
add a comment |
$begingroup$
If we arbitrarily choose a point from each orthant in $mathbbR^n$, that is we choose $2^n$ points in total, how do we prove that 0 is in the convex hull of these $2^n$ points? It seems obvious, but when I sit down and start thinking about it, I couldn't definitely find a set of $lambda_i, i = 1,2,cdots,2^n$ such that $0 leq lambda_i leq 1, sum_i lambda_i = 1$ and $0 = sum_i lambda_i x_i$, where $x_i, i = 1,2,cdots,2^n$ are any set of points satisfying the condition.
convex-analysis convex-geometry convex-hulls
asked Jan 28 at 18:03
Sean IanSean Ian
1035
$endgroup$
If we arbitrarily choose a point from each orthant in $mathbbR^n$, that is we choose $2^n$ points in total, how do we prove that 0 is in the convex hull of these $2^n$ points? It seems obvious, but when I sit down and start thinking about it, I couldn't definitely find a set of $lambda_i, i = 1,2,cdots,2^n$ such that $0 leq lambda_i leq 1, sum_i lambda_i = 1$ and $0 = sum_i lambda_i x_i$, where $x_i, i = 1,2,cdots,2^n$ are any set of points satisfying the condition.
convex-analysis convex-geometry convex-hulls
convex-analysis convex-geometry convex-hulls
asked Jan 28 at 18:03
Sean IanSean Ian
1035
asked Jan 28 at 18:03
Sean IanSean Ian
1035
asked Jan 28 at 18:03
Sean IanSean Ian
1035
asked Jan 28 at 18:03
Sean IanSean Ian
1035
asked Jan 28 at 18:03
Sean IanSean Ian
1035
1035
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Induct on dimension.
In the $n=1$ base case, you have a positive number and a negative number; $0$ can be represented as a convex combination of them.
For $n>1$: Given your $2^n$ points, one from each orthant, divide them into 2 sets of size $2^n-1$, where the first set has points whose last coordinates are positive and the second set where the last coordinates are negative. By the inductive hypothesis there is a convex combo of the first set of points such that the first $n-1$ coordinates vanish, and similarly for the second set. The last coordinates of these two convex combos are positive and negative, so there is a convex combo of them that is zero.
answered Jan 28 at 18:20
kimchi loverkimchi lover
10.7k31128
$endgroup$
add a comment |
$begingroup$
Take in pairs the points that differ in sign for the coordinate $n$ (and only that one) and form the convex combinations such that that coordinate is cancelled.
Now you have $2^n-1$ points in each orthants of the diminished space.
The results holds because the convex combination of linear combinations is a convex combination.
answered Jan 28 at 18:46
Yves DaoustYves Daoust
128k675227
$endgroup$
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%2f3091194%2fprove-that-0-is-in-the-convex-hull-of-points-chosen-from-each-orthant%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$
Induct on dimension.
In the $n=1$ base case, you have a positive number and a negative number; $0$ can be represented as a convex combination of them.
For $n>1$: Given your $2^n$ points, one from each orthant, divide them into 2 sets of size $2^n-1$, where the first set has points whose last coordinates are positive and the second set where the last coordinates are negative. By the inductive hypothesis there is a convex combo of the first set of points such that the first $n-1$ coordinates vanish, and similarly for the second set. The last coordinates of these two convex combos are positive and negative, so there is a convex combo of them that is zero.
answered Jan 28 at 18:20
kimchi loverkimchi lover
10.7k31128
$endgroup$
add a comment |
$begingroup$
Induct on dimension.
In the $n=1$ base case, you have a positive number and a negative number; $0$ can be represented as a convex combination of them.
For $n>1$: Given your $2^n$ points, one from each orthant, divide them into 2 sets of size $2^n-1$, where the first set has points whose last coordinates are positive and the second set where the last coordinates are negative. By the inductive hypothesis there is a convex combo of the first set of points such that the first $n-1$ coordinates vanish, and similarly for the second set. The last coordinates of these two convex combos are positive and negative, so there is a convex combo of them that is zero.
answered Jan 28 at 18:20
kimchi loverkimchi lover
10.7k31128
$endgroup$
add a comment |
$begingroup$
Induct on dimension.
In the $n=1$ base case, you have a positive number and a negative number; $0$ can be represented as a convex combination of them.
For $n>1$: Given your $2^n$ points, one from each orthant, divide them into 2 sets of size $2^n-1$, where the first set has points whose last coordinates are positive and the second set where the last coordinates are negative. By the inductive hypothesis there is a convex combo of the first set of points such that the first $n-1$ coordinates vanish, and similarly for the second set. The last coordinates of these two convex combos are positive and negative, so there is a convex combo of them that is zero.
answered Jan 28 at 18:20
kimchi loverkimchi lover
10.7k31128
$endgroup$
Induct on dimension.
In the $n=1$ base case, you have a positive number and a negative number; $0$ can be represented as a convex combination of them.
For $n>1$: Given your $2^n$ points, one from each orthant, divide them into 2 sets of size $2^n-1$, where the first set has points whose last coordinates are positive and the second set where the last coordinates are negative. By the inductive hypothesis there is a convex combo of the first set of points such that the first $n-1$ coordinates vanish, and similarly for the second set. The last coordinates of these two convex combos are positive and negative, so there is a convex combo of them that is zero.
answered Jan 28 at 18:20
kimchi loverkimchi lover
10.7k31128
edited Jan 28 at 18:53
answered Jan 28 at 18:20
kimchi loverkimchi lover
10.7k31128
answered Jan 28 at 18:20
kimchi loverkimchi lover
10.7k31128
answered Jan 28 at 18:20
kimchi loverkimchi lover
10.7k31128
10.7k31128
add a comment |
add a comment |
$begingroup$
Take in pairs the points that differ in sign for the coordinate $n$ (and only that one) and form the convex combinations such that that coordinate is cancelled.
Now you have $2^n-1$ points in each orthants of the diminished space.
The results holds because the convex combination of linear combinations is a convex combination.
answered Jan 28 at 18:46
Yves DaoustYves Daoust
128k675227
$endgroup$
add a comment |
$begingroup$
Take in pairs the points that differ in sign for the coordinate $n$ (and only that one) and form the convex combinations such that that coordinate is cancelled.
Now you have $2^n-1$ points in each orthants of the diminished space.
The results holds because the convex combination of linear combinations is a convex combination.
answered Jan 28 at 18:46
Yves DaoustYves Daoust
128k675227
$endgroup$
add a comment |
$begingroup$
Take in pairs the points that differ in sign for the coordinate $n$ (and only that one) and form the convex combinations such that that coordinate is cancelled.
Now you have $2^n-1$ points in each orthants of the diminished space.
The results holds because the convex combination of linear combinations is a convex combination.
answered Jan 28 at 18:46
Yves DaoustYves Daoust
128k675227
$endgroup$
Take in pairs the points that differ in sign for the coordinate $n$ (and only that one) and form the convex combinations such that that coordinate is cancelled.
Now you have $2^n-1$ points in each orthants of the diminished space.
The results holds because the convex combination of linear combinations is a convex combination.
answered Jan 28 at 18:46
Yves DaoustYves Daoust
128k675227
edited Jan 28 at 18:53
answered Jan 28 at 18:46
Yves DaoustYves Daoust
128k675227
answered Jan 28 at 18:46
Yves DaoustYves Daoust
128k675227
answered Jan 28 at 18:46
Yves DaoustYves Daoust
128k675227
128k675227
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.
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%2f3091194%2fprove-that-0-is-in-the-convex-hull-of-points-chosen-from-each-orthant%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
