6 Linear Algebra


Authors

Last Updated

11/15/2022

5.1 Algebraic Structures

abstract algebra We’ll get to linear algebra in a minute. First, it’s worthwhile to emphasize what algebra actually is. Here, we’re not talking about the elementary algebra you learned in school, which is about manipulating variables (read: arithmetic with letters). We’re talking about the abstract algebra of modern mathematics, which is about studying algebraic structures.

algebraic structure

An algebraic structure consists of three things: sets of elements, operations over those sets, and the axioms those operations satisfy. Though mathematicians have developed whole zoos of exotic algebraic structures, we’re interested in simpler structures that often involve only a single set of elements and only binary operations.

group

For example, a group, is a set, GG, equipped with a binary operation, (): G×GG(\cdot):~G \times G \to G, that satisfies the following four properties:

abelian group An abelian group is a group whose elements are also commutative:

a, bA:ab=ba.(5.1)\t{5.1}{\forall a,\ b \in A: a \cdot b = b \cdot a.}

Example 5.1 (Symmetries of the Square)

Consider the group of rotations of a square, C4C_4. We have four elements: the identity, a rotation by π/2\pi/2, a rotation by π\pi, and a rotation by 3π/23\pi/2. The identity is the identity element, and the rotations are inverses of each other. The group is closed under composition, and the composition is associative. The group is Abelian, because the rotations commute with each other.

If we conside all symmetries of a square (rotations and reflections), D4D_4,1 we introduce four new elements: two reflections across the vertical/horizontal axes and two reflections across the diagonal axes. The group is still closed under composition, and the composition is still associative. However, the group is no longer abelian because of the reflections.

A
D
B
C
eerrr2r^2r3r^3txt_xtyt_ytACt_{AC}tBDt_{BD}
eeeerrr2r^2r3r^3txt_xtyt_ytACt_{AC}tBDt_{BD}
rrrrr2r^2r3r^3eetACt_{AC}tBDt_{BD}tyt_ytxt_x
r2r^2r2r^2r3r^3eerrtyt_ytxt_xtBDt_{BD}tACt_{AC}
r3r^3r3r^3eerrr2r^2tBDt_{BD}tACt_{AC}txt_xtyt_y
txt_xtxt_xtBDt_{BD}tyt_ytACt_{AC}eer2r^2r3r^3rr
tyt_ytyt_ytACt_{AC}txt_xtBDt_{BD}r2r^2eerrr3r^3
tACt_{AC}tACt_{AC}txt_xtBDt_{BD}tyt_yrrr3r^3eer2r^2
tBDt_{BD}tBDt_{BD}tyt_ytACt_{AC}txt_xr3r^3rrr2r^2ee

Cayley table This is called a Cayley table, and it’s a useful way to visualize the structure of a finite group. Entry (r,c)(r,c) is what you get after applying the ccth operation to the rrth element. We can see this isn’t an abelian group because the table is not symmetric. subgroup Additionally, we can see that C4C_4 is a subgroup of D4D_4 (it’s self-contained in the top-left quadrant of the table).

Exercise 5.1 Prove that C4C_4 is an Abelian group.

Exercise 5.2 Prove that D4D_4 is a non-Abelian group.

Exercise 5.3 Which of the following are/are not groups? Which are Abelian?

ring, lattice

Moving up, rings and lattices are sets equipped with two binary operations that are commutative and associative. The difference between these two is how the two operations distribute.

For rings, the operations (“addition” and “multiplication”) are distributive:

a, b, cR:a(b+c)=ab+ab.(5.2)\t{5.2}{\forall a,\ b,\ c \in R: a \cdot (b + c) = a \cdot b + a \cdot b.}

For lattices, the operations (“join” and “meet”) are absorptive:

a, bL:a(ab)=a(ab)=a.(5.3)\t{5.3}{\forall a,\ b \in L: a \wedge (a \vee b) = a \vee (a \wedge b) = a.}

Exercise 5.4 Prove that ({True,False},,)(\{\text{True}, \text{False}\}, \vee, \wedge) is a lattice, where \vee and \wedge have the standard Boolean interpretation (“and,” “xor”)

field

Finally, fields are rings with an additional property: every element has an inverse. That is, aF, a1F: aa1=a1a=1\forall a \in F,\ \exists a^{-1} \in F:\ a \cdot a^{-1} = a^{-1} \cdot a = 1. They’re the structure you’re most familiar with, as they’re the basis of arithmetic. The rational numbers, Q\QQ, are a field, as are the real numbers, R\RR, and the complex numbers, C\CC.

5.2 Vector Spaces

vector space For this chapter, we’re mainly interested in a particular kind of algebraic structure called a vector space. Vector spaces are defined over two existing structures:

  1. An Abelian group over a set, VV, of “vectors”, whose operation is called vector addition (+V:V×VV+_V: V \times V \rightarrow V) and whose identity element is the zero vector, usually denoted 0\b{0}.

  2. A field over a set, FF, of “scalars” with all the usual arithmetic operations (F\cdot_F, +F+_F, F-_F, 11, 00). Usually, this field is the real numbers, R\mathbb{R}, but it could be any field.

A vector space combines these structures through an operation called scalar multiplication (S:V×FV\cdot_S: V \times F \rightarrow V) that distributes over vector and field addition. That is, for all v, wV\b v,\ \b w \in V and for all a, bF:a,\ b \in F:

aS(v+Vw)=aSv+VaSw,(5.4)\t{5.4}{a \cdot_S (\b v +_V \b w) = a \cdot_S \b v +_V a \cdot_S \b w,}

and

(a+Fb)Sv=aSv+VbSv.(5.5)\t{5.5}{(a +_F b) \cdot_S \b v = a \cdot_S \b v +_V b \cdot_S \b v.}

Moreover, scalar multiplication is “compatible” with field multiplication,

vV, a, bF:(aFb)Sv=aS(bSv),(5.6)\t{5.6}{\forall \b v \in V,\ \forall a,\ b \in F: (a \cdot_F b) \cdot_S \b v = a \cdot_S (b \cdot_S \b v),}

and there identity of the field addition operation is the identity of the scalar multiplication operation,

vV:1Sv=v.(5.7)\t{5.7}{\forall \b v \in V: 1 \cdot_S \b v = \b v.}

To simplify the notation (at the expense of more ambiguity), we almost always drop the subscripts, and we omit the scalar multiplication operation when it’s clear from context. So, we can write:

(a+b)(v+w)=av+aw+bv+bw,(5.8)\t{5.8}{(a + b) (\b v + \b w) = a \b v + a \b w + b \b v + b \b w,}

Be careful to not confuse vector addition, +V+_V, with field addition, +F+_F or scalar multiplication, S\cdot_S, with field multiplication, F\cdot_F.

Example 5.2 (Types of vectors)

  1. Geometric vectors. Often, vectors are introduced as arrows. Two arrows can be added together by adding their endpoints. Multiplying an arrow by a scalar λ\lambda is equivalent to stretching (or squeezing) the arrow by a factor of λ\lambda.
  2. Polynomial vectors. Polynomials are also vectors. Adding two polynomials together is equivalent to adding their coefficients. Multiplying a polynomial by a scalar λ\lambda is equivalent to multiplying each coefficient by λ\lambda.
  3. Elements of Rn\RR^n. On a more abstract level, tuples of nn numbers are vectors. For example, the vector v=(1,2,3)\vec{v} = (1, 2, 3) is an element of R3\mathbb{R}^3. If we add a second vector (element-wise) w=(4,5,6)\vec{w} = (4, 5, 6), we obtain a third vector v+w=(5,7,9)\vec{v} + \vec{w} = (5, 7, 9) which is also in R3\mathbb{R}^3. If we multiply v\vec{v} by a scalar a=2a = 2, we get another vector 2v=(2,4,6)2 \cdot \vec{v} = (2, 4, 6).

In fact, both geometric vectors and polynomial vectors can be seen as special cases of elements of Rn\RR^n. Given a basis of coordinates, we can represent a geometric vector as the tuple of numbers representing its endpoint. Similarly, given a set of polynomials, we can represent a polynomial vector as the tuple of numbers representing its coefficients.

Insert picture here

Exercise 5.5: Prove that R3\mathbb{R}^3 is a vector space (with vector addition & scalar multiplication defined element-wise.)

To prove that R3\mathbb{R}^3 is a vector space, we need to show that R3\mathbb{R}^3 is an Abelian group under vector addition, and that element-wise multiplication by a scalar satisfiess the properties of scalar multiplication.

Altogether, this involves ten axioms:

AxiomOperationMeaning
Closure 1Vector additionv+wR3\b v + \b w \in \mathbb{R}^3
AssociativityVector addition(v+w)+x=v+(w+x)(\b v + \b w) + \b x = \b v + (\b w + \b x)
CommutativityVector additionv+w=w+v\b v + \b w = \b w + \b v
Identity 1Vector additionv+0=v\b v + \b 0 = \b v
InverseVector additionv+v1=0\b v + \b v^{-1} = \b 0
Closure 2Scalar multiplicationavR3a\b v \in \mathbb{R}^3
Distributivity 1Scalar multiplicationa(v+w)=av+awa (\b v + \b w) = a \b v + a \b w
Distributivity 2Scalar multiplication(a+b)v=av+bv(a + b) \b v = a \b v + b \b v
CompatibilityScalar multiplication(ab)v=a(bv)(a \cdot b) \b v = a (b \b v)
Identity 2Scalar multiplication1v=v1 \b v = \b v

5.3 Matrices

5.4 Systems of Linear Equations

5.5 Linear Independence, Basis, and Rank

5.6 Linear mappings

5.7 Further Reading

For more on algebraic structures, check out Julie Morunuki’s cheatsheet.

For more on linear algebra, check out MML, Strang (2003), [Golan (2007)], Hogben (2013), Axler (2015), Liesen and Mehrmann (2015), Pavel Grinfeld’s online series, Gilbert Strang’s notes, and 3Blue1Brown’s videos.

Footnotes

  1. This is called the dihedral group of degree four.


Previous:

Logic

Next:

Analytic Geometry

Updates & Corrections

If you see any mistakes or want to suggest improvements, please create an issue on GitHub

Reuse

Figures and text are available under a Creative Commons license (CC-BY 4.0) unless otherwise mentioned. The source is available on GitHub. Figures taken from other sources (as mentioned in the captions by "Figure from...") are not available under this license.

Citation

@misc{hoogland2022,
    title={Linear Algebra},
    author={Jesse Hoogland},
    year={2022},
    url={https://agi-curriculum.vercel.app//1-foundations/1-linear-algebra}
}