# An introduction to F-notation

Many many years ago, human beings (We) invented counting. Since, then the concept related to counting is probably the most greatest discovery in the initial phase of mathematics. We know more about the number systems like real numbers , rational numbers , natural numbers , and so on. And also, we divided the number systems into two category on the basis of counting i.e. Countable sets and Uncountable sets. This concept advances “Set Theory” which was first proposed by George Cantor and followed by Richard Dedekind and many more.

In this post, I want to introduce a new type of notation which I named it as F-notation. You will know at last, why I need to introduce this, how the name came in my mind, and how it will help to prove one of the well-known theorem of Number theory.

So, the strategy goes like this: first, I will create the necessary ingredients for the given statement “The set is countably infinite”. This means the cartesian product of natural numbers is countably infinite, and countably infinite means you can able to find or count a natural number even at infinity. At the middle of the procedure, I will introduce F-notation. Let’s get started!

**Theorem. ***The set is countably infinite.*

*Proof. We know, *. So the cartesian graph looks like above figure [Caption: Cantor pairing function assigns one natural number to each pair of natural numbers]. I want to introduce two definitions.

**Definition 1. **The ordered pair can be written as where a is the first entry which lies on x co-ordinate and b is the second entry which lies on y co-ordinate. And, will give the solution as (i.e. ) such that and are greater than zero, and also not equal to zero.

First, we will pick out the diagonal’s points (i.e. ordered pairs) from the above figure. From the definition 1, we can write

where, the first diagonal () is a point, second () is a line and so on.

So, the pattern would be

.

Thus, we can write

.

This means,

when n =1 (first diagonal), gives ,

when n = 2 (second diagonal), gives and ,

when n = 3 (third diagonal), gives , and and so on.

This means you can generate the same as given by definition 1.

**Definition 2. ***Let us define a notation named as functional notation (i.e. F-notation) and given by . It states that, when different operation has same solution then, F-notation is .*

Since, satisfy the definition 2. So, . Now, it’s very easy to test whether this function gives countably infinite or not, by proving whether it is bijective or not.

**Test 1. ** Let,

.

Hence, the function is one to one.

**Test 2. **Let,

Therefore, the inverse function is .

Since, and .

Thus, i.e. .

The inverse of the given function where satisfy the domain elements. But as far we know, as . This means, range is equal to co-domain. Hence, the function is onto.

This means is bijective in nature.

Finally, we proved our statement using the new notation named F-notation. Let me know in the comment or via email if you can apply this notation to solve any problems. For the pdf version of this post, download it.

**Feedback?**

If you guys have some questions, comments, or insults then, please don’t hesitate to shot me an email or comment below.

**Want to share this post?**