两个引理及其推广的再拓广

文[1]介绍了有关不等式的两个引理及其推广命题1-4．文[2]将两个引理及其推广命题作出了进一步推广．本文将推广的两个引理及其推广的命题再进一步作出拓广．两个引理的再拓广如下：     

偶数阶微分方程的两点边值问题

利用对称双线性型引理和Ｓｃｈａｕｄｅｒ不动点定理,本文对一类偶数阶非线性微分方程给出存在唯一性定理．     

Riemann引理的若干证法和推广

本文首先给出了Ｒｉｅｍａｎｎ引理及其三种证法；然后通过直接方法、变量替换方法和多项式逼近的方法分别进行了证明．最后给出了Ｒｉｅｍａｎｎ引理的推广及其证明。     

两个引理及其推广的再推广

文[1]介绍了有关不等式的两个引理及其推广命题1-4．本文将两个引理及其推广命题再作进一步推广．     

解析算子函数的Schwarz引理的一般形式

该文对Ｆａｎ＾「２」和Ｍｉｓｈｒａ＾「３」关于算子情形的Ｓｃｈｗａｒｚ引理作了进一步的延拓，使其结果对于解析算子函数仍然成立。     

含时div—curl引理的一个证明

本文中我们用Ｆｏｕｒｉｅｒ分析方法证明了含时的ｄｉｖ－ｃｕｒｌ引理。     

含时div－curl引理的一个证明

本文中我们用Ｆｏｕｒｉｅｒ分析方法证明了含时的ｄｉｖ－ｃｕｒｌ引理。     

关于α-混合列的Borel-Cantelli引理及其应用

E．Rieders［1］指出，B-C引理的逆对α-混合列一般并不成立．木文则在常见的混合速度条件下，证明了个混合列的B－C引理．在此基础上，讨论了α-混合列强稳定的若干等价条件与E．Rieders［1］相互补充、相反相成     

Schwarz引理与Schwarz-Pick引理在单位球B_n上的推广

对单复变中的Schwarz引理与Schwarz-Pick引理在C~n中的超球上进行了推广.考虑C~n中单位球B_n上模小于1的全纯函数f(z),并在f(0)=0的条件下给出函数在原点的任意阶导数的估计.更进一步地,得到了B_n上模小于1的任意全纯函数在任意点的高阶导数的估计.     

几个猜想不等式的探究

文[1]对一道不等式再思考后提出了四个猜想，现对这四个猜想逐一加以探究。为了证明猜想，需用到下面的引理．     

Bihali引理的证明

根据Bihali引理可以确定微分方程解存在的更大一些的区间.该引理显然是十分重要的,然而目前找不到这个引理的证明.本文给出了一种证明.并举实例说明了这个引理的重要性.     

Frink-Tukey度量化引理

一致空间的度量化问题是一致空间的基本问题之一,其主要工具是Tukey度量化引理.证明在拓扑空间的度量化问题中起主要工具之一的Frink引理与Tukey度量化引理如出一辙,可将它们称之为Frink-Tukey度量化引理.     

A Note on the Five Lemma

We formulate and prove a “five lemma”, which unifies two independent generalizations of the classical five lemma in an abelian category: the five lemma in a (modular) semi-exact category in the sense of M. Grandis, and the five lemma in a pointed regular protomodular category in the sense of D. Bourn.     

The snail lemma in a pointed regular category

In this paper we explore the snail lemma in a pointed regular category. In particular, we show that under the presence of cokernels of kernels, the validity of the snail lemma is equivalent to subtractivity of the category. As a corollary, this gives that in the more restrictive context of a normal category the validity of the snail lemma is equivalent to the validity of the snake lemma.     

Robust Farkas’ lemma for uncertain linear systems with applications

We present a robust Farkas lemma, which provides a new generalization of the celebrated Farkas lemma for linear inequality systems to uncertain conical linear systems. We also characterize the robust Farkas lemma in terms of a generalized characteristic cone. As an application of the robust Farkas lemma we establish a characterization of uncertainty-immunized solutions of conical linear programming problems under uncertainty.     

Extremal results in sparse pseudorandom graphs

Szemerédi's regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and Rödl proved an analogue of Szemerédi's regularity lemma for sparse graphs as part of a general program toward extending extremal results to sparse graphs. Many of the key applications of Szemerédi's regularity lemma use an associated counting lemma. In order to prove extensions of these results which also apply to sparse graphs, it remained a well-known open problem to prove a counting lemma in sparse graphs.     

Nevanlinna's lemma on the logarithmic derivative of a meromorphic function

In proving the second fundamental theorem for functions meromorphic in the half-plane, Nevanlinna has asserted (in 1925) that they satisfy a lemma similar to the well-known lemma on the logarithmic derivative, but his proof was based on additional assumptions. These assumptions were later relaxed by Dufresnoy (in 1939) and Ostrovskii (in 1961). Here we shall show that in the general case, functions which are meromorphic in the half-plane do not satisfy a lemma similar to the lemma on the logarithmic derivative.     

A new proof of the Ahlfors five islands theorem

We deduce the Ahlfors five islands theorem from a corresponding result of Nevanlinna concerning perfectly branched values, a rescaling lemma for non-normal families and an existence theorem for quasiconformal mappings. We also give a proof of Nevanlinna’s result based on the rescaling lemma and a version of Schwarz’s lemma.     

A matrix Kronecker lemma

We show that a standard tool of probability theory, the Kronecker lemma, has matrix generalizations, but that one of these matrix generalizations is unsatisfactory, to the extent that unless certain extra conditions are placed on the matrix sequence appearing in the lemma statement, the lemma may fail to be true.     

Shifted versions of the Bailey and Well-Poised Bailey lemmas

The Bailey lemma is a famous tool to prove Rogers–Ramanujan type identities. We use shifted versions of the Bailey lemma to derive m-versions of multisum Rogers–Ramanujan type identities. We also apply this method to the Well-Poised Bailey lemma and obtain a new extension of the Rogers–Ramanujan identities.