bibkey: faveri2026fixedorder authors: Alexandre de Faveri year: 2026 title: Optimal large sieve for fixed order characters doi: null url: https://arxiv.org/abs/2610.04045v1 claim: Theorem 1.1 gives an n-th-power-free large sieve for fixed-order Hecke characters over number fields containing the n-th roots of unity; applying it to the project’s complete sextic signed packet requires additional reciprocity, weight, and source-restoration checks. strata_touched: [] license: citation-only triage: anchor
Optimal large sieve for fixed order characters
The source is arXiv:2610.04045v1, submitted 2 October 2026. This card records the statement of Theorem 1.1 and the conditions relevant to the FIB sextic interface. It is a preprint; no independent proof audit, Lean verification, or claim about the Robin problem is made here.
The theorem fixes , a number field containing the -th roots of unity, and a finite set containing the places above such that the ring of -integers has class number one. The family is built from fixed ray data. Its reciprocity law has the form
where the phase depends only on the two ray-class images. Thus the theorem permits a finite ray-class decomposition; it does not permit an unqualified exchange of the two arguments.
The large-sieve statement
Let , let contain the -th roots of unity, and fix the finite set of places and ray data used to construct the family of -th order Hecke characters . With denoting the operator norm in which both the parameter and the inner variable range over -th-power-free ideals, Theorem 1.1 states
The theorem is therefore available in principle for over the Eisenstein field, which contains the sixth roots of unity. Its hypotheses concern the specified Hecke-character family and ideal norms; they do not supply a result for an arbitrary row weight or an arbitrary signed subpacket.
The possible FIB interface
The active carrier expression in the current native packet is
The existing sextic packet analysis already records the primary-generator choice, the unit and modulus-36 finite Fourier factors, the root-number transport, and the source decomposition ] Those results are the reusable local input for this interface. They do not yet identify the project’s transported character, with all its zero extensions and masks, with the particular ray-data family fixed in de Faveri’s definition, so the reciprocity step remains an interface obligation rather than a second derivation of the local formulas.
If the five radicals are actual pairwise-coprime squarefree ideals, then every prime valuation of is in , so is sixth-power-free. Freezing and applying the theorem in the direction gives the four formal output scales
Combining those scales with the already recorded carrier count produces the source-conditional exponent envelope
This is an arithmetic comparison of exponents. It becomes an analytic estimate only after the source packet has been shown to satisfy every hypothesis below.
Conditions that remain open for this application
The project has the character in the orientation , while the theorem is stated for . Sextic reciprocity gives a finite ray-class phase relating them on the coprime locus, but that phase must be partitioned and transported together with the original units, conjugate orientation, and all zero extensions. The extra fixed factors already present in the source row also have to be included before the row parameter is declared sixth-power-free.
The theorem is an operator bound with a coefficient vector in the inner variable. The native packet additionally contains the original Möbius coefficients, moving masks, common smooth profiles, and a complete signed pair of parent columns. It is necessary to prove that these weights can be fixed or decomposed without a new polynomial loss, and that polarization or an equivalent argument preserves the complete signed restoration.
There is also a direction-of-use constraint. The existing sextic packet invokes a fixed- estimate of the shape
Theorem 1.1 does not imply this pointwise estimate by substitution. At most, after a valid reciprocity and duality step, it gives a bound of the form
with the complete inner range and its sixth-power-free support included. A proof using de Faveri must therefore keep the whole compatible -family (or pay and record the reduction to it); it cannot silently replace the fixed- input in the existing row estimate.
Finally, the frozen carrier sums must be performed on the same actual realization. Independent optimization of the five carrier boxes would not establish a bound for the jointly constrained source. Until these reciprocity, sixth-power-free, profile, restoration, and joint-count steps are supplied, the figure is only a conditional interface calculation. It does not prove the native Robin estimate, Robin’s inequality, or the Riemann hypothesis.