{
  "id": "schroeder-bernstein-theorem",
  "title": "Schröder–Bernstein Theorem",
  "lang": "en",
  "source_lang": "en",
  "summary": "The Schröder–Bernstein theorem states that two sets have the same cardinality whenever each admits an injection into the other.",
  "category": "mathematics",
  "subcategory": "discrete-logic",
  "type": "concept",
  "aliases": [
    "Cantor–Bernstein theorem",
    "Cantor–Schröder–Bernstein theorem",
    "Bernstein’s equivalence theorem"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/schroeder-bernstein-theorem/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/schroeder-bernstein-theorem/",
      "json": "https://aiwiki.page/zh/schroeder-bernstein-theorem.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The Schröder–Bernstein theorem is a fundamental result in set theory: if there is an injective function from a set \\(A\\) into a set \\(B\\), and another injective function from \\(B\\) into \\(A\\), then there is a bijection between \\(A\\) and \\(B\\). In other words, if each set can be embedded into the other without identifying distinct elements, the two sets have the same cardinality. The theorem applies to finite and infinite sets alike and can be proved without the axiom of choice."
    },
    {
      "heading": "Statement and meaning",
      "text": "Let \\(A\\) and \\(B\\) be sets. Suppose there are injections\n\n\\[f:A\\longrightarrow B, \\qquad g:B\\longrightarrow A.\\]\n\nThen there exists a bijection\n\n\\[h:A\\longrightarrow B.\\]\n\nAn injection assigns different outputs to different inputs but need not reach every element of its codomain. A bijection is both injective and surjective: every element of the target set is reached exactly once.\n\nCardinal comparison is defined through these kinds of functions:\n\n\\[|A|\\leq |B| \\quad\\Longleftrightarrow\\quad \\text{there is an injection }A\\to B,\\]\n\nwhile\n\n\\[|A|=|B| \\quad\\Longleftrightarrow\\quad \\text{there is a bijection }A\\to B.\\]\n\nThe theorem therefore establishes\n\n\\[|A|\\leq |B| \\quad\\text{and}\\quad |B|\\leq |A| \\quad\\Longrightarrow\\quad |A|=|B|.\\]\n\nThis is the antisymmetry property underlying the partial ordering of cardinalities. The result does not say that either of the original injections must itself be a bijection. Rather, their existence guarantees that a suitable bijection can be constructed."
    },
    {
      "heading": "Proof by separating the sets into parts",
      "text": "A standard proof builds the bijection by using \\(f\\) on one part of \\(A\\) and reversing \\(g\\) on the rest.\n\nFor a function \\(u\\) and a subset \\(S\\) of its domain, write\n\n\\[u[S]=\\{u(s):s\\in S\\}\\]\n\nfor the image of \\(S\\).\n\nDefine\n\n\\[A_0=A\\setminus g[B],\\]\n\nand recursively set\n\n\\[A_{n+1}=g[f[A_n]] \\qquad(n=0,1,2,\\ldots).\\]\n\nThus, \\(A_0\\) consists of the elements of \\(A\\) that are not reached by \\(g\\); each successive set is obtained by applying \\(f\\) and then \\(g\\).\n\nLet\n\n\\[C=\\bigcup_{n=0}^{\\infty}A_n.\\]\n\nDefine\n\n\\[h(a)= \\begin{cases} f(a),&a\\in C,\\\\[4pt] g^{-1}(a),&a\\in A\\setminus C. \\end{cases}\\]\n\nHere \\(g^{-1}\\) means the inverse function from \\(g[B]\\) to \\(B\\). It exists because \\(g\\) is injective. The second branch is well-defined: since \\(A_0\\subseteq C\\), every element outside \\(C\\) belongs to \\(g[B]\\).\n\nInjectivity\n\nOn \\(C\\), the function \\(h\\) is injective because it agrees with \\(f\\). On \\(A\\setminus C\\), it is injective because it agrees with \\(g^{-1}\\).\n\nThe two branches cannot produce the same output. If \\(a\\in C\\), \\(a'\\notin C\\), and\n\n\\[f(a)=g^{-1}(a'),\\]\n\nthen\n\n\\[a'=g(f(a)).\\]\n\nBut \\(g[f[C]]\\subseteq C\\), by the definition of the sets \\(A_n\\). This would imply \\(a'\\in C\\), a contradiction. Thus \\(h\\) is injective on all of \\(A\\).\n\nSurjectivity\n\nTake any \\(b\\in B\\).\n\nIf \\(b\\in f[C]\\), then \\(b=h(a)\\) for some \\(a\\in C\\).\n\nIf \\(b\\notin f[C]\\), consider \\(g(b)\\). This element cannot lie in \\(A_0\\), since it lies in \\(g[B]\\). It also cannot lie in any \\(A_{n+1}\\): otherwise,\n\n\\[g(b)\\in g[f[A_n]],\\]\n\nand injectivity of \\(g\\) would imply \\(b\\in f[A_n]\\subseteq f[C]\\).\n\nConsequently, \\(g(b)\\notin C\\), so the second branch gives\n\n\\[h(g(b))=g^{-1}(g(b))=b.\\]\n\nEvery element of \\(B\\) is therefore reached, completing the proof."
    },
    {
      "heading": "Interpretation through chains",
      "text": "The construction also has a graph-theoretic interpretation. Regard \\(A\\) and \\(B\\) as disjoint copies, even if the original sets overlap. Draw an arrow from each \\(a\\in A\\) to \\(f(a)\\in B\\), and from each \\(b\\in B\\) to \\(g(b)\\in A\\).\n\nEvery vertex has one outgoing arrow and at most one incoming arrow. The resulting components are alternating cycles, chains infinite in both directions, or one-sided infinite chains.\n\nThe elements of \\(A_0\\) begin precisely those one-sided chains whose initial vertex lies in \\(A\\). The set \\(C\\) contains all \\(A\\)-vertices on those chains. On such chains, pairing along \\(f\\) matches every vertex correctly. On all remaining components, pairing by reversing \\(g\\) does the same.\n\nThis explains why simply using \\(f\\) everywhere may leave elements of \\(B\\) unmatched, while using \\(g^{-1}\\) everywhere may fail to assign values to some elements of \\(A\\). The proof identifies exactly where to switch between the two rules."
    },
    {
      "heading": "Applications",
      "text": "Proving equal cardinality indirectly\n\nThe principal use of the theorem is to replace the search for one bijection with the search for two injections. An injection often arises naturally from an inclusion, an encoding, or a simple formula, whereas a direct bijection may be cumbersome.\n\nFor example, let\n\n\\[A=(0,1), \\qquad B=[0,1].\\]\n\nThe inclusion \\(A\\hookrightarrow B\\) is injective. In the other direction,\n\n\\[x\\longmapsto \\frac{x+1}{3}\\]\n\ninjects \\(B\\) into \\(A\\). The theorem therefore gives\n\n\\[|(0,1)|=|[0,1]|.\\]\n\nAdding the two endpoints does not change the cardinality of the interval.\n\nCardinal sandwich arguments\n\nSuppose\n\n\\[A\\subseteq B\\subseteq C\\]\n\nand \\(|A|=|C|\\). Inclusion gives an injection \\(A\\to B\\), while inclusion into \\(C\\), followed by a bijection \\(C\\to A\\), gives an injection \\(B\\to A\\). Hence\n\n\\[|A|=|B|=|C|.\\]\n\nThis is often called a cardinal sandwich argument. It allows the size of an intermediate set to be determined without explicitly matching its elements to those of either outer set.\n\nCountably infinite products\n\nLet \\(\\mathbb N=\\{0,1,2,\\ldots\\}\\). There is an injection\n\n\\[\\mathbb N\\longrightarrow \\mathbb N\\times\\mathbb N, \\qquad n\\longmapsto(n,0).\\]\n\nConversely,\n\n\\[(m,n)\\longmapsto 2^m(2n+1)\\]\n\ninjects the Cartesian product \\(\\mathbb N\\times\\mathbb N\\) into \\(\\mathbb N\\): each positive integer has a unique decomposition as a power of two times an odd number.\n\nThe theorem shows that \\(\\mathbb N\\times\\mathbb N\\) is a countably infinite set. The two encodings establish this without requiring a separate explicit bijection."
    },
    {
      "heading": "Foundations and limitations",
      "text": "No choice principle is required\n\nThe theorem is provable in Zermelo–Fraenkel set theory without the axiom of choice. In the proof above, every value \\(g^{-1}(a)\\) is uniquely determined; there is no need to make arbitrary selections from families of sets.\n\nThis should be distinguished from the assertion that any two sets have comparable cardinalities:\n\n\\[|A|\\leq |B| \\quad\\text{or}\\quad |B|\\leq |A|.\\]\n\nOver Zermelo–Fraenkel set theory, this general comparability assertion is equivalent to the axiom of choice. Schröder–Bernstein establishes equality when injections in both directions are already available; it does not guarantee that either direction exists for arbitrary sets.\n\nClassical existence need not give an effective algorithm\n\nAlthough the proof specifies a bijection by a formula, deciding whether a given element belongs to\n\n\\[C=\\bigcup_{n=0}^{\\infty}A_n\\]\n\nmay not be computationally feasible or even decidable for a particular representation of the sets and functions. A set-theoretic construction is therefore not automatically an algorithm for computing the resulting bijection.\n\nThe logical setting also matters. The unrestricted theorem is not generally available in intuitionistic logic without additional principles; in particular, the classical division into \\(C\\) and its complement need not provide a decidable case distinction.\n\nAdditional structure need not be preserved\n\nThe theorem concerns sets and functions, not arbitrary forms of mathematical structure. Mutual embeddings of structured objects need not imply an isomorphism preserving that structure.\n\nFor example, there are continuous injections in both directions between the real line \\(\\mathbb R\\) and \\([0,1]\\). Inclusion provides one direction, and\n\n\\[x\\longmapsto \\frac12+\\frac{1}{\\pi}\\arctan x\\]\n\nprovides the other. Nevertheless, they are not homeomorphic: \\([0,1]\\) is a compact space, whereas \\(\\mathbb R\\) is not. The theorem guarantees a bijection of their underlying sets, not a homeomorphism."
    },
    {
      "heading": "Historical development",
      "text": "The theorem emerged from Georg Cantor’s work on comparing infinite sets. Richard Dedekind found a proof in 1887 that remained unpublished at the time. Felix Bernstein independently proved the theorem in 1897. Ernst Schröder also worked on the result, although his proposed proof contained an error.\n\nThe names Schröder–Bernstein, Cantor–Bernstein, and Cantor–Schröder–Bernstein reflect these overlapping contributions. Its lasting significance is foundational: injections in both directions suffice to establish equality of size, even for infinite sets and without assuming the axiom of choice."
    }
  ],
  "links": [
    "set-theory",
    "injective-function",
    "bijective-function",
    "cardinality",
    "axiom-of-choice",
    "surjective-function",
    "partial-order",
    "mathematical-proof",
    "image-of-a-function",
    "inverse-function",
    "graph-theory",
    "cartesian-product",
    "countable-set",
    "zermelo-fraenkel-set-theory",
    "algorithm",
    "intuitionistic-logic",
    "isomorphism",
    "real-number",
    "homeomorphism",
    "compact-space",
    "georg-cantor"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}