Chapter

Automated Reasoning and Mathematics

Volume 7788 of the series Lecture Notes in Computer Science pp 139-150

# A Geometric Procedure with Prover9

• Ranganathan PadmanabhanAffiliated withUniversity of Manitoba
• , Robert VeroffAffiliated withUniversity of New Mexico

* Final gross prices may vary according to local VAT.

## Abstract

Here we give an automated proof of the fact that a cubic curve admits at most one group law. This is achieved by proving the tight connection between the chord-tangent law of composition and any potential group law (as a morphism) on the curve. An automated proof of this is accomplished by implementing the rigidity lemma and the Cayley-Bacharach theorem of algebraic geometry as formal inference rules in Prover9, a first-order theorem prover developed by Dr. William McCune.
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9217321872711182, "perplexity": 1285.5950410624253}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917121528.59/warc/CC-MAIN-20170423031201-00349-ip-10-145-167-34.ec2.internal.warc.gz"}