Skip to content

Elementary substructure

A substructure preserving the truth of every first-order formula with its own parameters, equivalently satisfying the Tarski–Vaught existential-witness condition.

Version
v1 · 2026-09-28 · History
Domain-specific #
9207
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Model Theory, Mathematical Logic → Mathematics

Core Idea

Elementarity strengthens ordinary substructure. Shared operations and relations are not enough: quantified statements with parameters from the smaller structure must have the same truth in both structures. The larger model may contain new elements without making a new definable fact about the old ones.

The Tarski–Vaught test makes this usable. If the larger structure has a witness to an existential formula with parameters in N, N must already contain a witness. Elementary embeddings extend the idea beyond literal inclusion; elementary equivalence alone lacks that embedding relation.

Structural Signature

Sig role-phrases:

  • Common signature σ — Fixes functions, relations, constants, and formula language. It is frame. Counterfactual: Changing signature can change elementarity.
  • Substructure N⊆M — Preserves operations, relations, and constants under inclusion. It is carrier. Counterfactual: Elementary equivalence without inclusion is weaker.
  • Parameters from N — Anchor formulas to elements shared by both structures. It is language. Counterfactual: Arbitrary parameters from M change the test.
  • Truth preservation — Requires agreement for every first-order formula. It is invariant. Counterfactual: Agreement on atomic formulas only gives substructure.
  • Existential witness — Realizes in N each N-parameter condition realized in M. It is test. Counterfactual: One missing witness disproves elementarity.
  • Elementary embedding — Generalizes inclusion through an injective structure map whose image is elementary. It is morphism. Counterfactual: Ordinary embeddings need not preserve quantified truth.

What It Is Not

  • It is not any substructure.
  • It is not elementary equivalence alone.
  • It is not second-order equivalence.
  • It is not preservation of atomic formulas only.
  • Closest near-miss. Elementarily equivalent structures satisfy the same parameter-free sentences; an elementary substructure additionally sits inside the larger structure and preserves formulas with parameters from the smaller one.

Scope of Application

  • Model construction. Builds small models preserving a first-order theory.
  • Löwenheim–Skolem arguments. Finds elementary submodels of controlled size.
  • Elementary chains. Forms unions while retaining elementarity.
  • Large cardinals. Uses elementary embeddings with strong set-theoretic properties.
  • Definability. Compares parameterized truth across nested models.

Clarity

State signature, domains, substructure maps, parameter set, and formula class. Apply Tarski–Vaught with explicit witness closure, and distinguish literal inclusion from an embedding image.

Manages Complexity

The abstraction captures semantic fidelity under size reduction. It replaces an infinite all-formulas requirement with a witness criterion and permits smaller structures to stand in for larger ones for first-order reasoning with retained parameters.

Abstract Reasoning

  1. Fix the common first-order signature.
  2. Verify N is a substructure of M.
  3. Take an existential formula with parameters in N.
  4. Whenever M has a witness, locate one inside N.
  5. Conclude full formula preservation by Tarski–Vaught.
  6. For non-inclusions, apply the test to the embedding image.

Knowledge Transfer

The transferable cargo is truth-preserving inclusion under a bounded logic. It transfers to other logics only with their own elementarity notion; it stops at assuming every faithful algebraic embedding preserves quantified truth.

Examples

Canonical

A substructure N of M passes Tarski–Vaught: whenever M realizes ∃x φ(x,b) for b from N, some witness in N realizes it.

Mapped back: parameters → N; witness → N; result → elementary.

Applied / In Practice

The union of an elementary chain remains elementary in later structures under the standard theorem.

Mapped back: maps → elementary inclusions; construction → union.

Applied / In Practice

A subfield preserves addition and multiplication but an existential formula with its parameters has a solution only in the larger field; it is not elementary.

Mapped back: substructure → yes; witness closure → fails.

Structural Tensions

T1 — Small Carrier versus Full First-Order Fidelity. A proper subset can preserve every definable relation with internal parameters despite omitting elements.

Diagnostic: Which formulas can distinguish the omission?

T2 — Global Formula Condition versus Existential Witness Test. All formulas look intractable, but Tarski–Vaught reduces verification to witnessed existence.

Diagnostic: Are closure hypotheses enough to find witnesses?

T3 — Language Expansion versus Elementarity Stability. Adding symbols can expose distinctions invisible in the original signature.

Diagnostic: Which signature is fixed?

Structural–Framed Character

Elementary Substructure is hybrid: structurally a semantics-preserving inclusion and framed by first-order syntax, signature, parameters, and model-theoretic witness theorems.

Structural Core vs. Domain Accent

The core is a smaller carrier indistinguishable by formulas using its own elements. Model theory supplies signatures, structures, embeddings, satisfaction, parameters, existential witnesses, Tarski–Vaught, and elementary chains.

  • Approved root. Diagram and finite-set nodes are tools or carriers rather than genera; the frozen root remains.

  • Related — elementary embedding, elementary equivalence, substructure, Tarski–Vaught test, elementary chain, and model. These provide variants and tests.

Neighborhood in Abstraction Space

Elementary substructure sits in a crowded region of the domain-specific corpus (38th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Formal Systems & Discrete Structures (18 abstractions)

Nearest neighbors

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

Not to Be Confused With

  • Elementary Equivalence. Tell: Equivalence compares sentences without requiring inclusion; elementary substructure preserves parameterized formulas inside one larger structure.
  • Substructure. Tell: An ordinary substructure preserves basic operations and relations but can fail quantified formulas.
  • Existentially Closed Structure. Tell: Existential closure is relative to a class of extensions and need not give full elementarity.
  • Elementary Function. Tell: Elementary functions in arithmetic or calculus are unrelated uses of elementary.

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Elementary_equivalence (revision 1344446394).
  • Preserved source candidate: https://www.sciencedirect.com/science/article/pii/0012365X9590789N
  • Preserved source candidate: https://archive.org/details/mathematicallogi00jdon

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.