A binary relation or multi-valued mapping between elements of two sets that pairs elements without requiring function-like uniqueness; formally a subset R ⊆ A × B or a rule assigning to each a ∈ A a subset R(a) ⊆ B.

Principle

Describe connections by allowed pairings rather than single-valued assignment: membership of ordered pairs determines the relation and its algebraic operations (composition, inverse, restriction).

Demonstration

Let A be people and B be phone numbers; the correspondence R ⊆ A × B relates a person to every phone number they use, so R(a) is the set of that person's numbers. Composition of this R with a relation S from numbers to service providers gives who uses which provider.

Misapplication

Treating a general correspondence as if it were a function and assuming each a ∈ A has at most one b ∈ B; this leads to incorrect conclusions about invertibility, uniqueness, or solvability of pairings.

Consequence

Models many-to-many relationships naturally; supports operations like inverse relation and relational composition, and can represent constraints that are inherently nondeterministic.

Reversal

The converse notion is a single-valued function or a bijection: restricting a correspondence to a graph of a function or selecting a single representative per a converts it into a function.

Boundary

Applies to any sets A and B and does not require algebraic structure on them; excluded are contexts that demand uniqueness (functions), directional probabilities, or measures unless enriched with additional structure.

Semantic Tension

Competes with the notion of function: both pair domain and codomain elements, but a function enforces single-valuedness while correspondence allows multiplicity and nondeterminism.

Synthesis

A correspondence is the general notion of pairing elements across sets by membership of ordered pairs or by assigning sets of targets; it generalizes functions and supports relational algebra (inverse, composition) to express nondeterministic or many-to-many connections.