mathematics

Saturated set (intersection of open sets)

Saturated set (intersection of open sets) is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Saturated set (intersection of open sets) rather than just read about it. In short: 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 Let S {\displaystyle S} be a subset of a topological space X {\displaystyle X} .

Key takeaways

Saturated set (intersection of open sets) belongs to mathematics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Saturated set (intersection of open sets) to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Saturated set (intersection of open sets) from memory before moving on to harder problems.

Reference excerpt

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 Let S {\displaystyle S} be a subset of a topological space X {\displaystyle X} . The saturation sat ⁡ ( S ) {\displaystyle \operatorname {sat} (S)} of S {\displaystyle S} is the intersection of all the neighborhoods of S {\displaystyle S} .

sat ⁡ ( S ) = ⋂ N S {\displaystyle \operatorname {sat} (S)=\bigcap {\mathcal {N}}_{S}}

Here N S {\displaystyle {\mathcal {N}}_{S}} denotes the neighborhood filter of S {\displaystyle S} . The neighborhood filter N S {\displaystyle {\mathcal {N}}_{S}} can be replaced by any local basis of S {\displaystyle S} . In particular, sat ⁡ ( S ) {\displaystyle \operatorname {sat} (S)} is the intersection of all open sets containing S {\displaystyle S} . Let S {\displaystyle S} be a subset of a topological space X {\displaystyle X} . Then the following conditions are equivalent.

S {\displaystyle S} is the intersection of a set of open sets of X {\displaystyle X} .

S {\displaystyle S} equals its own saturation. We say that S {\displaystyle S} is saturated if it satisfies the above equivalent conditions. We say that S {\displaystyle S} is recurrent if it intersects every non-empty saturated set of X {\displaystyle X} .

Properties

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

In relation to compactness A subset of a topological space is compact if and only if its saturation is compact. For a topological space X {\displaystyle X} , the following are equivalent.

Every point x ∈ X {\displaystyle x\in X} has a compact local basis. (This is one of several definitions of locally compact spaces.) Every point x ∈ X {\displaystyle x\in X} has a compact saturated local basis. In a sober space, the intersection of a downward-directed set of compact saturated sets is again compact and saturated. This is a sober variant of the Cantor intersection theorem.

In relation to Baire spaces For a topological space X {\displaystyle X} , the following are equivalent.

X {\displaystyle X} is a Baire space. Every recurrent set of X {\displaystyle X} is Baire.

X {\displaystyle X} has a Baire recurrent set.

Examples For a topological space X {\displaystyle X} , the following are equivalent.

Every subset of X {\displaystyle X} is saturated. The only recurrent set of X {\displaystyle X} is X {\displaystyle X} itself.

X {\displaystyle X} is a T1 space. A subset S {\displaystyle S} of a preordered set ( X , ≲ ) {\displaystyle (X,\lesssim )} is saturated with respect to the Scott topology if and only if it is upward-closed. Let ( X , ≲ ) {\displaystyle (X,\lesssim )} be a closed preordered set (one in which every chain has an upper bound). Let max X {\displaystyle \max X} be the set of maximal elements of X {\displaystyle X} . By the Zorn lemma, max X {\displaystyle \max X} is a recurrent set of X {\displaystyle X} with the Scott topology.

References

External links Saturated set at the nLab

Worked examples

Example 1 — a first encounter with Saturated set (intersection of open sets)

Start with the simplest possible case. Write down what Saturated set (intersection of open sets) claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Saturated set (intersection of open sets) before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Saturated set (intersection of open sets) ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Saturated set (intersection of open sets)

In research: Saturated set (intersection of open sets) appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Saturated set (intersection of open sets) in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Saturated set (intersection of open sets) is common in secondary-school and first-year university syllabi. It links to neighbouring topics General topology, so understanding it makes those chapters shorter.
In everyday life: Look for Saturated set (intersection of open sets) outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Saturated set (intersection of open sets) in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Saturated set (intersection of open sets) means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Saturated set (intersection of open sets) out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Saturated set (intersection of open sets) in simple terms?

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 Let S {\displaystyle S} be a subset of a topological space X {\displaystyle X} .

Why does Saturated set (intersection of open sets) matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Saturated set (intersection of open sets)?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Saturated set (intersection of open sets).