Ivan Petrović Computer Science Department Faculty of Mathematics University of Belgrade February 5 th, 2011 Java implementation of Wu's method for Automated.

Slides:



Advertisements
Similar presentations
Algorithm –History Muhammad ibn Musa Al-Khwarizmi www -groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Al- Khwarizmi.html Book on arithmetic:
Advertisements

A History of Numerical Analysis Ideas Alan Kaylor Cline Department of Computer Sciences The University of Texas at Austin Prepared for CS 378 History of.
Chapter 5 Perpendicular Bisectors. Perpendicular bisector A segment, ray or line that is perpendicular to a segment at its midpoint.
Chapter 4: Security Policies Overview The nature of policies What they cover Policy languages The nature of mechanisms Types Secure vs. precise Underlying.
Narapong Srivisal, Swarthmore College Class of 2007 Division Algorithm Fix a monomial order > in k[x 1, …, x n ]. Let F = (f 1, …, f s ) be an ordered.
Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann.
Matrix Algebra THE INVERSE OF A MATRIX © 2012 Pearson Education, Inc.
Gröbner Bases Bernd Sturmfels Mathematics and Computer Science University of California at Berkeley.
 Definition:  A line that passes through the midpoint of the side of a triangle and is perpendicular to that side.
5.2 Bisectors of a Triangle Concurrent lines CircumcenterIncenter.
Proof of Pythagoras’s Theorem GCSE Higher. ‘Prove’ means what exactly? A proof in mathematics is a process of logical steps Each step makes a statement.
The Art of Programming Top-Down Design. The Art of Problem Solving The art of problem solving is the transformation of an English description of a problem.
1 L07SoftwareDevelopmentMethod.pptCMSC 104, Version 8/06 Software Development Method Topics l Software Development Life Cycle Reading l Section 1.4 – 1.5.
Lesson 2.5 The Fundamental Theorem of Algebra. For f(x) where n > 0, there is at least one zero in the complex number system Complex → real and imaginary.
MATHEMATICS CURRICULUM FOR SA I. DIVISION OF MARKS UNITMARKS NUMBER SYSTEMS11 ALGEBRA23 GEOMETRY17 TRIGONOMETRY22 STATISTICS17 TOTAL90 FIRST TERM.
Application of CAS to geodesy: a ‘live’ approach P. Zaletnyik 1, B. Paláncz 2, J.L. Awange 3, E.W. Grafarend 4 1,2 Budapest University of Technology and.
© The McGraw-Hill Companies, 2006 Chapter 1 The first step.
GEOGEBRA STD X SUB : ICT. Chapter 6 Geogebra Created By :- Mr.S.N.Attar ICT BOARD Member PRESENTED BY Kulkarni S.A.
Outline Main result Quantum computation and quantum circuits Feynman’s sum over paths Polynomials QuPol program “Quantum Polynomials” Quantum polynomials.
Geometry CSC 2141 Introduction to Computer Graphics.
Xiao-Shan Gao MMRC Institute of System Science, Academia Sinica MMP/Geometer Automated Generation for Geometric Diagrams and Theorem Proofs.
Relationships within Triangles Chapter Midsegment Theorem and Coordinate Proof Midsegment of a Triangle- a segment that connects the midpoints.
James Matte, Stephanie Myers, Joshua Locicero MED 600 Fall 2013.
Prepared by Mrs. Azduwin Binti Khasri
These materials are prepared only for the students enrolled in the course Distributed Software Development (DSD) at the Department of Computer.
Continuing with Integrals of the Form: & Partial Fractions Chapter 7.3 & 7.4.
 Perpendicular Bisector- a line, segment, or ray that passes through the midpoint of the side and is perpendicular to that side  Theorem 5.1  Any point.
Pseudocode Simple Program Design Third Edition A Step-by-Step Approach 2.
9/23/2009 NOTICE! These materials are prepared only for the students enrolled in the course Distributed Software Development (DSD) at the Department of.
Bisectors of a Triangle
Unit 2 Test Review Geometry WED 1/22/2014. Pre-Assessment Answer the question on your own paper.
5-3 Bisectors in Triangles
Geometry B POINTS OF CONCURRENCY. The intersection of the perpendicular bisectors. CIRCUMCENTER.
Holt McDougal Algebra 2 Dividing Polynomials How do we use long division and synthetic division to divide polynomials?
USING GEOGEBRA in TEACHER TRAINING Dr. Mustafa DOĞAN, Dr. Erol KARAKIRIK.
Perpendicular Bisectors of a Triangle Geometry. Equidistant A point is equidistant from two points if its distance from each point is the same.
Geometry Sections 5.1 and 5.2 Midsegment Theorem Use Perpendicular Bisectors.
Bisectors in Triangles Chapter 5 Section 3. Objective Students will identify properties of perpendicular bisectors and angle bisectors.
Understanding the difference between an engineer and a scientist There are many similarities and differences.
Warmup Divide using synthetic division using the zero given. Then factor the answer equation completely and solve for the remaining zeroes. Show.
Welcome to Interactive Chalkboard Glencoe Geometry Interactive Chalkboard Copyright © by The McGraw-Hill Companies, Inc. Developed by FSCreations, Inc.,
Perpendicular and Angle Bisectors Perpendicular Bisector – A line, segment, or ray that passes through the midpoint of a side of a triangle and is perpendicular.
2 2.2 © 2016 Pearson Education, Ltd. Matrix Algebra THE INVERSE OF A MATRIX.
Chapter 5 Lesson 3 Objective: Objective: To identify properties of perpendicular and angle bisectors.
LESSON FIFTEEN: TRIANGLES IN TRAINING. MORE TRIANGLE PROPERTIES In the last lesson, we discussed perpendicular bisectors and how they intersect to create.
Chapter 2 The z Transform.
5.3 Notes Bisectors in Triangles. Concurrent When three or more lines intersect at one point, they are concurrent The point at which they intersect is.
San Pedro High School Back - to – School Night Welcome to Room 227 CC H Algebra 1/CC H Geometry Mr. Sanchez.
Warm Up Compute the following by using long division.
Subject Name: Software Testing Subject Code: 10CS842 Prepared By:
Lesson 2 Flowcharting.
Use Angle Bisectors of Triangles
Triangle Centers Points of Concurrency
5.2 Bisectors of a Triangle
Unit# 9: Computer Program Development
Objective of This Course
Section 6.6 Concurrence of Lines
Homework 1: Electrical System
CHAPTER-6 Z-TRANSFORM.
Principles of Programming Languages
SECTION 2-4 : SOLVING EQUATIONS WITH THE VARIABLE ON BOTH SIDES
Bisectors of a Triangle
Basic Concepts of Algorithm
Section 8.5 Day 1 Using the Distributive Property
5-1 Bisectors of Triangles
Bisectors of a Triangle
Matrix Algebra THE INVERSE OF A MATRIX © 2012 Pearson Education, Inc.
Rich Model Toolkit – An Infrastructure for Reliable Computer Systems
Faculty of Computer Science and Information System
Constructing a Circumcenter
Presentation transcript:

Ivan Petrović Computer Science Department Faculty of Mathematics University of Belgrade February 5 th, 2011 Java implementation of Wu's method for Automated Theorem Proving in Geometry

Geometry Theorem Provers 1/11 _________________________  Two categories of provers:  algebraic (coordinate-based) methods  coordinate-free methods  Main algebraic methods:  Wu's method (Wen-Tsun Wu)  Gröbner bases method (Bruno Buchberger)  Main coordinate-free methods:  Area method (Shang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang)  Full-Angle method (same authors)

Geometry Theorem Provers 2/11 _________________________ Wu's method is powerful mechanism for proving geometry theorems in elementary geometry. It is complete decision procedure for some classes of geometry problems. How Wu's method works?  step 1 – translate geometry problem into multivariate polynomial system  two types of variables:  u s – independent (parametric) variables  x s – dependent variables  step 2 – triangulation of polynomial system (each next equation introduces exactly one new dependent variable) by using pseudo division 

Geometry Theorem Provers 3/11 _________________________  step 3 – calculating final reminder of polynomial that represents statement with each polynomial from triangulated system, by using pseudo division of polynomials  step 4 – producing answer on the basis of final reminder and obtained non-degenerative conditions (zero reminder means proved theorem)

Geometry Theorem Provers 4/11 _________________________  main operation – pseudo division:

Geometry Theorem Provers 5/11 _________________________ Wu's method in WinGCLC application (screen shot of Euler's line theorem)

Geometry Theorem Provers 6/11 _________________________ Simple example of Wu's method: [Theorem about circumcenter of a triangle] “The tree perpendicular bisectors of a triangle's sides meet in a single point (they are concurrent lines).”

Geometry Theorem Provers 7/11 _________________________ Construction written in GCLC: point A cmark_b A point B cmark_b B point C cmark_t C drawsegment A B drawsegment B C drawsegment C A med mab A B med mac A C med mbc B C drawline mab drawline mac drawline mbc intersec M_1 mab mac intersec M_2 mab mbc cmark_rt M_1 cmark_lb M_2 prove {identical M_1 M_2}

Geometry Theorem Provers 8/11 _________________________ Prover output clipping for this example

Geometry Theorem Provers 9/11 _________________________ Prover result for this example

Geometry Theorem Provers 10/11 _________________________ Reimplementation in Java programming language ( based on C++ version by Goran Predović and Predrag Janičić ) Main objectives of this project:  greater portability  ability of integration in other systems for mechanical theorem proving and geometry related software (GeoGebra, Geo Thms etc) Directions for further work:  possible improvements of current implementation by usage of concurrency  implementing Gröbner bases prover

Geometry Theorem Provers 11/11 _________________________ Current state of this project:  Classes for algebraic primitives are almost completed  Prepared utilities for prover output to LaTeX and XML format  Implemented pseudo reminder algorithm; after implementation of simple triangulation algorithm, Wu's method is almost completed  At the end dealing with transformation of GCLC input into polynomial form

Geometry Theorem Provers The End _________________________ Thank you.