Kuratowski's closure-complement problem
theorem that the monoid generated by taking closures and complements of a given set in a topological space has size at most 14, attained by e.g. the set (0, 1) ∪ (1, 2) ∪ {3} ∪ ([4, 5] ∩ ℚ) of reals
Press Enter · cited answer in seconds
0 sources
Kuratowski's closure-complement problem
Summary
Kuratowski's closure-complement problem is a mathematical problem[1]. It draws 24 Wikipedia views per month (mathematical_problem category, ranking #69 of 128).[2]
Key Facts
- Kuratowski's closure-complement problem's instance of is recorded as mathematical problem[3].
- Kuratowski's closure-complement problem's instance of is recorded as theorem[4].
- Kazimierz Kuratowski is named after Kuratowski's closure-complement problem[5].
- Kuratowski's closure-complement problem's part of is recorded as topology[6].
- Kuratowski's closure-complement problem's Freebase ID is recorded as /m/02q1zgw[7].
- Kuratowski's closure-complement problem's maintained by WikiProject is recorded as WikiProject Mathematics[8].
- Kuratowski's closure-complement problem's Microsoft Academic ID is recorded as 2781053527[9].
Why It Matters
Kuratowski's closure-complement problem draws 24 Wikipedia views per month (mathematical_problem category, ranking #69 of 128).[2] It has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.[10]