On the Unavoidable Uncertainty of Truth in Dynamic Geometry Proving

The aim of this note is to discuss some issues posed by the emergency of universal interfaces able to decide on the truth of geometric statements. More specifically, we consider a recent GeoGebra module allowing general users to verify standard geometric theorems. Working with this module in the context of Varignon’s theorem, we were driven—by the characteristics of the GeoGebra interface—to perform a quite detailed study of the very diverse fate of attempting to automatically prove this statement, when using two different construction procedures. We highlight the relevance—for the theorem proving output—of expression power of the dynamic geometry interface, and we show that the algorithm deciding about the truth of some—even quite simple—statements can fall into a not true and not false situation, providing a source of confusion for a standard user and an interesting benchmark for geometers interested in discovering new geometric facts.     

Proving consistency of non-standard kernel estimators

We develop general methods based upon empirical process techniques to prove uniform in bandwidth consistency of a class of non-standard kernel-type function estimators. Examples include projection pursuit regression and conditional distribution estimation. Our results are especially useful to establish uniform consistency of data-driven bandwidth kernel-type function estimators.     

Justifying and Proving in the Cabri Environment

This paper describes a long term teaching experiment carried out with students from the 9th–10th grades. Geometrical constructions in the Cabri environment were selected as a specific field of experience, within which the sense of theory may emerge. The idea of construction constitutes the key to accessing the idea of theorem, moving from a generic idea of justification towards the idea of validating within a geometrical system. The study aims at clarifying the role of the Cabri environment in this teaching-learning processes: analysis of protocols shows the possible evolution of a justification into a proof but at the same time indicates that this evolution is not expected to be simple and spontaneous.This revised version was published online in September 2005 with corrections to the Cover Date.     

Riemann引理的若干证法和推广

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

Proving primality in essentially quartic random time

This paper presents an algorithm that, given a prime , finds and verifies a proof of the primality of in random time . Several practical speedups are incorporated into the algorithm and discussed in detail.

     

辅助函数在不等式证明中的应用

将不等式问题转化为函数问题,利用函数性质来研究、解决不等式问题.掌握不等式证明的一种函数思想方法,从而提高分析问题与解决问题的能力.     

不等式证明中的概率思想方法

不等式的证明往往比较复杂,有时直观含义也比较抽象,代数的方法难以发挥作用。如果能够建立适当的概率模型,赋以一些随机事件或随机变量的具体含义,再利用概率的理论加以证明,则常常能使证明过程得到简化。同时还可以为抽象的数学问题提供具体的概率背景,沟通各数学分支之间的联系。文中通过几个不等式的证明阐明了常用的概率思想方法。     

一道美国大学生数学竞赛题的证明

文献[1,2]中对一道美国大学生数学竞赛题通过设定函数利用插值的方法进行了证明,本文根据问题的特点,给出另外的证明,用同一方法还对另一行列式问题给出一般求解公式.     

罗尔定理证明一类存在性问题

提出罗尔定理证明一类存在性问题的方法,采用拉格朗日中值定理或柯西中值定理来证明这类问题往往需要构造精巧的辅助函数,我们还指出了这种方法的一般性.     

一种几何定理机器证明的零维化方法

本文对一类初等几何定理的证明给出了一种机械化方法，利用这种方法，可计算出一个由有限个素理想组成的集合，所有属于假设部分对应的某一扩域上的理想的素理想都在这个集合中出现并且可以挑选出来．因而一个几何定理一般真确，当且仅当终结多项式属于全部的这种素理想，即对其不可约特征列的余式为零．     

利用微分学证明不等式的几种典型证法

通过对几道不等式证明题的分析,文中总结了利用微分学证明不等式的常用方法,有助于学生加深对微分学知识的理解,激发学生的学习兴趣,也有利于学生发散思维培养及提高解决问题的能力.     

代数不等式概率证法举例

本文仅借助初等概率论中的一些简单性质，简洁巧妙地证明一些代数不等式．