Upper bound like $O(log T)$ for the following sum of square root.
1
$begingroup$
I'm wondering if an upper bound in the order of $O(log T)$ can be gotten for this sum:
$sum_{t=1}^{T}sqrt{sum_{j=1}^{d}frac{a_j(t+1)-a_j(t)}{a_j^2(t)}}$,
where $d>0$ is a fixed integer, $a_j(t+1)ge a_j(t)>1$, $sum_j a_j(t+1)-a_j(t)le 1$ and $sum_j a_j(t)le t+d$.
real-analysis sequences-and-series inequality summation
asked Jan 14 at 17:13
Jimmy KangJimmy Kang
718
$endgroup$
add a comment |
1
$begingroup$
I'm wondering if an upper bound in the order of $O(log T)$ can be gotten for this sum:
$sum_{t=1}^{T}sqrt{sum_{j=1}^{d}frac{a_j(t+1)-a_j(t)}{a_j^2(t)}}$,
where $d>0$ is a fixed integer, $a_j(t+1)ge a_j(t)>1$, $sum_j a_j(t+1)-a_j(t)le 1$ and $sum_j a_j(t)le t+d$.
real-analysis sequences-and-series inequality summation
asked Jan 14 at 17:13
Jimmy KangJimmy Kang
718
$endgroup$
$begingroup$
Random comments: Various constructions all seem to obey the $O(log T)$ bound. WLOG we can take $a_j(1)=1$. The case $d=1$ already seems to contain the essential complexity. Setting $delta(t) = a_1(t+1)-a_1(t) le 1$, we see we want an upper bound for $$frac{sqrt{delta_1}}1 + frac{sqrt{delta_2}}{1+delta_1} + frac{sqrt{delta_3}}{1+delta_1+delta_2} + cdots + frac{sqrt{delta_T}}{1+delta_1+cdots+delta_{T-1}}.$$ Some examination suggests that this function is increasing in each $delta_t$, which would mean that the maximum is given by $a_1(t) = t$ which satisfies $O(log T)$.
$endgroup$
– Greg Martin
Jan 15 at 8:56
$begingroup$
I find for $d = 1$, if $a(t+1)-a(t)=1/T$, $sum_{t=1}^{T}frac{sqrt{1/T}}{a(1)+t/T} ge frac{sqrt{T}}{a(1)+1}$. So essentially this sum is not upper bounded by $O(log T)$.
$endgroup$
– Jimmy Kang
Jan 15 at 9:41
add a comment |
1
1
1
$begingroup$
I'm wondering if an upper bound in the order of $O(log T)$ can be gotten for this sum:
$sum_{t=1}^{T}sqrt{sum_{j=1}^{d}frac{a_j(t+1)-a_j(t)}{a_j^2(t)}}$,
where $d>0$ is a fixed integer, $a_j(t+1)ge a_j(t)>1$, $sum_j a_j(t+1)-a_j(t)le 1$ and $sum_j a_j(t)le t+d$.
real-analysis sequences-and-series inequality summation
asked Jan 14 at 17:13
Jimmy KangJimmy Kang
718
$endgroup$
I'm wondering if an upper bound in the order of $O(log T)$ can be gotten for this sum:
$sum_{t=1}^{T}sqrt{sum_{j=1}^{d}frac{a_j(t+1)-a_j(t)}{a_j^2(t)}}$,
where $d>0$ is a fixed integer, $a_j(t+1)ge a_j(t)>1$, $sum_j a_j(t+1)-a_j(t)le 1$ and $sum_j a_j(t)le t+d$.
real-analysis sequences-and-series inequality summation
real-analysis sequences-and-series inequality summation
asked Jan 14 at 17:13
Jimmy KangJimmy Kang
718
asked Jan 14 at 17:13
Jimmy KangJimmy Kang
718
edited Jan 15 at 8:11
Jimmy Kang
asked Jan 14 at 17:13
Jimmy KangJimmy Kang
718
asked Jan 14 at 17:13
Jimmy KangJimmy Kang
718
asked Jan 14 at 17:13
Jimmy KangJimmy Kang
718
718
$begingroup$
Random comments: Various constructions all seem to obey the $O(log T)$ bound. WLOG we can take $a_j(1)=1$. The case $d=1$ already seems to contain the essential complexity. Setting $delta(t) = a_1(t+1)-a_1(t) le 1$, we see we want an upper bound for $$frac{sqrt{delta_1}}1 + frac{sqrt{delta_2}}{1+delta_1} + frac{sqrt{delta_3}}{1+delta_1+delta_2} + cdots + frac{sqrt{delta_T}}{1+delta_1+cdots+delta_{T-1}}.$$ Some examination suggests that this function is increasing in each $delta_t$, which would mean that the maximum is given by $a_1(t) = t$ which satisfies $O(log T)$.
$endgroup$
– Greg Martin
Jan 15 at 8:56
$begingroup$
I find for $d = 1$, if $a(t+1)-a(t)=1/T$, $sum_{t=1}^{T}frac{sqrt{1/T}}{a(1)+t/T} ge frac{sqrt{T}}{a(1)+1}$. So essentially this sum is not upper bounded by $O(log T)$.
$endgroup$
– Jimmy Kang
Jan 15 at 9:41
add a comment |
$begingroup$
Random comments: Various constructions all seem to obey the $O(log T)$ bound. WLOG we can take $a_j(1)=1$. The case $d=1$ already seems to contain the essential complexity. Setting $delta(t) = a_1(t+1)-a_1(t) le 1$, we see we want an upper bound for $$frac{sqrt{delta_1}}1 + frac{sqrt{delta_2}}{1+delta_1} + frac{sqrt{delta_3}}{1+delta_1+delta_2} + cdots + frac{sqrt{delta_T}}{1+delta_1+cdots+delta_{T-1}}.$$ Some examination suggests that this function is increasing in each $delta_t$, which would mean that the maximum is given by $a_1(t) = t$ which satisfies $O(log T)$.
$endgroup$
– Greg Martin
Jan 15 at 8:56
$begingroup$
I find for $d = 1$, if $a(t+1)-a(t)=1/T$, $sum_{t=1}^{T}frac{sqrt{1/T}}{a(1)+t/T} ge frac{sqrt{T}}{a(1)+1}$. So essentially this sum is not upper bounded by $O(log T)$.
$endgroup$
– Jimmy Kang
Jan 15 at 9:41
$begingroup$
Random comments: Various constructions all seem to obey the $O(log T)$ bound. WLOG we can take $a_j(1)=1$. The case $d=1$ already seems to contain the essential complexity. Setting $delta(t) = a_1(t+1)-a_1(t) le 1$, we see we want an upper bound for $$frac{sqrt{delta_1}}1 + frac{sqrt{delta_2}}{1+delta_1} + frac{sqrt{delta_3}}{1+delta_1+delta_2} + cdots + frac{sqrt{delta_T}}{1+delta_1+cdots+delta_{T-1}}.$$ Some examination suggests that this function is increasing in each $delta_t$, which would mean that the maximum is given by $a_1(t) = t$ which satisfies $O(log T)$.
$endgroup$
– Greg Martin
Jan 15 at 8:56
$begingroup$
Random comments: Various constructions all seem to obey the $O(log T)$ bound. WLOG we can take $a_j(1)=1$. The case $d=1$ already seems to contain the essential complexity. Setting $delta(t) = a_1(t+1)-a_1(t) le 1$, we see we want an upper bound for $$frac{sqrt{delta_1}}1 + frac{sqrt{delta_2}}{1+delta_1} + frac{sqrt{delta_3}}{1+delta_1+delta_2} + cdots + frac{sqrt{delta_T}}{1+delta_1+cdots+delta_{T-1}}.$$ Some examination suggests that this function is increasing in each $delta_t$, which would mean that the maximum is given by $a_1(t) = t$ which satisfies $O(log T)$.
$endgroup$
– Greg Martin
Jan 15 at 8:56
$begingroup$
I find for $d = 1$, if $a(t+1)-a(t)=1/T$, $sum_{t=1}^{T}frac{sqrt{1/T}}{a(1)+t/T} ge frac{sqrt{T}}{a(1)+1}$. So essentially this sum is not upper bounded by $O(log T)$.
$endgroup$
– Jimmy Kang
Jan 15 at 9:41
$begingroup$
I find for $d = 1$, if $a(t+1)-a(t)=1/T$, $sum_{t=1}^{T}frac{sqrt{1/T}}{a(1)+t/T} ge frac{sqrt{T}}{a(1)+1}$. So essentially this sum is not upper bounded by $O(log T)$.
$endgroup$
– Jimmy Kang
Jan 15 at 9:41
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
});
}
});
draft saved
draft discarded
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%2f3073476%2fupper-bound-like-o-log-t-for-the-following-sum-of-square-root%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
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
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%2f3073476%2fupper-bound-like-o-log-t-for-the-following-sum-of-square-root%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$
Random comments: Various constructions all seem to obey the $O(log T)$ bound. WLOG we can take $a_j(1)=1$. The case $d=1$ already seems to contain the essential complexity. Setting $delta(t) = a_1(t+1)-a_1(t) le 1$, we see we want an upper bound for $$frac{sqrt{delta_1}}1 + frac{sqrt{delta_2}}{1+delta_1} + frac{sqrt{delta_3}}{1+delta_1+delta_2} + cdots + frac{sqrt{delta_T}}{1+delta_1+cdots+delta_{T-1}}.$$ Some examination suggests that this function is increasing in each $delta_t$, which would mean that the maximum is given by $a_1(t) = t$ which satisfies $O(log T)$.
$endgroup$
– Greg Martin
Jan 15 at 8:56
$begingroup$
I find for $d = 1$, if $a(t+1)-a(t)=1/T$, $sum_{t=1}^{T}frac{sqrt{1/T}}{a(1)+t/T} ge frac{sqrt{T}}{a(1)+1}$. So essentially this sum is not upper bounded by $O(log T)$.
$endgroup$
– Jimmy Kang
Jan 15 at 9:41