GeoProof: A user interface for formal proofs in geometry. Julien - - PowerPoint PPT Presentation

geoproof a user interface for formal proofs in geometry
SMART_READER_LITE
LIVE PREVIEW

GeoProof: A user interface for formal proofs in geometry. Julien - - PowerPoint PPT Presentation

GeoProof: A user interface for formal proofs in geometry. Julien Narboux under the supervision of Hugo Herbelin INRIA-Futurs, LIX, Ecole Polytechnique UITP 2006, Seattle Plan 1 Related work and motivations 2 A general presentation of


slide-1
SLIDE 1

GeoProof: A user interface for formal proofs in geometry.

Julien Narboux

under the supervision of Hugo Herbelin

INRIA-Futurs, LIX, ´ Ecole Polytechnique

UITP 2006, Seattle

slide-2
SLIDE 2

Plan

1 Related work and motivations 2 A general presentation of GeoProof 3 Proof related features 4 Future work

slide-3
SLIDE 3

Dynamic Geometry.

There are quite many dynamic geometry software :

slide-4
SLIDE 4

Dynamic Geometry.

There are quite many dynamic geometry software : Baghera, Cabri Euclide, Cabri Geometer, CaR, Chypre, Cinderella, D´ eclic, D´ efi, Dr. Geo, Euclid, Euklid DynaGeo, Eukleides, Gava, GCLC, GeoExp, GeoFlash, GeoLabo, Geometria, Geometrix, Geometry Explorer, Geometry Tutor, GeoPlanW, GeoSpaceW, GEUP, GeoView, GEX, GRACE, KGeo, KIG, Non-Euclid, Sketchpad, XCas . . .

slide-5
SLIDE 5

Dynamic Geometry.

But few can deal with proofs : Baghera, Cabri Euclide, Cabri Geometer, CaR, Chypre, Cinderella, D´ eclic, D´ efi, Dr. Geo, Euclid, Euklid DynaGeo, Eukleides, Gava, GCLC, GeoExp, GeoFlash, GeoLabo, Geometria, Geometrix, Geometry Explorer, Geometry Tutor, GeoPlanW, GeoSpaceW, GEUP, GeoView, GEX, GRACE, KGeo, KIG, Non-Euclid, Sketchpad, XCas . . .

slide-6
SLIDE 6

1 - Interactive proof systems using a base of lemmas

  • Baghera,
  • Cabri-Euclide,
  • Chypre,

efi,

  • Geometrix,
  • Geometry Tutor
slide-7
SLIDE 7

1 - Interactive proof systems using a base of lemmas 2 - Interfaces for an ATP

Cinderella Probalistic method, no proof shown. GCLC Implementation of the area method. Geometry Explorer Implementation of the full angle method using prolog, and visualization of the proofs in a diagrammatic way. GEX/Geometer Implementation of the area method, of Wu’s method and of deductive database methods, visualization of statements only.

slide-8
SLIDE 8

1 - Interactive proof systems using a base of lemmas 2 - Interfaces for an ATP

Cinderella Probalistic method, no proof shown. GCLC Implementation of the area method. Geometry Explorer Implementation of the full angle method using prolog, and visualization of the proofs in a diagrammatic way. GEX/Geometer Implementation of the area method, of Wu’s method and of deductive database methods, visualization of statements only. GeoView Uses GeoPlan and Pcoq to visualize statements .

slide-9
SLIDE 9

GeoProof combines these features:

  • dynamic geometry
  • automatic theorem proving
  • interactive theorem proving (using Coq)
slide-10
SLIDE 10

Motivations

  • The use of a proof assistant provides a way to combine

geometrical proofs with larger proofs (involving induction for instance).

slide-11
SLIDE 11

Motivations

  • The use of a proof assistant provides a way to combine

geometrical proofs with larger proofs (involving induction for instance).

  • There are facts than can not be visualized graphically and

there are facts that are difficult to understand without being visualized.

slide-12
SLIDE 12

Motivations

  • The use of a proof assistant provides a way to combine

geometrical proofs with larger proofs (involving induction for instance).

  • There are facts than can not be visualized graphically and

there are facts that are difficult to understand without being visualized.

  • We should have both the ability to make arbitrarily complex

proofs and use a base of known lemmas.

slide-13
SLIDE 13

Motivations

  • The use of a proof assistant provides a way to combine

geometrical proofs with larger proofs (involving induction for instance).

  • There are facts than can not be visualized graphically and

there are facts that are difficult to understand without being visualized.

  • We should have both the ability to make arbitrarily complex

proofs and use a base of known lemmas.

  • The verification of the proofs by the proof assistant provides a

very high level of confidence.

slide-14
SLIDE 14

A quick overview of GeoProof

  • Written using
  • caml and

lablgtk2.

  • Distributed

under the GPL2 licence.

  • Multi-

platform. http://home.gna.org/geoproof/

slide-15
SLIDE 15

Dynamic geometry features

  • points, lines, circles, vectors,

segments, intersections, perpendicular lines, perpendicular bisectors,angle

  • bisectors. . .
  • central symmetry, translation

and axial symmetry

  • traces
  • text labels with dynamic

parts:

  • measures of angles,

distances and areas

  • properties tests (collinear-

ity,orthogonality,. . . )

  • layers
  • Computations use arbitrary

precision

  • Input: XML
  • Output: XML, natural

language, SVG, PNG, BMP, Eukleides (latex), Coq

Missing features:

  • loci and conics
  • macros
  • animations
slide-16
SLIDE 16

Proof related features

1 Automatic proof using an embedded ATP 2 Automatic proof using Coq 3 Interactive proof using Coq

slide-17
SLIDE 17

Automatic proof using the embedded ATP

We need to perform a translation from a theory based on circles, lines and points to a theory based only on points.

slide-18
SLIDE 18

l passing through A and B P1(l) = A P2(l) = B l parallel line to m passing through A P1(l) = A P2(l) = P2l l perpendicular to m passing through A P1(l) = A P2(l) = P2l l perpendicular bisector of A and B P1(l) = P1l P2(l) = P2l c circle of center O passing through A O(c) = O P(c) = A c circle passing through A,B and C O(c) = Oc P(c) = A c circle whose diameter is A B O(c) = Oc P(c) = A

slide-19
SLIDE 19

Point P on line l collinear(P, P1(l), P2(l)) I intersection of l1 and l2 collinear(I, P1(l1), P2(l1))∧ collinear(I, P1(l2), P2(l2))∧ ¬parallel(P1(l1), P2(l1), P1(l2), P2(l2)) l perpendicular bisector of AB P1(l)A = P1(l)B ∧ P2(l)A = P2(l)B∧ P1(l) = P2(l) ∧ A = B

slide-20
SLIDE 20
slide-21
SLIDE 21

Dealing with non-degeneracy conditions

  • Non degeneracy conditions play a crucial role in formal

geometry.

  • GeoProof allows to build a formula not a model of this

formula.

  • The user can define impossible figures.
slide-22
SLIDE 22
slide-23
SLIDE 23

Automatic proof using Coq

  • Based on our formalization of the area method in Coq.
  • Constructive theorems in affine plane geometry.
slide-24
SLIDE 24
slide-25
SLIDE 25

Interactive proof using Coq

Init

  • Construction
  • Goal

Definition

  • Proof
slide-26
SLIDE 26

Interactive proof using Coq

Init

  • Construction
  • Goal

Definition

  • Proof
  • GeoProof loads the library (Guilhot or Narboux) and updates

the interface.

slide-27
SLIDE 27

Interactive proof using Coq

Init

  • Construction
  • Goal

Definition

  • Proof
  • GeoProof loads the library (Guilhot or Narboux) and updates

the interface.

  • It translates each construction as an hypothesis in Coq syntax.
slide-28
SLIDE 28

Interactive proof using Coq

Init

  • Construction
  • Goal

Definition

  • Proof
  • GeoProof loads the library (Guilhot or Narboux) and updates

the interface.

  • It translates each construction as an hypothesis in Coq syntax.
  • It translates the conjecture into Coq syntax.
slide-29
SLIDE 29

Interactive proof using Coq

Init

  • Construction
  • Goal

Definition

  • Proof
  • GeoProof loads the library (Guilhot or Narboux) and updates

the interface.

  • It translates each construction as an hypothesis in Coq syntax.
  • It translates the conjecture into Coq syntax.
  • It translates each construction into the application of a tactic

to prove the existence of the newly introduced object.

slide-30
SLIDE 30

Future work

  • Synchronization between GUIs

Coq GeoProof Isabelle PG Broker

  • PGIP
  • PGIP
  • PGIP
  • PGIP
  • PGIP
  • PGIP
  • PCoq

. . . CoqIDE

slide-31
SLIDE 31

Future work

  • Synchronization between GUIs
  • Diagrammatic proofs
  • in geometry
  • in abstract term rewriting [Nar06]
slide-32
SLIDE 32

Future work

  • Synchronization between GUIs
  • Diagrammatic proofs
  • in geometry
  • in abstract term rewriting [Nar06]
  • Integration with GeoThms
slide-33
SLIDE 33

Give it a try ! http://home.gna.org/geoproof/ Thank you!

slide-34
SLIDE 34

Yves Bertot, Fr´ ed´ erique Guilhot, and Lo¨ ıc Pottier. Visualizing geometrical statements with GeoView. Electronic Notes in Theoretical Computer Science, 103:49–65, September 2003. Xian-Shan Gao and Qiang Lin. MMP/Geometer - a software package for automated geometry reasoning. In F. Winkler, editor, Proceedings of ADG 2002, Lecture Notes in Computer Science, pages 44–46. Springer-Verlag, 2002. Ulrich Kortenkamp. Foundations of Dynamic Geometry. PhD thesis, ETH Z¨ urich, 1999. Ulrich Kortenkamp and J¨ urgen Richter-Gebert. Using automatic theorem proving to improve the usability of geometry software. In Mathematical User Interface, 2004.

slide-35
SLIDE 35

Julien Narboux. A formalization of diagrammatic proofs in abstract rewriting. 2006. J¨ urgen Richter-Gebert and Ulrich Kortenkamp. Die interaktive geometrie software cinderella book and cd-rom. German school-edition of the Cinderella software, 1999. http://cinderella.de. Jacob T. Schwartz. Probabilistic algorithms for verification of polynomial identities. In Symbolic and algebraic computation, volume 72 of Lecture Notes in Computer Science, pages 200–215, Marseille, 1979. Springer-Verlag.