Probabilistic verification of elementary geometry statements
This paper provides a probabilistic approach to automated theorem proving in elementary geometry. To get a probability estimate of truth of a geometric statement, the familiar Hilbert's Nullstellensatz and Wu's procedure are used as basic tools. To test polynomial identities together with fast algorithms for calculating resultants and Sturm sequences, Schwartz's algorithms are used. The purpose of Wu's procedure is the computation of Wu-Ritt characteristic sets which appear to be important and useful in commutative algebra. Characteristic sets of a given ideal are used for determining a probability bound. The probability approach can be interesting, because it is able to show possible counter-examples to a given statement. Namely, if an exact arithmetic is used, one can verify whether each given example satisfies the corresponding theorem. If this is not the case, the theorem is false and a counter-example is found in this way. For the entire collection see [Zbl 0888.00016].
This page was built for publication: Probabilistic verification of elementary geometry statements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3838773)
