How can one prove P(τ)S(τ) = S(τ)P(0)?

tutumar
Messages
2
Reaction score
0
Assume u:R\rightarrow C^n and define shift operator S(\tau) with

S(\tau)u(t)=u(t-\tau)

and truncation operator P(\tau) with

P(\tau)u(t)=u(t) for t\leq\tau and 0 for t>\tau

Then P(\tau)S(\tau)=S(\tau)P(0) for every \tau>=0.

Can someone please prove last statement..
 
Last edited:
Physics news on Phys.org
Looks like pretty direct computation. If u(t) is any such function, then what isSD(\tau)u? What is P(\tau)S(\tau)u? Then turn around and find S(\tau)P(0)u.
 
Yes, I tried that, and it just doesn't fit..

P(\tau)S(\tau)u(t)=P(\tau)u(t-\tau)=u(t-\tau) if t-\tau<=\tau and 0 for t-\tau>\tau

S(\tau)P(0)u(t)=S(\tau)u(t) for t<=0 and 0 otherwise=u(t-\tau) if t<=0 and 0 otherwise..

Well, something's got to be wrong here, but I can't see what..
 
I think your last equation is wrong. As, if we have:

$$P(0)u(t)=u(t) \mbox{ if } t\leq 0 \mbox{ and } 0 \mbox{ otherwise }$$

than:

$$S(\tau)P(0)u(t)=u(t-\tau) \mbox{ if } t-\tau\leq 0 \mbox{ and } 0 \mbox{ if } t-\tau>0$$

Still, I'm not able to prove the statement as in the first case you have $$t-\tau\leq\tau$$ and in this case there is $$t-\tau\leq 0$$. :-p I'm sorry...
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top