Chapter: 02

Topics Related To R.C Matrices

32
What You Will Learn in this Chapter?

• Insightful reading of the content of this unit will enhance students to understand the
basic notion to construct R.C matrices of different classes.
• In addition to the above feature the students will be motivated to understand graphs of
the corresponding row and column vector which are orthogonal to each other.

Pre requisites:

• Vector space of matrices of order × , ( , +,∙) with standard matrix addition ‘+’
and scalar multiplication ‘∙’
• Standard binary operations in complex number system.
• Solution of system of non-linear equations with ‘ ’variables.

2.1 Introduction:

This chapter is allocated to development and construction of R.C matrices. Just to

extend the notion to generalization up to × , we have begun from the R.C matrices of

order 2x2 and gradually extended to the higher order. The vectors which are orthogonal pair-

wise show orthogonal lines in two and three dimensions. It is known that their addition in

vector convention is a diagonal vector and considering this as an axis and each one of the

perpendicular vector as generator revolving about the axis gives rise to a solid structure. As a

result each set will give rise to two different structures and as a whole we get either four or six

structures as the case may be of 2 × 2 3 × 3 type R.C matrix. These concepts are

explained and well cited by numerous examples.

33
2.2 Algebraic Construction of R.C Matrix of order n=2

This segment relies upon the most ideal approach to collect various R.C matrices when its
principal diagonals are known.

Theorem 1: Absolute value of leading diagonal elements of a R.C matrix of order n=2
are identical and off diagonal entries are opposite in sign.

Proof: Let us consider a member of set JJ (2), with real passages, as underneath,

P=

Because of R.C property, we have,

∙ =0⟹ + =0 ..(1)
∙ =0⟹ + =0 ..(2)

Conditions (1) and (2) are possible only if,

= =− ..(3)

∴ | | = | !|

This fact reforms R.C matrix P as,

#!
"= $ ;| | = | ! | and entries $! , #! are opposite in sign.
! !

With this result we now focus on possibilities of choice of entries , % according to

condition (3).To construct a R.C matrix with all real entries it is necessary to consider
% opposite in sign to avoid complex possibilities of .

Finally, we can conclude that in any real valued R.C matrix of order n=2, diagonal entries are
with identical absolute value and off diagonal entries are opposite in nature.

Now to extend this observation on Complex field we assume following R.C matrix with
complex entries,

34
 +' +'
P=& *
(+' ( )+' )

Being R.C matrix it will satisfy following conditions,

∙ = ⟹ ( +' ) +( ( + ' ( )( +' )=

⟹ +, ∙ -=0 %., ∙ -=0
⟹ ,( ) − ( ) + ( ( − ( )- =0 and
,2 +( ( − ( )- =0 ...(5)

∙ = ⟹ ( ) + ' )) + ( ( + ' ( )( +' )=

⟹ +, ∙ -=0 %., ∙ -=0
⟹ ,( )) − ( )) + ( ( − ( )- =0 and
,2 ) ) +( ( − ( )- =0 ...(6)
Conditions (5) and (6) gives,
( ) −( ) =( )) − ( )) and = ) )

We deduce that development of R.C matrix of order n=2, with real passages, is feasible for
assumed diagonal entries. This raises the reasonable probability that for every real entry (later
on we can stretch out this to a complex field likewise) there are infinitely many R.C matrices.

For instance on the off chance that we settle principal diagonal passage = 1 then by (3),
− = 1. Presently if we select = −1 and = 1 then one out of infinitely many
results is,
1 −1
P=
1 1

2.3 Graphical construction of R.C Matrix of order n=2

To understand graphical construction of R.C matrix with real entries and order n=2 let us start
with following matrix,

P=

Applying result of Theorem 1 we are selecting = , as a particular case.

P=

35
Then R.C condition results in,

=− ..(1)

By convection we denote cross term = 1; ( 1 is a real number) then in view of

34 56 7 we can imagine it as, 89 = 1 or 8 = 1 , which is a rectangular hyperbola or
straight lines by nature. Now, condition (1) can be rewritten as,

=− = 1 i.e.89 = 1 or 8 = 1 ..(2)

For a real positive value of A we can construct a R.C matrix in following ways,

2.3.1 Construction of R.C matrix of order n=2 considering a

rectangular hyperbola.

Equation (2) results into, − = 1; A is positive real number.

In particular if we assume 1 = 1 then by equation (2),− =1

To figure out this possibility we are considering this case in 34 − 56 7 as,89 = −1

Figure 2.3.1: Rectangular Hyperbola 89 = −1 with a random point (1,-1) to construct R.C
matrix of order n=2

With selection of a random point (1, −1) on rectangular hyperbola 89 = −1 to consider a

particular values of = 1 and = −1, so − = 1.Which turns condition (2) into,

36
 =1⇒ = ±1, with these choices we derive R.C matrix of order n=2 as follows,
1 1 −1 1
< = and < =
−1 1 −1 −1
If we move our point on rectangular hyperbola 89 = −1 from (1, −1) to (2, −0.5) ,

Figure 2.3.2: Rectangular Hyperbola 89 = −1 with a random point (2,-0.5) in place of (1,-1)

Then particular values of =2 % = −0.5 = − , so − = 1.Which turns condition

(2) into, =1⇒ = ±1,with theses choices we derive R.C matrix of order n=2 as
follows,

1 − −1 −
< => ? and < = > ?
2 1 2 −1

This provides a graphical design to construct a R.C matrix of order n=2 if variable A is fixed
in condition (2).As the selection of this variable A was at random, we can find such infinitely
many R.C matrices corresponding to each positive Real number.

2.3.2 Construction of R.C matrix of order n=2 considering a pair

of parallel straight lines.

Equation (2) results into, = 1; A is positive real number.

In particular if we assume 1 = 4 then by equation (2), =4⇒ = ±2

37
To figure out this possibility we are considering this case in 34 − 56 7 as, a pair of parallel
straight lines, 8 = ±2

Figure 2.3.3: Pair of Parallel straight lines 8 = 2 and 8 = −2 to construct R.C matrix of order
n=2

If value of = −2 then by condition (2), − = = 4 .We can select entries

= −4 % = 1 as a special case. These particulars will reform matrix P as,

−2 −4
P=
1 −2
2.4 Algebraic Construction of R.C Matrix of order n=3 and
constraints.

This piece of section depends on the best way to build infinitely many R.C matrices when its
principal diagonal elements are known. Presently let us consider a member of set JJ (3), with
real entries, as beneath,

P=A B
% %

Because of R.C property, we have,

∙ =0⟹ + + % =0

38
 ∙ =0⟹ + + % =0
( ∙ ( =0⟹ % + % + =0

By conviction we are accepting cross terms by factors written off as as follows,

1= ,C = % , and = %

This thusly enables us to rework,

∙ =0⟹ +1 +C =0
∙ =0⟹ 1 + + =0
( ∙ ( =0⟹ C + + =0

To clarify this arrangement of nonlinear simultaneous conditions regarding , , and ,

considering 1, C, and as variables ,

1
1= =,− − + - . . (1)
2
1
C= % = ,− + − - . . (2)
2
1
= % = ,+ − − - . . (3)
2

In this way, every Real component of set JJ(3) can be built by accepting its principal diagonal
entries , and . Likewise, arrangement demonstrates that there exist infinite answers for
each choice of principal diagonal entries.

For example, let us take = 1, = 2 and = 3 in matrix,

P=A B
% %

Then by equations (1), (2), and (3), we can find A, B, and C as follows.
1
A= = ,−(1) − (4) + (9) - = 2
2
1
B = % = ,−(1) + (4) − (9) - = (−3)
2
1
C = % = ,+(1) − (4) − (9) - = (−6)
2
From these infinite choices of A, B, and C let us consider following mixes,

39
A= =2 with = 1& = 2
B= % = (−3) with = (−1) & % = 3
C= % = (−6) with = (−1) & % = 6

This decision of off diagonals will deliver following framework of R.C Matrix,

1 1 −1
P=A B = A2 2 −1B
% % 3 6 3

2.5 Graphical construction of R.C Matrix of order n=3 and

constrains.

2.5.1 Graphical Construction:

We proceed on the same lines to a finer resolution. We start with a matrix possessing R.C
property and all real entries for the purpose. The general form of the R.C matrix on hand is,

P=A B
% %

As an inbuilt property of R.C matrix we have three simultaneous equations in nine variables
which are,

∙ =0⟹ + + % =0
∙ =0⟹ + + % =0
( ∙ ( =0⟹ % + % + =0

Let us denote, 1 = ,C = % and = % with A, B and C not all zero at a time[ i.e.
A + B + C ≠ 0. In the case violating above condition we have a null matrix-a special
case of R.C matrix]From equations (1), (2), and (3) in terms of above mentioned
replacements, we have,

= ±O−(1 + C) ..(1)

= ±O−(1 + ) ..(2)
= ±O−(C + ) ..(3)

40
 Again it’s significant that A = a b for predetermined real values throws an infinite
choice for variety of values of a and b .Analogous arguments for B and C continue for
choices of variables a , d , b and d .

We now focus on the previous contention 1 = where An a real number permits

≠ 0 we have =
T
UV
infinitely many mixes for and .For any assumed A and given

and this incident when translated graphically lead to a rectangular hyperbola.

Finishing up on the parallel thinking for every single one of B and C likewise we have
a rectangular hyperbola. This conveys the message that each one of R.C matrix is presentation of
one point on each rectangular hyperbola.

In this manner a R.C matrix plans an arrangement of three comparing rectangular

hyperbolas.

The notable fact is that once the rectangular hyperbolas and its conditions are framed
from a given 'R.C' matrix we can, utilizing the conditions of these rectangular hyperbolas,
build infinite 'R.C' matrices.

We derive the converse to the above fact without loss of generality. It is claimed that if we
assume three different real constants; say W, X, and Y which relate to three diverse rectangular
hyperbolic graphs 89 = ; is a real constant; [in this case each of real constant W, X, and Y
] then for each match of point like (x, y) on each one of the rectangular hyperbola, we need to
had three sets of points (x, y) fulfilling the conditions and which in turn are solvable for
infinite values. [Say for a settled W , we have ( )Z ( )Z = W for various values of ' ∈ ℕ
and(% )Z ( )Z = X and(% )Z ( )Z = Y ] These values in accordance with conditions (1), (2),
and (3) give the real entries of 'R.C' matrix and such are infinite in number.

Without leaning into rigor of the subject on hand, we satisfy by exemplifying a numerical.

In the occurrence that given three rectangular hyperbolas in 34 56 7 are,

89 = W , 89 = X, and 89 = Y.

For development of a member from set JJ(3), let us consider these rectangular hyperbolas as,

1= = W i. e. 89 = W ..(4)

41
C= % = X i. e. 89 = X ..(5)
= % = Y i. e. 89 = Y ..(6)

In the event that we select focuses on these rectangular hyperbolas indiscriminately as

(1, W), (1, X) % (1, Y)individually. For purpose of simplicity let us accept,

=W& =1
=X&% =1
=Y&% =1

We would now be able to develop an individual from JJ (3) as,

W X
P=A B = A1 YB
% % 1 1

In perspective of conditions (1) to (6) this matrix fulfils R.C property as,

R ∙C = ( ) +W+X = 0
R ∙ C = α + (c ) + γ = 0
R ( ∙ C( = X + Y + ( ) = 0
This provides one of the infinitely many choices of R.C framework with given hyperbolas.
In a particular case if given three rectangular hyperbolas are,

89 = W = 2, 89 = X = −3, and 89 = Y = −6.

For construction of member of JJ (3) let us consider these rectangular hyperbolas as,

1= = 2 i.e. 89 = W = 2
C= % = −3 i.e. 89 = X = −3
= % = −6 i.e. 89 = Y = −6

If we select estimations of concentrates erratically from above rectangular hyperbolas as

(1, 2), (1, - 3) and (1,- 6) independently. For ease let us select estimations of elements as
= 1, = 2, = 1 , % = −3 , = 1 and % = −6 . As appeared in Figure 2.5.1
underneath,

42
Figure 2.5.1: Rectangular Hyperbolas 89 = 2, 89 = −3 and 89 = −6 to construct a R.C
matrix of order =3

In turn it gives a way to construct a member of JJ (3) as,

2 −3
P=A B = A1 −6B
% % 1 1
This satisfies R.C property as,

∙ =0⟹ + + % =0⟹ = O−( + % )⟹ = ±1

∙ =0⟹ + + % =0⟹ = O−( + % )⟹ = ±2

( ∙ ( =0⟹ % + % + =0⟹ = O−( % + % )⟹ = ±3

Finally we can build, on utilizing the information got from three rectangular hyperbolas,
2( = 8 distinct R.C matrices. They are considered from the given root matrix P and appeared
as takes after.

1 2 −3 1 2 −3 1 2 −3 1 2 −3
< = A1 2 −6B < = A1 −2 −6B <( = A1 2 −6B <) = A1 −2 −6B
1 1 3 1 1 3 1 1 −3 1 1 −3
−1 2 −3 −1 2 −3 −1 2 −3 −1 2 −3
<c = A 1 2 −6B <d = A 1 2 −6B <e = A 1 −2 −6B <f = A 1 −2 −6B
1 1 3 1 1 −3 1 1 3 1 1 −3

[These all matrices observe R.C property.]

43
2.5.2 constrains

Let us discuss various possibilities of rectangular hyperbolas in the view of conditions (1), (2)
and (3) to construct R.C matrix with real entries,

Case-1: All three rectangular hyperbolas are negative.

Here we have 1 < 0, C < 0 and < 0.

So, (1 + C) < 0, (1 + ) < 0 and (C + ) < 0 .

Equivalently we can say that , % are real valued and can be used to construct a R.C
matrix. For example, 89 = −1, 89 = −5 and 89 = −10 as in figure 2.5.2 as below

Figure 2.5.2: Rectangular Hyperbolas 89 = −1, 89 = −5 and 89 = −10 to construct a R.C

matrix of order =3
√6 −1 −5
A = h 1 √11 −10j
1 1 √15
Case-2: Any two rectangular hyperbolas are negative (i.e. k > 0, m < 0 nop q < 0 )
and |k| < |m| ; |k| < |q|.

In this case (1 + C) < 0( ∵ |1| < |C| % C < 0), (1 + ) < 0( ∵ |1| < | | % < 0)
and (C + ) < 0 ( ∵ <0 % C < 0)

Which implies that , % are real valued .This choice of , % can be extended
to construct R.C Matrix with all real entries. For example if we select rectangular hyperbolas
89 = 2, 89 = −3 and 89 = −6 as shown below in figure 2.5.3,

44
Figure 2.5.3: Rectangular Hyperbolas 89 = 2, 89 = −6 and 89 = −3 to construct a R.C
matrix of order =3
1 2 −3
1 = A1 2 −6B
1 1 3
Case-3: Any one of three rectangular hyperbolas is negative
(i.e. k > 0, m > 0 nop q < 0)

Here (1 + C) > 0 gives that is complex valued. Means we can’t construct R.C matrix with
all real entries if one hyperbola is negative.

Case-4: All hyperbolas are positive i.e.k > 0, m > 0 nop q > 0

Here (1 + C) > 0, (1 + ) > 0 and (C + ) > 0 equivalently we can say that

, % is complex valued. So we can’t construct R.C matrix with all real entries if one
hyperbola is negative.

From all of above cases we can derive that R.C matrix can be worked from three rectangular
hyperbolas gave something like two of them are negative regarded

2.6 R.C Matrix of order n=3 and Cones.

In this discussion we consider the geometrical significance of our essential framework

fulfilling "R.C Property" [i.e. Z ∙ Z = 0 for ' = 1,2,3.]

1 2 −3
Let us fix a R.C matrix, 1 = A1 2 −6B
1 1 3

45
 As, sssst ⊥ sssst, we have in (
space, two vectors which are orthogonal to each other and in
general | Z | ≠ | Z | ,we get two vectors sssst and sssst showing two perpendicular line
segmentswhich in turn can be extended to the construction of a rectangle with origin as co-
terminus point of sssst and sssst.With this fact we can construct one of its diagonal as ssssssssssssssst
+

Figure 2.6.1: Rectangle of and

ssssst and sssst = vC

As shown in the above figure 2.6.1, sssst = v1 ssssst = v1
ssssst and hence v ssssst as
ssssst + 1
ssssst ∥ 1
vC ssssst now we are equipped with what we want to convey. We have two cases.

ssssst as the axis and follow the vector v1

Case - I: If we consider v ssssst to rotate along, we get a
conical structure[16] as shown in figure 2.6.2.

46
Figure 2.6.2: Circular cone observed by rotation of ssssst
w.r.t. Diagonal v

Case - II: In the same line, rotating vC ssssst alongv

ssssst , we get another conical structure. As it
corresponds to sssst and sssst, we call these two canonical structures as the first companion
canonical structure .As shown in figure-2.6.3

Figure 2.6.3 Circular cone observed by rotation of and ssssst

w.r.t. Diagonal v

corresponding to sssst and sssst, as the second companion canonical structure

Continuing efforts in the same direction we have two more sets of canonical structures

sssst( and sssst( ,as the third companion canonical structure

along with
( .As shown in figure-2.6.4,

47
 Z and ' w.r.t. its Diagonals for
' = 1,2 & 3.
Figure 2.6.4: Circular cones observed by rotation of

Thus, we have led to conclusion from the defining properties that the R.C matrix with real
entries permits us to perceive the underlying matrix as a set of 3 pairs of companion cones as

48