functions and their inverses: 2 insightful examples.

Math is often considered hard. But, that is not true. Math is about logic. Following what you know to reach an understanding of what you don't. That we can do naturally. Our brains are wired to think.

The diagnosis in my opinion to most of the problems with math is.

• lack of foundation.

• unwillingness to give the required mental effort.

In this series of posts, I'll try to dive a little deeper in what looks simple, But, is very foundational. In a easy to digest #mathpills, I'll discuss fundamentals in quick pieces of elementary mathematics.

Like a logic puzzle. starting from the fundamentals you can build your way up to a very advanced an complicated structures.

So lets start with one of the most fundamental building blocks of math. functions.

basic definitions.

Let's define the function $f: A \to B$ .

from these definitions we can find that:

1. any element $a \in A$ its image $f(a)$ must belong to $B$

2. $$f(A) = \lbrace f(a) \mid a \in A \rbrace$$

Let $g: B \to A$ be a function that does the inverse of what $f$ does then:

two examples.

First Example: suppose that $X \subseteq A$ . does $f^{-1}(f(X)) = X$ .

To prove that these two sets are equal we must do that in two steps.

• first, is $X \subseteq f^{-1}(f(X))$ ?

Suppose that $a \in X$ , then from the above definition $f(a) \in f(X)$ , then

Easy, isn't it. Just following simple definitions we were able to prove the first part, but the second will need extra assumptions to work.

• is $f^{-1}(f(x)) \subseteq X$ ?

Suppose that $a \in f^{-1}(f(X))$ then $a \in \lbrace x \in X \mid f(x) \in F(X) \rbrace$ , which means that $f(a) \in F(X) = \lbrace f(x) \mid x \in X \rbrace$ , then there exists $x \in X$ such that $f(x) = f(a)$ .

If we can prove that $a = x$ , then $x \in X$ . which prove the second part.

This is easy if $f$ is a one-to-one function.

A function is one-to-one if $\forall a \in A \forall b \in A \quad f(a) = f(b) \rightarrow a = b$ . which read, for all elements, if two elements have the same image, then they must be tha same.

Second Example: suppose that $Y \subseteq B$ . does $f(f^{-1}(Y)) = Y$ .

Following the same procedure as the previous example.

• first, is $f(f^{-1}(Y)) \subseteq Y$ ?

Suppose that $a \in f(f^{-1}(Y))$ , there exists $x in f^{-1}(Y) = \lbrace x \in A \mid f(x) \in Y \rbrace$ such that $a = f(x)$ , then $a \in Y$ .

For the second part, we are going to follow the logic as always, from what we know (the definitions) to what we don't (the results).

• is $Y \subseteq f(f^{-1}(Y))$ ?

First, suppose that $a \in Y$ , then, can we choose an $x \in A$ such that $f(x) = a$ ? yes, if and only if the function is onto.

a function is onto if $f(A) = B$ .

In other words all the elemens in $B$ are an image of some element in $A$ .

With that property we can guarantee that our chosen element $a$ is a reverse image of some element, $x = f^{-1}(a) \in f^{-1}(Y)$ .

After that, we find $a = f(x) \in f(f^{-1}(Y))$ . Finishing our proof.

That, finishes this pill. I hope you enjoyed it. If you have any questions leave them in the comments.

Thank you for reading 😄.