91Ó°ÊÓ

One-to-one, also known as injective, is a property of functions where each element of the domain is mapped to a unique element in the codomain. Think of it as a special kind of function where no two different inputs produce the same output. For example, if you have a set of keys and each key opens exactly one specific lock, that's like an injective function.

Consider the function \( f(x) = x + 1 \) for natural numbers \( \mathbb{N} \). If \( a eq b \), then \( f(a) = a + 1 \) will not equal \( f(b) = b + 1 \). However, this function is not onto when mapping from \( \mathbb{N} \) to \( \mathbb{N} \) since there's no value \( x \) such that the output is \( 0 \). \( f(x) = x + 1 \) is a classic example of a one-to-one but not onto function.

A function is onto, or surjective, if every element in the codomain is an image of at least one element from the domain.

Imagine each student in a class receiving a unique certificate with their name on it – each certificate must be accounted for by a student; nothing is left unmatched.

Let's take the function \( g(x) = x \bmod 2 \) mapping natural numbers onto the set \{0, 1\}. Every element (0 and 1) in the codomain has a pre-image, as even numbers map to 0 and odd numbers map to 1. This makes the function onto. However, it is not one-to-one because multiple natural numbers (like 2 and 4) map to the same element in the codomain (0).

The identity function, denoted as \( i(x) = x \), is a simple yet powerful function where each element of the domain maps directly to itself. Imagine every person is given a name tag with their own name – that's what an identity function does. There’s no guesswork; everything remains as it is.

For the natural numbers \( \mathbb{N} \), the identity function is both one-to-one and onto. Each number maps uniquely to itself (one-to-one) and every number in the codomain \( \mathbb{N} \) is covered (onto). This perfection makes \( i(x) = x \) an example of a bijective function, combining the traits of being both injective and surjective.

Natural numbers are a simple yet fundamental concept in mathematics, often denoted by the symbol \( \mathbb{N} \). These numbers start from 0 or 1 and go upwards extending infinitely. Think of them as the counting numbers you first learn in school: 0, 1, 2, 3, and so on.

In the context of functions, when we say a function maps from \( \mathbb{N} \) to \( \mathbb{N} \), we are talking about how one set of natural numbers transforms into another through some rule or operation.

• Without zero: 1, 2, 3, 4,…
• Including zero: 0, 1, 2, 3,…

Natural numbers provide the basis for defining complex functions that work on these endless sequences of numbers, such as the identity function \( i(x) = x \) or transformations like \( f(x) = x + 1 \). They capture both the simplicity of counting and the complexity of infinite sets.