《几何定理的机器证明(定稿)(共6页).docx》由会员分享，可在线阅读，更多相关《几何定理的机器证明(定稿)(共6页).docx（6页珍藏版）》请在taowenge.com淘文阁网|工程机械CAD图纸|机械工程制图|CAD装配图下载|SolidWorks_CaTia_CAD_UG_PROE_设计图分享下载上搜索。
1、精选优质文档-倾情为你奉上Mechanical Theorem Proving in GeometryGao Jun-yu*, Zhang Cheng-dongCangzhou Normal University Hebei province,Cangzhou city,College Road, . 0317- e-mail: gaojunyu8818AbstractMechanical theorem proving in geometry plays an important role in the research of automated reasoning. In this pap
2、er, we introduce three kinds of computerized methods for geometrical theorem proving: the first is Wu s method in the international community, the second is elimination point method and the third is lower dimension method.Keywords： geometric theorem, Wus method, elimination point method, lower dimen
3、sion methodCopyright 2012 Universitas Ahmad Dahlan. All rights reserved.1. Introduction, that is, mechanization method, is to find a method which can be computed steeply step according to a certain rules. Today we usually refer it as algorithm. The algorithm is applied in the computer programming, m
4、athematical mechanization, and mathematical theorems, This realizes mathematical theorem to be proved with computer.Mathematics in ancient China is nearly a kind of mechanic mathematics. Today, the method of Cartesian coordination gives this direction a solid step, and provides a simple and clear me
5、thod for the proof of geometrictheoremsmechanization.The mechanical thought of mathematics in ancient China made a deeply influence in Wu Wen-juns work about mathematics mechanization. In 1976, academician Wu Wen-jun began to enter the field of mathematicsmechanization. Since then , he forwards to t
6、he mechanization method which establish theoretical basis for the mechanization of mental work. He proves a large class of elementary geometry problems by computer. It is unprecedented in our country. This is a machine proving method and known as Wus method throughout the world. It is the first syst
7、em for mechanic proving method and it can give the proof for nontrivial theorem. He makes the Study of Theorem Proving in Geometry more mature1-6.In 1992, Academician Zhang Jing-zhong visited the USA to research mathematics mechanization and cooperated with Zhou Xian-qing and Gao Xiaos-han. The is o
8、ne that is based on area method. This brings readable Proof to be realized by computer for the first time. This result is significant for academic and mechanical theorem proving in geometry.In 1998,Yang Lu created . He obtains the achievement in the mechanic proof of inequalities. The achievement of
9、 this method is as good as Wus method and .It is a great achievement in the field of mechanical theorem proving in geometry by Chinese mathematicians3-8.Next, we will introduce the three methods respectly.2. Wus methodWu Wen-jun presents a method which is called Wus method. It is based on Quaternion
10、 of traditional mathematics. This method has been solves a series of actual problems in theoretical physics, computer science and other basic science fields. We can use Wus method to find a proof for the geometric theorem in computer. We introduce three main steps of this method as follows4-10:Step
11、1 Choosing a good coordinate system, free variable and restrict variable.Let us denote the free variables as , and suppose they have nothing to do with the conditions of geometric problems. Similarly, let us denote the restrict variables as which are restricted by the conditions of geometric problem
12、s. In this way, a geometric problems turns into a polynomial problem: （1）The conclusions of geometric problem can be expressed as a polynomial problem. （2）Or, it can be represented as a family of palynomial.Step 2 TriangulationAccording to the restrict variable, the rearrange of (1) is referred as t
13、riangulation. In another word, the systems of equation (1) is changed as: （3）Step 3 Gradual DivisionDenote the polynomial in (3) as , in (2)is divided by , and the remainder of division algorithm is denoted as .In order to avoid the fractional in quotient, we multiply to, that is, （4）The remainder i
14、s divided by (5)So, repeating this division, at last we get: （6）Then, let us interate all the equations above and replace the coefficient of of all equations above with , moreover, we obtain:Dividing two cases to discus: with and .Case 1: If, then, under the condition of and the non-degenerate condi
15、tion , there is , the required result follow.Case 2: If , then the proposition is not true. We present an example to show that how to use in solving problem. Example 1 The problem is: The midline on the hypotenuse in a right-angle triangle equals to half of the hypotenuseUsing to get the solution of
16、 the above problem is: as shown in Figure 1, first, choose coordinates to right-angle triangle. The two right-angle sides of and are as axis and axis respectively. The vertex of the right angle is ,.We take as the midpoint of hypotenuse and set up their coordinates as ，and respectively.OB (0,)A (,0)
17、D (,)Figure 1Because are arbitrary, this indicate that coordinates of are free variables and the midpoint is restricted by the hypothesis, so the coordinates of are restrict variables.Applying Wus Method , we solve this problem as follows:Step 1 Choosing a good coordinate system, free variable and r
18、estrict variable.Supposing is the midpoint of the , by the midpoint formula we can get:Using step 1 in Wus Method , we only need to prove that the , by the distant formula: Step 2 TriangulationBecause just has the restrict variable , and just has the restrict variable , so , themselves have been tri
19、anglize. So, it can be written as:Step 3 Gradual Division is divided by ,and the division is:That is, （7）where is divided by , so, （8）Where . Using (8) to express (7) ,we will receiveWhen , The proposition has been proved.3.Zhangs Elimination Point MethodWe introduce Zhangs Elimination Point Method
20、as follows1-9.Zhang Jing-zhong gives an effective method for what is called elimination point method, the method is based on the ancient area method, mainly used for deleting the constraint points. This idea of Zhangs Elimination Point Method is relative to the assumed conditions and area method, an
21、d the order of vanish point depends on the final constraint points. Then it is eliminated from back to front one by one. At last, the left point is total eliminated, if the number is equal to the right number, the proposition is permitted. To use Zhangs Elimination Point Method effectively, we repea
22、t the public edge theorem in the following:Next, we give a commonly important theorem of elimination point method:Public edge theorem (1970,Zhang): If the line and line to , thenPublic edge have four cases are shown as (a)-(d) in Figure 2 respectively.PQABM(a)PQABM(b)PABM(c)QPQABM(d)Figure 2We give
23、an example to express the Public edge theorem of Zhangs theorem.Example 2: The problem is : Verify that the diagonal of a parallelogram is mutual divided.To solve this problem is the following:Put a parallelogram as a diagram in Figure 3.1、Do a parallelogram.2、Connecting the diagonals which intersec
24、t at .We only need to verify ,. is the restriction point which finally made. So, firstly to remove the point . (Public edge theorem)ABCDEFigure 3Therefore, we can prove , and as the above similar way.4.With the establishment of and , the Machine Proving of automated theorem proving of equation theor
25、em has been solved ,but the Machine Proving of automated theorem proof of equation theorem has been difficult to achieve. Therefore, YangLu and many other scholars worked for the establishment of a new algorithm which we called . The work in the field of machine theorem proving by Chinese mathematic
26、ians is a milestone2-12.The can be divided into three courses:(1) Work out about boundary surface of inequality 、.(2) Using the boundary surface of the first step the parameter space was divided into finite cell decompositions, we get many connected open sets: 、, then from the connected open sets we
27、 select checkpoint for at least one abbrevd . (3) using the finite number of checkpoints 、 to verify the correctness of inequality. If every established the proposition is true, otherwise, the proposition is false.5. ConclusionThe three methods present different ways to deal with different problems.
28、 All of them are important in automated reasoning fields, when someone discusses a problem in automated reasoning fields, the first he (or she) would consider which of the three methods is just best for the problem, and then, he (or she) will obtain the best consequences. We hope our introduction is
29、 good for him (or her) , now and in the future.References1 Wu Wen-jun. Elementary geometry truss proof and mechanization J. Chinese science, 1997, (6), (in chinese).2 Wu Wen-jun. Geometric theorem machine the basic principle of proof M. Beijing: science press, 1984, (in chinese).3 Zhang Jing-zhong.
30、Away on collocation method J. Mathematics teacher, 1995, (1), (in chinese).4 Zhang Jing-zhong.The computer how to work out geometric problem M. Beijing: tsinghua university press, 2000, (in chinese).5 Zhang Jing-zhong, Gao Xiao-shan, Zhou Xian-qing. Based on the geometry information before extrapola
31、tion search system J. Journal of computer, 1996, 38 (10), (in chinese).6 Yang Lu. Inequality proof dimension reduction algorithm of the machine and the general program J. High technology communication, 1998 (7), (in chinese).7 B. Liu and Y.K. Liu, Expected value of fuzzy variable and fuzzy expected
32、value models, IEEE Transactions on Fuzzy Systems Vol.10, No.4 ,2002.8 J.A.Bondy and U.S.R.Murty. Graph Theory With ApplicationsM.New York: Elsevier Science Publishing Co.Inc,1976. 9 B.Korte and Vvgen. Combinatorial Optimization Theory and AlgorithmsM. Berlin:Springer，2000.10 Hua Mao, Sanyang Liu, So
33、me Properties of the Closure Operator of a Pi-space, Kyungpook Mathematical Journal, 2011，51(3).11 Sandip Chanda Abhinandan De .Congestion Relief of Contingent Power Network with Evolutionery Optimisation Algorithm, TELKOMNIKA Indonesian Journal of Electrical Engeering ,Vol.10 No.1 March 2012,12 Hadi Arabshahi,Static Characterization of InAs/AlGaAs Broadband Self-Assembled Quantum Dot Lasers, TELKOMNIKA Indonesian Journal of Electrical Engeering, Vol.10 No.1 March 2012,专心-专注-专业