Skip to content

The domain of a function f: A → B is A — the set of inputs the function is defined on. Every element of the domain has exactly one output under f.

Domain

Let f:ABf : A \to B be a function.

Definition. The domain of ff is the set AA. We write dom(f)=A\mathrm{dom}(f) = A.

Every element aAa \in A has exactly one value f(a)Bf(a) \in B. The function ff is undefined outside dom(f)\mathrm{dom}(f).

Proposition. Two functions f,g:ABf, g : A \to B with the same domain, codomain, and rule (f(a)=g(a)f(a) = g(a) for all aAa \in A) are equal. Two functions with the same rule but different domains are distinct.

Definition. The codomain of f:ABf : A \to B is the set BB. The image (or range) of ff is im(f)={f(a)aA}B\mathrm{im}(f) = \{f(a) \mid a \in A\} \subseteq B.

Proposition. im(f)cod(f)\mathrm{im}(f) \subseteq \mathrm{cod}(f), with equality iff ff is surjective.

In set theory, a function f:ABf : A \to B is a subset fA×Bf \subseteq A \times B satisfying the unique-value condition: for each aAa \in A, there is exactly one bBb \in B with (a,b)f(a, b) \in f.

In category theory, the domain (also called source) of a morphism f:ABf : A \to B is the object AA.

Open questions

Relations

Ast
Date modified
Defines
Domain
Function
Relational universe morphism
Mathematical object
Function
Output
Relational universe