Saturated set (intersection of open sets)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In general topology, a saturated set is a subset of a topological space equal to an intersection of (an arbitrary number of) open sets.

Definition

[edit | edit source]

Let S be a subset of a topological space X. The saturation sat(S) of S is the intersection of all the neighborhoods of S.

sat(S)=𝒩S

Here 𝒩S denotes the neighborhood filter of S. The neighborhood filter 𝒩S can be replaced by any local basis of S. In particular, sat(S) is the intersection of all open sets containing S.

Let S be a subset of a topological space X. Then the following conditions are equivalent.

  • S is the intersection of a set of open sets of X.
  • S equals its own saturation.

We say that S is saturated if it satisfies the above equivalent conditions. We say that S is recurrent if it intersects every non-empty saturated set of X.

Properties

[edit | edit source]

Implications

[edit | edit source]

Every Gδ set is saturated, obvious by definition. Every recurrent set is dense, also obvious by definition.

In relation to compactness

[edit | edit source]

A subset of a topological space is compact if and only if its saturation is compact.

For a topological space X, the following are equivalent.

In a sober space, the intersection of a downward-directed set of compact saturated sets is again compact and saturated.[1]: 381, Theorem 2.28  This is a sober variant of the Cantor intersection theorem.

In relation to Baire spaces

[edit | edit source]

For a topological space X, the following are equivalent.

  • X is a Baire space.
  • Every recurrent set of X is Baire.
  • X has a Baire recurrent set.

Examples

[edit | edit source]

For a topological space X, the following are equivalent.

  • Every subset of X is saturated.
  • The only recurrent set of X is X itself.
  • X is a T1 space.

A subset S of a preordered set (X,) is saturated with respect to the Scott topology if and only if it is upward-closed.[1]: 380 

Let (X,) be a closed preordered set (one in which every chain has an upper bound). Let maxX be the set of maximal elements of X. By the Zorn lemma, maxX is a recurrent set of X with the Scott topology.[1]: 397, Proposition 5.6 

References

[edit | edit source]
  1. ^ a b c Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
[edit | edit source]