Negative reciprocal: first step of the Euclidean descent (quotient)
Provedburau_cf_ediv_neg_ge_onecontinued-fractionseuclidean-algorithmreciprocity
First step of the negative-reciprocal rule of continued fractions (quotient form). If and the leading quotient of the continued fraction of is at least — equivalently — then the Euclidean quotient of by is :
Combined with the companion remainder identity this says that the descent of the pair starts with the quotient and continues from the pair , which is the mechanism by which the two Euclidean descents used in the continued-fraction section merge.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem burau_cf_ediv_neg_ge_one (a b : ℤ) (ha : 0 < a) (h : 1 ≤ b / a) :
(-a) / b = -1 := by sorry
Source
Euclidean continued fractions; cf. A. Ya. Khinchin, *Continued Fractions* (1964), Ch. II.