Diophantine approximation · formal theorem

Power-Law Phase Gap for Multiples of log₂ 3

There exists a positive constant c such that every positive integer q satisfies c · q⁻¹³³ᐟ¹⁰ ≤ ‖q log₂ 3‖, the distance to the nearest integer.

Scope: The checked theorem supplies a positive constant c for which c · q⁻¹³³ᐟ¹⁰ ≤ ‖q log₂ 3‖ for every positive integer q.

Lean checkedBuild passed
Unfinished proof stepsNone
PublicationAccepted formal theorem
Rhin phase-gap statement mapOne positive constant gives a global power-law lower bound for the distance from every positive multiple of log base two of three to the nearest integer.
Exact scope: The checked theorem supplies a positive constant c for which c · q⁻¹³³ᐟ¹⁰ ≤ ‖q log₂ 3‖ for every positive integer q.

Exact formal proposition

Hypotheses and conclusion

This is the exact recorded theorem statement, followed by the source definitions that give its named predicates and quantities their full meaning.

theorem existsPhaseGapRhin : ∃ c : ℝ, PhaseGap c (143 / 10 : ℝ)
Definitions used in this proposition

PhaseGap

structure PhaseGap (c kappa : ℝ) : Prop where
  c_pos : 0 < c
  c_le_one : c ≤ 1
  two_lt_kappa : 2 < kappa
  gap : ∀ q : ℕ, 0 < q →
    c * Real.rpow (q : ℝ) (1 - kappa) ≤
      nearestIntegerNorm ((q : ℝ) * logTwoThree)
Open main Lean file

The theorem at a glance

Rhin phase gap at a glance

Ivory editorial poster for the Rhin phase-gap theorem, with the global nearest-integer inequality, one identified integer phase and scattered fractional phases around a modulo-one circle, large-height and finite-height proof movements, and exact scope.
Rhin's large-height estimate and finite absorption produce one positive global power-law phase-gap witness.

Accessible transcript

∃ c > 0, ∀ q ≥ 1, c · q^(-133/10) ≤ ‖q log₂ 3‖

The proof controls all sufficiently large q through an explicit linear-form estimate, takes a positive normalized minimum over the finitely many smaller q, and chooses one witness c valid in both ranges.

Read the complete poster transcript

DIOPHANTINE APPROXIMATION · LOG₂ 3

A POWER-LAW GAP FROM THE INTEGERS

THERE EXISTS c > 0 SUCH THAT FOR EVERY q ≥ 1

c · q^(-133/10) ≤ ‖q log₂ 3‖

‖x‖ = distance from x to the nearest integer

0 ≡ 1 mod 1

× log₂ 3 mod 1

≥ c · q^(-133/10)

HOW THE PROOF MOVES

1 · LARGE HEIGHTS

Rhin's explicit linear-form estimate controls every sufficiently large q.

2 · FINITE HEIGHTS

The finitely many smaller positive q have a positive minimum normalized gap.

3 · ABSORB THE TWO RANGES

Take one positive witness c that works globally.

EXACT SCOPE

c is existential, not numerically exposed. The gap shrinks with q. This does not assert a fixed separation, equidistribution, or a Collatz theorem. The downstream exponent condition is strict: d < 5/143.

Theorem schematic

A global power-law phase gap

Scientific figure illustrating: One positive witness keeps every positive multiple of log₂ 3 at least a power-law distance from the nearest integer.
One positive witness keeps every positive multiple of log₂ 3 at least a power-law distance from the nearest integer.

∃ c > 0, ∀ q ≥ 1, c · q^(-133/10) ≤ ‖q log₂ 3‖

There exists c > 0 such that c · q^(-133/10) is no greater than the nearest-integer distance of q log₂ 3 for every q ≥ 1. The witness is existential and the separation shrinks with q.

Result boundary

What this theorem does—and does not—establish

The checked theorem supplies a positive constant c for which c · q⁻¹³³ᐟ¹⁰ ≤ ‖q log₂ 3‖ for every positive integer q.

About these visual explanations

These AI-generated visuals explain the theorem and proof route; they are not proof evidence. Their publication review was completed separately from review of the formal result. The exact Lean proposition and checked source remain authoritative.

Line counts exclude blank lines; comments and documentation count. The total is the commit-pinned first-party Lean import closure; Mathlib and other third-party dependencies are excluded.

Continue the mathematics

Open questions and extensions

The pinned theorem and its complete local import closure let people and AI agents inspect the proof, compare another route, isolate reusable lemmas, or formulate a stronger exact statement. Lean checks each proposed extension against its own exact statement.

What the source ZIP contains

The ZIP contains the checked first-party Lean import closure, exact statements and boundaries, license, notice, evidence, source-footprint manifest, and continuation data. Mathlib and other third-party dependencies are not bundled.

Publication review

Review record

Publication reviews accepted

Lean checks the exact proof. Accepted review records cover evidence completeness, statement alignment, scope, and public wording; the visual review covers explanation only.

01

Formal evidence

The formal-evidence review accepted the recorded build, exact declarations, unfinished-step scan, and axiom evidence.

02

Statement alignment

The formal declaration was accepted against the named theorem and its exact variant.

03

Result boundary

The accepted boundary keeps nearby stronger or commonly confused claims out of scope.

04

Public wording

The public-wording review accepted the retained theorem explanation and source presentation. Generated media follows a separate review and promotion gate.

05

Canonical source

The first-party source link is pinned to the checked package commit and exact Lean file.

06

Accepted result

A validated accepted-result record binds the four reviews to the checked formalization.

Expanded visual

Open original image