Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Total variation

From Wikipedia, the free encyclopedia
Measure of local oscillation behavior
Not to be confused withTotal variation distance of probability measures.
This articlerelies excessively onreferences toprimary sources. Please improve this article by addingsecondary or tertiary sources.
Find sources: "Total variation" – news ·newspapers ·books ·scholar ·JSTOR
(February 2012) (Learn how and when to remove this message)

Inmathematics, thetotal variation identifies several slightly different concepts, related to the (local or global) structure of thecodomain of afunction or ameasure. For areal-valuedcontinuous functionf, defined on aninterval [a,b] ⊂R, its total variation on the interval of definition is a measure of the one-dimensionalarclength of the curve with parametric equationxf(x), forx ∈ [a,b]. Functions whose total variation is finite are calledfunctions of bounded variation.

Historical note

[edit]

The concept of total variation for functions of one real variable was first introduced byCamille Jordan in the paper (Jordan 1881).[1] He used the new concept in order to prove a convergence theorem forFourier series ofdiscontinuousperiodic functions whose variation isbounded. The extension of the concept to functions of more than one variable however is not simple for various reasons.

Definitions

[edit]

Total variation for functions of one real variable

[edit]

Definition 1.1. Thetotal variation of areal-valued (or more generallycomplex-valued)functionf{\displaystyle f}, defined on aninterval[a,b]R{\displaystyle [a,b]\subset \mathbb {R} } is the quantity

Vab(f)=supPi=0nP1|f(xi+1)f(xi)|,{\displaystyle V_{a}^{b}(f)=\sup _{\mathcal {P}}\sum _{i=0}^{n_{P}-1}|f(x_{i+1})-f(x_{i})|,}

where thesupremum runs over theset of allpartitionsP={P={x0,,xnP}P is a partition of [a,b]}{\displaystyle {\mathcal {P}}=\left\{P=\{x_{0},\dots ,x_{n_{P}}\}\mid P{\text{ is a partition of }}[a,b]\right\}} of the giveninterval. Which means thata=x0<x1<...<xnP=b{\displaystyle a=x_{0}<x_{1}<...<x_{n_{P}}=b}.

Total variation for functions ofn > 1 real variables

[edit]

Definition 1.2.[2] LetΩ be anopen subset ofRn. Given a functionf belonging toL1(Ω), thetotal variation off inΩ is defined as

V(f,Ω):=sup{Ωf(x)divϕ(x)dx:ϕCc1(Ω,Rn), ϕL(Ω)1},{\displaystyle V(f,\Omega ):=\sup \left\{\int _{\Omega }f(x)\operatorname {div} \phi (x)\,\mathrm {d} x\colon \phi \in C_{c}^{1}(\Omega ,\mathbb {R} ^{n}),\ \Vert \phi \Vert _{L^{\infty }(\Omega )}\leq 1\right\},}

where

This definitiondoes not require that thedomainΩRn{\displaystyle \Omega \subseteq \mathbb {R} ^{n}} of the given function be abounded set.

Total variation in measure theory

[edit]

Classical total variation definition

[edit]

FollowingSaks (1937, p. 10), consider asigned measureμ{\displaystyle \mu } on ameasurable space(X,Σ){\displaystyle (X,\Sigma )}: then it is possible to define twoset functionsW¯(μ,){\displaystyle {\overline {\mathrm {W} }}(\mu ,\cdot )} andW_(μ,){\displaystyle {\underline {\mathrm {W} }}(\mu ,\cdot )}, respectively calledupper variation andlower variation, as follows

W¯(μ,E)=sup{μ(A)AΣ and AE}EΣ{\displaystyle {\overline {\mathrm {W} }}(\mu ,E)=\sup \left\{\mu (A)\mid A\in \Sigma {\text{ and }}A\subset E\right\}\qquad \forall E\in \Sigma }
W_(μ,E)=inf{μ(A)AΣ and AE}EΣ{\displaystyle {\underline {\mathrm {W} }}(\mu ,E)=\inf \left\{\mu (A)\mid A\in \Sigma {\text{ and }}A\subset E\right\}\qquad \forall E\in \Sigma }

clearly

W¯(μ,E)0W_(μ,E)EΣ{\displaystyle {\overline {\mathrm {W} }}(\mu ,E)\geq 0\geq {\underline {\mathrm {W} }}(\mu ,E)\qquad \forall E\in \Sigma }

Definition 1.3. Thevariation (also calledabsolute variation) of the signed measureμ{\displaystyle \mu } is the set function

|μ|(E)=W¯(μ,E)+|W_(μ,E)|EΣ{\displaystyle |\mu |(E)={\overline {\mathrm {W} }}(\mu ,E)+\left|{\underline {\mathrm {W} }}(\mu ,E)\right|\qquad \forall E\in \Sigma }

and itstotal variation is defined as the value of this measure on the whole space of definition, i.e.

μ=|μ|(X){\displaystyle \|\mu \|=|\mu |(X)}

Modern definition of total variation norm

[edit]

Saks (1937, p. 11) uses upper and lower variations to prove theHahn–Jordan decomposition: according to his version of this theorem, the upper and lower variation are respectively anon-negative and anon-positivemeasure. Using a more modern notation, define

μ+()=W¯(μ,),{\displaystyle \mu ^{+}(\cdot )={\overline {\mathrm {W} }}(\mu ,\cdot )\,,}
μ()=W_(μ,),{\displaystyle \mu ^{-}(\cdot )=-{\underline {\mathrm {W} }}(\mu ,\cdot )\,,}

Thenμ+{\displaystyle \mu ^{+}} andμ{\displaystyle \mu ^{-}} are two non-negativemeasures such that

μ=μ+μ{\displaystyle \mu =\mu ^{+}-\mu ^{-}}
|μ|=μ++μ{\displaystyle |\mu |=\mu ^{+}+\mu ^{-}}

The last measure is sometimes called, byabuse of notation,total variation measure.

Total variation norm of complex measures

[edit]

If the measureμ{\displaystyle \mu } iscomplex-valued i.e. is acomplex measure, its upper and lower variation cannot be defined and the Hahn–Jordan decomposition theorem can only be applied to its real and imaginary parts. However, it is possible to followRudin (1966, pp. 137–139) and define the total variation of the complex-valued measureμ{\displaystyle \mu } as follows

Definition 1.4. Thevariation of the complex-valued measureμ{\displaystyle \mu } is theset function

|μ|(E)=supπAπ|μ(A)|EΣ{\displaystyle |\mu |(E)=\sup _{\pi }\sum _{A\in \pi }|\mu (A)|\qquad \forall E\in \Sigma }

where thesupremum is taken over all partitionsπ{\displaystyle \pi } of ameasurable setE{\displaystyle E} into a countable number of disjoint measurable subsets.

This definition coincides with the above definition|μ|=μ++μ{\displaystyle |\mu |=\mu ^{+}+\mu ^{-}} for the case of real-valued signed measures.

Total variation norm of vector-valued measures

[edit]

The variation so defined is apositive measure (seeRudin (1966, p. 139)) and coincides with the one defined by1.3 whenμ{\displaystyle \mu } is asigned measure: its total variation is defined as above. This definition works also ifμ{\displaystyle \mu } is avector measure: the variation is then defined by the following formula

|μ|(E)=supπAπμ(A)EΣ{\displaystyle |\mu |(E)=\sup _{\pi }\sum _{A\in \pi }\|\mu (A)\|\qquad \forall E\in \Sigma }

where the supremum is as above. This definition is slightly more general than the one given byRudin (1966, p. 138) since it requires only to considerfinite partitions of the spaceX{\displaystyle X}: this implies that it can be used also to define the total variation onfinite-additive measures.

Total variation of probability measures

[edit]
icon
This sectiondoes notcite anysources. Please helpimprove this section byadding citations to reliable sources. Unsourced material may be challenged andremoved.(May 2012) (Learn how and when to remove this message)
Main article:Total variation distance of probability measures

The total variation of anyprobability measure is exactly one, therefore it is not interesting as a means of investigating the properties of such measures. However, when μ and ν areprobability measures, thetotal variation distance of probability measures can be defined asμν{\displaystyle \|\mu -\nu \|} where the norm is the total variation norm of signed measures. Using the property that(μν)(X)=0{\displaystyle (\mu -\nu )(X)=0}, we eventually arrive at the equivalent definition

μν=|μν|(X)=2sup{|μ(A)ν(A)|:AΣ}{\displaystyle \|\mu -\nu \|=|\mu -\nu |(X)=2\sup \left\{\,\left|\mu (A)-\nu (A)\right|:A\in \Sigma \,\right\}}[3]

and its values are non-trivial. The factor2{\displaystyle 2} above is usually dropped (as is the convention in the articletotal variation distance of probability measures). Informally, this is the largest possible difference between the probabilities that the twoprobability distributions can assign to the same event. For acategorical distribution it is possible to write the total variation distance as follows

δ(μ,ν)=x|μ(x)ν(x)|.{\displaystyle \delta (\mu ,\nu )=\sum _{x}\left|\mu (x)-\nu (x)\right|\;.}[4]

It may also be normalized to values in[0,1]{\displaystyle [0,1]} by halving the previous definition as follows

δ(μ,ν)=12x|μ(x)ν(x)|{\displaystyle \delta (\mu ,\nu )={\frac {1}{2}}\sum _{x}\left|\mu (x)-\nu (x)\right|}[5]

Basic properties

[edit]

Total variation of differentiable functions

[edit]

The total variation of aC1(Ω¯){\displaystyle C^{1}({\overline {\Omega }})} functionf{\displaystyle f} can be expressed as anintegral involving the given function instead of as thesupremum of thefunctionals of definitions1.1 and1.2.

The form of the total variation of a differentiable function of one variable

[edit]

Theorem 1. Thetotal variation of adifferentiable functionf{\displaystyle f}, defined on aninterval[a,b]R{\displaystyle [a,b]\subset \mathbb {R} }, has the following expression iff{\displaystyle f'} is Riemann integrable

Vab(f)=ab|f(x)|dx{\displaystyle V_{a}^{b}(f)=\int _{a}^{b}|f'(x)|\mathrm {d} x}

Iff{\displaystyle f} is differentiable andmonotonic, then the above simplifies to

Vab(f)=|f(a)f(b)|{\displaystyle V_{a}^{b}(f)=|f(a)-f(b)|}

For any differentiable functionf{\displaystyle f}, we can decompose the domain interval[a,b]{\displaystyle [a,b]}, into subintervals[a,a1],[a1,a2],,[aN,b]{\displaystyle [a,a_{1}],[a_{1},a_{2}],\dots ,[a_{N},b]} (witha<a1<a2<<aN<b{\displaystyle a<a_{1}<a_{2}<\cdots <a_{N}<b}) in whichf{\displaystyle f} is locally monotonic, then the total variation off{\displaystyle f} over[a,b]{\displaystyle [a,b]} can be written as the sum of local variations on those subintervals:

Vab(f)=Vaa1(f)+Va1a2(f)++VaNb(f)=|f(a)f(a1)|+|f(a1)f(a2)|++|f(aN)f(b)|{\displaystyle {\begin{aligned}V_{a}^{b}(f)&=V_{a}^{a_{1}}(f)+V_{a_{1}}^{a_{2}}(f)+\,\cdots \,+V_{a_{N}}^{b}(f)\\[0.3em]&=|f(a)-f(a_{1})|+|f(a_{1})-f(a_{2})|+\,\cdots \,+|f(a_{N})-f(b)|\end{aligned}}}

The form of the total variation of a differentiable function of several variables

[edit]

Theorem 2. Given aC1(Ω¯){\displaystyle C^{1}({\overline {\Omega }})} functionf{\displaystyle f} defined on aboundedopen setΩRn{\displaystyle \Omega \subseteq \mathbb {R} ^{n}}, withΩ{\displaystyle \partial \Omega } of classC1{\displaystyle C^{1}}, thetotal variation off{\displaystyle f} has the following expression

V(f,Ω)=Ω|f(x)|dx{\displaystyle V(f,\Omega )=\int _{\Omega }\left|\nabla f(x)\right|\mathrm {d} x} .
Proof
[edit]

The first step in the proof is to first prove an equality which follows from theGauss–Ostrogradsky theorem.

Lemma
[edit]

Under the conditions of the theorem, the following equality holds:

Ωfdivφ=Ωfφ{\displaystyle \int _{\Omega }f\operatorname {div} \varphi =-\int _{\Omega }\nabla f\cdot \varphi }
Proof of the lemma
[edit]

From theGauss–Ostrogradsky theorem:

ΩdivR=ΩRn{\displaystyle \int _{\Omega }\operatorname {div} \mathbf {R} =\int _{\partial \Omega }\mathbf {R} \cdot \mathbf {n} }

by substitutingR:=fφ{\displaystyle \mathbf {R} :=f\mathbf {\varphi } }, we have:

Ωdiv(fφ)=Ω(fφ)n{\displaystyle \int _{\Omega }\operatorname {div} \left(f\mathbf {\varphi } \right)=\int _{\partial \Omega }\left(f\mathbf {\varphi } \right)\cdot \mathbf {n} }

whereφ{\displaystyle \mathbf {\varphi } } is zero on the border ofΩ{\displaystyle \Omega } by definition:

Ωdiv(fφ)=0{\displaystyle \int _{\Omega }\operatorname {div} \left(f\mathbf {\varphi } \right)=0}
Ωxi(fφi)=0{\displaystyle \int _{\Omega }\partial _{x_{i}}\left(f\mathbf {\varphi } _{i}\right)=0}
Ωφixif+fxiφi=0{\displaystyle \int _{\Omega }\mathbf {\varphi } _{i}\partial _{x_{i}}f+f\partial _{x_{i}}\mathbf {\varphi } _{i}=0}
Ωfxiφi=Ωφixif{\displaystyle \int _{\Omega }f\partial _{x_{i}}\mathbf {\varphi } _{i}=-\int _{\Omega }\mathbf {\varphi } _{i}\partial _{x_{i}}f}
Ωfdivφ=Ωφf{\displaystyle \int _{\Omega }f\operatorname {div} \mathbf {\varphi } =-\int _{\Omega }\mathbf {\varphi } \cdot \nabla f}
Proof of the equality
[edit]

Under the conditions of the theorem, from the lemma we have:

Ωfdivφ=Ωφf|Ωφf|Ω|φ||f|Ω|f|{\displaystyle \int _{\Omega }f\operatorname {div} \mathbf {\varphi } =-\int _{\Omega }\mathbf {\varphi } \cdot \nabla f\leq \left|\int _{\Omega }\mathbf {\varphi } \cdot \nabla f\right|\leq \int _{\Omega }\left|\mathbf {\varphi } \right|\cdot \left|\nabla f\right|\leq \int _{\Omega }\left|\nabla f\right|}

in the last partφ{\displaystyle \mathbf {\varphi } } could be omitted, because by definition its essential supremum is at most one.

On the other hand, we considerθN:=I[N,N]I{f0}f|f|{\displaystyle \theta _{N}:=-\mathbb {I} _{\left[-N,N\right]}\mathbb {I} _{\{\nabla f\neq 0\}}{\frac {\nabla f}{\left|\nabla f\right|}}} andθN{\displaystyle \theta _{N}^{*}} which is the up toε{\displaystyle \varepsilon } approximation ofθN{\displaystyle \theta _{N}} inCc1{\displaystyle C_{c}^{1}} with the same integral. We can do this sinceCc1{\displaystyle C_{c}^{1}} is dense inL1{\displaystyle L^{1}}. Now again substituting into the lemma:

limNΩfdivθN=limN{f0}I[N,N]ff|f|=limN[N,N]{f0}ff|f|=Ω|f|{\displaystyle {\begin{aligned}&\lim _{N\to \infty }\int _{\Omega }f\operatorname {div} \theta _{N}^{*}\\[4pt]&=\lim _{N\to \infty }\int _{\{\nabla f\neq 0\}}\mathbb {I} _{\left[-N,N\right]}\nabla f\cdot {\frac {\nabla f}{\left|\nabla f\right|}}\\[4pt]&=\lim _{N\to \infty }\int _{\left[-N,N\right]\cap {\{\nabla f\neq 0\}}}\nabla f\cdot {\frac {\nabla f}{\left|\nabla f\right|}}\\[4pt]&=\int _{\Omega }\left|\nabla f\right|\end{aligned}}}

This means we have a convergent sequence ofΩfdivφ{\textstyle \int _{\Omega }f\operatorname {div} \mathbf {\varphi } } that tends toΩ|f|{\textstyle \int _{\Omega }\left|\nabla f\right|} as well as we know thatΩfdivφΩ|f|{\textstyle \int _{\Omega }f\operatorname {div} \mathbf {\varphi } \leq \int _{\Omega }\left|\nabla f\right|}.Q.E.D.

It can be seen from the proof that the supremum is attained when

φf|f|.{\displaystyle \varphi \to {\frac {-\nabla f}{\left|\nabla f\right|}}.}

Thefunctionf{\displaystyle f} is said to be ofbounded variation precisely if its total variation is finite.

Total variation of a measure

[edit]

The total variation is anorm defined on the space of measures of bounded variation. The space of measures on a σ-algebra of sets is aBanach space, called theca space, relative to this norm. It is contained in the larger Banach space, called theba space, consisting offinitely additive (as opposed to countably additive) measures, also with the same norm. Thedistance function associated to the norm gives rise to the total variation distance between two measuresμ andν.

For finite measures onR, the link between the total variation of a measureμ and the total variation of a function, as described above, goes as follows. Givenμ, define a functionφ:RR{\displaystyle \varphi \colon \mathbb {R} \to \mathbb {R} } by

φ(t)=μ((,t]) .{\displaystyle \varphi (t)=\mu ((-\infty ,t])~.}

Then, the total variation of the signed measureμ is equal to the total variation, in the above sense, of the functionφ{\displaystyle \varphi }. In general, the total variation of a signed measure can be defined usingJordan's decomposition theorem by

μTV=μ+(X)+μ(X) ,{\displaystyle \|\mu \|_{TV}=\mu _{+}(X)+\mu _{-}(X)~,}

for any signed measureμ on a measurable space(X,Σ){\displaystyle (X,\Sigma )}.

Applications

[edit]

Total variation can be seen as anon-negativereal-valuedfunctional defined on the space ofreal-valuedfunctions (for the case of functions of one variable) or on the space ofintegrable functions (for the case of functions of several variables). As a functional, total variation finds applications in several branches of mathematics and engineering, likeoptimal control,numerical analysis, andcalculus of variations, where the solution to a certain problem has tominimize its value. As an example, use of the total variation functional is common in the following two kind of problems

See also

[edit]

Notes

[edit]
This article includes a list ofgeneral references, butit lacks sufficient correspondinginline citations. Please help toimprove this article byintroducing more precise citations.(February 2012) (Learn how and when to remove this message)
  1. ^According toGolubov & Vitushkin (2001).
  2. ^Ambrosio, Luigi; Fusco, Nicola; Pallara, Diego (2000).Functions of Bounded Variation and Free Discontinuity Problems. Oxford University Press. p. 119.doi:10.1093/oso/9780198502456.001.0001.ISBN 9780198502456.
  3. ^Billingsley, Patrick (1995).Probability and Measure. John Wiley & Sons. pp. 242–243.
  4. ^Le Cam, Lucien; Yang, Grace Lo (2000).Asymptotics in Statistics: Some Basic Concepts. Springer. pp. 16–18.
  5. ^Gibbs, Alison; Francis Edward Su (2002)."On Choosing and Bounding Probability Metrics"(PDF). p. 7. Retrieved8 April 2017.
  6. ^https://arxiv.org/pdf/1603.09599 Retrieved 12/15/2024

Historical references

[edit]

References

[edit]

External links

[edit]

One variable

One and more variables

Measure theory

Applications

[edit]
  • Blomgren, Peter; Chan, Tony F. (1998), "Color TV: total variation methods for restoration of vector-valued images",IEEE Transactions on Image Processing,7 (3), Image Processing, IEEE Transactions on, vol. 7, no. 3: 304-309:304–309,Bibcode:1998ITIP....7..304B,doi:10.1109/83.661180,PMID 18276250.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Total_variation&oldid=1324148072"
Category:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp