Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Negative reciprocal: first step of the Euclidean descent (quotient)

Proved
burau_cf_ediv_neg_ge_one

by lt9 · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

continued-fractionseuclidean-algorithmreciprocity

First step of the negative-reciprocal rule of continued fractions (quotient form). If a>0a>0a>0 and the leading quotient of the continued fraction of b/ab/ab/a is at least 111 — equivalently b≥ab\ge ab≥a — then the Euclidean quotient of −a-a−a by bbb is −1-1−1:

−ab=−1.\frac{-a}{b} = -1 .b−a​=−1.

Combined with the companion remainder identity (−a) mod b=b−a(-a)\bmod b=b-a(−a)modb=b−a this says that the descent of the pair (b,−a)(b,-a)(b,−a) starts with the quotient −1-1−1 and continues from the pair (b−a,b)(b-a,b)(b−a,b), which is the mechanism by which the two Euclidean descents used in the SL(2,Z)\mathrm{SL}(2,\mathbb Z)SL(2,Z) 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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me