A relation between two algebraic or relational structures indicating that the first can be represented inside the second by an injective homomorphism that preserves the relevant operations and relations.

Principle

An embedding is characterized by an injective structure-preserving map: it must be one-to-one and commute with functions and preserve relations and constants so that structural truths about the domain remain valid in the image.

Demonstration

Example: a graph G embeds into a graph H if there exists an injective vertex mapping f: V(G) → V(H) such that any edge {u,v} in G maps to an edge {f(u),f(v)} in H; this shows G is present as a faithful subconfiguration of H.

Misapplication

Treating any injective map between underlying sets as an embedding even when it fails to preserve relations or functions, or conflating embedding with mere inclusion of a subset that is not a substructure.

Consequence

When one structure embeds in another, any equational or relational property preserved by homomorphisms that holds in the smaller structure also holds of its image; embeddings enable transfer of many structural invariants and counterexamples.

Reversal

The inverse notion is a quotient or surjective homomorphism that collapses structure; unlike embeddings, quotients identify distinct elements and typically lose information rather than faithfully represent it.

Boundary

Embedding is weaker than isomorphism (image need not be the whole target) and stronger than arbitrary homomorphism (must be injective and preserve all structure); it is not necessarily elementary unless it preserves truth of all first-order formulas.

Semantic Tension

Tension arises between embedding, substructure, and elementary embedding: embeddings demand injectivity and preservation of structure but need not preserve all logical formulas the way elementary embeddings do; substructures may be inclusions without an explicit embedding map.

Synthesis

An embedding relation formalizes when one structure can be faithfully placed inside another via an injective, structure-preserving map; it sits between mere homomorphism and isomorphism and is the standard notion for recognizing one structure as a preserved copy inside another.