Convergence for the norm of a sequence in $ell^{infty}$$ell^infty$ and $ell^1$When $ell^2$-convergence...
How to efficiently unroll a matrix by value with numpy?
NMaximize is not converging to a solution
Are the number of citations and number of published articles the most important criteria for a tenure promotion?
Is it legal for company to use my work email to pretend I still work there?
Maximum likelihood parameters deviate from posterior distributions
"You are your self first supporter", a more proper way to say it
Do I have a twin with permutated remainders?
Why does Kotter return in Welcome Back Kotter?
What is a clear way to write a bar that has an extra beat?
How do I gain back my faith in my PhD degree?
How to draw a waving flag in TikZ
How does one intimidate enemies without having the capacity for violence?
Why doesn't Newton's third law mean a person bounces back to where they started when they hit the ground?
How does quantile regression compare to logistic regression with the variable split at the quantile?
I'm flying to France today and my passport expires in less than 2 months
What does it mean to describe someone as a butt steak?
What are these boxed doors outside store fronts in New York?
If human space travel is limited by the G force vulnerability, is there a way to counter G forces?
Which country benefited the most from UN Security Council vetoes?
Can an x86 CPU running in real mode be considered to be basically an 8086 CPU?
Watching something be written to a file live with tail
Does detail obscure or enhance action?
Approximately how much travel time was saved by the opening of the Suez Canal in 1869?
Filter any system log file by date or date range
Convergence for the norm of a sequence in $ell^{infty}$
$ell^infty$ and $ell^1$When $ell^2$-convergence implies $ell^1$- convergence?Do sequences in $ell^p$ belong to some $ell^q$ for $q<p$?Showing a sequence is in $ell^2$Limit for sequence $a_{m+n}leq a_m+a_n$Show $Tx in ell ^2$ for every $x in ell ^{infty}$Find $|T|_{ell^infty rightarrow ell^2}$Finding the “operatorial” norm of an operatorShowing that $a_n in ell^{infty}$Why ${xinell^infty mid |x|_{ell^infty }leq 1}$ is not completely bounded?
$begingroup$
I still don't know if the statement below is true. It seems to be true but I couldn't find a proof. The statement is the following: for each $n geq 1$, let $x_n = (a_1(n),a_2(n),ldots,a_n(n),0,0,ldots) in ell^{infty}$, where $ell^{infty}$ is defined to be the space of all bounded sequences. If for any $1 leq k leq n$, $a_k(n) rightarrow 0$ as $n rightarrow infty$ then $||x_n||_{infty} = sup (a_1(n),a_2(n),ldots,a_n(n),0,0,ldots) rightarrow 0$ as $n rightarrow infty$? Any help is welcome.
real-analysis functional-analysis
$endgroup$
add a comment |
$begingroup$
I still don't know if the statement below is true. It seems to be true but I couldn't find a proof. The statement is the following: for each $n geq 1$, let $x_n = (a_1(n),a_2(n),ldots,a_n(n),0,0,ldots) in ell^{infty}$, where $ell^{infty}$ is defined to be the space of all bounded sequences. If for any $1 leq k leq n$, $a_k(n) rightarrow 0$ as $n rightarrow infty$ then $||x_n||_{infty} = sup (a_1(n),a_2(n),ldots,a_n(n),0,0,ldots) rightarrow 0$ as $n rightarrow infty$? Any help is welcome.
real-analysis functional-analysis
$endgroup$
add a comment |
$begingroup$
I still don't know if the statement below is true. It seems to be true but I couldn't find a proof. The statement is the following: for each $n geq 1$, let $x_n = (a_1(n),a_2(n),ldots,a_n(n),0,0,ldots) in ell^{infty}$, where $ell^{infty}$ is defined to be the space of all bounded sequences. If for any $1 leq k leq n$, $a_k(n) rightarrow 0$ as $n rightarrow infty$ then $||x_n||_{infty} = sup (a_1(n),a_2(n),ldots,a_n(n),0,0,ldots) rightarrow 0$ as $n rightarrow infty$? Any help is welcome.
real-analysis functional-analysis
$endgroup$
I still don't know if the statement below is true. It seems to be true but I couldn't find a proof. The statement is the following: for each $n geq 1$, let $x_n = (a_1(n),a_2(n),ldots,a_n(n),0,0,ldots) in ell^{infty}$, where $ell^{infty}$ is defined to be the space of all bounded sequences. If for any $1 leq k leq n$, $a_k(n) rightarrow 0$ as $n rightarrow infty$ then $||x_n||_{infty} = sup (a_1(n),a_2(n),ldots,a_n(n),0,0,ldots) rightarrow 0$ as $n rightarrow infty$? Any help is welcome.
real-analysis functional-analysis
real-analysis functional-analysis
asked Mar 19 at 16:21
JeromeJerome
1
1
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
This is not true. Define
$$a_{k}(n)=begin{cases}1text{ if }0leq nleq 2k\ 0text{ if }n>2kend{cases}.$$
Then $|x_{n}|_{infty}=1$ for all $n$.
$endgroup$
$begingroup$
Also doesn't work. For a fixed $n > 1$, $a_{n-1}(n) = 1$ which does not converge to zero and this is on assumptions.
$endgroup$
– Jerome
Mar 19 at 16:41
$begingroup$
@Jerome: No, it is not. The convergence is for a fixed $k$.
$endgroup$
– tomasz
Mar 19 at 18:23
add a comment |
$begingroup$
Hint: Consider $a_k(n):=ndelta_{k,n}$ (this is Kronecker delta).
$endgroup$
$begingroup$
In the assumptions, $a_n(n) rightarrow 0$. In your example, $a_n(n) = n delta_{n,n} = n$ does not converge to zero.
$endgroup$
– Jerome
Mar 19 at 16:34
$begingroup$
@Jerome: No. in the assumptions, for every $k$, you have $a_k(n)to 0$. In my example, $a_k(n)=0$ for all $n>k$, so in particular, $a_k(n)to 0$.
$endgroup$
– tomasz
Mar 19 at 18:21
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%2f3154276%2fconvergence-for-the-norm-of-a-sequence-in-ell-infty%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$
This is not true. Define
$$a_{k}(n)=begin{cases}1text{ if }0leq nleq 2k\ 0text{ if }n>2kend{cases}.$$
Then $|x_{n}|_{infty}=1$ for all $n$.
$endgroup$
$begingroup$
Also doesn't work. For a fixed $n > 1$, $a_{n-1}(n) = 1$ which does not converge to zero and this is on assumptions.
$endgroup$
– Jerome
Mar 19 at 16:41
$begingroup$
@Jerome: No, it is not. The convergence is for a fixed $k$.
$endgroup$
– tomasz
Mar 19 at 18:23
add a comment |
$begingroup$
This is not true. Define
$$a_{k}(n)=begin{cases}1text{ if }0leq nleq 2k\ 0text{ if }n>2kend{cases}.$$
Then $|x_{n}|_{infty}=1$ for all $n$.
$endgroup$
$begingroup$
Also doesn't work. For a fixed $n > 1$, $a_{n-1}(n) = 1$ which does not converge to zero and this is on assumptions.
$endgroup$
– Jerome
Mar 19 at 16:41
$begingroup$
@Jerome: No, it is not. The convergence is for a fixed $k$.
$endgroup$
– tomasz
Mar 19 at 18:23
add a comment |
$begingroup$
This is not true. Define
$$a_{k}(n)=begin{cases}1text{ if }0leq nleq 2k\ 0text{ if }n>2kend{cases}.$$
Then $|x_{n}|_{infty}=1$ for all $n$.
$endgroup$
This is not true. Define
$$a_{k}(n)=begin{cases}1text{ if }0leq nleq 2k\ 0text{ if }n>2kend{cases}.$$
Then $|x_{n}|_{infty}=1$ for all $n$.
answered Mar 19 at 16:25
Floris ClaassensFloris Claassens
1,33229
1,33229
$begingroup$
Also doesn't work. For a fixed $n > 1$, $a_{n-1}(n) = 1$ which does not converge to zero and this is on assumptions.
$endgroup$
– Jerome
Mar 19 at 16:41
$begingroup$
@Jerome: No, it is not. The convergence is for a fixed $k$.
$endgroup$
– tomasz
Mar 19 at 18:23
add a comment |
$begingroup$
Also doesn't work. For a fixed $n > 1$, $a_{n-1}(n) = 1$ which does not converge to zero and this is on assumptions.
$endgroup$
– Jerome
Mar 19 at 16:41
$begingroup$
@Jerome: No, it is not. The convergence is for a fixed $k$.
$endgroup$
– tomasz
Mar 19 at 18:23
$begingroup$
Also doesn't work. For a fixed $n > 1$, $a_{n-1}(n) = 1$ which does not converge to zero and this is on assumptions.
$endgroup$
– Jerome
Mar 19 at 16:41
$begingroup$
Also doesn't work. For a fixed $n > 1$, $a_{n-1}(n) = 1$ which does not converge to zero and this is on assumptions.
$endgroup$
– Jerome
Mar 19 at 16:41
$begingroup$
@Jerome: No, it is not. The convergence is for a fixed $k$.
$endgroup$
– tomasz
Mar 19 at 18:23
$begingroup$
@Jerome: No, it is not. The convergence is for a fixed $k$.
$endgroup$
– tomasz
Mar 19 at 18:23
add a comment |
$begingroup$
Hint: Consider $a_k(n):=ndelta_{k,n}$ (this is Kronecker delta).
$endgroup$
$begingroup$
In the assumptions, $a_n(n) rightarrow 0$. In your example, $a_n(n) = n delta_{n,n} = n$ does not converge to zero.
$endgroup$
– Jerome
Mar 19 at 16:34
$begingroup$
@Jerome: No. in the assumptions, for every $k$, you have $a_k(n)to 0$. In my example, $a_k(n)=0$ for all $n>k$, so in particular, $a_k(n)to 0$.
$endgroup$
– tomasz
Mar 19 at 18:21
add a comment |
$begingroup$
Hint: Consider $a_k(n):=ndelta_{k,n}$ (this is Kronecker delta).
$endgroup$
$begingroup$
In the assumptions, $a_n(n) rightarrow 0$. In your example, $a_n(n) = n delta_{n,n} = n$ does not converge to zero.
$endgroup$
– Jerome
Mar 19 at 16:34
$begingroup$
@Jerome: No. in the assumptions, for every $k$, you have $a_k(n)to 0$. In my example, $a_k(n)=0$ for all $n>k$, so in particular, $a_k(n)to 0$.
$endgroup$
– tomasz
Mar 19 at 18:21
add a comment |
$begingroup$
Hint: Consider $a_k(n):=ndelta_{k,n}$ (this is Kronecker delta).
$endgroup$
Hint: Consider $a_k(n):=ndelta_{k,n}$ (this is Kronecker delta).
answered Mar 19 at 16:30
tomasztomasz
24k23482
24k23482
$begingroup$
In the assumptions, $a_n(n) rightarrow 0$. In your example, $a_n(n) = n delta_{n,n} = n$ does not converge to zero.
$endgroup$
– Jerome
Mar 19 at 16:34
$begingroup$
@Jerome: No. in the assumptions, for every $k$, you have $a_k(n)to 0$. In my example, $a_k(n)=0$ for all $n>k$, so in particular, $a_k(n)to 0$.
$endgroup$
– tomasz
Mar 19 at 18:21
add a comment |
$begingroup$
In the assumptions, $a_n(n) rightarrow 0$. In your example, $a_n(n) = n delta_{n,n} = n$ does not converge to zero.
$endgroup$
– Jerome
Mar 19 at 16:34
$begingroup$
@Jerome: No. in the assumptions, for every $k$, you have $a_k(n)to 0$. In my example, $a_k(n)=0$ for all $n>k$, so in particular, $a_k(n)to 0$.
$endgroup$
– tomasz
Mar 19 at 18:21
$begingroup$
In the assumptions, $a_n(n) rightarrow 0$. In your example, $a_n(n) = n delta_{n,n} = n$ does not converge to zero.
$endgroup$
– Jerome
Mar 19 at 16:34
$begingroup$
In the assumptions, $a_n(n) rightarrow 0$. In your example, $a_n(n) = n delta_{n,n} = n$ does not converge to zero.
$endgroup$
– Jerome
Mar 19 at 16:34
$begingroup$
@Jerome: No. in the assumptions, for every $k$, you have $a_k(n)to 0$. In my example, $a_k(n)=0$ for all $n>k$, so in particular, $a_k(n)to 0$.
$endgroup$
– tomasz
Mar 19 at 18:21
$begingroup$
@Jerome: No. in the assumptions, for every $k$, you have $a_k(n)to 0$. In my example, $a_k(n)=0$ for all $n>k$, so in particular, $a_k(n)to 0$.
$endgroup$
– tomasz
Mar 19 at 18:21
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%2f3154276%2fconvergence-for-the-norm-of-a-sequence-in-ell-infty%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