12.1 Functions

Class: CSE 16 Subject: computer-science discrete-math Date: 2024-12-10 Teacher: Prof. Musacchio

Functions

Function

• Suppose $A$ and $B$ are sets. A function $f$ from $A$ to $B$ (denoted as $f:A\to B$) is a relation $f\subseteq A\times B$ from $A$ to $B$, satisfying the property that for each $a\in A$ the relation $f$ contains exactly one ordered pair of form $(a,b)$. The statement $(a,b)\in f$ is abbreviated $f(a)=b$.