几个组合引理的拓扑证明

Brouwer不动点定理的一种证明方法是利用Sperner引理,据此发展了计算不动点的各种算法.用组合方法处理连续映射的问题是组合拓扑学的基本思想.后来逐渐认识到可以沿相反方向进行,即用拓扑学的方法证明某些组合引理,例如Kuhn和Yoseloff。Brou-wer不动点定理和Sperner引理实际上是等价的. 本文利用拓扑学中的拓扑度理论和有关事实,证明几个组合引理,主要工具是分块线性映射的拓扑度.     

解对初值连续依赖定理的一个新的证明方法

《常微分方程》传统的教材均先证明Bellman引理,然后利用Bellman引理完成"解对初值连续依赖定理"的证明.本文用曲线平移的方法构造出比较函数,从而给出了解对初值连续依赖定理的一种新的且具有几何直观性的证明方法.     

关于离散信源的若干强极限定理

本文研究了离散信源广义熵定理以及随机条件概率的广义调和平均a.s.收敛性,在证明中提出了将Markov不等式、Borel-Cantelli引理和随机条件矩母函数等工具应用于强极限定理的研究的一种途径.     

积分中值定理的逆问题

研究积分第一中值定理,提出推广的积分第一中值定理逆问题的一个定理,为证明该定理,给出了两个引理,并通过构造辅助函数及集合,运用介值定理证明了两个引理,最后应用两个引理证明了该定理。     

两个对称矩阵和的特征根与其乘积的关系及应用

本文主要讨论对称矩阵 A、B的特征根与 AB=0的关系 .这个问题起源于 Craig定理 :设X～ Nn( μ,I) ,则二次型 X′AX与 X′BX独立的充要条件为 AB=0 .利用随机变量的特征函数理论可知 ,本定理证明的关键在于下面的 Craig引理 .这个引理最早由 Craig提出 ,先后有五、六个证明 ,但都有错误 .直到 1 962年才由许宝禄教授在讨论班上对引理给出了一个正确的证明 ,但证明过程仍较复杂 .由于 Craig定理的结论在多元分析理论中有着十分重要的地位 ,也因其论证经历而更加著名 .所以 ,今天对 Craig引理( Craig定理 )的证明仍有意义 .本文对 Craig引理 ( Craig定理 )给出了一个极为简明的证明 ,并得到了其它的重要结论 ,其中结论之一就是著名的有关多个二次型独立的 Cochran定理成了 Craig引理的一个简单推论 .因此 ,本文对 Craig引理的正确、简明、直观的论证 ,特别是独到的论证过程 ,对多元分析理论和对称矩阵理论都有一定的意义     

柯西中值定理的一个证法

柯西中值定理是微分学中最主要定理之一,通常是利用罗尔定理来证明的。其证明难点在于构造辅助函数。本文给出了柯西中值定理的另一个证法:先给出一个简单的引理,再利用关于导函数的介值性的达布定理,证明柯西中值定理,从而可把罗尔定理和拉格朗日中值定理作为特殊情形。同时,在证明中构造的辅助函数,也较易于接受。     

利用微分方程求解微分中值问题的逆向思维方法

有关微分中值定理的证明题的证题关键是构造辅助函数.为了找到构造辅助函数的通用方法,本文基于罗尔中值定理和微分方程理论,给出通过求解微分方程证明此类题型的逆向思维方法.实例表明本文提出的逆向思维方法在求证微分中值问题中具有一定的普适性.     

用原函数构造辅助函数

辅助函数法是高等数学证明中经常使用的一种非常有用的方法，例如拉格朗目中值定理与柯西中值定理的证明都使用了辅助函数法。构造辅助函数的方法很多，构造出的辅助函数也可以有各种不同的形式。大部分高等数学教材（例如「1」〔Zj上，拉格朗目中值定理和柯西中值定理证明中的辅助函数都是从几何角度得出的，然而上述两个定理证明中的辅助函数也可以用原函数构造出来。本文先通过拉格朗目中值定理与柯西中值定理的证明，介绍用原函数构造辅助函数的方法，然后再介绍一些用此法进行证明的其他实例。在拉格朗目中值定理的证明中，设八x）在…     

数学分析中一些定理的统一处理

<正> 文[1]给出了完全覆盖定理(以下简称引理)。并且用这个引理证明了有限覆盖定理和聚点定理。本文拟用该引理证明实数完备性的男外几个等价命题和分析中的其它二个重要定理。这种证明方法过程简单.思路自然,易被初学者掌握。     

有关凸函数的一个定理的改进证明

文[1]．P5．引理1．1．3的证明过程比较复杂、难以理解,本文用另外一种方法(利用函数的单调性、凹凸性和拉格朗日中值定理)对该定理进行了证明．其证明方法比文[1]的证明方法简单、明了,并对定理的结论进行了推广．     

Some point-wise estimates for solutions of a class of nonlinear functional-integral inequalities

Summary The celebrated Gronwall-Bellman Lemma provides explicit bounds on solutions of a class of linear integral inequalities. The aim of this paper is to prove sufficiently general results analogous to this Lemma for functional-integral inequalities. These results are useful for obtaining point-wise estimates or comparison theorems for solutions of functional differential equations and functional-integral equations of Volterra type. Entrata in Redazione il 1^o settembre 1971.     

A note on Hensel's lemma in several variables

The standard hypotheses for Hensel's Lemma in several variables are slightly stronger than necessary, in the case that the Jacobian determinant is not a unit. This paper shows how to weaken the hypotheses for Hensel's Lemma and some related theorems.

     

Minty’s lemma and vector variational-like inequalities

In this paper, we consider two vector versions of Minty’s Lemma and obtain existence theorems for three kinds of vector variational-like inequalities. The results presented in this paper are extension and improvement of the corresponding results of other authors. J. Zafarani was partially supported by the Center of Excellence for Mathematics (University of Isfahan).     

一般算子不动点定理及其在Strum-Liouville奇异边值问题中的应用

本文运用Zorn引理,得出了正则锥上的非紧非单调算子的不动点的存在性的结果,并用于讨论Strum-Liouville奇异边值问题,得出了有关解的存在性的全新的结论.     

Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach

We briefly consider several formulations of Farkas' Lemma first. Then we assume the setting of two vector spaces, one of them being linearly ordered, over a linearly ordered field till the end of this article. In this setting, we state a generalized version of Farkas' Lemma and prove it in a purely linear-algebraic way. Afterwards, we present Theorems of Motzkin, Tucker, Carver, Dax, and some other theorems of the alternative that characterize consistency of a finite system of linear inequalities. We also mention the Key Theorem, which is a related result. Finally, we use Farkas' Lemma to prove the Duality Theorem for linear programming (with a finite number of linear constraints). The Duality Theorem that is proved here covers, among others, linear programming in a real vector space of finite or infinite dimension and lexicographic linear programming.     

Metrically homogeneous sets: Corrigendum

A flaw in Lemma 2 is corrected and other parts of the paper changed a accordingly so as to preserve all the theorems. We are indebted to Professor Rigby for kindly bringing these facts to our attention.     

Notes on sectionally complemented lattices. IV How far does the Atom Lemma go?

There are two results in the literature that prove that the ideal lattice of a finite, sectionally complemented, chopped lattice is again sectionally complemented. The first is in the 1962 paper of G. Grätzer and E. T. Schmidt, where the ideal lattice is viewed as a closure space to prove that it is sectionally complemented; we call the sectional complement constructed then the 1960 sectional complement. The second is the Atom Lemma from a 1999 paper of the same authors that states that if a finite, sectionally complemented, chopped lattice is made up of two lattices overlapping in an atom and a zero, then the ideal lattice is sectionally complemented. In this paper, we show that the method of proving the Atom Lemma also applies to the 1962 result. In fact, we get a stronger statement, in that we get many sectional complements and they are rather close to the componentwise sectional complement.     

关于可列非齐次马氏链的若干极限定理

设{Xn,n≥0}是一列非齐次马尔科夫链,{an,n≥0}是一列固定的非负整数序列.首先构造了一个带参数的广义似然比函数,然后利用Borel-Cantelli引理证明随机变量序列几乎处处收敛性,得到了关于可列非齐次马氏链序偶广义平均的若干极限定理,推广了已有的结果.     

Rates of Convergence and Law of the Iterated Logarithm for U-Processes

We study in this paper some limit theorems for U-processes. We calculate rates of convergence in the central limit theorem of nondegenerate U-processes under metric entropy with bracketing condition. In application, we improve upon the law of the iterated logarithm of Arcones. All calculations use the Ossiander chaining procedure.     

A short proof of the preservation of the ωω‐bounding property

There are two versions of the Proper Iteration Lemma. The stronger (but less well‐known) version can be used to give simpler proofs of iteration theorems (e.g., [7, Lemma 24] versus [9, Theorem IX.4.7]). In this paper we give another demonstration of the fecundity of the stronger version by giving a short proof of Shelah's theorem on the preservation of the ω^ω‐bounding property. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)