Scribd
Upload
88 views20 pages

Partially Ordered Class - 1

1. A function f from set A to set B is defined as a subset of A × B that satisfies two properties: for each x in A there exists a unique y in B such that (x,y) is in f. 2. Composition of functions is defined. If f: A → B and g: B → C, then g ∘ f is a function from A to C. 3. A function f: A → B is bijective if it is both injective (one-to-one) and surjective (onto). If a function is bijective, its inverse is also a function.

Uploaded by

shane naigal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
88 views20 pages

Partially Ordered Class - 1

1. A function f from set A to set B is defined as a subset of A × B that satisfies two properties: for each x in A there exists a unique y in B such that (x,y) is in f. 2. Composition of functions is defined. If f: A → B and g: B → C, then g ∘ f is a function from A to C. 3. A function f: A → B is bijective if it is both injective (one-to-one) and surjective (onto). If a function is bijective, its inverse is also a function.

Uploaded by

shane naigal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

MATH 34 (Set Theory)

MATH 34 (Set Theory)


Partially Ordered Class

B
y a partially ordered class wean a pair of objects hA, G i, where A is
a class and G is an order relation in A. We say that A is ordered
by G , or that G orders A. If A is a set, we say that hA, G i is a
partially ordered set.

Notes
If hA, G i be a partially ordered class, then
1 we will say loosely that A is a partially ordered class;
2 it is customary to write x ≤ y to denote the fact that
(x, y ) ∈ G ;
3 y ≥ x has the same meaning as x ≤ y .

MATH 34 (Set Theory)


Functions

Definition
A function f from A to B, where A and B are sets, is a subset of
A × B with the ff. properties.
(F1) ∀x ∈ A, ∃y ∈ B such that (x, y ) ∈ f .
(F2) If (x, y1 ) ∈ f and (x, y2 ) ∈ f , then y1 = y2 .

Notation:
f : A −→ B - denotes a function f from set A to set B

Let f : A → B be a function.
If (x, y ) ∈ f , we say that y is the image of x(with respect to f );
we also say that x is the pre-image of y (with respect to f ).

MATH 34 (Set Theory)


Theorem
Let A and B be sets. Then f : A → B is a function if and only if
1 F2 holds,
2 dom f = A, and
3 ran f ⊆ B.

Corollary
Let f : A → B be a function.
If C is any set such that ran f ⊆ C , then f : A → C is a function.

MATH 34 (Set Theory)


Let f : A → B be a function and let x ∈ A.
We use the symbol f (x) to designate the image of x.
Thus,

y = f (x) has the same meaning as (x, y ) ∈ f

When we write y = f (x) instead of (x, y ) ∈ f , conditions F1 and


F2 take the form
(F1) ∀x ∈ A, ∃y ∈ B, y = f (x).
(F2) If y1 = f (x) and y2 = f (x), then y1 = y2 .

Theorem
Let f : A −→ B and g : A −→ B be functions.
Then f = g if and only if f (x) = g (x), ∀x ∈ A.

MATH 34 (Set Theory)


Injective Function

Definition
A function f : A −→ B is said to be injective (or one-to-one) if
it has the ff. property.

If (x1 , y ), (x2 , y ) ∈ f , then x1 = x2 .

That is, if y ∈ B, then y has no more than one pre-image.

Equivalently,

If f (x1 ) = f (x2 ), then x1 = x2 .

MATH 34 (Set Theory)


Surjective

Definition
A function f : A −→ B is said to be surjective(or onto) if it has
the ff. property:

∀y ∈ B, ∃x ∈ A 3 y = f (x).

In other words,

f : A −→ B is surjective if and only if ran f = B.

MATH 34 (Set Theory)


Definition
A function is said to be bijective if it is both injective and
surjective.

Note: To say that f : A → B is injective is to say that every


element of B is the image of no more than one element of A; to say
that f is surjective is to say that every element of B is the image of
at least one element of A; thus, to say that f is bijective is to say
that every element of B is the image of exactly one element of A.
Definition
If there exists a bijective function f : A → B, then we say that A
and B are in one-to-one correspondence.

MATH 34 (Set Theory)


Examples of Functions

Identity Function
Let A be a set. The identity function on A is the function
IA : A → A given by

IA (x) = x, ∀x ∈ A.

That is,
IA = {(x, x)|x ∈ A}.

Clearly, IA is bijective.

MATH 34 (Set Theory)


Examples of Functions

Constant Function
Let A and B be sets, and let b be an element of B. The constant
function Kb is the function Kb : A → B given by

Kb (x) = b, ∀x ∈ A.

That is,
Kb = {(x, b)|x ∈ A}.

If A has more than one element, Kb is not injective; if B has more


than one element, Kb is not surjective.

MATH 34 (Set Theory)


Inclusion Function
Let A be a set and let B ⊆ A. The inclusion function of B in A is
the function EB : B → A given by

EB (x) = x, ∀x ∈ B.

Note: If B = A, the inclusion function coincides with the identity


function IA . However, if B 6= A, then EB is not surjective.

MATH 34 (Set Theory)


Characteristic Function
Let 2 be a set of two elements, say the set {0, 1}. If A is a set and
B ⊆ A, the characteristic function of B in A is the function
CB : A → 2 given by
CB (x) =

CB maps every element of B onto 0 and every element of A \ B


onto 1.

MATH 34 (Set Theory)


Restriction of a function
Let f : A −→ B be a function and let C be a subclass of A. The
restriction of f to C is the function f[C ] : C −→ B is given by

f[C ] (x) = f (x) ∀x ∈ C .

That is,
f[C ] = {(x, y )|(x, y ) ∈ fandx ∈ C }

Note: f[C ] ⊆ f .

MATH 34 (Set Theory)


Theorem
S S
If f : B C → A is a function, then f = f[B] f[C ] .

Theorem
T
Let f1 :SB → A and f2 : C → A be functions, where B C = ∅. If
f = f1 f2 , then the ff. hold:
S
i) f : B C → A is a function.
ii) f1 = f[B] and f2 = f[C ] ,
iii) If x ∈ B then f (x) = f1 (x), and if x ∈ C then
f (x) = f2 (x).

MATH 34 (Set Theory)


1 Prove that if f : A → B is an injective function and C ⊆ A,
then f[C ] : C → B is an injective function.
2 Let A be a set and let f = {(x, (x, x))|x ∈ A}. Show that f is
a bijective function from A to IA .
3 Let f : A → B and let g : A → B be functions. Prove that if
f ⊆ g then f = g .

Tf1 : A → B and
Let T f2 : C → D be bijective
S functions, where
4

A CS= ∅ and S B D = ∅. Let f = f1 f2 ; prove that


f : A C → B D.

MATH 34 (Set Theory)


Theorem
If f : A → B and g : B → C are functions, then g ◦ f : A → C is a
function.

Definition
A function f : A → B is said to be invertible if f −1 : B → A is a
bijective function.

Note: Let f : A → B be an invertible function.


1 (x, y ) ∈ f if and only if (y , x) ∈ f −1 .
2 y = f (x) if and only if x = f −1 (y ).

MATH 34 (Set Theory)


Theorem
If f : A → B is a bijective function, then if f −1 : B → A is a
bijective function.

Theorem
If f : A → B is invertible, then if f : A → is bijective.

Theorem
Let f : A → B be an invertible function. Then
1 f −1 ◦ f = IA
2 f ◦ f −1 = IB

MATH 34 (Set Theory)


Theorem
Let f : A → B is invertible and g : B → A be functions. If
g ◦ f = IA and f ◦ g = IB , then f : A → B is bijective (hence
invertible), and g = f −1 .

Theorem
Let f : A → B be function. f : A → B is injective if and only if
there exists a function g : B → A such that g ◦ f = IA . (hence
invertible), and g = f −1 .

MATH 34 (Set Theory)


Theorem
Suppose f : A → B, g : B → C , and g ◦ f : A → C are functions.
Then
1 If f and f are injective, then g ◦ f is injective.
2 If f and f are surjective, then g ◦ f is surjective.
3 If f and f are bijective, then g ◦ f is bijective.

MATH 34 (Set Theory)


Definition
Let f : A → B be a function. If C is any subclass of A, the direct
image of C under f , which we write f (C ), is the following
subclass of B:

f (C ) = {y ∈ B|∃x ∈ C 3 y = f (x)}.

That is, f (C ) is the class of all the images of elements in C .

Definition
Let f : A → B be a function. If D is any subclass of B, the
inverse image of D under f , which we write f (D), is the following
subclass of A:
f (D) = {x ∈ A|f (x) ∈ D}.
That is, f (D) is the class of all the pre-images of elements in D.

MATH 34 (Set Theory)

You might also like