Skip to content
Hub Nexus

Linear Algebra, Complex Representations

No author yetClaim it

Version 1Updated 2 min read

Support

Recall the definitions of the complex number addition

( a + b i ) \ + \ ( c + d i ) = ( a + c ) + ( b + d ) i

and multiplication.

\begin{matrix}( a + b i ) ( c + d i ) & = a c + a d i + b c i + b d ( − 1 ) \\ & = ( a c − b d ) + ( a d + b c ) i\end{matrix}

Example 2.1

For instance, ( 1 − 2 i ) \ + \ ( 5 + 4 i ) = 6 + 2 i and ( 2 − 3 i ) ( 4 − 0.5 i ) = 6.5 − 13 i.

Handling scalar operations with those rules, all of
the operations that we've covered
for real vector spaces carry over unchanged.

Example 2.2

Matrix multiplication is the same, although the scalar arithmetic involves more
bookkeeping.

( \begin{matrix}1 + 1 i & 2 − 0 i \\ i & − 2 + 3 i\end{matrix} ) ( \begin{matrix}1 + 0 i & 1 − 0 i \\ 3 i & − i\end{matrix} )

\begin{matrix} & = ( \begin{matrix}( 1 + 1 i ) ⋅ ( 1 + 0 i ) + ( 2 − 0 i ) ⋅ ( 3 i ) & ( 1 + 1 i ) ⋅ ( 1 − 0 i ) + ( 2 − 0 i ) ⋅ ( − i ) \\ ( i ) ⋅ ( 1 + 0 i ) + ( − 2 + 3 i ) ⋅ ( 3 i ) & ( i ) ⋅ ( 1 − 0 i ) + ( − 2 + 3 i ) ⋅ ( − i )\end{matrix} ) \\ & = ( \begin{matrix}1 + 7 i & 1 − 1 i \\ − 9 − 5 i & 3 + 3 i\end{matrix} )\end{matrix}

Everything else from prior chapters that we can,
we shall also carry over unchanged.
For instance, we shall call the ordered set of vectors

⟨ ( \begin{matrix}1 + 0 i \\ 0 + 0 i \\ ⋮ \\ 0 + 0 i\end{matrix} ) , ( \begin{matrix}0 + 0 i \\ 1 + 0 i \\ ⋮ \\ 0 + 0 i\end{matrix} ) , … , ( \begin{matrix}0 + 0 i \\ 0 + 0 i \\ ⋮ \\ 1 + 0 i\end{matrix} ) ⟩

the standard basis for {ℂ}^{n} as a vector
space over ℂ and again denote it
{ℰ}_{n}.

Where this page came from

This page was imported from Wikibooks. From “Linear Algebra” on Wikibooks, by its contributors, under CC BY-SA 4.0. Changed here: set as a page; navigation and edit links left out; each image under its own licence, credited in its caption.

Nobody has written it yet — it is the source material at a new address, which is why search engines are asked to skip it and why no one earns from it. It is up for grabs: take it on, and it is yours to rewrite and to earn from.

Comments

Spinner Logo

Read next

Next in Linear Algebra

Linear Algebra, Definition and Examples of Similarity
CC BY-SA 4.0
In matrix terms, ${R e p}_{D , D} ( t ) = {R e p}_{B , D} ( \text{id} ) \ {R e p}_{B , B} ( t ) \ ( {R e p}_{B , D} ( \text{id} ) {)}^{− 1}$ (recall that a representation of composition like this one reads right to left). Definition 1.1 The matrices T and S are **similar** if there is a nonsingular
Linear Algebra, Diagonalizability
CC BY-SA 4.0
The prior subsection defines the relation of similarity and shows that, although similar matrices are necessarily matrix equivalent, the converse does not hold. Some matrix-equivalence classes break into two or more similarity classes (the nonsingular $n \ × \ n$ matrices, for instance). This means
Linear Algebra, Eigenvalues and Eigenvectors
CC BY-SA 4.0
In this subsection we will focus on the property of [Corollary 2.4]( Definition 3.1 A transformation $t : V → V$ has a scalar **eigenvalue** $λ$ if there is a nonzero **eigenvector** $\overset{→}{ζ} ∈ V$ such that $t ( \overset{→}{ζ} ) = λ ⋅ \overset{→}{ζ}$. ("Eigen" is German for "characteristic of
Linear Algebra, Self-Composition
CC BY-SA 4.0
This subsection is optional, although it is necessary for later material in this section and in the next one. A linear transformations $t : V → V$, because it has the same domain and codomain, can be iterated.[1] That is, compositions of t with itself such as ${t}^{2} = t ∘ t$ and ${t}^{3} = t ∘ t ∘
Linear Algebra, Strings
CC BY-SA 4.0
This subsection is optional, and requires material from the optional Direct Sum subsection. The prior subsection shows that as j increases, the dimensions of the $ℛ ( {t}^{j} )$'s fall while the dimensions of the $𝒩 ( {t}^{j} )$'s rise, in such a way that this rank and nullity split the dimension o
Linear Algebra, Jordan Form
CC BY-SA 4.0
This section uses material from three optional subsections: Direct Sum, Determinants Exist, and Other Formulas for the Determinant. The chapter on linear maps shows that every $h : V → W$ can be represented by a partial-identity matrix with respect to some bases $B ⊂ V$ and $D ⊂ W$. This chapter rev