Nested Conductors Make the Complete Character Lift Refinement-Compatible
Cofinal conductor tower
For the label cutoff
choose
Then:
- , so reduction modulo is injective on ;
- , so the conductors form a nested cofinal tower.
Let
The complete character analysis at level is the discrete Fourier transform of the coefficient packet extended by zero to .
Exact refinement law
Write
Every coarse character is exactly a fine character:
Therefore extension of an old label packet by zero and restriction of the fine analysis to the embedded coarse frequencies commute exactly.
The diagram joining:
- old coefficient synthesis;
- extension by zero;
- coarse Fourier analysis;
- fine Fourier analysis;
- restriction to coarse frequencies
is strictly commutative.
No fitted normalization is needed when each finite Fourier transform uses the normalized Haar pairing on its cyclic group.
Finite uniqueness survives refinement
At every level, the complete character table is injective on the retained labels. Suppose two proposed finite lifts agree on every character row and are compatible with refinement. Fourier inversion makes them equal at each level, and refinement makes those equalities one pro-system.
Thus the affine covector-selector torsor exposed by Strominger cannot survive inside the angular pro-object. A shear invisible to one chosen Ramanujan row is detected by some other character row at the same level or by a successor character after refinement.
Profinite interpretation
The cyclic character systems assemble into the standard character pairing between the profinite integer carrier and its torsion dual. Integer labels embed as Dirac distributions, and their finite Fourier shadows are compatible under every conductor refinement.
This is the analysis-side version of the earlier result that all Ramanujan packets are shadows of one Schwartz--Bruhat distribution.
The angular finite-adelic completion is therefore canonical and faithful on the algebraic label packet.
What remains outside the theorem
Mellin transport also carries radial valuation size. The infinite coefficient packet may fail to define a vector in a chosen radial Hilbert topology even when every angular shadow is faithful.
Consequently the remaining completion problem is not a conductor-choice torsor. It lies in:
- radial valuation/Fock growth;
- primitive and square boundary currents;
- continuity of connectedization;
- the topology coupling radial data to the angular distribution.
The angular and radial gates must not be conflated.
Consequence for scalar zeros
At every finite level and throughout the compatible angular pro-system, the full labelled packet remains distinguishable. Scalar Mellin darkness is projection interference, not loss created by conductor completion.
A zero-selection theorem must therefore use the radial dynamics or a cycle coupling radial transport to angular character analysis. More angular ports cannot orient the scalar crossing; they only prove that the hidden packet is still present.
Next source cycle
The smallest remaining cycle has one operation from each independent axis:
- radial prime-power connectedization;
- angular complete-character analysis;
- reciprocal Fourier--Tate sewing;
- framed return to the scalar determinant line.
The key audit is whether this mixed cycle has a source-derived holonomy that a hostile divisor-bearing modification cannot preserve.
Falsifier
The refinement theorem fails if one finds:
- a retained pair of labels not separated by the declared conductor;
- a coarse character lacking its exact fine-frequency lift;
- a normalization mismatch in the Haar pairings;
- two different compatible label distributions with every finite character shadow equal.
Standard finite Fourier inversion and the nested factorial tower exclude all four on the algebraic label module.
Disposition
The complete residue-character lift is not merely finitely faithful. It has a canonical refinement-compatible angular completion.
The RH frontier has moved entirely to the mixed radial--angular coherencer and the orientation of its scalar interference crossing.