关于《矩阵正定性的进一步推广》一文的注记

关于《矩阵正定性的进一步推广》一文的注记黎奇升（湖南吉首大学数学系，吉首４１６０００）文［１］给出了下面定义并讨论了它们的一些性质．定义　设Ａ∈Ｒ￣（ｎ×ｎ），若对任何０≠Ｘ∈Ｒ￣（ｎ×１），都有正定矩阵Ｓ＝Ｓｘ，使Ｘ￣ＴＳｘＡＸ＞０，则称Ａ为广义正...     

实有限可除代数间保矩阵M—P逆的共变算子对

设Ｄ,Ｄ１ 和Ｄ２ 是实有限可除代数,Ｍｍｎ（Ｄ）是Ｄ上所有ｍ ×ｎ矩阵的Ｒ线性空间． 若两个Ｒ线性算子ｆ：Ｍｍ ｎ（Ｄ１）→Ｍｍｎ（Ｄ２） 和ｇ：Ｍｎｍ （Ｄ１） →Ｍｎｍ （Ｄ２）满足ｆ（Ａ）＋ ＝ ｇ（Ａ＋ ）对于一切的Ａ∈Ｍｍ ｎ（Ｄ１）均成立,则称（ｆ, ｇ） 是一个保矩阵ＭＰ逆的共变算子对． 当ｍ ｉｎ（ｍ , ｎ）２时,本文刻划了所有这种共变算子对（ｆ, ｇ） 的结构．     

交换主理想整环上立方幂等矩阵的线性保持

设Ｒ（≠Ｆ_３）是特征不为２的交换主理想整环,Ｍ_ｎ（Ｒ）定义Ｒ上的ｎ×ｎ矩阵模,本文刻划当ｎ≥ｍ时从Ｍ_ｎ（Ｒ）到Ｍ_ｎ（Ｒ）的保持立方幂等矩阵的线性映射的形式,由此推广了Ｃｈａｎ和Ｌｉｍ的一个结果（［１,定理３］）．     

一类矩阵的Drazin逆

本文得到了一类环上矩阵Ｄｒａｚｉｎ逆的一个定理：设Ｎ表有单位元环Ｒ中零元、可逆元集合与Ｒ的中心Ｚ（Ｒ）的交集，Ｍ表Ｒ的子域与Ｚ（Ｒ）的交集，Ａ∈Ｒｎ×ｎ．若ｆ（λ）＝ｃλｋ（１－λｑ（λ））是Ａ的化零多项式，其中ｑ（λ）的系数属于Ｎ，且ｃ∈Ｎ，则Ａ的Ｄｒａｚｉｎ逆存在，且Ｘ＝Ａｋ［ｑ（Ａ）］ｋ＋１是Ａ的唯一的一个Ｄｒａｚｉｎ逆．     

自反算子代数的环自同构

设Ａ是Ｂａｎａｃｈ空间Ｘ上的自反算子代数，并且Ａ的不变子空间格ＬａｔＡ满足 ０＋≠０和Ｘ_≠Ｘ，ａ：Ａ→Ａ是环自同构．如果Ｘ是实空间，并且ｄｉｍ　Ｘ　＞１；则存在Ｘ上的线性有界可逆算子Ａ，使得ａ（Ｔ）＝ＡＴＡ～（－１）；Ｔ∈Ａ：如果Ｘ是复空间，并且ｄｉｍ Ｘ　＝∞，则ａ（Ｔ）＝ＡＴＡ～（－１），Ｔ∈Ａ．其中Ａ：Ｘ→Ｘ是线性、或者共轭线性有界可逆算子．     

广义逆A_(T,S)~(2)的子式

１．引 言 设Ａ∈Ｃｍ×ｎ,Ｍ和Ｎ分别为ｍ和ｎ阶Ｈｅｒｍｉｔｅ正定阵,考虑下列方程 （１） ＡＸＡ＝Ａ （２） ＸＡＸ＝Ｘ （３）（ＡＸ）＊＝ＡＸ （４）（ＸＡ）＊＝ＸＡ （３Ｍ）（ＭＡＸ）＊＝ＭＡＸ （４Ｎ）（ＮＸＡ）＊＝ＮＸＡ 如果Ｘ∈Ｃｎ×ｍ满足条件（１）和（２）,则称Ｘ为Ａ的自反广义逆,记作Ｘ＝Ａ（１,２）;如果 Ｘ满足条件（２）,则称Ｘ为 Ａ的｛２｝逆,记作 Ｘ＝Ａ（２）;如果Ｘ满足（１）－（４）,则称Ｘ为 Ａ的 Ｍ－Ｐ逆,记作Ｘ＝Ａ＋;如果Ｘ满足（１）、（２）、（３Ｍ）、（４Ｎ）,则称 Ｘ为 Ａ的加权…     

有限交换环上极限线性群的Sylowp—子群

本文给出了有限交换局部环Ｒ上无限线性群ＧＬ（Ｒ）＝∪ｎＧＬｎＲ的Ｓｙｌｏｗｐ－子群的形式．令Ｍ是有限交换局部环Ｒ的唯一极大理想，ｋ＝Ｒ／Ｍ为Ｒ的剩余类域．用Ｘ（ｋ）表示ｋ的特征，并假定Ｐ与ｘ（ｋ）互素．作者证明了：ＧＬ（Ｒ）的任一Ｓｙｌｏｗｐ－子群Ｓ或者同构于的可数无限直积与Ｐ（ｊ）的无限直积的直积（当Ｐ≠２或Ｐ＝２，Ｘ（ｋ）β≡１（ｍｏｄ４））或者同构于Ｐｉ的无限直积与Ｐ（ｊ）的无限直积的直积（当Ｐ＝２，Ｘ（ｋ）β≡３（ｍｏｄ４）），这里，只是ＧＬ（ｅｐｉ）Ｒ（分别地，ＧＬ（２ｒｉ）Ｒ）的Ｓｙｌｏｗｐ－子群，Ｐ（ｊ））同构于Ｐ＝∪ｉ∈Ｉｐｉ，Ｉ是可数集．     

Hadamard积和酉不变范数不等式

设Ｍｎ，ｍ是ｎ×ｍ复矩阵空间，Ｍｎ≡Ｍｎ，ｎ．对于Ｈｅｒｍｉｔｅ阵Ｇ，Ｈ∈Ｍｎ，ＧＨ表示Ｇ－Ｈ半正定．记Ａ和Ｂ的Ｈａｄａｍａｒｄ积为ＡＢ．本文证明了若Ａ，Ｂ∈Ｍｎ正定，而Ｘ，Ｙ∈Ｍｎ，ｍ任意，则（ＸＡ－１Ｘ）（ＹＢ－１Ｙ）（ＸＹ）（ＡＢ）－１（ＸＹ），ＸＡ－１Ｘ＋ＹＢ－１Ｙ（Ｘ＋Ｙ）（Ａ＋Ｂ）－１（Ｘ＋Ｙ）．这推广和统一了一些现存的结果．设‖·‖为任意酉不变范数，Ｉ是单位矩阵．本文还证明了对于Ｘ∈Ｍｎ，ｍ和Ａ∈Ｍｎ，Ｂ∈Ｍｍ，若ＡＩ，ＢＩ，则函数ｆ（ｐ）＝‖ＡｐＸ＋ＸＢｐ‖在［０，∞）上单调递增．     

分裂空间的一个性质

设Ｘ为一个拓扑空间，对于任意的Ａ∈Ｘ。存在可分度量空间Ｍ及连续映射ｆ：Ｘ→Ｍ，使得ｆ（Ｘ）＝Ｍ，Ａ＝ｆ＾－１（ｆ（Ａ）），则Ｘ称为分裂空间。本文证明了分裂空间Ｘ在广义连续统假设下：（１）若ｄ（Ｘ）≥２＾ω，则ｄ（Ｘ）＝｜Ｘ｜。（２）若（Ｘ）≤２＾ω，则对角线集△ｘ为Ｇδ集。并且（１）中的条件不能减弱。     

φ－满射环上GL_n（R）中元素的三角分解

本文结果是：设Ａ是φ－满射环Ｒ上的非拟纯量可逆ｎ×ｎ矩阵，βｊ，γｊ（尔≤ｊ≤ｎ）是Ｒ中任意元素，它们满足Πｎｊ＝１βｊγｊ＝ｄｅｔＡ，则存在ｎ阶阵Ｂ和Ｃ满足ＰＡＰ－１＝ＢＣ，其中Ｂ是下三角阵，Ｃ是上三角阵，Ｐ∈ＧＬｎ（Ｒ）．进一步，可以取Ｂ使βｊ（１≤ｊ≤ｎ）位于Ｂ的主对角线上，同时可以取Ｃ使γｊ（１≤ｊ≤ｎ）位于Ｃ的主对角线上．     

探讨线性代数的核心

本文从关于线性代数基本结构的各种不同看法出发，探讨线性代数在整个数学学习中的基本问题，并根据线性代数基本问题讨论线性代数的结构安排.     

On the stability of linear systems with an exact constraint set

This paper deals with the stability of the intersection of a given set with the solution, , of a given linear system whose coefficients can be arbitrarily perturbed. In the optimization context, the fixed constraint set X can be the solution set of the (possibly nonlinear) system formed by all the exact constraints (e.g., the sign constraints), a discrete subset of (as or { 0,1} ⁿ , as it happens in integer or Boolean programming) as well as the intersection of both kind of sets. Conditions are given for the intersection to remain nonempty (or empty) under sufficiently small perturbations of the data. Research supported by Fondecyt Grant 1020(7020)-646. Research supported by DGES and FEDER, Grant BFM2002-04114-C02-01     

A Characterization of Partially Ordered Sets with Linear Discrepancy Equal to 2

The linear discrepancy of a poset P is the least k such that there is a linear extension L of P such that if x and y are incomparable in P, then |h _L (x)–h _L (y)|≤k, where h _L (x) is the height of x in L. Tanenbaum, Trenk, and Fishburn characterized the posets of linear discrepancy 1 as the semiorders of width 2 and posed the problem of characterizing the posets of linear discrepancy 2. We show that this problem is equivalent to finding the posets with linear discrepancy equal to 3 having the property that the deletion of any point results in a reduction in the linear discrepancy. Howard determined that there are infinitely many such posets of width 2. We complete the forbidden subposet characterization of posets with linear discrepancy equal to 2 by finding the minimal posets of width 3 with linear discrepancy equal to 3. We do so by showing that, with a small number of exceptions, they can all be derived from the list for width 2 by the removal of specific comparisons. The first and second authors were supported during this research by National Science Foundation VIGRE grant DMS-0135290.     

A note on an open problem in linear complementarity

LetK be the class ofn × n matricesM such that for everyn-vectorq for which the linear complementarity problem (q, M) is feasible, then the problem (q, M) has a solution. Recently, a characterization ofK has been obtained by Mangasarian [5] in his study of solving linear complementarity problems as linear programs. This note proves a result which improves on such a characterization.Research sponsored by the United States Army under Contract No. DAAG29-75-C-0024 and the National Science Foundation under Grant No. MCS75-17385.     

A remark on linear permutation polynomials

We give an explicit representation of the class of linear permutation polynomials. By the representation, the number of them can be computed easily.     

An index formula for the product of linear relations

Let , and be linear spaces and let A and B be linear relations from to and from to , respectively. The main result of this note is a formula which relates the nullities and the defects of the relations A and B with those of the product relation BA.     

Average relational distance in linear extensions of posets

We consider a natural analogue of the graph linear arrangement problem for posets. Let P=(X,?) be a poset that is not an antichain, and let λ:X→[n] be an order-preserving bijection, that is, a linear extension of P. For any relation a?b of P, the distance between a and b in λ is λ(b)−λ(a). The average relational distance of λ, denoted , is the average of these distances over all relations in P. We show that we can find a linear extension of P that maximises in polynomial time. Furthermore, we show that this maximum is at least , and this bound is extremal.     

An algorithm for computing equilibria in a linear monetary economy

An algorithm is presented for computing equilibria in a linear monetary economy, that is, an exchange economy in which all individuals have linear utility functions and in which goods are bought and sold only in exchange for money. The algorithm computes the equilibrium prices by solving a finite sequence of linear programming problems.     

模糊粗糙线性空间

将粗糙集理论引入到线性空间与模糊线性空间中,分别给出了上粗与下粗线性空间及模糊上粗与模糊下粗线性空间的概念,并研究了它们的有关性质,获得了一系列有意义的结果。     

A new method for a class of linear variational inequalities

In this paper we introduce a new iterative scheme for the numerical solution of a class of linear variational inequalities. Each iteration of the method consists essentially only of a projection to a closed convex set and two matrix-vector multiplications. Both the method and the convergence proof are very simple.This work is supported by the National Natural Science Foundation of the P.R. China and NSF of Jiangsu.