Group Theory and Linear Algebra

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au

Last updated: 17 September 2014

Lecture 4: Functions

Functions are for comparing sets.

Let S and T be sets. A function from S to T is a subset f of S×T, f={(s,f(s)) | s∈S}, such that

(a) If s∈S then there exists t∈T such that (s,t)∈f.
(b) If s∈S, and t1,t2∈T and (s,t1),(s,t2)∈f then t1=t2.
The function f is an assignment assigning a mark f(s) from T to each s∈S. Write f:S⟶T s⟼f(s) or S⟶fT.

A function f:S→T is injective if it satisfies: if s1,s2∈S and f(s1)=f(s2) then s1=s2.

A function f:S→T is surjective if it satisfies: if t∈T then there exists s∈S such that f(s)=t.

A function f:S→T is bijective if it is injective and surjective.

Let f:S→T and g:S→T be funtions. The functions f and g are equal if they satisfy if s∈S then f(s)=g(s).

Let f:S→T and g:T→U be functions. The composition of g and f is the function g∘f:S⟶Tgiven by (g∘f)(s)=g (f(s)).

Let S be a set. The identity function on S is the function idS:S⟶Sgiven by idS(s)=s.

Let f:S→T be a function. An inverse function to f:S→T is a function g:T→S such that g∘f=idSand f∘g=idT.

Let f:S→T be a function.

(a) An inverse function to f exists if and only if f is bijective.
(b) If an inverse function to f exists then it is unique.

Proof.

Assume f:S→T is a function.

(a)
To show: An inverse function to f exists if and only if f is bijective.
⇒ Assume that an inverse function to f exists: g:T→S such that g∘f=idS and f∘g=idT.
To show: f is bijective.
To show:
(1) f is injective.
(2) f is surjective.
(1)
To show: If s1,s2∈S and f(s1)=f(s2) then s1=s2.
Assume s1,s2∈S and f(s1)=f(s2).
To show: s1=s2.
s1 = idS(s1)= (g∘f)(s1) =g(f(s1)) = g(f(s2))= (g∘f)(s2) =idS(s2)=s2.
(2)
To show: If t∈T then there exists s∈S such that f(s)=t.
Assume t∈T.
To show: There exists s∈S such that f(s)=t.
Let s=g(t).
To show: f(s)=t.
f(s)= f(g(t))= (f∘g)(t)= idT(t)=t.
So f is bijective.
⇐
To show: If f:S→T is bijective then an inverse function g:T→S exists.
Assume f:S→T is bijective.
To show: There exists g:T→S such that g∘f=idSand f∘g=idT.
Let g:T→S be given by g={(t,s)∈T×S | f(s)=t}.
To show:
(a) g is a function.
(b) g∘f=idS.
(c) f∘g=idT.
(a)
To show:
(aa) If t∈T then there exists s∈S such that (t,s)∈g.
(ab) If t∈T and s1,s2∈S and (t,s1)∈g and (t,s2)∈g then s1=s2.
(aa)
Assume t∈T.
To show: There exists s∈S such that (t,s)∈g.
To show: There exists s∈S such that f(s)=t.
This holds since f is surjective.
(ab)
Assume t∈T, s1,s2∈S and (t,s1),(t,s2)∈g.
To show: s1=s2.
Since (t,s1),(t,s2)∈g, then f(s1)=t and f(s2)=t.
Since f is injective, s1=s2.
(b)
To show: g∘f=idS.
To show: If s∈S then (g∘f)(s)=idS(s).
Assume s∈S.
To show: (g∘f)(s)=idS(s).
(g∘f)(s)=g(f(s))=s1, where s1∈S such that f(s1)=f(s).
Since f is injective, s1=s.
So (g∘f)(s)=s=idS(s).
(c)
To show: (f∘g)=idT.
To show: If t∈T then (f∘g)(t)=idT(t).
Assume t∈T.
To show: (f∘g)(t)=idT(t).
(f∘g)(t)=f(g(t))=f(s), where s∈S such that f(s)=t.
So (f∘g)(t)=f(s)=t=idT(t).
So g is an inverse function to f.
(b)
To show: The inverse function to f:S→T is unique.
Assume g1:T→S and g2:T→S are inverse functions to f.
To show: g1=g2.
To show: If t∈T then g1(t)=g2(t).
We know that (f∘g1)=idT, (g1∘f)=idS, (f∘g2)=idT, (g2∘f)=idS. Assume t∈T.
To show: g1(t)=g2(t).
g1(t) = g1(idT(t))= g1((f∘g2)(t))= g1(f(g2(t))) = (g1∘f)(g2(t))= idS(g2(t))= g2(t). So g1=g2.
So the inverse function to f:S→T is unique.

□

Notes and References

These are a typed copy of Lecture 4 from a series of handwritten lecture notes for the class Group Theory and Linear Algebra given on August 1, 2011.

page history