Skip to main content
Log in

Formal Proofs of Hypergeometric Sums

Dedicated to the memory of Andrzej Trybulec

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Algorithmic methods can successfully automate the proof, and even the discovery, of a large class of identities involving sums of hypergeometric terms. In particular, the Wilf-Zeilberger (WZ) algorithm is a uniform framework for a substantial class of hypergeometric summation problems. This algorithm can produce a rational function certificate that can, on the face of it, be used to verify the result by routine algebraic manipulations, independently of the working of the algorithm that discovered it. It is therefore very natural to consider using this certificate to produce, by automated means, a rigorous deductive proof in an interactive theorem prover. However, naive presentations of the WZ method tend to gloss over trivial-looking but rather knotty questions about zero denominators, which makes their rigorous formalization tricky and their ultimate logical justification somewhat obscure. We describe how we have handled these difficulties to produce rigorous WZ proofs inside the HOL Light theorem prover.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Apéry, R.: Irrationalité de ζ(2) et ζ(3). Astérisque 61, 11–13 (1979)

    MATH  Google Scholar 

  2. Artin, E.: The Gamma Function. Holt, Ronehart and Winton (1964). English translation by Michael Butler

  3. Beukers, F.: A note on the irrationality of ζ(2) and ζ(3). Bull. Lond. Math. Soc. 11, 268–272 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chyzak, F., Mahboubi, A., Sibu-Pinote, T., Tassi, E.: A computer-algebra-based formal proof of the irrationality of ζ(3). To appear in ITP 2014 (2014)

  5. Caprotti, O., Oostdijk, M.: Formal and efficient primality proofs by the use of computer algebra oracles. J. Symb. Comput. 32, 55–70 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cohen, H.: Number Theory volume II: Analytic and Modern Tools, volume 240 of Graduate Texts in Mathematics. Springer (2007)

  7. Fowler, D.: The binomial coefficient function. Am. Math. Mon. 103, 1–17 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gessel, I.M.: Finding identities with the WZ method. J. Symb. Comput. 20, 537–566 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  9. Gibbs, P.E.: Crackpots who were right II. Prespacetime J. 1, 489–497 (2010)

    Google Scholar 

  10. Gosper, W.R.: Decision procedure for indefinite hypergeometric summation. Proc. Natl. Acad. Sci. U.S.A. 75, 40–42 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  11. Grégoire, B., Théry, L., Wener, B.: A computational approach to Pocklington certificates in type theory. In: Proceedings of the 8th International Symposium on Functional and Logic Programming, volume 3945 of Lecture Notes in Computer Science, pp. 97–113. Springer-Verlag (2006)

  12. Harrison, J., Théry, L.: A sceptic’s approach to combining HOL and Maple. J. Autom. Reason. 21, 279–294 (1998)

    Article  MATH  Google Scholar 

  13. Lang, S.: Complex Analysis. Graduate Texts in Mathematics, 3rd edition. Springer (1993)

  14. Nemes, I., Petkovṡek, M., Wilf, H., Zeilberger, D.: How to do your monthly problems with your computer. Am. Math. Mon. 104, 505–519 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  15. Petkovṡek, M., Wilf, H.S., Zeilberger, D.: A = B. A K Peters (1996)

  16. Carsten Schneider: Apéry’s double sum is plain sailing indeed. Electron. J. Comb., 14 (2007)

  17. Siddique, U, Hasan, O.: On the formalization of the gamma function in HOL. J. Autom. Reason., 407–429 (2014)

  18. Stanley, R.P.: Enumerative Combinatorics, vol. 2. Cambridge University Press (1999)

  19. Théry, L., Hanrot, G.: Primality proving with elliptic curves. In: Schneider, K., Brandt, J. (eds.) Proceedings of the 20th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2007, volume 4732 of Lecture Notes in Computer Science, pp 319–333. Springer, Kaiserslautern, Germany (2007)

    Google Scholar 

  20. van der Poorten, A.J.: A proof that Euler missed: Apéry’s proof of the irrationality of ζ(3), an informal report. Math. Intell. 1, 195–303 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  21. Wilf, H.S., Zeilberger, D.: Rational functions certify combinatorial identities. J. Am. Math. Soc. 3, 147–158 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  22. Zeilberger, D.: A holonomic systems approach to special functions identities. J. Comput. Appl. Math. 32, 321–368

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to John Harrison.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Harrison, J. Formal Proofs of Hypergeometric Sums. J Autom Reasoning 55, 223–243 (2015). https://doi.org/10.1007/s10817-015-9338-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-015-9338-0

Keywords

Navigation