Complex Numbers in Linear Algebra

cowmoo32
Messages
121
Reaction score
0
I'm working my way through Shaum's Outline on linear algebra and in it they define a complex number as an ordered pair of real numbers (a,b). So given a real number a, its complex counterpart would be (a,0). Operations of addition and multiplication of real numbers work under the correspondence:

(a,0) + (b,0) = (a + b,0)
(a,0)*(b,0) = (ab,0)

I can follow that, but I'm confused how they define i. I know i=(-1)1/2. They define it as:

i2 = ii = (0,1)(0,1) = (-1,0) = -1

So am I to assume that any complex number written as (0,b) = -b?
 
Physics news on Phys.org
The complex number (a,b) would be written a+bi. I think you might be getting confused because they defined i as i2 = -1, so, as you wrote, i = -11/2
 
The next step after defining i is writing a complex number z = a + bi. I'm just a little confused as to their definition of i.

Here is the first definition of complex numbers, verbatim:
The set of complex numbers is denoted by C. Formally, a complex number is an ordered pair (a,b) of real numbers.

We identify the real number a with the complex number (a,0); that is,

a<-->(a,0)

Thus, we view R as a subset of C, and replace (a,0) by a whenever convenient and possible

The complex number (0,1) is denoted by i. It has the important property that...
and then they go on to define i in the manner I posted above. After that,

Accordingly, any complex number z = (a,b) can be written in the form

z = (a,b) = (a,0) + (0,b) = (a,0) + (b,0)*(0,1) = a + bi

Ok, so as I typed that I see that (0,1) is simply i.
 
The one thing you did NOT say was how to multiply two such pairs- you only say "Operations of addition and multiplication of real numbers work under the correspondence:

(a,0) + (b,0) = (a + b,0)
(a,0)*(b,0) = (ab,0) "

The definition of the sum and product of two general such pairs is
(a, b)+ (c, d)= (a+ c, b+ d) ("component wise" addition)
(a, b)* (c, d)= (ac- bd, ad+ bd) (which is definitely not "component wise")

Your text should also show that all the usual "rules of arithmetic" ( addition and multiplication are associative and commutative and multiplication distributes over addition. There are additive and multiplicative identies, every pair has an additive inverse, and every pair except (0, 0) has a multplicative inverse).

From that definition of multplication (0, 1)*(0, 1)= (0*0- 1*1, 0*1+ 1*0)= (-1, 0). Since we are interpreting the pair (-1,0) to be the number "-1", that says that (0,1)*(0,1)= (0, 1)2= -1 and so (0, 1) is i. Given that we can then say that (a, b)= (a, 0)+ (0, b)= a(1, 0)+ b(0, 1)= a+ bi.

By the way, here we are defining i to be (0, 1), and then showing that i2= -1, not showing that (0, 1)= (-1)1/2. There are technical problems with "defining" i by "i=(-1)1/2". Every complex number, like every real number, has two square roots. Which of the two roots of -1 is "i"? The real numbers form an "ordered field" so we can distinguish between positive and negative square roots of numbers but the field of complex numbers is NOT an ordered field so it is impossible, a priori, to distinguish between the two roots of -1. Defining i to be the pair (0, 1) avoids that problem. (The other root of -1 is, of course, (0, -1)= -(0, 1)= -i. But to be able to call it "-i" we must be able to first distinguish that root from "i" itself.)
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top