5.1 Algebraic Structures
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.
For example, a group, is a set, , equipped with a binary operation, , that satisfies the following four properties:
- Closure: .
- Identity: .
- Associativity: .
- Invertibility: .
Example 5.1 (Symmetries of the Square)
Consider the group of rotations of a square, . We have four elements: the identity, a rotation by , a rotation by , and a rotation by . 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), ,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.
Exercise 5.1 Prove that is an Abelian group.
Exercise 5.2 Prove that is a non-Abelian group.
Exercise 5.3 Which of the following are/are not groups? Which are Abelian?
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:
For lattices, the operations (“join” and “meet”) are absorptive:
Exercise 5.4 Prove that is a lattice, where and have the standard Boolean interpretation (“and,” “xor”)
Finally, fields are rings with an additional property: every element has an inverse. That is, . They’re the structure you’re most familiar with, as they’re the basis of arithmetic. The rational numbers, , are a field, as are the real numbers, , and the complex numbers, .
5.2 Vector Spaces
-
An Abelian group over a set, , of “vectors”, whose operation is called vector addition () and whose identity element is the zero vector, usually denoted .
-
A field over a set, , of “scalars” with all the usual arithmetic operations (, , , , ). Usually, this field is the real numbers, , but it could be any field.
A vector space combines these structures through an operation called scalar multiplication () that distributes over vector and field addition. That is, for all and for all
and
Moreover, scalar multiplication is “compatible” with field multiplication,
and there identity of the field addition operation is the identity of the scalar multiplication operation,
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:
Be careful to not confuse vector addition, , with field addition, or scalar multiplication, , with field multiplication, .
Example 5.2 (Types of vectors)
- Geometric vectors. Often, vectors are introduced as arrows. Two arrows can be added together by adding their endpoints. Multiplying an arrow by a scalar is equivalent to stretching (or squeezing) the arrow by a factor of .
- Polynomial vectors. Polynomials are also vectors. Adding two polynomials together is equivalent to adding their coefficients. Multiplying a polynomial by a scalar is equivalent to multiplying each coefficient by .
- Elements of . On a more abstract level, tuples of numbers are vectors. For example, the vector is an element of . If we add a second vector (element-wise) , we obtain a third vector which is also in . If we multiply by a scalar , we get another vector .
In fact, both geometric vectors and polynomial vectors can be seen as special cases of elements of . 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.
Exercise 5.5: Prove that is a vector space (with vector addition & scalar multiplication defined element-wise.)
To prove that is a vector space, we need to show that 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:
Axiom | Operation | Meaning |
---|---|---|
Closure 1 | Vector addition | |
Associativity | Vector addition | |
Commutativity | Vector addition | |
Identity 1 | Vector addition | |
Inverse | Vector addition | |
Closure 2 | Scalar multiplication | |
Distributivity 1 | Scalar multiplication | |
Distributivity 2 | Scalar multiplication | |
Compatibility | Scalar multiplication | |
Identity 2 | Scalar multiplication |
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
-
This is called the dihedral group of degree four. ↩