KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesElementary Equivalence and Elementary SubstructuresEngineering · Engineering MathematicsLesson 42/884← PrevNext →
ArticlePublished 12 Aug 2026Updated 7 Aug 20263 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIElementary Equivalence and Elementary Substructures

KEVOS knowledge first · trusted web sources when needed

Connections with Model Theory

Elementary Equivalence and Elementary Substructures

Structures indistinguishable by first-order sentences, and substructures that agree with the ambient structure on every formula.

Category Engineering / MathematicsSource V.1Pages 226-230Reading 2 minReviewed 2026-08-07

Learning objectives

  • Define elementary equivalence and elementary substructure
  • Distinguish both from isomorphism and from ordinary substructure
  • Give examples separating the notions
On this page
  1. Elementary equivalence
  2. Elementary substructures
  3. The three relations compared
  4. Why the notions matter for algebra

Elementary equivalence

Definition — Elementarily equivalent

Structures A and B for the same language are elementarily equivalent, written A ≡ B, if they satisfy exactly the same first-order sentences.

Isomorphic structures are elementarily equivalent, since an isomorphism preserves satisfaction. The converse fails dramatically.

Elementarily equivalent, non-isomorphic pairs
PairWhy not isomorphic
R and a non-standard real closed fieldDifferent cardinality or non-Archimedean
N and a non-standard model of arithmeticThe non-standard model has elements above every numeral
Q and R as dense linear orders without endpointsDifferent cardinality; the theory is complete so they are equivalent
An infinite algebra and its ultrapowerDifferent cardinality in general
First-order logic cannot see cardinality

By Löwenheim–Skolem, any theory with an infinite model has models of every infinite cardinality above the language size. So elementary equivalence can never pin down an infinite structure up to isomorphism.

Elementary substructures

Definition — Elementary substructureA is an elementary substructure of B, written A ≺ B, if A is a substructure and for every formula Φ and every assignment from A: A ⊧ Φ[a] if and only if B ⊧ Φ[a].
Elementary substructure is much stronger than substructure

A substructure agrees on atomic formulas. An elementary substructure agrees on all formulas, including those with quantifiers — so existential claims witnessed in B must be witnessed inside A.

A substructure that is not elementary

The even integers form a substructure of the integers under addition. But ∃y (y + y ≈ x) holds in the integers for x = 2 with witness 1, and fails in the even integers, where 1 is absent. So the inclusion is not elementary.

The three relations compared

  • Isomorphic — same up to relabelling
    • Elementary substructure — contained and agrees on all formulas
      • Elementarily equivalent — same first-order theory
        • Substructure — contained, agrees on atomic formulas only

The vertical relationships are not a single chain: elementary substructure implies both elementary equivalence and substructure, but the latter two are independent of each other.

Which implies which
⇒ Elementarily equivalent⇒ Substructure
IsomorphicYesNo — different universes
Elementary substructureYesYes
SubstructureNoYes
Elementarily equivalentYesNo

Why the notions matter for algebra

  • Elementary equivalence bounds what identities can express. Two elementarily equivalent algebras satisfy the same identities, so identities cannot distinguish them.
  • Ultrapowers are elementarily equivalent to their base. This is a corollary of Łoś's theorem and is the standard source of non-isomorphic elementarily equivalent pairs.
  • Elementary substructures preserve algebraic properties. Simplicity, subdirect irreducibility and other first-order-expressible conditions transfer along elementary inclusions.
  • Not everything is first-order. Being finitely generated, being simple in the presence of infinitely many congruences, and being free are not generally first-order properties, so they need not transfer.

Frequently asked questions

Can a proper elementary substructure be the same size as the whole structure?

Yes, for infinite structures. The rationals with order have proper elementary substructures of the same cardinality, obtained by removing suitable subsets.

Is every substructure of a finite structure elementary?

No. The same failure as the even integers can occur in the finite case whenever an existential witness lies outside the substructure.

Related pages

  • Satisfaction and the Tarski Truth Definition
  • The Tarski–Vaught Test and Löwenheim–Skolem

Source. S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, The Millennium Edition — a corrected re-typesetting of Springer-Verlag Graduate Texts in Mathematics 78 (1981). Section V.1, book pages 226-230.

This page is an original exposition prepared for the KEVOS® knowledge library. It restates and reorganises mathematical results; it is not a reproduction of the source text.

Continue learning

Algebra and EquationsArticle · Engineering MathematicsValue Delivery SystemArticle · Engineering MathematicsSet-Theoretic PreliminariesArticle · Engineering MathematicsLattice Homomorphisms and Order PreservationArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®