Looking for a function such that The Next CEO of Stack Overflowname this functionConvex...
Why isn't the Mueller report being released completely and unredacted?
Is it convenient to ask the journal's editor for two additional days to complete a review?
If Nick Fury and Coulson already knew about aliens (Kree and Skrull) why did they wait until Thor's appearance to start making weapons?
Yu-Gi-Oh cards in Python 3
Make solar eclipses exceedingly rare, but still have new moons
Using Rolle's theorem to show an equation has only one real root
Poetry, calligrams and TikZ/PStricks challenge
TikZ: How to reverse arrow direction without switching start/end point?
Help understanding this unsettling image of Titan, Epimetheus, and Saturn's rings?
Is it professional to write unrelated content in an almost-empty email?
Is French Guiana a (hard) EU border?
Calculator final project in Python
Defamation due to breach of confidentiality
Where do students learn to solve polynomial equations these days?
A small doubt about the dominated convergence theorem
How to avoid supervisors with prejudiced views?
How to delete every two lines after 3rd lines in a file contains very large number of lines?
How to write a definition with variants?
Won the lottery - how do I keep the money?
WOW air has ceased operation, can I get my tickets refunded?
Unclear about dynamic binding
Domestic-to-international connection at Orlando (MCO)
Why doesn't UK go for the same deal Japan has with EU to resolve Brexit?
Proper way to express "He disappeared them"
Looking for a function such that
The Next CEO of Stack Overflowname this functionConvex functions - two questionsStudy of a function and other factsProve that there is no $(x,n,m)$ such that $f^n(x)=f^{n+km}(x)$ if $f$ is injectivereal analysis -functional equationProve that $f : [a,b] rightarrow mathbb{R}$ is a bijection from $[a, b]$ to $[f(a), f(b)]$A sufficient condition on a real smooth functionFinding $f(x)$ in a Fourier IntegralProving a limit of this growing functionLemma used in Proof of L'Hôpital's Rule for Indeterminate Types of $infty/infty$
$begingroup$
Let $Minmathbb{R}^{ntimes n}$ and $yinmathbb{R}^n$. We define $l:,mathbb{R}^ntomathbb{R}$ by $xmapsto ||Mx-y||^2_2$. Now I´m looking for a a function $f:,mathbb{R}_{geq 0}tomathbb{R}$, which satisfies $f(||x||_2)leq l(x)$. In addition $f$ should be monotone increasing with $lim_{alphatoinfty}frac{f(alpha)}{alpha}=infty$.
This looks very simple and maybe it is, but unfornately I couldn't find such a function.
Edit: We assume $Mneq0$. If it helps we can also assume that $M$ is a diagonal binary matrix.
Thank you in advance,
Chris
functions
$endgroup$
add a comment |
$begingroup$
Let $Minmathbb{R}^{ntimes n}$ and $yinmathbb{R}^n$. We define $l:,mathbb{R}^ntomathbb{R}$ by $xmapsto ||Mx-y||^2_2$. Now I´m looking for a a function $f:,mathbb{R}_{geq 0}tomathbb{R}$, which satisfies $f(||x||_2)leq l(x)$. In addition $f$ should be monotone increasing with $lim_{alphatoinfty}frac{f(alpha)}{alpha}=infty$.
This looks very simple and maybe it is, but unfornately I couldn't find such a function.
Edit: We assume $Mneq0$. If it helps we can also assume that $M$ is a diagonal binary matrix.
Thank you in advance,
Chris
functions
$endgroup$
$begingroup$
I updated my answer to reflect the edit.
$endgroup$
– user159517
Mar 17 at 14:01
add a comment |
$begingroup$
Let $Minmathbb{R}^{ntimes n}$ and $yinmathbb{R}^n$. We define $l:,mathbb{R}^ntomathbb{R}$ by $xmapsto ||Mx-y||^2_2$. Now I´m looking for a a function $f:,mathbb{R}_{geq 0}tomathbb{R}$, which satisfies $f(||x||_2)leq l(x)$. In addition $f$ should be monotone increasing with $lim_{alphatoinfty}frac{f(alpha)}{alpha}=infty$.
This looks very simple and maybe it is, but unfornately I couldn't find such a function.
Edit: We assume $Mneq0$. If it helps we can also assume that $M$ is a diagonal binary matrix.
Thank you in advance,
Chris
functions
$endgroup$
Let $Minmathbb{R}^{ntimes n}$ and $yinmathbb{R}^n$. We define $l:,mathbb{R}^ntomathbb{R}$ by $xmapsto ||Mx-y||^2_2$. Now I´m looking for a a function $f:,mathbb{R}_{geq 0}tomathbb{R}$, which satisfies $f(||x||_2)leq l(x)$. In addition $f$ should be monotone increasing with $lim_{alphatoinfty}frac{f(alpha)}{alpha}=infty$.
This looks very simple and maybe it is, but unfornately I couldn't find such a function.
Edit: We assume $Mneq0$. If it helps we can also assume that $M$ is a diagonal binary matrix.
Thank you in advance,
Chris
functions
functions
edited Mar 17 at 12:59
Lorenzo Quarisa
3,775623
3,775623
asked Mar 17 at 8:15
Chris S.Chris S.
356
356
$begingroup$
I updated my answer to reflect the edit.
$endgroup$
– user159517
Mar 17 at 14:01
add a comment |
$begingroup$
I updated my answer to reflect the edit.
$endgroup$
– user159517
Mar 17 at 14:01
$begingroup$
I updated my answer to reflect the edit.
$endgroup$
– user159517
Mar 17 at 14:01
$begingroup$
I updated my answer to reflect the edit.
$endgroup$
– user159517
Mar 17 at 14:01
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Let $M$ be a diagonal binary matrix. There are two possible cases to consider
$M$ is singular
$M$ is the identity matrix.
First, lets assume that 1) holds. Let $x_0 in text{ker} M$ with $|x_0| = 1$. Let $alpha$ be big enough such that $f(alpha) > |y|_2^2$. Then for all $c > alpha$, we find
$$f(|cx_0|_2) > l(cx_0).$$
So the statement is wrong.
In the case $2)$, where $M$ is the identity matrix, take $$g(|x|_2) := (|x|_2- (1+|y|_2))^{+} $$
where $+$ denotes the positive part. Whenever $g$ is nonzero, due to the reverse triangle inequality we have $|x-y|_2 geq 1$ and $$g(|x|_2) leq |x|_2 - |y|_2 leq |x-y|_2.$$ Now for any $p in (1,2)$, the function $$f(|x|_2) := g(|x|_2)^p$$ does the job.
$endgroup$
$begingroup$
That's right. I did not think about that corner case. I assume that $Mneq 0$. I will edit the question. Thank you!
$endgroup$
– Chris S.
Mar 17 at 12:48
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%2f3151264%2flooking-for-a-function-such-that%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
$begingroup$
Let $M$ be a diagonal binary matrix. There are two possible cases to consider
$M$ is singular
$M$ is the identity matrix.
First, lets assume that 1) holds. Let $x_0 in text{ker} M$ with $|x_0| = 1$. Let $alpha$ be big enough such that $f(alpha) > |y|_2^2$. Then for all $c > alpha$, we find
$$f(|cx_0|_2) > l(cx_0).$$
So the statement is wrong.
In the case $2)$, where $M$ is the identity matrix, take $$g(|x|_2) := (|x|_2- (1+|y|_2))^{+} $$
where $+$ denotes the positive part. Whenever $g$ is nonzero, due to the reverse triangle inequality we have $|x-y|_2 geq 1$ and $$g(|x|_2) leq |x|_2 - |y|_2 leq |x-y|_2.$$ Now for any $p in (1,2)$, the function $$f(|x|_2) := g(|x|_2)^p$$ does the job.
$endgroup$
$begingroup$
That's right. I did not think about that corner case. I assume that $Mneq 0$. I will edit the question. Thank you!
$endgroup$
– Chris S.
Mar 17 at 12:48
add a comment |
$begingroup$
Let $M$ be a diagonal binary matrix. There are two possible cases to consider
$M$ is singular
$M$ is the identity matrix.
First, lets assume that 1) holds. Let $x_0 in text{ker} M$ with $|x_0| = 1$. Let $alpha$ be big enough such that $f(alpha) > |y|_2^2$. Then for all $c > alpha$, we find
$$f(|cx_0|_2) > l(cx_0).$$
So the statement is wrong.
In the case $2)$, where $M$ is the identity matrix, take $$g(|x|_2) := (|x|_2- (1+|y|_2))^{+} $$
where $+$ denotes the positive part. Whenever $g$ is nonzero, due to the reverse triangle inequality we have $|x-y|_2 geq 1$ and $$g(|x|_2) leq |x|_2 - |y|_2 leq |x-y|_2.$$ Now for any $p in (1,2)$, the function $$f(|x|_2) := g(|x|_2)^p$$ does the job.
$endgroup$
$begingroup$
That's right. I did not think about that corner case. I assume that $Mneq 0$. I will edit the question. Thank you!
$endgroup$
– Chris S.
Mar 17 at 12:48
add a comment |
$begingroup$
Let $M$ be a diagonal binary matrix. There are two possible cases to consider
$M$ is singular
$M$ is the identity matrix.
First, lets assume that 1) holds. Let $x_0 in text{ker} M$ with $|x_0| = 1$. Let $alpha$ be big enough such that $f(alpha) > |y|_2^2$. Then for all $c > alpha$, we find
$$f(|cx_0|_2) > l(cx_0).$$
So the statement is wrong.
In the case $2)$, where $M$ is the identity matrix, take $$g(|x|_2) := (|x|_2- (1+|y|_2))^{+} $$
where $+$ denotes the positive part. Whenever $g$ is nonzero, due to the reverse triangle inequality we have $|x-y|_2 geq 1$ and $$g(|x|_2) leq |x|_2 - |y|_2 leq |x-y|_2.$$ Now for any $p in (1,2)$, the function $$f(|x|_2) := g(|x|_2)^p$$ does the job.
$endgroup$
Let $M$ be a diagonal binary matrix. There are two possible cases to consider
$M$ is singular
$M$ is the identity matrix.
First, lets assume that 1) holds. Let $x_0 in text{ker} M$ with $|x_0| = 1$. Let $alpha$ be big enough such that $f(alpha) > |y|_2^2$. Then for all $c > alpha$, we find
$$f(|cx_0|_2) > l(cx_0).$$
So the statement is wrong.
In the case $2)$, where $M$ is the identity matrix, take $$g(|x|_2) := (|x|_2- (1+|y|_2))^{+} $$
where $+$ denotes the positive part. Whenever $g$ is nonzero, due to the reverse triangle inequality we have $|x-y|_2 geq 1$ and $$g(|x|_2) leq |x|_2 - |y|_2 leq |x-y|_2.$$ Now for any $p in (1,2)$, the function $$f(|x|_2) := g(|x|_2)^p$$ does the job.
edited Mar 17 at 13:58
answered Mar 17 at 10:01
user159517user159517
4,585931
4,585931
$begingroup$
That's right. I did not think about that corner case. I assume that $Mneq 0$. I will edit the question. Thank you!
$endgroup$
– Chris S.
Mar 17 at 12:48
add a comment |
$begingroup$
That's right. I did not think about that corner case. I assume that $Mneq 0$. I will edit the question. Thank you!
$endgroup$
– Chris S.
Mar 17 at 12:48
$begingroup$
That's right. I did not think about that corner case. I assume that $Mneq 0$. I will edit the question. Thank you!
$endgroup$
– Chris S.
Mar 17 at 12:48
$begingroup$
That's right. I did not think about that corner case. I assume that $Mneq 0$. I will edit the question. Thank you!
$endgroup$
– Chris S.
Mar 17 at 12:48
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%2f3151264%2flooking-for-a-function-such-that%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$
I updated my answer to reflect the edit.
$endgroup$
– user159517
Mar 17 at 14:01