For a smooth compactly supported function $f:(0,\infty)\times \mathbb R \to \mathbb R$ is it true that $$\left\| \int_0^{t} f(s, \cdot) ds \right\|_p \leq \int_0^{t} \| f(s,\cdot) \|_p ds $$ holds?
2026-05-06 02:17:21.1778033841
Prove $\| \int_0^{\tau} f(s, \cdot) ds \|_p \leq \int_0^{\tau} \| f(s,\cdot) \|_p ds $
65 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in REAL-ANALYSIS
- how is my proof on equinumerous sets
- Finding radius of convergence $\sum _{n=0}^{}(2+(-1)^n)^nz^n$
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- On sufficient condition for pre-compactness "in measure"(i.e. in Young measure space)
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Is this relating to continuous functions conjecture correct?
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Absolutely continuous functions are dense in $L^1$
- A particular exercise on convergence of recursive sequence
Related Questions in CALCULUS
- Equality of Mixed Partial Derivatives - Simple proof is Confusing
- How can I prove that $\int_0^{\frac{\pi}{2}}\frac{\ln(1+\cos(\alpha)\cos(x))}{\cos(x)}dx=\frac{1}{2}\left(\frac{\pi^2}{4}-\alpha^2\right)$?
- Proving the differentiability of the following function of two variables
- If $f ◦f$ is differentiable, then $f ◦f ◦f$ is differentiable
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Number of roots of the e
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Why the derivative of $T(\gamma(s))$ is $T$ if this composition is not a linear transformation?
- How to prove $\frac 10 \notin \mathbb R $
- Proving that: $||x|^{s/2}-|y|^{s/2}|\le 2|x-y|^{s/2}$
Related Questions in FUNCTIONAL-ANALYSIS
- On sufficient condition for pre-compactness "in measure"(i.e. in Young measure space)
- Why is necessary ask $F$ to be infinite in order to obtain: $ f(v)=0$ for all $ f\in V^* \implies v=0 $
- Prove or disprove the following inequality
- Unbounded linear operator, projection from graph not open
- $\| (I-T)^{-1}|_{\ker(I-T)^\perp} \| \geq 1$ for all compact operator $T$ in an infinite dimensional Hilbert space
- Elementary question on continuity and locally square integrability of a function
- Bijection between $\Delta(A)$ and $\mathrm{Max}(A)$
- Exercise 1.105 of Megginson's "An Introduction to Banach Space Theory"
- Reference request for a lemma on the expected value of Hermitian polynomials of Gaussian random variables.
- If $A$ generates the $C_0$-semigroup $\{T_t;t\ge0\}$, then $Au=f \Rightarrow u=-\int_0^\infty T_t f dt$?
Related Questions in INEQUALITY
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- Prove or disprove the following inequality
- Proving that: $||x|^{s/2}-|y|^{s/2}|\le 2|x-y|^{s/2}$
- Show that $x\longmapsto \int_{\mathbb R^n}\frac{f(y)}{|x-y|^{n-\alpha }}dy$ is integrable.
- Solution to a hard inequality
- Is every finite descending sequence in [0,1] in convex hull of certain points?
- Bound for difference between arithmetic and geometric mean
- multiplying the integrands in an inequality of integrals with same limits
- How to prove that $\pi^{e^{\pi^e}}<e^{\pi^{e^{\pi}}}$
- Proving a small inequality
Related Questions in LP-SPACES
- Absolutely continuous functions are dense in $L^1$
- Understanding the essential range
- Problem 1.70 of Megginson's "An Introduction to Banach Space Theory"
- Showing a sequence is in $\ell^1$
- How to conclude that $\ell_\infty$ is not separable from this exercise?
- Calculating the gradient in $L^p$ space when $0<p<1$ and the uderlying set is discrete and finite
- $f_{n} \in L^{p}(X),$ such that $\lVert f_{n}-f_{n+1}\rVert_{p} \leq \frac{1}{n^2}$. Prove $f_{n}$ converges a.e.
- Find a sequence converging in distribution but not weakly
- Elementary use of Hölder inequality
- Identify $\operatorname{co}(\{e_n:n\in\mathbb N\})$ and $\overline{\operatorname{co}}(\{e_n : n\in\mathbb N\})$ in $c_0$ and $\ell^p$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Here's the general statement of the theorem:
This is of course completely general, and from this one can easily deduce the special cases of when the target space is $\Bbb{C}$ (or really any other finite-dimensional vector space). Also, by taking $X,Y$ to be suitable subsets of $\Bbb{R}$ equipped with the Lebesgue measure, and requiring $f$ to be smooth with compact support, we can recover the situation you're asking about. So, it is up to you how general you want to be; just note that making any simplifications from the beginning does NOT simplify the resulting proof in any way.
Roughly speaking, if you think of integrals as sums, then this is saying the norm of a sum is always less or equal to the sum of the norms; so it generalizes the triangle inequality on $L^p$ spaces. In fact, if we take $X=\{1,2\}$ to be a set containing two elements, $\mathfrak{M}$ to be the trivial $\sigma$-algebra (namely the power set of $X=\{1,2\}$), and if we let $\mu$ be the counting measure on $X$, then this inequality says that if we define $f_1(y)=f(1,y)$ and $f_2(y)=f(2,y)$ then $\lVert f_1+f_2\rVert_p\leq \lVert f_1\rVert_p+\lVert f_2\rVert_p$, i.e this reduces to precisely to the usual triangle inequality of $\lVert \cdot\rVert_p$ on the space $L^p(Y,\mathfrak{N},\nu)$.
The Proof:
In the case of $p=1$, we actually have equality due to Tonelli's theorem (which says for non-negative, measurable functions we can ALWAYS swap the order of integration). The case $p=\infty$ is easy enough that I shall leave it to you to justify.
Now, suppose $1<p<\infty$, let $1<q<\infty$ be the Holder conjugate exponent (defined by the equation $\frac{1}{p}+\frac{1}{q}=1$) and define $g(y):=\int_Xf(x,y)\,d\mu(x)$. Then, \begin{align} \lVert g\rVert_p^p &:= \int_Yg(y) \cdot g(y)^{p-1}\,d\nu(y)\\ &:=\int_Y\int_Xf(x,y)g(y)^{p-1}\,d\mu(x)\,d\nu(y)\\ &= \int_X \left[\int_Yf(x,\cdot )g(\cdot)^{p-1}\,d\nu\right]\,d\mu(x)\tag{Tonelli's theorem}\\ &\leq\int_X \lVert f(x,\cdot)\rVert_p\cdot \lVert g^{p-1}\rVert_q\,d\mu(x)\tag{Holder's inequality}\\ &=\lVert g\rVert_p^{p/q}\cdot \int_X \lVert f(x,\cdot)\rVert_p\,d\mu(x), \end{align} where the last line follows immediately once you write out the definition of the $q$-norm as an integral (this is where I'm using the fact that $1<p,q<\infty$) of $g^{p-1}$, and use the fact that $\frac{1}{p}+\frac{1}{q}=1$ (it's a good exercise for you to verify these things). Now, if $\lVert g\rVert_p=0$, then the inequality we're trying to prove is trivially true (because $\lVert g\rVert_p$ is the LHS so if it is $0$ then the inequality holds trivially). So, suppose it is not $0$; then we can divide both sides by it to get \begin{align} \lVert g\rVert_p^{p-\frac{p}{q}} &\leq \int_X\lVert f(x,\cdot) \rVert_p\,d\mu(x). \end{align} Note that $p-\frac{p}{q}=1$, so after plugging in the definition of $g$, we get precisely what we wanted to show: \begin{align} \left\lVert\int_Xf(x,\cdot)\,d\mu(x)\right\rVert_p &\leq \int_X\lVert f(x,\cdot)\rVert_p\,d\mu(x). \end{align} This completes the proof in every case.
Edit in Response to Comment:
In the statement of the theorem, I assumed $f$ takes values in $[0,\infty]$, because this makes the statement of the theorem simpler. In this case, Tonelli's theorem does indeed give us equality in the case of $p=1$. In the case where $f$ takes values in a (say finite-dimensional, either real or complex... doesn't really matter) Banach space $ (V,|\cdot |)$ (for example, $\Bbb{R}$ or $\Bbb{R}^n$ or $\Bbb{C}$), we do not have equality in general for $p=1$; only an inequality; also if we want to be super formal, we would have to modify the statement of the theorem slightly:
By the way, note that I had to add in the extra condition of $f(\cdot, y)\in L^1(\mu)$ for $\nu$-a.e $y\in Y$, because otherwise the LHS of the inequality doesn't even make any sense... this is just one of those finiteness technical details which one has to keep track of so that the statement makes sense (we don't have this issue in the non-negative case because we can just declare an integral to be $\infty$, and the theorem means if the LHS is $\infty$, so is the RHS).
Before proving this, let us for the sake of completeness record the following lemma:
This is immediate for simple functions; then simply approximate any $L^1$ function using simple functions (in the case of $V=\Bbb{R}$ or $\Bbb{C}$, alternate proofs are possible, but in any case I hope you find this simple enough).
Finally, based on this lemma and my first version of the theorem for non-negative functions, the vector valued case can easily be deduced: \begin{align} \left\lVert\int_Xf(x,\cdot)\,d\mu(x)\right\rVert_p &\leq \left\lVert \int_X\left|f(x,\cdot)\right|\,d\mu(x)\right\rVert_p \leq \int_X\lVert f(x,\cdot) \rVert_p\,d\mu(x), \end{align} where the first inequality is due to the lemma, and the second is due to the non-negative version of the theorem (i.e I'm applying the theorem to the non-negative function $|f|$).