The Gold Standard of Zeta Function | Distinguishing Pointwise Error Bounds from Uniform Accuracy Across an Interval

A pointwise statement fixes one input before it speaks about error: for this s₀, the computed value A(s₀) differs from ζ(s₀) by at most ε. A uniform statement reverses the order of attention: one ε must work for every s in a named set D. The same symbol ε can therefore carry a much stronger promise when the quantifier changes.

Write the two claims side by side. Pointwise: |A(s₀)−ζ(s₀)|≤ε₀. Uniform: sup over s∈D of |A(s)−ζ(s)|≤ε. The supremum is not decorative notation. It requires the certificate to survive the worst allowed input, including inputs that were never printed in a table.

Before computing, record D exactly. A vertical segment, a rectangle and a finite list are different sets even when their plotted points look similar. State whether endpoints are included, whether a pole or branch-sensitive transformation is excluded, and whether the target is ζ itself, Hardy’s Z-function, a derivative or a transformed residual.

Contents · Next chapter

Suppose a trusted routine encloses ζ(1/2+20i), ζ(1/2+22i) and ζ(1/2+24i) to within 2×10⁻⁸. Those are three mathematical certificates at three inputs. They say nothing by themselves about t=21.4 because no rule has connected that input to a certified point.

Sampling coverage is the argument that bridges unsampled inputs. It may come from a derivative bound, interval evaluation of a whole box, a Lipschitz constant, a validated Taylor model or a theorem tailored to the chosen representation. A dense grid is useful evidence only when the maximum spacing and the permitted variation between grid points are also controlled.

Keep the two ledgers separate. The evaluation ledger records rounding, truncation and representation error at each certified node. The coverage ledger records how far any permitted input can lie from a node and how quickly the error function may change. Adding rows to one ledger cannot silently complete the other.

Contents · Previous chapter · Next chapter

The notation A(s) must name a complete procedure, not merely a formula fragment. Record the representation of ζ, the number of terms or stopping rule, the precision, the treatment of a remainder and any transformation used to avoid cancellation. A change in one of these can change the error function across the interval.

NIST DLMF §25.18 notes that general zeta computation and critical-line computation commonly use different tools, including an expansion for general s and the Riemann–Siegel formula for 1/2+it. A bound proved for one representation, region and parameter rule does not automatically accompany another implementation with a similar numerical output.

Domain conditions belong beside the result. If a remainder theorem assumes t≥T, if an expansion excludes the pole at s=1, or if a denominator interval may contain zero, the certificate stops at that boundary. Software success outside the proved domain is an observation to investigate, not permission to extend the theorem by habit.

Contents · Previous chapter · Next chapter

Break total error into named components: representation or truncation error, floating-point or interval rounding, input uncertainty, and coverage between certified subdomains. Some components combine by addition of absolute bounds; others require a more careful dependency analysis. The budget should say which rule was used and why.

A fictional target of 10⁻⁷ might reserve 3×10⁻⁸ for truncation, 1×10⁻⁸ for rounding, 5×10⁻⁸ for between-node variation and 1×10⁻⁸ as an implementation margin. This allocation is not universal. Its value is that a failed part can be diagnosed without pretending that extra digits in another part compensate.

Do not count the same uncertainty twice, and do not omit a dependency because two bounds arrived from different code paths. If the derivative bound and point evaluation reuse an uncertain coefficient, their worst cases may move together. State whether the final enclosure is a simple conservative sum or a validated joint calculation.

Contents · Previous chapter · Next chapter

For the teaching interval t∈[20,24], let A(t) approximate ζ(1/2+it). At t=20, 22 and 24, a validated calculation returns enclosures whose radii are no more than 2×10⁻⁸. The pointwise claim is clear: each listed input has its own rigorous inclusion under the recorded method.

The three centres may look smooth on a graph, but smooth-looking values do not supply an error bound. A plotting library connects samples for display; it does not prove that the true error stays below the line segment or that no narrow excursion occurs between nodes. Visual continuity is not a substitute for a quantitative variation bound.

Preserve each node’s full interval rather than only a rounded midpoint. If a later sign argument depends on the enclosure excluding zero, the midpoint alone loses the decisive evidence. Also preserve the software version, precision and exact input construction so another reader can reproduce the same point claim.

Contents · Previous chapter · Next chapter

Let E(t)=A(t)−ζ(1/2+it). Suppose a justified calculation gives |E′(t)|≤6×10⁻⁷ for every t in [20,24]. Any input is at most one unit from the nearest node when nodes occur at 20, 22 and 24. The mean-value argument then permits as much as 6×10⁻⁷ additional error between a node and that input.

Combining the point radius and the variation allowance gives 2×10⁻⁸+6×10⁻⁷=6.2×10⁻⁷. That supports a uniform bound of 6.2×10⁻⁷ under the stipulated assumptions. It does not support the desired 10⁻⁷ bound, even though every printed node is much more accurate than 10⁻⁷.

The calculation reveals the repair. With maximum distance δ from any input to a certified node, require 2×10⁻⁸+(6×10⁻⁷)δ≤10⁻⁷. Thus δ≤0.1333… . A uniform grid would need spacing no more than about 0.2666, unless a sharper local derivative bound or a different interval method reduces the variation allowance.

Contents · Previous chapter · Next chapter

Grid claims often fail at the edges. If the first certified node is 20.1 but the domain begins at 20, the left endpoint is 0.1 away even when interior nodes are tightly spaced. The coverage calculation must include both endpoints and every irregular gap created by adaptive refinement.

Sort the nodes and compute the largest uncovered radius: the left-edge distance, half of each interior gap, and the right-edge distance. For nodes 20, 20.25, 20.50, …, 24, the radius is 0.125. The fictional derivative allowance contributes 7.5×10⁻⁸, and the 2×10⁻⁸ point radius brings the total to 9.5×10⁻⁸.

This passes the 10⁻⁷ teaching target with only 0.5×10⁻⁸ of room. Report that narrow margin. A certificate near its threshold is more sensitive to a rounded derivative bound, a larger point radius at one node or an implementation change than a comfortable certificate would be.

Contents · Previous chapter · Next chapter

A table can establish a uniform claim over a finite set: every row was checked. It cannot redefine a real interval as that set. The difference matters most near zeros, sharp phase changes, cancellation regions or algorithm-switch boundaries, where behaviour between convenient sample points can be consequential.

Increasing the table from three nodes to three million still leaves a logical step. The step may become easy to justify because the maximum gap is tiny, but it remains necessary. State the theorem, enclosure or continuity bound that turns finite coverage into continuum coverage and record the constants used.

If no bridge is available, narrow the wording honestly: “At the listed grid points, the verified error was below…” This is useful reproducible evidence. It becomes misleading only when the finite observation is silently promoted to “throughout the interval” or “for all t” without the missing argument.

Contents · Previous chapter · Next chapter

A different route evaluates the approximation and target relationship over an interval input such as t∈[20,20.25]. NIST DLMF §3.1 explains that interval arithmetic uses outward-rounded operations to produce rigorous inclusion regions. A successful enclosure can cover infinitely many inputs represented by that interval.

Naive interval evaluation can be wide because the same variable appears repeatedly and dependencies are forgotten. Splitting the domain, rewriting the formula, using Taylor models or isolating monotone pieces may tighten the result. A wide enclosure is not a software failure; it is evidence that the present formulation does not prove the desired claim.

Record the entire subdivision. A list of successful cells is incomplete if one difficult cell was skipped. The union of the certified cells must equal the stated domain, with shared boundaries handled consistently. A machine-checkable interval list and a human-readable coverage summary serve different but complementary readers.

Contents · Previous chapter · Next chapter

A convergent or asymptotic representation introduces an analytic remainder; machine evaluation introduces rounding. Interval arithmetic can enclose rounding, but it does not invent a bound for terms that the mathematical program omitted. Conversely, a theorem about the omitted tail does not bound floating-point cancellation inside the retained calculation.

For each cell, store an interval for the evaluated main expression and a separately justified interval for the analytic remainder. Their interval sum encloses the full target if the assumptions match. This mirrors the discipline used in the specialist guide on Riemann–Siegel truncation, while the present task adds coverage over a continuum of inputs.

When the representation changes at a threshold, certify both sides and the transition. An algorithm that uses one term count below t=22 and another above it may create a discontinuous approximation A even though ζ is analytic. The uniform error analysis must follow the implemented A, including its switching rule.

Contents · Previous chapter · Next chapter

A reproducible record names the mathematical identity, parameter rules, precision, interval library or directed-rounding method, source version and domain partition. It stores enough intermediate bounds to explain why the final maximum is valid rather than asking a reviewer to trust a single exported number.

Use exact or unambiguous inputs. Decimal text, binary floating-point and rational endpoints can identify slightly different intervals. If a cell is intended to start at 20.25 exactly, record how that number was constructed. Adjacent cells should not acquire a microscopic gap through incompatible endpoint conversion.

Reproduction should include an independent path where possible: a second representation at selected inputs, higher precision, or a separate bound on a derivative. Agreement is not itself proof, but disagreement is a valuable alarm. Keep both the passing result and the test capable of exposing a future regression.

Contents · Previous chapter · Next chapter

A uniform value bound can support a sign claim only when the approximate value stays farther from zero than the error bound. If A(t)≥4×10⁻⁶ throughout a cell and |A−Z|≤1×10⁻⁶ there, then Z(t) is positive on that cell. Pointwise positive samples cannot establish the same conclusion between them.

Near a possible zero, the margin shrinks and subdivision may be required. If the enclosing interval for Z contains zero, report “sign unresolved” for that cell. Do not force a sign from the midpoint. The unresolved state is precisely where the next root-isolation method should concentrate effort.

This transfer also shows a limit. A certified sign change across endpoints proves at least one zero under continuity, but it does not by itself prove uniqueness, simplicity or a complete zero count. Those stronger claims need isolation and counting evidence described by the existing Zeta Function specialist branches.

Contents · Previous chapter · Next chapter

Uniform grids spend equal effort where the error changes slowly and rapidly. Adaptive subdivision can split only cells whose enclosure is too wide or whose sign is unresolved. The efficiency is legitimate when the stopping rule is fixed and every final leaf cell is retained in the coverage record.

A dangerous implementation keeps successful cells and silently drops cells that exceed time or memory limits. The displayed maximum then summarizes the easy region. Treat timeout, overflow and excessive width as unresolved outcomes. The published domain is the union of proved cells, not the domain requested before computation.

For the teaching interval, suppose twelve cells pass at width 0.25 but the cell [21.75,22] remains wide. Splitting it into four width-0.0625 cells may resolve the bound. If one subcell still fails, the honest uniform certificate excludes or flags that subcell; nearby success cannot cover it by association.

Contents · Previous chapter · Next chapter

Move the interval from [20,24] to [200,204]. The same grid spacing does not inherit the earlier derivative enclosure, truncation rule or rounding behaviour. Higher t can change oscillation, term counts and cancellation. Transfer means repeating the domain-sensitive parts, not copying the final ε.

Change instead from the critical line to a rectangle with real part between 0.45 and 0.55. A one-dimensional derivative in t no longer controls motion in the real direction. The certificate now needs bounds for both directions or a two-dimensional interval enclosure. A plot of the centre line leaves most of the rectangle unexamined.

The reusable method is the ledger: define the set, select a representation valid there, bound analytic and numerical error, cover every input, and audit gaps. The numeric constants are local evidence. This distinction lets a learner transfer the reasoning without pretending that one successful certificate is universal.

Contents · Previous chapter · Next chapter

A sequence of approximations Aₙ(s) may converge to ζ(s) at every fixed s while lacking one N that works for all s in a chosen set. Pointwise convergence permits the required N to depend on s. Uniform convergence requires an N chosen from ε and the domain, before any particular s is selected.

This distinction matters when interchanging limits, differentiation or integration, and when turning an algorithm family into a region-wide guarantee. Do not infer uniform convergence because several curves look close. Use the theorem’s stated mode of convergence and its domain, then connect it to the finite computation separately.

The numerical certificate in this article is not a proof that an approximation family converges uniformly as n tends to infinity. It certifies one implemented approximation over one finite domain. Keep the finite algorithm claim, the asymptotic theorem and the visual comparison in separate sentences.

Contents · Previous chapter · Next chapter

Replace “The zeta values are accurate to seven decimal places on [20,24]” with a claim that identifies the norm and evidence: “The validated enclosure gives a maximum absolute error below 10⁻⁷ for every t in [20,24], using the recorded subdivision and assumptions.” Decimal-place language can be ambiguous near rounding boundaries and varying magnitudes.

If only points were certified, say so: “At grid points spaced 0.25 apart, the pointwise absolute-error enclosures were below 2×10⁻⁸.” Add that no continuum claim was made unless a bridge bound was applied. This narrower sentence is strong because another reader can reproduce exactly what it says.

Avoid “verified on the interval” when the certificate excludes a pole, unresolved cell or endpoint. List exclusions beside the headline result. A footnote separated from the domain label is easy to miss and can turn a correct technical record into a misleading summary.

Contents · Previous chapter · Next chapter

Do many accurate points imply uniform accuracy? No. They need a validated rule controlling the spaces between them. Can continuity alone provide a usable number? Continuity on a compact interval implies uniform continuity, but a computational certificate still needs an explicit modulus, derivative bound or interval enclosure.

Is interval arithmetic automatically tight? No. It is designed for rigorous inclusion, and dependency or wrapping can make an enclosure wide. Subdivision and better formulations may help. Does a uniform absolute bound imply a uniform relative bound? No. Relative error can become unbounded where the true value approaches zero.

Can an asymptotic big-O statement be used as a numerical bound? Only after its constant and applicable range are made explicit for the case. The notation describes growth under stated limits; it is not, by itself, a ready error bar for a particular interval.

Contents · Previous chapter · Next chapter

Use NIST DLMF §25.18 for zeta computation routes and DLMF §3.1 for arithmetic error measures and interval arithmetic. Read the exact formula section used by an implementation; a methods overview does not replace representation-specific assumptions.

Continue with Separating Riemann–Siegel Truncation from a Certified Remainder Bound, Distinguishing a Small Residual from a Certified Isolated Zero and Separating Zero-Counting Height from the Number of Verified Zeros. Each owns a different inferential step.

Final transfer check: given point radius 3×10⁻⁹, derivative bound 4×10⁻⁷ and grid spacing 0.4 with certified endpoints, the farthest input is 0.2 from a node. The uniform bound is at most 3×10⁻⁹+8×10⁻⁸=8.3×10⁻⁸. State the assumptions, then explain why the same answer cannot be reused after changing the domain or representation.

Contents · Previous chapter · Next chapter

An absolute bound controls |A−ζ| in the units of the function value. A relative bound divides by |ζ| or another scale. Near a zero, the denominator can become arbitrarily small, so a useful uniform absolute certificate may coexist with an unusable or undefined uniform relative certificate.

Suppose the absolute error is below 10⁻⁸ across a cell, while a validated enclosure allows |ζ| to approach zero. It is wrong to advertise eight-digit relative accuracy throughout that cell. Away from zeros, if a separate lower bound proves |ζ|≥10⁻³, then the relative error is at most 10⁻⁵ under the same absolute bound.

State the norm and scaling rule. Maximum absolute error, maximum relative error, componentwise complex error and phase error answer different questions. A software option named tolerance may govern an internal stopping rule rather than any of these externally verifiable quantities.

Contents · Previous chapter · Next chapter

The largest error observed on a grid is a sampled maximum. A certified uniform bound controls the supremum over the whole domain. The sampled maximum can be much smaller because the worst point lies between samples or because the certificate includes conservative uncertainty.

Keep both numbers when they serve different purposes. The sampled maximum helps compare implementations at common test points. The certified bound supports a guarantee under stated assumptions. Reporting only the smaller observed number hides the coverage question; reporting only the conservative bound can hide useful performance variation.

For a regression test, store the grid, high-precision reference method and observed maximum separately from the proof certificate. A future build can pass the theorem-based limit yet show a large regression in typical accuracy, or improve typical accuracy while accidentally breaking a coverage assumption.

Contents · Previous chapter · Next chapter

A certificate is defined as much by its unresolved region as by its successful cells. Retain cells that overflow, time out, cross a singular condition or produce enclosures wider than the target. Do not remove them before calculating a headline pass rate.

Classify failure. A wide but valid interval calls for subdivision or a better formulation. A violated theorem assumption calls for a different representation. A precision exhaustion calls for more resources or a narrower claim. A software exception whose mathematical status is unknown calls for investigation, not automatic exclusion.

Publish a coverage manifest containing every final cell, status, bound and method version. The union of passing cells should be mechanically compared with the claimed domain. This simple set check prevents an attractive plot from hiding a microscopic but logically decisive hole.

Contents · Previous chapter · Next chapter

A reviewer should be able to answer: What is the exact domain? What function and normalization are bounded? What approximation was implemented? Which theorem bounds the analytic remainder? How are rounding and input construction enclosed? How does finite computation cover every input?

The review should also locate algorithm switches, excluded points, unresolved cells, maximum gap, derivative or interval bounds, precision, software version and reproduction evidence. If one item is unknown, narrow the claim until the missing evidence is supplied.

Have a second reader reconstruct the bound from the retained cell record rather than from the prose conclusion. Agreement on the final ε is useful, but compare the intermediate maxima and coverage union too. Two wrong pipelines can print the same rounded headline.

Contents · Previous chapter · Next chapter

A new case has domain [30,31], point radius 4×10⁻⁹, maximum node spacing 0.10 and a verified derivative bound |E′|≤9×10⁻⁷. With certified endpoints, the farthest input is 0.05 from a node. The coverage allowance is 4.5×10⁻⁸, so the total is 4.9×10⁻⁸.

This supports a 5×10⁻⁸ uniform absolute target with a margin of 1×10⁻⁹ under the stated assumptions. The margin is small. Ask whether the derivative bound and point radius were rounded upward, whether every gap really is at most 0.10 and whether endpoints share the same representation.

Now change only the spacing to 0.12. The farthest distance becomes 0.06 and the total bound becomes 5.8×10⁻⁸. The point values have not worsened, but the uniform target fails. This is the transfer insight: coverage geometry can change the claim while every printed evaluation remains excellent.

Contents · Previous chapter · Next chapter

A plot may sample a wider interval than the domain on which the approximation theorem applies. Mark the certified domain before drawing or evaluating. Points outside it can still be exploratory, but their apparent agreement cannot inherit a bound whose hypotheses no longer hold.

Conversely, a theorem may cover the full interval while the plot clips large residuals or uses a vertical scale that hides small failures. Preserve numerical values and interval cells alongside the image. Visual smoothness is evidence about presentation, not a replacement for the stated error inequality.

For transfer, change the requested interval from [2,3] to [1.9,3.1]. Recheck poles, zeros, branch conventions, approximation validity and arithmetic precision at the new ends. Extending the axis is not the same operation as extending the certificate.

Contents · Previous chapter · Next chapter

One route from nodes to an interval is a Lipschitz argument. If a valid bound |e′(s)|≤L holds throughout a cell and a node value satisfies |e(s0)|≤ε0, then |e(s)|≤ε0+L|s−s0| in that cell. The derivative bound supplies the missing between-node control.

Do not estimate L from a few sampled slopes and call the result rigorous. A steep feature can lie between samples, especially near zeros, poles or cancellation. Establish the derivative bound analytically or with certified interval evaluation under the same domain and precision assumptions.

This method also guides adaptive subdivision. Cells with a large L or a narrow tolerance need smaller radii, while calm regions can stay broad. The final certificate records node error, derivative bound, cell radius and resulting uniform bound so another reader can recompute the maximum.

Contents · Previous chapter · Next chapter

A useful interval certificate identifies the function and approximation, normalization, domain, excluded singularities, arithmetic precision, subdivision, local enclosures, error norm and maximum bound. If code generated it, record the version and parameters needed to reproduce the result.

Keep unresolved cells in the output with their reason: interval too wide, enclosure dependency, precision exhausted or hypothesis failure. A red or unknown cell is not an embarrassment to hide; it shows exactly where the claim stops and what refinement could change the result.

The final sentence should match the object: “For every s in the stated interval, under these conventions, the absolute error is at most E.” If only listed points were checked, say so. Precision of language is part of the mathematical evidence.

Contents · Previous chapter · Next chapter

A uniform error bound E proves that every point in the interval has error at most E. It does not necessarily identify the point where the true maximum occurs, nor prove that the bound is attained. Interval overestimation can make E larger than every actual error value.

If the location of worst error matters, formulate it as an additional optimization problem with its own enclosure and subdivision evidence. A plotted largest sample is only a candidate maximizer. Preserve cells whose upper bounds can still exceed the best certified lower bound.

Report the two results separately: a guaranteed supremum bound and, if established, an enclosure for a maximizing location or maximum value. This avoids turning a safe upper bound into a fictional observed error and keeps the certificate useful even when the exact maximizer is unknown.

Contents · Previous chapter · Next chapter

An absolute tolerance asks for |f(s)−A(s)|≤ε everywhere. A relative tolerance divides by a reference magnitude and becomes delicate near zeros. State the norm before evaluating, because a program that switches silently between them can pass points far from a zero and fail unpredictably near one.

For a mixed requirement, define separate regions or a combined scale such as εabs+εrel|f(s)|, then justify that choice for the reader’s decision. Do not insert a small denominator floor after seeing the results without recording it; that changes the claimed quantity and can hide exactly the hard cases.

Test the definition on a point where |f| is ordinary, a neighbourhood of a known zero and an interval containing no zero. The changed contexts expose whether the tolerance expresses numerical accuracy, root location or a plotting preference. Keep each purpose in its own statement.

Contents · Previous chapter · Next chapter

Computing f(s) and A(s) separately and subtracting can lose significant digits when both are large and close. Increased displayed precision does not prove that the difference is accurate. Use guard digits, a stable residual formula or interval enclosures that account for rounding in both quantities.

Run the residual at two higher working precisions and compare certified enclosures. Stability is a useful diagnostic, while the final guarantee must still follow from directed rounding or another justified method. A result that changes with precision belongs in the unresolved set rather than in the reported maximum.

Cancellation can also occur inside the approximation itself, including functional-equation terms, gamma factors or alternating sums. Audit intermediate ranges and scaling, not only the final residual. A finite answer after overflow and underflow handling may be reproducible but mathematically unrelated to the intended formula.

Contents · Previous chapter · Next chapter

An interval on the real axis has one subdivision direction. A complex rectangle requires cells in both real and imaginary coordinates, with branch conventions and singularities tracked across the domain. Point samples on a rectangular grid still leave two-dimensional gaps between nodes.

Use complex interval or ball enclosures, a validated analytic bound, or a boundary principle whose hypotheses are proved for the function under study. If a maximum-modulus argument is used, identify which analytic function it applies to and ensure the rectangle contains no excluded pole or branch defect.

Report the rectangle, cell geometry, precision, norm on complex error and any excluded discs. This transfer shows the durable lesson: dimension changes the coverage proof, but it does not change the distinction between accurate sampled values and a uniform claim over every admissible input.

Contents · Previous chapter · Return to Zeta Function