Why is $ prod_{n=0}^{N-1} u[x_n + theta] - u[x_n-theta] = u[theta - max(|x_n| )]$?












1












$begingroup$


I'm self-studying math, and came across a problem:



$$
prod_{n=0}^{N-1} left(u[x_n + theta] - u[x_n-theta]right) = u[theta - max(|x_n| )]
$$



where $u$ is a unit step function, $x_n$ are sample points, $theta$ is a constant. So basically, the two unit steps functions form a rectangular function, and the centers $x_n$ of the rectangular functions are different and if they don't overlap then the whole product is zero. And we are to find how to have this product not equal to zero.
So by the explanation from the book, if $-theta < x[n] < theta$, this product equals to $u(theta - max(|x[n]| )$. Why is that?










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    So as you said, the LHS equals to $1$ if and only if $-theta < x_n < theta$ for $n = 0, 1, 2 ldots, N-1$, which is equivalent to $|x_n| < theta$. Since it holds for all $n$, it is equivalent to say that the $max |x_n| < theta$. So the unit step function in the RHS satisfy this and thus the equality holds.
    $endgroup$
    – BGM
    Dec 19 '18 at 10:54










  • $begingroup$
    @BGM thanks for trying to help. I understand up the the max part, but I don't know how that translates to $u(theta-max(|x_n|))$
    $endgroup$
    – drerD
    Dec 19 '18 at 20:09
















1












$begingroup$


I'm self-studying math, and came across a problem:



$$
prod_{n=0}^{N-1} left(u[x_n + theta] - u[x_n-theta]right) = u[theta - max(|x_n| )]
$$



where $u$ is a unit step function, $x_n$ are sample points, $theta$ is a constant. So basically, the two unit steps functions form a rectangular function, and the centers $x_n$ of the rectangular functions are different and if they don't overlap then the whole product is zero. And we are to find how to have this product not equal to zero.
So by the explanation from the book, if $-theta < x[n] < theta$, this product equals to $u(theta - max(|x[n]| )$. Why is that?










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    So as you said, the LHS equals to $1$ if and only if $-theta < x_n < theta$ for $n = 0, 1, 2 ldots, N-1$, which is equivalent to $|x_n| < theta$. Since it holds for all $n$, it is equivalent to say that the $max |x_n| < theta$. So the unit step function in the RHS satisfy this and thus the equality holds.
    $endgroup$
    – BGM
    Dec 19 '18 at 10:54










  • $begingroup$
    @BGM thanks for trying to help. I understand up the the max part, but I don't know how that translates to $u(theta-max(|x_n|))$
    $endgroup$
    – drerD
    Dec 19 '18 at 20:09














1












1








1





$begingroup$


I'm self-studying math, and came across a problem:



$$
prod_{n=0}^{N-1} left(u[x_n + theta] - u[x_n-theta]right) = u[theta - max(|x_n| )]
$$



where $u$ is a unit step function, $x_n$ are sample points, $theta$ is a constant. So basically, the two unit steps functions form a rectangular function, and the centers $x_n$ of the rectangular functions are different and if they don't overlap then the whole product is zero. And we are to find how to have this product not equal to zero.
So by the explanation from the book, if $-theta < x[n] < theta$, this product equals to $u(theta - max(|x[n]| )$. Why is that?










share|cite|improve this question











$endgroup$




I'm self-studying math, and came across a problem:



$$
prod_{n=0}^{N-1} left(u[x_n + theta] - u[x_n-theta]right) = u[theta - max(|x_n| )]
$$



where $u$ is a unit step function, $x_n$ are sample points, $theta$ is a constant. So basically, the two unit steps functions form a rectangular function, and the centers $x_n$ of the rectangular functions are different and if they don't overlap then the whole product is zero. And we are to find how to have this product not equal to zero.
So by the explanation from the book, if $-theta < x[n] < theta$, this product equals to $u(theta - max(|x[n]| )$. Why is that?







calculus probability statistics products step-function






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 19 '18 at 20:52









Lorenzo B.

1,8602520




1,8602520










asked Dec 19 '18 at 6:42









drerDdrerD

1609




1609








  • 1




    $begingroup$
    So as you said, the LHS equals to $1$ if and only if $-theta < x_n < theta$ for $n = 0, 1, 2 ldots, N-1$, which is equivalent to $|x_n| < theta$. Since it holds for all $n$, it is equivalent to say that the $max |x_n| < theta$. So the unit step function in the RHS satisfy this and thus the equality holds.
    $endgroup$
    – BGM
    Dec 19 '18 at 10:54










  • $begingroup$
    @BGM thanks for trying to help. I understand up the the max part, but I don't know how that translates to $u(theta-max(|x_n|))$
    $endgroup$
    – drerD
    Dec 19 '18 at 20:09














  • 1




    $begingroup$
    So as you said, the LHS equals to $1$ if and only if $-theta < x_n < theta$ for $n = 0, 1, 2 ldots, N-1$, which is equivalent to $|x_n| < theta$. Since it holds for all $n$, it is equivalent to say that the $max |x_n| < theta$. So the unit step function in the RHS satisfy this and thus the equality holds.
    $endgroup$
    – BGM
    Dec 19 '18 at 10:54










  • $begingroup$
    @BGM thanks for trying to help. I understand up the the max part, but I don't know how that translates to $u(theta-max(|x_n|))$
    $endgroup$
    – drerD
    Dec 19 '18 at 20:09








1




1




$begingroup$
So as you said, the LHS equals to $1$ if and only if $-theta < x_n < theta$ for $n = 0, 1, 2 ldots, N-1$, which is equivalent to $|x_n| < theta$. Since it holds for all $n$, it is equivalent to say that the $max |x_n| < theta$. So the unit step function in the RHS satisfy this and thus the equality holds.
$endgroup$
– BGM
Dec 19 '18 at 10:54




$begingroup$
So as you said, the LHS equals to $1$ if and only if $-theta < x_n < theta$ for $n = 0, 1, 2 ldots, N-1$, which is equivalent to $|x_n| < theta$. Since it holds for all $n$, it is equivalent to say that the $max |x_n| < theta$. So the unit step function in the RHS satisfy this and thus the equality holds.
$endgroup$
– BGM
Dec 19 '18 at 10:54












$begingroup$
@BGM thanks for trying to help. I understand up the the max part, but I don't know how that translates to $u(theta-max(|x_n|))$
$endgroup$
– drerD
Dec 19 '18 at 20:09




$begingroup$
@BGM thanks for trying to help. I understand up the the max part, but I don't know how that translates to $u(theta-max(|x_n|))$
$endgroup$
– drerD
Dec 19 '18 at 20:09










1 Answer
1






active

oldest

votes


















2












$begingroup$

The step function $u[t]$ equals $1$ if its argument $t$ is greater than zero, and equals $0$ otherwise. Another way to write this is $$u[t] = I(t>0),tag1$$ where $I(cdot)$ denotes the indicator function, which is one when its argument is true and zero otherwise. Your book argues that the expression
$$prod_{n=0}^{N-1} left(u[x_n + theta] - u[x_n-theta]right)tag2$$
equals one if $max|x_n|<theta$, and equals zero otherwise. This means expression (2) is equal to
$$I(max|x_n|<theta),$$
which can be rewritten $I(theta-max|x_n|>0)$, which by (1) can be rewritten $u[theta-max|x_n|]$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    wow, thank you. It has puzzled me for more than week.
    $endgroup$
    – drerD
    Dec 20 '18 at 2:43











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%2f3046092%2fwhy-is-prod-n-0n-1-ux-n-theta-ux-n-theta-u-theta-maxx%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









2












$begingroup$

The step function $u[t]$ equals $1$ if its argument $t$ is greater than zero, and equals $0$ otherwise. Another way to write this is $$u[t] = I(t>0),tag1$$ where $I(cdot)$ denotes the indicator function, which is one when its argument is true and zero otherwise. Your book argues that the expression
$$prod_{n=0}^{N-1} left(u[x_n + theta] - u[x_n-theta]right)tag2$$
equals one if $max|x_n|<theta$, and equals zero otherwise. This means expression (2) is equal to
$$I(max|x_n|<theta),$$
which can be rewritten $I(theta-max|x_n|>0)$, which by (1) can be rewritten $u[theta-max|x_n|]$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    wow, thank you. It has puzzled me for more than week.
    $endgroup$
    – drerD
    Dec 20 '18 at 2:43
















2












$begingroup$

The step function $u[t]$ equals $1$ if its argument $t$ is greater than zero, and equals $0$ otherwise. Another way to write this is $$u[t] = I(t>0),tag1$$ where $I(cdot)$ denotes the indicator function, which is one when its argument is true and zero otherwise. Your book argues that the expression
$$prod_{n=0}^{N-1} left(u[x_n + theta] - u[x_n-theta]right)tag2$$
equals one if $max|x_n|<theta$, and equals zero otherwise. This means expression (2) is equal to
$$I(max|x_n|<theta),$$
which can be rewritten $I(theta-max|x_n|>0)$, which by (1) can be rewritten $u[theta-max|x_n|]$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    wow, thank you. It has puzzled me for more than week.
    $endgroup$
    – drerD
    Dec 20 '18 at 2:43














2












2








2





$begingroup$

The step function $u[t]$ equals $1$ if its argument $t$ is greater than zero, and equals $0$ otherwise. Another way to write this is $$u[t] = I(t>0),tag1$$ where $I(cdot)$ denotes the indicator function, which is one when its argument is true and zero otherwise. Your book argues that the expression
$$prod_{n=0}^{N-1} left(u[x_n + theta] - u[x_n-theta]right)tag2$$
equals one if $max|x_n|<theta$, and equals zero otherwise. This means expression (2) is equal to
$$I(max|x_n|<theta),$$
which can be rewritten $I(theta-max|x_n|>0)$, which by (1) can be rewritten $u[theta-max|x_n|]$.






share|cite|improve this answer









$endgroup$



The step function $u[t]$ equals $1$ if its argument $t$ is greater than zero, and equals $0$ otherwise. Another way to write this is $$u[t] = I(t>0),tag1$$ where $I(cdot)$ denotes the indicator function, which is one when its argument is true and zero otherwise. Your book argues that the expression
$$prod_{n=0}^{N-1} left(u[x_n + theta] - u[x_n-theta]right)tag2$$
equals one if $max|x_n|<theta$, and equals zero otherwise. This means expression (2) is equal to
$$I(max|x_n|<theta),$$
which can be rewritten $I(theta-max|x_n|>0)$, which by (1) can be rewritten $u[theta-max|x_n|]$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 19 '18 at 21:21









grand_chatgrand_chat

20.3k11326




20.3k11326












  • $begingroup$
    wow, thank you. It has puzzled me for more than week.
    $endgroup$
    – drerD
    Dec 20 '18 at 2:43


















  • $begingroup$
    wow, thank you. It has puzzled me for more than week.
    $endgroup$
    – drerD
    Dec 20 '18 at 2:43
















$begingroup$
wow, thank you. It has puzzled me for more than week.
$endgroup$
– drerD
Dec 20 '18 at 2:43




$begingroup$
wow, thank you. It has puzzled me for more than week.
$endgroup$
– drerD
Dec 20 '18 at 2:43


















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%2f3046092%2fwhy-is-prod-n-0n-1-ux-n-theta-ux-n-theta-u-theta-maxx%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

Wiesbaden

Marschland

Dieringhausen