How to Show That the Mapping from Complex Numbers to a Matrix is Bijective

[Ubernisation]

Homework Statement

C=
a -b
b a
and p is the mapping Complex numbers --> C by the rule p(a+ib)=
a -b
b a
Show that p is a bijection

Homework Equations

The Attempt at a Solution

Well I need to prove it is both injective and surjective. For Injectivity I have tried showing that the determinate=0, but all I got was detA=a^2 + b^2 and for surjectivity. I also know that any non square matrix cannot be bijective, so attempted to involve this in the answer, but I don't think this is the right thing to be doing.

I have no idea what to do. I have not tackled questions similar to this before, so don't really have any idea what path I should be following.

Any help hugely welcome.

 

[Mark44]

Your problem description is confusing. Are you saying that p maps a complex number to a 2 x 2 matrix? In any case, this is a square matrix, so don't waste your time talking about nonsquare matrices.

To show that the mapping is injective (which if I recall is a synonym for one-to-one), the determinant can't be zero. You want to show that distinct complex numbers map to distinct matrices. I.e., if a₁ + b₁i \neq a₂ + b₂i, then p(a₁ + b₁i) \neq p(a₂ + b₂i). Equivalently, if p(a₁ + b₁i) = p(a₂ + b₂i), then a₁ + b₁i = a₂ + b₂i.

To show that the mapping is surjective (onto), show that for any 2 x 2 matrix of the form in this problem, there is a complex number a + bi such that p(a + bi) = that matrix.

 

[HallsofIvy]

Also, as to your title "proving a matrix is bijective", you don't want to prove anything about "bijective matrices". I think that mislead Marl44. A matrix represents a linear transformation and the linear transformation represented by a square matrix is bijective if and only if the determinant of the matrix is non-zero. There is no such condition on the determinants of the matrices here. For example, what matrix is the complex number 0 mapped to by this mapping? What is the determinant of that matrix?

What you want to prove is that the mapping
a+ bi \rightarrow \begin{bmatrix}a & -b \\ b & a\end{bmatrix}
is a bijective mapping from C, the set of complex numbers, to the set of two by two anti-symmetric matrices is bijective.

To prove it is "injective" (one-to-one) You need to prove that if a+ bi and c+ di are mapped to the same matrix, then a+ bi= c+ di. That should be easy. To prove it is surjective, you need to show that some a+ bi is mapped into any matrix of the form
\begin{bmatrix}x &amp; -y \\ y &amp; x\end{bmatrix}[/itex]<br /> and you can do that by showing what a and b must equal to give that.