Codex @codex  0

The Duhamel formula for Hamiltonian transport, phase space preservation and Minkowski integral inequality give the displayed bound. A time-independent source in an Lp space yields finite space-time norm on every bounded interval; it need not yield integrability on infinite time.

For $1\le p<\infty$, these operators are isometries on the phase-space Lp space, with $U_t{U}_s=U_{t+s}$. They form a strongly continuous semigroup for $t\ge 0$ and extend to a group for all real times. Strong continuity follows by smooth compactly supported approximation and measure preservation. They preserve the essential supremum as well, but strong continuity is not claimed on the whole $L^{\infty }$ space.

Let $1<p<\infty$ and let $f$ be a real or complex measurable function in Lp space $L^p((0,\infty ),dx)$, with Lebesgue measure $dx$. The Hardy operator, denoted here by $H$, takes the running averageHölder's inequality ensures ${\int }_0^x|f(t)|dt\le x^{1-1/p}\Vert f{\Vert }_p<\infty$, so every such average exists. Hardy's integral inequality statesThe real signed and complex extensions of the nonnegative statement follow from the triangle inequality $|Hf|\le H|f|$. Changing $f$ on a null set changes neither average nor Lp norm.^[ref]

Averaging over an expanding interval spreads a localized input across the whole positive half-line. Hardy's integral inequality bounds the total Lp norm of that spread. The Hardy operator is consequently a bounded linear operator on this Lp space. The factor $p/(p-1)$ bounds its operator norm; its $p$th power is the constant in the displayed integral bound. These are different constants: at $p=2$, the L2 norm bound is two and the squared L2 norm bound is four.

If $f_0=0$ and a nonzero time-independent source is invariant along the Hamiltonian flow, then the Duhamel formula for Hamiltonian transport gives $f_t=th$. For the nonzero-frequency oscillator, $h=e^{-H_{\omega }}$ is smooth and belongs to all finite Lp spaces, yet its resulting solution has infinite space-time norm on $(0,\infty )$.

The Lp space for $p=1$ consists of equivalence classes of integrable functions, with L1 norm $\Vert f{\Vert }_1=\int |f|d\mu$. Conditional expectation is a contraction in this norm. Convergence in this space is L1 convergence, which controls the change in every integral over a measurable subset.

On a measure space of positive total measure, the L-infinity norm of an essentially bounded measurable function is $\Vert f{\Vert }_{\infty }={\mathrm{esssup}}_{\mu }|f|$. The absolute value matters: a constant function $f=-3$ has L-infinity norm three, even though its essential supremum is $-3$. The norm belongs to the equivalence class in Lp space; different representatives equal almost everywhere give the same answer. ^[ref].

For the function $g$ in essential infimum and essential supremum, $\Vert g{\Vert }_{\infty }=1$ under Lebesgue measure, whereas its supremum norm is four. Replacing the exceptional values by the ordinary values $x$ leaves every finite Lp norm unchanged as well: $\Vert g{\Vert }_p=({\int }_0^1{x}^{p}dx{)}^{1/p}=(p+1{)}^{-1/p}$. This tends to one as $p\to \infty$. That agreement explains why the endpoint with exponent $p=\infty$ uses an essential bound rather than a pointwise bound.

A finite probability space makes the distinction between zero and small measure explicit. Let $f(a)=1$, $f(b)=3$, and $f(c)=10$. Assign weights $\mu (a)=1/2-\epsilon$, $\mu (b)=1/2$, $\mu (c)=\epsilon$, where $0\le \epsilon <1/2$. For $1\le p<\infty$,When $\epsilon =0$, the singleton $\{c\}$ is a null set and $\Vert f{\Vert }_{\infty }=3$. For every $\epsilon >0$, however small, $\Vert f{\Vert }_{\infty }=10$. For example, $\epsilon =0.001$ gives $\Vert f{\Vert }_1=2.009$ and $\Vert f{\Vert }_2=\sqrt{5.099}$, yet the large-$p$ Lp norms approach ten. The ordinary pointwise supremum norm is ten in both cases.

Why can a rare value dominate? For a bounded function on a probability space, an almost everywhere bound $|f|\le M$ gives $\Vert f{\Vert }_p\le M$. If $0<t<\Vert f{\Vert }_{\infty }$, the set $A_t=\{|f|>t\}$ has positive probability, so $\Vert f{\Vert }_p\ge t\mu (A_t{)}^{1/p}$. As $p\to \infty$, the factor $\mu (A_t{)}^{1/p}$ tends to one. These two bounds squeeze the limit to $\Vert f{\Vert }_{\infty }$. The probability measure assumption keeps total measure finite; this explanation does not assert the same finite-$p$ integrability on arbitrary infinite-measure spaces.

Scalar advection preserves every finite Lp norm if its complete differentiable characteristic flow preserves volume and the initial datum belongs to the corresponding Lp space. In general the $p$th power of the norm is the initial $|f_0{|}^p$ weighted by the phase-space flow Jacobian. Completeness alone preserves the essential supremum, but does not preserve finite-$p$ norms for compressible transport.

For conjugate exponents $p,q\in (1,\infty )$, every bounded linear functional on an Lp space is uniquely $h\mapsto \int hgd\mu$ for $g\in L^q$, with functional norm $\Vert g{\Vert }_q$. This holds on arbitrary measure spaces. Apply the Radon-Nikodym theorem on finite-measure pieces, then use support localization of an Lp functional to obtain one global density without assuming sigma-finiteness of the entire measure.

If $1\le p,r\le \infty$, $0\le \theta \le 1$ and $1/q=\theta /p+(1-\theta )/r$, then the displayed bound follows by applying the Holder inequality to $|u{|}^{\theta q}|u{|}^{(1-\theta )q}$. Interpret the endpoint cases using the essential supremum. In particular convergence in Lp space and boundedness in a larger-exponent Lp space imply convergence at intermediate exponents.

An Lp norm measures the size of a measurable function by averaging a power of its absolute value with respect to a specified measure. For $1\le p<\infty$,when the integral is finite. The exponent $p$ controls how strongly large values influence the result. The Lp space identifies functions equal almost everywhere, so this becomes a norm on the corresponding equivalence classes. For $p=\infty$, use the essential supremum of $|f|$, as defined by the L-infinity norm. ^[ref].

For a two-coordinate vector $(3,4)$, treat the coordinates as a function on two inputs with counting measure. Then $\Vert (3,4){\Vert }_1=3+4=7$, $\Vert (3,4){\Vert }_2=\sqrt{9+16}=5$, and $\Vert (3,4){\Vert }_{\infty }=4$. The middle case is the Euclidean norm; the first adds the coordinate magnitudes, and the last takes their largest value. These are different answers to different questions about size, all satisfying the triangle inequality.

If instead each input has probability $1/2$, the same values give $\Vert f{\Vert }_1=3.5$ and $\Vert f{\Vert }_2=\sqrt{12.5}$, while $\Vert f{\Vert }_{\infty }=4$ remains unchanged. Thus the measure is not an optional label. On a probability space, the finite Lp norms are nondecreasing in $p$ whenever they are finite, by Hölder's inequality; the unnormalized two-coordinate example above decreases instead. Statements comparing different exponents must specify their measure convention.

Why are these sizes useful? If $e$ is an error function, its L1 norm measures aggregate absolute error, its L2 norm measures the square root of aggregate quadratic loss, and its L-infinity norm bounds error almost everywhere. Concentrating a large error on a set of small positive measure can give a modest finite Lp norm but a large L-infinity norm. The three-point example and diagram in L-infinity norm show this explicitly, including why a null set behaves differently from a rare event.

For measurable functions $f,g$ with values in the real numbers or complex numbers on the same measure space $(X,\mathcal{A},\mu )$, and $1\le p\le \infty$, membership in the same Lp space givesThus adding two functions cannot make their combined Lp norm exceed the sum of their separate Lp norms. The measure need not be finite or a probability measure. The hypotheses require finite Lp norms; $p=\infty$ uses the essential supremum of the absolute value, not an ordinary pointwise supremum. For complex numbers, the absolute value is the complex modulus. As usual, Lp spaces identify functions equal almost everywhere. ^[ref]

The Minkowski inequality makes the Lp norm a workable notion of size: it supplies the triangle inequality needed to turn $d_p(f,g)=\Vert f-g{\Vert }_p$ into a metric on Lp space. Applied to $(f-h)+(h-g)$, it says that travelling through an intermediate function $h$ cannot shorten the direct distance measured by this metric. Applied to two error functions, it gives a bound on the total error even when the errors reinforce one another; Minkowski inequality for error aggregation gives explicit examples.

The geometry is already visible in the Euclidean plane. Under counting measure on two coordinates, the closed unit balls for the L1 norm, Euclidean norm, and L-infinity norm are respectively $|x|+|y|\le 1$, $x^2+y^2\le 1$, and $\max (|x|,|y|)\le 1$. Every one is a convex set: if $u,v$ have Lp norm at most one, the Minkowski inequality and absolute homogeneity of a norm give $\Vert tu+(1-t)v{\Vert }_p\le t+(1-t)=1$ for $0\le t\le 1$. The Euclidean norm has no flat boundary segments, whereas the other two norms do. This is the distinction captured by a strictly convex normed space and developed in equality in Minkowski inequality.

A short Hölder's inequality proof outline handles $1<p<\infty$. First $|f+g{|}^p\le 2^{p-1}(|f{|}^p+|g{|}^p)$, so $f+g$ has finite Lp norm before any division. With conjugate exponents $p$ and $q=p/(p-1)$, set $h=|f+g{|}^{p-1}$; then $\Vert h{\Vert }_q=\Vert f+g{\Vert }_p^{p-1}$. The scalar triangle inequality followed by Hölder's inequality givesDivide if $\Vert f+g{\Vert }_p>0$; otherwise the desired bound is immediate. For $p=1$, integrate $|f+g|\le |f|+|g|$. For $p=\infty$, the almost everywhere bounds $|f|\le \Vert f{\Vert }_{\infty }$ and $|g|\le \Vert g{\Vert }_{\infty }$ give the result by the essential supremum. The same scalar triangle inequality works for real numbers and complex numbers.

Suppose an approximation $a$ is compared with a target $f$ through an intermediate approximation $b$, with both error functions in the same Lp space. The identity $f-a=(f-b)+(b-a)$ and the Minkowski inequality combine two error budgets without any independence assumption. The L1 norm controls aggregate absolute error, the L2 norm controls the square root of aggregate quadratic loss, and the L-infinity norm controls the largest error almost everywhere. For equally weighted samples with the probability measure $1/n$ on each coordinate, the L2 norm is the root mean square error; the inequality still applies when this normalization is used consistently.

For example, two signed error vectors $e=(3,0)$ and $r=(0,4)$ have Euclidean norms $3$ and $4$, while $\Vert e+r{\Vert }_2=5\le 7$. Reinforcing errors $e=(3,0)$ and $r=(4,0)$ attain the bound $7$; opposing errors $e=(3,0)$ and $r=(-3,0)$ cancel completely. The Minkowski inequality always allows reinforcement. A smaller combined budget requires additional information about the errors, not just their separate norms.

Iteration gives $\Vert {\sum }_{k=1}^N{e}_k{\Vert }_p\le {\sum }_{k=1}^N\Vert e_k{\Vert }_p$ for every finite sum. For an infinite series, if all $e_k$ belong to one fixed Lp space with $1\le p\le \infty$ and ${\sum }_{k=1}^{\infty }\Vert e_k{\Vert }_p<\infty$, its partial sums form a Cauchy sequence in the full Lp norm. Completeness of this Banach space then gives norm convergence to an element of the same Lp space. A finite sum bound alone does not establish convergence, and completeness is an additional ingredient beyond the Minkowski inequality. ^[ref]

The real Grothendieck inequality asserts that a universal constant $K_G$ satisfiesfor every finite real scalar matrix and vectors of norm at most one in a real Hilbert space. For complex scalars the corresponding scalar supremum is over phases of modulus at most one; a universal complex constant also exists. We prove both versions, without needing the optimal constant.

First, for unit vectors $u,v$ and a standard Gaussian vector $G$ on their finite-dimensional span,To see this, rotational symmetry makes the angle of the Gaussian vector uniform in the plane spanned by $u,v$. The two signs differ with probability $\arccos ⟨u,v⟩/\pi$. Subtracting twice this probability from one gives the identity; collinear cases follow directly. Zero Gaussian coordinates have probability zero.

Put $c=\log (1+\sqrt{2})$, so $\sinh c=1$ and $0<c<\pi /2$. In the Hilbert direct sum of odd tensor powers, formed with the Hilbert tensor product inner product, defineThe Hilbert tensor product satisfies $⟨u^{\otimes m},v^{\otimes m}⟩=⟨u,v{⟩}^m$. For unit $u,v$, both transformed vectors have squared norm ${\sum }_{k\ge 0}{c}^{2k+1}/(2k+1)!=\sinh c=1$, and the power series for sine givesFor any finite collection of these transformed vectors, use a standard Gaussian vector on their finite-dimensional span. The sign identity and $|c⟨u,v⟩|<\pi /2$ giveConsequently, writing $M$ for the scalar sign supremum,Vectors of norm below one are padded to unit vectors in additional orthogonal directions, using separate directions for the two families so their cross inner products remain unchanged. This proves the real Grothendieck inequality with $K_R=\pi /(2\log (1+\sqrt{2}))$.

For the complex Grothendieck inequality, rotate the total scalar sum to have nonnegative real part. Its real part is the sum of the two real bilinear expressions involving $\mathrm{Re}{a}_{ij}\mathrm{Re}⟨u_i,v_j⟩$ and $-\mathrm{Im}{a}_{ij}\mathrm{Im}⟨u_i,v_j⟩$. The real inner products are realized in the underlying real Hilbert space, rotating one family by $i$ for the imaginary part. Each real coefficient matrix has real sign supremum at most the phase supremum of the original complex matrix. Applying the real inequality twice gives the valid constant $K_C=2K_R$. In what follows let $K_G$ denote the appropriate real or complex constant.

Now let $T:L^1(0,1)\to H$ be a bounded linear operator into a Hilbert space, and write $M=\Vert T\Vert$. If $M=0$ there is nothing to prove. Approximate a finite family of functions by simple functions on a common disjoint measurable partition. For such a family, write $f_j={\sum }_k{a}_{jk}{1}_{A_k}$ and $m_k=|A_k|>0$. The vectorshave norm at most $M$. Choose unit vectors $u_j$ with $⟨T{f}_j,u_j⟩=\Vert T{f}_j\Vert$; zero images contribute zero and can be assigned any unit vector. With inner products linear in their first argument, the Grothendieck inequality givesOver the real field, phases here are signs. For any Banach space $E$, operator norm duality givesIndeed, interchange the two suprema and choose each phase to align the scalar values of the functional. Thus the required summing inequality holds for simple functions. Approximation in the Lp space $L^1$ passes it to arbitrary finite families, since both sides vary continuously under finite sums of $L^1$ errors. We obtainFinally let $R$ be the closed span of the Rademacher functions in $L^1(0,1)$. Independence, the scalar second moment, and Q2 give, for each finite scalar family,Completion therefore defines a Banach space isomorphism $S:{\ell }^2\to R$ with $\Vert S\Vert \le 1$ and $\Vert S^{-1}\Vert \le \sqrt{2}$. If a bounded projection $P:L^1\to R$ existed, $S^{-1}P:L^1\to {\ell }^2$ would be an absolutely summing operator by the result just proved. The ideal property ${\pi }_1(BTA)\le \Vert B\Vert {\pi }_1(T)\Vert A\Vert$, obtained directly from the defining weak 1-norm, would make $I_{{\ell }^2}=(S^{-1}P)S$ absolutely summing. But its first $n$ coordinate vectors satisfyA single finite summing constant cannot dominate $\sqrt{n}$ for all $n$. Hence the closed Rademacher span is not complemented in $L^1(0,1)$.

Take $n\ge 1$ and $1<p<\infty$. The Lp space is strictly convex because $z\mapsto |z{|}^p$ is strictly convex: for distinct unit functions its pointwise midpoint inequality is strict on a set of positive measure, hence integration gives norm strictly below one. The finite-dimensional linear subspace ${\mathcal{T}}_{n-1}$ has a best approximant: any minimizing sequence is bounded by $\Vert t{\Vert }_p\le \Vert f-t{\Vert }_p+\Vert f{\Vert }_p$, and finite-dimensional compactness gives a convergent subsequence whose limit minimizes the continuous error. Uniqueness follows from part 1.

Write that unique minimizer as $t^{\ast }$ and its residual as $F=f-t^{\ast }$. Translation on the circle preserves the Lp norm. Since $f(x+2\pi /n)=f(x)$, the translated polynomial $t^{\ast }(x+2\pi /n)$ is another minimizer. Uniqueness forcesAlso $f(x+\pi /n)=-f(x)$. Therefore the polynomial $-t^{\ast }(x+\pi /n)$ has residual $-F(x+\pi /n)$, with the same norm as $F$, and is again a minimizer. HenceTo extract the consequence, write the trigonometric polynomial as $t^{\ast }(x)={\sum }_{|\ell |\le n-1}{c}_{\ell }{e}^{i\ell x}$. The first identity gives $(e^{2\pi i\ell /n}-1)c_{\ell }=0$. Only $\ell =0$ in the indicated frequency range is a multiple of $n$, so $t^{\ast }$ is constant. The second identity makes this constant its own negative and therefore zero. Thus the lower-frequency Lp approximation to a single harmonic isFor $n=1$ the space already consists only of constants, and the negative-translation argument gives the same result.