Bound on the rank of a product

The next proposition provides a bound on the rank of a product of two matrices.

Proposition Let  be a  matrix and  an  matrix. Then,

Full Rank

trace of a square matrix 

In linear algebra, the trace of a square matrix A, denoted tr(A), is defined to be the sum of elements
on the main diagonal (from the upper left to the lower right) of A. ... The trace is only defined for a
square matrix (n × n). The trace is related to the derivative of the determinant 

 the scalar ( ×    ) ⋅    is called a scalar triple product of   ,  ,  .

 

 |(  ×  ) ⋅   | is |    ×   ||    || cosθ  |

 If the scalar triple product is equal to zero, then the three vectors a, b, and c are coplanar, since the
parallelepiped defined by them would be flat and have no volume.

Theorem 6.5

Three vectors  ,  ,   are coplanar if, and only if, there exist scalars r, s, t ∈ R such that atleast

one of them is non-zero and r + s  + t   =   .

 The condition for three vectors to be coplanar The mixed product is zero if any two of vectors, a, b and c

are parallel, or if a, b and c are coplanar. That is, when the given three vectors are coplanar the altitude of
the parallelepiped is zero and thus the scalar triple product is zero,

 The scalar triple product is important because its absolute value |(a×b)⋅c| is the volume of the
parallelepiped

  | (   ×   ) ⋅   | is the volume of the parallelepiped.

Theorem 2 The functions sin x and cos x are continuous on the interval (−∞,∞).
Why are the integrals of odd functions equal to zero?

In explanatory words, in odd functions the area under interval [-a,a] can be divided into two equally opposite sign of
integral i.e. area under increasing curve is equal to area under decreasing curve.

moment of inertia a quantity expressing a body's tendency

to resist angular acceleration, which is the sum of the products of the
mass of each particle in the body with the square of its distance from
the axis of rotation

The moment of a force about a point is (the magnitude of the force) × (the perpendicular distance of the line of
action of the force from the point).
Any solution to a General Linear programming problem which satisfies the non-negative
restrictions of the problem is called a ___ Correct Answer: Feasible solution

Optimal Solution: The solution where the objective function is maximize or minimize is known
as optimal solution.
Critical solution

Optimum solution :Any feasible solution which optimizes (minimizes or maximizes) the objective function of a
General L.P.P. is called an ___ to the General L.P.P.

The extreme points of the convex set of feasible solutions are

A) finite in number

B) 1

C) infinite in number

D) none of these
Correct Answer:

A) finite in number

The set of all optimal solutions to programming problem forms _____.

A) Convex hull

B) Simplex

C) Convex set

D) None of these

Correct Answer:

C) Convex set

The union of convex sets is _____.

A) also a convex set

B) not necessarily a convex set

C) always a convex set

D) none of these

Correct Answer:

B) not necessarily a convex set

Every ____ to a linear programming problem is an extreme point of the convex set of feasible solutions.

A) optimum solution

B) basic feasible solution

C) general solution

D) none of these

Correct Answer:

A) basic feasible solution