##  [Elementary Substructure](/elementary-substructure-1) 

 Definition

A substructure A of a structure B (in the same first-order language) such that for every first-order formula φ(x1,...,xn) and every tuple a from A, B ⊨ φ(a) if and only if A ⊨ φ(a). Commonly denoted A ≺ B.

 

 

 

 

 

 





## Principle

Principle

Elementarity requires exact agreement on the truth of all first-order formulas with parameters from the smaller structure; it is stronger than being a substructure and ensures full preservation of logical structure relative to parameters from A.

 

 

 

 

 





## Demonstration

Demonstration

Let A be a submodel of B obtained by closing a set under definable operations; if every formula with parameters from A that holds in B already holds in A, then A is elementary in B. For example, any structure is an elementary substructure of its ultrapower's isomorphic copy via the Los theorem realization of diagonal embedding.

 

 

 

 

## Misapplication

Misapplication

Treating any inclusion-homomorphism or induced substructure as elementary; for instance, thinking the rational field Q is an elementary substructure of the real field R in the language of rings is false because R satisfies existential statements about roots that Q does not.

 

 

 

 

 





## Consequence

Consequence

If A ≺ B then types over A realized in B are already realized in A when they are realized by formulas with parameters in A; transfer of satisfaction enables use of compactness and back-and-forth arguments to compare structures and construct isomorphisms in appropriate contexts.

 

 

 

 

## Reversal

Reversal

The opposite notion is a non-elementary substructure: A ⊆ B that is a substructure but there exists a formula with parameters from A true in B and false in A. Such a reversal highlights failure of preservation even for simple existential or universal formulas.

 

 

 

 

 





## Boundary

Boundary

Applies to first-order languages and requires both structures to share the same language and interpretation of symbols; it does not directly generalize to higher-order logics, category-theoretic subobjects, or to mere elementary equivalence without an inclusion map.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Conflicts with 'elementary equivalence' (A ≡ B) where two structures satisfy the same first-order sentences but need not embed one into the other elementarily; a substructure can be elementary only when inclusion and formula preservation coincide.

 

 

 

 

 





## Synthesis

Synthesis

An elementary substructure is a submodel whose inclusion map preserves truth of every first-order formula with parameters from the submodel, guaranteeing that the smaller model is logically indistinguishable from the larger one when viewed through formulas referencing elements of the smaller model.