k-Equivalence Relations and Associated Algorithms

02/09/2021

∙

by   Daniel Selsam, et al.

∙

Microsoft

∙

University of Pittsburgh

∙

0

∙

share

Lines and circles pose significant scalability challenges in synthetic geometry. A line with n points implies n 3 collinearity atoms, or alternatively, when lines are represented as functions, equality among n 2 different lines. Similarly, a circle with n points implies n 4 cocyclicity atoms or equality among n 3 circumcircles. We introduce a new mathematical concept of k-equivalence relations, which generalizes equality (k=1) and includes both lines (k=2) and circles (k=3), and present an efficient proof-producing procedure to compute the closure of a k-equivalence relation.