Cantor–Bernstein–Schröder theorem
E160401
The Cantor–Bernstein–Schröder theorem is a fundamental result in set theory stating that if each of two sets can be injected into the other, then there exists a bijection between them, so the sets have the same cardinality.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Cantor–Bernstein theorem | 4 |
| Cantor–Bernstein–Schröder theorem canonical | 1 |
| Schröder–Bernstein theorem | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1396006 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: Cantor–Bernstein–Schröder theorem Context triple: [Georg Cantor, knownFor, Cantor–Bernstein–Schröder theorem]
-
A.
Cantor’s theorem
Cantor’s theorem is a fundamental result in set theory stating that the power set of any set has a strictly greater cardinality than the set itself, implying there is no largest infinity.
-
B.
Cantor’s paradox
Cantor’s paradox is a foundational result in set theory showing that the “set of all sets” cannot exist because its power set would have a strictly larger cardinality, leading to a contradiction.
-
C.
Burali-Forti paradox
The Burali-Forti paradox is a foundational logical contradiction in set theory that arises from considering the set of all ordinal numbers, showing that such a totality cannot consistently exist as a set.
-
D.
Zermelo–Fraenkel set theory
Zermelo–Fraenkel set theory is the standard axiomatic framework for modern set theory, designed to avoid paradoxes and provide a rigorous foundation for much of mathematics.
-
E.
Zermelo set theory
Zermelo set theory is an early axiomatic system for set theory, introduced by Ernst Zermelo to rigorously formalize the concept of sets and avoid known paradoxes.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Cantor–Bernstein–Schröder theorem Target entity description: The Cantor–Bernstein–Schröder theorem is a fundamental result in set theory stating that if each of two sets can be injected into the other, then there exists a bijection between them, so the sets have the same cardinality.
-
A.
Cantor’s theorem
Cantor’s theorem is a fundamental result in set theory stating that the power set of any set has a strictly greater cardinality than the set itself, implying there is no largest infinity.
-
B.
Cantor’s paradox
Cantor’s paradox is a foundational result in set theory showing that the “set of all sets” cannot exist because its power set would have a strictly larger cardinality, leading to a contradiction.
-
C.
Burali-Forti paradox
The Burali-Forti paradox is a foundational logical contradiction in set theory that arises from considering the set of all ordinal numbers, showing that such a totality cannot consistently exist as a set.
-
D.
Zermelo–Fraenkel set theory
Zermelo–Fraenkel set theory is the standard axiomatic framework for modern set theory, designed to avoid paradoxes and provide a rigorous foundation for much of mathematics.
-
E.
Zermelo set theory
Zermelo set theory is an early axiomatic system for set theory, introduced by Ernst Zermelo to rigorously formalize the concept of sets and avoid known paradoxes.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
mathematical theorem
ⓘ
theorem ⓘ theorem in set theory ⓘ |
| alsoKnownAs |
Bernstein theorem
ⓘ
Cantor–Bernstein–Schröder theorem ⓘ
surface form:
Cantor–Bernstein theorem
|
| appliesTo |
arbitrary sets
ⓘ
finite sets ⓘ infinite sets ⓘ |
| classification | result about equivalence relations on sets via bijections ⓘ |
| concerns |
bijective functions
ⓘ
cardinality of sets ⓘ equipotent sets ⓘ injective functions ⓘ |
| doesNotRequire | axiom of choice ⓘ |
| ensuresExistenceOf | bijection between two mutually embeddable sets ⓘ |
| field |
mathematical logic
ⓘ
set theory ⓘ |
| formalizes | equivalence of mutual embeddability and equipotence for sets ⓘ |
| generalFormulation | For sets A and B, if there exists an injection f:A→B and an injection g:B→A, then there exists a bijection h:A↔B. ⓘ |
| hasAlternativeProofMethod |
category-theoretic arguments
ⓘ
order-theoretic arguments ⓘ |
| hasStandardProofMethod | construction via chains of elements under injections ⓘ |
| implies | If each of two sets can be injected into the other, then the two sets have the same cardinality. ⓘ |
| isFundamentalResultIn | set theory ⓘ |
| logicalStrength | provable in ZF set theory ⓘ |
| mathematicalDomain | theory of cardinal numbers ⓘ |
| namedAfter |
Ernst Schröder
ⓘ
Felix Bernstein ⓘ Georg Cantor ⓘ |
| originalProofBy | Felix Bernstein ⓘ |
| relatedTo |
Cantor’s theorem
ⓘ
surface form:
Cantor's theorem
Cantor–Bernstein–Schröder theorem self-linksurface differs ⓘ
surface form:
Schröder–Bernstein theorem
Hausdorff maximal principle ⓘ
surface form:
Zorn's lemma
axiom of choice ⓘ axiom of choice ⓘ
surface form:
well-ordering theorem
|
| statement | If there exists an injective function from set A to set B and an injective function from set B to set A, then there exists a bijective function between A and B. ⓘ |
| topic |
comparison of cardinalities
ⓘ
equivalence of sets ⓘ partial order of cardinal numbers ⓘ |
| usedIn |
construction of bijections between infinite sets
ⓘ
foundations of measure theory ⓘ functional analysis ⓘ proofs about cardinal arithmetic ⓘ theory of equivalence relations on sets ⓘ |
| usedToShow | mutual injections imply equal cardinality ⓘ |
| yearFirstPublished | 1897 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: Cantor–Bernstein–Schröder theorem Description of subject: The Cantor–Bernstein–Schröder theorem is a fundamental result in set theory stating that if each of two sets can be injected into the other, then there exists a bijection between them, so the sets have the same cardinality.
Referenced by (6)
Full triples — surface form annotated when it differs from this entity's canonical label.