The two-character Rankin layer in Tatuzawa's argument #
For quadratic characters χ₁ and χ₂ (possibly of different moduli), this
module forms the genuine Dirichlet-convolution coefficient sequence
(ζ * χ₁) * (ζ * χ₂).
Its coefficients are nonnegative, every nonzero square has coefficient at
least one, and in Re s > 1 its L-series factors exactly as
(ζ(s)L(s,χ₁)) (ζ(s)L(s,χ₂)).
Consequently the square support gives a source-free lower bound for the
product |L(σ,χ₁)L(σ,χ₂)|. This is the two-character positivity/Rankin
bearing layer used before any Deuring--Heilbronn transfer to s = 1.
It deliberately does not postulate that missing transfer as a source.
The biquadratic Rankin coefficient sequence
(ζ * χ₁) * (ζ * χ₂).
Equations
- χ₁.tatuzawaPairCoefficient χ₂ = χ₁.zetaMul * χ₂.zetaMul
Instances For
Quadraticity makes every coefficient of the two-character product
nonnegative in the real-axis order on ℂ.
Every nonzero square occurs with coefficient at least one. The proof
retains the antidiagonal cell (m²,1) and uses the square lower bound in the
first quadratic factor.
Absolute convergence of the two-character Rankin series in Re s > 1.
Exact two-character factorization in the half-plane of absolute convergence.
The finite square-support Rankin lower bound for the genuine pair coefficient.
The load-bearing two-character value-product inequality in σ > 1.
It is unconditional and contains the exact zeta-pole loss that a subsequent
Deuring--Heilbronn argument must overcome when transferring to s = 1.
The same pair lower bound after paying the elementary zeta-pole
majorant. The right side now displays precisely the (σ-1)⁻² loss which a
genuine Deuring--Heilbronn/value-transfer step must beat.