General topology Basic notions: open sets, neighbourhoods, bases Problem
Kuratowski's closure-complement problem
Problem
Let be a topological space and let . Apply to , again and again and in any order, the two operations of taking the closure and taking the complement in . How many distinct subsets of can arise in this way, at most?
Remarks
The problem is solved: at most distinct sets arise, counting itself, and the bound is attained in . The interior of is the complement of the closure of the complement of . With for closure and for interior, every set that arises is one of or the complement of one of them. The key identity is , which stops the list.
In , the set gives distinct sets. For it, , , , , and . These seven sets are distinct and bounded, and their seven complements are unbounded, so all are distinct.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Closure concept
- Complement concept
- Interior concept
- Topological space concept
- Kuratowski's closure-complement problem problem
Further reading
About this page
| Tag | QCDA5QM2BZ |
|---|---|
| URI | m2://QCDA5QM2BZ |
| Kind | problem |
| Writing | W0 stub |
| MSC | 54A05 |
| Status | This copy of the site has no build data. Run m2 status QCDA5QM2BZ. |
| About | Closure, Complement |
| Uses | Topological space, Closure, Complement, Interior |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.