Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A boundary line need not have uniform convergence behavior

Statement refuted

If a Dirichlet series converges at one point on the line s=σc, then it converges at every point on that line.

Facts & Assumptions

Given: The Dirichlet series D(s):=k12ksk, equivalently the series n1anns with a2k=1/k and an=0 otherwise.

[L1]

The abscissa of convergence is defined by half-plane convergence (The convergence and absolute-convergence abscissae of a Dirichlet series).

[L2]

Counterexample

technique · direct
1.1

If s=σ>0, then k12kskk12kσ, and the right-hand side is a convergent geometric series by [L3]. So D(s) converges for every s>0. At s=0 it becomes the harmonic series k11/k, which diverges by [L2]. Therefore [L1] gives σc=0.

L1L2L3givenalgebra
2.1

On the same boundary line, at s=πilog2 one has 2s=1, so D(s)=k1(1)kk, which converges by [L2]. Thus the line s=0 contains both the divergent point s=0 and the convergent point s=s.

L2step 1.1algebra
3.1

Therefore convergence at one boundary point does not force convergence at every point of the abscissa line.

step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources