Dirichlet Eta Function¶
Extend the alternating reciprocal-power series into an entire complex function tied to zeta by η(s)=(1−2^(1−s))ζ(s), gaining convergence on Re(s)>0 and a characteristic extra zero lattice.
Core Idea¶
The Dirichlet Eta Function is initially defined by the alternating Dirichlet series
which converges for complex (s) with \(\Re(s)>0\). On the half-plane \(\Re(s)>1\), separating odd and even terms of the absolutely convergent zeta series gives
This relation continues \(\eta\) to an entire function: the zero of (1-2^{1-s}) at (s=1) cancels the simple pole of \(\zeta\). NIST DLMF records the alternating representation of zeta on \(\Re(s)>0\).
Scope of Application¶
Eta provides a direct convergent representation connected to zeta throughout \(\Re(s)>0\), including much of the critical strip where the ordinary zeta Dirichlet series diverges. It supplies special values such as \(\eta(1)=\log 2\) and \(\eta(0)=1/2\) by continuation, and connects zeta zeros to a function without a pole.
Euler transformation and related acceleration methods make its alternating series useful for computation. Mellin-transform representations connect it to gamma factors and Fermi–Dirac-style kernels.
Clarity¶
The defining series converges only for \(\Re(s)>0\); the entire function outside that half-plane is its unique analytic continuation, not convergence of the original series. At (s=1), writing \(0\cdot\infty\) informally hides a removable limit: \(\eta(1)=\log2\).
Zeros from (1-2^{1-s}=0) lie on \(\Re(s)=1\) at periodic imaginary spacing, but the point (s=1) is not a zero because of pole cancellation.
Manages Complexity¶
Alternation shifts the direct convergence boundary from \(\Re(s)>1\) to \(\Re(s)>0\), replacing a pole-bearing series with an entire related function. The factorization separates zeta structure from a simple periodic factor and supports stable series acceleration.
That compression has a cost: division by (1-2^{1-s}) becomes ill-conditioned near its zeros, so eta is not uniformly a numerically superior route to zeta.
Abstract Reasoning¶
- Fix a domain and choose series, integral, functional relation, or continuation representation valid there.
- For \(\Re(s)>1\), derive the factor by separating even and odd zeta terms.
- Extend identities by analytic continuation only after proving domain overlap.
- Treat (s=1) as a removable cancellation and evaluate the limit.
- Classify zeros by source and check overlaps/multiplicity.
- Accelerate alternating sums with explicit error control.
- Avoid dividing by a nearly zero prefactor in numerical zeta evaluation.
Knowledge Transfer¶
The alternating-series/factor-cancellation structure transfers across analytic number theory, special-function computation, Mellin transforms, and statistical-physics integrals. The strict parent is Function (Mapping): eta is a single-valued complex analytic mapping with unusually rich extra structure.
Relationships to Other Abstractions¶
Current abstraction Dirichlet Eta Function Domain-specific
Parents (1) — more general patterns this builds on
-
Dirichlet Eta Function is a kind of Function (Mapping) Prime
Function (Mapping) is the proposed immediate parent.
Hierarchy path (1) — routes to 1 parentless root
- Dirichlet Eta Function → Function (Mapping)
Neighborhood in Abstraction Space¶
Dirichlet Eta Function sits in a sparse region of the domain-specific corpus (85th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Special Functions & Convergence Tests (6 abstractions)
Nearest neighbors
- Gamma Function — 0.87
- Lanczos Approximation — 0.81
- Field of fractions — 0.80
- Knuth–Eve Algorithm — 0.79
- Ratio Test — 0.79
Computed from structural-signature embeddings · 2026-09-08