Operator on $ell^1(mathbb{N})$ space
$begingroup$
Let $A = (A_{n,m})$ with $A_{n,m} in mathbb{C}, n,m in mathbb{N}$ be a matrix. Assume $|A| = sup_m sum_n|A_{n,m}| < infty$. Show that for $T:ell^1(mathbb{N}) to ell^1(mathbb{N}), (Tf)(n) = sum_mA_{n,m}f(m)$ we have $|T| = |A|$.
Showing $|T| leq |A|$ was easy. But how can I show $|T| geq |A|$?
functional-analysis norm
$endgroup$
add a comment |
$begingroup$
Let $A = (A_{n,m})$ with $A_{n,m} in mathbb{C}, n,m in mathbb{N}$ be a matrix. Assume $|A| = sup_m sum_n|A_{n,m}| < infty$. Show that for $T:ell^1(mathbb{N}) to ell^1(mathbb{N}), (Tf)(n) = sum_mA_{n,m}f(m)$ we have $|T| = |A|$.
Showing $|T| leq |A|$ was easy. But how can I show $|T| geq |A|$?
functional-analysis norm
$endgroup$
add a comment |
$begingroup$
Let $A = (A_{n,m})$ with $A_{n,m} in mathbb{C}, n,m in mathbb{N}$ be a matrix. Assume $|A| = sup_m sum_n|A_{n,m}| < infty$. Show that for $T:ell^1(mathbb{N}) to ell^1(mathbb{N}), (Tf)(n) = sum_mA_{n,m}f(m)$ we have $|T| = |A|$.
Showing $|T| leq |A|$ was easy. But how can I show $|T| geq |A|$?
functional-analysis norm
$endgroup$
Let $A = (A_{n,m})$ with $A_{n,m} in mathbb{C}, n,m in mathbb{N}$ be a matrix. Assume $|A| = sup_m sum_n|A_{n,m}| < infty$. Show that for $T:ell^1(mathbb{N}) to ell^1(mathbb{N}), (Tf)(n) = sum_mA_{n,m}f(m)$ we have $|T| = |A|$.
Showing $|T| leq |A|$ was easy. But how can I show $|T| geq |A|$?
functional-analysis norm
functional-analysis norm
edited Dec 12 '18 at 4:09
davyjones
395213
395213
asked Jul 30 '18 at 8:02
AM88AM88
97
97
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Let $e_k$ be the sequence with $1$ at the $k$-th place and $0$ everywhere else. Then $|Te_k|=sum_n |T(e_k)(n)|= sum _n |A_{n,k}|$ so $|T| geq sum _n |A_{n,k}|$ for all $k$. Take sup over $k$.
$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%2f2866754%2foperator-on-ell1-mathbbn-space%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 $e_k$ be the sequence with $1$ at the $k$-th place and $0$ everywhere else. Then $|Te_k|=sum_n |T(e_k)(n)|= sum _n |A_{n,k}|$ so $|T| geq sum _n |A_{n,k}|$ for all $k$. Take sup over $k$.
$endgroup$
add a comment |
$begingroup$
Let $e_k$ be the sequence with $1$ at the $k$-th place and $0$ everywhere else. Then $|Te_k|=sum_n |T(e_k)(n)|= sum _n |A_{n,k}|$ so $|T| geq sum _n |A_{n,k}|$ for all $k$. Take sup over $k$.
$endgroup$
add a comment |
$begingroup$
Let $e_k$ be the sequence with $1$ at the $k$-th place and $0$ everywhere else. Then $|Te_k|=sum_n |T(e_k)(n)|= sum _n |A_{n,k}|$ so $|T| geq sum _n |A_{n,k}|$ for all $k$. Take sup over $k$.
$endgroup$
Let $e_k$ be the sequence with $1$ at the $k$-th place and $0$ everywhere else. Then $|Te_k|=sum_n |T(e_k)(n)|= sum _n |A_{n,k}|$ so $|T| geq sum _n |A_{n,k}|$ for all $k$. Take sup over $k$.
edited Dec 12 '18 at 4:09
davyjones
395213
395213
answered Jul 30 '18 at 8:10
Kavi Rama MurthyKavi Rama Murthy
62.1k42262
62.1k42262
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%2f2866754%2foperator-on-ell1-mathbbn-space%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