Carré du champ operator

From testwiki
Jump to navigation Jump to search

Template:Short description The Template:Lang (French for square of a field operator) is a bilinear, symmetric operator from analysis and probability theory. The Template:Lang measures how far an infinitesimal generator is from being a derivation.[1]

The operator was introduced in 1969[2] by Template:Ill and independently discovered in 1976[3] by Jean-Pierre Roth in his doctoral thesis.

The name "carré du champ" comes from electrostatics.

Carré du champ operator for a Markov semigroup

Let (X,ℰ,μ) be a σ-finite measure space, {Pt}t≥0 a Markov semigroup of non-negative operators on L2(X,μ), A the infinitesimal generator of {Pt}t≥0 and 𝒜 the algebra of functions in 𝒟(A), i.e. a vector space such that for all f,g∈𝒜 also fg∈𝒜.

Carré du champ operator

The Template:Lang of a Markovian semigroup {Pt}t≥0 is the operator Γ:𝒜×𝒜→ℝ defined (following P. A. Meyer) as

Γ(f,g)=12(A(fg)−fA(g)−gA(f))

for all f,g∈𝒜.[4][5]

Properties

From the definition, it follows that[1]

Γ(f,g)=limt→012t(Pt(fg)−PtfPtg).

For f∈𝒜 we have Pt(f2)≥(Ptf)2 and thus A(f2)≥2fAf and

Γ(f):=Γ(f,f)≥0,∀f∈𝒜

therefore the Template:Lang is positive.

The domain is

𝒟(A):={f∈L2(X,μ);limt↓0Ptf−ft exists and is in L2(X,μ)}.

Remarks

  • The definition in Roth's thesis is slightly different.[3]

Bibliography

References