Regular Factorizations of Contractions
نویسنده
چکیده
Equivalent conditions are given for the regularity of a factorization of a contraction, two of which exhibit immediately the duality property of this notion. The concept of regular factorization of contractions of Hubert spaces1 was introduced in [1] by the authors in connection with their investigations on the invariant subspace problem; cf. [2, §VIL3]. Let A0 be a contraction of a Hubert space 31 into a Hubert space 31,, and let (F) A0 = A2AX be a factorization of A0 as a product of a contraction Ax of 31 into some "intermediate" Hubert space 33, and of a contraction A2 of 33 into 31*: 33 Define the corresponding "defect operators" by £>, = (/, A*A,)112, D^ = (/„, A.A*)1'2 (j = 0, 1, 2), where I} and /*, denote the identity operators on the space of definition of Aj and A*, respectively. The factorization (F) was defined to be regular if condition (i) given in the Proposition below holds. Some basic arithmetical properties of such factorizations were established in [2], in particular it was proven that (F) is regular if and only if its dual
منابع مشابه
One-Factorizations of Regular Graphs of Order 12
Algorithms for classifying one-factorizations of regular graphs are studied. The smallest open case is currently graphs of order 12; one-factorizations of r-regular graphs of order 12 are here classified for r ≤ 6 and r = 10, 11. Two different approaches are used for regular graphs of small degree; these proceed one-factor by one-factor and vertex by vertex, respectively. For degree r = 11, we ...
متن کاملCoding Partitions of Regular Sets
A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the f...
متن کاملRegular coding partitions
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical codi...
متن کاملTriangulated Categories of Matrix Factorizations for Regular Systems of Weights with Ε = − 1
Abstract. We construct a full strongly exceptional collection in the triangulated category of graded matrix factorizations of a polynomial associated to a non-degenerate regular system of weights whose smallest exponents are equal to −1. In the associated Grothendieck group, the strongly exceptional collection defines a root basis of a generalized root system of sign (l, 0, 2) and a Coxeter ele...
متن کاملMaking factorizations compositive
The main aim of this paper is to obtain compositive cone factorizations from non-compositive ones by itereration. This is possible if and only if certain colimits of (possibly large) chains exist. In particular, we show that (strong-epi, mono) factorizations of cones exist if and only if joint coequalizers and colimits of chains of regular epimorphisms exist.
متن کامل