1989
DOI: 10.1017/s0013091500004624
|View full text |Cite
|
Sign up to set email alerts
|

On the “zero-two” law for positive contractions

Abstract: Let (X, Σ,μ) be a measure space (where μ is a positive σ-additive measure) and let Lp(X,Σ,μ), 1≦p≦ + ∞ be the usual real Banach lattices.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 4 publications
(8 reference statements)
0
5
0
Order By: Relevance
“…Using certain properties of L 1 -spaces Zaharopol [10] by means of the following theorem reproved Theorem 1.1. Theorem 1.2.…”
Section: Introductionmentioning
confidence: 99%
“…Using certain properties of L 1 -spaces Zaharopol [10] by means of the following theorem reproved Theorem 1.1. Theorem 1.2.…”
Section: Introductionmentioning
confidence: 99%
“…(ii) Unfortunately, Theorem 3.3 is not longer true if one replaces L 1space by an L p -space, 1 < p < ∞. The corresponding example was provided in [17]. (iii) It would be better to note that certain ergodic properties of dominant positive operators has been studied in [8] in a noncommutative setting.…”
Section: Resultsmentioning
confidence: 99%
“…A linear operator T : L 1 (X, F , µ) → L 1 (X, F , µ) is called positive contraction if T f ≥ 0 whenever f ≥ 0 and T ≤ 1. In [17] the following theorem was proved.…”
Section: Introductionmentioning
confidence: 99%
“…Interchanging "sup" and "lim" in the strong zero-two law we have the following uniform zero-two law, proved by Foguel [12] using ideas of [38] and [11]. Zahoropol [44] has provided another proof of Theorem 1.2 which is given in the following theorem. Theorem 1.3.…”
Section: Introductionmentioning
confidence: 95%
“…Theorem 1.4. [44] Let T, S : L 1 → L 1 be two positive contractions such that T ≤ S. If S − T < 1 then S n − T n < 1 for all n ∈ N.…”
Section: Introductionmentioning
confidence: 99%