“minimization” problem in Euclidean space related to orthonormal basis
$begingroup$
I have stumbled upon an exercice for second year undegraduate student majoring in economics which I find quite demanding. I have an idea for the solution, but it seems awfully complicated, and I am wondering if there was a simpler way to solve it. This goes as follows:
Let $(E, langle, rangle)$ be a euclidean space of dimension $n geq 2$.
1) For any $x in E$, show that $||x|| = sqrt{n}$ if and only if there exists $(e_1, dots, e_n)$ an orthonormal basis of $E$ such that $x =e_1+ ldots + e_n$.
2) For any $(x,y) in E$, show that $||x|| = sqrt{n}$, $||y|| = sqrt{frac{n(n+1)(2n+1)}{6}}$ and $langle x,y rangle = frac{n(n+1)}{2}$ if and only if there eixsts $(e_1, ldots, e_n)$ an orthonormal basis of $E$ such that $x = e_1 + ldots + e_n$ and $y = e_1 + 2e_2 + ldots + ne_n$
The first question can be solved relatively simply : one proceeds inductively. The induction step goes as follows : find a vector $e_{t_0}$ such that $langle x, e_{t_0} rangle = 1$ and $||e_{t_0}|| = 1$. Then, consider $x' = x-e_{t_0}$. It is easily checked that $x'$ is orthogonal to $e_{t_0}$ and that $x'$ satifies the induction hypothesis. To find $e_{t_0}$ use the intermediate value theorem with the hypotheses $langle x, x/||x|| rangle = sqrt{n} >1$ and $langle x, z rangle = 0$ for any $z$ orthogonal to $x$.
For the second question, one could proceed also inductively. It would be sufficient to find $e_{t_0} in E$ such that $langle x,e_{t_0} rangle = 1$, $langle y, e_{t_0} rangle = n$ and $||e_{t_0}|| = 1$. I have a vague idea on how to find such a $e_{t_0}$ but it seems horribly complicated and certainly not acessible to second year undergraduate student majoring in economics. I am wondering if there was a (realtively) simple way to find the solution for this second question?
linear-algebra optimization orthonormal
$endgroup$
add a comment |
$begingroup$
I have stumbled upon an exercice for second year undegraduate student majoring in economics which I find quite demanding. I have an idea for the solution, but it seems awfully complicated, and I am wondering if there was a simpler way to solve it. This goes as follows:
Let $(E, langle, rangle)$ be a euclidean space of dimension $n geq 2$.
1) For any $x in E$, show that $||x|| = sqrt{n}$ if and only if there exists $(e_1, dots, e_n)$ an orthonormal basis of $E$ such that $x =e_1+ ldots + e_n$.
2) For any $(x,y) in E$, show that $||x|| = sqrt{n}$, $||y|| = sqrt{frac{n(n+1)(2n+1)}{6}}$ and $langle x,y rangle = frac{n(n+1)}{2}$ if and only if there eixsts $(e_1, ldots, e_n)$ an orthonormal basis of $E$ such that $x = e_1 + ldots + e_n$ and $y = e_1 + 2e_2 + ldots + ne_n$
The first question can be solved relatively simply : one proceeds inductively. The induction step goes as follows : find a vector $e_{t_0}$ such that $langle x, e_{t_0} rangle = 1$ and $||e_{t_0}|| = 1$. Then, consider $x' = x-e_{t_0}$. It is easily checked that $x'$ is orthogonal to $e_{t_0}$ and that $x'$ satifies the induction hypothesis. To find $e_{t_0}$ use the intermediate value theorem with the hypotheses $langle x, x/||x|| rangle = sqrt{n} >1$ and $langle x, z rangle = 0$ for any $z$ orthogonal to $x$.
For the second question, one could proceed also inductively. It would be sufficient to find $e_{t_0} in E$ such that $langle x,e_{t_0} rangle = 1$, $langle y, e_{t_0} rangle = n$ and $||e_{t_0}|| = 1$. I have a vague idea on how to find such a $e_{t_0}$ but it seems horribly complicated and certainly not acessible to second year undergraduate student majoring in economics. I am wondering if there was a (realtively) simple way to find the solution for this second question?
linear-algebra optimization orthonormal
$endgroup$
add a comment |
$begingroup$
I have stumbled upon an exercice for second year undegraduate student majoring in economics which I find quite demanding. I have an idea for the solution, but it seems awfully complicated, and I am wondering if there was a simpler way to solve it. This goes as follows:
Let $(E, langle, rangle)$ be a euclidean space of dimension $n geq 2$.
1) For any $x in E$, show that $||x|| = sqrt{n}$ if and only if there exists $(e_1, dots, e_n)$ an orthonormal basis of $E$ such that $x =e_1+ ldots + e_n$.
2) For any $(x,y) in E$, show that $||x|| = sqrt{n}$, $||y|| = sqrt{frac{n(n+1)(2n+1)}{6}}$ and $langle x,y rangle = frac{n(n+1)}{2}$ if and only if there eixsts $(e_1, ldots, e_n)$ an orthonormal basis of $E$ such that $x = e_1 + ldots + e_n$ and $y = e_1 + 2e_2 + ldots + ne_n$
The first question can be solved relatively simply : one proceeds inductively. The induction step goes as follows : find a vector $e_{t_0}$ such that $langle x, e_{t_0} rangle = 1$ and $||e_{t_0}|| = 1$. Then, consider $x' = x-e_{t_0}$. It is easily checked that $x'$ is orthogonal to $e_{t_0}$ and that $x'$ satifies the induction hypothesis. To find $e_{t_0}$ use the intermediate value theorem with the hypotheses $langle x, x/||x|| rangle = sqrt{n} >1$ and $langle x, z rangle = 0$ for any $z$ orthogonal to $x$.
For the second question, one could proceed also inductively. It would be sufficient to find $e_{t_0} in E$ such that $langle x,e_{t_0} rangle = 1$, $langle y, e_{t_0} rangle = n$ and $||e_{t_0}|| = 1$. I have a vague idea on how to find such a $e_{t_0}$ but it seems horribly complicated and certainly not acessible to second year undergraduate student majoring in economics. I am wondering if there was a (realtively) simple way to find the solution for this second question?
linear-algebra optimization orthonormal
$endgroup$
I have stumbled upon an exercice for second year undegraduate student majoring in economics which I find quite demanding. I have an idea for the solution, but it seems awfully complicated, and I am wondering if there was a simpler way to solve it. This goes as follows:
Let $(E, langle, rangle)$ be a euclidean space of dimension $n geq 2$.
1) For any $x in E$, show that $||x|| = sqrt{n}$ if and only if there exists $(e_1, dots, e_n)$ an orthonormal basis of $E$ such that $x =e_1+ ldots + e_n$.
2) For any $(x,y) in E$, show that $||x|| = sqrt{n}$, $||y|| = sqrt{frac{n(n+1)(2n+1)}{6}}$ and $langle x,y rangle = frac{n(n+1)}{2}$ if and only if there eixsts $(e_1, ldots, e_n)$ an orthonormal basis of $E$ such that $x = e_1 + ldots + e_n$ and $y = e_1 + 2e_2 + ldots + ne_n$
The first question can be solved relatively simply : one proceeds inductively. The induction step goes as follows : find a vector $e_{t_0}$ such that $langle x, e_{t_0} rangle = 1$ and $||e_{t_0}|| = 1$. Then, consider $x' = x-e_{t_0}$. It is easily checked that $x'$ is orthogonal to $e_{t_0}$ and that $x'$ satifies the induction hypothesis. To find $e_{t_0}$ use the intermediate value theorem with the hypotheses $langle x, x/||x|| rangle = sqrt{n} >1$ and $langle x, z rangle = 0$ for any $z$ orthogonal to $x$.
For the second question, one could proceed also inductively. It would be sufficient to find $e_{t_0} in E$ such that $langle x,e_{t_0} rangle = 1$, $langle y, e_{t_0} rangle = n$ and $||e_{t_0}|| = 1$. I have a vague idea on how to find such a $e_{t_0}$ but it seems horribly complicated and certainly not acessible to second year undergraduate student majoring in economics. I am wondering if there was a (realtively) simple way to find the solution for this second question?
linear-algebra optimization orthonormal
linear-algebra optimization orthonormal
edited Jan 9 at 11:33
Libli
asked Jan 9 at 10:34
LibliLibli
1164
1164
add a comment |
add a comment |
0
active
oldest
votes
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%2f3067306%2fminimization-problem-in-euclidean-space-related-to-orthonormal-basis%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3067306%2fminimization-problem-in-euclidean-space-related-to-orthonormal-basis%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