Schröder–Bernstein Property

The property of a specified mathematical class, embedding relation, and equivalence notion that mutual embeddability forces equivalence, making the embedding preorder antisymmetric after quotienting by that equivalence.

Version

v2 · 2026-09-06 · History

Domain-specific #

2718

Origin domain

mathematics

Subdomain

structural comparison and classification

Core Idea

A mathematical class has a Schröder–Bernstein property when two objects that embed into one another must be equivalent under a declared notion of sameness. In symbols, after fixing a class \(\mathcal C\), an embeddability relation \(\preccurlyeq\), and an equivalence relation \(\cong\), the property is

\[ X\preccurlyeq Y\;\text{and}\;Y\preccurlyeq X \quad\Longrightarrow\quad X\cong Y. \]

The classical model is the Cantor–Schröder–Bernstein theorem: injections \(X\to Y\) and \(Y\to X\) imply a bijection between sets. The name now identifies a reusable theorem schema. Its instances change the objects, what counts as embedding or part, and what counts as equivalence.

Scope of Application

The home domain is mathematics, especially classification by embeddings. Set theory provides the prototype. Functional analysis asks whether mutually complemented-embeddable Banach spaces are isomorphic. Module theory studies subisomorphic direct summands and conditions on modules or rings that force isomorphism. Operator algebra uses subequivalence and equivalence of projections. Descriptive set theory uses Borel or bimeasurable embeddings. Computability theory replaces injections and bijections by effective reductions and computable isomorphisms.

Clarity

A valid statement should answer:

1. What are the admissible objects? 2. What exactly makes \(X\preccurlyeq Y\)? 3. Is the relation reflexive and transitive on the chosen class? 4. What exactly makes \(X\cong Y\)? 5. Does equivalence imply two-way embeddability? 6. Are the two embedding witnesses required to be compatible, effective, measurable, complemented, or structure-reflecting? 7. Is the conclusion an existence theorem, and if so is it constructive or effective?

Manages Complexity

Classification problems often make direct construction of an isomorphism difficult. Embeddings are weaker and may be easier to build using universal objects, subspace decompositions, coding maps, or comparison theorems. A Schröder–Bernstein theorem converts two tractable one-way tasks into a decisive sameness result.

The schema also exposes where a classification program is coarse. When it fails, mutual embeddability classes contain several intended isomorphism classes.

Abstract Reasoning

Suppose \(\preccurlyeq\) is a preorder and \(\cong\) is an equivalence compatible with it. Define \(X\approx Y\) iff \(X\preccurlyeq Y\) and \(Y\preccurlyeq X\). Then \(\approx\) is automatically an equivalence relation. The Schröder–Bernstein question is whether \(\approx=\cong\).

If the property holds, any invariant monotone under embeddings in both directions must take the same value on mutually embeddable objects, and the theorem upgrades that agreement to full structural equivalence.

Knowledge Transfer

The schema transfers exactly across mathematical domains because it treats objects and relations as parameters. Sets, Borel spaces, projections, computable sets, modules, and Banach spaces instantiate the same logical form while producing different theorems and counterexamples.

Proof techniques do not transfer automatically. The classical alternating-chain construction uses the combinatorics of injections. Operator-algebra proofs use partial isometries and projection comparison. Computable variants must preserve effectiveness. Module and Banach-space results depend on decomposition properties. The reusable abstraction is the question and order-theoretic diagnosis, not one universal proof.

Relationships to Other Abstractions

Current abstraction Schröder–Bernstein Property Domain-specific

Parents (1) — more general patterns this builds on

• Schröder–Bernstein Property is a kind of Order Prime

  The property instantiates Order.

Hierarchy paths (3) — routes to 3 parentless roots

• Schröder–Bernstein Property → Order → Comparison → Self Checking

Show alternative paths (2)

Neighborhood in Abstraction Space

Schröder–Bernstein Property sits in a sparse region of the domain-specific corpus (75^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Functions, Maps & Integral Structure (10 abstractions)

Nearest neighbors

• Accessibility Relation — 0.84
• Universal property — 0.83
• Age (Model Theory) — 0.83
• Class (Knowledge Representation) — 0.83
• Invariant Sigma-Algebra — 0.83

Computed from structural-signature embeddings · 2026-09-08