Abstract
Two methods for polynomial factorization over algebraic extension fields are reviewed. It is explained how geometric theorems may be proved by using irreducible zero decomposition for which algebraic factoring is necessary. A set of selected geometric theorems are taken as examples to illustrate how algebraic factoring can help understand the ambiguity of a theorem and prove it even if its algebraic formulation does not precisely correspond to the geometric statement. Among the polynomials occurring in our examples which need to be algebraically factorized, 12 are presented. Experiments with the two factoring methods for these polynomials are reported in comparison with the Maple's built-in factorizer. Our methods are always faster and any of the 12 polynomials can be factorized within 40 CPU seconds on a SUN SparcServer 690/51. Timings for proving the example theorems are also provided.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abbott, J. A.: On the factorization of polynomials over algebraic fields. Ph.D thesis. School of Math. Scis., Univ. of Bath, England (1989).
Chou, S. C.: Proving elementary geometry theorems using Wu's algorithm. In: Automated theorem proving: after 25 years, Contemp. Math. 29 (1984) 243–286.
Chou, S. C.: Mechanical geometry theorem proving. D. Reidel Publ. Co., Dordrecht-Boston-Lancaster-Tokyo (1988).
Chou, S. C., Gao, X. S.: Ritt-Wu's decomposition algorithm and geometry theorem proving. In: Proc. CADE-10, Lecture Notes in Comput. Sci. 449 (1990) 207–220.
Gao, X. S.: Transcendental functions and mechanical theorem proving in elementary geometries. J. Automat. Reason. 6 (1990) 403–417.
Hu, S., Wang, D. M.: Fast factorization of polynomials over rational number field or its extension fields. Kexue Tongbao 31 (1986) 150–156.
Landau, S.: Factoring polynomials over algebraic number fields. SIAM J. Comput. 14 (1985) 184–195.
Lenstra, A. K.: Lattices and factorization of polynomials over algebraic number fields. In: Proc. EUROCAM'82, Marseille (1982) 32–39.
Lenstra, A. K.: Factoring multivariate polynomials over algebraic number fields. SIAM J. Comput. 16 (1987) 591–598.
Ritt, J. F.: Differential algebra. New York: Amer. Math. Soc. (1950).
Trager, B. M.: Algebraic factoring and rational function integration: In: Proc. ACM Symp. Symb. Algebraic Comput., Yorktown Heights (1976) 219–226.
Wang, D. M.: Mechanical approach for polynomial set and its related fields (in Chinese). Ph.D thesis. Academia Sinica, China (1987).
Wang, D. M.: On Wu's method for proving constructive geometric theorems. In: Proc. IJCAI-89, Detroit (1989) 419–424.
Wang, D. M.: Characteristic sets and zero structure of polynomial sets. Lecture notes. RISC-LINZ, Joh Kepler Univ., Austria (1989).
Wang, D. M.: Irreducible decomposition of algebraic varieties via characteristic sets and Gröbner bases. Comput. Aided Geom. Design 9 (1992) 471–484.
Wang, D. M.: A method for factorizing multivariate polynomials over successive algebraic extension fields. Preprint. RISC-LINZ, Joh Kepler Univ., Austria (1992).
Wang, D. M.: An elimination method for polynomial systems. J. Symb. Comput. 16 (1993) 83–114.
Wang, P. S.: Factoring multivariate polynomials over algebraic number fields. Math. Comput. 30 (1976) 324–336.
Weinberger, P. J., Rothschild, L. P.: Factoring polynomials over algebraic number fields. ACM Trans. Math. Software 2 (1976) 335–350.
Wu, W. T.: Basic principles of mechanical theorem proving in elementary geometries. J. Syst. Sci. Math. Sci. 4 (1984) 207–235.
Wu, W. T.: Basic principles of mechanical theorem proving in geometries (Part on elementary geometries, in Chinese). Beijing: Science Press (1984).
Wu, W. T.: On reducibility problem in mechanical theorem proving of elementary geometries. Chinese Quart. J. Math. 2 (1987) 1–20.
Wu, W. T., Lu, X. L.: Triangles with equal bisectors (in Chinese). Beijing: People's Education Press (1985).
Yang, L., Zhang, J. Z.: Searching dependency between algebraic equations: an algorithm applied to automated reasoning. MM Res. Preprints 7 (1992) 105–114.
Yang, L., Zhang, J. Z., Hou, X. R.: An efficient decomposition algorithm for geometry theorem proving without factorization. MM Res. Preprints 9 (1993) 115–131.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, D. (1994). Algebraic factoring and geometry theorem proving. In: Bundy, A. (eds) Automated Deduction — CADE-12. CADE 1994. Lecture Notes in Computer Science, vol 814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58156-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-58156-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58156-7
Online ISBN: 978-3-540-48467-7
eBook Packages: Springer Book Archive