VGLA definitions term 2 Flashcards

1
Q

Imaginary Unit

A

The Imaginary unit i is defined such that i²=-1 and (-i)²=-1

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

Complex numbers

A

The set of complex numbers ℂ is defined by ℂ = {a+bi: a∈ℝ and b∈ℝ}

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

equality of complex numbers

A

Two complex numbers (a+bi), (c+di) are equal if and only if

  1. a=c
  2. b=d
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Sum of complex numbers

A

The sum of two complex numbers a+bi and c+di is the complex number (a+bi) + (c+ di) = (a+c) + (b+d)i

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

product of two complex numbers

A

The product of two complex numbers a+bi and c+di is the complex number (a+bi)(c+di) = (ac-bd)+(bc+ad)i

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

real part of a complex number

A

The real part of a complex number z=a+bi is given by Re(z) =a

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

Imaginary part of a complex number

A

The imaginary part of a complex number is given by Im(z)=b

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

complex conjugate

A

The complex conjugate of a complex number z=a+bi is given by z*=a+bi

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

modulus

A

The modulus of a complex number z=x+yi, |z| is given by |z|=√(a²+ b²)

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

Argument

A

The value of θ for which x = |z|cos(θ) and y = |z|sin(θ) is an argument of the complex number z= x+yi where x!=0.

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

principle argument

A

The principle value of an argument arg(z) is the value of arg(z) such that arg(z) complex numbers ℂ is defined by ℂ = {a+bi: a∈ℝ and b∈(-π,π)

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

roots of complex numbers

A

a complex number ω is the nth root of a complex number z if and only if wⁿ=z

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

polynomial of degree n (real coefficiants)

A

A polynomial of degree n in the indeterminate (unknown) z with real coefficiants is an expression of the form aₙzⁿ+ aₙ₋₁zⁿ⁻¹+ … + a₁z + a₀
where aᵢ∈ℝ for i=0,1,2…n and aₙ!=0

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

zero

A

A complex number α is called a zero of the polynomial p(z) of degree n with real coefficiants if p(α)=0 i.e.
aₙαⁿ+ aₙ₋₁αⁿ⁻¹+ … + a₁α + a₀ = 0

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

multiplicity

A

The number of times an item appears in an expression

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

|z-z₀| = α

A

The loci of points on a circle with centre z₀ and radius α

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

Arg(z- z₀) = θ

A

The loci of points on the half line starting at z₀ at the angle θ to the horizontal

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

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

A

The loci of points on 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
19
Q

Submatrix

A

A submatrix of A∈Mₘₙ is obtained from A by deleting either

(i) at least one row of A
(ii) at least one column of A
(iii) at least one row and at least one column of A

20
Q

(i,j)-minor

A

The (i,j)-minor of a matrix A∈Mₙₙ written as Mᵢⱼ(A) is the determinant of the (n-1)x(n-1)-submatrix of A obtained by deleting row i and column j of A

21
Q

(i,j)-cofactor

A

The (i,j)-cofactor of a matrix A∈Mₙₙ, written as Cᵢⱼ(A), is defined by
Cᵢⱼ(A) = (-1)ᶦ⁺ʲMᵢⱼ(A)

22
Q

determinant

A

The determinant of a matrix A∈Mₙₙ is given by det(A) = a₁₁C₁₁(A) + a₁₂C₁₂(A) + … + a₁ₙC₁ₙ(A)

23
Q

Transpose Matrix

A

The transpose matrix Aᵀ = [bᵢⱼ]∈Mₘₙ of a matrix A = [aᵢⱼ]∈Mₘₙ is a matrix where the entry in position (j,i) is given by the entry in position (i,j) of the matrix A i.e.
bᵢⱼ = aᵢⱼ

24
Q

Cofactor Matrix

A

The cofactor matrix C(A) = [cᵢⱼ] of A = [aᵢⱼ]∈Mₙₙ is the matrix in Mₙₙ whos (i,j)-th entry is the cofactor of aᵢⱼ in A i.e.
cᵢⱼ = Cᵢⱼ(A)

25
Q

Adjoint Matrix

A

The adjoint matrix adj(A) of A = [aᵢⱼ]∈Mₙₙ is the transpose of the cofactor matrix of A i.e. adj(A) = (C(A))ᵀ

26
Q

binary operation

A

binary operation on a set V is a rule under which each ordered pair of two elements of V is associated with a unique element ( which may or may not belong to V)

27
Q

internal binary operation

A

An internal binary operation on a set V is a binary operation, , such that
x
y ∈ V
for all x,y ∈V. The set is said to be closed under such a binary operation.

28
Q

group

A

A set V with a binary operation * is called a group under the binary operation * when the following conditions are satisfied:

    • is an internal binary operation
    • is associative
    • has an identity
  1. for every element in V there exists an inverse element
29
Q

Abelian group

A

A group under a binary operation * is abelian when * is commutative

30
Q

field

A

A set V with binary operations * and # is called a field V,*,# when:

  1. V,* is an abelian group with identity 0
  2. V{0}, # is an abelian group with identity 1
  3. ∀x∈V: 0#x = x#0 = 0
  4. ∀x,y,z∈V: x#(yz) = (x#y)(x#z)
31
Q

vectors space

A

A set V with a binary operation # and scalar multiplication * with elements from a field F,+,• is called a vector space over F when the following properties are satisfied:
1. V,# is an abelian group with identity 1
2. V is closed under the scalar multiplication : ∀a∈V, ∀λ∈F: λa ∈V
3. There is distributivity for the scalar multiplication with respect to # in F:
∀a,b∈V, ∀λ∈F: λ(a#b) = (λa)#(λb)
4. There is distributivity for the scalar multiplication with respect to + in F:
∀a,b∈V, ∀λ∈F: λ
(a+b) = (λa)+(λb)
5. Mixed associativity for • and *
∀a∈V, ∀λ∈F: λ(va) = (λ•v)a
6. identity of F{0} is also an identity for scalar multiplication:
∀a∈V: 1
a = a

32
Q

vector space definition point 1

A
  1. V,# is an abelian group with identity 1
33
Q

vector space definition point 2

A
  1. V is closed under the scalar multiplication : ∀a∈V, ∀λ∈F: λa ∈V
34
Q

vector space definition point 3

A
  1. There is distributivity for the scalar multiplication with respect to # in F:
    ∀a,b∈V, ∀λ∈F: λ(a#b) = (λa)#(λ*b)
35
Q

vector space definition point 4

A
  1. There is distributivity for the scalar multiplication with respect to + in F:
    ∀a,b∈V, ∀λ∈F: λ(a+b) = (λa)+(λ*b)
36
Q

vector space definition point 5

A
  1. Mixed associativity for • and *

∀a∈V, ∀λ∈F: λ(va) = (λ•v)*a

37
Q

vector space definition point 6

A
  1. identity of F{0} is also an identity for scalar multiplication:
    ∀a∈V: 1*a = a
38
Q

subtraction binary operation

A

A subtraction is a binary operation on the vector space V defined as:
u-v = u + (-v)
∀u,v∈V (-v is the inverse of v)

39
Q

subspace

A

A non-empty subset U of a real vector space V is called a subspace under the same operations of addition and scalar multiplication relative to which V is a real vector space.

40
Q

linear combination

A

A vector v∈V, with a real vector space is a linear combination of the vectors u₁, u₂, … uₖ∈V if v can be written in the form:
v = λ₁u₁ + λ₂u₂ + … + λₖuₖ
where λ₁, λ₂,..,λₖ∈ℝ

41
Q

span

A

if u₁, u₂, … uₖ∈V, with V a real vector space. Then the subset of V consisting of all possible linear combinations of u₁, u₂, … uₖ is called their span.

42
Q

row space

A

Consider the matrix A∈Mₘₙ and let uᵢ denote the vector in ℝⁿ associated with the ith row in A. Then the row space of A is the subspace of ℝⁿ given by:
row(A) = span{ u₁, u₂, … uₘ}

43
Q

column space

A

Consider the matrix A∈Mₘₙ and let uᵢ denote the vector in ℝᵐ associated with the ith column in A. Then the coumn space of A is the subspace of ℝᵐ given by:
column(A) = span{ u₁, u₂, … uₙ}

44
Q

linearly independent

A

A set of vectors {u₁, u₂, … uₖ} in a real vector space V is said to be linearly independent when
λ₁u₁ + λ₂u₂ + … + λₖuₖ = 0
only when
λ₁ = λ₂ = … = λₖ = 0

45
Q

Linearly dependent

A

A set of vectors {u₁, u₂, … uₖ} in a real vector space V is said to be linearly dependent if there is at least one linear combination other than the trivial one which is equal to the zero vector:
λ₁u₁ + λ₂u₂ + … + λₖuₖ = 0
with at least one value of i= 1,2,…,k s.t. λᵢ!=0