A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Isomorphisms and Structural Equivalence

Graduate Depth 86 in the knowledge graph ☐ I know this ☆ Set as goal
64topics build on this
485prerequisites beneath it
See this on the map →
Embeddings and Preservation of FormulasIsomorphisms in Categories→→Elementary Equivalence and Logical IndistinguishabilityRyll-Nardzewski Theorem: Syntactic Characterization of Categoricity
isomorphism equivalence bijection structure-preserving

Core Idea

Two structures M and N are isomorphic if there exists a bijection f: M → N that preserves all atomic formulas. Isomorphic structures are essentially identical from a first-order perspective—they satisfy exactly the same sentences. Isomorphism is the strongest notion of structural equivalence in model theory.

Explainer

You already know about embeddings and preservation properties: an embedding is an injective map between structures that preserves and reflects atomic formulas. An isomorphism is an embedding that is also surjective — a bijection in both directions. If f: M → N is an isomorphism, then f is a perfect dictionary that translates every element of M to a unique element of N, with every structural fact preserved exactly.

The fundamental theorem of isomorphisms says that isomorphic structures satisfy the same first-order sentences: M ⊨ φ if and only if N ⊨ φ for every sentence φ. This makes sense intuitively — if you relabel all the elements of M according to f, you get a structure that looks identical to N in every logical respect. No formula in the language can distinguish them, because any formula evaluated on M can be translated element-by-element to the same truth value on N.

It helps to compare isomorphism to related but weaker notions from your prerequisites. An embedding (from your prerequisite topic) preserves structure in one direction but the image might be a proper substructure of N. An elementary embedding preserves all first-order formulas, not just atomic ones, which is a stronger requirement. Elementary equivalence (which you'll study next) is weaker than isomorphism: M ≡ N means they satisfy the same sentences, but there might be no bijection between them — this can happen when the structures have different cardinalities but are otherwise logically indistinguishable.

This hierarchy of equivalences — isomorphism ⊃ elementary equivalence — is central to model theory. Isomorphism is the "gold standard" of sameness: two structures that are isomorphic are literally the same structure with different names for elements. But isomorphism is often too strong for classifying models of a theory, because a theory can have non-isomorphic models of different sizes. This is why model theory develops the coarser tool of elementary equivalence: two models that satisfy exactly the same sentences are equivalent for all logical purposes, even if no bijection exists between them. Understanding where isomorphism ends and elementary equivalence takes over is one of the first lessons in the subject's depth.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Model Instantiation and Structure Realization → Embeddings and Preservation of Formulas → Isomorphisms and Structural Equivalence

Longest path: 87 steps · 485 total prerequisite topics

Prerequisites (2)

Leads To (2)