Undergrad Inequality with integral and max of derivative

Click For Summary
The discussion focuses on a mathematical inequality involving integrals and derivatives, specifically from Lighthill's work on Fourier analysis. The key point is the proof of the inequality relating the integral of the product of a function and the difference of another function from its value at zero. The user attempts to understand the steps leading to the conclusion that the absolute value of the integral can be bounded by the maximum of the derivative of the function multiplied by another integral. They reference the Cauchy–Schwarz inequality and provide a breakdown of the integral involving the Gaussian function f_n(x). The conversation also touches on a technical issue with post previews on the forum.
RaamGeneral
Messages
49
Reaction score
1
Hi. I was reading Lighthill, Introduction to Fourier Analysis and Generalised Functions and in page 17 there is an example/proof where I can't make sense of the following step:
$$
\left| \int_{-\infty}^{+\infty} f_n(x)(g(x)-g(0)) \, \mathrm{d}x \right| \le
\max{ \left| g'(x) \right| } \int_{-\infty}^{+\infty} f_n(x)\left| x \right| \, \mathrm{d}x
$$

where in particular
$$
f_n(x)=\sqrt{\frac{n}{\pi}} \mathrm{e}^{-n x^2}
$$

I have actually tried for some time, exploring some inequalities like Cauchy–Schwarz.

Also, I couldn't get the preview of this post to work, while creating, is this a known issue?
 
Physics news on Phys.org
It seems
|g(x)-g(0)|=|\int_0^x g'(t) dt| < max |g'| |x|
where max |g'| is maximum in domain 0<t<x .
 
  • Like
Likes RaamGeneral
First use <br /> \left| \int_{-\infty}^{\infty} f(x)\,dx \right| \leq \int_{-\infty}^\infty |f(x)|\,dx. The given result would then follow from
|g(x) - g(0)| = \left|\int_0^x g&#039;(t)\,dt\right| \leq |x|\max |g&#039;|.
 
  • Like
Likes RaamGeneral
For the given f_n(x), the integral is
\int_{-\infty}^{+\infty} f_n(x)|x|dx=\int_0^{+\infty}\sqrt{\frac{n}{\pi}} \mathrm{e}^{-n t} dt=(n\pi)^{-1/2}
 
There are probably loads of proofs of this online, but I do not want to cheat. Here is my attempt: Convexity says that $$f(\lambda a + (1-\lambda)b) \leq \lambda f(a) + (1-\lambda) f(b)$$ $$f(b + \lambda(a-b)) \leq f(b) + \lambda (f(a) - f(b))$$ We know from the intermediate value theorem that there exists a ##c \in (b,a)## such that $$\frac{f(a) - f(b)}{a-b} = f'(c).$$ Hence $$f(b + \lambda(a-b)) \leq f(b) + \lambda (a - b) f'(c))$$ $$\frac{f(b + \lambda(a-b)) - f(b)}{\lambda(a-b)}...

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K