Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Complex remainder separation with quantitative bounds

Proved
PiIrrationality.remainder_separation

by xuanji · Oct 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysiscomplex-numbersdiophantine-approximation

Let z,y,R,U,Tz,y,R,U,Tz,y,R,U,T be complex numbers and let a,ta,ta,t be positive real numbers. Suppose

R−U=(z−y)T,a≤∣U∣,∣R∣≤a/2,∣T∣<t.R-U=(z-y)T,\qquad a\le |U|,\qquad |R|\le a/2,\qquad |T|<t.R−U=(z−y)T,a≤∣U∣,∣R∣≤a/2,∣T∣<t.

Then

a2t<∣z−y∣.\frac{a}{2t}<|z-y|.2ta​<∣z−y∣.

This quantitative form of the remainder-separation step applies to Hermite approximations to logarithms, including Mignotte’s construction at z=iπ/2z=i\pi/2z=iπ/2. The strict coefficient bound yields a strict approximation lower bound.

Preamble
import Mathlib.Analysis.Complex.Basic
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum

set_option autoImplicit false

Formal statement
theorem PiIrrationality.remainder_separation (z y R U T : ℂ) (a t : ℝ)
    (hidentity : R - U = (z - y) * T)
    (ha : 0 < a) (ht : 0 < t)
    (hU : a ≤ ‖U‖) (hR : ‖R‖ ≤ a / 2) (hT : ‖T‖ < t) :
    a / (2 * t) < ‖z - y‖ := by sorry
Source
M. Mignotte, Approximations rationnelles de π et quelques autres nombres, Mém. Soc. Math. France 37 (1974), pp. 123–125, Section II equations (9)–(16). https://www.numdam.org/item/MSMF_1974__37__121_0.pdf (doi:10.24033/msmf.139). General quantitative form of equations (9)–(10), with the lower bound on U and upper bound on T stated explicitly.

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