Definition:Elementary Embedding/Partial Elementary Embedding

Definition

Let $\MM$ and $\NN$ be $\LL$-structures with universes $M$ and $N$ respectively.

Let $A \subseteq M$ be a subsets of $M$.

$j: A \to \NN$ is a partial elementary embedding if and only if it is a partial $\LL$-embedding which preserves truth for elements of $A$; that is:

$\MM \models \map \phi {a_1, \ldots, a_n} \iff \NN \models \map \phi {\map j {a_1}, \ldots, \map j {a_n} }$

holds for all $n \in \N$, all $\LL$-formulas $\phi$ with $n$ free variables, and for all $a_1, \ldots, a_n \in A$.

Note

A common method of constructing isomorphisms and elementary embeddings in proofs is to recursively define them a finite number of elements at a time.

For this purpose, it is useful to have a definition of elementary embeddings for functions which are only defined on a subset of $M$.

This definition is provided for by the notion of partial elementary embedding.

There are no source works cited for this page. Source citations are highly desirable, and mandatory for all definition pages. Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page.