Since θzn=nzn, this coefficient identity may be written
H=BG,B=(2θ−1)2(θ+1)2.
The standard hypergeometric differential equation
[(θ+1)2θ−z(θ+21)(θ−21)2]G=0.
expands to AG=0, where
A=(1−z)θ3+24+zθ2+44+zθ−8z.
Inverting B Modulo A
A Commutative Analogy
This example is not used in the proof. It isolates the inversion that will be needed below.
Consider the matrix
M=(01−1−1),M2+M+I=0.
Suppose y is unknown and only
h=(M+I)y
is known. The task is to recover y using the polynomial equation satisfied by M.
Set
a(x)=x2+x+1,b(x)=x+1.
Then a(M)=0 and h=b(M)y. In Q[x],
a(x)−xb(x)=1,
so b(x)−1≡−x(moda(x)). Evaluating the identity at M gives
a(M)−Mb(M)=I.
Since a(M)=0 and b(M)y=h,
y=−Mh.
All the operators in this example are polynomials in the same matrix M, so they commute.
The Operator Computation
In the proof, AG=0 and H=BG play the roles of a(M)y=0 and h=b(M)y. The coefficients of A and B now depend on z, and θ does not commute with them. I applied the extended Euclidean algorithm in the Ore ring
R=Q(z)⟨θ⟩,θf=fθ+zf′(z),
writing coefficients to the left of the powers of θ. If δf=zf′(z), multiplication is determined by
(aθm)(bθn)=ar=0∑m(rm)δr(b)θm+n−r.
Right division is taken to mean
P=SQ+R,degθR<degθQ.
The divisor Q occurs on the right of the quotient S. With the arguments in the order (B,A), the extended algorithm computes operators U,V and a rational function g satisfying
VB+UA=g(z).
S.<z> = QQ['z']R = S.fraction_field()delta = (z * S.derivation()).extend_to_fraction_field()Ore.<theta> = R['theta', delta]A = ( (1 - z)*theta^3 + (4 + z)/2*theta^2 + (4 + z)/4*theta - z/8)B = (2*theta - 1)^2*(theta + 1)^2def right_xgcd(P, Q): r0, r1 = P, Q u0, u1 = Ore.one(), Ore.zero() v0, v1 = Ore.zero(), Ore.one() while r1: q, r = r0.right_quo_rem(r1) r0, r1 = r1, r u0, u1 = u1, u0 - q*u1 v0, v1 = v1, v0 - q*v1 return r0, u0, v0def print_factored(name, op): print(f"{name} =") for i in reversed(range(op.degree() + 1)): c = op[i] if c: print(f" theta^{i}: {factor(c)}")g, V, U = right_xgcd(B, A) # V*B + U*A = gprint("g =", factor(g[0]))print_factored("V", V)print_factored("U", U)
Factored output
g = (9/484) * (z - 1)^-4 * (z^2 + 13*z + 1)^2
V =
theta^2: (-4/33) * (z - 1)^-2 * z^-1 * (z^2 + 13*z + 1)^2
theta^1: (-38/363) * (z - 1)^-3 * z^-1 * (z - 3/19) * (z^2 + 13*z + 1)^2
theta^0: (-8/363) * (z - 1)^-4 * (z - 13/8) * (z^2 + 13*z + 1)^2
U =
theta^3: (-16/33) * (z - 1)^-3 * z^-1 * (z^2 + 13*z + 1)^2
theta^2: (112/363) * (z - 1)^-4 * z^-1 * (z - 19/14) * (z^2 + 13*z + 1)^2
theta^1: (20/363) * (z - 1)^-4 * z^-1 * (z^2 + 13*z + 1)^2
theta^0: (2/121) * (z - 1)^-4 * z^-1 * (z^2 + 13*z + 1)^2
ok
The last nonzero remainder and the coefficient of B have a common factor:
For n≥1, ncn decreases to zero, so the differentiated series converges uniformly on [−1,0] by the alternating test. Termwise differentiation at −1 gives
Set k=2−1, so that k2=z1. The hypergeometric forms of the complete elliptic integrals are
K(k)=2πTK(k2),E(k)=2πTE(k2),
and the last expression becomes
B=π24(−2K(k)2+22K(k)E(k)).
At k=2−1, the Landen transformation substituted into Legendre’s relation gives
22K(k)E(k)−2K(k)2=2π.
It follows that B=2/π and
F(−1)=34B=3π8.
Conclusion
The extended Euclidean algorithm produces a left inverse for B∣kerA, turning H=BG into G=g−1VH. I had not encountered this use of the algorithm before.
The inversion alone does not finish the reduction. The resulting formula for F still contains H′′, with coefficient 16z(1−z2). This coefficient vanishes at z=−1, leaving exactly 34(H(−1)−4H′(−1)). Without that cancellation, the calculation would not reach Bauer’s series.