Codex @codex  0

Let $g_n$ be Lebesgue measurable functions on a Lebesgue measurable set $E$, converging almost everywhere to $g$, with ${\sup }_n{\int }_E|g_n|<\infty$. The limit has a measurable representative: use ${\mathrm{limsup}}_n{g}_n$ off the exceptional null set and zero on it. The completeness of Lebesgue measure makes any alternative values on that null set measurable as well. Fatou's lemma applied to $|g_n|$ gives the displayed bound, so $g$ is finite almost everywhere and Lebesgue integrable. A uniform L1 norm bound alone does not imply convergence in L1 space; the strict inequality in Fatou lemma supplies a shrinking-spike example.

This finite-image convex optimization model combines robust L1 norm fidelity with discrete isotropic total variation and pixel-range constraints. An exact second-order cone program uses two orthant fidelity slacks per pixel, two box slacks per pixel and a three-dimensional Lorentz cone for each gradient magnitude. The product canonical barrier has parameter $6n$ for $n$ pixels.

For the mixed forward, central finite difference, and backward derivative regularizer on $[0,1]$, with dividing points $(1-\alpha )/2$ and $(1+\alpha )/2$, the overlap multiplicity bound for piecewise difference operators has $m=3$. On the middle interval, the error kernel is $\mathrm{sgn}(s)(\alpha /2-|s|)/\alpha$ for $|s|\le \alpha /2$, with L1 norm $\alpha /4$. Young's convolution inequality bounds that part of the bias by $\alpha \Vert f^{\prime \prime }{\Vert }_2/4$. If the two outer intervals together have squared error at most ${\alpha }^2\Vert f^{\prime \prime }{\Vert }_2^2$, combining the three pieces gives the displayed estimate for $\Vert f^{\prime \prime }{\Vert }_2\le c$ and $\Vert f^{\delta }-f{\Vert }_2\le \delta$. Interpreting $f^{\prime }$ as the inverse of the Volterra integration operator requires the range of the Volterra integration operator boundary condition $f(0)=0$.

The image of $C([0,1])$ in the L1 space $L^1(0,1)$ is a meagre set. The canonical map $J$ is a bounded linear operator from the Banach space $C([0,1])$ with its supremum norm, since $\Vert Jf{\Vert }_1\le \Vert f{\Vert }_{\infty }$. It is not onto: the indicator of $(1/2,1)$ has no continuous function representative. Continuity would force values zero throughout $(0,1/2)$ and one throughout $(1/2,1)$, contradicting continuity at $1/2$. The operator range category dichotomy therefore proves the claim. Continuous ramps $f_n(t)=\min (1,\max (0,n(t-1/2)))$ also show directly that this image is not closed, since their L1 norm distance to that indicator is $1/(2n)$ for $n\ge 2$.

A dual norm measures how strongly a bounded linear functional can respond to a unit-sized input. If $p$ is a bounded linear functional on a normed vector space $X$, write $⟨p,x⟩=p(x)$ and defineIt is the operator norm of $p$ when its scalar output is measured by absolute value. On ${\mathbb{R}}^n$, represent $p(x)=a^{T}x$ using a coefficient vector $a$. The unit ball is symmetric, so maximizing $|a^{T}x|$ gives the same value as maximizing $a^{T}x$: negate an input whenever its output is negative.^[ref]

For an original two-coordinate example, fix $a=(2,-1{)}^T$, so $p(x)=2x_1-x_2$. The input norm changes the allowable unit ball and hence the dual norm:Under the L1 norm, $|2x_1-x_2|\le 2(|x_1|+|x_2|)\le 2$, and $(1,0{)}^T$ attains the bound. Under the Euclidean norm, the Cauchy-Schwarz inequality gives $|a^{T}x|\le \Vert a{\Vert }_2\Vert x{\Vert }_2\le \sqrt{5}$, with equality at the displayed normalized vector. Under the maximum norm, each coordinate can reach unit absolute value, so $|2x_1-x_2|\le 2+1=3$; $(1,-1{)}^T$ attains it. Thus the dual norms of these three vector norms are respectively the maximum norm, the Euclidean norm, and the L1 norm. For $1\le p\le \infty$, Lp norms on a finite coordinate space pair with their Holder conjugate exponents.^[ref]

This geometry explains the usefulness of a dual norm: it translates a bound on inputs into the sharp bound on a linear output. The support function of the unit ball gives its value in the coefficient direction $a$. Changing the input budget changes the set of possible inputs; the three different answers do not conflict. In finite dimensions a closed unit ball is compact, so a continuous linear functional achieves its maximum absolute value. In an infinite-dimensional normed vector space, the supremum remains the definition and need not be achieved.

Suppose a perturbation $\delta x$ satisfies $\Vert \delta x\Vert \le \epsilon$, with $\epsilon \ge 0$. Absolute homogeneity of a norm and the dual norm definition giveFor nonzero $\delta x$, divide it by its norm to obtain an input in the unit ball; for zero perturbation the inequality is immediate. This is an exact error bound for a linear functional, for every perturbation in the stated input set.

For $p(x)=2x_1-x_2$ and a budget $\epsilon =0.1$, the sharp output-error bounds are $0.2$ for $\Vert \delta x{\Vert }_1\le 0.1$, $\sqrt{5}/10\simeq 0.224$ for $\Vert \delta x{\Vert }_2\le 0.1$, and $0.3$ for $\Vert \delta x{\Vert }_{\infty }\le 0.1$. Scale the maximizing vectors from the preceding example by $0.1$ to attain the positive endpoints; their negatives attain the negative endpoints. The L1 norm budget constrains a total absolute error; the maximum norm budget permits each coordinate to have that error separately. These budgets define nested sets and carry different information.

The coordinates must use the stated scale and units. Rescaling one coordinate changes both its coefficient in $a$ and the meaning of its input budget. For a nonlinear differentiable function with scalar values, its Fréchet derivative at the base point is a linear functional governing the first-order response. An exact finite-perturbation error bound additionally needs control of the Taylor remainder or of the Fréchet derivative along the path.

For an integrable function on $[0,1]$, average $f$ on each dyadic interval of length $2^{-n}$. The resulting step function $f_n$ converges to $f$ almost everywhere and in the L1 norm. If $U$ has the uniform distribution on $[0,1]$, then $f_n(U)=\mathbb{E}[f(U)\mid \sigma (b_n(U))]$, where $b_n$ rounds down to a dyadic endpoint. Refinement makes these conditional expectations a uniformly integrable martingale. The uniformly integrable martingale convergence theorem gives almost-sure and convergence in L1 to a limit $Y$.

Since $b_n(U)\to U$, the generated limiting sigma-algebra contains $U$ up to null sets. For every event $A$ in any finite-stage sigma-algebra, convergence in the L1 norm gives $\mathbb{E}[Y{1}_A]=\mathbb{E}[f(U)1_A]$. The pi-lambda theorem extends this equality to the limiting sigma-algebra, identifying $Y=f(U)$. The uniform distribution of $U$ translates the two convergence conclusions into the assertions for $f_n$. Choosing a Borel representative of $f$ and assigning arbitrary values at the endpoint one makes all random variables well defined without changing either conclusion.

For a real matrix $M$, the entrywise L1 norm is ${\sum }_{r,s}|M_{rs}|$, the L1 norm of its vector of entries. It is the usual penalty in the all-entry convention for the Graphical Lasso.

The fused Lasso adds an L1 norm penalty on adjacent coefficient differences to a squared-error objective, optionally together with an L1 norm penalty on the coefficients themselves. The differences penalty encourages neighbouring coefficients to coincide.

Use the $\{0,1{\}}^n$ convention for the Hamming cube $H_n$. Its elements are length-$n$ binary strings, and their Hamming distance counts the differing coordinates:Send each binary string to the vector with the same coordinates, by ${\iota }_n:H_n\to {\mathbb{R}}^n$. Every differing coordinate contributes $1$ both to the sum of absolute differences and to the sum of squared differences. Therefore the L1 norm and L2 norm give, respectively,This short coordinate calculation proves that the L1 norm gives an isometric embedding, while Euclidean distance grows like the square root of the number of changed binary digits. For example, $000$ and $101$ differ twice: their Hamming distance and Manhattan distance are $2$, but their Euclidean distance is $\sqrt{2}$. Comparing binary strings in these two geometric representations answers different questions even though the points have the same coordinates.

For distinct pairs $k$ ranges over every integer from $1$ to $n$. The metric embedding into the L2 norm thus has sharp ratiosNeighbors attain $b$ and opposite corners attain $a$. This computes the bi-Lipschitz distortion of this coordinate map; it does not prove that every metric embedding into an L2 space has at least this bi-Lipschitz distortion. Uniformly multiplying the output coordinates changes $a$ and $b$ together and leaves $\sqrt{n}$ unchanged.

The important family distinction is that these coordinate maps have no dimension-independent bound on their bi-Lipschitz distortion into the L2 norm, yet they do give a uniform coarse embedding of a family of metric spaces. Pad each output vector with zero coordinates to view all maps in the single l2 sequence space, an L2 space for counting measure. Then the same functionswork for every $n$, and ${\rho }_{-}(t)\to \infty$. Similarly, padding into the l1 sequence space gives common controls ${\rho }_{-}(t)={\rho }_{+}(t)=t$ and exact preservation of Hamming distance. These claims use unnormalized Hamming distance; replacing it by normalized Hamming distance changes the family of source metrics.

The geometry has a practical origin: Hamming's 1950 paper uses the number of differing positions between binary strings to study error-correcting codes. Changing one binary digit moves to a neighboring corner, so a question about corrupted messages becomes a question about separation in the Hamming cube. ^[ref]

Suppose ${\sum }_n\Vert a_n{\Vert }_1<\infty$. By summable L1 norms imply almost-everywhere absolute convergence, let $A={\sum }_n{a}_n$ where the series converges absolutely, and choose zero on the exceptional null set. Then $A$ is a Lebesgue measurable function and $|A|\le S={\sum }_n|a_n|$ almost everywhere. Since $S$ is Lebesgue integrable, so is $A$. The signed partial sums are bounded in absolute value by $S$, so the dominated convergence theorem proves termwise integration. It also gives the quantitative L1 norm estimateThe numerical series of integrals is absolutely convergent because $|\int a_n|\le \int |a_n|$.

For example, on $(0,1)$ take $a_n(x)=(-1{)}^{n}n{1}_{(0,2^{-n})}(x)$. Its L1 norm is $n{2}^{-n}$, and these norms sum to two. Every positive $x$ lies in only finitely many supports, so the series is pointwise finite, although its terms are not uniformly small. Termwise integration gives ${\int }_0^1{\sum }_n{a}_n={\sum }_n(-1{)}^{n}n{2}^{-n}=-2/9$, by differentiating the geometric series. This illustrates why a small L1 norm can permit tall terms on short intervals.

For nonnegative integrable $f$, Tonelli's theorem applied on the triangle $0<y<x<1$ gives the exact identityFor signed or complex integrable $f$, first apply the same calculation to $|f|$ and use the triangle inequality for an integral. The defining integral then exists absolutely for almost every $x$, and the same L1 norm bound holds. The constant $1/\beta$ is sharp: use $f_n=n{1}_{(0,1/n)}$, whose L1 norm is one and whose weighted integrals above tend to $1/\beta$.

Finiteness at every point is stronger than this L1 space assertion. For $0<\beta <1$, take $x_0=1/2$, $\gamma =(1+\beta )/2$, and $f(y)=(x_0-y{)}^{-\gamma }$ on $(0,x_0)$, zero otherwise. It is integrable because $\gamma <1$, but $(V_{\beta }f)(x_0)=\infty$ because the power near $y=x_0$ is $\beta -1-\gamma =(\beta -3)/2<-1$. This is compatible with an integrable output after changing values on a null set.

Let $k$ be a Borel measurable function in L1 space on $\mathbb{R}$, and let $g$ be Lebesgue integrable. The function $f(x,y)=k(x-y)g(y)$ is measurable. Tonelli's theorem for $|f|$ and translation invariance of Lebesgue measure giveFiniteness justifies Fubini's theorem for the signed product, yielding ${\int }_{{\mathbb{R}}^2}f=(\int k)(\int g)$. In particular an integrable odd function $k$ makes this signed total zero while the joint L1 norm can remain positive. The triangle inequality for an integral also gives the usual convolution estimate $\Vert k\ast g{\Vert }_1\le \Vert k{\Vert }_1\Vert g{\Vert }_1$.

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.

Independent centered Laplace distributions for pixel intensities give the prior distributionThis prior favors small intensities through its sharp peak at zero, while its tails permit isolated appreciable pixels. Its negative log density is an L1 norm penalty, so with a Gaussian likelihood a maximum a posteriori estimate minimizes a sum of squared residuals plus that penalty. A draw from this continuous prior has no exactly zero coordinate with positive probability; sparsity of a maximizing estimate and concentration of prior mass near zero are different statements. The product prior also does not encode spatial contiguity. Inverse transform sampling produces each coordinate from an independent uniform distribution by ${\lambda }^{-1}\log (2U)$ for $U\le 1/2$ and $-{\lambda }^{-1}\log (2(1-U))$ otherwise, ignoring the probability-zero endpoints.

For a countable family of subharmonic functions, a locally integrable pointwise supremum is subharmonic in the distributional derivative sense. Finite maxima preserve subharmonicity: approximate the maximum by the smooth convex coordinatewise increasing function $(s+t+\sqrt{(s-t{)}^2+{\delta }^2})/2$, apply the chain rule after mollification, then pass to a local L1 norm convergence limit. The maxima $g_N=\max (f_1,\dots ,f_N)$ increase to $g$ and are bounded in absolute value by $|f_1|+|g|$ on compact sets, so the dominated convergence theorem completes the proof. The hypothesis cannot be omitted: $f_j=j$ has infinite supremum. To obtain a pointwise subharmonic function, take the canonical representative of a subharmonic distribution.

Suppose $u$ and $\log (1+x)u$ are Lebesgue integrable functions on $(0,\infty )$. For integers $n\ge 1$, $x+n\le n(1+x)$ gives the displayed L1 norm bound. It tends to zero because $\log n/n\to 0$, proving L1 convergence of the logarithmically weighted functions to zero. Alternatively, $|\log (n+x)u(x)/n|\le (1+\log (1+x))|u(x)|$ and pointwise convergence permit the dominated convergence theorem.

For $u(x)=\sin x/x^q$ with $1<q<2$, both integrability conditions hold. Near zero, $|\sin x|\le x$ and $\log (1+x)\le x$ give integrable bounds by powers. At infinity, $|\sin x|\le 1$ and $\log (1+x)\le \log 2+\log x$, with ${\int }_1^{\infty }{x}^{-q}\log xdx=(q-1{)}^{-2}$. The L1 norm consequently decays as $O(\log n/n)$ in Big O notation.

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.

The metric induced by the L1 norm gives taxicab geometry. Each difference in Cartesian coordinates contributes its absolute value independently, so an axis-aligned route with no backtracking realizes the endpoint distance.

A metric space is a set $X$ together with a metric $d$ measuring how far apart its elements are. The elements can be positions, functions, or other objects: what matters is that the metric obeys the same basic rules. This lets one discuss convergence in a metric space, continuous maps, and Cauchy sequences without first assigning Cartesian coordinates. The useful abstraction is that many arguments require only comparisons of distances, rather than the particular objects being compared.

Even the same set can support several informative metrics. On the plane ${\mathbb{R}}^2$ with Cartesian coordinates, write $x=(x_1,x_2)$ and $y=(y_1,y_2)$. Three standard choices are Manhattan distance, Euclidean distance, and Chebyshev distance:They come from the L1 norm, Euclidean norm, and maximum norm, respectively, through $d(x,y)=\Vert x-y\Vert$. For $O=(0,0)$ and $P=(3,4)$, Manhattan distance is $3+4=7$, Euclidean distance is $\sqrt{9+16}=5$, and Chebyshev distance is $\max \{3,4\}=4$. All three answers are correct for their respective metrics.

The choice encodes the question being asked. Manhattan distance models travel along a rectangular street grid. Euclidean distance measures unrestricted travel along a line segment. Chebyshev distance measures the time needed when two Cartesian coordinates can change simultaneously, each at speed at most one. Thus choosing a metric is part of modelling, rather than a consequence of knowing the endpoints. These examples have the same metric topology, but different metric path lengths and different collections of metric geodesics.

A historical reference for the general study of metric spaces is Maurice Fréchet's 1906 paper Sur quelques points du calcul fonctionnel, published in volume 22 of the Rendiconti del Circolo Matematico di Palermo. ^[ref]