bibkey: fibcharacter2026bohrbarrier authors: trureturing research synthesis year: 2026 title: Bohr phase boxes and weighted characters at a fixed Fibonacci modulus doi: null url: https://arxiv.org/abs/1011.0107v2 claim: “Classical Bohr capacity supplies simultaneous phase alignment. Applied to the full divisor-increment law, it obstructs uniform nonprincipal-character decay at the Robin budget scale; it does not settle actual weighted residue hits.” strata_touched: [] license: citation-only triage: anchor
Bohr phase boxes and the actual residue target
The classical ingredients below are distinguished from the parameter-dependent application in §§220–222 of the FIB theory. The application is a paper derivation, with no Lean verification or originality claim. The fixed-modulus joint-weight interface is also recorded in the complementary-divisor note.
Primary sources and exact scope
Tom Sanders, On the Bogolyubov–Ruzsa lemma, arXiv:1011.0107v2 (2012), original PDF.
Section 5, Lemma 5.1 (PDF p.8) bounds the measure of intersections of Bohr sets. Equation (5.2) and the discussion on p.9 give the one-frequency estimate and explain the usual multiple-frequency lower bound. The paper points to Tao–Vu, Additive Combinatorics, Lemma 4.20, and distinguishes its chord-distance definition from the book’s phase-distance definition. The book is a bibliographic pointer here; the explicit phase-box argument below supplies the constants used in the FIB application.
Jonathan Hermon and Sam Olesker-Taylor, Cutoff for Almost All Random Walks on Abelian Groups, arXiv:2102.02809v2 (2025), original text, §2.6.
Section 2.6, “Lower Bound on Total-Variation Mixing”, proves the lower bound in Theorem 2.5 for every fixed choice of generators. Its proof explicitly fixes the generators instead of averaging over them. A source distribution concentrated on a small set of likely exponent vectors has an image supported on at most that many group elements. Random-generator upper bounds elsewhere in the paper do not establish mixing for the deterministic small-prime residues used here.
The elementary abstract interface is as follows. Let be a probability on a countable source, let map that source to a group of order , and let
Then and , so
No suitable high-probability source-entropy estimate for the present increment law is supplied here. In particular, this source does not establish that its total variation tends to one.
Finite simultaneous phases
Let be any finite abelian group of order , and choose . Partition the circle into equal half-open arcs. The characters occupy at most phase boxes at these elements. A largest box contains at least characters. Dividing its characters by one fixed member produces that many distinct characters with
This is a near-annihilator Bohr set in the dual group. It includes the principal character; the capacity comparison is needed to ensure another one. Neither generation of the group nor independence of the phase coordinates is required.
For the actual FIB application, with prime , , , , and . Every prime divisor of is at least , so all are units eventually. Here , , , and gives at least aligned characters.
The actual increment law is
Its unit-conditioned pushforward is ; for Dirichlet characters extended by zero off the units, , where . Section 222 combines the phase count with the genuine exponent second moment and the large-prime tail to derive
for exponentially many nonprincipal characters. The classical Bohr count alone does not give this weighted estimate; the local increment and tail controls are necessary.
The existing Kronecker note describes torus orbit closures, not this growing finite character count. The existing PrimeOnlyNoGap source treats a fixed summable jump law and integer Fourier modes. A return there may be trivial after passage to a finite quotient; it does not by itself give the nonprincipal characters or their number required here.
What the actual kernel asks of the characters
Take the same actual interval , with , and . Let , , and . For each positive integer set
For nonnegative weights , define the actual hit sum
Each divisor hits at most once: a hit makes a unit modulo , and . For the actual complementary factor , character orthogonality therefore gives
The retained kernel uses . Additional restrictions on the same product must stay inside the joint sum; a condition depending on cannot automatically be absorbed into alone.
Writing , the exact target is equivalent to
It asks for a signed aggregate with moving intervals. A uniform bound on every character is stronger. Large moduli of the full Euler coefficients do not imply a large mass at residue one, an inverse residue, or an actual multiplier. Conversely, truncation to , a cap on , and the kernel destroy the simple full Euler-product identification. Neither upper nor lower modulus estimates for that product transfer without a separate argument.
A fixed-modulus short-factor fourth moment
For a fixed unit subset with , put . Orthogonality gives
Both products lie in , so each congruence is an integer equality. Write , with ; equality then forces , . Consequently
This elementary multiplicative-energy estimate needs no prime-modulus assumption. For a fixed interval and , Hölder yields
The core spectral moment has not been bounded at the required scale. The original intervals also move with ; using fixed rectangles requires explicit coverage and boundary errors. Enlarging a nonnegative hit set gives an upper bound, not an equality. These standard identities identify a possible aggregate estimate without supplying it or solving Robin for the full FIB family.