let R be Ring; for n, i, j being Nat st [i,j] in Indices (canMat (i,j,n,R)) holds
for A being Matrix of n,R
for i2, j2 being Nat st [i2,j2] in Indices A holds
( ( i = i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = A * (j,j2) ) & ( i <> i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = 0. R ) )
let n be Nat; for i, j being Nat st [i,j] in Indices (canMat (i,j,n,R)) holds
for A being Matrix of n,R
for i2, j2 being Nat st [i2,j2] in Indices A holds
( ( i = i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = A * (j,j2) ) & ( i <> i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = 0. R ) )
let i, j be Nat; ( [i,j] in Indices (canMat (i,j,n,R)) implies for A being Matrix of n,R
for i2, j2 being Nat st [i2,j2] in Indices A holds
( ( i = i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = A * (j,j2) ) & ( i <> i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = 0. R ) ) )
assume A1:
[i,j] in Indices (canMat (i,j,n,R))
; for A being Matrix of n,R
for i2, j2 being Nat st [i2,j2] in Indices A holds
( ( i = i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = A * (j,j2) ) & ( i <> i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = 0. R ) )
let A be Matrix of n,R; for i2, j2 being Nat st [i2,j2] in Indices A holds
( ( i = i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = A * (j,j2) ) & ( i <> i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = 0. R ) )
let i2, j2 be Nat; ( [i2,j2] in Indices A implies ( ( i = i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = A * (j,j2) ) & ( i <> i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = 0. R ) ) )
assume A2:
[i2,j2] in Indices A
; ( ( i = i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = A * (j,j2) ) & ( i <> i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = 0. R ) )
A3: Indices ((canMat (i,j,n,R)) * A) =
[:(Seg n),(Seg n):]
by MATRIX_0:24
.=
Indices A
by MATRIX_0:24
;
A4:
[i2,j] in Indices (canMat (i,j,n,R))
proof
[i,j] in [:(Seg n),(Seg n):]
by A1, MATRIX_0:24;
then A5:
j in Seg n
by ZFMISC_1:87;
[i2,j2] in [:(Seg n),(Seg n):]
by A2, MATRIX_0:24;
then
i2 in Seg n
by ZFMISC_1:87;
then
[i2,j] in [:(Seg n),(Seg n):]
by A5, ZFMISC_1:87;
hence
[i2,j] in Indices (canMat (i,j,n,R))
by MATRIX_0:24;
verum
end;
thus
( i = i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = A * (j,j2) )
( i <> i2 implies ((canMat (i,j,n,R)) * A) * (i2,j2) = 0. R )proof
assume A6:
i = i2
;
((canMat (i,j,n,R)) * A) * (i2,j2) = A * (j,j2)
A7:
(
j in dom (1. (R,n)) &
j in dom A )
width (canMat (i,j,n,R)) =
n
by MATRIX_0:24
.=
len A
by MATRIX_0:24
;
hence ((canMat (i,j,n,R)) * A) * (
i2,
j2) =
(Line ((canMat (i,j,n,R)),i2)) "*" (Col (A,j2))
by A2, A3, MATRIX_3:def 4
.=
(Line ((1. (R,n)),j)) "*" (Col (A,j2))
by A6, A4, Th44
.=
A * (
j,
j2)
by A7, Th21
;
verum
end;
assume A9:
i <> i2
; ((canMat (i,j,n,R)) * A) * (i2,j2) = 0. R
A10:
j in dom (0. (R,n))
width (canMat (i,j,n,R)) =
n
by MATRIX_0:24
.=
len A
by MATRIX_0:24
;
hence ((canMat (i,j,n,R)) * A) * (i2,j2) =
(Line ((canMat (i,j,n,R)),i2)) "*" (Col (A,j2))
by A2, A3, MATRIX_3:def 4
.=
(Line ((0. (R,n)),j)) "*" (Col (A,j2))
by A4, A9, Th44
.=
0. R
by A10, Th19
;
verum