WorksMathematics
The alternating sum of reciprocal Fibonacci cubes is irrational
Abstract
We prove that the alternating sum of the reciprocal cubes of the Fibonacci numbers is irrational. The result extends to the Lucas sequences of the first kind associated with real quadratic units greater than one, including the Pell numbers. For every such sequence and every fixed positive integer , the reciprocal cubes with indices , taken with signs , also have an irrational sum.
The alternating sum
Let and . Write
Absolute convergence gives . Duverney, Ke. Nishioka, Ku. Nishioka and Shiokawa proved that the odd-index sum is transcendental [1][2 Theorem 4, p. 95]. Thus at least one of and is transcendental. Krisman proved irrational [4] and extended that result to ordinary reciprocal cube sums of Lucas sequences with a positive dominant unit [5 Theorem 1.1]. These results leave open whether is rational [5 p. 3].
For integers , let be the Lucas sequence of the first kind,
Theorem 1.1. Suppose that and , or that and . Then
is irrational.
Changing the sign of the trace gives, directly from the recurrence,
Cubing preserves this sign. Thus is the ordinary reciprocal cube sum for trace . In the Fibonacci case , the negative-trace sequence begins . Its dominant root is negative, explaining the signed reciprocal root in § 2. The pair gives the Pell case. For , Elsner, Shimomura and Shiokawa treat alternating reciprocal even powers of first- and second-kind Lucas sequences [3 Theorems 2 and 4]. Here the power is three.
Corollary 1.2. Under the hypotheses of Theorem 1.1, for each integer ,
is irrational.
The determinant method produces polynomials in a single unknown value. Under a rationality assumption, clearing their denominators gives algebraic integers in a real quadratic field. A nonzero algebraic integer has absolute norm at least one, so estimates at both real embeddings can yield a contradiction. Zudilin used polynomial Hankel determinants in an irrationality criterion [6 Proposition 2]. Uvarov related the orthogonal polynomials before and after a rational change of weight [7 §1]. Krattenthaler gave a determinant identity for the modified moments [8 Theorem 1]. The particular moving denominator and interpolation argument used here come from the -zeta construction [10 Sections 2 and 5] and Krisman’s adaptation of it to reciprocal cubes [4, 5].
The alternating sign amounts to changing the sign of the small unit in Krisman’s construction. His cyclotomic denominator is an identity in a formal variable, so it still clears every coefficient. The main analytic point is at the conjugate embedding. The conjugate pole values turn out to be evaluations of a single holomorphic function formed from the original signed moments. A contour integral combines them before their sizes are estimated. For a determinant of size , measure logarithms in units of , where is the dominant unit. The first embedding saves , the conjugate embedding saves , and clearing the denominators costs at most . The margin is
We prove the estimates for the actual signed value and show that infinitely many of the corresponding determinants are nonzero.
The signed unit and its moments
Put , , and . The two roots of are and . They are algebraic units. A rational root would be an integer dividing , so the field is quadratic. Conversely, the trace of a real quadratic unit of norm is the integer , which is positive for and exceeds two for . This gives exactly the parameter ranges in Theorem 1.1. Let denote the nontrivial automorphism of and put
Here , , , and . Changing from to fixes the nodes and multiplies the weights by . Binet’s formula gives . Thus all the with are positive and
Here , which accounts for the minus sign in the formula for . The series is absolutely convergent. The finite quantities satisfy
For the last identity, factor out of . We shall use only under the hypothesis , , . In that case
since . This argument uses the value of the convergent series as a whole.
We want polynomial moments in and simple-pole moments that recover tails of . The Euler operator supplies the cubed denominator in (2) through the identity . At the node , weighting the numerator by supplies . Thus for holomorphic on a neighborhood of , set
The derivatives of are bounded on the indicated disk, so the sum converges absolutely. With , summing gives
Indeed, in the second identity put and use . This is the signed specialization of Krisman’s moment identities [5 Section 2].
For let . On rational functions of the form , define by ordinary partial fractions. Use (5) on the polynomial quotient and (6) with replaced by on the simple fractions. Set
Each entry is affine in , hence this polynomial has degree at most . At , all its entries are values of the actual functional . Replacing in the finite formulas by an indeterminate defines . This formal version will let us use the same denominator at both embeddings.
The denominator and the first embedding
Let denote the th cyclotomic polynomial and Euler’s totient. The arithmetic input to our proof is [5 Proposition 4.4 and the proof of Proposition 4.6]. For each fixed it supplies finitely supported nonnegative integers such that
The weight in (9) is the degree of . The coefficient comes from adding the contribution of colliding poles, at most with the product over primes, to the contribution from monomial moments. Since (8) holds before evaluating , we may substitute the negative unit and its conjugate. Each evaluation has coefficients in . The accompanying programs check (8) coefficientwise for and both signs of [11].
Here is the Möbius function and for both real signs of . For , factor out of . The same bound applies after subtracting . The error in the logarithm of each factor’s norm is therefore at most . Sum with weights and use (9). □
All subsequent error constants may depend on the fixed unit. In logarithmic upper bounds a zero determinant has logarithm .
Proposition 3.2. At the first real embedding,
Proof. The functional uses derivatives through order two. A polynomial with a triple zero at a node contributes zero there, even after multiplication by a factor holomorphic at that node. This explains the monic basis from [5 Proposition 3.1],
Using in the rows and columns of (7) preserves the determinant. When , at least one factor or has a triple zero at . At every other node, each factor at has modulus at most . Applying once or twice to that factor gives , of modulus at most . The reciprocal and its first two Euler derivatives are bounded uniformly on . This follows from Cauchy’s estimates on the unit circle, where .
The product rule and now give
Extract and from the row and column bounds. The remaining factors contribute to the logarithm by Hadamard’s inequality. As , we have . Finally, , which gives the asserted coefficient. □
A contour for the conjugate determinant
The conjugate of has modulus greater than one. We therefore apply to the finite moment formulas, keeping formal, and use their partial fractions to estimate . Denote the resulting functional by . The conjugated denominator vanishes at the points inside the unit circle. Indeed,
Passing to the reciprocal denominator gives a factor of absolute value in each entry. Extracting it from every row will give a cubic saving in the logarithm, provided the remaining moments with denominator are small enough.
Lemma 4.1. Define , with acting on the variable . This function is holomorphic on , and for ,
Proof. Use . By (3) the conjugate of the right side of (6), with replaced by the indeterminate , is . At this gives
The middle equality uses . Direct differentiation in the original functional gives
locally uniformly on the indicated disk.
Take and , so the rational function is , with poles and . By Lemma 4.1 the two simple fractions contribute
For a fixed holomorphic , this divided difference tends to as . Estimating the two fractions separately loses that cancellation. For nodes, a single contour will combine all the pole contributions as the nodes accumulate at zero.
Proposition 4.2. At the prescribed value of the conjugate variable,
Proof. Write for . By Lemma 4.1 and the residue theorem, the contribution from the simple fractions is the counterclockwise contour integral
On this circle , and is bounded there. Thus (11) is bounded independently of . This uses the signed analogue of the common pole function in [5 Proposition 5.1].
It remains to bound the polynomial quotient when . On expanding at infinity its coefficients after the leading are , defined by . The polynomial quotient is , and . Also , so is , using . Consequently the entire moment is .
Returning to (10) multiplies the absolute determinant of the by . Hadamard’s inequality and give the result.
Nonvanishing at arbitrarily large sizes
The Cauchy transform of is the function from Lemma 4.1 in a reciprocal variable. For ,
The points of § 4 correspond to . These exterior points are the zeros of for , and .
Kronecker proved that the generating function of a fixed moment sequence is rational exactly when its Hankel determinants eventually vanish [9 Arts. VII and IX]. Zudilin recalls this criterion in the irrationality setting [6 Section 5]. Here the moments change with , but every zero of is also a zero of . We use these shared points in a rational interpolation argument, following [10 Proposition 5.1] and [5 Proposition 6.1], for the actual signed functional.
Proposition 5.1. For arbitrarily large , one has .
Proof. The series for in Lemma 4.1 gives the continuation
The series converges normally on compact subsets away from the nodes and their accumulation point . Its cubic pole coefficient at is . It follows that has infinitely many poles and is not rational.
Suppose now that all determinants from some size onward vanish. At each such size , take a nonzero polynomial of degree in the kernel. Thus for . We seek a polynomial such that the error vanishes at and is at infinity. Consecutive sizes share the first points. With this decay those shared zeros will force . To obtain both properties, set
The numerator in (12) vanishes at , so is a polynomial of degree . Subtracting in (12) gives
Thus vanishes at , , where the functional on the right is analytic. At infinity expand in powers of . The expansion converges with two -derivatives on a disk containing the nodes, and the first terms give zero by the kernel equations. The factor has degree , so .
The polynomial
has degree at most by its growth at infinity, and has the common zeros . Hence it vanishes identically. All sufficiently large therefore give the same rational function , written in lowest terms. Write , with a nonzero polynomial. At a zero of , cancelling this common factor can lose an interpolation condition. The decay at infinity bounds how many can be lost. Indeed, the fixed error is nonzero since is not rational. Write at infinity, with . As , we have . But for all sufficiently large , since . Every such with must be a zero of . Their number eventually exceeds the fixed bound , a contradiction. ∎
The norm and the fixed-stride sums
Proof of Theorem 1.1. Suppose with , . By (4), . The degree bound after (7) and the coefficient clearing in (8) show that
No cyclotomic factor vanishes at , since . By Proposition 5.1 we can choose arbitrarily large with . For these indices is a nonzero integer. Under our rationality assumption by (4), so its absolute value is
The first factor contributes only to the logarithm. For the other three factors use Lemma 3.1 and Propositions 3.2 and 4.2, respectively. This gives
by (1). The right-hand side tends to because and are fixed. This proves irrationality.
Proof of Corollary 1.2. Write and . This is an integer, by the recurrence for the traces of the powers of . Binet’s formula gives
If , then . If , then . Thus the new pair is admissible. Apply Theorem 1.1 and divide by the nonzero integer . For Fibonacci, and , so . This gives the irrational sum .
Verification
Another AI model independently audited the mathematics and exposition of the 18 November 2026 working proof, including the fixed-stride result. Two independent reviews subsequently examined the exposition of the seven-page manuscript of the same date.
References
- [1]D. Duverney, Ke. Nishioka, Ku. Nishioka and I. Shiokawa, Transcendence of Rogers–Ramanujan continued fraction and reciprocal sums of Fibonacci numbers, Proc. Japan Acad. Ser. A Math. Sci. 73 (1997), 140–142. doi:10.3792/pjaa.73.140.DOI
- [2]D. Duverney, Ke. Nishioka, Ku. Nishioka and I. Shiokawa, Transcendence of Rogers–Ramanujan continued fraction and reciprocal sums of Fibonacci numbers, RIMS Kôkyûroku 1060 (1998), 91–100. Theorem 4, p. 95.DOI
- [3]C. Elsner, S. Shimomura and I. Shiokawa, Algebraic relations for reciprocal sums of Fibonacci numbers, Acta Arith. 130 (2007), 37–60. doi:10.4064/aa130-1-3.DOI
- [4]S. Krisman, The sum of the reciprocal cubes of the Fibonacci numbers is irrational, Hexagon 2611.00473v1 (2026).hub.valency.io/works/W_j9deaphg
- [5]S. Krisman, The reciprocal cube sums of Lucas sequences of quadratic units are irrational, Hexagon 2611.00491v1 (2026).hub.valency.io/works/W_pe2nb9f2
- [6]W. Zudilin, A determinantal approach to irrationality, Constr. Approx. 45 (2017), 301–310. doi:10.1007/s00365-016-9333-7.DOI
- [7]V. B. Uvarov, The connection between systems of polynomials orthogonal with respect to different distribution functions, USSR Comput. Math. Math. Phys. 9 (1969), no. 6, 25–36. doi:10.1016/0041-5553(69)90124-4.DOI
- [8]C. Krattenthaler, A determinant identity for moments of orthogonal polynomials that implies Uvarov’s formula for the orthogonal polynomials of rationally related densities, arXiv:2103.03969 (2021).arxiv.org/abs/2103.03969
- [9]L. Kronecker, Zur Theorie der Elimination einer Variabeln aus zwei algebraischen Gleichungen, Monatsber. Königl. Preuss. Akad. Wiss. Berlin (1881), 535–600. Art. IX in the collected works.
- [10]uplift-universal-inc, Irrationality of the Lambert-series value ζ₁/p(3), research draft (2026). Manuscript and accompanying sources.
- [11]twinheterodox, Verification programs accompanying The alternating sum of reciprocal Fibonacci cubes is irrational (2026). Included with the source as electronic supplementary material. Project repository address.