Types of Functions

Today, we're starting with functions! Can anyone tell me what a function really is?

Is it like a relation?

Yes, exactly! A function is a special type of relation where each input from one set corresponds to exactly one output in another set. We can represent this using the notation f: A → B.

What does A and B represent?

Good question! A is called the domain, and B is the co-domain. The domain is where our inputs come from, and the co-domain is where our outputs go.

So if I have a function f: {1, 2, 3} → {a, b, c}, are you saying each number must go to one letter?

Absolutely! Each input can map to one output, like f(1) = a, f(2) = b, and f(3) = c. Keep this in mind as we dive deeper!

Let’s start with the first type: One-to-One or injective functions. Remember this as a fun fact—each input must map uniquely!

Now that we understand what a function is, let’s talk about one-to-one functions. Can anyone explain what an injective function is?

Is it where different inputs give different outputs?

Exactly! Different inputs in the domain should not map to the same output in the co-domain. For instance, if we have f: {1, 2, 3} → {a, b, c}, and let's say f(1) = a, f(2) = a, then it's not injective!

So one-to-one means unique mapping!

Great summary! When you think of one-to-one functions, remember the phrase 'Unique Inputs, Unique Outputs.' Now, let’s review some examples to clarify our understanding.

Moving on, let’s discuss onto functions, also known as surjective functions. Can anyone share what they know about this type of function?

It’s when every output in the co-domain is achieved at least once?

Exactly! Each element in the co-domain must have a corresponding element from the domain. For instance, if we have f: {1, 2, 3} → {a, b}, and if both f(1) and f(2) map to a but there's no mapping to b, it’s not onto.

So, if we have f(1) = a, f(3) = b, then it's onto because every output is covered?

Spot on! Remember, for onto functions, think 'All Outputs Count!' Now let’s see some examples.

Finally, we arrive at bijective functions. What do we think this means?

Is it both one-to-one and onto?

Exactly! A bijection pairs every element uniquely from the domain to the co-domain and covers every output. We can say it’s a 'Perfect Match!' For example, if f: {1, 2, 3} → {a, b, c} and f(1) = a, f(2) = b, and f(3) = c, it’s bijective.

So bijective means there's no unused output and no repeated input?

Correct! Now, let's summarize the key points. Remember: One-to-One means unique mapping of inputs, Onto ensures all outputs are covered, and Bijective is the perfect match!