A shop’s profit is its revenue minus its costs, and both depend on how many items it sells. Each of these is a function of the same input, and the profit at one sales level comes from subtracting two numbers. Functions can be added, subtracted, multiplied and divided in exactly this way, one input at a time, as long as both functions accept that input.
Key terms
Sum and difference
Definition Let and be functions with domains and . Their sum and their difference are the functions given by
for every in , which is the domain of both. The order matters for the difference, since .
In plain words To add two functions, add their outputs at the same input. The new function makes sense only at inputs where both original functions do.
Example Let and , both defined for all real numbers. Then
At the outputs are and , so and , as the formulas give. The parentheses around matter, because the minus sign applies to the whole output of .
Product
Definition The product of functions and is the function given by
for every in . A constant multiple , with , is the product of with a constant function and has domain . The notation means multiplying outputs. It is not the composition , which feeds the output of into .
In plain words Multiply the two outputs at each input. Where either factor is zero, the product is zero.
Example Let and . Then
At the outputs are and , so , and the formula gives . The zeros of are the zeros of the two factors, and .
Domain intersection
Definition The domain of , and is the intersection
the set of inputs that belong to both domains. It is read from the original formulas of and , before any simplification of the combined formula.
In plain words An input is allowed only when both functions accept it. On a number line, the domain is the part where the two domain sets overlap.
Example Let and , with domains and . Then
At the value exists, but is not a real number, so is undefined. Simplifying can hide this. With and the product is for , and that formula alone also works at . Yet is not real, so is not in the domain of .
Quotient
Definition The quotient is the function given by
for every in with . Its domain is therefore
In plain words Divide the outputs at each input. Both functions must be defined there, and the bottom one must not be zero.
Example Let and , both defined for all real numbers. The divisor is zero at and , so
At the quotient is , which is perfectly fine. The reversed quotient has a different domain, every real number except .
Nonzero divisor
Definition In the function is the divisor, and an input is allowed only when is defined and . The zeros of the divisor are removed from even when itself is defined there. A zero of the numerator causes no exclusion by itself. If it lies in and is not a zero of , it stays in the domain and is a zero of the quotient. If it is also a zero of , as is for , it is excluded like every other zero of the divisor.
In plain words Before you divide, find every input where the bottom function is zero and throw it out. A zero on top does no harm by itself.
Example Let and . The square root is defined at , but it equals there, so
The reversed quotient has domain . It keeps , where its value is . The same condition returns in calculus, where the quotient law for limits needs a denominator whose limit is not zero.
Graph of pointwise operations
Definition The operations above are pointwise, which means each one is carried out separately at each input. For in the common domain, the point of the graph of above is , so its height is the sum of the signed heights of the graphs of and above that same . The other operations work the same way. In particular exactly when , so the zeros of are the first coordinates of the points where the graphs of and meet.
In plain words Stand at one input, read both heights and combine them. A height below the -axis counts as negative.
Example Take and .
The difference is , with zeros and , and the graphs of and meet at and . At , where is zero, the graph of passes through the point of the graph of .
Restrictions survive cancellation
Definition The domain of a combination is fixed by the original functions before any algebra is done. If the formula of , , or simplifies, for example by cancelling a common factor or two opposite terms, the simplified formula agrees with the combination only on that domain. Inputs excluded at the start stay excluded, so the graph of the combination is the graph of the simplified formula with those inputs removed. A single excluded input where the simplified formula is defined shows up as a hole in the graph.
In plain words Simplifying changes how the formula looks, not which inputs are allowed. Write the restriction next to the simplified formula so it is not lost.
Example Let and . For
The graph is the line with a hole at . Cancelling terms works the same way. With and the difference is , but only for , since neither nor is defined at .
Check yourself
- Let and . Find the domains of , , and .
Show the answer
The domains are and , so and both have domain . The quotient also excludes the zero of , giving . The quotient excludes the zero of , giving .
- Suppose and . Find , and .
Show the answer
Combine the two outputs at the input . This gives , then , and .
- Let and . Simplify and describe its graph.
Show the answer
For
The value stays excluded because . The graph is the line with a hole at .