REDUCTION OF A BILINEAR FORM TO A CANONICAL FORM
In a note in the Bulletin of the Polish Academy of Sciences, from 1957, M. Altman [1] gave a generalization of Jacobi's method for bilinear forms. We take the liberty of pointing out that we presented at the first scientific session of the Society of Mathematical and Physical Sciences of the RPR, in 1955 [2], a paper containing as a particular case the reduction of a bilinear form to a canonical form. In this note we give another method for obtaining the canonical form.
Let us consider the bilinear form
(1)
F
=
∑
i
,
n
=
1
n
a
i
,
k
x
i
and
k
(1)
F
=
∑
i
,
n
=
1
n
 
a
i
,
k
x
i
and
k
{:(1)Phi=sum_(i,n=1)^(n)a_(i,k)x_(i)y_(k):} (1) F = ∑ i , n = 1 n a i , k x i and k
and either
(2)
X
k
=
∑
j
=
1
n
a
j
,
k
x
j
,
AND
i
=
∑
j
=
1
n
a
i
,
j
and
j
(2)
X
k
=
∑
j
=
1
n
 
a
j
,
k
x
j
,
AND
i
=
∑
j
=
1
n
 
a
i
,
j
and
j
{:(2)X_(k)=sum_(j=1)^(n)a_(j,k)x_(j)","quadY_(i)=sum_(j=1)^(n)a_(i,j)y_(j):} (2) X k = ∑ j = 1 n a j , k x j , AND i = ∑ j = 1 n a i , j and j
where
i
,
k
=
1
,
2
,
…
,
n
i
,
k
=
1
,
2
,
…
,
n
i,k=1,2,dots,n i , k = 1 , 2 , … , n .
Either
r
r
r r matrix rank
‖
a
i
k
‖
1
n
‖
a
i
k
‖
1
n
||a_(ik)||_(1)^(n) ‖ a i k ‖ 1 n and suppose that the notations were chosen so that the determinants
(3)
D
h
=
|
a
11
…
a
1
h
⋅
…
⋅
a
h
1
…
a
h
h
|
(3)
D
h
=
|
a
11
…
a
1
h
⋅
…
⋅
a
h
1
…
a
h
h
|
{:(3)Delta_(h)=|{:[a_(11),dots,a_(1h)],[*,dots,*],[a_(h1),dots,a_(hh)]:}|:} (3) D h = | a 11 … a 1 h ⋅ … ⋅ a h 1 … a h h |
not be null, which is always possible, where
h
=
1
,
2
,
…
,
r
h
=
1
,
2
,
…
,
r
h=1,2,dots,r h = 1 , 2 , … , r .
In this case it is demonstrated that
(4)
F
=
−
1
D
r
|
a
11
…
a
1
r
AND
1
⋅
⋅
⋅
⋅
⋅
⋅
a
r
1
…
a
r
r
AND
r
X
1
…
X
r
0
(4)
F
=
−
1
D
r
|
a
11
…
a
1
r
AND
1
⋅
⋅
⋅
⋅
⋅
⋅
a
r
1
…
a
r
r
AND
r
X
1
…
X
r
0
{:(4)Phi=(-1)/(Delta_(r))|{:[a_(11),dots,a_(1r),Y_(1)],[*,,*,*],[*,,*,*],[a_(r1),dots,a_(rr),Y_(r)],[X_(1),dots,X_(r),0]:}:} (4) F = − 1 D r | a 11 … a 1 r AND 1 ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ a r 1 … a r r AND r X 1 … X r 0
Applying Gauss' algorithm (see [3]) to solve the linear equations (2) in
and
k
and
k
y_(k) and k and
x
i
x
i
x_(i) x i , these equations can be written in the form
a
11
and
1
+
a
12
and
2
+
…
+
a
1
n
and
n
=
AND
1
a
22
(
1
)
and
2
+
…
+
a
2
n
(
1
)
and
n
=
AND
2
(
1
)
a
n
2
(
1
)
and
2
+
…
+
a
n
n
(
1
)
and
n
=
AND
n
(
1
)
a
11
x
1
+
a
21
x
2
+
…
+
a
n
1
x
n
=
X
1
a
22
(
1
)
x
2
+
…
+
a
n
2
(
1
)
x
n
=
X
2
(
1
)
a
2
n
(
1
)
x
2
+
…
+
a
n
n
(
1
)
x
n
=
X
n
(
1
)
a
11
and
1
+
a
12
and
2
+
…
+
a
1
n
and
n
=
AND
1
a
22
(
1
)
and
2
+
…
+
a
2
n
(
1
)
and
n
=
AND
2
(
1
)
a
n
2
(
1
)
and
2
+
…
+
a
n
n
(
1
)
and
n
=
AND
n
(
1
)
a
11
x
1
+
a
21
x
2
+
…
+
a
n
1
x
n
=
X
1
a
22
(
1
)
x
2
+
…
+
a
n
2
(
1
)
x
n
=
X
2
(
1
)
a
2
n
(
1
)
x
2
+
…
+
a
n
n
(
1
)
x
n
=
X
n
(
1
)
{:[a_(11)y_(1)+a_(12)y_(2)+dots+a_(1n)y_(n)=Y_(1)],[a_(22)^((1))y_(2)+dots+a_(2n)^((1))y_(n)=Y_(2)^((1))],[a_(n2)^((1))y_(2)+dots+a_(nn)^((1))y_(n)=Y_(n)^((1))],[a_(11)x_(1)+a_(21)x_(2)+dots+a_(n1)x_(n)=X_(1)],[a_(22)^((1))x_(2)+dots+a_(n2)^((1))x_(n)=X_(2)^((1))],[a_(2n)^((1))x_(2)+dots+a_(nn)^((1))x_(n)=X_(n)^((1))]:} a 11 and 1 + a 12 and 2 + … + a 1 n and n = AND 1 a 22 ( 1 ) and 2 + … + a 2 n ( 1 ) and n = AND 2 ( 1 ) a n 2 ( 1 ) and 2 + … + a n n ( 1 ) and n = AND n ( 1 ) a 11 x 1 + a 21 x 2 + … + a n 1 x n = X 1 a 22 ( 1 ) x 2 + … + a n 2 ( 1 ) x n = X 2 ( 1 ) a 2 n ( 1 ) x 2 + … + a n n ( 1 ) x n = X n ( 1 )
and
a
i
k
(
1
)
=
|
a
11
a
1
k
a
i
1
a
1
k
|
D
1
,
X
k
(
1
)
=
|
a
11
a
1
k
X
1
X
k
|
D
1
,
AND
i
(
1
)
=
|
a
11
AND
1
a
i
1
AND
i
|
D
1
a
i
k
(
1
)
=
|
a
11
a
1
k
a
i
1
a
1
k
|
D
1
,
X
k
(
1
)
=
|
a
11
a
1
k
X
1
X
k
|
D
1
,
AND
i
(
1
)
=
|
a
11
AND
1
a
i
1
AND
i
|
D
1
a_(ik)^((1))=((|{:[a_(11)a_(1k)],[a_(i1)a_(1k)]:}|))/(Delta_(1)),quadX_(k)^((1))=((|{:[a_(11)a_(1k)],[X_(1)X_(k)]:}|))/(Delta_(1)),quadY_(i)^((1))=((|{:[a_(11)Y_(1)],[a_(i1)Y_(i)]:}|))/(Delta_(1)) a i k ( 1 ) = | a 11 a 1 k a i 1 a 1 k | D 1 , X k ( 1 ) = | a 11 a 1 k X 1 X k | D 1 , AND i ( 1 ) = | a 11 AND 1 a i 1 AND i | D 1
where
It is then demonstrated that
F
=
−
1
D
r
|
a
11
0
…
0
AND
1
0
a
22
(
1
)
…
a
2
r
(
1
)
AND
2
(
1
)
⋅
⋅
…
⋅
⋅
0
a
r
2
(
1
)
…
a
r
r
(
1
)
AND
r
(
1
)
X
1
X
2
(
1
)
…
X
r
(
1
)
0
|
F
=
−
1
D
r
|
a
11
0
…
0
AND
1
0
a
22
(
1
)
…
a
2
r
(
1
)
AND
2
(
1
)
⋅
⋅
…
⋅
⋅
0
a
r
2
(
1
)
…
a
r
r
(
1
)
AND
r
(
1
)
X
1
X
2
(
1
)
…
X
r
(
1
)
0
|
Phi=(-1)/(Delta_(r))|{:[a_(11),0,dots,0,Y_(1)],[0,a_(22)^((1)),dots,a_(2r)^((1)),Y_(2)^((1))],[*,*,dots,*,*],[0,a_(r2)^((1)),dots,a_(rr)^((1)),Y_(r)^((1))],[X_(1),X_(2)^((1)),dots,X_(r)^((1)),0]:}| F = − 1 D r | a 11 0 … 0 AND 1 0 a 22 ( 1 ) … a 2 r ( 1 ) AND 2 ( 1 ) ⋅ ⋅ … ⋅ ⋅ 0 a r 2 ( 1 ) … a r r ( 1 ) AND r ( 1 ) X 1 X 2 ( 1 ) … X r ( 1 ) 0 |
Continuing Gauss' algorithm, we arrive at the identity
F
=
−
1
D
r
|
a
11
0
0
…
0
AND
1
0
a
22
(
1
)
0
…
0
AND
2
(
1
)
0
0
a
33
(
2
)
…
0
AND
3
(
2
)
…
…
…
…
…
.
|
F
=
−
1
D
r
|
a
11
0
0
…
0
AND
1
0
a
22
(
1
)
0
…
0
AND
2
(
1
)
0
0
a
33
(
2
)
…
0
AND
3
(
2
)
…
…
…
…
…
.
|
Phi=(-1)/(Delta_(r))|{:[a_(11),0,0,dots,0,Y_(1)],[0,a_(22)^((1)),0,dots,0,Y_(2)^((1))],[0,0,a_(33)^((2)),dots,0,Y_(3)^((2))],[dots,dots,dots,dots,dots,.]:}| F = − 1 D r | a 11 0 0 … 0 AND 1 0 a 22 ( 1 ) 0 … 0 AND 2 ( 1 ) 0 0 a 33 ( 2 ) … 0 AND 3 ( 2 ) … … … … … . |
where
AND
h
(
h
−
1
)
AND
h
(
h
−
1
)
Y_(h)^((h-1)) AND h ( h − 1 ) and
X
h
(
h
−
1
)
X
h
(
h
−
1
)
X_(h)^((h-1)) X h ( h − 1 ) are the second members of the linear equations
a
11
and
1
+
a
12
and
2
+
…
+
a
1
n
and
n
=
AND
1
a
22
(
1
)
and
2
+
…
+
a
2
n
(
1
)
and
n
=
AND
2
(
1
)
a
r
r
(
r
−
1
)
and
r
+
…
+
a
r
n
(
r
−
1
)
and
n
=
AND
r
(
r
−
1
)
a
11
x
1
+
a
21
x
2
+
…
+
a
n
1
x
n
=
X
1
a
22
(
1
)
x
2
+
…
+
a
n
2
(
1
)
x
n
=
X
2
(
1
)
a
r
r
(
r
−
1
)
x
r
+
…
+
a
n
r
(
r
−
1
)
x
n
=
X
r
(
r
−
1
)
a
11
and
1
+
a
12
and
2
+
…
+
a
1
n
and
n
=
AND
1
a
22
(
1
)
and
2
+
…
+
a
2
n
(
1
)
and
n
=
AND
2
(
1
)
a
r
r
(
r
−
1
)
and
r
+
…
+
a
r
n
(
r
−
1
)
and
n
=
AND
r
(
r
−
1
)
a
11
x
1
+
a
21
x
2
+
…
+
a
n
1
x
n
=
X
1
a
22
(
1
)
x
2
+
…
+
a
n
2
(
1
)
x
n
=
X
2
(
1
)
a
r
r
(
r
−
1
)
x
r
+
…
+
a
n
r
(
r
−
1
)
x
n
=
X
r
(
r
−
1
)
{:[a_(11)y_(1)+a_(12)y_(2)+dots+a_(1n)y_(n)=Y_(1)],[a_(22)^((1))y_(2)+dots+a_(2n)^((1))y_(n)=Y_(2)^((1))],[a_(rr)^((r-1))y_(r)+dots+a_(rn)^((r-1))y_(n)=Y_(r)^((r-1))],[a_(11)x_(1)+a_(21)x_(2)+dots+a_(n1)x_(n)=X_(1)],[a_(22)^((1))x_(2)+dots+a_(n2)^((1))x_(n)=X_(2)^((1))],[a_(rr)^((r-1))x_(r)+dots+a_(nr)^((r-1))x_(n)=X_(r)^((r-1))]:} a 11 and 1 + a 12 and 2 + … + a 1 n and n = AND 1 a 22 ( 1 ) and 2 + … + a 2 n ( 1 ) and n = AND 2 ( 1 ) a r r ( r − 1 ) and r + … + a r n ( r − 1 ) and n = AND r ( r − 1 ) a 11 x 1 + a 21 x 2 + … + a n 1 x n = X 1 a 22 ( 1 ) x 2 + … + a n 2 ( 1 ) x n = X 2 ( 1 ) a r r ( r − 1 ) x r + … + a n r ( r − 1 ) x n = X r ( r − 1 )
and
Gauss's.
obtained by Gauss's algorithm.
It is shown that
(6)
X
k
(
k
−
1
)
=
P
k
(
x
)
Δ
k
,
Y
i
(
i
−
1
)
=
Q
i
(
x
)
Δ
i
,
a
h
h
(
h
−
1
)
=
Δ
h
Δ
h
−
1
(6)
X
k
(
k
−
1
)
=
P
k
(
x
)
Δ
k
,
Y
i
(
i
−
1
)
=
Q
i
(
x
)
Δ
i
,
a
h
h
(
h
−
1
)
=
Δ
h
Δ
h
−
1
{:(6)X_(k)^((k-1))=(P_(k)(x))/(Delta_(k))","quadY_(i)^((i-1))=(Q_(i)(x))/(Delta_(i))","quada_(hh)^((h-1))=(Delta_(h))/(Delta_(h-1)):} (6) X k ( k − 1 ) = P k ( x ) D k , AND i ( i − 1 ) = Q i ( x ) D i , a h h ( h − 1 ) = D h D h − 1
where
(7)
P
k
(
x
)
=
|
a
11
…
a
1
k
⋅
…
⋅
a
k
−
1
,
1
…
a
k
−
1
,
k
X
1
…
X
k
|
,
Q
i
(
y
)
=
|
a
11
…
a
1
,
i
−
1
Y
1
⋅
⋅
⋅
⋅
a
i
1
…
a
i
,
i
−
1
Y
i
|
(7)
P
k
(
x
)
=
|
a
11
…
a
1
k
⋅
…
⋅
a
k
−
1
,
1
…
a
k
−
1
,
k
X
1
…
X
k
|
,
Q
i
(
y
)
=
|
a
11
…
a
1
,
i
−
1
Y
1
⋅
⋅
⋅
⋅
a
i
1
…
a
i
,
i
−
1
Y
i
|
{:(7)P_(k)(x)=|{:[a_(11),dots,a_(1k)],[*,dots,*],[a_(k-1,1),dots,a_(k-1,k)],[X_(1),dots,X_(k)]:}|","quadQ_(i)(y)=|{:[a_(11),dots,a_(1,i-1)Y_(1)],[*,,*],[*,,*],[a_(i1),dots,a_(i,i-1)Y_(i)]:}|:} (7) P k ( x ) = | a 11 … a 1 k ⋅ … ⋅ a k − 1 , 1 … a k − 1 , k X 1 … X k | , Q i ( and ) = | a 11 … a 1 , i − 1 AND 1 ⋅ ⋅ ⋅ ⋅ a i 1 … a i , i − 1 AND i |
Expanding the determinant from identity (5), we obtain the canonical form of the bilinear form (1)
Φ
=
X
1
Y
1
a
11
+
X
2
(
1
)
Y
2
(
1
)
a
22
(
1
)
+
…
+
X
r
(
r
−
1
)
Y
r
(
r
−
1
)
a
r
r
(
r
−
1
)
Φ
=
X
1
Y
1
a
11
+
X
2
(
1
)
Y
2
(
1
)
a
22
(
1
)
+
…
+
X
r
(
r
−
1
)
Y
r
(
r
−
1
)
a
r
r
(
r
−
1
)
Phi=(X_(1)Y_(1))/(a_(11))+(X_(2)^((1))Y_(2)^((1)))/(a_(22)^((1)))+dots+(X_(r)^((r-1))Y_(r)^((r-1)))/(a_(rr)^((r-1))) F = X 1 AND 1 a 11 + X 2 ( 1 ) AND 2 ( 1 ) a 22 ( 1 ) + … + X r ( r − 1 ) AND r ( r − 1 ) a r r ( r − 1 )
which with the help of formulas (6) and (7) is written in the definitive form
(8)
Φ
=
P
1
(
x
)
Q
1
(
y
)
Δ
0
Δ
1
+
P
2
(
x
)
Q
2
(
y
)
Δ
1
Δ
2
+
…
+
P
r
(
x
)
Q
r
(
y
)
Δ
r
−
1
Δ
r
.
(8)
Φ
=
P
1
(
x
)
Q
1
(
y
)
Δ
0
Δ
1
+
P
2
(
x
)
Q
2
(
y
)
Δ
1
Δ
2
+
…
+
P
r
(
x
)
Q
r
(
y
)
Δ
r
−
1
Δ
r
.
{:(8)Phi=(P_(1)(x)Q_(1)(y))/(Delta_(0)Delta_(1))+(P_(2)(x)Q_(2)(y))/(Delta_(1)Delta_(2))+dots+(P_(r)(x)Q_(r)(y))/(Delta_(r-1)Delta_(r)).:} (8) F = P 1 ( x ) Q 1 ( and ) D 0 D 1 + P 2 ( x ) Q 2 ( and ) D 1 D 2 + … + P r ( x ) Q r ( and ) D r − 1 D r .
It is easy to see that
P
k
(
x
)
P
k
(
x
)
P_(k)(x) P k ( x ) it does not depend on
x
1
,
x
2
,
…
,
x
k
−
1
x
1
,
x
2
,
…
,
x
k
−
1
x_(1),x_(2),dots,x_(k-1) x 1 , x 2 , … , x k − 1 , that
Q
i
(
y
)
Q
i
(
y
)
Q_(i)(y) Q i ( and ) it does not depend on
y
1
,
y
2
,
…
,
y
i
−
1
y
1
,
y
2
,
…
,
y
i
−
1
y_(1),y_(2),dots,y_(i-1) and 1 , and 2 , … , and i − 1 and that
D
(
P
1
,
…
,
P
r
)
D
(
x
1
,
…
,
x
r
)
=
D
(
Q
1
,
…
,
Q
r
)
D
(
y
1
,
…
,
y
r
)
=
Δ
1
Δ
2
…
Δ
r
≠
0
,
D
(
P
1
,
…
,
P
r
)
D
(
x
1
,
…
,
x
r
)
=
D
(
Q
1
,
…
,
Q
r
)
D
(
y
1
,
…
,
y
r
)
=
Δ
1
Δ
2
…
Δ
r
≠
0
,
(D((P_(1),dots,P_(r))))/(D((x_(1),dots,x_(r))))=(D((Q_(1),dots,Q_(r))))/(D((y_(1),dots,y_(r))))=Delta_(1)Delta_(2)dotsDelta_(r)!=0, D ( P 1 , … , P r ) D ( x 1 , … , x r ) = D ( Q 1 , … , Q r ) D ( and 1 , … , and r ) = D 1 D 2 … D r ≠ 0 ,
which proves that linear forms
P
k
(
x
)
P
k
(
x
)
P_(k)(x) P k ( x ) and
Q
i
(
y
)
Q
i
(
y
)
Q_(i)(y) Q i ( and ) are linearly independent.
When the bilinear form (1) is symmetric, that is,
a
i
k
=
a
k
i
a
i
k
=
a
k
i
a_(ik)=a_(ki) a i k = a k i , we have
P
i
(
x
)
=
Q
i
(
x
)
P
i
(
x
)
=
Q
i
(
x
)
P_(i)(x)=Q_(i)(x) P i ( x ) = Q i ( x ) and formula (8) becomes
(9)
Φ
=
Q
1
(
x
)
Q
1
(
y
)
Δ
0
Δ
1
+
Q
2
(
x
)
Q
2
(
y
)
Δ
1
Δ
2
+
…
+
Q
r
(
x
)
Q
r
(
y
)
Δ
r
−
1
Δ
r
.
(9)
Φ
=
Q
1
(
x
)
Q
1
(
y
)
Δ
0
Δ
1
+
Q
2
(
x
)
Q
2
(
y
)
Δ
1
Δ
2
+
…
+
Q
r
(
x
)
Q
r
(
y
)
Δ
r
−
1
Δ
r
.
{:(9)Phi=(Q_(1)(x)Q_(1)(y))/(Delta_(0)Delta_(1))+(Q_(2)(x)Q_(2)(y))/(Delta_(1)Delta_(2))+dots+(Q_(r)(x)Q_(r)(y))/(Delta_(r-1)Delta_(r)).:} (9) F = Q 1 ( x ) Q 1 ( and ) D 0 D 1 + Q 2 ( x ) Q 2 ( and ) D 1 D 2 + … + Q r ( x ) Q r ( and ) D r − 1 D r .
In the particular case of quadratic shapes
x
k
=
y
k
x
k
=
y
k
x_(k)=y_(k) x k = and k , the previous formula gives Jacobi's classical formula for decomposing a quadratic form into a sum of squares
(10)
∑
i
,
k
=
1
n
a
i
k
x
i
x
k
=
Q
1
2
(
x
)
Δ
0
Δ
1
+
Q
2
2
(
x
)
Δ
1
Δ
2
+
…
+
Q
r
2
(
x
)
Δ
r
−
1
Δ
r
(10)
∑
i
,
k
=
1
n
 
a
i
k
x
i
x
k
=
Q
1
2
(
x
)
Δ
0
Δ
1
+
Q
2
2
(
x
)
Δ
1
Δ
2
+
…
+
Q
r
2
(
x
)
Δ
r
−
1
Δ
r
{:(10)sum_(i,k=1)^(n)a_(ik)x_(i)x_(k)=(Q_(1)^(2)(x))/(Delta_(0)Delta_(1))+(Q_(2)^(2)(x))/(Delta_(1)Delta_(2))+dots+(Q_(r)^(2)(x))/(Delta_(r-1)Delta_(r)):} (10) ∑ i , k = 1 n a i k x i x k = Q 1 2 ( x ) D 0 D 1 + Q 2 2 ( x ) D 1 D 2 + … + Q r 2 ( x ) D r − 1 D r
If the bilinear form (1) is with complex coefficients and indeterminates and in addition Hermitian, that is
a
i
k
=
a
k
i
―
a
i
k
=
a
k
i
¯
a_(ik)= bar(a_(ki)) a i k = a k i ― , it can be written in the form
Φ
1
=
∑
i
,
k
=
1
n
a
i
k
x
i
―
y
k
.
Φ
1
=
∑
i
,
k
=
1
n
 
a
i
k
x
i
¯
y
k
.
Phi_(1)=sum_(i,k=1)^(n)a_(ik) bar(x_(i))y_(k). F 1 = ∑ i , k = 1 n a i k x i ― and k .
It is shown that in this case we have
P
i
(
x
)
=
Q
i
(
x
)
―
P
i
(
x
)
=
Q
i
(
x
)
¯
P_(i)(x)= bar(Q_(i)(x)) P i ( x ) = Q i ( x ) ―
and the decomposition formula (8) becomes
Φ
1
=
Q
1
―
(
x
)
Q
1
(
y
)
Δ
0
Δ
1
+
Q
2
(
x
)
―
Q
2
(
y
)
Δ
1
Δ
2
+
…
+
Q
r
(
x
)
―
Q
r
(
y
)
Δ
r
−
1
Δ
r
Φ
1
=
Q
1
¯
(
x
)
Q
1
(
y
)
Δ
0
Δ
1
+
Q
2
(
x
)
¯
Q
2
(
y
)
Δ
1
Δ
2
+
…
+
Q
r
(
x
)
¯
Q
r
(
y
)
Δ
r
−
1
Δ
r
Phi_(1)=( bar(Q_(1))(x)Q_(1)(y))/(Delta_(0)Delta_(1))+( bar(Q_(2)(x))Q_(2)(y))/(Delta_(1)Delta_(2))+dots+( bar(Q_(r)(x))Q_(r)(y))/(Delta_(r-1)Delta_(r)) F 1 = Q 1 ― ( x ) Q 1 ( and ) D 0 D 1 + Q 2 ( x ) ― Q 2 ( and ) D 1 D 2 + … + Q r ( x ) ― Q r ( and ) D r − 1 D r
determinants
Δ
i
Δ
i
Delta_(i) D i being real.
When
x
i
=
y
i
x
i
=
y
i
x_(i)=y_(i) x i = and i , the previous formula gives the decomposition of a Hermitian quadratic form into a sum of squares
(11)
∑
i
,
k
=
1
n
a
l
k
x
¯
i
x
k
=
|
Q
1
(
x
)
|
2
Δ
0
Δ
1
+
|
Q
2
(
x
)
|
2
Δ
1
Δ
2
+
…
+
|
Q
r
(
x
)
|
2
Δ
r
−
1
Δ
r
.
(11)
∑
i
,
k
=
1
n
 
a
l
k
x
¯
i
x
k
=
|
Q
1
(
x
)
|
2
Δ
0
Δ
1
+
|
Q
2
(
x
)
|
2
Δ
1
Δ
2
+
…
+
|
Q
r
(
x
)
|
2
Δ
r
−
1
Δ
r
.
{:(11)sum_(i,k=1)^(n)a_(lk) bar(x)_(i)x_(k)=(|Q_(1)(x)|^(2))/(Delta_(0)Delta_(1))+(|Q_(2)(x)|^(2))/(Delta_(1)Delta_(2))+dots+(|Q_(r)(x)|^(2))/(Delta_(r-1)Delta_(r)).:} (11) ∑ i , k = 1 n a l k x ¯ i x k = | Q 1 ( x ) | 2 D 0 D 1 + | Q 2 ( x ) | 2 D 1 D 2 + … + | Q r ( x ) | 2 D r − 1 D r .
BIBLIOGRAPHIC BOOKS
A1tman M., A generalisation of Jacobi's method for bilinear forms. Bull. de l'Acad. Polon. des Sci., 1957, tom. V, p. 99-104.
Ionescu DV, An important identity and the decomposition of a bilinear form into a sum of products. Gazeta matematica și fizica, Series A, 1955, pp. 303-312 (referred to in Reterativnîi Jurnal - Matematika, 1957, ref. no. 1146).
Gantmacher FR, Matrix Theory, Moscow, 1953, vol. II, p. 28 (lithographic transl. from the 1st Russian).
REDUCTION OF BILINEAR FORM TO CANONICAL FORM (Summary)
In a note from the Bulletin of the Polish Academy of Sciences for 1957, M. Altman [1] gave a generalization of Jacoba's method for bilinear forms. At the first scientific session of the PHP Society for Mathematical and Physical Sciences in 1955 [2], a paper was presented containing a special case of reducing a bilinear form to a conical form. This note presents a new method for obtaining the canonical form.
First, identity (5) is proved for the bilinear form (1), which implies the canonical form (8), where
P
(
x
)
,
Q
(
x
)
P
(
x
)
,
Q
(
x
)
P(x),Q(x) P ( x ) , Q ( x ) And
Δ
i
Δ
i
Delta_(i) D i are given by formulas (7) and (3). As a special case, we obtain formula (10), which represents the classical Jacobi decomposition for a quadratic form, as well as formula (11), which represents the decomposition of a Hermitian quadratic form into a sum of squares.
In a note in the Bulletin of the Polish Academy of Sciences, dated 1957, Mr. Altman [1] gave a generalization of Jacobi's method for bilinear forms. I would like to point out that I presented a paper at the first scientific session of the Society of Mathematical and Physical Sciences of the Polish People's Republic (RPR) in 1955 [2], which includes as a special case the reduction of a bilinear form to a canonical form, and in this note I give a summary of the method I used.
We first demonstrate, for the bilinear form (1), the identity (5), from which the canonical form (8) follows, the
P
i
(
x
)
,
Q
i
(
y
)
P
i
(
x
)
,
Q
i
(
y
)
P_(i)(x),Q_(i)(y) P i ( x ) , Q i ( and ) And
Δ
i
Δ
i
Delta_(i) D i given formulas (7) and (3). We obtain as a special case formula (10) which is the classical Jacobi decomposition of the quadratic form and formula (11) which is the decomposition of a Hermitian quadratic form into a sum of squares.