Sierpiński partition theorem
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
infinite sets
|
| gptkbp:describes |
partition of countable sets
|
| gptkbp:field |
gptkb:set_theory
combinatorics |
| https://www.w3.org/2000/01/rdf-schema#label |
Sierpiński partition theorem
|
| gptkbp:namedAfter |
gptkb:Wacław_Sierpiński
|
| gptkbp:relatedTo |
gptkb:infinite_Ramsey_theorem
axiom of choice |
| gptkbp:sentence |
Every countable infinite set can be partitioned into countably many countable infinite subsets.
|
| gptkbp:statedIn |
1916
|
| gptkbp:bfsParent |
gptkb:Partition_Problems_in_Topology
|
| gptkbp:bfsLayer |
8
|