Introduction to Linear Algebra

Group

(G,∗)(G,*) is a group iff ∗* is a binary operation on set GG satisfying:

  • Non-empty
    G≠∅G \neq \emptyset.
  • Closed
    ∀a,b∈G,a∗b∈G\forall a,b \in G, a * b \in G.
  • Associateive
    ∀a,b,c∈G,(a∗b)∗c=a∗(b∗c)\forall a,b,c \in G, (a * b) * c = a * (b * c).
  • Identity exists
    ∃e∈G\exists e \in G such that ∀a∈G,e∗a=a∗e=a\forall a \in G, e * a = a * e = a.
  • Inverse exists
    ∀a∈G,∃a−1∈G\forall a \in G, \exists a^{-1} \in G such that a∗a−1=a−1∗a=ea * a^{-1} = a^{-1} * a = e.

Can either be finite or infinite.

Properties:

  • Identity is unique.
  • Inverse is unique for each element.
  • ∀a∈G,aˉˉ=a\forall a \in G, \bar{\bar{a}} = a.

Examples:

  • (Z,+)(\mathbb{Z}, +)
  • (R,+)(\mathbb{R}, +)
  • (R∖0,⋅)(\mathbb{R}\setminus{0}, \cdot)
  • Monster Group
    A finite group with roughly 8×10538 \times 10^{53} elements.

Abelian Group

A group where the binary operation is commutative.

(G,∗)(G,*) is abelian iff:

  • (G,∗)(G,*) is a group and
  • ∀a,b∈G,a∗b=b∗a\forall a,b \in G, a * b = b * a.

Ring

(R,+,⋅)(R,+,\cdot) is a ring iff:

  • (R,+)(R,+) is an abelian group
  • ⋅\cdot is associative and distributive over addition
  • ⋅\cdot has a multiplicative identity element

Not studied in this module.

Field

(F,+,∗)(F,+,*) is a field iff 2 operations ++ and ⋅\cdot on FF satisfying:

  • (F,+)(F,+) is an abelian group
  • (F∖0,⋅)(F\setminus{0},\cdot) is an abelian group (00 is additive identity)
  • ∀a,b∈F,a⋅b∈F\forall a,b \in F, a\cdot b \in F (11 is multiplicative identity)
  • multiplication is closed and distributive over addition
    ∀a,b,c∈F,a⋅(b+c)=a⋅b+a⋅c\forall a,b,c \in F, a\cdot(b+c) = a\cdot b + a\cdot c

Additive identity (00) is excluded for multiplication (∗*) operatin because it doesn’t have an inverse.

Properties:

  • 00 and 11 are unique.
  • FF has at least 2 elements, 00 and 11.

Examples:

  • (R,+,⋅)(\mathbb{R}, +, \cdot)
  • ({ 0,1,2 },+mod  3,⋅mod  3)(\set{0,1,2}, +\mod 3, \cdot\mod 3)

Finite Fields

A field with a finite number of elements.

For a prime number pp, Fp=({ 0,1,2,…,p−1 },+mod  p,⋅mod  p)\mathbb{F}_p = (\set{0,1,2,\dots,p-1},+\mod p, \cdot\mod p) is a field.

Every finite field has size pkp^k for some prime pp and an some integer kk. And, for any prime pp and for any integer kk, there exists a field with size pkp^k. BUT not every set with pkp^k number of elements are a field.

Written by October 17, 2026 2 min read
Was this helpful?