Over the whole rational orbit the quantisation bound says exactly that Re u is non-zero
ProvedDiaz.quantisation_orbit_iff_re_ne_zeroStatement. Let lie on a line with
--- the real branch of the manuscript, where is real. Assert
the conclusion of Diaz.order_quantisation at every point of the rational orbit and for
every admissible order :
That whole family is equivalent to the single condition .
No algebraicity hypothesis is used in either direction. So on this branch the quantisation bound, asserted everywhere it can be asserted, is exactly as strong as a hypothesis the configuration already grants, and no stronger.
Source and attribution. All the mathematics of this section is Carlo Perassi's, in his manuscript C. Perassi, Rigidity of logarithms with algebraic modulus — Around a conjecture of Diaz, unpublished manuscript, 15 August 2026, §Polar coordinates and the discreteness of the period. No novelty is claimed. The two halves are Theorem Quantisation of the real
branch (thm:real-quantisation), which gives on
and observes that stays in only when , and
Corollary Effective lower bound in the torsion branch (cor:degree-quantisation), published
here as Diaz.order_quantisation. What this node adds is the equivalence --- that the family
over the whole orbit collapses to , hence contributes nothing beyond it. That
converse direction is possibly new and is in any case small; it is possibly folklore, and it was
not found stated in the sources consulted.
Why it is on the board. It is a negative result and it is meant as one. Anyone reaching for the quantisation group to constrain the real branch --- the natural first move, since it is the only published family that speaks about exactly this configuration --- can read off here that the attempt cannot succeed, without re-running the search.
Proof. () If , take ; then has real part and
imaginary part , the order- hypothesis holds by
Diaz.exp_ratio_pow_eq_one_iff, and the conclusion reads .
() Given , unwrap the hypothesis with
Diaz.exp_ratio_pow_eq_one_iff to ; here forces
, so and , while
supplies the strictness.
import Mathlib open ComplexConjugate
theorem Diaz.quantisation_orbit_iff_re_ne_zero {u : ℂ} {k : ℤ} (hk : k ≠ 0)
(him : u.im = (k : ℝ) * Real.pi) :
(∀ q : ℚ, q ≠ 0 → ∀ m : ℕ, 0 < m →
(Complex.exp ((q : ℂ) * u) / conj (Complex.exp ((q : ℂ) * u))) ^ m = 1 →
Real.pi ^ 2 / (m : ℝ) ^ 2 < Complex.normSq ((q : ℂ) * u))
↔ u.re ≠ 0 := by sorry