Linear Algebra Flashcards
Define a field
A set F with two binary operations + and × is a field if both (F, +, 0) and
(F \ {0}, ×, 1) are abelian groups and the distribution law holds:
(a + b)c = ac + bc, for all a, b, c ∈ F.
Define the characteristic of F
The smallest integer p such that
1 + 1 + · · · + 1 (p times) = 0
is called the characteristic of F. If no such p exists, the characteristic of F is defined to be zero.
If such a p exists, it is necessarily prime.
Define a vector space V over a field F in terms of groups
A vector space V over a field F is an abelian group (V, +, 0) together with a scalar multiplication F × V → V such that for all a, b ∈ F, v, w ∈ V :
(1) a(v + w) = av + aw
(2) (a + b)v = av + bv
(3) (ab)v = a(bv)
(4) 1.v = v
Let V be a vector space over F
Define a set S ⊆ V being linearly independent
(1) A set S ⊆ V is linearly independent if whenever a1, · · · , an ∈ F, and
s1, · · · , sn ∈ S,
a1s1 + · · · + ansn = 0 ⇒ a1 = · · · = an = 0.
Let V be a vector space over F
Define what it means for a set S ⊆ V to be spanning
(2) A set S ⊆ V is spanning if for all v ∈ V there exists a1, · · · , an ∈ F and s1, · · · , sn ∈ S with
v = a1s1 + · · · + ansn
Let V be a vector space over F
Define what it means for a set S ⊆ V to be a basis of V
(3) A set B ⊆ V is a basis of V if B is spanning and linearly independent. The size of B is the
dimension of V
Define a linear map/transformation
Suppose V and W are vector spaces over F. A map T : V → W is a linear
transformation (or just linear map) if for all a ∈ F, v, v′ ∈ V ,
T(av + v’) = aT(v) + T(v’)
What is a bijective linear map called?
an isomorphism of vector spaces.
What is the assignment T → ᵦ’[T]ᵦ ?
Meant to be fancy B’ subscript
an isomorphism of vector spaces from Hom(V, W)
to the space of (m×n)-matrices over F. It takes composition of maps to multiplication of matrices.
In particular, if T : V → V and B and B′ are two different bases with ᵦ’[Id]ᵦ the change of basis matrix then:
ᵦ’[T]ᵦ’ = ???
all Bs are meant to be fancy Bs
ᵦ’[T]ᵦ’ = ᵦ’[Id]ᵦ ᵦ[T]ᵦ ᵦ[Id]ᵦ’ with ᵦ’[Id]ᵦ ᵦ[Id]ᵦ’ = I the identity matrix
Define a ring
A non-empty set R with two binary operations + and × is a ring if (R, +, 0) is an
abelian group, the multiplication × is associative and the distribution laws hold: for all a, b, c ∈ R,
(a + b)c = ac + bc and a(b + c) = ab + ac.
Define a commutative ring
The ring R is called commutative if for all a, b ∈ R we have ab = ba.
Define a ring homomorphism
A map φ : R → S between two rings is a ring homomorphism if for all
r, r′ ∈ R:
φ(r + r’) = φ(r) + φ(r’) and φ(rr’) = φ(r)φ(r’).
Define a ring isomorphism
A bijective ring homomorphism is called a ring isomorphism.
Define an ideal
A non-empty subset I of a ring R is an ideal if for all s, t ∈ I and r ∈ R we have s − t ∈ I and sr, rs ∈ I.
What is the first isomorphism theorem? (rings)
The kernel Ker(φ) := φ⁻¹(0) of a ring homomorphism φ : R → S is an ideal, its image Im(φ) is a subring of S, and φ induces an isomorphisms of rings R/Ker(φ) ∼= Im(φ)
Prove the first isomorphism theorem (rings)
Exercise
What is the “division algorithm” for polynomials?
Let f(x), g(x) ∈ F[x] be two polynomials with g(x) ≠ 0. Then there exists q(x), r(x) ∈ F[x] such that f(x) = q(x)g(x) + r(x) and deg r(x) < deg g(x).
Prove the “division algorithm” for polynomials
If deg f(x) < deg g(x), put q(x) = 0, r(x) = f(x). Assume now that deg f(x) ≥ deg g(x)
and let
f(x) = aₙxⁿ + aₙ₋₁xⁿ⁻¹ + … + a₀
g(x) = bₖxᵏ + bₖ₋₁xᵏ⁻¹ + … + b₀
Then
deg( f(x) - aₙ/bₖ xⁿ⁻ᵏg(x) ) < n
By induction on deg f − deg g, there exist s(x), t(x) such that
f(x) - aₙ/bₖ xⁿ⁻ᵏg(x) = s(x)g(x) + t(x) and deg g(x) ? deg t(x)
Hence put q(x) = aₙ/bₖ xⁿ⁻ᵏ + s(x) and r(x) = t(x)
For all f(x) ∈ F[x] and a ∈ F,
f(a) = 0 ⇒ ???
For all f(x) ∈ F[x] and a ∈ F,
f(a) = 0 ⇒ (x − a)|f(x).
For all f(x) ∈ F[x] and a ∈ F,
f(a) = 0 ⇒ (x − a)|f(x).
Prove it
By division alg for polyn there exist q(x), r(x) such that
f(x) = q(x)(x − a) + r(x)
where r(x) is constant (as deg r(x) < 1). Evaluating at a gives
f(a) = 0 = q(a)(a − a) + r = r
and hence r = 0.
Assume f ≠ 0. If deg f ≤ n then f has [ ] roots
Assume f ≠ 0. If deg f ≤ n then f has at most n roots.
Assume f ≠ 0. If deg f ≤ n then f has at most n roots.
Prove it
Follows from
For all f(x) ∈ F[x] and a ∈ F,
f(a) = 0 ⇒ (x − a)|f(x).
and induction
Let a(x), b(x) ∈ F[x] be two polynomials. Let c(x) be a monic polynomial of highest degree dividing
both a(x) and b(x) and write c = gcd(a, b) (also wrote less commonly hcf(a, b)).
Let a, b ∈ F[x] be non-zero polynomials and let gcd(a, b) = c. Then there exist
s, t ∈ F[x] such that:
a(x)s(x) + b(x)t(x) =
Let a, b ∈ F[x] be non-zero polynomials and let gcd(a, b) = c. Then there exist
s, t ∈ F[x] such that:
a(x)s(x) + b(x)t(x) = c(x)