91Ó°ÊÓ

The Cartesian Product is a fundamental concept in mathematics that combines two sets. Given two sets, say \( A \) and \( B \), the Cartesian Product \( A \times B \) consists of all possible ordered pairs \((a, b)\) where \( a \in A \) and \( b \in B \).
In the context of complex numbers, we consider the Cartesian Product \( \mathbb{R} \times \mathbb{R} \). This represents all ordered pairs of real numbers. Essentially, each complex number \( a + bi \), where \( a \) and \( b \) are real numbers, corresponds to an ordered pair \((a, b)\).
This means the complex plane, typically depicted as a two-dimensional plane, reflects the structure of the Cartesian Product. Each horizontal point represents a real component, and each vertical point represents an imaginary component. Together, they spell out the world of complex numbers.

A bijective function is a special type of function that establishes a perfect "pairing" between elements of two sets. To be considered bijective, a function must be both injective and surjective.
When considering the relationship between complex numbers and the Cartesian Product \( \mathbb{R} \times \mathbb{R} \), we define a function \( f : \mathbb{C} \to \mathbb{R} \times \mathbb{R} \) such that \( f(a + bi) = (a, b) \).
This function \( f \) pairs each complex number \( a + bi \) uniquely with an ordered pair \((a, b)\), ensuring that no two different complex numbers map to the same ordered pair, and that every pair has at least one corresponding complex number. This is what makes the function bijective or an isomorphism between the two sets.

An injective function, also known as a one-to-one function, ensures that distinct inputs map to distinct outputs. For a function \( f \) to be injective, if \( f(x) = f(y) \), then \( x = y \).
In our example, the function \( f: \mathbb{C} \to \mathbb{R} \times \mathbb{R} \) is considered injective by definition, because if \( f(a + bi) = f(c + di) \), it implies \( (a, b) = (c, d) \).
This means \( a = c \) and \( b = d \), therefore \( a + bi = c + di \). There is no two distinct complex numbers that map to the same ordered pair. This uniqueness is a core characteristic of injective functions, preventing any overlap in mapping.

Surjective functions, also known as onto functions, ensure that for every element in the codomain, there is a pre-image in the domain. In simpler terms, a function is surjective if every possible output is covered.
For our Cartesian example, to prove surjectivity of \( f: \mathbb{C} \to \mathbb{R} \times \mathbb{R} \), consider any ordered pair \((a, b)\) in \( \mathbb{R} \times \mathbb{R} \). There exists a complex number \( a + bi \) such that \( f(a + bi) = (a, b) \).
Thus, every possible ordered pair has a corresponding complex number, showing that the function \( f \) covers the entire range of \( \mathbb{R} \times \mathbb{R} \). The surjective nature of \( f \) ensures this complete coverage, connecting the entire complex plane with every point in the ordered real pairs.