A Machine-Checked Direct Proof of the Steiner-Lehmus Theorem

by   Ariel Kellison, et al.

A direct proof of the Steiner-Lehmus theorem has eluded geometers for over 170 years. The challenge has been that a proof is only considered direct if it does not rely on reductio ad absurdum. Thus, any proof that claims to be direct must show, going back to the axioms, that all of the auxiliary theorems used are also proved directly. In this paper, we give a proof of the Steiner-Lehmus theorem that is guaranteed to be direct. The evidence for this claim is derived from our methodology: we have formalized a constructive axiom set for Euclidean plane geometry in a proof assistant that implements a constructive logic and have built the proof of the Steiner-Lehmus theorem on this constructive foundation.



There are no comments yet.


page 1

page 2

page 3

page 4


A simple and constructive proof to a generalization of Lüroth's theorem

A generalization of Lüroth's theorem expresses that every transcendence ...

A proof of Hilbert's theorem on ternary quartic forms with the ladder technique

This paper proposes a totally constructive approach for the proof of Hil...

Windmills of the minds: an algorithm for Fermat's Two Squares Theorem

The two squares theorem of Fermat is a gem in number theory, with a spec...

A Constructive Proof of the Glivenko-Cantelli Theorem

The Glivenko-Cantelli theorem states that the empirical distribution fun...

A Geometric Proof of Calibration

We provide yet another proof of the existence of calibrated forecasters;...

Where are the logs?

The commonly quoted error rates for QMC integration with an infinite low...

Towards a constructive formalization of Perfect Graph Theorems

Interaction between clique number ω(G) and chromatic number χ(G) of a ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.