Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

∥a/q∥>0\|a/q\|>0∥a/q∥>0 when q∤aq\nmid aq∤a

Proved
CircleMethod.nrm_div_pos_of_not_dvd

by tabbott · Sep 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorycircle-methodexponential-sumsnumber-theory

If q≥1q\ge1q≥1 does not divide aaa then a/qa/qa/q is not an integer, so

q∤a ⟹ ∥aq∥>0.q\nmid a\ \Longrightarrow\ \left\|\frac{a}{q}\right\|>0.q∤a ⟹ ​qa​​>0.

In fact ∥a/q∥≥1/q\|a/q\|\ge 1/q∥a/q∥≥1/q, though only positivity is asserted here. This is the hypothesis under which the fundamental bound ∣∑x<Ne(xa/q)∣≤12∥a/q∥\left|\sum_{x<N}e(xa/q)\right|\le\frac{1}{2\|a/q\|}​∑x<N​e(xa/q)​≤2∥a/q∥1​ may be applied at a rational point, and it separates the non-trivial residues from the trivial one in the analysis of complete exponential sums.

Preamble
import Definitions.Def_CircleMethod_char
open Finset
Formal statement
namespace CircleMethod

theorem nrm_div_pos_of_not_dvd {q : ℕ} (hq : 0 < q) {a : ℤ} (h : ¬ (q : ℤ) ∣ a) :
    0 < nrm ((a : ℝ) / (q : ℝ)) := by sorry

end CircleMethod
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Sections 1.1 and 2.1 (generating functions, the distance-to-nearest-integer norm, and complete exponential sums over Z/qZ).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me