2014
DOI: 10.1002/mana.201300218
|View full text |Cite
|
Sign up to set email alerts
|

On the lattice structure of kernel operators

Abstract: Abstract. Consider the lattice of bounded linear operators on the space of Borel measures on a Polish space. We prove that the operators which are continuous with respect to the weak topology induced by the bounded measurable functions form a sublattice that is lattice isomorphic to the space of transition kernels. As an application we present a purely analytic proof of Doob's theorem concerning stability of transition semigroups.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
1

Relationship

4
2

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 21 publications
0
5
0
Order By: Relevance
“…It was observed only recently that this result can also be used to give an analytic proof of a famous theorem by Doob about the asymptotic behaviour of oneparameter Markov semigroups, see [22] and [21,Sec 4]. During the last two decades several new versions of the above theorem were discovered.…”
Section: Introductionmentioning
confidence: 90%
“…It was observed only recently that this result can also be used to give an analytic proof of a famous theorem by Doob about the asymptotic behaviour of oneparameter Markov semigroups, see [22] and [21,Sec 4]. During the last two decades several new versions of the above theorem were discovered.…”
Section: Introductionmentioning
confidence: 90%
“…[10, Thm VI.1.1] and [40,Thm 4.2]) while such criteria are more delicate in the infinite dimensional case, and in particular on non-discrete state spaces (see e.g. [6,Sec 4.2] and [20,Thm 4.4] for different versions and proofs of a classical theorem of Doob which addresses this issue; see also [19,Thm 3.6] for a related Tauberian theorem).…”
Section: Introductionmentioning
confidence: 99%
“…It follows from T n ≤ M for all n that k(x, E) ≤ M for all x ∈ E. Moreover, k is again a kernel, cf. [15,Lem. 3.5].…”
Section: Lemma 31 There Exists a Countable Setmentioning
confidence: 99%