Weak Minimizing Property and the Compact Perturbation Property for the Minimum Modulus
Abstract
For an operator T:X Y, denote m(T)=∈f\\|Tx\|:x∈ SX\. A sequence (xn) in SX is said to be minimizing for T if \|Txn\| m(T). The weak minimizing property (WmP), introduced by Chakraborty, requires that every operator admitting a non-weakly null minimizing sequence attains its minimum modulus. More recently, Han~Han2026 introduced the Compact Perturbation Property for the minimum modulus (CPPm), which requires that for every operator T:X Y that does not attain its minimum modulus, \[ K∈K(X,Y) m(T+K)=m(T). \] In~Han2026, it is shown that (1,1) fails both properties, while (c0,c0) fails the WmP. However, whether (c0,c0) has the CPPm was left open (Problem~3.6). In this paper, we give a negative answer to this question by proving that (c0,c0) does not have the CPPm. The proof is constructive, exhibiting a non-min-attaining operator whose minimum modulus is strictly increased by a rank-one compact perturbation. Moreover, we show that this phenomenon is not specific to c0: if X=K∞ Y with Y non-reflexive, then the pair (X,X) fails the CPPm.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.