let F be Field; for U, V being VectSp of F
for B being non empty finite Subset of U
for b being Element of B
for f being Function of B,V
for l being Linear_Combination of B st Carrier l = {b} holds
( Carrier (f (#) l) = {(f . b)} & Sum (f (#) l) = (l . b) * (f . b) )
let U, V be VectSp of F; for B being non empty finite Subset of U
for b being Element of B
for f being Function of B,V
for l being Linear_Combination of B st Carrier l = {b} holds
( Carrier (f (#) l) = {(f . b)} & Sum (f (#) l) = (l . b) * (f . b) )
let B be non empty finite Subset of U; for b being Element of B
for f being Function of B,V
for l being Linear_Combination of B st Carrier l = {b} holds
( Carrier (f (#) l) = {(f . b)} & Sum (f (#) l) = (l . b) * (f . b) )
let b be Element of B; for f being Function of B,V
for l being Linear_Combination of B st Carrier l = {b} holds
( Carrier (f (#) l) = {(f . b)} & Sum (f (#) l) = (l . b) * (f . b) )
let f be Function of B,V; for l being Linear_Combination of B st Carrier l = {b} holds
( Carrier (f (#) l) = {(f . b)} & Sum (f (#) l) = (l . b) * (f . b) )
let l be Linear_Combination of B; ( Carrier l = {b} implies ( Carrier (f (#) l) = {(f . b)} & Sum (f (#) l) = (l . b) * (f . b) ) )
assume A:
Carrier l = {b}
; ( Carrier (f (#) l) = {(f . b)} & Sum (f (#) l) = (l . b) * (f . b) )
H:
dom f = B
by FUNCT_2:def 1;
then reconsider v = f . b as Element of rng f by FUNCT_1:3;
F:
b in Carrier l
by A, TARSKI:def 1;
set T = Expand (f,l,v);
f . b in {v}
by TARSKI:def 1;
then
b in f " {v}
by H, FUNCT_1:def 7;
then
b in rng (canFS (f " {v}))
by FUNCT_2:def 3;
then consider i being object such that
E:
( i in dom (canFS (f " {v})) & (canFS (f " {v})) . i = b )
by FUNCT_1:def 3;
reconsider i = i as Element of NAT by E;
K:
dom l = the carrier of U
by FUNCT_2:def 1;
then L:
i in dom (Expand (f,l,v))
by E, FUNCT_1:11;
G: l . b =
(l * (canFS (f " {v}))) . i
by E, FUNCT_1:13
.=
(Expand (f,l,v)) /. i
by L, PARTFUN1:def 6
;
I:
now for j being Element of NAT st j in dom (Expand (f,l,v)) & j <> i holds
0. F = (Expand (f,l,v)) /. jlet j be
Element of
NAT ;
( j in dom (Expand (f,l,v)) & j <> i implies 0. F = (Expand (f,l,v)) /. j )assume I1:
(
j in dom (Expand (f,l,v)) &
j <> i )
;
0. F = (Expand (f,l,v)) /. jthen I2:
(
j in dom (canFS (f " {v})) &
(canFS (f " {v})) . j in dom l )
by FUNCT_1:11;
then
(canFS (f " {v})) . j <> b
by E, I1, FUNCT_1:def 4;
then
not
(canFS (f " {v})) . j in Carrier l
by A, TARSKI:def 1;
hence 0. F =
l . ((canFS (f " {v})) . j)
by I2
.=
(l * (canFS (f " {v}))) . j
by I2, FUNCT_1:13
.=
(Expand (f,l,v)) /. j
by I1, PARTFUN1:def 6
;
verum end;
C: (f (#) l) . v =
Sum (Expand (f,l,v))
by defK
.=
l . b
by G, K, I, E, FUNCT_1:11, POLYNOM2:3
;
hence
Carrier (f (#) l) = {(f . b)}
by B, TARSKI:2; Sum (f (#) l) = (l . b) * (f . b)
thus
Sum (f (#) l) = (l . b) * (f . b)
by D, C, B, TARSKI:2, VECTSP_6:20; verum