首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 62 毫秒
1.
Let M be a smooth compact manifold and Λ be a compact invariant set.In this article,we prove that,for every robustly transitive set Λ,f|Λ satisfies a C1-genericstable shadowable property (resp.,C1-gene...  相似文献   

2.
We show that a set of real numbers is a Sierpinski set if, and only if, it satisfies a selection property similar to the familiar Menger property.  相似文献   

3.
A bounded subset of a normed linear space is said to be (diametrically) complete if it cannot be enlarged without increasing the diameter. A complete super set of a bounded set K having the same diameter as K is called a completion of K. In general, a bounded set may have different completions. We study normed linear spaces having the property that there exists a nontrivial segment with a unique completion. It turns out that this property is strictly weaker than the property that each complete set is a ball, and it is strictly stronger than the property that each set of constant width is a ball. Extensions of this property are also discussed.  相似文献   

4.
逐点伪轨跟踪性质及其应用   总被引:5,自引:1,他引:5  
本文给出紧致度量空间逐点伪轨跟踪性质的定义,该定义是伪轨跟踪性质定义的推广.作为应用,证明如下结论:(i)若f具有逐点伪轨跟踪性质,且对任意k∈Z ,fk为链转换的,那么对任意k∈Z ,fk为开集转换;(ii)若f具有逐点伪轨跟踪性质,且对任意n∈Z ,fn为链转换的,则f具有初始敏感依赖性质;(iii)若f为开集混合的,且具有逐点伪轨跟踪性质,那么f具有性质P;(iv)设f:(X,d)→(X,d)是同胚映射,那么f具有逐点伪轨跟踪性质当且仅当移位映射σf具有逐点伪轨跟踪性质.  相似文献   

5.
We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product. It was conjectured a decade ago that all finite sets of real matrices have the finiteness property. This “finiteness conjecture” is now known to be false but no explicit counterexample is available and in particular it is unclear if a counterexample is possible whose matrices have rational or binary entries. In this paper, we prove that all finite sets of nonnegative rational matrices have the finiteness property if and only if pairs of binary matrices do and we state a similar result when negative entries are allowed. We also show that all pairs of 2×2 binary matrices have the finiteness property. These results have direct implications for the stability problem for sets of matrices. Stability is algorithmically decidable for sets of matrices that have the finiteness property and so it follows from our results that if all pairs of binary matrices have the finiteness property then stability is decidable for nonnegative rational matrices. This would be in sharp contrast with the fact that the related problem of boundedness is known to be undecidable for sets of nonnegative rational matrices.  相似文献   

6.
We provide a polynomial time algorithm that identifies if a given finite ordered set is in the class of d2-collapsible ordered sets. For a d2-collapsible ordered set, the algorithm also determines if the ordered set is connectedly collapsible. Because finite ordered sets of interval dimension 2 are d2-collapsible, in particular, the algorithm determines in polynomial time if a given finite ordered set of interval dimension 2 has the fixed point property. This result is also a first step in investigating the complexity status of the question whether a given collapsible ordered set has the fixed point property.  相似文献   

7.
We obtain a local characterization of the point of continuity property for bounded subsets in Banach spaces not containing basic sequences equivalent to the standard basis of ℓ1 and, as a consequence, we deduce that, in Banach spaces with a separable dual, every closed, bounded, convex and nonempty subset failing the point of continuity property contains a further subset which can be seen inside the set of Borel regular probability measures on the Cantor set in a weak-star dense way. Also, we characterize in terms of trees the point of continuity property of Banach spaces not containing ℓ1, by proving that a Banach space not containing ℓ1 satis- fies the point of continuity property if, and only if, every seminormalized weakly null tree has a boundedly complete branch.  相似文献   

8.
This paper is concerned with the approximation property which is an important property in Banach space theory. We show that a Banach space X has the approximation property if (and only if), for every Banach space Y, the set of finite rank operators from X to Y is dense in the corresponding space of compact operators, in the usual topology of uniform convergence on compact sets.  相似文献   

9.
We consider a Gelfand-Phillips type property for the weak topology. The main results that we obtain are (1) for certain Banach spaces, E?? F inherits this property from E and F, and (2) the spaces Lp(μ, E) have this property when E does. A subset A of a Banach space E is a limited set if every (bounded linear) operator T:E → c0 maps A onto a relatively compact subset of c0. The Banach space E has the Gelfand-Phillips property if every limited set is relatively compact. In this note, we study the analogous notions set in the weak topology. Thus we say that A ? E is a Grothendieck set if every T: E → c0 maps A onto a relatively weakly compact set; and E is said to have the weak type GP property if every Grothendieck set in E is relatively weakly compact. In the papers [3, 4 and 6], it is shown among other results that the ?-tensor product E and the spaces Lp(μ, E) inherit the Gelfand-Phillips property from E and F. In this paper, we study the same questions for the weak type GP property. It is easily verified that continuous linear images of Grothendieck sets are Grothendieck and that the weak type GP property is inherited by subspaces. Among the spaces with the weak type GP property one easily finds the separable spaces, and more generally, spaces with a weak* sequentially compact dual ball. Also, C(K) spaces where K is (DCSC) are weak type GP (see [3] and the discussion before Corollary 4 below). A Grothendieck space (a Banach space whose unit ball is a Grothendieck set) has the weak type GP if and only if it is reflexive.  相似文献   

10.
When does the fixed point property of a finite ordered set imply its dismantlability by irreducible elements? For instance, if it has width two. Although every finite ordered set is dismantlable by retractible (not necessarily irreducible) elements, surprisingly, a finite, dimension two ordered set, need not be dismantlable by irreducible elements. If, however, a finite ordered set with the fixed point property is N-free and of dimension two, then it is dismantlable by irreducibles. A curious consequence is that every finite, dimension two ordered set has a complete endomorphism spectrum.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号