What Happens When Two Delta Dirac Functions Interact?

FrogPad
Messages
801
Reaction score
0
This isn't really homework, I'm just curious. So I'm dealing with the delta dirac function, and I was just wondering what would happen if we had two functions.

So the sampling property,

\int_{-\infty}^{\infty} f(t)\delta(t-a)\,\,dt = f(a)

Now what if we had:
\int_{-\infty}^{\infty} f(t)\delta(t-a)\delta(t-b)\,\,dt =?

What would happen?
My guess would be the following:

If a = b:
\int_{-\infty}^{\infty} f(t)\delta(t-a)\delta(t-b)\,\,dt =\int_{-\infty}^{\infty} f(t)\delta(a)\,\,dt =\int_{-\infty}^{\infty} f(t)\delta(b)\,\,dt

If a \neq b:
\int_{-\infty}^{\infty} f(t)\delta(t-a)\delta(t-b)\,\,dt = 0

Or is my answer or question just nonsense?

-Thanks
 
Physics news on Phys.org
\int_{-\infty}^{\infty} f(t)\delta(t-a)\delta(t-b)\,\,dt = \int_{-\infty}^{\infty} F(t)\delta(t-a)\,\,dt = F(a) = 0

where I have put F(t) = \delta(t-b)f(t) so that F(a) = \delta(a-b)f(a)=0 if a\neq b
 
benorin said:
\int_{-\infty}^{\infty} f(t)\delta(t-a)\delta(t-b)\,\,dt = \int_{-\infty}^{\infty} F(t)\delta(t-a)\,\,dt = F(a) = 0

where I have put F(t) = \delta(t-b)f(t) so that F(a) = \delta(a-b)f(a)=0 if a\neq b

Thanks benorin!

That was (for lack of a better word) nifty how you just used the property that f(t)\delta(t-a)=f(a) by defining a function that encapsulated what was necessary to use the property :smile: Really cool.

Well, I'm actually glad I asked the question then.

Thanks again.
 
If you want to combine delta functions, of somewhat more importance is the fact that
\int_{-\infty}^{\infty}\int_{-\infty}^{\infty} f(x,y)\delta(x-a)\delta(y-b)dxdy= f(a,b)
 
Interesting.

So I'm guessing that works as follows:
\int_{-\infty}^{\infty}\int_{-\infty}^{\infty} f(x,y)\delta(x-a)\delta(y-b)dxdy= \int_{\infty}^{\infty}dy \, \delta(y-b)\, [ f(a,y) ] = f(a,b)

Where, \delta(y-b) is held constant while integrating through dx.
 
Last edited:
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top