~/talk

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

Talkat CPP 2022 · 2022-01-17..01-18
slides:none on file

States a direct constructive proof of the Steiner–Lehmus theorem that is fully machine-checked inside a constructive proof assistant, avoids the law of excluded middle, and grounds geometry on a new set of constructive axioms with constructive reals. Formalization derives 28 of the 48 propositions from Book I and assembles roughly about 1500 proof objects, builds a parallelogram and case splits on stable conclusions, and runs entirely inside the New Pearl environment so no classical hidden steps remain.

AI-written summary · about

  1. 0:00Start
  2. 1:31Law of Excluded Middle
  3. 2:12Controversy over Direct Proof
  4. 7:25Construction Postulates
  5. 22:01Why Is Constructive Reasoning Important
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.