Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Directed set
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
====Finite subsets==== The set <math>\operatorname{Finite}(I)</math> of all finite subsets of a set <math>I</math> is directed with respect to <math>\,\subseteq\,</math> since given any two <math>A, B \in \operatorname{Finite}(I),</math> their union <math>A \cup B \in \operatorname{Finite}(I)</math> is an upper bound of <math>A</math> and <math>B</math> in <math>\operatorname{Finite}(I).</math> This particular directed set is used to define the sum <math>{\textstyle\sum\limits_{i \in I}} r_i</math> of a [[Generalized series (mathematics)|generalized series]] of an <math>I</math>-indexed collection of numbers <math>\left(r_i\right)_{i \in I}</math> (or more generally, the sum of [[Series (mathematics)#Abelian topological groups|elements in an]] [[abelian topological group]], such as [[Series (mathematics)#Series in topological vector spaces|vectors]] in a [[topological vector space]]) as the [[Limit of a net|limit of the net]] of [[partial sum]]s <math>F \in \operatorname{Finite}(I) \mapsto {\textstyle\sum\limits_{i \in F}} r_i;</math> that is: <math display=block>\sum_{i \in I} r_i ~:=~ \lim_{F \in \operatorname{Finite}(I)} \ \sum_{i \in F} r_i ~=~ \lim \left\{\sum_{i \in F} r_i \,: F \subseteq I, F \text{ finite }\right\}.</math>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)