组合恒等式的证明方法

本文对组合恒等式的证明方法进行了归纳、总结与比较.将证明方法分为了五大类:定义证明法,归纳法,二项式法,组合意义法以及求导积分法,解析各种证明方法的基本思路,并给出了相应的例题.     

关于离散形式结点域定理证明的几点注记

本文指出了文[1]的主要定理(定理4与定理6)证明中的错误,并对其进行了修正,给出了正确的证明.     

常见的代数不等式的证明

给出了利用导数证明常见的几种代数不等式的基本方法,并对J.B.W ilke不等式给出了一个简单的证明     

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

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

圆锥曲线切线的性质

文[1]给出了共焦点的圆锥曲线的切线性质,读后很受启发.本文对其进行了推广,并应用导数的相关知识给出证明,这个证明是非常自然也是容易接受的.     

圆锥曲线切线的性质

文[1]给出了共焦点的圆锥曲线的切线性质,读后很受启发．本文对其进行了推广,并应用导数的相关知识给出证明,这个证明是非常自然也是容易接受的．     

积分不等式证明技巧解析

基于定积分不等式的证明是高等数学教学中的一个难点的认识,重点解析定积分不等式证明过程中所涉及的知识点,并对不等式证明技巧进行分析与归纳,阐述定积分不等式证明的基本思路和解题技巧．     

关于“费尔马最后定理的证明”一文的评注

本文对“费尔马最后定理的证明”一文作出几点评注，主要结论是该证明仅仅是对费尔马最后定理的部分情形的证明，即并没有完全证明费尔马最后定理     

站“高”再看高考题

针对2006年四川省一道有关不等式证明的高考题,利用导数研究函数单调性和凸凹性的方法,结合使用微分中值定理,给出证明,并对两个不等式成立的取值范围进行了推广     

基于概率检测组合模型的几何定理证明器

以概率性算法代替传统的确定性算法可快速证明复杂度很高的几何定理,可大幅度提高证明效率.对估算多项式中独立变元次数上界的算法进行了改进,并提出三种统计总体的采集标准,分析两种不同的实例检验方法,结合Schwartz-Zippel定理与统计推断理论,建立概率检测组合模型,并在此基础上采用Maple编程语言实现此快速的几何定理证明器——ProbProver.利用ProbProver证明器可在2秒内证明出代数法较难证明的Five Circles定理.最后给出的多组对比实验进一步表明ProbProver证明器具有明显高效性.     

Distribution of types of symmetry of tensors of high degree

The asymptotic distribution of tensors of degree N in symmetry types is studied in this paper.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 155, pp. 181–186, 1986.     

Estimates of stability of characterization of additive types of distributions

An estimate of stability of characterization of distribution types is obtained for the case of additive types. Under some conditions, the estimate has the order ε^1/3L(ε), where L(ε) is a slowly varying function. Proceedings of the Seminar on Stability Problems for Stochastic Models, Moscow, Russia, 1996, Part I.     

Study of the blow-up of solutions of systems of equations of hydrodynamic type

Mathematical Notes - We study the initial boundary-value problem for three-dimensional systems of equations of pseudoparabolic type. The system is similar to the Oskolkov system, but differs from...     

一类完全正则半群簇子簇格的性质

本文研究了完全正则半群簇的子簇格［Ｖ＋∩ＰＶ，Ｖ＋∩ＰＶ］的某些格运算性质，我们证明了簇Ｖ＋∩ＰＶ可分解为Ｖ与Ｖ＋∩ＰＶ的并；对任意完全正则半群簇Ｗ，有Ｗ∩（Ｖ∨Ｖ＋∩ＰＶ）＝（Ｗ∩Ｖ）∨（Ｗ∩Ｖ＋∩ＰＶ）．特别地，我们得到了等式Ｖ＋∩ＰＶ＝Ｖ成立的若干条件．     

Characterization of types of asymptotic discernibility of families of hypotheses

We give a characterization of the types of asymptotic discernibility of families of hypotheses in the case of hypothetical measures that are not, in general, mutually absolutely continuous. The case when the logarithm of the likelihood ratio admits an asymptotic expansion of the type of an expansion with local asymptotic normality is examined in detail. Examples are studied.Translated fromTeoriya Sluchainykh Protsessov, Vol. 15, pp. 64–71, 1987.     

Bases of the identities of products of certain varieties of groups

The following theorem is proved: The product of any variety of two-step solvable groups and a variety having a finite basis of identity relations has a finite basis of identity relations.Translated from Matematicheskie Zametki, Vol. 5, No. 1, pp. 137–144, January, 1969.     

Preservation of equivalence of derivations under reduction of depth of formulas

In this paper we consider derivations in the (&, )-fragment of the intuitionistic propositional calculus. As is known, replacement of any occurrence of a formula [F] in a sequent S by an occurrence of the formula [p], where p is a new propositional variable, with the simultaneous addition to the antecedent of the formula F p or p F depending on the sign of the occurrence of F in S, leaves the derivability unchanged. We give a proof of the fact that the natural extension of this transformation to derivations preserves the relation of equivalence of derivations, i.e., transformed derivations are equivalent if and only if the originals are equivalent. (Derivations are considered equivalent if certain of their normal forms coincide, or, what is the same, if their deductive terms coincide.) It is proved that by the iteration of this transformation, each derivation of an arbitrary sequent S can be transformed into a derivation of a sequent S, depending only on S, whose succedent is a variable, and in the antecedent there occur only formulas of the form a,a & b, a b,,(a b) c, a & b c, a (b & c), wherea, b, c are variables. Here if S is balanced, then S is also balanced. (A sequent is called balanced if each variable occurs in it no more than twice.) The familiar correspondence between certain concepts of the theory of categories and concepts of the theory of proofs allows one to assert that there has been constructed a univalent functor, mapping a free Cartesian closed category into itself.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 197–207, 1979.