Order compact and unbounded order compact operators

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compact Sets and Compact Operators

Proof. Properties 2 and 3 are left to the reader. For property 1, assume that S is an unbounded compact set. Since S is unbounded, we may select a sequence {vn}n=1 such that ‖vn‖ → 0 as n→∞. Since S is compact, this sequence will have a convergent subsequence, say {vk}k=1, which will still be unbounded. This sequence is Cauchy, so there is a positive integer K for which ‖v`− vm‖ ≤ 1/2 for all `...

متن کامل

Compact weighted Frobenius-Perron operators and their spectra

In this note we characterize the compact weighted Frobenius-Perron operator $p$ on $L^1(Sigma)$ and determine their spectra. We also show that every weakly compact weighted Frobenius-Perron operator on $L^1(Sigma)$ is compact.

متن کامل

Compact Operators

In these notes we provide an introduction to compact linear operators on Banach and Hilbert spaces. These operators behave very much like familiar finite dimensional matrices, without necessarily having finite rank. For more thorough treatments, see [RS, Y]. Definition 1 Let X and Y be Banach spaces. A linear operator C : X → Y is said to be compact if for each bounded sequence {xi}i∈IN ⊂ X , t...

متن کامل

Compact Operators

In these notes we provide an introduction to compact linear operators on Banach and Hilbert spaces. These operators behave very much like familiar finite dimensional matrices, without necessarily having finite rank. For more thorough treatments, see [RS, Y]. Definition 1 Let X and Y be Banach spaces. A linear operator C : X → Y is said to be compact if for each bounded sequence {xi}i∈IN ⊂ X , t...

متن کامل

Compact Propositional Encoding of First-Order Theories

In this paper we present polynomial-time algorithms that translate First-Order Logic (FOL) theories to smaller propositional encodings than achievable before in polynomial time. For example, we can sometimes reduce the number of propositions to O(|P | + |C|), or O(|P | · log |P |), for |P | predicates of arity k and |C| constant symbols. The guarantee depends on availability of some graphical s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS

سال: 2021

ISSN: 1303-6149

DOI: 10.3906/mat-2004-68