6.0. Analytic Comparison Data from the Residual-Free Comparison Interface
In this section, the integrated stage constructed in
Section 5 and the canonical residual-free representative is fixed as the input data for passing to the analytic closure argument of
Section 6. What is done here is a notational organization for connecting the objects constructed in
Section 2 through 5 to distributional equalities, regularized determinants, and finite-window counts, and does not add any new assumption.
All objects used in the analytic closure argument are introduced below by formal definitions or by references to the constructions of
Section 2–5. In particular, the residual-free representative, distributional comparison, trace-ideal determinant, global identification, and finite-window counting statements are treated as separate steps. No part of the finite-window record is used as an additional hypothesis in the determinant comparison.
Definition 6.1 (residual-free comparison data). The residual-free comparison data passed from
Section 5 to
Section 6 are the following tuple:
Here
X is the integrated stage, and by Theorem 5.18 it has the orthogonal decomposition
The corresponding orthogonal projections are denoted by
Moreover,
is the exact von Mangoldt lift fixed in
Section 3, and for a finitely supported weight
, the arithmetic-side contribution is evaluated as
Here
is a finitely supported weight on the arithmetic side, and it is to be interpreted as notationally distinct from the logarithmic-side test functions used from
Section 6.1 onward.
When
denotes a representative of the localized comparison data obtained from the finite-window explicit formula, define
as its canonical residual-free representative, in accordance with Definition 5.20. Then
holds. Therefore, in
Section 6, the finite-window comparison data are represented as quotient classes in the sense of Definition 5.21, and
is always used as the representative.
Lemma 6.2 (origin of the analytic comparison data). All data used in the determinant-comparison part of
Section 6 are determined by the constructions of
Section 2–5, together with the centered Mellin boundary realization fixed in Definition 4.162. No additional zero-location input is introduced at the transition to
Section 6. More precisely:
- 1.
Section 2 fixes the analytic Hilbert space , the dense domain , the closed form , the associated self-adjoint operator , and the compact-resolvent spectral scale used in the Schatten estimates.
- 2.
Section 3 fixes the coefficient-space arithmetic construction, the exact von Mangoldt lift , and the weighted diagonal arithmetic trace which evaluates the prime-power contribution.
- 3.
Section 4 fixes the one-sided singular-boundary subspace
, the one-sided projection
, the boundary distribution space
, the singular-boundary trace, the boundary pairing, and the standard realization map
for the completed-zeta centered Mellin boundary finite parts.
- 4.
Section 5 fixes the integrated Hilbert space X, the lifted subspace , the ambient projection , the arithmetic projection , the residual projection , and the canonical representative modulo .
Consequently, the boundary reflection
is obtained from the centered Mellin reflection
by
and its descended involution
on
, the signed boundary-distribution comparison form, the Hilbert–Schmidt operator
K, and the central finite-window test inputs of
Section 6 are obtained only from these data and from the functional equation
. In particular, the construction does not use the location of the zeros of
, the identity
, or any finite-window consequence proved later in
Section 6.
Proof. The assertions follow by tracing the definitions in
Section 2–5. Items (1)–(4) list exactly the objects constructed before
Section 6. The map
and the representative
use the quotient by
fixed in
Section 5; the arithmetic term has already been evaluated by the trace of
Section 3; and the remaining effective component is the
-component obtained by
. The origin of the boundary distribution inserted into this component is fixed by
, and the functional-equation reflection is transported by
. The later definitions of
,
,
,
K, and the central finite-window kernels refer only to this list. Thus the determinant-comparison argument starts from the data supplied by
Section 2–5 and the classical centered Mellin boundary realization, and does not insert a zero-location assumption or a conclusion of the comparison as an input. □
Remark 6.3 (
Section 6 dependency audit: generator kernels and canonical finite-part functionals). The transition to
Section 6 imports no unconditional full-test-space unsmoothed generator kernel from
Section 4. The generator-kernel input is exactly the one recorded in Remark 4.131: regularized kernels, core-level unsmoothed limits, and pairings controlled by the comparison maps. Thus the determinant comparison is not conditional on the optional full-test-space limit of Definition 4.124.
Likewise, the completed-zeta finite part enters the comparison as a canonical finite-part functional. The argument does not claim that the singular-boundary machine reconstructs from without reference to the canonical finite-part functional. Rather, is first fixed on the finite-window contour-coordinate space ; the fixed transpose map , the finite readout quotient, the Gram-inverse reconstruction , and the LCI synthesis then realize that functional inside the residual-free -component. None of these steps uses , the central pairing equality, spectral localization, or the Riemann Hypothesis.
Before stating the extension theorem, we now construct the readout-synthesis family used by the localized comparison interface from the seam model itself. Let
The finite-window generator space is the free complex vector space
spanned by the generator-level boundary pieces that occur in finite-window inputs. A generator
carries two pieces of data:
where
is the boundary distribution generated by
g, and
is the residual-free comparison representative attached to the same generator. These define linear maps
and
For
,
is the realized centered Mellin boundary finite-part distribution.
Choose finite index sets
large enough to dominate the seam-readout and lifted-test seminorms constructed below. For
, set
For
, define
and
We next define the readout-synthesis family. For each window
M, fix a continuous seam readout extraction map
It reads a vector
on the smooth seam carrier
, transports it to the centered contour coordinate
u through
, and applies the finite-window cutoff. We write
The extraction is fixed by the seam model of
Section 4 and satisfies, for the finite logarithmic seminorms used by
,
Thus this construction uses only; it does not read the arithmetic summand of .
For
, put
and define the jet readout functionals
and
Their continuity follows from the previous estimate and the finite order of the central and endpoint jet functionals.
Choose contour-side jet-dual representatives
so that
and
Lift them to
by the explicit extension operator of
Section 4.10:
Now define, for
,
and
The family
is the concrete readout-synthesis family. It is built from
and is therefore fixed before
is defined. For every
there is a constant
such that
For the bulk channel this follows from the continuity of and ; for the jet channels it follows from the continuity of the jet functionals and the fixed seminorms of the lifted dual tests.
We now construct the finite-window contour-readout reconstruction map by finite-dimensional linear algebra. Let
where
,
, and
. The vectors
are the finite list of bulk probes actually detected by the finite-window comparison interface in the window
M. Define the readout-null subspace by
and set
This quotient is the finite readout channel actually visible from
. Choose a basis
of
. For each basis vector define a continuous functional on
by
Let
be its Riesz representative:
The corresponding Gram matrix is
The matrix
is positive definite. Indeed, if
, then
Pairing this identity with arbitrary
gives
Since the form a basis after quotienting by , the functionals are linearly independent; hence for all i. Thus .
Define
and the finite contour-extraction map
With respect to the bases
and
, the matrix of
is
. Hence
Equivalently,
is the Moore–Penrose right inverse of
on the finite readout channel. By construction,
Moreover finite-dimensional norm equivalence gives
The reconstruction identity used below is now a consequence of the Gram-inverse construction. For every
,
where
is the common annihilator of
in the test-function space. Hence, for every
and every
,
Thus is not an extra right-inverse assumption: it is the Gram-inverse reconstruction map of the finite readout quotient detected by . If , the bases are chosen compatibly with the refinement map ; the two reconstructed vectors may differ only by a readout-null direction and therefore give the same pairing against every .
The admissible boundary-distribution space is the completion, modulo the common kernel of
, of the finite-window span:
When it is viewed as a subspace of
, only distributional limits with finite LCI-control seminorm are retained. Any Hilbertizable norm
used below is chosen so that
Theorem 6.4 (well-defined localized comparison interface and seminorm estimate).
Let . Define a linear functional on by
Then is bounded and hence has a unique Riesz representative
The definition is independent of the chosen generator-level presentation of T and of the auxiliary window M whenever the same finite-window representative is read in a larger window. Moreover, for every finite-window contour finite-part probe ,
Here is the Gram-inverse reconstruction map obtained from the finite readout quotient above. In particular, if
are two generator-level presentations of the same element of , then
Consequently extends uniquely to a continuous linear map
and the extended map satisfies
after taking the supremum over the finite set of seminorm types required by the chosen window system.
Moreover, the singular boundary trace of Section 4 is admissible with an explicit trace-to-LCI bound: there exist finitely many pairs and a constant such that
Finally, for every finite-window generator g,
Proof. For
, each concrete synthesis channel satisfies
Thus is a bounded functional on the Hilbert space . It depends on z only through , because every synthesis channel was defined using . Therefore its Riesz representative lies in . This representative is, by definition, , and the same estimate gives the displayed norm bound.
For a contour finite-part probe
, set
. By the definition of the Riesz representative and by the Gram-inverse reconstruction identity proved above,
This proves the reconstruction formula.
For generator-level data, the contour finite-part readout profile, the jet-dual tests, and the lift
are constructed from the same finite-window representative used to define
and
. Therefore, for every
,
Hilbert-space dual separation gives
Now let
and suppose
. For every
,
Hence
which is the kernel inclusion
Thus two presentations of the same boundary distribution give the same comparison vector.
If the same representative is read in a larger window
, then the cutoffs agree on the support of the representative and the jet-dual systems are chosen compatibly under the refinement maps of the quotient
. Therefore the synthesized functional is unchanged:
Thus is independent of the auxiliary window.
The extension to
follows from the same Cauchy argument as before. If
is Cauchy for
, then
so
is Cauchy in the Hilbert space
. The limit defines
, and the same estimate proves independence of approximating sequence and continuity.
Finally, the singular trace estimate follows because
is continuous from the Fréchet topology of
to the distribution topology of
, and because the LCI-control seminorms involve only finitely many
. This gives
and hence the stated admissibility. □
Definition 6.5 (comparison-stage comparison-independent realization machine). For a finite window
M, the boundary-level realization machine
was fixed in Definition 4.162. The comparison-stage realization machine is the composition
Thus, for any completed finite-window canonical finite-part functional
ℓ,
The map is comparison-independent in the following precise sense: after a canonical finite-part functional ℓ is supplied, its realization uses only the fixed seam pullback transpose, the finite readout quotient, the Gram-inverse reconstruction, and the concrete LCI synthesis family. It does not use , the central comparison equality, RH, or zero-location information.
Theorem 6.6 (singular-boundary boundary-distribution comparison realization).
Singular-boundary test vectors on the Gelfand triple of Section 4
are realized continuously and linearly as -comparison data on the integrated stage X through the concrete localized comparison interface of Section 5. Specifically, define
Then is well-defined, continuous, and linear, and it satisfies the explicit estimate
For a generator-level finite-window input g represented by ,
Proof. By Theorem 6.4,
is well-defined and continuous, and satisfies
The same theorem gives the trace estimate
Thus the composition
is a continuous linear map from
to
, and the displayed bound follows after renaming the finite family of seminorms and the constant. For generator-level finite-window data, the final statement follows from the compatibility
proved in Theorem 6.4. □
Definition 6.7 (singular-boundary test-to-comparison map). Apply the canonical residual-free projection to the map
of Theorem 6.6, and define
Since
, this projection is retained to make the residual-free nature explicit; on the range of
it acts as the identity. In what follows, write
By the estimate for
,
and, in particular,
Lemma 6.8 (continuity, estimates, and residual-free property of
). The map
is continuous and linear, and there are finite seminorm families and constants
such that
For every
,
holds. Moreover, if
is a generator-level finite-window boundary datum, then
Proof. By Theorem 6.6,
is continuous and satisfies a finite seminorm estimate. Since the orthogonal projections
are bounded on
X,
is also continuous and satisfies the two displayed bounds. Moreover, because
, and equivalently because
one has
The generator-level statement follows from
and the fact that
is already residual-free. □
Definition 6.9 (finite-window singular-boundary and zeta-side residual functionals). Let
be the finite-window test algebra of Definition 5.23. Thus every finite-window input is represented by a concrete logarithmic representative class
At this stage,
is treated as a dense input class for the distributional test spaces introduced in
Section 6.1.
For
, use the notation of Proposition 5.24:
The singular-boundary functional is defined first, independently of the zeta-side residual, by
Equivalently, if
, then
Thus is not defined as the residual of the zeta-side functional. It is the determinant-side central functional induced by feeding the completed finite-window canonical finite-part functional through the fixed comparison-independent seam/readout realization machine, then evaluating the resulting -comparison vector against the Gram-reconstructed finite-part probe.
The zeta-side comparison functional is the common-term-removed residual
Equivalently,
in the arithmetic-side notation, where
for any representative
. On logarithmic-side local tests the same arithmetic part is represented by
With these definitions, Proposition 5.24 gives, already on
,
Thus the finite-window equality is a theorem imported from Proposition 5.24; it is not built into the definitions of and .
In
Section 6.1, these functionals are realized as continuous functionals on
for local coefficient bookkeeping, and on
for the open-band equality. The central test family
is introduced independently in
Section 6.4.
Definition 6.10 (boundary-distribution comparison kernel and normalized determinant datum). Use the Gelfand triple of
Section 4
and the map of Definition 6.7
In
Section 6.3, after constructing the signature operator induced by the functional equation,
the signed residual-free boundary-distribution comparison kernel is defined by
The operator candidate
K corresponding to this kernel is defined on the initial domain
by
At this stage, the construction of
, the self-adjointness of
K, and the Hilbert–Schmidt property are not yet asserted. They are proved in
Section 6.3.
After
is established in
Section 6.3, define, using the regularized determinant,
Here
are normalization constants, and are fixed in the subsequent trace-ideal determinant theorem so as to satisfy
This definition specifies the type of the comparison function
, and at this point it does not assert
Proposition 6.11 (comparison data from the residual-free comparison interface). The comparison data of Definition 6.1 satisfies the following three properties.
- 1.
-
(residual removal)
For the canonical representative of any finite-window comparison datum,
holds.
- 2.
(singular-boundary localization)
The effective residual after removing the arithmetic side is represented uniquely as
- 3.
-
(analytic targets)
The objects treated in the analytic closure part of Section 6 are
and these are respectively defined as the residual-free singular-boundary functional, the completed-zeta residual functional after subtraction of the common Archimedean/reference and arithmetic finite-window terms, the boundary-distribution comparison kernel candidate, and its regularized-determinant comparison function.
Proof. The first assertion follows immediately from Definition 5.20. Indeed,
and by the orthogonal decomposition of Theorem 5.18,
The second assertion is the content of Proposition 5.24. In the finite-window explicit formula, the prime-power contribution on the arithmetic side is evaluated exactly as
and by Lemma 5.22, the residual component does not contribute to the comparison data. Hence the effective residual after removing the calibrated reference term and the arithmetic contribution is evaluated as the only remaining effective component in the orthogonal decomposition,
By uniqueness of the orthogonal projection decomposition, this component is also unique.
The third assertion is the notational fixing in Definitions 6.9 and 6.10. Here
are first introduced as linear functionals on the finite-window test algebra, and
K is introduced as the boundary-distribution comparison kernel candidate obtained from the distribution-kernel representation of
Section 4. Their continuity as distributions, the
-realization of
K, and the global agreement of
with
are proved in
Section 6.1, 6.3, and 6.4, respectively. Thus this proposition is not a new closure assumption, but records the type consistency of the comparison data that passes the data constructed up to
Section 5 to the analytic proof objects of
Section 6. □
The purpose of
Section 6.1 through 6.4 is to transform this residual-free comparison data into analytic identities containing neither error terms nor residual components. Specifically, one first compares
and
as continuous functionals on the comparison test classes, then realizes the boundary-distribution comparison kernel
K as an
-operator, constructs the regularized determinant
, and finally proves
as the global uniqueness theorem of
Section 6.4.
6.3. Trace-Ideal Determinant Theorem
In this section, using the compact-resolvent construction and the distribution-kernel representation of
Section 4, we realize the boundary-distribution comparison kernel candidate
K introduced in
Section 6.0 as a Hilbert–Schmidt operator. After that, we introduce the finite-rank cutoff
and prove the local uniform convergence and coefficient transport
The conclusion of this section is the construction of the comparison function
and the stability of its Taylor coefficients, and here we do not yet assert
Definition 6.39 (reference spectral resolution). For the trace-ideal estimates in this subsection, write
where
is the Sobolev seam-chart regularizer constructed in
Section 4.8 from
Thus is not the singular-boundary transport operator ; it is the positive compact-resolvent regularizer used only for trace smoothing and Schatten estimates.
The transported Sobolev scale is
and
The effective dimension, elliptic order, and Weyl exponent are fixed concretely by
The Hilbert–Schmidt threshold is
The net trace-decay exponent and the actual comparison-trace smoothing exponent fixed in
Section 4.8 are
In the trace-ideal estimates below,
is the trace used to define the comparison map. The raw restriction
is used only to define this smoothed comparison trace.
Choose an orthonormal basis
of
consisting of eigenfunctions of
,
The eigenvalues satisfy
for constants
and
. Moreover,
so the matrix coefficients
are defined on the original boundary-test domain. For each
, define
Definition 6.40 (functional-equation boundary reflection). Let
be the centered Mellin boundary reflection induced by
On the smooth seam carrier
, define the geometric seam reflection by
Let
be the distributional pushforward induced by
, extended by continuity in the boundary-distribution topology fixed in
Section 4. Then, on realized finite-window boundary distributions,
holds as a consequence of the preceding commutative identity and of
. Thus
is the smooth-seam realization of the functional equation
It is defined from the seam reflection and the transpose realization map, not from the location of the zeros of .
Lemma 6.41 (basic properties of the boundary reflection). The boundary reflection
is a bounded involution on
. Moreover,
and it preserves the boundary pairing used in the construction of the singular-boundary component. Equivalently, for admissible boundary distributions
for which the boundary pairing is defined,
Proof. The seam reflection satisfies
because
. Taking distributional pushforwards gives
on finite-window seam distributions, and continuity extends the identity to
.
The equality
implies
because
. The centered Mellin boundary pairing is invariant under
, and
is invariant under
. Therefore, for realized finite-window boundary distributions,
Density of the realized finite-window boundary distributions and continuity of the boundary trace topology extend the identity to all admissible boundary distributions. Boundedness follows from the same seminorm-preserving estimate on the dense seam-distribution class and the continuous extension. □
Lemma 6.42 (topological realization of the boundary reflection). Let
be the finite-window boundary-distribution subspace used to construct the admissible boundary-distribution closure. Then
is dense in the boundary-distribution topology of
, and the reflection
is bounded with respect to the defining seminorms of that topology. In particular, if
in
, then
and the boundary pairing identities verified on
extend uniquely to all admissible limits.
Proof. In
Section 4,
is obtained as the distributional completion generated by finite-window boundary distributions subject to the boundary trace estimates and support constraints. Thus
is dense by definition of this completion. On the seam,
is the smooth map
, so derivatives and finite-order trace seminorms are transformed by the chain rule with uniformly bounded coefficients on each finite window. Consequently, for every defining seminorm
q of the boundary-distribution topology there are a defining seminorm
and a constant
such that
The estimate extends by density and gives a bounded operator on . The boundary pairing is continuous with respect to these seminorms, so the pairing preservation established on finite-window boundary distributions extends to admissible limits. □
Lemma 6.43 (compatibility with admissible boundary data and residual-free comparison). The boundary reflection preserves the admissible boundary-distribution subspace:
Moreover, it is compatible with the residual-free comparison interface in the following sense. If
have the same
-projected comparison component,
then
Consequently, the rule
is well-defined on the
-projected comparison range.
Proof. On the dense subspace of boundary distributions obtained from finite-window inputs,
,
is the smooth seam reflection
transported from the centered Mellin reflection by
. The finite-window comparison identity is invariant under this reflection, and the canonical residual-free representative of
Section 5 is defined modulo
, which is orthogonal to the
-component. Therefore equality of the
-projected components is preserved by applying
.
In Theorem 6.4,
was defined as the closed subspace satisfying the uniform boundary estimate in the closure of finite-window boundary inputs. Since
is bounded in the boundary-distribution topology by Lemma 6.42 and preserves the boundary pairing by Lemma 6.41, it preserves this closure and the same uniform estimate. Hence
The well-definedness of the displayed rule follows from the first part of the statement and the residual-free quotient compatibility just proved. □
Lemma 6.44 (finite synthesis form of the LCI readout). On a finite comparison window
M, suppose the original localized comparison interface is given in the
z-dependent readout form
where
is a finite-rank continuous probe operator. Then there are finitely many
such that
with the conjugation convention adjusted to the convention for the Hilbert inner product. Consequently,
is a finite synthesis form of the same finite-window LCI readout.
Proof. Because each
is finite-rank, its range has a finite basis
. Hence
for continuous linear functionals
on the finite-dimensional Hilbert space
. By the finite-dimensional Riesz representation theorem, there are
with
up to the fixed sesquilinear convention. Substitution gives
Since this holds for every z in the finite comparison range, the displayed finite synthesis formula follows. Thus the finite synthesis form is not a new definition of LCI; it is the Riesz decomposition of the earlier z-dependent readout formula. □
Lemma 6.45 (explicit Riesz probe from the LCI synthesis family). On each finite comparison window
M, write the localized comparison interface in the finite synthesis form
Here
is finite, and the vectors
span the finite-window comparison range
For
, define
where
is the scalar dictated by the sesquilinear convention so that
for all
T. With the convention that the
X-inner product is linear in the first variable, this is simply
. Then
The map is continuous because it is finite-rank.
If
is a larger window and
z is represented in both comparison ranges, then
annihilates all finite-window boundary distributions already visible in window
M. Hence the Riesz probe is intrinsically an element of the quotient
After fixing the representative section already used in the finite-window readout construction, we denote this quotient class by
All pairings below are independent of the chosen representative.
Definition 6.46 (Riesz probe associated with the localized comparison interface). Let
For
, the Riesz probe
is the quotient class constructed in Lemma 6.45. Choosing the fixed finite-window representative section, it is characterized by
This identity is therefore not an additional duality assumption: it is obtained from the concrete finite-window LCI synthesis formula and then extended by continuity.
For
define the boundary comparison form by
Thus the equality between the boundary comparison form and the Hilbert X-inner product is a consequence of the finite-window Riesz construction of , not a normalization imposed after the fact.
Lemma 6.47 (kernel invariance of the comparison quotient). Let
Consequently, the rule
is well-defined on the quotient comparison range.
Proof. If
, then by Definition 6.46,
The boundary reflection preserves the centered boundary pairing by Lemma 6.41, and the Riesz probe is transported contragrediently by the test-side pullback associated with
. Hence
Using the Riesz identity again gives
so
. Applying the same argument to
gives equality of the two kernels. □
Lemma 6.48 (Riesz inner-product transport for the descended reflection). For
the Riesz transport identity is
Moreover, on the dense comparison range
the descended reflection satisfies
and
Thus the self-adjointness of the descended reflection is obtained by transporting the boundary pairing through the Riesz representation of .
Proof. The first displayed identity is the defining Riesz identity of Definition 6.46, with
. Hence
On finite-window boundary representatives,
is the seam realization of the centered Mellin reflection
. The functional equation
preserves the centered boundary pairing. The test-side probe is transported by the pullback dual to this reflection; equivalently,
on
, where
denotes the test-probe pullback. Consequently,
and similarly
The kernel invariance in Lemma 6.47 ensures that the displayed formulas are independent of the chosen admissible representatives . Since , , and the boundary pairing are continuous on the admissible closure, the identities pass from finite-window representatives to all . □
Proposition 6.49 (descent to the singular-boundary component).
The boundary reflection descends to a bounded self-adjoint involution
on the residual-free -component. It satisfies
Proof. By Lemma 6.43 and Lemma 6.47, the rule
is well-defined on the projected comparison range. This range is dense in the component
generated by the residual-free comparison interface.
By Lemma 6.48, this rule is isometric and symmetric on the dense comparison range:
It therefore extends uniquely to a bounded isometry
The identity
gives
. Hence
Since an isometry satisfies
, we obtain
Finally, taking
and using
gives the displayed formula. □
Definition 6.50 (
-signature operator). In what follows, the self-adjoint involution
constructed in Proposition 6.49 is called the
-signature operator. The operator
is not an operator for making the form positive-definite. It is only the self-adjoint involution induced by the functional-equation reflection after passage to the residual-free
-component.
Definition 6.51 (signed residual-free
-quadratic form). For
, define
This is not a positive quadratic form, but a Hermitian quadratic form representing the oriented component on the singular-boundary side.
Definition 6.52 (signed residual-free boundary-distribution comparison kernel). Define the signed residual-free boundary-distribution comparison kernel by
Equivalently, it is the sesquilinear form obtained as the polarization of
. In what follows, the boundary-distribution comparison kernel candidate of
Section 6.0 is evaluated as this signed kernel.
Lemma 6.53 (Hermitian symmetry of the signed boundary-distribution comparison kernel).
holds. Moreover,
In general, is not assumed.
Proof.
The only structural property used here is the self-adjointness
obtained in Proposition 6.49. Therefore
Taking , the value is real. No positivity of is used or asserted. □
Remark 6.54 (non-circularity of the construction of
K). The construction of
,
, the signed boundary-distribution comparison kernel
, and the operator
K uses only the functional equation
the boundary distribution framework of
Section 4–5, and the orthogonal projection structure of
X. It does not use any information about the location of the zeros of
. In particular, no positivity, Herglotz property, or spectral-localization statement equivalent to the Riemann Hypothesis is assumed in the definition of
,
, or
K.
Theorem 6.55 (quantitative Sobolev eigenvalue growth of the reference operator).
For the smooth-seam Sobolev reference operator fixed in Section 4.8 and Definition 6.39,
Proof. By
Section 4.8,
on the smooth compact carrier
. The Neumann elliptic regularizer
has effective dimension
and order
, hence the usual Weyl lower bound gives
Unitary conjugation by
preserves the spectrum. For
,
Since , the exponent satisfies , and the displayed series converges. The finitely many terms do not affect convergence. □
Remark 6.56 (Schatten scale inherited from the smooth-seam Sobolev model). Theorem 6.55 is the only spectral-growth input used in the Hilbert–Schmidt construction below. The operator
is the Sobolev regularizer attached to the smooth seam carrier, not a zero-detecting operator. It is fixed before
is identified with
, and it contains no information about the location of the zeros of
. The trace-ideal argument uses only
together with the smoothed comparison trace and the
-control estimate proved earlier.
Theorem 6.57 (fixed trace-smoothing exponent and Hilbert–Schmidt summability).
With
the exponent fixed in Section 4.8 and Definition 6.39 satisfies
Proof. This is exactly the summability conclusion of Theorem 6.55. For a positive self-adjoint operator with eigenbasis
,
Thus the summability is equivalent to Hilbert–Schmidt membership. Unlike the earlier threshold formulation, no floating “sufficiently large” exponent is used below. The single exponent controls the net Hilbert–Schmidt decay, while the actual comparison-trace smoothing order is . □
Lemma 6.58 (construction of the raw and smoothed singular-boundary comparison traces). The raw seam trace and the smoothed comparison trace are the two distinct operators
and
They are given by
and
where
Moreover,
is bounded and satisfies
Proof. By construction in
Section 4.8,
was chosen so that the raw seam restriction followed by the admissible boundary embedding obeys
Since
the raw trace is a bounded map from
into the
-controlled admissible boundary-distribution space. The operator
maps
boundedly into
. Therefore
is bounded from
to
with the displayed
-estimate. Multiplying on the right by the net decay factor
gives
Since
this is the same as
Thus the decay used below is a property of the smoothed comparison trace, not of the raw restriction alone. □
Lemma 6.59 (boundary trace smoothing on the reference eigenbasis). There exists
such that, for every
,
In particular, for the reference eigenbasis
,
Consequently, for any Hilbertizable admissible norm dominating the LCI-control seminorm,
Proof. By Lemma 6.58,
and
is bounded into the
-controlled admissible boundary space. Therefore
For
,
which proves the eigenbasis estimate. The final inequality follows from the chosen admissible norm dominating
. □
Lemma 6.60 (boundedness of the comparison extension). The continuously extended localized comparison interface
is bounded by the explicit LCI-control seminorm:
Proof. The displayed inequality is exactly the extension estimate in Theorem 6.4. The second inequality follows from the defining domination of the Hilbertizable admissible norm over the LCI-control seminorm. Thus this boundedness is a consequence of the explicit finite family of boundary dual seminorms, not a continuity assertion inserted after the fact. □
Theorem 6.61 (smoothing of the singular-boundary comparison map).
There exists such that, for every ,
Proof.
Applying
and using
, we obtain
Therefore, by Lemma 6.60,
This proves the first estimate. The second follows by inserting Lemma 6.59. For
, the eigenbasis identity
gives the stated decay estimate. □
Theorem 6.62 (Schatten estimate for the signed boundary-distribution comparison kernel).
Set
Proof.
Thus
so
.
By definition of the signed boundary-distribution comparison kernel,
Squaring and summing gives
□
Proposition 6.63 (Hilbert–Schmidt realization of the boundary-distribution comparison kernel).
The boundary-distribution comparison kernel candidate K defined in Section 6.0 closes uniquely as a Hilbert–Schmidt operator on . Namely,
The assertion is independent of the reference orthonormal basis used to prove it.
Proof. By Definition 6.52, the sesquilinear kernel on the initial domain
,
is determined as the polarization of the residual-free
-quadratic evaluation. Definition 6.39 ensures that
so the matrix entries
are defined on the initial domain. By Theorem 6.62,
Define
on finite linear combinations of the basis vectors by
Thus
extends uniquely to a Hilbert–Schmidt operator on
. Writing this extension as
K, we obtain
The Hilbert–Schmidt class is an operator ideal defined independently of a basis; the displayed basis computation only verifies membership. □
Lemma 6.64 (Hermitian symmetry of the residual-free boundary-distribution comparison kernel). The boundary-distribution comparison kernel of
Section 6.0,
is Hermitian. That is,
Proof. This is the content of Lemma 6.53. Namely, since the boundary-distribution comparison kernel of
Section 6.0 is evaluated as the polarized kernel of Definition 6.52, it inherits the Hermitian symmetry coming from the inner product of the Hilbert space
X. □
Theorem 6.65 (self-adjoint Hilbert–Schmidt realization).
The boundary-distribution comparison kernel candidate K of Section 6.0 is realized as a self-adjoint Hilbert–Schmidt operator satisfying
Proof. By Proposition 6.63,
K closes uniquely as a Hilbert–Schmidt operator on
. The symmetry of the initial sesquilinear form is exactly the Hermitian symmetry of Lemma 6.64. That lemma, in turn, uses only the self-adjointness
of the
-involution and the Hilbert-space inner product on
X. Thus, for
,
No positivity of
, Herglotz property, or zero-localization assertion is used in this step. Since
is dense in
, and
K is bounded, the symmetry extends continuously to all of
. Therefore
holds. □
Definition 6.66 (finite-rank compressions and central matrix readout). Let
be the finite-rank projection of Definition 6.39, and set
Let
denote the ordinary finite-dimensional trace on
. Define the finite-rank cutoff of the boundary-distribution comparison kernel
K by
When
is used inside
, it is viewed as the self-adjoint endomorphism
and outside
it is extended by zero. Thus
is finite rank and
For
w in the central disk on which
is invertible, define
and the finite-dimensional boundary central matrix
Equivalently, since
commutes with
,
The finite-rank boundary central functional is the trace of this matrix:
This definition uses only the compressed boundary-distribution comparison matrix ; it is not a determinant-side definition.
Lemma 6.67 (Hilbert–Schmidt convergence of finite-rank compressions).
Proof.
converges strongly on
. For a Hilbert–Schmidt operator
K, a bounded strongly convergent sequence of operators
satisfies
Indeed, using the orthonormal basis
,
For each
j,
, and moreover
and
Therefore the first convergence follows by dominated convergence. The second convergence is identical.
Thus, by the triangle inequality,
The right-hand side converges to zero as
. Hence
□
Definition 6.68 (regularized Fredholm determinant). Let
. Define the regularized Fredholm determinant by
The standard properties of the regularized Fredholm determinant, trace ideals, and
follow [
4,
5]. The right-hand side is defined as an ordinary Fredholm determinant because
Equivalently, if the eigenvalue sequence of
A, counted with algebraic multiplicities, is denoted by
, then
This product converges under the -condition.
In particular, for
, write
Remark 6.69 (first trace renormalization). In
, the first trace term is removed by normalization. Indeed, in the range
,
For this reason, in the comparison with the completed zeta function, the constant term and the linear term must be normalized separately by an exponential factor
Lemma 6.70 (continuity of
in Hilbert–Schmidt norm). For every
,
Namely,
converges to
locally uniformly on compact sets in the
z-plane.
Proof. For Hilbert–Schmidt operators
, the regularized determinant satisfies the following Lipschitz-type estimate. There exists a universal constant
such that
Set
and
. By Lemma 6.67,
Therefore, for
,
and the exponential factor is uniformly bounded with respect to
N and
z. Hence
□
Lemma 6.71 (trace-power convergence). For each
,
Proof.
in
, and in particular also in operator norm:
Moreover, .
By the Schatten Hölder inequality,
and
Thus in .
In each term,
converges in
; taking one of the remaining factors as an
-factor and estimating the other factors as bounded operators, the product converges to zero in
. That is, there exists a constant
such that
Hence
in
, and continuity of the trace gives
□
Lemma 6.72 (non-vanishing at the central point). One has
Proof. For
, the Dirichlet eta function is represented by the convergent alternating series
At
, the terms
are positive, decrease monotonically to zero, and
The alternating-series estimate therefore gives
Since
on
by the usual analytic continuation of the eta function, and
we obtain
The remaining factors in
are nonzero at
, and hence
□
Definition 6.73 (normalized determinant comparison function). Set
Define the comparison function by
The normalization constants
are fixed by
Here we use Lemma 6.72. The branch of the logarithm is used only to fix the value at this single point, and the definition of
is independent of the branch by
Remark 6.74 (normalization does not encode zero locations). The constants
and
fix only the value and the first derivative, equivalently the first logarithmic derivative, at the central point. They do not prescribe any zero of
, and they do not contain any information about the location of the zeros of
. The zero set of
is determined only by the regularized determinant factor
where
K was constructed independently of zero-location information as explained in Remark 6.54.
Lemma 6.75 (entireness of the normalized determinant comparison function).
is an entire function of
. Moreover, for each
N,
is also entire, and
locally uniformly on compact sets.
Proof. The map
is an entire function. Therefore
is also an entire function. The exponential factor
is also entire, and hence
is entire.
For the same reason,
is also entire. By Lemma 6.70,
locally uniformly on compact sets in
z. The map
sends compact sets to compact sets, and therefore
also locally uniformly on compact sets in
s. □
Theorem 6.76 (coefficient transport for the regularized determinant).
In a sufficiently small neighborhood of the origin, take the branch of
Proof. Since
, there exists
such that
By Lemma 6.70,
uniformly on
. Therefore, for sufficiently large
N,
and
uniformly on every
,
. By Cauchy’s integral formula, the derivatives also converge in each order
. Namely,
On the other hand, for
,
Moreover, since there is no linear term,
□
Corollary 6.77 (coefficient transport for
).
Set . In a neighborhood of the origin, take the branch of
Furthermore, the Taylor coefficients of
converge in each order.
Proof.
Applying Theorem 6.76 with
, for
one obtains
The linear coefficient is fixed by , and the constant term is fixed by . The coefficient convergence from finite-rank cutoffs also follows from Theorem 6.76. □
Proposition 6.78 (compatibility with the distributional comparison coefficients).
The open-band coefficient comparison obtained from the distributional comparison theorem of Section 6.1 transports continuously to the trace-ideal coefficients
constructed in this section. Namely, setting the coefficient sequence obtained by finite-rank cutoffs as
and this limiting coefficient is compatible with the calibrated coefficient comparison on the open band obtained from
Proof. The convergence
follows immediately from Lemma 6.71. In
Section 6.1, it was shown that
and
agree as continuous linear functionals on
. On the other hand, the
-component of
is represented by the kernel of
K in
Section 6.0, and in the finite-rank approximation it is represented as finite trace coefficients by
. Therefore the open-band comparison quantity represented by finite-rank coefficients transports to
as
This transport is due to -convergence and trace-power convergence, and does not use any additional endpoint convention or pointwise boundary value. □
Theorem 6.79 (trace-ideal determinant theorem).
The boundary-distribution comparison kernel candidate K of Section 6.0 is realized as
Moreover, the finite-rank cutoffs
locally uniformly on compact sets in the z-plane.
The normalized comparison function
is an entire function and is normalized so as to satisfy
Moreover, its Taylor coefficients are transported degree by degree from the finite-rank cutoffs.
Proof. The fact that was shown in Proposition 6.63. The self-adjointness follows from Theorem 6.65. The Hilbert–Schmidt convergence of the finite-rank cutoffs follows from Lemma 6.67. The local uniform convergence of follows from Lemma 6.70. The definition and normalization of are given by Definition 6.73. The entireness of follows from Lemma 6.75. Finally, the degree-by-degree transport of Taylor coefficients was shown in Theorem 6.76 and Corollary 6.77. □
Remark 6.80 (no global identification in this section). In this section,
was constructed by the regularized determinant, and it was proved that its coefficients can be transported from finite-rank approximations. However, this section does not yet conclude
This global agreement is proved in the global uniqueness theorem of
Section 6.4.
6.4. Global Uniqueness Theorem
In this section, we globally identify the regularized-determinant comparison function constructed in
Section 6.3,
with the completed zeta function
. The uniqueness principle used in this section is only the identity theorem of complex analysis. That is, we use only the fact that if two entire functions agree on a nonempty open set, then they agree on the whole plane. Carlson-type theorems, the Phragmén–Lindelöf principle, or other growth-type uniqueness theorems are not used in the identity proof of this section.
Lemma 6.81 (common holomorphic domain). Both and are entire functions on .
Proof. That
is entire was shown in Lemma 6.75. On the other hand,
is the completed zeta function; the simple pole of
at
is removed by the factor
, and the poles of
at the negative even integers are cancelled by the trivial zeros of
. Therefore
is an entire function. □
Lemma 6.82 (growth of the determinant comparison function). For every
, there exists a constant
such that
Consequently, is an entire function of order at most 2.
Proof. For a Hilbert–Schmidt operator
, the regularized determinant satisfies
Taking
, one has
Thus, taking
, the asserted estimate follows. This estimate gives
in the form of order at most 2. □
Lemma 6.83 (growth of the completed zeta function). The completed zeta function
is an entire function of order 1. In particular, for every
, there exist constants
such that
holds.
Proof.
The growth of
in vertical strips is controlled exponentially by Stirling’s formula. Moreover,
, as a meromorphic function, has growth of order at most 1, and its only pole at
is removed by the factor
. By the functional equation
the estimates in the left and right half-planes are transferred to each other. Therefore
is an entire function of order 1, and the stated
-type estimate follows. □
Corollary 6.84 (growth of the difference).
is an entire function of order at most 2.
Proof. By Lemma 6.81, is entire. By Lemma 6.82, has order at most 2, and by Lemma 6.83, has order 1. Therefore the difference has order at most 2. □
Definition 6.85 (logarithmic germs at the central point). Set
. By the normalization of
Section 6.3 and Lemma 6.72,
Hence there exists
such that
On this disk, define
by the branches satisfying
For each
, write the central logarithmic coefficients as
Definition 6.86 (central Cauchy–Laplace kernel). Take
in Definition 6.85 smaller if necessary. For
, define
The value at
fills the removable singularity, and the resulting kernel is holomorphic in
w. Let
denote the vector space spanned by finite linear combinations of the kernels
and their
w-derivatives.
Definition 6.87 (raw finite-window central kernels). Fix an even function
such that
and set
for
. For
, define the raw finite-window kernel
and let
denote the corresponding finite-window test input before the central finite-part subtraction. The cutoff function
is fixed once and for all throughout the central comparison argument.
Definition 6.88 (central finite-jet map). The local singular orders in the completed finite-window explicit formula determine two non-negative integers
These integers are fixed once and for all. They do not depend on the cutoff scale M, the central parameter w, or the values of the pairings with and .
For a finite-window kernel
, write the central jet coordinates as
and define
For each
, write the endpoint jet coordinates on the cutoff transition annulus as
The endpoint functional is fixed by the cutoff scheme and is supported in
The endpoint singular transition is encoded, before either pairing is evaluated, by the finite-order differential normal form
The coefficients
are fixed by the completed finite-window local normal form and by the chosen cutoff convention. They carry no side label •; the Archimedean/reference, arithmetic-trace, and singular-boundary endpoint contributions will be reduced to this single operator. More explicitly, after the rescaling
, it may be written in the form
where the coefficient functions
are fixed finite linear combinations of derivatives of
. Thus the endpoint jet is also a finite, pre-pairing object.
The central finite-jet map is
given on representatives by
For the central Cauchy–Laplace kernel
one has the convergent expansion
Since
near
,
for every fixed
a. On the endpoint annulus,
so every endpoint jet of
is an explicit finite combination of cutoff-transition derivatives and derivatives of
.
The universal endpoint transition coefficients are defined by the cutoff commutator
By the Leibniz rule,
with the convention that an empty sum is zero. These functions
are universal for the three sides and replace any side-dependent symbolic coefficient functions.
Definition 6.89 (central local normal form). In a fixed neighborhood
of the central point, the central local singular principal part of the Archimedean/reference, arithmetic-trace, and singular-boundary sides is represented by one finite-order local differential normal form
The coefficients are smooth near and are fixed by the completed finite-window local convention and the central jet convention. They carry no side label. Since the finite-window cutoff satisfies near , no cutoff-derivative commutator occurs in the central local term.
Definition 6.90 (central principal-part jet functional). Let
be the finite central jet used by the Hadamard finite-part convention. The central finite-part extraction rule is the fixed linear functional
The coefficients
are part of the central finite-part normalization and are fixed before the three pairings are evaluated. They carry no side label
Lemma 6.91 (explicit central jet coefficients). Let
be the common central local normal form of Definition 6.89. After enlarging the central jet order
if necessary, assume
. For each side
the central principal part is
where the coefficients are the side-independent finite sums
Equivalently, if
is the
-dual central test basis, then
For the central Cauchy–Laplace kernel
the common central principal part is
Proof.
Putting gives the displayed formula for . Since and have no side label, the resulting coefficient ledger is common to the Archimedean/reference, arithmetic-trace, and singular-boundary sides.
On the arithmetic side, there is no additional central prime-power singularity:
whereas the central band is chosen inside
. On the singular-boundary side, seam realization and finite readout reconstruction preserve the central contour jet,
on the finite readout quotient channel. Hence all three sides apply the same functional
Finally,
follows from the Taylor expansion of
. Substituting this jet into the common coefficient ledger gives the displayed equality of the three central polynomials. □
Definition 6.92 (principal-part space, jet-dual basis, and counterterm operator). For every
, let
be the finite-dimensional vector space spanned by fixed local-principal-part basis elements
The basis elements may depend on
M, but only through the fixed rescaling
and the associated finite-window localization. They are fixed before either central pairing is evaluated.
There is a canonical local-principal-part embedding
which regards a local principal part as the corresponding finite-window reference test input. The basis is chosen to be
-dual:
where
and
are the standard coordinate vectors in the central and endpoint jet components. In particular, the cross-coordinates vanish.
For coefficient extraction in Lemma 6.95, set
These are not additional data. They are the embedded
-dual test basis elements. Thus
and
Define the universal principal-part map
by
The associated finite-rank counterterm operator on the pre-completion finite-window space is
The jet-duality gives
and therefore
Thus the central counterterm associated with
and the window
M is the principal-part vector
and its embedded finite-window reference element is
No coefficient in
is chosen from the values of
Definition 6.93 (finite-window central cutoff inputs). For
and
, the regularized finite-window central test input is
Equivalently, using the embedded principal-part element,
The logarithmic-side representative of this regularized input is
By the projection identity above,
The subtraction is an algebraic subtraction in the pre-completion finite-window test-input space . It is not performed after applying either central pairing.
The data
fix the finite-rank operator
and hence
before the values of
are evaluated. Thus
is a pre-pairing finite-jet operation and cannot encode the desired equality of the two pairings.
Definition 6.94 (central finite-window representatives as quotient finite-window inputs). For
and
, let
denote the logarithmic-side smooth representative of the regularized central finite-window input
Equivalently,
where the second term means the smooth finite-window representative of the embedded principal-part reference element. By Lemma 6.95,
and
Thus
is a finite-window representative whose common local principal part has already been removed on all three sides. Since both
and the finite-jet reference element have finite-window support, there is a fixed constant
depending only on the cutoff convention such that
With the present normalization of the cutoff, one may take
. Hence
Define the central-to-finite-window representative map
by
By Definition 5.23, the three coordinates of
are induced from the same representative
:
and
Thus the boundary coordinate is not chosen independently; it is obtained by inserting the same logarithmic representative into the centered Mellin finite-window contour identity.
For any central pairing symbol, we use the convention
Thus denotes the central coordinate of the quotient finite-window test object , while the actual input to Proposition 5.24 is .
Lemma 6.95 (explicit endpoint transition coefficients and principal-part cancellation). For every
, each side
has central and endpoint local-principal-part functionals
The central coefficients are extracted from the embedded central jet-dual test basis by
For the central Cauchy–Laplace kernel, define
Since
near
,
Regular Taylor terms that are not singular principal parts are kept in the regular Archimedean/reference term and are not placed in .
For the endpoint part, let
and let
be the universal endpoint local differential normal form of Definition 6.88. The cutoff commutator has the explicit Leibniz expansion
where
Hence the endpoint coefficients are computed by the side-independent formula
The central coefficients also agree:
Consequently, for every finite-window representative
,
where the single local coefficient ledger is
Proof. The central extraction follows from Lemma 6.91 and from the
-dual basis. The expansion
gives
Since
near
, the central jet of
is the same. Differentiating
times at
gives
Only the singular central principal part is entered into the counterterm; regular Taylor terms remain in the regular Archimedean/reference contribution.
For the endpoint part, all endpoint contributions are supported in
By Definition 6.88, the endpoint local normal form is the finite-order operator
Applying the Leibniz rule to
gives
Since
, this proves the explicit formula for
Evaluating the endpoint principal part on the endpoint-dual basis element
therefore gives
We now verify the three sides. On the Archimedean/reference side, the completed local factors and the finite-window endpoint convention reduce the endpoint singular term to the cutoff commutator of the same operator
. Thus
Regular terms from the gamma factor, the -factor, and the -normalization that are not singular principal parts remain in .
On the arithmetic-trace side, the finite-window quotient construction gives
The prime-power sampling
is the regular arithmetic contribution. It does not create an independent endpoint singular normal form. The endpoint principal part comes only from the same cutoff transition convention; hence
On the singular-boundary side, the contour finite jet is transported by
and is read through the LCI synthesis family and the Gram-inverse reconstruction
These maps preserve the finite endpoint coordinates on the readout quotient channel. Consequently, the singular-boundary endpoint principal part is again the same cutoff-transition functional:
This proves the equality of the endpoint coefficients across the three sides. The equality of the central coefficients is obtained similarly by testing the central principal part on the -dual basis ; the arithmetic prime-power sampling has no additional singular support at , and the singular-boundary transfer preserves the contour central jet. Hence the three central extractions yield the common .
Thus all three local principal parts factor through the same ledger
Finally, Definition 6.92 gives
Therefore
for all three sides. Taking
gives the asserted statement for
.
The calculation uses only the fixed cutoff , the central kernel , the finite jet maps, the seam realization maps, and the LCI readout synthesis. It does not use a central pairing equality, , zero localization, or the Riemann Hypothesis. □
Lemma 6.96 (seminorm control of the finite-jet counterterm). Let
. For every defining seminorm
of
, there exist finitely many defining seminorms
and a constant
, independent of
M, such that, for every finite-window family
used in the central comparison,
In particular, the finite-jet counterterm is a continuous finite-rank operator with respect to the central comparison seminorms on the finite-window families appearing in the proof.
Proof. The map consists of finitely many evaluations of u-derivatives at and finitely many endpoint functionals on . Each such functional is controlled by finitely many of the seminorms defining the central comparison topology, after increasing if necessary. The map is finite rank, and the embedding inserts the resulting finite local principal part into the fixed finite-window test-input model. Since the orders are uniform in M, only finitely many seminorm types are needed. The dependence on M is only through the fixed rescaling , which is already controlled by the finite-window seminorms. This gives the stated estimate for . □
Remark 6.97 (the counterterm does not encode the comparison equality). The finite-jet operator
and the counterterm
are fixed before the two central pairings are evaluated. They depend only on the fixed cutoff
, the central kernel
, the finite-jet map
, and the universal principal-part map
. They do not depend on the values of
and therefore cannot encode the central residual-free equality. The operator
is only a pre-pairing algebraic removal of the common local principal part.
Equivalently, Lemma 6.95 writes the three local principal parts as
with a single coefficient ledger
. The counterterm kills this common ledger because
not because either central pairing has been evaluated.
Definition 6.98 (central comparison topology). The central comparison topology is the locally convex topology generated as follows. For every compact set
, every integer
, every integer
, and every
define, on kernel representatives
,
Let
be the vector space spanned by the finite-window central test inputs
and their finite
w-derivatives. For each
M, the finite-dimensional counterterm space
is regarded as a subspace of
via the canonical local-principal-part embedding
Thus the expression
is formed in the algebraic space
, not after applying either central pairing. The space
is the locally convex completion of
, modulo zero seminorms, with respect to the seminorms above. Central finite-part limits such as
are not inserted as additional generators of the topology. They denote elements of the completion only after the corresponding finite-window family has been proved Cauchy in these seminorms; for the family used here this is exactly Lemma 6.104.
The seminorms defining
are fixed before the functionals
are applied. In particular, the topology depends only on the finite-window cutoff structure, the central kernel family, and its
w- and
u-derivatives; it does not depend on the values of
Definition 6.99 (central Cauchy–Laplace comparison subspace). Let
be the central radius used below. The central Cauchy–Laplace comparison subspace is
For a compact set
and an integer
, set
Only this closed Cauchy–Laplace subspace and its finite derivative levels are used for the central pairing argument. No continuity assertion on the whole ambient space is required for the proof of the determinant identity.
Definition 6.100 (Hadamard finite-part central regularization). The notation
denotes the Hadamard finite-part limit in
of the finite-window family obtained from
after subtracting the common central counterterm in the Archimedean, arithmetic, and singular-boundary contributions. More precisely,
is defined for those
for which the corresponding regularized finite-window family is Cauchy in the topology of Definition 6.98; in that case
denotes its unique limit in the completion
.
For the central kernel
, the corresponding finite-window family is precisely
of Definition 6.93. The existence of
as an element of
is not asserted by the definition alone; it is proved by the finite-window approximation lemma below. Thus the present definition fixes the cutoff procedure, the common counterterm, and the ambient topology, while the existence of the relevant finite-part limits is supplied by a separate convergence statement.
Remark 6.101 (no conclusion is encoded in the central regularization). The central regularization does not define by fiat. The cutoff , the kernel , the counterterm , and the topology of are fixed without using the numerical values of the pairings with or . The identities connecting these pairings to the logarithmic derivatives of and are proved later, separately on the singular-boundary side and on the zeta side, in Lemma 6.139 and Lemma 6.105.
Definition 6.102 (central Cauchy–Laplace test family). For
, the central Cauchy–Laplace test input is denoted by
This notation means the unique element of the completion
obtained as the limit of the finite-window family
once the convergence is established in Lemma 6.104. In particular,
is not an additional generator of the topology of
. By normalization,
The space is a test space distinct from the open-band class , and is used to represent the central logarithmic derivative comparison.
Lemma 6.103 (regularity of the central Cauchy–Laplace family). There exists
such that the map
is holomorphic for
.
Proof. For each
M, the finite-window representative
is holomorphic as a
-valued map: it is obtained from the holomorphic kernel
, the fixed cutoff
, and finitely many
w-holomorphic jet counterterms. The seminorms of Definition 6.98 control finitely many
w- and
u-derivatives uniformly on compact subsets of
. By Lemma 6.104, after possibly decreasing the radius to
, these finite-window holomorphic maps converge to
locally uniformly in the
-seminorms, and the same is true after the finitely many
w-derivatives appearing in those seminorms. The standard Weierstrass theorem for locally convex-valued holomorphic maps therefore gives that
is holomorphic for
. □
Lemma 6.104 (finite-window approximation of the central kernel). For every compact set
set
For every
and every
, there is a function
such that, for all
,
Hence the finite-window central test inputs of Definition 6.93 form a Cauchy family in
. Its limit is denoted by
and
locally uniformly for
. Equivalently,
The same convergence holds after applying any finite number of w-derivatives covered by the seminorms . The assertion is purely an approximation statement in ; it does not use the values of the pairings with or .
Proof. Fix
,
, and
. Put
For
and
, direct differentiation of
gives constants
and an integer
such that
Then
. This gives the tail estimate
On the transition annulus
, each derivative of
contributes a factor
. The same exponential tail bound therefore gives
Thus the raw cutoff family is Cauchy in every defining seminorm.
It remains to check that the finite-jet subtraction preserves this Cauchy estimate. By Lemma 6.96,
for finite-window families
. Applying this to the raw cutoff difference and using the preceding tail and transition estimates for the finitely many seminorms on the right gives
after increasing
to dominate the finitely many seminorms involved. Combining the raw cutoff estimate and the finite-rank counterterm estimate yields the displayed Cauchy estimate for
Since is the completion of the finite-window space with respect to these seminorms, the Cauchy family has a unique limit, denoted . Passing in the Cauchy estimate gives the stated convergence to the limit. The estimates are uniform on B and include the w-derivatives present in the defining seminorms.
Only the cutoff
, the kernel
, the finite-jet operator
, and the seminorms of
enter the proof. No value of
is used. □
Lemma 6.105 (Hadamard central partial fraction formula for
). There exists
such that, for
,
is equal to the Hadamard finite-part pairing of the central Cauchy–Laplace kernel
against the zeta-side residual distribution
of Definition 6.9, with the common Archimedean/reference and arithmetic finite-window parts treated by the universal central counterterm. Namely,
Proof. Since
is entire and
taking
sufficiently small gives
for
. Write the Hadamard product in normalized form at the central point and take the difference of logarithmic derivatives
The central normalization cancels the constant factor and the central value of the linear exponential factor. The remaining completed explicit-formula expression is then split, exactly as in Definition 6.9, into the common Archimedean/reference contribution, the arithmetic von Mangoldt contribution, and the zeta-side residual contribution. The first two components are the universal local principal parts removed by the central counterterm fixed in Definition 6.93; after this common subtraction the finite part is precisely the residual pairing with .
The Cauchy–Laplace kernel corresponding to the central difference is
The unregularized pairing may contain divergent terms component by component, but in the Hadamard finite part obtained by subtracting the value at
and by applying the common central counterterm, the identical divergent principal parts are cancelled. The operator
in Definition 6.100 is the linear regularization realizing this finite-part residual pairing. Therefore
holds. □
Lemma 6.106 (central transform of
). There exists
such that, for
,
The inputs are only the central Cauchy–Laplace kernel of Definition 6.86, the regularization operator of Definition 6.100, and the standard Hadamard product of the completed zeta function. No information about the location of the zeros of , and in particular no form of the Riemann Hypothesis, is used.
Proof.
Substitution gives the asserted identity. The proof uses only the completed zeta function as an order-one entire function with its Hadamard product; the zeros are kept at their a priori locations throughout. □
Lemma 6.107 (Hilbert–Schmidt continuity of the central determinant transform). Let
. For
, define
Then
where the trace is a trace-class trace. Moreover, if
and
then, after fixing any compact set
one has, for every
,
In particular the map
is continuous from the Hilbert–Schmidt topology to the topology of locally uniformly convergent holomorphic functions, with finitely many
w-derivatives, on the central disk.
Proof. The standard differential identity for
gives
This is well-defined because and is bounded.
It remains to prove the continuity assertion. Put
For
sufficiently close to
A in
, the resolvents
and
are uniformly bounded on
B. Then
The trace-ideal inequality gives
The resolvent identity gives
and hence
The same argument applied after differentiating the resolvent identity finitely many times gives
This proves the asserted convergence. □
Lemma 6.108 (finite-rank determinant and boundary central compatibility). Let
,
,
,
, and
be as in Definition 6.66. Define the determinant-side finite-rank central functional separately by
Then, for
w in a sufficiently small central disk,
If
are the nonzero eigenvalues of the self-adjoint matrix
, counted with multiplicity, then
In the smaller disk
, this is equivalently the finite matrix trace-power expansion
Moreover,
defines the determinant-side limiting central functional, and for every compact
and every
,
Equivalently, the finite-rank boundary matrix traces converge to the same trace limit:
This statement defines only the determinant-side trace limit. Its identification with the finite-part realized functional is proved separately in Lemma 6.138.
Proof. The proof is finite-dimensional until the final limiting step.
First, by Definition 6.66,
Second, the determinant-side finite-rank functional is computed independently. In finite dimension,
The last expression is exactly the boundary-side finite matrix trace above. Thus
This is a finite-dimensional trace identity; the determinant side has not been used to define .
Third, diagonalize the self-adjoint matrix
. There is a unitary
such that
Taking the finite-dimensional trace gives
Zero eigenvalues do not contribute. Since finite-dimensional trace is invariant under unitary conjugation, the boundary central value is independent of the chosen reference basis.
If
, then
and therefore
This connects the finite-rank boundary readout with the trace-power coefficients of
Section 6.3.
Lemma 6.107 therefore gives
locally uniformly with all finitely many
w-derivatives on the central disk. This is precisely the convergence of
to
.
The same resolvent estimate applies to the boundary-side central matrix trace, because it is the trace-class expression
in finite rank and its Hilbert–Schmidt limit is
Thus, for every compact
and every
,
The right-hand side tends to zero. Since the finite-rank boundary functional and the finite-rank determinant functional agree for every N, their trace limits agree on the central Cauchy–Laplace family. The identification of this trace limit with the finite-part realized is not imposed here; it is the content of Lemma 6.138.
This finite-dimensional calculation is performed before any comparison with the zeta-side functional, and uses only , the compressions , finite-dimensional trace identities, and the Hilbert–Schmidt continuity of the central determinant transform. □
Definition 6.109 (finite-dimensional
R-side lift of the central finite-window regularization). Let
be the central finite-window regularization on logarithmic representatives. Instead of assuming a global continuous section of an infinite-dimensional trace map, we use only the finite-dimensional central channel visible in the
M-th window.
Let
be this finite-dimensional central trace-readout space. Choose a basis
adapted to the central jet and regular finite-window channels, and choose
R-side test representatives
such that
Since
is finite-dimensional, the section
defined by
is continuous and satisfies
Define the
R-side lift of the central regularization by the type-correct formula
Thus the central regularization is first read in the finite-dimensional central channel, then lifted back to R-side test functions, and only then inserted into . No infinite-dimensional splitting theorem is used here; the lift is the explicit finite-window section determined by the displayed jet-dual and regular readout representatives.
Definition 6.110 (finite-window compressed boundary operator). For the regularized finite-window central input
define the finite-window localized comparison interface by the type-correct formula
The finite-window finite-part realized boundary kernel is
By the same trace-smoothing and Schatten estimates used for
, this kernel is represented by a self-adjoint Hilbert–Schmidt operator
For the finite-rank projection
used in
Section 6.3, set
Thus is the finite-rank compression of the finite-window finite-part realized boundary kernel before any determinant is formed.
Lemma 6.111 (intrinsic finite-readout stability). Equip the finite readout quotient
with the intrinsic quotient Hilbert norm
Then the Gram-minimal reconstruction
satisfies
Moreover, for every compact
and every finite derivative order
m, the readout vectors
produced by the central Cauchy–Laplace comparison family satisfy
with
independent of
M.
Proof. The first identity is the standard minimal-norm property of the Moore–Penrose right inverse on the finite-dimensional quotient channel. The quotient norm is defined precisely so that the norm of the minimal preimage equals the quotient norm.
For the uniform estimate, use the already constructed finite-window realized vector
obtained from the canonical finite-part functional by the seam transpose, finite readout,
R-side lift, and localized comparison interface. It satisfies
The
R-side lift is finite-dimensional on each window by Definition 6.109, the LCI estimate is continuous by Theorem 6.4, and the Cauchy–Laplace seminorms defining
were chosen to dominate the central finite-jet, endpoint, and regular readout channels. Hence
with
independent of
M. This proves the claim without estimating the coordinate norm of the Gram inverse separately. □
Definition 6.112 (weighted uniform finite-window comparison seminorms). For
,
, and an integer
, define the weighted finite-window seminorms
and, after applying the cyclic realization,
These seminorms are added to the Cauchy–Laplace comparison topology only to record uniform finite-window stability; they do not change the scalar/cyclic compatibility statements, which are pullback statements on .
Lemma 6.113 (uniform finite-window stability of the comparison realization). There exists an integer
such that, for every compact
and every
, the finite-window realization maps satisfy
and similarly for the cyclic realization
. Equivalently, these maps are uniformly continuous with respect to the weighted seminorms of Definition 6.112 for
.
Proof. The Gram-minimal reconstruction has norm 1 for the intrinsic quotient readout norm by Lemma 6.111; hence no coordinate small singular value of the finite Gram matrix enters the estimate. The finite-window section in Definition 6.109 is built from finitely many central jet-dual and regular readout representatives. Differentiating the cutoff gives factors , while the possible increase of support length and the finite number of representatives are polynomially bounded in M. Thus the R-side lift is bounded by times a finite list of central, endpoint, and regular readout seminorms.
For the cyclic realization, the
ℓ-fold channel is controlled by the same finite-window readout norms and by
On
, after shrinking
r once, the weighted seminorms dominate the resulting normally convergent Neumann majorant. This gives the displayed
-control. Choosing any
in Definition 6.112 absorbs this growth, since
Thus the supremum over M in the weighted seminorms is finite, which proves the uniform stability statement. □
Lemma 6.114 (uniform pre-determinant continuity of the finite-part realized functional). Let
be the finite-part realized singular-boundary functional obtained from the canonical
-finite-part functional by the fixed comparison-independent finite-part realization mechanism. For every compact set
and every integer
, there are finitely many seminorms
on
and a constant
, independent of the finite window
M, such that every Cauchy–Laplace finite-window family
satisfies
This estimate is obtained before the determinant-side trace formula is used.
Proof. The functional
is the composition of the continuous maps
followed by evaluation on the fixed finite-window central representative. The only point at which a coordinate Gram inverse could appear is the reconstruction
. Lemma 6.111 replaces coordinate control by the intrinsic quotient readout norm, and Lemma 6.113 records the weighted finite-window seminorm estimates needed for uniform
M-control on the Cauchy–Laplace comparison family. The seam transpose, the finite-dimensional
R-side lift, the localized comparison interface, and the projection
are continuous with respect to the finite list of seminorms defining
. Taking the maximum over the central finite-jet, endpoint, and regular readout channels gives the displayed estimate.
No determinant-side representation, no identity , and no zero-location statement is used in this continuity estimate. □
Definition 6.115 (finite-window restriction of the finite-part realized functional). For each finite window
M, define
as the restriction of
to the regularized finite-window central family:
This definition is a restriction of the finite-part realized functional; it is not a determinant-side definition.
Definition 6.116 (scalar finite-window central realization and universal coefficient space). The ordinary scalar finite-window central test used by the zeta-side comparison is denoted by
Likewise,
denotes the scalar finite-window restriction of the finite-part realized functional. The zeta-side scalar finite-window functional is denoted by
and is defined by restriction of the already constructed scalar zeta-side residual functional:
for every scalar finite-window central Cauchy–Laplace input
. Thus
is only a notation for the scalar finite-window restriction of
, not an additional zeta-side datum.
For
, let
be the Fréchet space of coefficient families
which converge locally uniformly on
, together with all finitely many
w-derivatives. Its distinguished universal Cauchy–Laplace coefficient family is
where
is the
ℓ-th universal coefficient vector. This object is a coefficient object only; it is not yet a scalar central test and not yet a cyclic tensor test.
Definition 6.117 (finite-window cyclic central comparison channel). For each finite window
M and each integer
, let
be the finite-window cyclic central test channel generated by
ℓ-fold ordered readout tensors of the residual-free boundary comparison interface. Its elementary tensor product is denoted by
For a central disk of radius
, define
as the space of coefficient families
such that
for the cyclic readout seminorms
induced by the finite-window comparison topology. The cyclic Cauchy–Laplace finite-window realization is the coefficient family
Thus the symbols are not introduced by the desired trace value; they are the coefficient tests in the cyclic central comparison channel. The scalar central test and the cyclic coefficient family are kept distinct until the scalar–cyclic realization compatibility theorem below identifies them as two realizations of the same universal coefficient object.
Definition 6.118 (scalar and cyclic realizations of the universal Cauchy–Laplace family). For each finite window
M, define two continuous realization maps
where
is the ordinary scalar Cauchy–Laplace comparison subspace. They are defined coefficientwise by
where
is the
ℓ-th scalar finite-window coefficient of the regularized central Cauchy–Laplace family and
is the corresponding cyclic coefficient test in
. Equivalently,
and
The scalar realization is the ordinary regularized central Cauchy–Laplace test used by the zeta-side Hadamard transform. The cyclic realization is the tensor-channel coefficient family used to read the K-side cyclic traces. These maps record a type distinction; they do not identify the two target spaces.
Definition 6.119 (matrix-coefficient central test). For
, define
by
Here
is the finite-window boundary-to-central matrix readout constructed explicitly in Definition 6.120. Thus
is obtained from finite readout coordinates, Gram/Riesz data, and the localized comparison interface; it is not a test chosen to force a prescribed matrix coefficient.
Definition 6.120 (explicit boundary-to-central matrix readout). Let
be the finite comparison range of the finite synthesis form
Choose a basis
of
, let
and, consistently with the convention that the first Hilbert-space variable is linear, set
Let
be the central matrix-coordinate test obtained from the finite central readout coordinate basis and its Gram inverse, normalized by
Equivalently, in a fixed finite central coordinate basis
,
This conjugation placement follows the convention fixed in Definition 2.1, namely that the first Hilbert-space variable is linear. The displayed formula is the definition of .
Lemma 6.121 (explicit boundary-to-central matrix readout identity). For
,
is a well-defined finite-window central readout test and
This identity follows from the finite readout coordinate construction and the Riesz representation of the localized comparison interface; it is not a defining property imposed on .
Proof. By construction of the coordinate tests,
Pairing this coordinate identity with the finite-part realized functional means, via the finite synthesis representation of
and the Riesz probe identity of Lemma 6.45, that
Indeed, the tensor
extracts the
i-th dual coordinate of the first comparison vector and the
j-th coordinate of the second, and the Riesz synthesis converts this coordinate contraction into the
X-inner product matrix entry. Therefore
The construction is finite-dimensional, hence continuous and independent of the chosen basis after evaluation. □
Lemma 6.122 (matrix-coefficient readout identity). For all
,
Proof.
Lemma 6.121 gives
which is the displayed identity. The second equality is the definition of
as the Hilbert–Schmidt representative of the finite-window boundary kernel. Thus the matrix coefficient is obtained from the finite readout coordinate construction and the LCI/Riesz synthesis, not by imposing the desired value. □
Definition 6.123 (cyclic readout tensor product). For matrix-coefficient tests
, define
to be their ordered cyclic readout tensor. The
ℓ-fold finite-part lifted functional
acts by
This is a tensor lift of the finite-window readout. It is not a multiplicativity assertion for a scalar distribution and does not claim that is multiplicative on ordinary products of scalar test functions.
For a cyclic coefficient family
define the cyclic finite-part functional by
whenever the defining cyclic seminorm series converges. Thus
is a tensor-channel functional, while
is the ordinary scalar finite-window functional.
Lemma 6.124 (scalar coefficient realization and cyclic tensor-lift compatibility). For each finite window
M and every integer
, the scalar finite-window coefficient of the already constructed finite-part realized functional is determined by the finite readout kernel
before the cyclic tensor channel is used:
Independently, the cyclic tensor coefficient satisfies
Consequently the scalar finite-part realized functional and its cyclic tensor lift define the same pullback functional on the universal central Cauchy–Laplace coefficient space:
Equivalently, for the distinguished family
,
Thus the compatibility is not obtained by declaring the scalar and cyclic targets to be equal; both sides are first evaluated, coefficient by coefficient, against the same finite-window readout kernel.
Proof. Fix
M and
. Let
, and choose an orthonormal basis
of
. Put
This is the only input used from the scalar finite-part functional.
Let
denote the
-truncated scalar coefficient obtained by restricting the ordinary scalar Cauchy–Laplace coefficient
to the finite central readout ledger
of Definition 6.120. The ledger is fixed by the finite central coordinate tests and the Gram/Riesz reconstruction before any determinant trace is introduced. Its coefficient contraction gives
where
and
. This identity is a finite matrix-coordinate consequence of the scalar readout
; it is not a multiplicativity statement for the ordinary scalar distribution.
Since
, the compressions satisfy
For
, the standard trace-power estimate gives
The scalar coefficient construction is continuous in the finite-window central comparison topology, and the finite central readout ledger exhausts
. Hence
The cyclic coefficient is evaluated separately. For the same finite-rank cutoff, the ordered cyclic tensor
is evaluated by the tensor lift as
Passing again to the Hilbert–Schmidt limit gives
Thus the scalar coefficient and the cyclic coefficient are not identified with each other directly; they are both independently evaluated as the same trace power of .
Finally, if
normal convergence in the defining Fréchet topology and the estimate
allow coefficientwise summation. Therefore
This proves the pullback equality on , and in particular on the distinguished family and its finite w-derivatives. □
Theorem 6.125 (scalar–cyclic realization compatibility).
For every finite window M, the scalar realization and the cyclic realization are two realization functors of the same universal central Cauchy–Laplace coefficient family:
Moreover, on the K-side alone, the scalar finite-window finite-part functional and its cyclic tensor lift determine the same pullback functional on :
Thus the scalar and cyclic target spaces are not identified directly; only their pullbacks to the common universal coefficient object are compared.
Proof. The first assertion is the definition of the two realization maps in Definition 6.118. The second assertion is the strengthened coefficientwise statement of Lemma 6.124: the scalar coefficient is first evaluated through the finite central readout ledger and the matrix-coefficient identity, the cyclic coefficient is evaluated through the ordered tensor contraction, and both give . Hence the compatibility is internal to the finite-part realized K-side and does not involve the zeta-side functional. □
Theorem 6.126 (finite-window residual-free comparison on the universal coefficient space).
For every finite window M, the finite-window residual-free comparison is the following equality of scalar pullback functionals on :
on the Cauchy–Laplace family and its finite w-derivatives. Combining this with Theorem 6.125 gives the type-correct mixed comparison
Thus the K-side cyclic tensor value and the zeta-side scalar value are compared only after pullback to the same universal coefficient object.
Proof. The first displayed identity is the finite-window residual-free equality transported to the universal coefficient space through the scalar realization . Here is the scalar finite-window restriction of , while is the scalar finite-window restriction of the already constructed finite-part realized functional. The second displayed identity follows by substituting the K-side scalar–cyclic pullback equality of Theorem 6.125. No direct equality between elements of the scalar and cyclic target spaces is used. □
Definition 6.127 (finite-rank cyclic coefficient tests). Let
and let
be an orthonormal basis of
. Set
so that
The definition is basis-independent after evaluation, because the evaluation is the finite-dimensional trace of the compression .
Lemma 6.128 (explicit finite-rank cyclic coefficient identity). For every
M,
N, and
,
Proof. By Definitions 6.123 and 6.127,
where
. This is exactly the matrix trace of
on
. □
Lemma 6.129 (existence of the infinite-rank cyclic coefficient test). For each
M and
, the sequence
is Cauchy in
. Its limit is the cyclic coefficient test
used in Definition 6.117 and Lemma 6.124. Moreover,
Proof. Because
in
, for every
,
Indeed,
and the standard telescoping estimate gives, for Hilbert–Schmidt
,
The cyclic seminorm on was defined to dominate precisely these finite cyclic contractions. Hence is Cauchy and its evaluation converges to . □
Lemma 6.130 (cyclic Cauchy–Laplace expansion). After shrinking
if necessary, for every
,
in
. The convergence is locally uniform in
w, with all finitely many
w-derivatives.
Proof. The
-central Cauchy–Laplace kernel has no
contribution and the first-trace term is removed by the common central counterterm. Thus the regularized finite-window family is represented by the cyclic coefficient sequence displayed above. The seminorm estimate
follows from Lemma 6.129. For
, the resulting geometric majorant gives normal convergence, and differentiating in
w only multiplies the
ℓ-th term by a polynomial in
ℓ, which is still dominated after shrinking
r. □
Lemma 6.131 (finite-window readout-kernel representation of
). For each finite window
M, after shrinking
if necessary,
for
. Equivalently,
The convergence is locally uniform in w, with all finitely many derivatives.
Proof. By Lemma 6.130,
in the cyclic central comparison channel. Applying the cyclic finite-part functional term by term gives
where the last equality is Lemma 6.129. The Neumann expansion
then gives
This proves the finite-window readout-kernel representation. The proof constructs in the cyclic tensor channel and evaluates it by the matrix coefficient identity; it does not define by the desired trace value, does not identify scalar and cyclic target spaces directly, and does not use the determinant. □
Lemma 6.132 (finite-window finite-rank cyclic contraction identity). Let
be as in Definition 6.110. For an orthonormal basis
of
, set
For
, define the finite cyclic contraction
Consequently, for
, the finite-window finite-rank finite-part readout
satisfies
The left-hand side is defined by cyclic contraction of the finite-part realized boundary kernel; the determinant is not used in its definition.
Proof. The equality
is the standard finite-dimensional matrix trace formula written in the orthonormal basis
. For
, the Neumann series gives
Multiplying by and taking the trace yields the asserted identity. □
Lemma 6.133 (finite-rank approximation of the finite-window finite-part functional). For each
M,
in
. Hence, for every compact
and every integer
,
as
. Equivalently,
locally uniformly in
w, with finite
w-derivative control.
Proof. Because
strongly and
,
For
and
,
Applying this with , , and using the normal convergence bounds of Lemma 6.131 gives convergence of the trace-power series and of its finitely many w-derivatives. The finite-rank trace formula of Lemma 6.132 gives the displayed matrix-trace form. □
Lemma 6.134 (finite-window convergence of the finite-part realized functional). For every compact
and every integer
,
as
.
Proof.
The pre-determinant continuity estimate of Lemma 6.114 applies directly to the difference of these two finite-window central families. This gives the displayed convergence without using the determinant-side trace formula. □
Lemma 6.135 (finite-window convergence of compressed boundary operators). As
,
Consequently, for each fixed
N,
in operator norm and in
.
Proof. The difference
is represented by the difference between the type-correct finite-window comparison interface
and the limiting central comparison interface. Lemma 6.104 gives convergence of the regularized central representatives, while Lemma 6.96 controls the common finite-jet subtraction. The trace-smoothing estimate of Theorem 6.61 and the Schatten estimate of Theorem 6.62 yield
Compression by is continuous in both operator norm and Hilbert–Schmidt norm, giving the asserted convergence of to . □
Lemma 6.136 (trace convergence from
to
K). After shrinking
if necessary,
locally uniformly for
, with all finitely many
w-derivatives.
Proof.
For
w in a sufficiently small compact central disk these resolvents are uniformly bounded. The resolvent identity gives
Together with in , these estimates imply trace-norm convergence of the displayed resolvent trace. Differentiating in w produces finite sums of products of bounded resolvents and Hilbert–Schmidt factors, so the same trace-norm estimates give locally uniform convergence for every fixed finite number of w-derivatives. □
Lemma 6.137 (double-limit finite-part trace bridge). After shrinking
if necessary, for every compact
and every
,
Proof. For fixed
M, Lemma 6.133 passes from
to
as
. Lemma 6.131 then identifies the
N-limit with
Finally Lemma 6.136 passes and gives the stated limit, including the finite w-derivative control. □
Lemma 6.138 (finite-part/trace bridge on the central Cauchy–Laplace family). Let
denote the scalar finite-part realized singular-boundary functional already constructed from the canonical
-finite-part functional by the fixed comparison-independent finite-part realization mechanism. Let
denote the determinant-side central trace functional
Then, after shrinking the central disk if necessary,
The convergence is locally uniform in
w, with all finitely many
w-derivatives controlled by the seminorms of
. Consequently, on the central Cauchy–Laplace family we may write
This identification is a theorem on the central test family, not a definition of the finite-part realized functional.
Proof. Fix a compact
and a finite derivative order
m. By Lemma 6.134,
locally uniformly on
B, with the same finite derivative control.
For each fixed
M, the scalar–cyclic pullback compatibility on
, namely Lemma 6.124 and Theorem 6.125, gives
Thus the K-side cyclic calculation and the scalar central finite-window functional evaluate two realizations of the same universal coefficient object rather than elements of two unrelated target spaces.
Lemma 6.133 and Lemma 6.132 give
This equality starts from the finite-part realized functional and its cyclic tensor lift; the determinant is not used to define it.
By Lemma 6.131, the same finite-window value is
and Lemma 6.136 sends this expression to
as
. Combining this
M-limit with the scalar finite-window convergence gives
By the definition of
,
The bridge identity follows.
The proof uses only the canonical finite-part functional extracted from , the fixed finite-part realization mechanism, the type-correct R-side lift of central regularization, the universal Cauchy–Laplace coefficient object, finite-window cyclic contractions, finite-rank compressions, and Hilbert–Schmidt convergence. It uses neither , nor the central equality with , nor any zero-location statement. □
Lemma 6.139 (determinant central partial fraction formula). For the same
, for
,
holds.
Proof.
It remains only to identify
with the central logarithmic derivative of the normalized determinant comparison function. By Definition 6.73,
At
, the first-trace renormalization in
gives
Hence
and subtraction yields
Combining this with the bridge identity proves the claim.
This argument identifies the finite-part realized -side central transform with the regularized determinant transform before any comparison with is made. It uses the finite-part/trace bridge, , the finite-rank compressions , Hilbert–Schmidt continuity of the -central transform, and finite-rank boundary-kernel compatibility. □
Lemma 6.140 (central transform of
). For the same
,
holds. The inputs are
, the regularized Fredholm determinant of Definition 6.68, and the central Cauchy–Laplace regularization of Definition 6.100.
Proof.
The assertion follows. Thus the -side central transform is obtained from the -Fredholm determinant expansion and not from any comparison with . □
Lemma 6.141 (central zeta-side logarithmic derivative identity). There exists
such that
holds.
Proof. This is exactly Lemma 6.106, the zeta-side central transform lemma. □
Lemma 6.142 (central trace identity on the singular-boundary side). For the same
,
holds.
Proof. This is exactly Lemma 6.140, the -side central transform lemma. □
Theorem 6.143 (central transform theorem from the residual-free comparison).
There exists such that the map
is holomorphic and satisfies the following:
Proof. Holomorphicity follows from Lemma 6.103. The -side identity follows from Lemma 6.142, whose input is the -Fredholm determinant model for . The zeta-side identity follows from Lemma 6.141, whose input is the standard Hadamard product for the completed zeta function. No central residual-free equality is used in this theorem; it only records the two separate transform identifications. □
Lemma 6.144 (
-side central normal convergence estimate). After shrinking
if necessary, the central logarithmic-derivative expansion of the Fredholm determinant side is normally convergent on every compact set
after the central subtraction at
. More precisely, for every finite set of
w-derivatives covered by the seminorms of Definition 6.98, the corresponding series for
converges locally uniformly on
B, and the resulting bounds are controlled by finitely many seminorms
.
Proof.
Let
be the nonzero eigenvalues of
K, counted with multiplicity. Then
and
is bounded. After shrinking
r, the factors
are uniformly bounded away from zero for
and all
j. The logarithmic derivative of the regularized determinant is
and, in the eigenvalue expansion, each summand is bounded by a constant multiple of
on
B. Its finite
w-derivatives are bounded by constant multiples of
for the relevant finite
m, which is summable because
and
is bounded. Hence the expansion and its finitely many
w-derivatives are normally convergent on
B. In particular, for each finite derivative order
m, there is a constant
such that the
j-th
w-derivative of the
-side pairing on a finite-window input is bounded by
times a finite sum of the seminorms
controlling the corresponding central kernel derivatives. The exponential normalization contributes only a polynomial expression in
w and is therefore controlled by the same central seminorms. □
Lemma 6.145 (
-side central Hadamard convergence estimate). The central partial-fraction expansion obtained from the standard Hadamard product of the completed zeta function converges normally on every compact set
after the central subtraction at
. The convergence remains valid after finitely many
w-derivatives covered by the seminorms of Definition 6.98. This estimate uses only the order-one entire-function structure of
and does not assume the Riemann Hypothesis.
Proof. The completed zeta function is an entire function of order one and admits its standard genus-one Hadamard product. Let
range over the zeros of
, counted with multiplicity, and put
By Lemma 6.72,
for every zero
. The logarithmic derivative of the genus-one product, after subtracting its value at the central point, has the central partial-fraction form
The summand may be written as
On a compact set
, all but finitely many
satisfy
and for those zeros the summand is bounded by a constant multiple of
The genus-one product condition gives
after removing the finite set already mentioned. Hence the central partial-fraction series converges normally on
B. After finitely many
w-derivatives, the corresponding summands are bounded by constants times
for
, and the same genus-one estimate gives normal convergence. The polynomial contribution from the exponential factor is controlled by the seminorms of Definition 6.98. Consequently, for each finite derivative order
m, the
j-th
w-derivative of the zeta-side pairing is bounded on
B by a finite sum of the seminorms
applied to the central test input. No information about the location of the zeros is used; they remain in their a priori positions throughout the argument. □
Theorem 6.146 (continuity on the central Cauchy–Laplace comparison subspace).
Let
be the central Cauchy–Laplace comparison subspace of Definition 6.99. For
and for every compact set and every , there exist a constant and finitely many defining seminorms
such that every finite-window central Cauchy–Laplace test family
Consequently the functionals
initially defined on the span of finite-window central Cauchy–Laplace inputs, extend uniquely to continuous linear functionals on . In particular, if
For the finite-window central cutoff family
of Lemma 6.104, these convergences are locally uniform for w in every compact subset , and the same assertion holds after applying any finite number of w-derivatives up to the order covered by .
Proof. By Definition 6.99, the relevant domain is the closure of the finite-window Cauchy–Laplace family and its finite w-derivatives. Thus it is enough to prove the displayed seminorm bounds on that generating family; no estimate for arbitrary elements of the larger ambient space is needed.
For the -side finite-part pairing, the estimate is supplied by Lemma 6.114. That lemma uses the canonical finite-part functional, the seam transpose, the finite readout quotient, the Gram-inverse reconstruction, and the localized comparison interface. It is deliberately proved before the determinant trace formula is invoked. Hence the displayed bound holds for the finite-part realized on without using the identity .
For the zeta-side pairing, the estimate is supplied by Lemma 6.145. That lemma uses only the standard order-one Hadamard product of the completed zeta function. After the central subtraction,
is locally dominated by the usual genus-one normal-convergence majorant, and the same remains true after finitely many
w-derivatives on compact subsets. Thus the displayed bound holds for
on
.
The displayed estimates give continuity on each finite derivative level , and hence on by the local projective description. Applying the same estimates to proves convergence of the pairings whenever in . Taking and using Lemma 6.104 gives the local uniform convergence in w and the corresponding convergence after finitely many w-derivatives.
No step in this argument assumes the Riemann Hypothesis, , or the central equality of pairings. The zeta-side input is only the standard order-one Hadamard product for , with its zeros left in their a priori positions, and the -side input is only . □
Lemma 6.147 (admissibility of regularized finite-window central cutoffs). For every
and every
, the regularized logarithmic representative
belongs to
. Hence it defines the quotient finite-window object
Its central coordinate is
and its arithmetic coordinate is
Hence , and Proposition 5.24 is applicable to the finite-window quotient object .
Here the vanishing of the three principal parts is the conclusion of the coefficient-extraction calculation in Lemma 6.95: the endpoint coefficients are computed by the explicit common cutoff-transition functions , and the center coefficients are extracted separately on the Archimedean/reference, arithmetic-trace, and singular-boundary sides before the counterterm is applied. The finite-jet counterterm used to form is fixed before either pairing is evaluated.
Proof. The raw kernel
is smooth and supported in the window
The counterterm
is a finite linear combination of the fixed principal-part reference elements of Definition 6.92. These reference elements have the same finite-window localization convention as
. Therefore
is smooth and has support contained in
. Hence
By Definition 5.23, the quotient class
is an element of
, and all its coordinates are induced from this same representative. In particular,
by the definition of the regularized central finite-window input.
For the arithmetic coordinate,
If
, then
. Since
, this implies
Thus has finite support and belongs to .
The boundary coordinate is
obtained by inserting the same logarithmic representative into the centered Mellin finite-window contour functional. Thus the arithmetic, boundary, and central coordinates of
all come from the single representative
.
The vanishing of the finite jet and of the three local principal parts follows from the coefficient-extraction form of Lemma 6.95, applied to
Thus the principal parts are not merely postulated to be common; their center coefficients are extracted on each side, and their endpoint coefficients are computed from the explicit common cutoff-transition functions
before the vanishing is used. The construction uses only
and the quotient construction of
, and not the values of the pairings with
or
. □
Lemma 6.148 (finite-window residual-free equality for central cutoffs). Let
be fixed as in Lemma 6.103. For every
M and every
, let
be the quotient finite-window test object constructed in Lemma 6.147. Its central coordinate is
Equivalently, under the central-coordinate convention of Definition 6.94,
This is a fixed finite-window statement on the quotient class . It contains no passage to the central limit.
Proof. Fix
M and
. By Lemma 6.147,
Its central coordinate is
, but the actual input to Proposition 5.24 is the quotient finite-window object
. The same lemma, using the coefficient-extraction version of Lemma 6.95, gives
Thus the finite-window equality below is applied after the center coefficients have been extracted and the endpoint coefficients have been computed from the explicit common cutoff-transition functions , so that the local principal part has been removed simultaneously on the Archimedean/reference, arithmetic-trace, and singular-boundary sides.
Apply Proposition 5.24 to
The displayed equality for is only the central-coordinate notation for this equality on the quotient class . No central limiting argument, no determinant identity, no central pairing equality, and no identity is used. □
Theorem 6.149 (central residual-free equality).
For every ,
holds. The equality is obtained locally uniformly in w on compact subsets of .
Proof. We separate the argument into the three steps needed for the passage from finite windows to the central kernel.
Step 1: finite-window equality. For every
M and every
, let
and let
be the quotient finite-window test object whose central coordinate is
Thus the logarithmic representative of the finite-window object is
and Lemma 6.147 gives
The second equality uses the explicit coefficient extraction and endpoint-transition calculation of Lemma 6.95. Thus the finite-window equality is applied to the coefficient-checked regularized finite-window object, not to the raw cutoff. Lemma 6.148 gives the finite-window equality
By the central-coordinate convention of Definition 6.94, this is written as
Thus the finite-window equality is a statement on , not a direct application of Proposition 5.24 to a bare u-kernel. It is not a central limiting statement.
Step 2: finite-window central convergence. Let
be compact. By Lemma 6.104, for every defining seminorm
,
This convergence is obtained from tail estimates, transition-annulus estimates, and finite-jet counterterm control; it uses no values of or .
Step 3: continuity of the central pairings. By Theorem 6.146, for
there are constants and finitely many seminorms such that
The right-hand side tends to 0 by Step 2. Therefore, locally uniformly for
,
and
Passing to the limit
in the finite-window equality of Step 1 gives
Since was arbitrary, the equality holds for every , and the preceding estimates give the asserted local uniformity.
No implication in this chain uses , the Riemann Hypothesis, or a pre-existing central pairing equality. □
Theorem 6.150 (local logarithmic derivative equality).
There exists such that, for ,
holds. The dependency chain is:
The conclusion is not used here.
Proof. By Lemma 6.142,
and by Lemma 6.141,
These are separate transform identifications: the first uses and the regularized Fredholm determinant, while the second uses the Hadamard product of .
Theorem 6.149 identifies the two central pairings. Therefore
The normalization of
in
Section 6.3 gives
and hence
Substituting this equality of central logarithmic derivatives into the preceding display gives the asserted local logarithmic derivative equality. □
Lemma 6.151 (local coefficient equality). For every
,
holds. This lemma records the coefficient consequence of the local logarithmic derivative equality; the subsequent local analytic equality is obtained directly from the quotient argument and does not rely on an additional coefficient comparison.
Proof. By Theorem 6.150, there exists
such that
Therefore, if the logarithmic branches of Definition 6.85 are fixed with the same value, there exists
such that
Thus all Taylor coefficients agree, and
holds. □
Lemma 6.152 (local analytic equality near the central point). There exists
such that
holds. The inputs are the local logarithmic derivative equality and the central normalization
Proof. By Definition 6.85, after shrinking
if necessary, both
are nonzero for
. Hence the quotient
is holomorphic and nonzero in a smaller central disk. By Theorem 6.150,
there. Thus
Q is constant on that disk. The central normalization gives
Therefore
in a sufficiently small central disk, which is exactly
□
Theorem 6.153 (identity theorem used in this section).
Let be a connected open set, and let be holomorphic functions on U. If
holds on some nonempty open set , then
Proof. The difference is holomorphic on U, and vanishes on the nonempty open set V. Therefore the zero set of h has an accumulation point in U. By the identity theorem for holomorphic functions, on U. □
Theorem 6.154 (global uniqueness theorem).
The normalized determinant comparison function constructed in Section 6.3 agrees with the completed zeta function on the whole plane:
This is the first point in the proof at which the global identity is obtained.
Proof. The local analytic equality of Lemma 6.152 gives a nonempty open disk
on which
By Lemma 6.82 and Lemma 6.83, both functions are entire, and hence they are holomorphic on the connected open set
. Applying Theorem 6.153 with
and this
V gives
All previous central comparison steps supplied only the finite-window equality, central seminorm convergence, independent continuity of the two pairings, and local analytic equality. The global identity is therefore a consequence of the identity theorem, not an input to the regularization or to the central comparison. □
Corollary 6.155 (zero sets with multiplicity).
and ξ have the same zero set on the whole plane, and the multiplicities of their zeros also agree. Namely, for every ,
Proof.
Therefore their Taylor expansions at any point agree, and the presence or absence of a zero and the order of the first nonzero Taylor coefficient also agree. Hence the multiplicities agree. □
Remark 6.156 (role of growth estimates). Lemma 6.82, Lemma 6.83, and Corollary 6.84 record that , , and are entire functions of finite order. However, the identity proof of this section does not use Carlson-type theorems or the Phragmén–Lindelöf principle, and uses only the agreement on an open disk obtained in Lemma 6.152 and Theorem 6.153.
Remark 6.157 (output of the analytic comparison layer).
Section 6.1 through the present section show that the
-side regularized-determinant comparison function obtained from the residual-free comparison interface is identical to the completed zeta function itself. In the finite-window counting below, we use
as an identity on the whole plane. The finite-window bridge and the defect staircase introduced below do not enter the proof of this global identity. They are subsequent auxiliary constructions recording the consequences of the self-adjoint Hilbert–Schmidt determinant model in bounded height windows. This section itself makes no assertion about the location of zeros; applications to zero counting are treated in the following sections.