We will assume familiarity with functional notation. For example, f(x)=x+1f(x)=x+1 means f(2)=3f(2)=3.

In this chapter we take a step back to ensure that everything will be “well-behaved”.

This means specifying the xx-values we are allowed to “plug” into a specific function (the domain) and ensuring that we get exactly one value f(x)f(x) after doing that.

In particular, f(x)f(x) cannot be undefined, nor can it take two or more different values.

A relation ff is a function if every element xx in its domain is mapped to exactly one value f(x).f(x).

The domain is the set of all possible inputs (”xx“-values) a function takes.

We denote the domain of a function ff by Df.D_f.

We define a function by specifying its rule and by giving a description of its domain.

Example

The function ff is defined by

f:xx2for xR,x3.f: x mapsto x^2 quad extrm{for } x in mathbb{R}, x geq -3.

This means that we can write it as f(x)=x2,f(x)=x^2, plug in values like f(2)=4f(-2)=4 (as long as xx lies within the domain), and the domain of ff is given by Df=[3,).D_f = [-3, \infty).

Next: Domain and range >>