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 CategoriesElementary 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionModel Instantiation and Structure RealizationEmbeddings and Preservation of FormulasIsomorphisms and Structural Equivalence

Longest path: 87 steps · 485 total prerequisite topics

Prerequisites (2)

Leads To (2)