Abstract
In the first chapter, we defined a sequence in X to be a mapping from N to X. Let us broaden this definition slightly, and allow the mapping to have a domain of the form \(\left\{ {n \in {\rm Z}:m\underline < n\underline < p} \right\},or\left\{ {n \in {\rm Z}:n\underline > m} \right\}\), for some m ∈ Z (usually, but not always, m = 0 or m = 1). The most common notation is to write n→ xn instead of n→ x(n). If the domain of the sequence is the finite set \(\left\{ {m,m + 1, \ldots ,p} \right\}\), we write the sequence as \(\left( {x_n } \right)_{n = m}^p\), and speak of a finite sequence (though we emphasize that the sequence should be distinguished from the set \(\left. {\left\{ {x_n :m\underline < n\underline < p} \right\}} \right)\). If the domain of the sequence is a set of the form \(\left\{ {m,m + 1,m + 2, \ldots } \right\} = \left\{ {n \in {\rm Z}:n\underline { > m} } \right\}\), we write it as \((x_n )_{n = m}^\infty\), and speak of an infinite sequence. Note that the corresponding set of values \(\left\{ {x_n :n\underline > m} \right\}\) may be finite. When the domain of the sequence is understood from the context, or is not relevant to the discussion, we write simply (xn). In this chapter, we shall be concerned with infinite sequences in R.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media New York
About this chapter
Cite this chapter
Browder, A. (1996). Sequences and Series. In: Mathematical Analysis. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0715-3_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0715-3_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6879-6
Online ISBN: 978-1-4612-0715-3
eBook Packages: Springer Book Archive