Here are a bunch of symbols that you'll probably see during lecture (and if you're a math major, for the rest of your life).
Definition
R= the set of real numbers =(−∞,∞)
∈= "is in" or "is an element of"
∃= "there exists"
∀= "for all" or "for any" or "for every"
⟹= "implies"
Example 1.
∃ water ∈ my fridge
∀ student ∈ MATH 31B, the student is an undergraduate
you are here ⟹ you ∈ MATH 31B
you are here ⟹ you are awake
Set Notation
You're probably familiar with intervals to specify sets (e.g., (a,b), [a,b], etc.). While these are useful, some sets may be hard or tedious to write as intervals, so we're going to introduce a new, more general way to specify sets.
Example 2.
{x∈R∣x=0}=(−∞,0)∪(0,∞)=R∖{0}
Example 3.
The domain of f(x)=tanx is {x∈R∣x=2π+πn,n is an integer}.
Exercise 1.
Write {x∈R∣a<x and x≤b} as an interval.
Exercise 2.
Write the domain of f(x)=cotx using this notation.
Functions
A function f always comains with a domain D, and the range of f is determined by D. If the domain isn't specified, then it's usually taken to be the largest set where f is defined.
Example 4.
If f(x)=x1 and D is not specified, then we assume D={x∈R∣x=0}.
Example 5.
Let f(x)=x2.
D=R⟹R=[0,∞)
D=[0,∞)⟹R=[0,∞)
D={x∈R∣x>2}⟹R=(4,∞)
Inverses
What is an Inverse?
Given a function f, we'd like to know if we can go "backwards" from f. This is useful if you need to solve something like f(x)=y; if we can "undo" f, then we automatically have the solution to the equation. This can be done if f is invertible:
Definition
Let f have domain D and range R. If ∃g with domain R and range D such that
f(g(x))=x∀x∈R and
g(f(x))=x∀x∈D,
then we say f is invertible and we call f−1=g the inverse of f.
When is there an Inverse?
So when does f have an inverse? Let's look at a situation where f does not have one.
f doesn't have an inverse here because we can't go backwards from y to get both a and b. Indeed, any function g with domain R will map y to either a or b, but not both. The problem is that f maps two different elements to the same thing, so if we prevent this, f will have an inverse.
To prevent this, we need f to map two different elements to two different things. More succinctly, a=b⟹f(a)=f(b). If f satisfies this, then we call f one-to-one, but this isn't the only way to tell if f is one-to-one:
Definition (one-to-one)
Let f have domain D, and suppose one of the following is true about f:
a=b⟹f(a)=f(b)∀a,b∈D or
f(x)=y has exactly one solution ∀y∈R or
f(a)=f(b)⟹a=b∀a,b∈D or
f passes the horizontal line test.
Then we say f is one-to-one or injective.
Notice that the domain is very important when determining whether f is one-to-one or not.
Example 6.
Let f(x)=x2.
If D=R, then fis not one-to-one.
f(x)=1 has two solutions: −1 and 1.
If D=[0,∞), then fis one-to-one.
Since f is one-to-one, it has an inverse, which is f−1(x)=x.