{
  "id": "total-variation",
  "title": "Total Variation",
  "lang": "en",
  "source_lang": "en",
  "summary": "Total variation measures accumulated change in functions and measures, linking bounded variation, probability distances, geometric analysis, and edge-preserving regularization.",
  "category": "mathematics",
  "subcategory": "analysis",
  "type": "concept",
  "aliases": [
    "Total variation seminorm",
    "Variation"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/total-variation/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/total-variation/",
      "json": "https://aiwiki.page/zh/total-variation.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Total variation is a mathematical measure of accumulated change that counts increases and decreases without allowing them to cancel. For a function on an interval, it is the supremum of the sums of absolute increments over all finite partitions. For a signed or complex measure, it is a positive measure recording the magnitude of that measure independently of sign or phase. In probability, total variation distance measures the largest difference that two probability distributions assign to the same event.\n\nThese formulations are connected rather than merely analogous. A function of bounded variation has a derivative that can be interpreted as a measure, and the total mass of its variation measure recovers its accumulated change. In several dimensions, this construction accommodates discontinuities along surfaces, making total variation fundamental to mathematical analysis, geometric problems involving perimeter, and partial differential equations. Its ability to penalize oscillation without excluding jumps also underlies edge-preserving methods in imaging and statistical estimation."
    },
    {
      "heading": "Variation of functions on an interval",
      "text": "Let \\(f:[a,b]\\to\\mathbb R\\). For a partition\n\n\\[P:\\quad a=x_0<x_1<\\cdots<x_n=b,\\]\n\nthe variation sum is\n\n\\[V(f;P)=\\sum_{i=1}^{n}|f(x_i)-f(x_{i-1})|.\\]\n\nThe total variation of \\(f\\) on the interval is\n\n\\[\\operatorname{Var}_{[a,b]}(f)=\\sup_P V(f;P),\\]\n\nwhere the supremum is taken over all finite partitions. The definition also applies to complex-valued functions by using the complex modulus, and to maps into a metric space by replacing absolute differences with distances. A function is said to have bounded variation if this supremum is finite.\n\nRefining a partition cannot decrease its variation sum, by the triangle inequality. This distinguishes total variation from the net change \\(f(b)-f(a)\\): an excursion upward followed by an equal excursion downward contributes positively even though its net change vanishes. For a monotone function,\n\n\\[\\operatorname{Var}_{[a,b]}(f)=|f(b)-f(a)|.\\]\n\nFor \\(f(x)=\\sin x\\) on \\([0,2\\pi]\\), the total variation is \\(4\\), although the endpoint values agree. For a piecewise constant function, the variation is the sum of its jump magnitudes, provided the values assigned at the jump points introduce no additional excursions.\n\nTotal variation is additive across adjacent intervals:\n\n\\[\\operatorname{Var}_{[a,b]}(f) = \\operatorname{Var}_{[a,c]}(f) + \\operatorname{Var}_{[c,b]}(f), \\qquad a<c<b.\\]\n\nIt is homogeneous and subadditive:\n\n\\[\\operatorname{Var}(\\alpha f)=|\\alpha|\\operatorname{Var}(f), \\qquad \\operatorname{Var}(f+g)\\leq \\operatorname{Var}(f)+\\operatorname{Var}(g).\\]\n\nIt is therefore a seminorm on the vector space of bounded-variation functions. Constants have zero variation, so a norm requires additional information, for example\n\n\\[\\|f\\|=|f(a)|+\\operatorname{Var}_{[a,b]}(f).\\]\n\nWith this norm, the space is complete.\n\nThe classical theory is associated with Camille Jordan, who introduced bounded variation in his 1881 work on Fourier series. The central structural result, the Jordan decomposition, states that a real-valued function has bounded variation precisely when it can be expressed as the difference of two bounded nondecreasing functions. To see the mechanism, set\n\n\\[v(x)=\\operatorname{Var}_{[a,x]}(f).\\]\n\nThe functions\n\n\\[p(x)=\\frac{v(x)+f(x)-f(a)}{2}, \\qquad n(x)=\\frac{v(x)-f(x)+f(a)}{2}\\]\n\nare nondecreasing and satisfy \\(f(x)=f(a)+p(x)-n(x)\\). Thus finite accumulated oscillation is equivalent to the possibility of separating all upward and downward change into two finite monotone components."
    },
    {
      "heading": "Differentiation, continuity, and singular change",
      "text": "For a continuously differentiable function, total variation has the familiar calculus expression\n\n\\[\\operatorname{Var}_{[a,b]}(f)=\\int_a^b |f'(x)|\\,dx.\\]\n\nThe same identity holds when \\(f\\) is absolutely continuous, with its derivative understood almost everywhere and the integral interpreted as a Lebesgue integral. Absolute continuity ensures that\n\n\\[f(x)=f(a)+\\int_a^x f'(t)\\,dt,\\]\n\nso every change in the function is accounted for by its integrable derivative. For a smooth curve \\(\\gamma:[a,b]\\to\\mathbb R^m\\), the analogous expression \\(\\int_a^b\\|\\gamma'(t)\\|\\,dt\\) gives its length, illustrating how variation generalizes accumulated path length.\n\nBounded variation is strictly weaker than absolute continuity. A one-dimensional bounded-variation function has finite one-sided limits at every interior point and is differentiable almost everywhere. Its derivative belongs to \\(L^1(a,b)\\), but generally only\n\n\\[\\int_a^b |f'(x)|\\,dx \\leq \\operatorname{Var}_{[a,b]}(f)\\]\n\nholds. A step function has derivative zero almost everywhere but positive variation. More subtly, the Cantor function is continuous, nondecreasing, and has variation \\(1\\) on \\([0,1]\\), while its derivative vanishes almost everywhere. Its change is concentrated on the Cantor set, which has Lebesgue measure zero. Consequently, neither continuity nor almost-everywhere differentiability rules out change invisible to the ordinary derivative.\n\nFor an appropriately chosen representative, the generalized derivative of a bounded-variation function decomposes into three parts:\n\n\\[Df=f'\\,\\mathcal L^1+D^j f+D^c f.\\]\n\nHere \\(\\mathcal L^1\\) denotes Lebesgue measure, \\(D^j f\\) is an atomic measure carrying jumps, and \\(D^c f\\) is singular with respect to Lebesgue measure but has no atoms. At a jump point \\(x\\), the derivative measure has mass \\(f(x+)-f(x-)\\). Its variation therefore counts \\(|f(x+)-f(x-)|\\). The three mutually singular components contribute separately to the total variation measure.\n\nA distinction between pointwise and measure-theoretic definitions is essential. Changing a function at one point may alter its partition-based variation, but it does not change its equivalence class in an L^p space or its distributional derivative. For example, the function equal to \\(1\\) at a single interior point and \\(0\\) elsewhere has classical variation \\(2\\), but represents the zero element of \\(L^1\\), whose distributional variation is zero. Right-continuous representatives are commonly used in one-dimensional measure constructions. Endpoint values must likewise be specified when comparing variation on a closed interval with the mass of a derivative measure defined only on its interior."
    },
    {
      "heading": "Variation of signed, complex, and vector measures",
      "text": "The measure-theoretic definition extends the same principle of preventing cancellation. Let \\(\\mu\\) be a finite signed or complex measure on a measurable space \\((X,\\mathcal F)\\). Its total variation measure is\n\n\\[|\\mu|(A) = \\sup_{\\{A_i\\}} \\sum_i|\\mu(A_i)|,\\]\n\nwhere the supremum is over all finite measurable partitions of \\(A\\). Although \\(\\mu\\) may take negative or complex values, \\(|\\mu|\\) is a positive measure. The quantity\n\n\\[\\|\\mu\\|_{\\mathrm{TV}}=|\\mu|(X)\\]\n\nis a norm on the space of finite signed or complex measures. The resulting space is a Banach space.\n\nFor a signed measure, the measure version of Jordan decomposition gives\n\n\\[\\mu=\\mu^+-\\mu^-, \\qquad |\\mu|=\\mu^++\\mu^-,\\]\n\nwhere \\(\\mu^+\\) and \\(\\mu^-\\) are positive measures concentrated on disjoint measurable regions. For example,\n\n\\[\\mu=3\\delta_x-2\\delta_y,\\qquad x\\ne y,\\]\n\nhas total mass \\(\\mu(X)=1\\), but variation norm \\(5\\). Here \\(\\delta_x\\) is the Dirac measure at \\(x\\). The distinction between signed mass and variation mass is exactly the distinction between net displacement and accumulated change for functions.\n\nIf \\(\\mu\\) has density \\(h\\) with respect to a positive measure \\(\\lambda\\), then\n\n\\[d\\mu=h\\,d\\lambda \\quad\\Longrightarrow\\quad d|\\mu|=|h|\\,d\\lambda.\\]\n\nMore generally, the Radon–Nikodym theorem yields the polar representation\n\n\\[d\\mu=\\sigma\\,d|\\mu|, \\qquad |\\sigma|=1\\quad |\\mu|\\text{-almost everywhere}.\\]\n\nFor real signed measures, \\(\\sigma\\) takes values \\(1\\) and \\(-1\\); for complex measures it records phase. Integration against \\(\\mu\\) satisfies\n\n\\[\\left|\\int_X g\\,d\\mu\\right| \\leq \\int_X |g|\\,d|\\mu|,\\]\n\nand the associated dual characterization is\n\n\\[\\|\\mu\\|_{\\mathrm{TV}} = \\sup_{\\substack{g\\ \\mathrm{measurable}\\\\|g|\\leq1}} \\left|\\int_X g\\,d\\mu\\right|.\\]\n\nThese formulas explain why variation is the natural measure for controlling integration against signed data.\n\nThe connection to functions is supplied by Lebesgue–Stieltjes measures. A right-continuous bounded-variation function determines a signed measure through increments\n\n\\[\\mu((s,t])=f(t)-f(s).\\]\n\nWith compatible endpoint conventions, the mass of its variation measure agrees with the corresponding function variation. The construction extends to finite-dimensional vector measures by replacing absolute value with a chosen vector norm. Their variation is again a positive measure, and their polar decomposition writes the measure as a unit-vector-valued density times its variation. This vector-valued case is the foundation of total variation for gradients in several dimensions."
    },
    {
      "heading": "Functions of bounded variation in several dimensions",
      "text": "There is no single ordered family of partitions in \\(\\mathbb R^d\\) analogous to subdivisions of an interval. The standard multidimensional definition instead uses distributional derivatives. For an open set \\(\\Omega\\subset\\mathbb R^d\\) and \\(u\\in L^1(\\Omega)\\), define\n\n\\[|Du|(\\Omega) = \\sup\\left\\{ \\int_\\Omega u\\,\\operatorname{div}\\varphi\\,dx: \\varphi\\in C_c^1(\\Omega;\\mathbb R^d),\\ |\\varphi(x)|_2\\leq1 \\right\\}.\\]\n\nThe space BV(\\Omega) consists of the functions for which this quantity is finite. The compact support of the test vector fields means that this definition measures variation inside \\(\\Omega\\), without automatically adding a boundary contribution.\n\nThe distributional gradient \\(Du\\) of a \\(BV\\) function is a finite vector-valued Radon measure, and \\(|Du|\\) is its total variation measure. If \\(u\\) is smooth, integration by parts gives\n\n\\[|Du|(\\Omega)=\\int_\\Omega|\\nabla u(x)|_2\\,dx,\\]\n\nwhere \\(\\nabla u\\) is the ordinary gradient. The same identity holds for \\(u\\) in the Sobolev space \\(W^{1,1}(\\Omega)\\). Thus \\(W^{1,1}(\\Omega)\\subset BV(\\Omega)\\), but the inclusion is generally strict: a characteristic function separated by a smooth interface has a measure-valued gradient concentrated on that interface, not an integrable gradient density.\n\nFor scalar-valued \\(BV\\) functions, the derivative measure has a decomposition analogous to the one-dimensional case:\n\n\\[Du=\\nabla u\\,\\mathcal L^d+D^j u+D^c u.\\]\n\nThe jump component has the representation\n\n\\[D^j u = (u^+-u^-)\\nu_u\\, \\mathcal H^{d-1}\\!\\mathbin{\\vrule height 1.4ex depth -0.3ex width 0.07ex\\vrule height 0.07ex depth -0.02ex width 0.7ex}J_u,\\]\n\nwhere \\(J_u\\) is the approximate jump set, \\(u^\\pm\\) are the approximate values on its two sides, \\(\\nu_u\\) is a unit normal, and \\(\\mathcal H^{d-1}\\) is Hausdorff measure. In particular,\n\n\\[|D^j u|(\\Omega) = \\int_{J_u}|u^+-u^-|\\,d\\mathcal H^{d-1}.\\]\n\nThis formula makes the geometric meaning explicit: a jump costs its amplitude multiplied by the area of the interface carrying it.\n\nThe standard norm is\n\n\\[\\|u\\|_{BV(\\Omega)} = \\|u\\|_{L^1(\\Omega)}+|Du|(\\Omega).\\]\n\nThe first term controls the level of the function, while the second controls spatial change. The use of the Euclidean norm in the definition is a substantive choice: it gives isotropic variation, invariant under rotations. Replacing it with another norm produces an anisotropic variation whose cost depends on interface orientation. This distinction matters both in geometric variational problems and in numerical approximations, where coordinate-aligned differences can introduce a preferred set of directions."
    },
    {
      "heading": "Perimeter, level sets, and compactness",
      "text": "Total variation supplies a measure-theoretic definition of perimeter. For a measurable set \\(E\\subset\\mathbb R^d\\), let \\(\\mathbf1_E\\) be its indicator function. Its perimeter relative to an open set \\(\\Omega\\) is\n\n\\[P(E;\\Omega)=|D\\mathbf1_E|(\\Omega).\\]\n\nA set with finite perimeter is also called a Caccioppoli set. If \\(E\\) has a smooth boundary, this definition agrees with the \\((d-1)\\)-dimensional area of \\(\\partial E\\cap\\Omega\\). Unlike a definition based directly on the topological boundary, it is unchanged by alterations on sets of Lebesgue measure zero. It therefore avoids assigning artificial perimeter to negligible modifications of a set.\n\nFor general finite-perimeter sets, the relevant boundary is the reduced boundary, where a measure-theoretic unit normal exists. Perimeter is the Hausdorff measure of this boundary:\n\n\\[P(E;\\Omega)= \\mathcal H^{d-1}(\\partial^*E\\cap\\Omega).\\]\n\nThe reduced boundary is rectifiable, meaning that, up to a negligible set, it can be covered by countably many suitably regular hypersurface pieces. These results place perimeter within geometric measure theory, whose modern development owes much to the work of Renato Caccioppoli and Ennio De Giorgi.\n\nThe coarea formula links an arbitrary scalar \\(BV\\) function to its level sets:\n\n\\[|Du|(\\Omega) = \\int_{-\\infty}^{\\infty} P(\\{u>t\\};\\Omega)\\,dt.\\]\n\nIt states that total variation is the accumulated perimeter of all superlevel sets. For an image intensity function, the formula interprets variation as the aggregate length of intensity contours. It also implies that almost every superlevel set of a \\(BV\\) function has finite perimeter. For a jump from \\(0\\) to a height \\(h>0\\) across an interface of area \\(A\\), the same interface occurs for every threshold \\(0<t<h\\), producing variation \\(hA\\).\n\nTwo analytic properties make this geometric framework useful in the calculus of variations. First, total variation is lower semicontinuous under \\(L^1\\) convergence:\n\n\\[u_n\\to u\\text{ in }L^1(\\Omega) \\quad\\Longrightarrow\\quad |Du|(\\Omega)\\leq\\liminf_{n\\to\\infty}|Du_n|(\\Omega).\\]\n\nSecond, on a bounded Lipschitz domain, a sequence bounded in the \\(BV\\) norm has a subsequence converging in \\(L^1\\). Together these properties support existence proofs by taking limits of minimizing sequences. They do not imply convergence of the variation values themselves. A stronger notion, called strict convergence in \\(BV\\), requires both \\(L^1\\) convergence and convergence of total variation. This distinction matters when approximating sharp interfaces by smooth transition layers or passing geometric quantities to limits."
    },
    {
      "heading": "Total variation distance between probability distributions",
      "text": "For probability measures \\(P\\) and \\(Q\\) on the same measurable space, total variation distance is conventionally defined by\n\n\\[d_{\\mathrm{TV}}(P,Q)=\\sup_{A}|P(A)-Q(A)|.\\]\n\nIt lies between \\(0\\) and \\(1\\), and it measures the largest possible disagreement about the probability of a single event. In terms of the variation measure of their signed difference,\n\n\\[d_{\\mathrm{TV}}(P,Q)=\\frac12|P-Q|(X).\\]\n\nThe factor \\(1/2\\) arises because \\(P-Q\\) has total mass zero: its positive and negative parts have equal mass. Some texts instead call \\(|P-Q|(X)\\) the total variation distance, so formulas involving constants depend on the convention.\n\nIf \\(P\\) and \\(Q\\) have densities \\(p\\) and \\(q\\) with respect to a common measure \\(\\lambda\\), then\n\n\\[d_{\\mathrm{TV}}(P,Q) = \\frac12\\int_X|p-q|\\,d\\lambda = 1-\\int_X\\min(p,q)\\,d\\lambda.\\]\n\nFor discrete distributions, the integral becomes a sum. The event \\(A=\\{p\\geq q\\}\\) attains the supremum, up to irrelevant choices on equality sets. In particular, for Bernoulli distributions with success probabilities \\(p\\) and \\(q\\),\n\n\\[d_{\\mathrm{TV}}(\\operatorname{Bern}(p),\\operatorname{Bern}(q)) =|p-q|.\\]\n\nThe density formula is always available abstractly by choosing \\(\\lambda=P+Q\\); a Lebesgue probability density is not required.\n\nAn equivalent characterization uses bounded observables:\n\n\\[d_{\\mathrm{TV}}(P,Q) = \\frac12\\sup_{|f|\\leq1} \\left|\\mathbb E_Pf-\\mathbb E_Qf\\right| = \\sup_{0\\leq f\\leq1} \\left|\\mathbb E_Pf-\\mathbb E_Qf\\right|.\\]\n\nThus total variation simultaneously controls every bounded measurable measurement. If \\(f\\) takes values in \\([m,M]\\), then\n\n\\[|\\mathbb E_Pf-\\mathbb E_Qf| \\leq (M-m)d_{\\mathrm{TV}}(P,Q).\\]\n\nIt does not similarly control arbitrary unbounded observables: a very small probability discrepancy placed at sufficiently large values can have a large effect on an expectation or variance.\n\nTotal variation convergence is stronger than weak convergence. For instance, \\(\\delta_{1/n}\\) converges weakly to \\(\\delta_0\\), but its total variation distance from \\(\\delta_0\\) is \\(1\\) for every \\(n\\). Likewise, an empirical distribution with finite support is at distance \\(1\\) from any nonatomic distribution, regardless of sample size. Even uniform convergence of cumulative distribution functions need not imply total variation convergence. This strength reflects the fact that the supremum ranges over all measurable events, including sets that distinguish extremely fine differences of support."
    },
    {
      "heading": "Testing, coupling, and convergence of Markov chains",
      "text": "Total variation has an exact interpretation in statistical hypothesis testing. Suppose a single observation is drawn from \\(P\\) or \\(Q\\), with equal prior probabilities. A nonrandomized test chooses \\(P\\) on an event \\(A\\) and \\(Q\\) otherwise. Its average probability of error is\n\n\\[\\frac12P(A^c)+\\frac12Q(A) = \\frac12\\bigl(1-P(A)+Q(A)\\bigr).\\]\n\nOptimizing over \\(A\\) yields\n\n\\[\\inf_{\\text{tests}}\\Pr(\\text{error}) = \\frac{1-d_{\\mathrm{TV}}(P,Q)}{2}.\\]\n\nConsequently, distance zero means that no test improves on a random guess, whereas distance one means that perfect discrimination is possible. Allowing randomized tests does not improve this optimum.\n\nA second interpretation uses coupling. A coupling of \\(P\\) and \\(Q\\) is a pair of random variables \\((X,Y)\\) defined jointly with marginal laws \\(P\\) and \\(Q\\). Every coupling satisfies\n\n\\[d_{\\mathrm{TV}}(P,Q)\\leq\\Pr(X\\ne Y),\\]\n\nbecause the indicators of an event can disagree only when the variables differ. On standard Borel spaces, a maximal coupling achieves equality:\n\n\\[d_{\\mathrm{TV}}(P,Q) = \\inf_{\\text{couplings}}\\Pr(X\\ne Y).\\]\n\nThe construction matches the common density \\(\\min(p,q)\\) with probability \\(1-d_{\\mathrm{TV}}(P,Q)\\), then assigns the unmatched mass separately. This interpretation is especially useful when distributions can be generated by related random mechanisms.\n\nFor a Markov chain with transition kernel \\(K\\), applying the same transition cannot increase distance:\n\n\\[d_{\\mathrm{TV}}(PK,QK)\\leq d_{\\mathrm{TV}}(P,Q).\\]\n\nIndeed, for any event \\(A\\), the function \\(x\\mapsto K(x,A)\\) takes values in \\([0,1]\\), so the bounded-observable characterization applies. If \\(\\pi\\) is a stationary distribution, convergence to equilibrium is often quantified through \\(d_{\\mathrm{TV}}(K^n(x,\\cdot),\\pi)\\). For finite irreducible aperiodic chains, this tends to zero. Coupling proofs construct two chains, one started at \\(x\\) and one in equilibrium, and bound their disagreement by the probability that they have not yet met and remained together.\n\nTotal variation also connects to information theory through inequalities between divergences. Pinsker’s inequality, using natural logarithms, is\n\n\\[d_{\\mathrm{TV}}(P,Q) \\leq \\sqrt{\\frac12D_{\\mathrm{KL}}(P\\|Q)},\\]\n\nwhere \\(D_{\\mathrm{KL}}\\) is Kullback–Leibler divergence. Small relative entropy therefore implies small total variation. There is no unconditional reverse bound: relative entropy can be infinite even when total variation is small, for example when \\(P\\) gives positive mass to a set to which \\(Q\\) assigns zero mass. Total variation is symmetric and always finite for probability distributions; relative entropy is asymmetric and measures a different aspect of discrepancy."
    },
    {
      "heading": "Regularization, imaging, and numerical optimization",
      "text": "Total variation became a central tool in image restoration through the 1992 model of Leonid Rudin, Stanley Osher, and Emad Fatemi. In a common normalization, their denoising problem is\n\n\\[\\min_{u\\in BV(\\Omega)\\cap L^2(\\Omega)} \\left\\{ \\frac12\\int_\\Omega(u-f)^2\\,dx +\\lambda |Du|(\\Omega) \\right\\}, \\qquad \\lambda>0,\\]\n\nwhere \\(f\\) is the observed image. The first term penalizes disagreement with the data, while the second performs regularization by discouraging unnecessary spatial change. On suitable bounded domains, lower semicontinuity and compactness give existence, while strict convexity of the quadratic fidelity term gives uniqueness up to almost-everywhere equality.\n\nThe edge-preserving mechanism differs from that of quadratic gradient penalties. Suppose a transition of height \\(h\\) is spread over a layer of width \\(\\varepsilon\\). Per unit interface area, its total variation is approximately\n\n\\[\\int_0^\\varepsilon \\frac{|h|}{\\varepsilon}\\,dx=|h|,\\]\n\nindependent of the layer width. By contrast,\n\n\\[\\int_0^\\varepsilon \\left(\\frac{h}{\\varepsilon}\\right)^2dx =\\frac{h^2}{\\varepsilon}\\]\n\ndiverges as the transition becomes sharp. Total variation can therefore retain discontinuities at finite cost. It does not preserve every feature without bias: small structures may disappear, contrast may decrease, and smooth ramps can become piecewise constant, an artifact known as staircasing.\n\nFor a discrete image \\(u=(u_{i,j})\\), two common penalties are\n\n\\[\\operatorname{TV}_{\\mathrm{aniso}}(u) = \\sum_{i,j} \\bigl(|D_xu_{i,j}|+|D_yu_{i,j}|\\bigr)\\]\n\nand\n\n\\[\\operatorname{TV}_{\\mathrm{iso}}(u) = \\sum_{i,j} \\sqrt{(D_xu_{i,j})^2+(D_yu_{i,j})^2},\\]\n\nwhere \\(D_x,D_y\\) are chosen finite differences. The first is separable in the coordinate differences and has a pronounced directional preference. The second groups horizontal and vertical components by their Euclidean norm, although a finite grid still introduces discretization effects. Boundary rules, grid spacing, and quadrature weights are part of the mathematical model rather than incidental implementation details.\n\nThe resulting problems are convex but nonsmooth, so ordinary differentiation at zero gradients is unavailable. Their dual formulation follows from\n\n\\[|z|_2=\\sup_{|p|_2\\leq1}p\\cdot z.\\]\n\nFor a discrete gradient operator \\(D\\), the quadratic denoising model becomes\n\n\\[\\min_u\\max_{|p_{i,j}|_2\\leq\\lambda} \\left\\{ \\frac12\\|u-f\\|_2^2+\\langle Du,p\\rangle \\right\\}.\\]\n\nPrimal–dual methods alternate an update of \\(u\\) with an update of \\(p\\), followed by projection onto Euclidean balls. Other approaches use operator splitting, augmented Lagrangians, or smoothed penalties such as \\(\\sqrt{|Du|^2+\\varepsilon^2}\\). The last choice changes the original nonsmooth objective and introduces an approximation parameter.\n\nIn one dimension, the discrete analogue\n\n\\[\\min_{u_1,\\ldots,u_n} \\left\\{ \\frac12\\sum_{i=1}^n(u_i-y_i)^2 +\\lambda\\sum_{i=1}^{n-1}|u_{i+1}-u_i| \\right\\}\\]\n\nis total variation denoising, closely related to the fused lasso. It promotes sparsity of successive differences rather than sparsity of the fitted values themselves. This makes it useful for estimating piecewise constant signals and locating changes in time series. On a weighted graph, the corresponding penalty is \\(\\sum_{(i,j)}w_{ij}|u_i-u_j|\\), extending the same principle to data without a regular spatial grid."
    },
    {
      "heading": "Conservation laws and variation-diminishing evolution",
      "text": "Total variation plays a distinct role in the analysis of conservation laws. A scalar conservation equation in one space dimension has the form\n\n\\[u_t+\\partial_xF(u)=0.\\]\n\nEven smooth initial data can develop discontinuities because different values of \\(u\\) propagate at different characteristic speeds. For the inviscid Burgers equation, \\(F(u)=u^2/2\\), the characteristic speed is \\(u\\); faster portions of a profile can catch slower portions and form shocks. Classical derivatives then cease to suffice, and solutions must be interpreted in a weak sense, supplemented by an entropy condition that selects physically admissible shocks.\n\nFor scalar entropy solutions on the whole line, suitable integrability and finite-variation assumptions yield\n\n\\[\\operatorname{Var}(u(\\cdot,t)) \\leq \\operatorname{Var}(u(\\cdot,0)).\\]\n\nThe principle is connected to \\(L^1\\) contraction and translation invariance. Applying contraction to a solution and a spatial translate controls\n\n\\[\\|u(\\cdot+h,t)-u(\\cdot,t)\\|_{L^1}\\]\n\nby the corresponding initial difference. Dividing by \\(|h|\\) and passing to the small-translation limit gives the variation estimate. This control prevents uncontrolled growth of spatial oscillations and provides compactness for approximation sequences. Analogous statements for systems of conservation laws require substantially more structure and cannot be inferred directly from the scalar theory.\n\nNumerical finite-difference schemes often seek a related property called total variation diminishing, or TVD:\n\n\\[\\sum_j|u_{j+1}^{n+1}-u_j^{n+1}| \\leq \\sum_j|u_{j+1}^{n}-u_j^{n}|.\\]\n\nUnder an appropriate relation between time step and mesh size, many monotone first-order schemes satisfy such an estimate. Higher-order methods use nonlinear limiters to reduce oscillations near shocks while retaining greater accuracy in smooth regions. The TVD requirement addresses a specific failure of unrestricted high-order reconstructions: the creation of spurious overshoots and undershoots around discontinuities. It does not by itself establish consistency, select an entropy solution, or guarantee high-order accuracy everywhere.\n\nTotal variation also generates its own smoothing evolution. Formally, the \\(L^2\\) gradient flow of \\(\\int|\\nabla u|\\,dx\\) is\n\n\\[u_t= \\operatorname{div}\\left(\\frac{\\nabla u}{|\\nabla u|}\\right).\\]\n\nThe expression is undefined at zero gradients, so rigorous formulations use the subdifferential of the convex total variation functional rather than treating the equation as an ordinary smooth differential operator. This contrasts with the heat equation, the gradient flow of a quadratic gradient energy. Total variation flow can form flat regions and evolve sharp interfaces. Under the coarea interpretation, its behavior is tied to the geometry of level sets, bringing together the analytic, geometric, and computational meanings of accumulated variation."
    }
  ],
  "links": [
    "probability",
    "mathematical-analysis",
    "partial-differential-equation",
    "metric-space",
    "triangle-inequality",
    "monotonic-function",
    "vector-space",
    "fourier-series",
    "absolute-continuity",
    "derivative",
    "almost-everywhere",
    "lebesgue-integral",
    "cantor-function",
    "cantor-set",
    "lebesgue-measure",
    "lp-space",
    "norm-mathematics",
    "banach-space",
    "radon-nikodym-theorem",
    "vector-field",
    "integration-by-parts",
    "gradient",
    "sobolev-space",
    "indicator-function",
    "calculus-of-variations",
    "bernoulli-distribution",
    "probability-density-function",
    "expected-value",
    "variance",
    "cumulative-distribution-function",
    "statistical-hypothesis-testing",
    "markov-chain",
    "stationary-distribution",
    "information-theory",
    "kullback-leibler-divergence",
    "regularization",
    "time-series",
    "conservation-law",
    "weak-solution",
    "finite-difference-method",
    "heat-equation"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}