VGLA Theorems term 2 Flashcards

1
Q

multiplication in mod-arg

A

given any two no-zero complex numbers z₁ z₂

i) |z₁z₂| = |z₁||z₂|
(ii) arg(z₁ z₂) = arg(z₁) + arg(z₂

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

division in mod-arg

A

given any two non-zero complex numbers z₁ z₂

i) |z₁/z₂| = |z₁|/|z₂|
(ii) arg(z₁/z₂) = arg(z₁) - arg(z₂

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

De moivres theorem

A

if n∈ℕ of θ is real then:

cos(θ) + isin(θ))ⁿ = cos(nθ) + isin(nθ

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Eulers formula

A

z = re^iθ

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

factors of polynomials

A

The complex number α is a root of the polynomial equation p(z)=0 if and only if z-α is a factor of the polynomial p(z)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

pair of complex roots

A

Any non-real roots of the polynomial equation p(z)=0 of degree n occur in complex conjugate pairs
(polynomial has real coefficiants)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

how factors are expressed

A

A polynomial p(z) can be expressed as a product of real factors in one of the following ways

  • product of linear factors only
  • product of irreducible quadratic factors only
  • product of atleast one linear equation and atleast one irreducible quadratic factor
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

number of factors

A

A polynomial p(z) of degree n with real coefficiants has exactly n zeros, some of which may be complex conjugate pairs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

fundamental theorem of algebra

A

Any polynomial equation of degree n with n>=1 with complex coefficiants has atleast one complex root

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

|z-z₀| = α

A

The set of solutions to the equation is represented on the argand diagram by the points on a circle with centre z₀ and radius α

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Re(α) / Im(α)

A

the set of solutions re[resented on the argand diagram by the points on the line where all the real parts are α (vertical line) or all the imaginary parts are α (horizontal line)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Arg(z-z₀) = θ

A

Set of solutions are represented on the argand diagram by a half line from z₀ at the angle θ

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

|z-(a+bi)|=|z-(c+di)|

A

Set of soltuions are represented on the argand diagram by the perpendicular bisector between the points a+bi and c+di

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Expansion of any row or column

A

For any matrix A=[aᵢⱼ]∈Mₙₙ.

det(A) = aᵢ₁Cᵢ₁(A) + aᵢ₂Cᵢ₂(A) + … + aᵢₙCᵢₙ(A) for any 1<i></i>

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

determinant of an upper triangular matrix

A

product of the diagonal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

determinant of a lower triangular matrix

A

product of the diagonal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

determinant of a diagonal matrix

A

product of the diagonal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

determinant of the unit matrix

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

determinant of a matrix where there is a row or column of 0

A

0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

determinant where there is a repeated row or column

A

0

21
Q

interchanging rows/column when finding the determinant

A

det(P) = - det(A)

22
Q

multiplying a row/column by a constant λ when finding the determinant

A

det(P) = λdet(A)

23
Q

adding a multiple of another row/column when finding the determinant

A

det(P) = det(A)

24
Q

Elementary matrices multiples of determinants

A

det(E.A) = det(E) . det(A)

25
Q

non-invertible matrices

A

If the matrix A is non-invertible then det(A)=0

26
Q

Determinant product theorem

A

Given the matrices A and B then det(AB) = det(A)det(B)

27
Q

invertible matrices

A

A matrix A is invertible if and only if det(A)!=0. When det(A)!=0 det(A⁻¹)= (det(A))⁻¹ = 1/det(A)

28
Q

no trivial solution corollary

A

A homogeneous system A.x=0 of n equations in n unknowns has a non-trivial solution if and only if det(A) = 0

29
Q

Expansion of transposition

A

Given matrices A,B Then (A.B)ᵀ = Aᵀ.Bᵀ

30
Q

Transpose of an elementary matrix

A

Given an elementary matrix E then |Eᵀ|=|E|

31
Q

determinant of transpose matrix

A

For a matrix A det(Aᵀ) = det(A)

32
Q

replacement of summed rows

A

For a matrix A=[aᵢⱼ]∈Mₙₙ and where aₚⱼ=bₚⱼ+cₚⱼ for 1<=p<=n then:
det(A) = det(B) +det(C)
where the patrix B is constructed by replacing row p in A by the values bₚⱼ and he matrix C is constructed by replacing row p in A with the values Cₚⱼ

33
Q

Inverse of a matrix

A

For a matrix A∈Mₙₙ A.adj(A) = adj(A).A = det(A).Iₙ in particular when det(A)!=0 A⁻¹ = 1/det(A) . adj(A)

34
Q

Crammers rule

A

If A∈Mₙₙ is invertible, then the unique solution of the system A.x=b of n linear equations in n unknowns is given by x₁=det(A₁)/det(A), x₂=det(A₂)/det(A), xₙ=det(Aₙ)/det(A).
For each k=1,2,…n the matrix Aₖ is obtained by replacing the entries in column k of A by the entries in the column vector b

35
Q

unique identities

A

if a binary operation on a set V has an identity it is unique

36
Q

zero vector uniqueness

A

The zero vector (identity) in a real vector space ℝ,+,• is unique

37
Q

inverse of addition uniqueness

A

In a real vector space, V, the inverse with respect to the addition on V of a vector v is unique

38
Q

scalar multiplication distributivity

A

Consider m vectors in a real vector space v₁, v₂, … vₘ ∈V, with m≥2 and λ∈ℝ, then
λ(v₁ + v₂ + … + vₘ) = λv₁, λv₂, … λvₘ

39
Q

scalar multiplication distributivity (inside out)

A

Consider a vector v∈V with V real vector space and m real numbers λ₁, λ₂,..,λₖ∈ℝ, with m≥2, then
v(λ₁ + λ₂ + … + λₘ) = vλ₁, vλ₂, … vλₘ

40
Q

inverses an identities of vector spaces theoerem

0= 0 vector

A

If V is a real vector space, then

  1. ∀v∈V: 0v = 0
  2. ∀λ∈ℝ: λ0 = 0
  3. ∀λ∈ℝ, ∀v∈V: if λv = 0 then either λ=0 (scalar) or v=0
  4. ∀λ∈ℝ, ∀v∈V: (-λ)v = λ(-v) = -λv
41
Q

inverse of a vector (for addition)

A

∀v∈V: (-1)v = -v

42
Q

subspace of a vector space theorem

A

A non-empty subset I of a real vector space V is a subspace of V if and only if
1. ∀u,v∈U: u+v∈U
2. ∀u∈U, ∀λ∈ℝ: λu∈U
in other words U is a subspace of V iff U is closed under addition and scalar multiplication

43
Q

subspace of spanning sets theorem

A

Suppose that U = span{u₁, u₂, … uₖ} where u₁, u₂, … uₖ∈V with V a real vector space. Then

  1. u₁, u₂, … uₖ∈U
  2. U is a subspace of V
  3. U is he smallest subspace of V containing each of the vectors u₁, u₂, … uₖ in the sense that if Ú is another subspace of V which contains all k of those vectors, the U⊆Ú
44
Q

row and column space of a transpose matrix

A

Consider a matrix A∈Mₘₙ. Then,

i) row(A) = col(Aᵀ
(ii) col(A) = row(Aᵀ)

45
Q

linear dependency due to scalar multiples theorem

A

A set {u₁, u₂} of two non-zero vectors in a real vector space V is linearly dependent if and only if u₂ is a scalar multiple of u₁

46
Q

linear independency due to scalar multiple

A

A set {u₁, u₂} of two non-zero vectors in a real vector space V is linearly independent if and only if u₂ is a not scalar multiple of u₁

47
Q

linear combinations and linear dependency

A

Consider an ordered set of k non-zero vectors in a real vector space V, S = {u₁, u₂, … uₖ}. The set S is linearly dependent if and only if there is a vector of the set that can be expressed as a linear combination of preceding vectors

48
Q

number of linearly indepdent sets vs spanning sets theorem

A

Let S be a set of k vectors in a real vector space V which spans V. Let T be a linearly independent set of m vectors in V. Then
m≤k
(the number of vectors in a linearly independent set in V cannot exceed the number of vectors in a spanning set of V)