For many notions of structure, particularly for topological categories, one can specify a structure by a base or subbase that generate the structure. Besides being convenient ways to specify a structure, they may even be necessary when using weak foundations.
Warning: Sometimes one says ‘basis’ instead of ‘base’, but I think that it's safest to save the former term for the generating set of a free object (or an analogous situation), especially in an algebraic category. Although a basis and a base can both generate something, they tend to do so in very different ways. (It doesn't help that ‘bases’ is the plural of both, although the pronunciation is different.)
Typically, every structure of an appropriate type is both a base and a subbase for itself, while every base is a subbase. Bases and subbases can also be characterised independently; every subbase generates a base (which tends to be saturated in some way), while every base (saturated or not) generates a complete structure.
More generally, any subset satisfying (2,3) is a filter base.
Given a filter base in a poset, we generate a filter by closing under (1); that is, if is a filter base on a poset , then
is a filter on .
Now any subset satisfying (2,3) is a saturated filter base, and any subset whatsoever is a filter subbase.
Given a filter subbase in a semilattice, we generate a base by closing under (2,3) in the second list; that is, if is a filter subbase on a semilattice , then
is a filter base on , which in fact is saturated. (Note that follows when .)
Given a filter subbase in a semilattice, we can generate a filter by first generating a base and then generating a filter . Alternatively, we can generate the same filter by closing under (1,2,3) in the first list all at once. That is, if is a filter subbase on a semilattice , then
is a filter on . Furthermore, this is the same filter as .
The intersection of any family of filters on a semilattice is a filter; that is, being a filter is a Moore closure property on subsets of . The filter generated by a filter subbase (which is an arbitrary subset of , remember) is the same as the Moore closure of under this property, that is the intersection of all filters on that contain .
Unlike filters and filter bases, the concept of filter subbase does not seem to make sense on an arbitrary poset, but only on a semilattice.
More generally, any collection satisfying (2,3) is a saturated topological base, and any collection whatsoever is a topological subbase.
A slightly more complicated but equivalent definition of topology is this:
Now any collection satisfying (2,3) is a topological base (not necessarily saturated).
Given a topological subbase , we generate a base by closing under (2,3) in the first list; that is, if is a topological subbase on a set , then
is a topological base on , which in fact is saturated. (Note that follows when .)
Given a topological base , we generate a topology by closing under (1); that is, if is a topological base on a set , then
is a topology on .
Given a topological subbase , we can generate a topology by first generating a base and then generating a topology . Alternatively, we can generate the same topology by closing under (1,2,3) in the second list all at once. That is, if is a topological subbase on a set , then
is a topology on . Furthermore, this is the same topology as .
As with filters, being a topology is a Moore closure property, this time on subsets of the power set , and the topology generated by a topological subbase is the intersection of all topologies on that contain .
Uniformities are a little trickier than topologies.
Is there a general theory of bases? That's a good question. I don't know!
Obviously this has something to do with Moore closures (and hence monads); generating a structure from a subbase is (often) taking a Moore closure. But there's some particular property of some closure operators that makes the intermediate concept of base work out.