Associates at least one element of the domain with each element of the codomain.

Each object in the domain has to be associated with exactly one object in the codomain.

Bijective: a function that is both injective and surjective

If each element of the codomain has at most one element of the domain associated with it.

The composition of f and g is the function (g o f )(x) = g(f(x)).

Associative

Number of elements it contains. Two sets have same cardinality iff there is a bijection f: S->T. So, prove surjective and injective.

Equality of cardinality is an equivalence relation. (For any sets R, S, T, we have reflexivity, symmetry, transitivity).

Have a fullscreen mode

CHROME works SO MUCH BETTER

Right click note to change color

Symbols - for jeditable, right before showing the text, process the string and replace w actual symbols and not html code

A$("#topDiv").hide();$("#leftDiv").hide();

Write as peicewise function