let R be Ring; for n being Nat
for A being invertible Matrix of n,R st ( for B being invertible Matrix of n,R holds A * B = B * A ) holds
ex z being Element of R st
( z in center (UnitGroup R) & A = z * (1. (R,n)) )
let n be Nat; for A being invertible Matrix of n,R st ( for B being invertible Matrix of n,R holds A * B = B * A ) holds
ex z being Element of R st
( z in center (UnitGroup R) & A = z * (1. (R,n)) )
let A be invertible Matrix of n,R; ( ( for B being invertible Matrix of n,R holds A * B = B * A ) implies ex z being Element of R st
( z in center (UnitGroup R) & A = z * (1. (R,n)) ) )
assume A1:
for B being invertible Matrix of n,R holds A * B = B * A
; ex z being Element of R st
( z in center (UnitGroup R) & A = z * (1. (R,n)) )
A2:
for i, j being Nat st i <> j holds
A * (canMat (i,j,n,R)) = (canMat (i,j,n,R)) * A
proof
let i,
j be
Nat;
( i <> j implies A * (canMat (i,j,n,R)) = (canMat (i,j,n,R)) * A )
assume A3:
i <> j
;
A * (canMat (i,j,n,R)) = (canMat (i,j,n,R)) * A
(1. R) * (canMat (i,j,n,R)) = canMat (
i,
j,
n,
R)
;
then
(1. (R,n)) + (canMat (i,j,n,R)) is
invertible Matrix of
n,
R
by A3, Th57;
then
A * ((1. (R,n)) + (canMat (i,j,n,R))) = ((1. (R,n)) + (canMat (i,j,n,R))) * A
by A1;
hence
A * (canMat (i,j,n,R)) = (canMat (i,j,n,R)) * A
by Th59;
verum
end;
A4:
for i, j being Nat st [i,j] in Indices A & i <> j holds
A * (i,j) = 0. R
proof
let i,
j be
Nat;
( [i,j] in Indices A & i <> j implies A * (i,j) = 0. R )
set i2 =
i;
set j2 =
i;
set i0 =
j;
set j0 =
i;
assume A5:
[i,j] in Indices A
;
( not i <> j or A * (i,j) = 0. R )
assume A6:
i <> j
;
A * (i,j) = 0. R
[i,j] in [:(Seg n),(Seg n):]
by A5, MATRIX_0:24;
then A7:
(
i in Seg n &
j in Seg n )
by ZFMISC_1:87;
then
[j,i] in [:(Seg n),(Seg n):]
by ZFMISC_1:87;
then A8:
[j,i] in Indices (canMat (j,i,n,R))
by MATRIX_0:24;
[i,i] in [:(Seg n),(Seg n):]
by A7, ZFMISC_1:87;
then A9:
[i,i] in Indices A
by MATRIX_0:24;
hence A * (
i,
j) =
(A * (canMat (j,i,n,R))) * (
i,
i)
by A8, Th55
.=
((canMat (j,i,n,R)) * A) * (
i,
i)
by A2, A6
.=
0. R
by A6, A8, A9, Th54
;
verum
end;
A10:
for i, j being Nat st [i,j] in Indices A holds
A * (i,i) = A * (j,j)
proof
let i,
j be
Nat;
( [i,j] in Indices A implies A * (i,i) = A * (j,j) )
assume A11:
[i,j] in Indices A
;
A * (i,i) = A * (j,j)
per cases
( i = j or i <> j )
;
suppose
i = j
;
A * (i,i) = A * (j,j)hence
A * (
i,
i)
= A * (
j,
j)
;
verum end; suppose A12:
i <> j
;
A * (i,i) = A * (j,j)A13:
Indices A =
[:(Seg n),(Seg n):]
by MATRIX_0:24
.=
Indices (canMat (i,j,n,R))
by MATRIX_0:24
;
hence A * (
i,
i) =
(A * (canMat (i,j,n,R))) * (
i,
j)
by A11, Th55
.=
((canMat (i,j,n,R)) * A) * (
i,
j)
by A2, A12
.=
A * (
j,
j)
by A11, A13, Th54
;
verum end; end;
end;
per cases
( n = 0 or n > 0 )
;
suppose A15:
n > 0
;
ex z being Element of R st
( z in center (UnitGroup R) & A = z * (1. (R,n)) )then
0 < 0 + n
;
then
1
<= n
by NAT_1:19;
then A16:
[1,1] in Indices A
by MATRIX_0:31;
take z =
A * (1,1);
( z in center (UnitGroup R) & A = z * (1. (R,n)) )A17:
(
len A = len (z * (1. (R,n))) &
width A = width (z * (1. (R,n))) )
for
i,
j being
Nat st
[i,j] in Indices A holds
A * (
i,
j)
= (z * (1. (R,n))) * (
i,
j)
proof
let i,
j be
Nat;
( [i,j] in Indices A implies A * (i,j) = (z * (1. (R,n))) * (i,j) )
assume A18:
[i,j] in Indices A
;
A * (i,j) = (z * (1. (R,n))) * (i,j)
Indices A =
[:(Seg n),(Seg n):]
by MATRIX_0:24
.=
Indices (1. (R,n))
by MATRIX_0:24
;
then A19:
[i,j] in Indices (1. (R,n))
by A18;
per cases
( i = j or i <> j )
;
suppose A20:
i = j
;
A * (i,j) = (z * (1. (R,n))) * (i,j)
[1,i] in Indices A
proof
[1,1] in [:(Seg n),(Seg n):]
by A16, MATRIX_0:24;
then A21:
1
in Seg n
by ZFMISC_1:87;
[i,j] in [:(Seg n),(Seg n):]
by A18, MATRIX_0:24;
then
i in Seg n
by ZFMISC_1:87;
then
[1,i] in [:(Seg n),(Seg n):]
by A21, ZFMISC_1:87;
hence
[1,i] in Indices A
by MATRIX_0:24;
verum
end; hence A * (
i,
j) =
z * (1. R)
by A10, A20
.=
z * ((1. (R,n)) * (i,j))
by A19, A20, MATRIX_1:def 3
.=
(z * (1. (R,n))) * (
i,
j)
by A19, MATRIX_3:def 5
;
verum end; end;
end; then A23:
A = z * (1. (R,n))
by A17, MATRIX_0:21;
then reconsider z9 =
z as
Element of
(UnitGroup R) by A15, Th121, STRUCT_0:def 5;
for
x9 being
Element of
(UnitGroup R) holds
z9 * x9 = x9 * z9
proof
let x9 be
Element of
(UnitGroup R);
z9 * x9 = x9 * z9
x9 in units R
;
then reconsider x =
x9 as
Element of
R ;
A24:
x * (1. (R,n)) is
invertible
by Th120, STRUCT_0:def 5;
A25:
(x * z) * (1. (R,n)) =
((x * z) * (1. (R,n))) * (1. (R,n))
by MATRIX_3:19
.=
((x * (1. (R,n))) * z) * (1. (R,n))
by Th101
.=
(x * (1. (R,n))) * A
by A23, Th102
.=
(z * (1. (R,n))) * (x * (1. (R,n)))
by A23, A24, A1
.=
((z * (1. (R,n))) * x) * (1. (R,n))
by Th102
.=
((z * x) * (1. (R,n))) * (1. (R,n))
by Th101
.=
(z * x) * (1. (R,n))
by MATRIX_3:19
;
Indices (1. (R,n)) =
[:(Seg n),(Seg n):]
by MATRIX_0:24
.=
Indices A
by MATRIX_0:24
;
then A26:
[1,1] in Indices (1. (R,n))
by A16;
thus x9 * z9 =
(x * z) * (1. R)
by Th110
.=
(x * z) * ((1. (R,n)) * (1,1))
by A26, MATRIX_1:def 3
.=
((x * z) * (1. (R,n))) * (1,1)
by A26, MATRIX_3:def 5
.=
(z * x) * ((1. (R,n)) * (1,1))
by A25, A26, MATRIX_3:def 5
.=
(z * x) * (1. R)
by A26, MATRIX_1:def 3
.=
z9 * x9
by Th110
;
verum
end; hence
(
z in center (UnitGroup R) &
A = z * (1. (R,n)) )
by A23, GROUP_5:77;
verum end; end;