WorksMathematics
Theta-Eta Mellin Transforms, Shifted Reflections, and Rigorous Approximation Theory for a Variant Theta Construction
Abstract
We develop a rigorous analytic framework for investigating a proposed functional equation associated with a variant theta construction. We prove the classical Mellin identity connecting the Jacobi kernel to the completed Dirichlet eta function, and extend its Mellin transform meromorphically to the whole plane with a single simple pole at the origin. Mellin uniqueness identifies as the unique kernel in a natural weighted class whose Mellin transform is the shifted completed eta function. We distinguish this Gaussian kernel from the weighted exponential series , whose Mellin transform is and obeys a different, explicitly derived reflection relation. We show that every affine reflection can be generated for a shifted completed eta or zeta function by choosing the shift appropriately; consequently, the occurrence of alone cannot identify the original variant with a shifted eta function. The corrected analytic product defined here is an elementary meromorphic multiplier of the completed zeta function and therefore has a precise functional equation. We prove an explicit eta-tail bound, a sharper alternating-tail asymptotic, a uniformly convergent Euler-transformed eta series with a geometric error bound, a uniform zeta-approximation bound away from the line , and a combined truncation estimate when both the zeta and weighted-exponential factors are truncated. We also determine the principal Laurent data and the cancellation of the gamma poles at the trivial zeta zeros for the corrected product. Reproducible high-precision experiments verify the stated error scales. The exact identification of the original variant with a shifted completed eta function remains open.
Introduction and status of the problem
The motivating study considers a finite complex-valued construction involving a gamma-type product, the weighted exponential series
and partial sums used as numerical approximations to the Riemann zeta function. The numerical study compares curves built from these ingredients and proposes replacing the usual reflected argument by in an equation for the logarithm of the constructed quantity.
Three questions must be kept separate:
(Q1) What exact Mellin transform of a classical theta kernel gives the completed Dirichlet eta function?
(Q2) Under what definition does a reflection follow rigorously?
(Q3) Which finite approximations converge to the stated limiting objects, and what quantitative errors accompany them?
The classical identities answer these questions for explicitly defined functions, but they do not by themselves identify the distinct weighted exponential construction in (1) with the Jacobi theta kernel. The revised analysis therefore distinguishes the original ill-defined limiting proposal from a corrected analytic surrogate, and supplies an independent, reproducible numerical study with explicit error bounds.
Scope and contribution. The Jacobi theta–eta Mellin identity and the completed zeta functional equation are classical; detailed proofs are included to make normalizations and domains explicit. The additional results are structural consequences developed for this investigation: (i) meromorphic continuation and a finite-part integral for the theta-kernel Mellin transform; (ii) a distinct functional equation for the Mellin transform of ; (iii) the full family of affine reflections generated by shifts; (iv) an exact reflection law for the corrected product; and (v) an explicit error bound when both factors in the finite product are truncated; (vi) an Euler-transformed eta expansion with a rigorous geometric tail bound; and (vii) a local singularity analysis of the corrected product, including its Laurent coefficients at and removable singularities at negative even integers; and (viii) a Mellin-transform uniqueness criterion that specifies the kernel required by the shifted eta identity. We also prove a sharper alternating-tail expansion explaining the observed slope on the critical line. These statements do not identify the corrected product with the original legacy construction, whose nonreal Euler limit does not converge. Because the external zero list and raw samples underlying the old crossing-index figures were not supplied, those legacy regressions are not claimed to have been regenerated or validated. No priority or novelty claim is made for identities that follow from the classical zeta functional equation.
Throughout, , for , and all functional equations are meromorphic identities unless a domain is specified. We use the standard completed functions
Obstructions in the earlier finite formulation
The real-part-based Euler limit
The ordinary Euler limit is
The earlier formulation instead replaces in the denominator by its real part. Define
Proposition 2.1. If and , then has no limit as . If , then .
Proof. The gamma recurrence gives
The gamma-ratio asymptotic yields
For this tends to . For , select integer sequences nearest to and . Along these sequences tends to and , respectively. The limit therefore does not exist.
Thus the real-part-based limit cannot serve as a complex gamma factor. In this revision we use the ordinary gamma function in the explicitly defined corrected product in Section 5; we do not silently identify it with the nonconvergent limit (4).
The weighted exponential series
For , summing a differentiated geometric series gives
Its Mellin transform is distinct from the Jacobi theta transform.
Proposition 2.2. For ,
Proof. For , absolute convergence permits interchange of the series and integral:
The identity (6) does not exclude a different transform identity for a larger construction. It establishes that the weighted series itself does not produce the eta Mellin transform under its natural Mellin integral. Any connection between the whole variant and the eta function requires an additional explicit identity.
Periodicity, truncation, and the reflection of the weighted-series Mellin transform
The closed form (5) has the equivalent representation
It follows that is an even meromorphic function of period , has no zeros, and has double poles precisely at . Thus, for fixed , its value along depends only on modulo ; this exact periodicity is a possible source of repeated patterns in plots involving the factor, and is unrelated by itself to a Jacobi theta–eta transformation. In particular, on each half-plane it is uniformly bounded in the imaginary part:
Indeed, with and , one has .
For , define the finite weighted sum . The tail has an exact formula and a useful explicit bound.
Proposition 2.3 (Weighted-exponential truncation bound). Let with and . Then
The convergence is locally uniform in and is exponentially fast on every closed half-plane .
Proof. The geometric-series identity and its derivative give, for ,
which proves (9). The inequalities and imply (10). On compact subsets of , the right-hand side converges uniformly to zero; when , it is . □
The Mellin transform in Proposition 2.2 also satisfies its own functional equation. Write for its meromorphic continuation.
Theorem 2.4 (Functional equation for the weighted-series Mellin transform). Write for the meromorphic continuation of the Mellin transform in Proposition 2.2. Then, as a meromorphic identity,
Equivalently,
with the quotient interpreted meromorphically. Thus the reflection of the Mellin variable is , whose fixed line is . The zeta factor itself reflects to ; this one-unit difference in the argument must be retained when translating the zeta functional equation to the Mellin variable.
Proof. The standard zeta functional equation, applied at , yields
Multiplying by and using
then simplifying gives (11) wherever the intermediate quotients are defined. Since , substitution yields (12). Both cross-multiplied identities extend meromorphically to all .
Ordinary partial zeta sums in the critical strip
Let . These sums converge to only for . For , Euler–Maclaurin summation gives
Since , the sequence diverges, including when is a nontrivial zero of . The finite sums are Dirichlet polynomials in this region; they are not convergent approximations to the analytically continued zeta function.
The logarithm used in the legacy routine
For , the principal complex logarithm is
The legacy C routine computes the two components as and , which represents rather than (14). A correct principal-branch implementation would store the real part as and the imaginary part as ; a continuous phase plot would additionally need branch unwrapping. At , the logarithm is undefined. The numerical experiments below use real quantities and do not treat them as complex logarithms.
The classical theta–eta Mellin identity
The Dirichlet eta function is
where the series converges in the stated half-plane and the right-hand side gives its analytic continuation. The singularity of the product at is removable for , which is entire.
Use the standard Jacobi theta convention
and set
Theorem 3.1 (Theta–eta Mellin identity). For every with , the integral converges absolutely and
Proof. For , absolute convergence justifies termwise integration in (17). Since
we obtain
To extend the equality, use the Jacobi transformation
As , , so . As , . Thus the Mellin integral converges absolutely for and is locally uniformly dominated on compact subsets of that half-plane. It defines a holomorphic function there. The right-hand side is also holomorphic there, and the identity theorem completes the proof. This classical formula is recorded in DLMF, Eq. 20.10.3. □
Theorem 3.2 (Meromorphic continuation of the theta-kernel Mellin transform). Let and let initially for . Then
where
Consequently, has exactly one pole, a simple pole at with residue 1. Moreover,
where is Euler’s constant. At positive integers, in particular,
Proof. The Jacobi transformation used in Theorem 3.1 gives as . At infinity, . These estimates imply that both integrals in (20) converge locally uniformly for every complex , so is entire by standard parameter-dependent integration. For , splitting the Mellin integral at 1 gives (19); since it equals there, it supplies the meromorphic continuation and shows that the only pole is at 0 with residue 1.
For the constant term, use and the standard values and to obtain and . The expansions and yield
Comparing constant terms in (19) proves (21). Finally, substitute in the Mellin identity and use , , and to get (22).
Theorem 3.3 (Mellin inversion for the Jacobi kernel). For every and ,
where the integral is absolutely convergent.
Proof. Set . The small- and large- estimates used above show that and its first two derivatives are integrable on and vanish at infinity. With the Fourier-transform convention , the substitution gives . Since , integration by parts twice gives , so . Fourier inversion at yields (23).
Theorem 3.4 (Mellin realization and uniqueness of the shifted eta kernel). For any and every with ,
Moreover, fix with . If measurable kernels satisfy
and their Mellin transforms agree at every , , then almost everywhere. Consequently, if a kernel in this weighted class has Mellin transform on the vertical line , then almost everywhere.
Proof. The first assertion follows by replacing by in Theorem 3.1; convergence is valid precisely when . For uniqueness, put . The substitution shows and
Uniqueness of the Fourier transform on implies almost everywhere. Changing variables back gives almost everywhere. Apply this result to and ; the latter belongs to the required weighted class because is integrable when
Remark 3.5. For , the function whose Mellin transform is the shifted completed eta function is exactly . Thus a claim that another kernel has transform entails, under the stated integrability hypotheses, equality with this weighted Jacobi kernel almost everywhere. This supplies a concrete kernel-level test for the missing correspondence; it does not assert that the source construction passes the test.
Remark 3.6. Theorem 3.1 is an exact theorem about the standard Jacobi kernel. The weighted series in (1) is a different object, as shown by Proposition 2.2. No equality between the manuscript’s full variant and or its Mellin transform is asserted here.
A second useful representation is the Fermi-type integral
For this follows by expanding and integrating term by term. Both sides are holomorphic for , so analytic continuation by the identity theorem establishes (25) throughout that half-plane.
The completed eta reflection and the shift one quarter minus s
The completed zeta function satisfies the classical meromorphic equation
Since , we obtain the completed eta equation.
Theorem 4.1 (Completed eta reflection). As a meromorphic identity,
Proof. By definition, and
Multiplication gives (27). The identity is interpreted meromorphically at exceptional points.
Theorem 4.2 (Shifted completed eta equation). Let .
Then
as a meromorphic identity.
Proof. Apply (27) at . The reflected completed eta argument is , and
Substitution gives (29).
Theorem 4.3 (The complete family of affine eta reflections). For any , define and . Then
as a meromorphic identity. Equivalently, wherever division is permitted,
Given any , taking produces a reflected argument . Moreover, the normalized function
satisfies the pure reflection meromorphically.
Proof. Apply Theorem 4.1 with argument . The reflected argument of is , which equals . This proves (30). The statement about arbitrary follows by solving . Dividing by the elementary factor gives ; the pure reflection follows from .
Corollary 4.4 (The quarter reflection is not diagnostic by itself). The argument is obtained by the choice , but any other affine reflection is obtained by another shift. Thus observing or postulating the argument does not identify a function with the shifted completed eta function unless the shift and the multiplicative normalization are derived independently from the definition of that function.
Proposition 4.5 (Multipliers preserve the shifted reflection with a correction factor). Let be meromorphic and set . Then
as a meromorphic identity.
Proof. Substitute into (30) and clear denominators on the open set where they are nonzero. The resulting identity extends meromorphically.
Remark 4.6 (Meaning of the quarter-shift). Theorem 4.2 establishes that a reflection is exact for the shifted completed eta function . It is a reparameterization of the classical eta reflection, not evidence by itself that the original variant has this symmetry. The fixed line of the reflection is . A functional equation for a logarithm requires, in addition, a proved multiplicative identity for the relevant function and a branch convention on a domain avoiding its zeros and poles.
A corrected analytic surrogate and its eta factorization
Because the real-part-based limit in (4) fails for nonreal , an analytic model must choose a valid gamma factor explicitly. The displayed product in the motivating manuscript contains ; the standard Euler limit (3) makes this . We use that choice in the following model. This is a corrected interpretation of the displayed product, not a claim that it reproduces every operation of the supplied legacy C routine.
Definition 5.1 (Corrected analytic product). For away from poles, define
The expression defines a meromorphic function by continuation wherever the factors are meromorphically defined.
Theorem 5.2 (Completed-zeta factorization and reflection of the corrected product). Let and let be as in Definition 5.1. Then
In particular, satisfies the meromorphic functional equation
After normalization, has the classical pure reflection. Its shifted normalization therefore has a pure reflection. The unnormalized product itself is governed by (34), not by a pure quarter reflection.
Proof. By the recurrence , Definition 5.1 gives
which proves (33). The completed zeta functional equation gives
where defined, with meromorphic continuation elsewhere. Substituting and (7) yields (34). The statements about normalized shifts follow directly by division by .
Proposition 5.3 (Exact eta factorization of the corrected product). At points where the displayed factors are finite and ,
The identity extends meromorphically.
Proof. Using , we have
The gamma recurrence gives (35).
Remark 5.4 (Novelty status). The factorization (35) is exact but is an immediate algebraic consequence of the product definition and the standard relation between eta and zeta. It is not a proof of the Jacobi theta Mellin identity for , and it does not establish a reflection for itself. The normalized shifted function equals and therefore obeys Theorem 4.2; this is a normalization of the classical eta identity, not a new functional equation for the unnormalized product.
A key consequence is that at any nontrivial zero of , the corrected product satisfies , provided its other factors are finite there. Hence is undefined. A finite approximation may be nonzero, but its logarithm is then a logarithm of a truncation residual and need not converge to a finite value. This is important when interpreting logarithmic plots formed from finite sums at zeta zeros.
Proposition 5.5 (Zero preservation and the logarithmic obstruction). Let be a nontrivial zero of . Then the corrected product is holomorphic at and has a zero of the same multiplicity as . In particular, is undefined for every branch of the complex logarithm. A finite truncation may be nonzero, but then measures the logarithm of a truncation residual; it is not a value of at $\rho.
Proof. A nontrivial zero satisfies , so neither nor has a pole there. Also is finite and nonzero because its poles lie on , which is disjoint from the critical strip. Thus with holomorphic and nonzero in a neighborhood of . Multiplication by such a factor preserves the zero multiplicity. Since a complex logarithm is defined only at nonzero values, does not exist.
Theorem 5.6 (Local singularity structure of the corrected product). Let be the meromorphic function in Definition 5.1. Its Laurent expansions at and are
For every integer , the singularity at is removable, and
At a nonzero point , , the order of is the order of the zero of at minus two (with order zero for a nonzero value); in particular, it has a double pole there whenever . Apart from the weighted-series pole lattice and , the gamma poles are cancelled by the trivial zeros of .
Proof. The expansions
follow from the Taylor expansion of sinh, the gamma expansion at 1, and the classical values , . Multiplying gives (36). At , the zeta function has residue one, while and , proving (37).
At , set . The gamma factor has expansion
while . The pole and zero cancel. The differentiated zeta functional equation gives
which yields (38); nonvanishing follows from and . Finally, at , the gamma and pi factors are holomorphic and nonzero and has a double pole with nonzero leading coefficient. Multiplication by , which is holomorphic at , changes the local order by the order of its zero. The remaining possible gamma poles occur at and were just shown to be removable; the remaining zeta pole is at 1. This proves the assertion.
Eta truncation and propagated error bounds
For , set
Theorem 6.1 (Explicit eta tail bound). If with , then
Consequently,
The convergence and the corresponding completed eta convergence are uniform on compact subsets of .
Proof. Let , , and . Then . Summation by parts gives, after letting the upper index tend to infinity,
Since
we obtain
Multiplication by proves (41). If is compact in , then and on . The bound is uniform on ; the gamma and pi factors are bounded there, proving the local uniform convergence assertions.
Corollary 6.2 (Eta-based zeta approximation). At points where , define
Then, for ,
The approximation converges locally uniformly on compact subsets of .
Proof. Divide (40) by . On a compact set avoiding the zero set of , the denominator is bounded away from zero, giving local uniform convergence.
Corollary 6.3 (Uniform zeta error away from ). Fix and . For satisfying and , one has
In particular, on the critical line ,
Proof. The reverse triangle inequality gives
When , this is at least , while and . Substitution in Corollary 6.2, together with , proves (44). If , then , so ; the general bound yields (45).
Corollary 6.4 (Error bound for the corrected product). For in Definition 5.1, define
Then
Proof. The factor multiplying in (32) is independent of . Multiplying the estimate in Corollary 6.2 by its modulus proves the result.
Theorem 6.5 (Error bound when both product factors are truncated). Fix with and . Let
where is the finite sum in Proposition 2.3. Put and
Then
Thus for each such . The convergence is locally uniform on compact subsets of .
Proof. Write . The exact decomposition
and the triangle inequality give
Apply Corollary 6.2 to the first error and Proposition 2.3 to the second. This proves (47). On compact sets in the stated domain, is bounded below by a positive constant and is bounded away from zero; the factors are bounded and both tail bounds tend uniformly to zero.
A geometrically convergent Euler transform for eta
The ordinary eta partial sums have algebraic convergence on the critical line. A second representation follows by applying the Euler transformation for alternating series to the eta series. For , set
Theorem 6.6 (Euler-transformed eta series and explicit geometric error). For every with ,
The series converges absolutely, and its truncation satisfies
The convergence is locally uniform on . For every compact in this half-plane, the bound is uniform on with constant .
Proof. The Laplace representation gives
Because , Tonelli’s theorem applied to absolute values shows
Thus the transformed series is absolutely convergent and its terms may be interchanged with the integral. Summing the geometric series gives
where the last identity is the Fermi-type representation (25).
For the tail, summing the geometric series from yields
Consequently,
The gamma function has no zeros or poles in , so the constant is continuous and bounded on any compact subset; the same estimate proves local uniform convergence.
Remark 6.7 (Numerical stability). The outer series has geometric truncation error, but the finite differences in (48) involve alternating binomial sums and can suffer severe cancellation in ordinary precision. A practical implementation should use sufficiently high precision or a stable integral/recurrence evaluation. The bound in (50) is rigorous but may be conservative for large because is small.
A sharper alternating-tail asymptotic
The upper bound in Theorem 6.1 is uniform and convenient, but it is not asymptotically sharp. A two-term expansion, with a rigorous remainder, explains the observed slope.
Theorem 6.8 (Alternating eta-tail expansion). Fix with and put . As ,
In particular,
If is a zero of with , then and
Consequently,
and the asymptotic log–log slope is . For fixed , the secant slope between indices and is .
Proof. Let . For , the alternating tail admits the Laplace representation
To justify it, first integrate the finite sum through using
The finite geometric sum is . The remaining integral is bounded in modulus by
which tends to zero. The limit gives (56).
Near ,
Insert this expansion into (56). Integration of each monomial gives , and hence the three displayed terms in (52). To bound the remainder, split the integral at . On , the Taylor remainder is bounded by ; its integral is . On , the difference between the bounded function and the degree-three polynomial has at most polynomial growth, while makes its integral exponentially small in . This proves (52), and factoring out yields (53).
At a zeta zero in the critical strip, , so . Thus equals the modulus of the tail. Taking the modulus of (53), and using , gives (54). Taking logarithms yields (55). Applying that expansion at and proves the final secant-slope statement.
Theorem 6.9 (Finite-product residual at a zeta zero). Let be a nontrivial zero of , with , and let be the doubly truncated product in Theorem 6.5. Define
Then and, as ,
Consequently,
and the log–log slope of the truncation residual tends to . In particular, at a zero on the critical line the asymptotic slope is . Along either fixed-parity subsequence of sufficiently large , a consistently continued logarithm also satisfies
where and is constant on that subsequence. The alternating sign prevents one from assigning a single unwrapped phase formula across both parities without an additional convention.
Proof. Since , . The factor is finite and nonzero, and is finite and nonzero because its poles lie on the imaginary axis. Hence . By Theorem 6.8 and ,
Also Proposition 2.3 gives , whose relative error is (indeed it is smaller than every inverse power). Substituting these formulas into
proves (57). Taking moduli and using proves (58). Taking a logarithm of the factor close to 1 gives the parity-subsequence formula. Since , the quantity is a truncation residual, not a value of at a point where exists.
Numerical experiments and reproducibility
What is recomputed
The original plots are not reproduced as if they were validated outputs: the supplied source refers to an external zero list (zero1.h) and original figure files/raw samples that were not supplied as standalone inputs, and the legacy definitions and logarithm implementation require correction. Instead, this section reruns a fully specified corrected calculation based on Definition 5.1 and
Corollaries 6.2–6.4. The code uses eta partial sums to evaluate in the critical strip, truncates the weighted exponential series using its exact geometric tail, and records observed errors together with rigorous truncation bounds. This is a reproducible replacement experiment, not a claim to have recreated the old crossing-index regressions.
Reference special-function values and ordinary sums were computed at 50 decimal digits with mpmath; the Euler-transformed binomial sums were computed at 100 decimal digits to control cancellation. Compensated summation was used for the long ordinary finite sums. The truncation bounds below are analytic bounds for exact sums. Floating-point or arbitrary-precision roundoff is a separate source of numerical error and is not included in those analytic tail bounds. The attached script reproduce_experiments.py regenerates all tables, CSV files, and figures.
Eta truncation at the first nontrivial zero
Let be the first nontrivial zeta zero. The table reports the absolute eta-series truncation error and the bound (40) for selected powers of two.
| absolute error | bound | error/bound | |
| 256 | 1.76450 | ||
| 1,024 | |||
| 4,096 | |||
| 16,384 | |||
| 65,536 | |||
| 262,144 |
Table 1. Eta truncation at . The error is .
A least-squares fit of against , for 11 powers of two from through , gives slope and . This is a deterministic diagnostic fit, not an inferential regression; no statistical confidence interval is attached. Its value agrees with the exponent predicted by (54).
The same asymptotic propagates to the corrected product. The following table compares with its leading asymptotic. The complete data, including the rigorous bound, are in corrected_product_zero_residual.csv. For , the ratio to the leading asymptotic is approximately 1.0000009540; the log–log regression over has slope and . The slope is predicted by Theorem 6.9 and is not evidence for a functional equation.
| leading term | ratio | ||
| 256 | 1.00135282 | ||
| 1,024 | 1.00026770 | ||
| 4,096 | 1.00006251 | ||
| 16,384 | 1.00001535 | ||
| 65,536 | 1.00000382 | ||
| 262,144 | 1.00000095 |
Table 2. Corrected-product residual at the first nontrivial zero and its leading asymptotic.
Figure 1. Absolute eta truncation error and the explicit upper bound at the first nontrivial zero. Both decay at the scale ; the general bound is conservative.
Euler-transformed eta acceleration
We also evaluate the Euler-transformed series at the first nontrivial zero. The finite-difference sums are computed at 100 decimal digits to mitigate binomial cancellation. The limiting eta value is zero at an exact zeta zero; the ordinate supplied to the calculation is a 100-digit numerical approximation, whose root-location error is far below the displayed residuals. Selected results are shown in Table 3 and the full data are included in eta_euler_acceleration.csv. For example, the residual at is approximately , substantially smaller than the residual of the ordinary partial sum with . The number of scalar summands in the finite-difference definition through is , though its higher arithmetic precision has to be accounted for in a fair cost comparison.
| absolute residual | rigorous bound | residual/bound | |
| 8 | |||
| 16 | |||
| 24 | |||
| 32 | |||
| 40 | |||
| 48 | |||
| 56 | |||
| 60 |
Table 3. Euler-transformed eta approximation at the first nontrivial zero; the bound is Theorem 6.6.
This experiment demonstrates an alternative convergent representation, not a new functional equation. At large imaginary parts the bound’s factor can be large, so rigorous certification and numerical efficiency must be assessed together.
Figure 2. The scaled residual tends toward , as predicted by the first-term alternating-tail asymptotic.
Eta-based evaluation of the zeta function away from a zero
At , use . The propagated bound is given by (43).
| absolute error | bound | error/bound | |
| 256 | |||
| 1,024 | |||
| 4,096 | |||
| 16,384 | |||
| 65,536 | |||
| 262,144 |
Table 4. Absolute error and bound for the eta-based zeta approximation at .
For 11 powers of two from through , the descriptive least-squares slope of the log absolute zeta error versus is , with . The exact value used for comparison is to the displayed precision. The analytic product prefactor
has . At , the computed error in the fully truncated
Figure 3. Finite corrected-product residual at the first nontrivial zeta zero. The residual follows the leading asymptotic; the rigorous bound is conservative.
is approximately , while the combined bound from (47) is approximately .
Truncating the weighted exponential factor and the full product
The exact formula and bound in Proposition 2.3 were evaluated at . The observed truncation error is below the explicit bound at every tested power of two. The series tail is exponentially small in , in contrast with the algebraic eta-series error on the critical line.
For the full finite surrogate, both approximations are truncated at the same index:
The combined error bound is Theorem 6.5. At and , the computed error is approximately and the combined rigorous bound is approximately . The bound is conservative, as expected; it is an analytical guarantee, not a confidence interval.
High-precision identity checks
At , 50-decimal-digit evaluation gives residuals of approximately for the eta factorization (35), for the corrected-product reflection (34), and for the shifted eta equation (29). At , the residual in the weighted-series Mellin equation (11) is approximately . These are implementation sanity checks of identities already proved symbolically; they are not independent proof and should not be interpreted as evidence for the unproved legacy equation.
Figure 4. Euler-transformed eta residual at the first nontrivial zero and the explicit geometric error bound. The bound is rigorous but conservative for this ordinate.
What the revised slopes do and do not show
The corrected eta-series calculation shows that a log–log regression of the truncation error at a critical-line zero naturally has slope near . This behavior is predicted by the alternating-tail expansion. It does not establish a functional equation. It is also not the same statistic as the legacy manuscript’s regressions of logarithms of the indices where a plotted curve crosses an axis. Since the old raw crossing sequences and their exact finite definitions are unavailable or inconsistent, the old slopes are not reinterpreted here. Any future claim about them must be based on regenerated raw data from a corrected and fully specified algorithm.
The missing correspondence and research questions
The remaining mathematical problem concerns the original variant, not the standard Jacobi kernel and not merely the corrected analytic product .
Research question 8.1 (Exact theta–eta identification). After a corrected limiting definition of the original variant has been supplied, is there an explicit meromorphic factor and a shift such that
Figure 5. Eta-based zeta approximation error and the propagated rigorous truncation bound at .
on a nonempty open set? The factor must be specified independently from the quotient ; otherwise the statement is tautological.
The real-part Euler limit must first be replaced or eliminated, and each finite approximation to must converge to analytic continuation in the domain being studied. If (60) is proved with , the quarter-shift equation for the normalized function follows from Theorem 4.2. If the identity is false, the useful outcome would be a counterexample or a different exact/asymptotic description of the constructed sequence.
The next computational study should therefore:
Step 1. freeze a single mathematical definition of the original variant and distinguish its limiting function from each finite approximant;
Step 2. use a valid complex gamma factor and a convergent or error-controlled representation of ;
Step 3. compare the proposed functional-equation sides at points away from zeros as well as at zeros, recording absolute and relative residuals with precision and truncation depth specified;
Step 4. repeat calculations with increasing precision and independent evaluation methods;
Step 5. define the branch of every complex logarithm only after the multiplicative identity is established, avoiding zeros and poles;
Step 6. release the root list, raw numerical arrays, and plotting script so that regression statistics can be independently reproduced.
Figure 6. Weighted-exponential truncation error and its explicit geometric-tail bound. The exact tail formula was used for evaluation to avoid artificial cancellation from long direct summation.
Conclusion
The results have four distinct roles. First, the classical Jacobi kernel has Mellin transform in ; the kernel splitting also provides its meromorphic continuation, the residue and finite part at , several exact moment integrals, and a Mellin inversion formula. A Mellin uniqueness argument proves that the shifted transform corresponds to the weighted kernel within the stated weighted class. Second, the weighted exponential series in the source construction is analytically distinct: its Mellin transform is and its reflection equation is a meromorphic relation under (center line ), because the zeta factor has shifted argument . Its finite sum has an exponentially decaying, explicit tail. Third, the completed eta reflection belongs to a whole family of affine reflections obtained by shifting the argument. The choice yields , but that observation alone is not diagnostic of the original variant. Fourth, the corrected product is exactly with ; it obeys a fully specified functional equation with an elementary meromorphic multiplier. Its Laurent data at and , and the cancellation of gamma poles at negative even integers, are also explicit. When both factors are truncated, the product error has the explicit bound in Theorem 6.5.
The Euler-transformed eta series supplies a second representation with a rigorous geometric truncation bound, although its finite differences require care with cancellation. The stronger alternating-tail expansion explains why ordinary eta-series residuals at a zero of real part have log–log slope approaching . In particular, the slope on the critical line is predicted by a proved asymptotic, not evidence for a functional equation. The numerical experiments and residual checks are reproducible diagnostics of these stated identities and bounds; they do not constitute independent proofs and do not reconstruct the legacy crossing-index plots.
Figure 7. Error in the corrected finite product when both the eta-based zeta approximation and the weighted-exponential factor are truncated, with the combined rigorous bound from Theorem 6.5.
The original variant remains the unresolved object. Its real-part-based Euler limit does not define a complex function away from the real axis, and its ordinary zeta partial sums do not converge in the critical strip. A new version of the variant must first be defined unambiguously. Only then can one prove or refute an independently specified identity , or derive a different transform law. The auxiliary results here give a mathematically consistent base for that work without claiming that the missing correspondence has already been established.
Reproducibility files and numerical conventions
The supplementary archive contains:
reproduce_experiments.py: 50-digit reference evaluation, compensated eta partial sums, error-bound calculations, regressions, and figure generation;eta_zero_truncation.csv: eta partial sums, observed errors, and analytic bounds at ;eta_euler_acceleration.csv: Euler-transformed eta approximants, observed residuals, and geometric bounds at ;fig_eta_euler_acceleration.pdf: Euler-transformed eta residuals and certified upper bounds;zeta_eta_approximation.csv: eta-based zeta approximations and their propagated bounds at ;
corrected_product_error.csv: error and combined bound for the product with both factors truncated;weighted_exponential_truncation.csv: weighted-series truncation error and its explicit bound;corrected_product_zero_residual.csv: finite-product residuals at the first nontrivial zeta zero;fig_eta_error_bound.pdf: eta-tail error and bound;fig_eta_scaled_error.pdf: scaled eta-tail asymptotic;fig_product_zero_residual.pdf: product residual at a zero;fig_zeta_eta_error.pdf: eta-based zeta approximation error;fig_weighted_exponential_error.pdf: weighted-series truncation;fig_corrected_product_error.pdf: two-factor product error.
Run the experiment from the extracted archive directory with
python reproduce_experiments.py
The script requires Python 3.10 or later and the packages mpmath, numpy, and matplotlib. The regression results are deterministic summaries of the displayed truncation sequence; they are not statistical estimates from random samples.
References
- [1]H. M. Edwards, Riemann’s Zeta Function, Dover Publications, New York, 1974.
- [2]T. M. Apostol, Introduction to Analytic Number Theory, Undergraduate Texts in Mathematics, Springer, New York, 1976.
- [3]F. W. J. Olver et al. (eds.), NIST Digital Library of Mathematical Functions, Chapter 20, Section 20.10, Eq. 20.10.3, “Integrals” (Mellin transform of 1 − θ₄), National Institute of Standards and Technology. Available at https://dlmf.nist.gov/20.10.
- [4]F. W. J. Olver et al. (eds.), NIST Digital Library of Mathematical Functions, Chapter 25, Sections 25.2 and 25.4, “Zeta and Related Functions” and “Reflection Formulas”, National Institute of Standards and Technology. Available at https://dlmf.nist.gov/25.2 and https://dlmf.nist.gov/25.4.






