A lifting theorem for subordinated invariant kernels

A lifting property for subordinated invariant kernels is proved and extended to operator-valued kernels. The connections with the classical Nagy-Foias lifting theorem and with Naimark's dilation theorem are indicated, as well as possible applications to scattering structures and quantum field theory.     

A factorization theorem for a certain class of graphs

In this note we give a necessary and sufficient condition for factorization of graphs satisfying the “odd cycle property”. We show that a graph G with the odd cycle property contains a [k_i] factor if and only if the sequence [H]+[k_i] is graphical for all subgraphs H of the complement of G.A similar theorem is shown to be true for all digraphs.     

Central intertwining lifting,maximum entropy and their permanence

The central intertwining lifting is used to establish a maximum principle for the commutant lifting theorem. This maximum principle is used to prove that the central intertwining lifting is also a maximal entropy solution for the commutant lifting theorem, when T is a unilateral shift of finite multiplicity. The maximum principle is based on the residual spaces for intertwining liftings, and is motivated by Robinson's minimum energy delay principle for outer functions. A permanence property for the central intertwining lifting is also given.     

The Relaxed Intertwining Lifting in the Coupling Approach

We discuss the relaxed lifting theorem by using a coupling framework. A simple proof of the existence of the relaxed lifting is given; the approach also yields a sufficient condition for uniqueness of the lifting. We investigate in more detail a particular case, in which a complete parametrization of solutions can be obtained.     

Relaxation of metric constrained interpolation and a new lifting theorem

In this paper a new lifting interpolation problem is introduced and an explicit solution is given. The result includes the commutant lifting theorem as well as its generalizations in [27] and [2]. The main theorem yields explicit solutions to new natural variants of most of the metric constrained interpolation problems treated in [9]. It is also shown that via an infinite dimensional enlargement of the underlying geometric structure a solution of the new lifting problem can be obtained from the commutant lifting theorem. However, the new setup presented obtained from the commutant lifting theorem. However, the new setup presented in this paper appears to be better suited to deal with interpolations problems from systems and control theory than the commutant lifting theorem.Dedicated to Israel Gohberg, as a token of admiration for his inspiring work in analysis and operator theory, with its far reaching applications, in friendship and with great affection.     

Fibrations of Ordered Groupoids and the Factorization of Ordered Functors

We investigate canonical factorizations of ordered functors of ordered groupoids through star-surjective functors. Our main construction is a quotient ordered groupoid, depending on an ordered version of the notion of normal subgroupoid, that results in the factorization of an ordered functor as a star-surjective functor followed by a star-injective functor. Any star-injective functor possesses a universal factorization through a covering, by Ehresmann’s Maximum Enlargement Theorem. We also show that any ordered functor has a canonical factorization through a functor with the ordered homotopy lifting property.     

相对Hopf模和广义cleft扩张

本文研究了π-cleft扩张的余代数分解问题及对偶的η-cocleft扩张的代数分解问题.利用相对Hopf模结构定理,给出了一个条件,使得具有余代数结构的π-cleft扩张有较好的余代数分解形式.作为特例,可以重新得到Radford给出的具有投射的双代数的双积分解定理.     

Differentiability of multivariate refinable functions and factorization

The paper develops a necessary condition for the regularity of a multivariate refinable function in terms of a factorization property of the associated subdivision mask. The extension to arbitrary isotropic dilation matrices necessitates the introduction of the concepts of restricted and renormalized convergence of a subdivision scheme as well as the notion of subconvergence, i.e., the convergence of only a subsequence of the iterations of the subdivision scheme. Since, in addition, factorization methods pass even from scalar to matrix valued refinable functions, those results have to be formulated in terms of matrix refinable functions or vector subdivision schemes, respectively, in order to be suitable for iterated application. Moreover, it is shown for a particular case that the the condition is not only a necessary but also a sufficient one. Dedicated to Charles A. Micchelli, a unique person, friend, mathematician and collaborator, on the occasion of his sixtieth birthday Mathematics subject classifications (2000) 65T60, 65D99.     

Condition Number Theorems in Linear-Quadratic Optimization

The condition number of a given mathematical problem is often related to the reciprocal of its distance from ill-conditioning. Such a property is proved here in the infinite-dimensional setting for linear-quadratic convex optimization of two types: linearly constrained convex quadratic problems, and minimum norm least squares solutions. A uniform version of such theorem is obtained in both cases for suitably equi-bounded classes of optimization problems. An application to the conditioning of a Ritz method is presented. For least squares problems it is shown that the semi-Fredholm property of the operators involved determines the validity of a condition number theorem.     

Operator factorization on partially ordered Hilbert resolution spaces with finite parameter sets

A generalization of the Gohberg-Krein theory of factorization along chains of subspaces to operators on partially ordered Hilbert resolution spaces was obtained by R. M. DeSantis and W. A. Porter by sacrificing a fundamental invariant subspace property of the factors. In the case where the parameter space is finite, this work gives a necessary and sufficient condition for the existence of a factorization which has the desired invariant subspace property.     

连续代数扩域上多项式因式分解的Trager算法

多项式的因式分解是符号计算中最基本的算法,二十世纪六十年代开始出现的关于多项式因式分解的工作被认为是符号计算领域的起源．目前多项式的因式分解已经成熟,并已在Maple等符号计算软件中实现,但代数扩域上的因式分解算法还有待进一步改进．代数扩域上的基本算法是Trager算法．Weinberger等提出了基于Hensel提升的算法．这些算法是在单个扩域上做因式分解．而在吴零点分解定理中,多个代数扩域上的因式分解是非常基本的一步,主要用于不可约升列的计算．为了解决这一问题,吴文俊,胡森、王东明分别提出了基于方程求解的多个扩域上的因式分解算法．王东明、林东岱提出了另外一个算法Trager算法相似,将问题化为有理数域上的分解．他们应用了吴的三角化算法,因此算法的终止性依赖于吴方法的计算．支丽红则将提升技巧用于多个扩域上的因式分解算法．本文将Trager的算法直接推广为连续扩域上的因式分解,只涉及结式计算与有理数域上的因式分解,给出了多个代数扩域上的因式分解一个直接的算法．     

The factorization of generalized Nevanlinna functions and the invariant subspace property

The well-known invariant subspace property of selfadjoint relations (multi-valued operators) in Pontryagin spaces is shown to be equivalent to the factorization property of (scalar) generalized Nevanlinna functions. This connection is established by a new realization for generalized Nevanlinna functions explicitly reflecting this connection. Combining this result with the new function-theoretic proof for the factorization property of generalized Nevanlinna functions contained in Wietsma (2018) immediately yields a new proof for the invariant subspace property of selfadjoint relations in Pontryagin spaces.     

On the existence and uniqueness of solutions in nonlinear complementarity theory

A complementarity problem is said to be globally uniquely solvable (GUS) if it has a unique solution, and this property will not change, even if any constant term is added to the mapping generating the problem.A characterization of the GUS property which generalizes a basic theorem in linear complementarity theory is given. Known sufficient conditions given by Cottle, Karamardian, and Moré for the nonlinear case are also shown to be generalized. In particular, several open questions concerning Cottle's condition are settled and a new proof is given for the sufficiency of this condition.A simple characterization for the two-dimensional case and a necessary condition for then-dimensional case are also given.The research described in this paper was carried out while N. Megiddo was visiting Tokyo Institute of Technology under a Fellowship of the Japan Society for the Promotion of Science.     

A Local Lifting Theorem for Jointly Subnormal Families of Unbounded Operators

A local lifting theorem for bounded operators that intertwine a pair of jointly subnormal families of unbounded operators is proved. Each family in question is assumed to be composed of operators defined on a common invariant domain consisting of “joint” analytic vectors. This result can be viewed as a generalization of the local lifting theorem proved by Sebestyén, Thomson and the present authors for pairs of bounded subnormal operators.     

Strong liftings with application to measurable cross sections in locally compact groups

There are two principal theorems. The adjustment theorem asserts that a lifting may be changed on a set of measure zero so as to become slightly stronger. In conjunction with the standard lifting theorem, it yields generalizations (with shorter proofs) of a number of known results in the theory of strong liftings. It also inspires a characterization of strong liftings, when the measure is regular, by the fact that they induce upon every open set an artificial “closure” of that set which differs from it by a set of measure zero. The projection theorem asserts that, in the presence of a strict disintegration, a strong lifting may be transferred or “projected” from one topological measure space onto another. In conjunction with Losert's example, it yields regular Borel, measures, carried on compact Hausdorff spaces of arbitrarily large weight, which everywhere fail to have the strong lifting property. It also provides the final link needed to obtained, with no separability assumptions, a measurable cross section (or right inverse) for the canonical map Ω:G→G/H, whereG is an arbitrary locally compact group, and whereH is an arbitrary closed subgroup ofG.     

Addition–Deletion Theorems for factorizations of Orlik–Solomon algebras and nice arrangements

We study the notion of a nice partition or factorization of a hyperplane arrangement due to Terao from the early 1990s. The principal aim of this note is an analogue of Terao’s celebrated addition–deletion theorem for free arrangements for the class of nice arrangements. This is a natural setting for the stronger property of an inductive factorization of a hyperplane arrangement by Jambu and Paris.In addition, we show that supersolvable arrangements are inductively factored and that inductively factored arrangements are inductively free. Combined with our addition–deletion theorem this leads to the concept of an induction table for inductive factorizations.Finally, we prove that the notions of factored and inductively factored arrangements are compatible with the product construction for arrangements.     

Domination spaces and factorization of linear and multilinear summing operators

It is well known that not every summability property for multilinear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to integrate under the same theory a wide family of classes of mappings for which a Pietsch type factorization theorem holds. Our construction includes the cases of absolutely p-summing linear operators, (p, σ)-absolutely continuous linear operators, factorable strongly p-summing multilinear operators, (p1,?. . .?, pn)-dominated multilinear operators and dominated (p1,?. . .?, pn; σ)-continuous multilinear operators.     

Entropy extension

We prove an “entropy extension-lifting theorem.” It consists of two inequalities for the covering numbers of two symmetric convex bodies. The first inequality, which can be called an “entropy extension theorem,” provides estimates in terms of entropy of sections and should be compared with the extension property of ?_∞. The second one, which can be called an “entropy lifting theorem,” provides estimates in terms of entropies of projections.     

Equivalence between the dilation and lifting properties of an ordered group through multiplicative families of isometries. A version of the commutant lifting theorem on some lexicographic groups

Let be a locally compact abelian ordered group. has the dilation property if a special extension of the Naimark dilation theorem holds for and it has the commutant lifting property if a natural extension of the Sz.-Nagy — Foias commutant lifting theorem holds for .We prove that these two conditions are equivalent and we give another necessary and sufficient condition in terms of unitary extensions of multiplicative families of partial isometries.A version of the commutant lifting theorem is given for the groups ⁿ and × ⁿ with the lexicographic order and the natural topologies.Both authors were partially supported by the CDCH of the Universidad Central de Venezuela, and by CONICIT grant G-97000668.     

On an intertwining lifting theorem for certain reproducing kernel Hilbert spaces

We provide an alternate approach to an intertwining lifting theorem obtained by Ball, Trent and Vinnikov. The results are an exact analogue of the classical Sz-Nagy-Foias theorem in the case of multipliers on a class of reproducing kernel spaces, which satisfy the Nevanlinna-Pick property.