关于Wielandt-Hoffman定理

关于正规矩阵的任意扰动,有下述定理成立. 定理1.设A为n阶正规矩阵,C为n阶任一矩阵.A的特征值为λ_1,…,λ_n,C的特征值为μ_1…,μ_n.C~H表示C的转置共轭,||·||_2与||·||_F分别表示矩阵的谱范数与Frobenius范数.记     

C*-代数交叉积上的渐近同态(英文)

林华新和松井宏树提出了可分C~*-代数上的渐近同态的概念,以及Cantor极小系统上弱逼近共轭的概念.设A为Ko群有限生成的AF代数,α,β为A上的具有Rokhlin性质的*-自同构.则α和β弱逼近共轭的充要条件是,存在两列渐近同态{φ_n}:A_α→A_β和{ψ_n}:A_β→A_α,以及两列*-自同构{Φ_n},{Ψ_n}:A→A,满足对任意的a∈A,均有lim_(n→∞)‖φ_noj_α(a)-jβoΦ_n(a)‖=0和lim_(n→∞)‖ψ_nojβ(a)-jα·Ψ_n(a)‖=0.     

一个构造增生映像零点的带误差的迭代算法

设E是一致光滑的Banach空间,A:D(A)E→2~E是一个满足值域条件的增生算子,进一步满足线性增长条件:‖Ax‖≤C(1+‖x‖)对某个常数C0, x∈D(A).设z∈D(A)是任意固定元,x_1∈D(A), A~(-1)0≠Φ.定义序列{x_n}D(A)如下:x_(n+1)∈x_n-λ_n(Ax_n+θ_n(x_n-z+e_n)),n≥1,其中{λ_n}与{θ_n}是满足一定条件的非负数列.则x_n→x~*∈A~(-1)(0),(n→∞).作为应用,我们推出构造连续伪压缩映像的不动点的收敛定理.     

弱群逆的扰动及其应用

<正>1引言设C_n,n表示n×n阶全体复矩阵的集合.记A^*,R(A),N(A),rk (A),‖A‖,ρ(A)分别表示矩阵A的共轭转置,值域,核空间,秩,谱范数,谱半径.记A的指标为Ind(A)=k,其中k是满足rk(A^k+1)=rk (A^k)成立的最小非负整数.进一步,     

关于矩阵范数的几个不等式

正1引言文中,用M_n表示n×n复矩阵全体,用‖·‖表示任意的酉不变范数,分别用|λ_n(A)|≤…≤|λ_1(A)|,s_n(A)≤…≤s1(A)来表示矩阵A的特征值和奇异值,用|A|=(A~*A)~(1/2)表示A的绝对值算子.     

矩阵方程AXB+CYD=E对称最小范数最小二乘解的极小残差法

<正>1引言本文用R~(n×m)表示全体n×m实矩阵集合,用SR~(n×n)表示全体n×n实对称矩阵集合,OR~(n×n)表示全体n×n实正交矩阵集合.用I_n表示n阶单位矩阵,用A*B表示矩阵A与B的Hadamard乘积.对任意矩阵A,B∈R~(n×m),定义内积〈A,B〉=tr(B~T A),其中     

Orlicz空间中Müntz有理函数逼近的Jackson型定理

正1引言Müntz在文献[1]中研究了Müntz系统{x~(λn)}~∞_(n=1)在C[0,1]中的稠密问题,给出了著名的Müntz定理,这也将Weierstrass定理推广到了更一般的情况.之后学者们逐步转向了考虑Müntz有理逼近速度等问题的研究,而且这类研究正日益深入.设C[0,1]是[0,1]区间上全体连续函数,对非负递增实数序列∧={λ_n}~∞_(n=1)以∏_n(∧)表示n阶Müntz多项式空间,即{x~(λ_1),x~(λ_2),…,x~(λ_n)}的线性组合的全体,以R_n(∧)表示n     

四元数自共轭矩阵与行列式的几个定理

本文继续使用文献[1],[2],[3],[4],[5]的符号和术语。对四元数体Q上的自共轭矩阵与行列式进行讨论得到几个重要定理。为此,先作几点说明。 2.设A为四元数体Q上的一个n阶矩阵,若A=(即,A=a_(ij),a_(ij)∈Q。恒有a_(ij)=a_(ji))。则说A是四元数体Q上的一个自共轭矩阵。自共轭四元矩阵A的行列式记为‖A‖。     

一类矩阵对的广义特征值的扰动界限

关于矩阵特征值的扰动,下面的结果是熟知的:若A与C皆为n阶正规矩阵,它们的特征值分别为α_1,…,α_n与γ_1,…,γ_n,则据Wielandt-Hoffman定理,存在1,…,n的一个排列k_1,…,k_n,使得     

关于Hadamard不等式的再改进

本文提出并改进了文[1]中所给出的几个关于可除环上矩阵行列式的不等式,利用这些不等式我们给出了可除环上任意非奇异矩阵的经典Hadamard不等式的一个再改进. 定义1 设A=(a_(ij))_(n×n)是四元数除环Ω上的矩阵,A=(a_(ij))_(n×n)是A的共轭矩阵,如果A=A,则称A为自共轭矩阵,如果A的各阶主子式均为正实数,则称A为正定自共轭矩阵(文[2]定理4).     

Uniqueness theorem for locally antipodal Delaunay sets

We prove theorems on locally antipodal Delaunay sets. The main result is the proof of a uniqueness theorem for locally antipodal Delaunay sets with a given 2R-cluster. This theorem implies, in particular, a new proof of a theorem stating that a locally antipodal Delaunay set all of whose 2R-clusters are equivalent is a regular system, i.e., a Delaunay set on which a crystallographic group acts transitively.     

The capacity and equivocation of a transducer and a connection with Billingsley dimension

In this paper the study of a noiseless transducer with finite memory, begun by Conner [Ann. Math. Statist.41, No. 6 (1970)], is set forth. The uniqueness and the weak Bernoulli property of the maximal-output dynamical system are proved. A convergence theorem about equivocation, which is analogous to McMillan's theorem about entropy, is obtained. An application of this theorem yields a lower estimation of the Billingsley dimension of the ambiguity set of almost all output messages.     

Orthogonality Preserving Transformations on Indefinite Inner Product Spaces: Generalization of Uhlhorn's Version of Wigner's Theorem

We present an analogue of Uhlhorn's version of Wigner's theorem on symmetry transformations for the case of indefinite inner product spaces. This significantly generalizes a result of Van den Broek. The proof is based on our main theorem, which describes the form of all bijective transformations on the set of all rank-one idempotents of a Banach space which preserve zero products in both directions.     

Generic leaves

A remarkable theorem of E. Ghys asserts that, for any harmonic measure on a compact, foliated metric space, -almost every leaf has 0, 1, 2 or a Cantor set of ends. In this paper, analogous results are proven for topologically almost all (i.e., residual families of) leaves. More precisely, if some leaf is totally recurrent, a residual family of leaves is totally recurrent with 1, 2 or a Cantor set of ends. A "local" version of this theorem asserts that, in general, topologically almost all leaves have 0, 1, 2 or a Cantor set of dense ends. Received: October 1, 1997     

Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy’s Theorem on Induced Subsets

An identifying code of a (di)graph G is a dominating subset C of the vertices of G such that all distinct vertices of G have distinct (in)neighbourhoods within C. In this paper, we classify all finite digraphs which only admit their whole vertex set as an identifying code. We also classify all such infinite oriented graphs. Furthermore, by relating this concept to a well-known theorem of Bondy on set systems, we classify the extremal cases for this theorem.     

A generalization of steinhagen’s theorem

The theorem of Steinhagen establishes a relation between inradius and width of a convex set. The half of the width can be interpreted as the minimum of inradii of all 1-dimensional orthogonal projections of a convex set. By considering i-dimensional projections we obtain series ofi-dimensional inradii. In this paper we study some relations between these inradii and by this we find a natural generalization of Steinhagen’s theorem. Further we show in the course of our investigation that the minimal error of the triangle inequality for a set of vectors cannot be too large.     

Generalized Browder’s Theorem and SVEP

A bounded operator a Banach space, is said to verify generalized Browder’s theorem if the set of all spectral points that do not belong to the B-Weyl’s spectrum coincides with the set of all poles of the resolvent of T, while T is said to verify generalized Weyl’s theorem if the set of all spectral points that do not belong to the B-Weyl spectrum coincides with the set of all isolated points of the spectrum which are eigenvalues. In this article we characterize the bounded linear operators T satisfying generalized Browder’s theorem, or generalized Weyl’s theorem, by means of localized SVEP, as well as by means of the quasi-nilpotent part H ₀(λI − T) as λ belongs to certain subsets of . In the last part we give a general framework for which generalized Weyl’s theorem follows for several classes of operators.     

非紧域上集值映象的重合点与不动点

在赋范线性空间的非空非紧凸集上建立了集值映象对的一个重合点定理,然后用这一定理改进了文献［１］中的集值映象内向集定理与外向集定理,并得到几个集值映象不动点定理．     

Guided discovery of the nine-point circle theorem and its proof

The nine-point circle theorem is one of the most beautiful and surprising theorems in Euclidean geometry. It establishes an existence of a circle passing through nine points, all of which are related to a single triangle. This paper describes a set of instructional activities that can help students discover the nine-point circle theorem through investigation in a dynamic geometry environment, and consequently prove it using a method of guided discovery. The paper concludes with a variety of suggestions for the ways in which the whole set of activities can be implemented in geometry classrooms.     

Duality theory in multiobjective programming

In this paper, a multiobjective programming problem is considered as that of finding the set of all nondominated solutions with respect to the given domination cone. Two point-to-set maps, the primal map and the dual map, and the vector-valued Lagrangian function are defined, corresponding to the case of a scalar optimization problem. The Lagrange multiplier theorem, the saddle-point theorem, and the duality theorem are derived by using the properties of these maps under adequate convexity assumptions and regularity conditions.