Abstract
The word denumerable in the sequel means finite or countably infinite. Let M and N be two non-empty denumerable sets. A matrix is a function with domain the set of ordered pairs (m, n), where m ∈ M and n ∈ N,and with range a subset of the extended real number system—the reals with +∞ and −∞ adjoined. We call the sets M and N index sets. The matrix is called a finite matrix if both M and N are finite sets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Kemeny, J.G., Snell, J.L., Knapp, A.W. (1976). Prerequisites From Analysis. In: Denumerable Markov Chains. Graduate Texts in Mathematics, vol 40. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9455-6_1
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9455-6_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-9457-0
Online ISBN: 978-1-4684-9455-6
eBook Packages: Springer Book Archive