Abstract
When evaluating or simplifying mathematical expressions, the question arises of how to handle inverse functions. The problem is that for a non-injective function \(f\) \(: D \rightarrow R\), the inverse is generally not a function \(R \rightarrow D\) since there may be multiple pre-images for a given point. The majority of work in this area has fallen into two camps: either the inverse functions, and expressions involving them, are treated as multi-valued objects, or inverse functions are taken to have one principal value. Both these approaches lead to difficulties in evaluation and simplification. It is possible to define the inverse as a function from R to sets of elements of D, but then the algebra of expressions involving the inverse becomes overly complicated. This article extends previous work based on a different approach: instead, the inverse of a function is taken to be a labelled family of functions, with the label specifying the pre-image in the original function’s domain. This convention is already used by some authors for logarithms, but it can be applied more generally. In some cases, the branch indices can appear in identities that give more broadly applicable simplification rules. In this paper we survey how this approach can be applied to elementary functions, including the Lambert W.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
When different authors use the same symbol to mean different things, the discussion of notation becomes problematic. For this example, \(\ln \) is a set; \(\ln _0\) is a unique value. Below, we shall change to notation in which \(\ln \) is also a unique value.
- 2.
An antiperiodic function is one for which \(\exists \alpha \) such that \(f(z+\alpha )=-f(z) \), and \(\alpha \) is then the antiperiod. This is a special case of a quasi-periodic function [10], namely one for which \(\exists \alpha ,\beta \) such that \(f(z+\alpha )=\beta f(z)\).
References
Abramowitz, M., Stegun, I.J.: Handbook of Mathematical Functions. Dover (1965)
Carathéodory, C.: Theory of functions of a complex variable, 2nd edn. Chelsea, New York (1958)
Corless, R.M., Davenport, J.H., Jeffrey, D.J., Watt, S.M.: According to Abramowitz and Stegun. SIGSAM Bull. 34, 58–65 (2000)
Corless, R.M., Jeffrey, D.J.: The unwinding number. Sigsam Bull. 30(2), 28–35 (1996)
Davenport, J.H.: The challenges of multivalued “Functions’’. In: Autexier, S., et al. (eds.) CICM 2010. LNCS (LNAI), vol. 6167, pp. 1–12. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14128-7_1
Jeffrey, D.J.: The importance of being continuous. Math. Mag. 67, 294–300 (1994)
Jeffrey, D.J., Rich, A.D.: The evaluation of trigonometric integrals avoiding spurious discontinuities. ACM Trans. Math. Softw. 20, 124–135 (1994)
Jeffrey, D.J., Norman, A.C.: Not seeing the roots for the branches. SIGSAM Bull. 38(3), 57–66 (2004)
Kahan, W.M.: Branch cuts for complex elementary functions, or, much ado about nothing’s sign bit. In: Powell, M.J.D., Iserles, A. (eds.), The state of the art in numerical analysis: Proceedings of the Joint IMA/SIAM Conference. Oxford University Press, April 1986
Lawden, D.F.: Elliptic Functions and Applications, Springer, New York (1989). https://doi.org/10.1007/978-1-4757-3980-0
Lozier, W.D., Olver, F.W.J., Boisvert, R.F.: NIST Handbook of Mathematical Functions. Cambridge University Press, Cambridge (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Jeffrey, D.J., Watt, S.M. (2022). Working with Families of Inverse Functions. In: Buzzard, K., Kutsia, T. (eds) Intelligent Computer Mathematics. CICM 2022. Lecture Notes in Computer Science(), vol 13467. Springer, Cham. https://doi.org/10.1007/978-3-031-16681-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-031-16681-5_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-16680-8
Online ISBN: 978-3-031-16681-5
eBook Packages: Computer ScienceComputer Science (R0)