Difference between revisions of "Sequence"
From Maths
m |
m |
||
Line 11: | Line 11: | ||
==Convergence of a sequence== | ==Convergence of a sequence== | ||
− | + | * See [[Convergence of a sequence]] | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
==See also== | ==See also== | ||
* [[Cauchy criterion for convergence]] | * [[Cauchy criterion for convergence]] | ||
+ | * [[Convergence of a sequence]] | ||
==References== | ==References== | ||
{{Definition|Set Theory|Real Analysis|Functional Analysis}} | {{Definition|Set Theory|Real Analysis|Functional Analysis}} |
Revision as of 17:13, 8 March 2015
Introduction
A sequence is one of the earliest and easiest definitions encountered, but I will restate it.
I was taught to denote the sequence {a1,a2,...} by {an}∞n=1 however I don't like this, as it looks like a set. I have seen the notation (an)∞n=1 and I must say I prefer it.
Definition
Formally a sequence is a function[1], f:N→S where S is some set. For a finite sequence it is simply f:{1,...,n}→S
There is little more to say.
Convergence of a sequence
See also
References
- Jump up ↑ p46 - Introduction To Set Theory, third edition, Jech and Hrbacek