Bound on sine of sum of anglesMaximum Value of Trig ExpressionHow to find maximum and minimum volumes of...

What does Jesus mean regarding "Raca," and "you fool?" - is he contrasting them?

Is there a term for accumulated dirt on the outside of your hands and feet?

What does "mu" mean as an interjection?

Print a physical multiplication table

Why didn't Héctor fade away after this character died in the movie Coco?

Bash - pair each line of file

When did antialiasing start being available?

Am I eligible for the Eurail Youth pass? I am 27.5 years old

Brake pads destroying wheels

What are substitutions for coconut in curry?

How to generate binary array whose elements with values 1 are randomly drawn

Using Past-Perfect interchangeably with the Past Continuous

Calculate the frequency of characters in a string

Is it possible to stack the damage done by the Absorb Elements spell?

Worshiping one God at a time?

Synchronized implementation of a bank account in Java

World War I as a war of liberals against authoritarians?

Print last inputted byte

In what cases must I use 了 and in what cases not?

Do I need to be arrogant to get ahead?

Fewest number of steps to reach 200 using special calculator

How are passwords stolen from companies if they only store hashes?

How to define limit operations in general topological spaces? Are nets able to do this?

Should I be concerned about student access to a test bank?



Bound on sine of sum of angles


Maximum Value of Trig ExpressionHow to find maximum and minimum volumes of solid obtained by rotating $y=sin x$ around $y=c$Find the maximum and minimum values of $A cos t + B sin t$Maxima and Minima of Sin(x)/xConvolution of sine and cosine.Extrema of ellipse from parametric formSecond derivative test $sin x + sin y + sin(x-y)$Calculus inequality involving sine and cosineVolume of the solid bounded by the region $E = {(x,y,z) , : , x^2 + y^2 +z^2 - 2z leq 0, sqrt{x^2+y^2} leq z}$Questions on changing bounds of integration for double-integrals













0












$begingroup$


I would like to find tight bounds of the form



$$
f_l(x) g_l(y) leq sin( x + y) leq f_u(x) g_u(y)
$$



Especially for $x in [0, pi / N]$ and $y in [k pi / N]$ where $k$ and $N$ are integers and $|k| < N/2$. I realize that for a given $N$ the choice of $y$ is finite and therefore tight bounds can be established by taking the maximum or minimum over the set of all possibilities. However, if possible I would appreciate a more analytical approach / formulation.



For example, the identity $sin( x+ y) = sin(x) cos(y) + cos(x) sin(y)$ can be used to set some bounds by setting $x$ to the minimum and maximum values.










share|cite|improve this question











$endgroup$












  • $begingroup$
    What kind of bounds? $f_lequiv -1, g_lequiv 1$ and $f_u=g_uequiv 1$ works.
    $endgroup$
    – mfl
    Mar 11 at 20:04










  • $begingroup$
    @mfl as tight as possible bounds for the given values.
    $endgroup$
    – Sebastian Schlecht
    Mar 11 at 20:06
















0












$begingroup$


I would like to find tight bounds of the form



$$
f_l(x) g_l(y) leq sin( x + y) leq f_u(x) g_u(y)
$$



Especially for $x in [0, pi / N]$ and $y in [k pi / N]$ where $k$ and $N$ are integers and $|k| < N/2$. I realize that for a given $N$ the choice of $y$ is finite and therefore tight bounds can be established by taking the maximum or minimum over the set of all possibilities. However, if possible I would appreciate a more analytical approach / formulation.



For example, the identity $sin( x+ y) = sin(x) cos(y) + cos(x) sin(y)$ can be used to set some bounds by setting $x$ to the minimum and maximum values.










share|cite|improve this question











$endgroup$












  • $begingroup$
    What kind of bounds? $f_lequiv -1, g_lequiv 1$ and $f_u=g_uequiv 1$ works.
    $endgroup$
    – mfl
    Mar 11 at 20:04










  • $begingroup$
    @mfl as tight as possible bounds for the given values.
    $endgroup$
    – Sebastian Schlecht
    Mar 11 at 20:06














0












0








0





$begingroup$


I would like to find tight bounds of the form



$$
f_l(x) g_l(y) leq sin( x + y) leq f_u(x) g_u(y)
$$



Especially for $x in [0, pi / N]$ and $y in [k pi / N]$ where $k$ and $N$ are integers and $|k| < N/2$. I realize that for a given $N$ the choice of $y$ is finite and therefore tight bounds can be established by taking the maximum or minimum over the set of all possibilities. However, if possible I would appreciate a more analytical approach / formulation.



For example, the identity $sin( x+ y) = sin(x) cos(y) + cos(x) sin(y)$ can be used to set some bounds by setting $x$ to the minimum and maximum values.










share|cite|improve this question











$endgroup$




I would like to find tight bounds of the form



$$
f_l(x) g_l(y) leq sin( x + y) leq f_u(x) g_u(y)
$$



Especially for $x in [0, pi / N]$ and $y in [k pi / N]$ where $k$ and $N$ are integers and $|k| < N/2$. I realize that for a given $N$ the choice of $y$ is finite and therefore tight bounds can be established by taking the maximum or minimum over the set of all possibilities. However, if possible I would appreciate a more analytical approach / formulation.



For example, the identity $sin( x+ y) = sin(x) cos(y) + cos(x) sin(y)$ can be used to set some bounds by setting $x$ to the minimum and maximum values.







real-analysis calculus






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 11 at 20:18







Sebastian Schlecht

















asked Mar 11 at 19:59









Sebastian SchlechtSebastian Schlecht

23718




23718












  • $begingroup$
    What kind of bounds? $f_lequiv -1, g_lequiv 1$ and $f_u=g_uequiv 1$ works.
    $endgroup$
    – mfl
    Mar 11 at 20:04










  • $begingroup$
    @mfl as tight as possible bounds for the given values.
    $endgroup$
    – Sebastian Schlecht
    Mar 11 at 20:06


















  • $begingroup$
    What kind of bounds? $f_lequiv -1, g_lequiv 1$ and $f_u=g_uequiv 1$ works.
    $endgroup$
    – mfl
    Mar 11 at 20:04










  • $begingroup$
    @mfl as tight as possible bounds for the given values.
    $endgroup$
    – Sebastian Schlecht
    Mar 11 at 20:06
















$begingroup$
What kind of bounds? $f_lequiv -1, g_lequiv 1$ and $f_u=g_uequiv 1$ works.
$endgroup$
– mfl
Mar 11 at 20:04




$begingroup$
What kind of bounds? $f_lequiv -1, g_lequiv 1$ and $f_u=g_uequiv 1$ works.
$endgroup$
– mfl
Mar 11 at 20:04












$begingroup$
@mfl as tight as possible bounds for the given values.
$endgroup$
– Sebastian Schlecht
Mar 11 at 20:06




$begingroup$
@mfl as tight as possible bounds for the given values.
$endgroup$
– Sebastian Schlecht
Mar 11 at 20:06










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


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3144161%2fbound-on-sine-of-sum-of-angles%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














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3144161%2fbound-on-sine-of-sum-of-angles%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

Nidaros erkebispedøme

Birsay

Was Woodrow Wilson really a Liberal?Was World War I a war of liberals against authoritarians?Founding Fathers...