Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

The coefficient identity [z2k](z/tanh⁡z)2k+1=1 for every k

Statement

For every m≥0, in the formal series Q(z)=z/T(z)=z/tanh⁡z of The formal hyperbolic tangent series and the even series x/tanh⁡x, [zm](ztanh⁡z)m+1={1,m even,0,m odd. Equivalently, for every k≥0, [z2k](ztanh⁡z)2k+1=1,[z2n+1](ztanh⁡z)2n+2=0(n≥0), and the formal residue res⁡z (tanh⁡z)−(2k+1) dz equals 1.

Facts & Assumptions

Given: The series T and A of The formal hyperbolic tangent series and the even series x/tanh⁡x, the integer m≥0, and the Bernoulli-free coefficient computation below.

[F1]

T=xS with S an even power series of constant term 1, so S is a unit and Q=x/T=1/S; in particular T has order 1 and linear coefficient 1 (The formal hyperbolic tangent series and the even series x/tanh⁡x).

[F2]

For a field K, K((x)) consists of the Laurent series with support bounded below, with finite convolution in each degree, derivative D(xn)=nxn−1, and residue res⁡x(f)=[x−1]f (Formal Laurent series K((x)), their order, derivative, and residue).

[F3]

The inverse-series lemma gives T∘A=z, A∘T=x, and A′(z)=1/(1−z2)=∑j≥0z2j (The formal hyperbolic tangent and artanh series are inverse, with the artanh derivative).

[F4]

Over a field K containing Q, for g∈xK⟦x⟧ with nonzero linear coefficient and F∈K((x)) for which F∘g is formed by Laurent substitution, res⁡x((F∘g)Dg)=res⁡x(F) (Formal residues satisfy integration by parts, logarithmic differentiation, and change of variables).

[F5]

A power series is a unit exactly when its constant coefficient is a unit, and inverses are unique; (1−z2)∑j≥0z2j=1 (A formal power series is a unit exactly when its constant coefficient is a unit).

Proof

technique · direct; reduce the coefficient to a residue and change variables by the inverse series
1.1givenF1F2F5F6algebra

Since T=uS with S a unit of Q⟦u⟧ by [F1], the series F(u):=T(u)−(m+1)=u−(m+1)S(u)−(m+1) is a well-defined element of Q((u)) of order −(m+1). As (u/T(u))m+1=um+1T(u)−(m+1) in Laurent series, F(z)=z−(m+1)(z/T(z))m+1 and therefore res⁡zF(z)=[z−1]z−(m+1)(z/T(z))m+1=[zm](z/T(z))m+1.

2.1step 1.1F1F2F3F5

The composition F∘A is formed by Laurent substitution: A=z U with U a unit, so A−(m+1)=z−(m+1)U−(m+1) has finitely many terms in each degree and S−(m+1)∘A is a unit power series, and every coefficient of F∘A is a finite sum. By [F3], T∘A=z, hence F∘A=(T∘A)−(m+1)=z−(m+1); and DA=A′=1/(1−z2)=∑j≥0z2j, the last identity by [F3] and [F5].

3.1step 1.1step 2.1F3F4F5F6

The change-of-variables identity [F4] applies over K=Q with g=A, whose linear coefficient is 1≠0: res⁡z((F∘A)A′)=res⁡zF. By step 2.1 the left side is res⁡z(z−(m+1)(1−z2)−1)=[z−1]z−(m+1)∑j≥0z2j=[zm]∑j≥0z2j, which is 1 when m is even and 0 when m is odd, since z2j has degree 2j. Combining with step 1.1 gives [zm](z/T(z))m+1=1 for even m and 0 for odd m.

4.1step 1.1step 3.1given∎

Taking m=2k gives [z2k](z/tanh⁡z)2k+1=1 for every k≥0; taking m=2n+1 gives [z2n+1](z/tanh⁡z)2n+2=0; and step 1.1 with m=2k identifies res⁡zT(z)−(2k+1)=[z2k](z/T(z))2k+1=1, the residue form asserted. The value k=0 reads [z0]Q=1, the constant term of the unit series Q. All computations are coefficientwise identities between formal Laurent series over Q; no analytic contour and no choice principle is involved.

Depends on

Used by

Dependency tree · two levels

28 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