Term
|
Definition
| Let X and Y be sets. A function, ƒ, from X to Y is denoted by ƒ :X -> Y, and is a rule that assignas x € X to a unique element ƒ(x) € Y. |
|
|
Term
| Definition of a Bijective Function. |
|
Definition
| A function is bijective if ƒ is both injective and surjective. |
|
|
Term
| Definition of an Injective Funciton |
|
Definition
A function, ƒ, is injective (or one to one) if ƒ(x1) = ƒ(x2) implies that x1 = x2 . The elements in the domain (X) must have distinct images.
|
|
|
Term
| Definition of a Surjective Function |
|
Definition
| A function, ƒ : X -> Y is surjective whenever ƒ(x) = Y. (Where the image is the whole domain.) |
|
|
Term
| Define the composition of two functions |
|
Definition
|
|
Term
| Show that the composition of injective functions in injective |
|
Definition
|
|
Term
| Show that the composition of surjective functions is surjective |
|
Definition
|
|
Term
| Show that a function f : X -> Y is bijective if and only if it has an inverse |
|
Definition
|
|
Term
| Define a permutation of a set X |
|
Definition
|
|
Term
| What is hogof? (See page) |
|
Definition
|
|
