Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Exists small descent multiplier

Proved
D1Bound5.exists_small_descent_multiplier

by tp · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

diophantine-tuplesnumber-theory

A reciprocal pair of complex multipliers with the indicated trace bound has one multiplier strictly inside the disk of radius one fifth.

Preamble
import Mathlib.Algebra.Ring.Basic
import Mathlib.Algebra.Ring.Equiv
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.Complex.Polynomial.Basic
import Mathlib.Data.Finset.Card
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring

Formal statement
section
namespace D1Bound5


theorem _root_.D1Bound5.exists_small_descent_multiplier (p r0 : ℂ)
    (hr0 : r0^2 = p+1) (hhyper : 7 ≤ ‖2*p+1‖^2) :
    ∃ eta : ℂ, eta^2 = p ∧ ‖2*p+1-2*r0*eta‖ < (1/5 : ℝ) := by sorry



end D1Bound5
end
Source
D1Bound5/DescentNorm.lean, lines 7-46, SHA-256 e450f6421d89ae185f5175e96fab77ed2aaba23eeb69a15bfdb754a53e2854b4. Project: https://github.com/tomislav-math/d1-bound5-lean

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