Does Cauchy-Schwarz imply $|x^Ty| leq |x|_p|y|_p$ for any $p geq 1$?












0












$begingroup$


Given $x,y in mathbb{R}^n$, the Cauchy Schwarz inequality states,



$|x^Ty| leq |x|_2|y|_2$



And for non-Euclidean (norms other than $l_2$), we have,



$|x^Ty| leq |x|_p|y|_q$ where $|cdot|_q$ is the dual norm of $|cdot|_p$ (I remember $p,q$ is related by $1/p+1/q = 1$ or something like that)



For example,
$|x^Ty| leq |x|_1|y|_infty$



My question is:




Does Cauchy-Schwarz imply $|x^Ty| leq |x|_p|y|_p$ for any $p
geq 1$
?




I feel like this should hold, based on the fact that all the norms are equivalent. In the previous example, we know that $|y|_infty leq alpha |y|_1$ with some constant $alpha$ (I can never remind the exact number)



Then it must be true that,
$|x^Ty| leq |x|_1|y|_1$



Is there a flaw in my reasoning?










share|cite|improve this question











$endgroup$












  • $begingroup$
    We do have $|x^Ty| leq |x|_p |y|_p$ for $1 leq p leq 2$, but not for $p>2$.
    $endgroup$
    – Omnomnomnom
    Jan 19 at 19:40










  • $begingroup$
    The norms are equivalent indeed. But the constants in the norm comparison DO matter here.
    $endgroup$
    – J.F
    Jan 19 at 19:47
















0












$begingroup$


Given $x,y in mathbb{R}^n$, the Cauchy Schwarz inequality states,



$|x^Ty| leq |x|_2|y|_2$



And for non-Euclidean (norms other than $l_2$), we have,



$|x^Ty| leq |x|_p|y|_q$ where $|cdot|_q$ is the dual norm of $|cdot|_p$ (I remember $p,q$ is related by $1/p+1/q = 1$ or something like that)



For example,
$|x^Ty| leq |x|_1|y|_infty$



My question is:




Does Cauchy-Schwarz imply $|x^Ty| leq |x|_p|y|_p$ for any $p
geq 1$
?




I feel like this should hold, based on the fact that all the norms are equivalent. In the previous example, we know that $|y|_infty leq alpha |y|_1$ with some constant $alpha$ (I can never remind the exact number)



Then it must be true that,
$|x^Ty| leq |x|_1|y|_1$



Is there a flaw in my reasoning?










share|cite|improve this question











$endgroup$












  • $begingroup$
    We do have $|x^Ty| leq |x|_p |y|_p$ for $1 leq p leq 2$, but not for $p>2$.
    $endgroup$
    – Omnomnomnom
    Jan 19 at 19:40










  • $begingroup$
    The norms are equivalent indeed. But the constants in the norm comparison DO matter here.
    $endgroup$
    – J.F
    Jan 19 at 19:47














0












0








0





$begingroup$


Given $x,y in mathbb{R}^n$, the Cauchy Schwarz inequality states,



$|x^Ty| leq |x|_2|y|_2$



And for non-Euclidean (norms other than $l_2$), we have,



$|x^Ty| leq |x|_p|y|_q$ where $|cdot|_q$ is the dual norm of $|cdot|_p$ (I remember $p,q$ is related by $1/p+1/q = 1$ or something like that)



For example,
$|x^Ty| leq |x|_1|y|_infty$



My question is:




Does Cauchy-Schwarz imply $|x^Ty| leq |x|_p|y|_p$ for any $p
geq 1$
?




I feel like this should hold, based on the fact that all the norms are equivalent. In the previous example, we know that $|y|_infty leq alpha |y|_1$ with some constant $alpha$ (I can never remind the exact number)



Then it must be true that,
$|x^Ty| leq |x|_1|y|_1$



Is there a flaw in my reasoning?










share|cite|improve this question











$endgroup$




Given $x,y in mathbb{R}^n$, the Cauchy Schwarz inequality states,



$|x^Ty| leq |x|_2|y|_2$



And for non-Euclidean (norms other than $l_2$), we have,



$|x^Ty| leq |x|_p|y|_q$ where $|cdot|_q$ is the dual norm of $|cdot|_p$ (I remember $p,q$ is related by $1/p+1/q = 1$ or something like that)



For example,
$|x^Ty| leq |x|_1|y|_infty$



My question is:




Does Cauchy-Schwarz imply $|x^Ty| leq |x|_p|y|_p$ for any $p
geq 1$
?




I feel like this should hold, based on the fact that all the norms are equivalent. In the previous example, we know that $|y|_infty leq alpha |y|_1$ with some constant $alpha$ (I can never remind the exact number)



Then it must be true that,
$|x^Ty| leq |x|_1|y|_1$



Is there a flaw in my reasoning?







inequality vector-spaces convex-analysis norm cauchy-schwarz-inequality






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 20 at 8:17









max_zorn

3,40061329




3,40061329










asked Jan 19 at 19:34









AåkonAåkon

4,86131758




4,86131758












  • $begingroup$
    We do have $|x^Ty| leq |x|_p |y|_p$ for $1 leq p leq 2$, but not for $p>2$.
    $endgroup$
    – Omnomnomnom
    Jan 19 at 19:40










  • $begingroup$
    The norms are equivalent indeed. But the constants in the norm comparison DO matter here.
    $endgroup$
    – J.F
    Jan 19 at 19:47


















  • $begingroup$
    We do have $|x^Ty| leq |x|_p |y|_p$ for $1 leq p leq 2$, but not for $p>2$.
    $endgroup$
    – Omnomnomnom
    Jan 19 at 19:40










  • $begingroup$
    The norms are equivalent indeed. But the constants in the norm comparison DO matter here.
    $endgroup$
    – J.F
    Jan 19 at 19:47
















$begingroup$
We do have $|x^Ty| leq |x|_p |y|_p$ for $1 leq p leq 2$, but not for $p>2$.
$endgroup$
– Omnomnomnom
Jan 19 at 19:40




$begingroup$
We do have $|x^Ty| leq |x|_p |y|_p$ for $1 leq p leq 2$, but not for $p>2$.
$endgroup$
– Omnomnomnom
Jan 19 at 19:40












$begingroup$
The norms are equivalent indeed. But the constants in the norm comparison DO matter here.
$endgroup$
– J.F
Jan 19 at 19:47




$begingroup$
The norms are equivalent indeed. But the constants in the norm comparison DO matter here.
$endgroup$
– J.F
Jan 19 at 19:47










1 Answer
1






active

oldest

votes


















2












$begingroup$


... we know that $|y|_infty leq alpha |y|_1$ with some constant $alpha$ ...




Well, actually we have $|y|_infty leq |y|_1$, and that implies
$$
|x^Ty| leq |x|_1|y|_infty le |x|_1|y|_1 , ,
$$

so that your reasoning is essentially correct for $p=1$.



For $p > 1$ the same approach works as long as the conjugate $q$ (defined by $frac 1p + frac 1q = 1$ ) satisfies $p le q$, that is, if $p le 2$. Then Hölder's inequality and the relation between $p$-norms gives
$$
|x^Ty| leq |x|_p|y|_q le |x|_p|y|_p , .
$$



The same reasoning does not work if $p > 2$, and in fact the desired estimate does not hold in that case. This can be seen by choosing $x = y ne 0$:
$$
|x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , .
$$



Summary:
$$
|x^Ty| leq Vert xVert_pVert yVert _p text{ for all } x, y in Bbb R^n
$$

holds if and only if $p le 2$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Hi, I don't see how you obtained the inequality in the line $ |x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , . $ Why shouldn't the inequality be flipped?
    $endgroup$
    – Aåkon
    Jan 19 at 22:37










  • $begingroup$
    @Aåkon: The p-norm is decreasingin p: $p > 2$ implies $Vert x Vert_p < Vert x Vert_2$
    $endgroup$
    – Martin R
    Jan 20 at 14:02











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3079719%2fdoes-cauchy-schwarz-imply-xty-leq-x-p-y-p-for-any-p-geq-1%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









2












$begingroup$


... we know that $|y|_infty leq alpha |y|_1$ with some constant $alpha$ ...




Well, actually we have $|y|_infty leq |y|_1$, and that implies
$$
|x^Ty| leq |x|_1|y|_infty le |x|_1|y|_1 , ,
$$

so that your reasoning is essentially correct for $p=1$.



For $p > 1$ the same approach works as long as the conjugate $q$ (defined by $frac 1p + frac 1q = 1$ ) satisfies $p le q$, that is, if $p le 2$. Then Hölder's inequality and the relation between $p$-norms gives
$$
|x^Ty| leq |x|_p|y|_q le |x|_p|y|_p , .
$$



The same reasoning does not work if $p > 2$, and in fact the desired estimate does not hold in that case. This can be seen by choosing $x = y ne 0$:
$$
|x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , .
$$



Summary:
$$
|x^Ty| leq Vert xVert_pVert yVert _p text{ for all } x, y in Bbb R^n
$$

holds if and only if $p le 2$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Hi, I don't see how you obtained the inequality in the line $ |x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , . $ Why shouldn't the inequality be flipped?
    $endgroup$
    – Aåkon
    Jan 19 at 22:37










  • $begingroup$
    @Aåkon: The p-norm is decreasingin p: $p > 2$ implies $Vert x Vert_p < Vert x Vert_2$
    $endgroup$
    – Martin R
    Jan 20 at 14:02
















2












$begingroup$


... we know that $|y|_infty leq alpha |y|_1$ with some constant $alpha$ ...




Well, actually we have $|y|_infty leq |y|_1$, and that implies
$$
|x^Ty| leq |x|_1|y|_infty le |x|_1|y|_1 , ,
$$

so that your reasoning is essentially correct for $p=1$.



For $p > 1$ the same approach works as long as the conjugate $q$ (defined by $frac 1p + frac 1q = 1$ ) satisfies $p le q$, that is, if $p le 2$. Then Hölder's inequality and the relation between $p$-norms gives
$$
|x^Ty| leq |x|_p|y|_q le |x|_p|y|_p , .
$$



The same reasoning does not work if $p > 2$, and in fact the desired estimate does not hold in that case. This can be seen by choosing $x = y ne 0$:
$$
|x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , .
$$



Summary:
$$
|x^Ty| leq Vert xVert_pVert yVert _p text{ for all } x, y in Bbb R^n
$$

holds if and only if $p le 2$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Hi, I don't see how you obtained the inequality in the line $ |x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , . $ Why shouldn't the inequality be flipped?
    $endgroup$
    – Aåkon
    Jan 19 at 22:37










  • $begingroup$
    @Aåkon: The p-norm is decreasingin p: $p > 2$ implies $Vert x Vert_p < Vert x Vert_2$
    $endgroup$
    – Martin R
    Jan 20 at 14:02














2












2








2





$begingroup$


... we know that $|y|_infty leq alpha |y|_1$ with some constant $alpha$ ...




Well, actually we have $|y|_infty leq |y|_1$, and that implies
$$
|x^Ty| leq |x|_1|y|_infty le |x|_1|y|_1 , ,
$$

so that your reasoning is essentially correct for $p=1$.



For $p > 1$ the same approach works as long as the conjugate $q$ (defined by $frac 1p + frac 1q = 1$ ) satisfies $p le q$, that is, if $p le 2$. Then Hölder's inequality and the relation between $p$-norms gives
$$
|x^Ty| leq |x|_p|y|_q le |x|_p|y|_p , .
$$



The same reasoning does not work if $p > 2$, and in fact the desired estimate does not hold in that case. This can be seen by choosing $x = y ne 0$:
$$
|x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , .
$$



Summary:
$$
|x^Ty| leq Vert xVert_pVert yVert _p text{ for all } x, y in Bbb R^n
$$

holds if and only if $p le 2$.






share|cite|improve this answer











$endgroup$




... we know that $|y|_infty leq alpha |y|_1$ with some constant $alpha$ ...




Well, actually we have $|y|_infty leq |y|_1$, and that implies
$$
|x^Ty| leq |x|_1|y|_infty le |x|_1|y|_1 , ,
$$

so that your reasoning is essentially correct for $p=1$.



For $p > 1$ the same approach works as long as the conjugate $q$ (defined by $frac 1p + frac 1q = 1$ ) satisfies $p le q$, that is, if $p le 2$. Then Hölder's inequality and the relation between $p$-norms gives
$$
|x^Ty| leq |x|_p|y|_q le |x|_p|y|_p , .
$$



The same reasoning does not work if $p > 2$, and in fact the desired estimate does not hold in that case. This can be seen by choosing $x = y ne 0$:
$$
|x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , .
$$



Summary:
$$
|x^Ty| leq Vert xVert_pVert yVert _p text{ for all } x, y in Bbb R^n
$$

holds if and only if $p le 2$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Jan 19 at 21:35

























answered Jan 19 at 21:22









Martin RMartin R

29.6k33558




29.6k33558












  • $begingroup$
    Hi, I don't see how you obtained the inequality in the line $ |x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , . $ Why shouldn't the inequality be flipped?
    $endgroup$
    – Aåkon
    Jan 19 at 22:37










  • $begingroup$
    @Aåkon: The p-norm is decreasingin p: $p > 2$ implies $Vert x Vert_p < Vert x Vert_2$
    $endgroup$
    – Martin R
    Jan 20 at 14:02


















  • $begingroup$
    Hi, I don't see how you obtained the inequality in the line $ |x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , . $ Why shouldn't the inequality be flipped?
    $endgroup$
    – Aåkon
    Jan 19 at 22:37










  • $begingroup$
    @Aåkon: The p-norm is decreasingin p: $p > 2$ implies $Vert x Vert_p < Vert x Vert_2$
    $endgroup$
    – Martin R
    Jan 20 at 14:02
















$begingroup$
Hi, I don't see how you obtained the inequality in the line $ |x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , . $ Why shouldn't the inequality be flipped?
$endgroup$
– Aåkon
Jan 19 at 22:37




$begingroup$
Hi, I don't see how you obtained the inequality in the line $ |x^Ty| = Vert x Vert_2^2 > Vert x Vert_p^2 = |x|_p|y|_p , . $ Why shouldn't the inequality be flipped?
$endgroup$
– Aåkon
Jan 19 at 22:37












$begingroup$
@Aåkon: The p-norm is decreasingin p: $p > 2$ implies $Vert x Vert_p < Vert x Vert_2$
$endgroup$
– Martin R
Jan 20 at 14:02




$begingroup$
@Aåkon: The p-norm is decreasingin p: $p > 2$ implies $Vert x Vert_p < Vert x Vert_2$
$endgroup$
– Martin R
Jan 20 at 14:02


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3079719%2fdoes-cauchy-schwarz-imply-xty-leq-x-p-y-p-for-any-p-geq-1%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

A Topological Invariant for $pi_3(U(n))$