Lecture 3

Partitioned Matrices and Vector

Spaces I

3.1 Partitioned Matrices

Partitioning a matrix means defining blocks or submatrices within a matrix either row wise,
column wise or both. For example,
 
n 1 1 1
   
 
 1 n1 0 0  A11 A12
A= 
=


 1 0 n2 0  A21 A22
 
1 0 0 n3

Let A be a matrix of order m × n. A row partition of the matrix A is

P = [{1, 2, · · · , i1 } , {i1 + 1, i1 + 2, · · · , i2 } , {i2 + 1, i2 + 2, · · · , i3 } , · · · , {iu−1 + 1, iu−1 + 2, · · · , iu }]

where 1 ≤ i1 ≤ i2 ≤ i3 ≤ · · · ≤ iu−1 ≤ iu = m are the positive integers between 1 to m.

Here u < m number of row wise submatrices are defined. Similarly, a column partition of
the matrix A is

Q = [{1, 2, · · · , j1 } , {j1 + 1, j1 + 2, · · · , j2 } , {j2 + 1, j2 + 2, · · · , j3 } , · · · , {jv−1 + 1, jv−1 + 2, · · · , jv }]

where 1 ≤ j1 ≤ j2 ≤ j3 ≤ · · · ≤ jv−1 ≤ jv = n are the positive integers between 1 to n. Here

v < n number of column wise submatrices are defined.

1
 A Partitioned matrix is a matrix A together with a row partition P and column
partition Q of A. Conveniently, partitioned matrix is represented by drawing horizontal lines
after ith th th th th th
1 , i2 , · · · iu rows and vertical lines after the j1 , j2 , · · · , jv columns. For example,
 
2 1 −1 0 0 0
 
Example 3.1 Consider a marix A =  4 0 3 −1 2 5 . If row partition and col-
 
 
3 1 1 0 1 −2
umn partition
 of A are P = [{1}, {2, 3}] and [{1, 2} , {3} , {4, 5, 6}] then partitioned matrix
2 1 −1 0 0 0  
  A11 A12
is A =  4 0 3 −1 2 5 = .
 
  A21 A22
3 1 1 0 1 −2

Partitioning a matrix A gives another matrix C of smaller order than A whose entries
are themselves matrices. If P and Q are row and column partitions of a matrix A then
partitioned matrix C is
 
C C12 · · · C1v
 11 
 C21 C22 · · · C2v 
 
C = ((Cij )) = 
 .. .. .. .. 

 . . . . 
 
Cu1 Cu2 · · · Cuv

The oprations, scalar multiplication, addition, subtraction, multiplication etc. can be done
with usual way on partiotion matrices.

ˆ Let C = ((Cij )) is partitioned matrix and α is real number then scalar multiplication
is  
αC11 αC12 · · · αC1v
 
 αC21 αC22 · · · αC2v 
 
αC = ((αCij )) = 
 .. .. .. .. 

 . . . . 
 
αCu1 αCu2 · · · αCuv

ˆ If C = ((Cij )) is partitioned matrices of orders u × v then transpose is a v × u matrix

©: These Lecture notes are copyright of Alok D. Dabade 2

 given by  
0 0 0
C C21 · · · Cu1
 11 
0 0 0
 C12 C22 · · · Cu2 
   
0 0
C = Cji =
 .. .. .. .. 

 . . . . 
 
0 0 0
C1v C2v · · · Cuv

ˆ If C = ((Cij )) and D = ((Dij )) are partitioned matrices of orders u × v respectively

then addition C + D = ((Cij + Dij )).
 
C + D11 C12 + D12 · · · C1v + D1v
 11 
 C21 + D21 C22 + D22 · · · C2v + D2v
 

C + D = ((Cij + Dij )) = 
 .. .. .. ..


 . . . . 
 
Cu1 + Du1 Cu2 + Du2 · · · Cuv + Duv

ˆ If C = ((Cij )) and D = ((Dij )) are partitioned matrices of 

orders u × v 
and v × w
Pq
respectively then matrix multiplication CD = E = ((Eij )) = Cik Dkj .
k=1

q q q
 
P P P
 C1k Dk1 C1k Dk2 · · · C1k Dkv 
 k=1
q
k=1
q
k=1
q

q
!!  P P P 
X  C 2k D k1 C 2k Dk2 · · · C2k Dkv 
CD = E = ((Eij )) = Cik Dkj =  k=1
 k=1 k=1

.. .. .. ..

. . . .
 
k=1  
 q q q

 P P P 
Cuk Dk1 Cuk Dk2 · · · Cuk Dkv
k=1 k=1 k=1

 
2 1 −1 0 0  0 
  3 2 0 0 −1 2
Example 3.2 Consider the matrices A =  4 0 3 −1 2 5 B = 
  
  2 5 1 0 3 −1
3 1 1 0 1 −2
 
1 0 0 0
 
 0 1 0 0 
 
 
 1 −2 2
 
5 
C= .
 2 −1 2

0 
 
 −1 3 0 −1 
 
 
0 1 0 0

©: These Lecture notes are copyright of Alok D. Dabade 3

If row partition and column partitions of matrices A, B and C are respectively PA =
[{1} , {2, 3}] , QA = [{1, 2} , {3} , {4, 5, 6}] ; PB = [{1} , {2}] , QB = QA ; PC =
0
[{1, 2} , {3} , {4, 5, 6}] , QC = [{1, 2} , {3, 4}]. Obtain: A + B, 2A, B and AC.

3.2 Vector Spaces

Definition 3.1 Vector Space
0
The collection, V , of all ordered sets x = (x1 , x2 , · · · , xn ) is called the vector space if the
following conditions are satisfied by every vector in V

ˆ Closer Conditions

C1 it is closed under vector addition. i.e., x + y ∈ V ; for all x, y ∈ V .

C2 it is closed under scalar multiplication i.e., α x ∈ V , for every α ∈ R and x ∈ V .

ˆ Addition Axioms

A1 x + y = y + x.



A2 x + y + z = x + y + z.

A3 there is an object 0 in V , called as zero vector, such that x + 0 = x for all x ∈ V .

A4 for every x ∈ V , there is an object −x ∈ V , called as negative of x such that

x + (−x) = 0.

ˆ Scalar Multiplication Axioms

M1 α x + y = α x + α y.

M2 (α1 + α2 ) x = α1 x + α2 x.

M3 α1 (α2 x) = (α1 α2 ) x.

M4 1 x = x.

Example 3.3

1. Show that a set of vectors {x = (x1 , x2 ) ; xi ∈ R, i = 1, 2} is vector space in R2 .

©: These Lecture notes are copyright of Alok D. Dabade 4

 x1 x2 x3
2. The set of all ordered triplets (x1 , x2 , x3 ) of real numbers such that = =
3 4 2
forms a vector space.

Note:
Vector space is a linear structure so also called as linear vector space.

©: These Lecture notes are copyright of Alok D. Dabade 5