The concept of nets is a generalization of the concept of topological sequences and sometimes nets are called
generalized sequences. The generalization consists in the weakening of the ordering conditions of sequence indices.
Nets are introduced in [W0] in this way as structural augmentations of relational structures (RelStr):
the relation describes the order of indices (the carrier) and an additional field maps the indices into
the carrier of the given structure
.
definition
let S be 1-sorted;
struct(RelStr) NetStr over S (#
carrier -> set,
InternalRel -> Relation of the carrier,
mapping -> Function of the carrier, the carrier of S
#);
end;
For a net structure over
to be a net on
it must be non empty, the indices must be directed, and the order must
be transitive. In ``traditional'' sequences the order is linear, so indices are directed.
We say that a net is eventually in a set
if for any index
there exists a larger index
such that all values of the net for indices larger than
belong to the set
.
for i ex j st j >= i & for k st k >= j holds N.k in X
In other words, arbitrarily large indices determine an upper cone of indices with values in the set
Now, we may formalize Moore and Smith's idea of a convergence class.
We treat it as a set3of ordered pairs in which the first element is a net and the second is a convergence point of the net.
For a given topological space
we want to take a sufficiently large number of convergent nets
on
and their convergence points. To realize such an approach, we limit the family of all possible sets
of indices to NetUniv
, the smallest universal set of the carrier of
(see [Y6]).
Due to the properties of convergence classes: