:: BILINEAR semantic presentation
:: deftheorem BILINEAR:def 1 :
canceled;
:: deftheorem defines NulForm BILINEAR:def 2 :
definition
let K be non
empty LoopStr ;
let V,
W be non
empty VectSpStr of
K;
let f,
g be
Form of
V,
W;
func f + g -> Form of
V,
W means :
Def3:
:: BILINEAR:def 3
for
v being
Vector of
V for
w being
Vector of
W holds
it . v,
w = (f . v,w) + (g . v,w);
existence
ex b1 being Form of V,W st
for v being Vector of V
for w being Vector of W holds b1 . v,w = (f . v,w) + (g . v,w)
uniqueness
for b1, b2 being Form of V,W st ( for v being Vector of V
for w being Vector of W holds b1 . v,w = (f . v,w) + (g . v,w) ) & ( for v being Vector of V
for w being Vector of W holds b2 . v,w = (f . v,w) + (g . v,w) ) holds
b1 = b2
end;
:: deftheorem Def3 defines + BILINEAR:def 3 :
definition
let K be non
empty HGrStr ;
let V,
W be non
empty VectSpStr of
K;
let f be
Form of
V,
W;
let a be
Element of
K;
func a * f -> Form of
V,
W means :
Def4:
:: BILINEAR:def 4
for
v being
Vector of
V for
w being
Vector of
W holds
it . v,
w = a * (f . v,w);
existence
ex b1 being Form of V,W st
for v being Vector of V
for w being Vector of W holds b1 . v,w = a * (f . v,w)
uniqueness
for b1, b2 being Form of V,W st ( for v being Vector of V
for w being Vector of W holds b1 . v,w = a * (f . v,w) ) & ( for v being Vector of V
for w being Vector of W holds b2 . v,w = a * (f . v,w) ) holds
b1 = b2
end;
:: deftheorem Def4 defines * BILINEAR:def 4 :
definition
let K be non
empty LoopStr ;
let V,
W be non
empty VectSpStr of
K;
let f be
Form of
V,
W;
func - f -> Form of
V,
W means :
Def5:
:: BILINEAR:def 5
for
v being
Vector of
V for
w being
Vector of
W holds
it . v,
w = - (f . v,w);
existence
ex b1 being Form of V,W st
for v being Vector of V
for w being Vector of W holds b1 . v,w = - (f . v,w)
uniqueness
for b1, b2 being Form of V,W st ( for v being Vector of V
for w being Vector of W holds b1 . v,w = - (f . v,w) ) & ( for v being Vector of V
for w being Vector of W holds b2 . v,w = - (f . v,w) ) holds
b1 = b2
end;
:: deftheorem Def5 defines - BILINEAR:def 5 :
:: deftheorem defines - BILINEAR:def 6 :
:: deftheorem defines - BILINEAR:def 7 :
definition
let K be non
empty LoopStr ;
let V,
W be non
empty VectSpStr of
K;
let f,
g be
Form of
V,
W;
:: original: -redefine func f - g -> Form of
V,
W means :
Def8:
:: BILINEAR:def 8
for
v being
Vector of
V for
w being
Vector of
W holds
it . v,
w = (f . v,w) - (g . v,w);
coherence
f - g is Form of V,W
;
compatibility
for b1 being Form of V,W holds
( b1 = f - g iff for v being Vector of V
for w being Vector of W holds b1 . v,w = (f . v,w) - (g . v,w) )
end;
:: deftheorem Def8 defines - BILINEAR:def 8 :
Lm2:
for K being non empty ZeroStr
for V, W being non empty VectSpStr of K
for v being Vector of V
for w being Vector of W holds (NulForm V,W) . v,w = 0. K
by FUNCOP_1:85;
theorem :: BILINEAR:1
canceled;
theorem :: BILINEAR:2
theorem :: BILINEAR:3
theorem :: BILINEAR:4
theorem :: BILINEAR:5
theorem :: BILINEAR:6
theorem :: BILINEAR:7
theorem :: BILINEAR:8
Lm3:
now
let K be non
empty 1-sorted ;
let V,
W be non
empty VectSpStr of
K;
let f be
Form of
V,
W;
let v be
Element of the
carrier of
V;
let y be
Element of
W;
A1:
dom f = [:the carrier of V,the carrier of W:]
by FUNCT_2:def 1;
then consider g being
Function such that A2:
(
(curry f) . v = g &
dom g = the
carrier of
W &
rng g c= rng f )
and
for
y being
set st
y in the
carrier of
W holds
g . y = f . v,
y
by FUNCT_5:36;
rng g c= the
carrier of
K
by A2, XBOOLE_1:1;
then reconsider g =
g as
Function of the
carrier of
W,the
carrier of
K by A2, FUNCT_2:4;
g = (curry f) . v
by A2;
hence
(curry f) . v is
Functional of
W
;
consider h being
Function such that A3:
(
(curry' f) . y = h &
dom h = the
carrier of
V &
rng h c= rng f )
and
for
x being
set st
x in the
carrier of
V holds
h . x = f . x,
y
by A1, FUNCT_5:39;
rng h c= the
carrier of
K
by A3, XBOOLE_1:1;
then reconsider h =
h as
Function of the
carrier of
V,the
carrier of
K by A3, FUNCT_2:4;
h = (curry' f) . y
by A3;
hence
(curry' f) . y is
Functional of
V
;
end;
:: deftheorem defines FunctionalFAF BILINEAR:def 9 :
:: deftheorem defines FunctionalSAF BILINEAR:def 10 :
theorem Th9: :: BILINEAR:9
theorem Th10: :: BILINEAR:10
theorem Th11: :: BILINEAR:11
theorem Th12: :: BILINEAR:12
theorem Th13: :: BILINEAR:13
theorem Th14: :: BILINEAR:14
theorem Th15: :: BILINEAR:15
theorem Th16: :: BILINEAR:16
theorem Th17: :: BILINEAR:17
theorem Th18: :: BILINEAR:18
theorem :: BILINEAR:19
theorem :: BILINEAR:20
definition
let K be non
empty HGrStr ;
let V,
W be non
empty VectSpStr of
K;
let f be
Functional of
V;
let g be
Functional of
W;
func FormFunctional f,
g -> Form of
V,
W means :
Def11:
:: BILINEAR:def 11
for
v being
Vector of
V for
w being
Vector of
W holds
it . v,
w = (f . v) * (g . w);
existence
ex b1 being Form of V,W st
for v being Vector of V
for w being Vector of W holds b1 . v,w = (f . v) * (g . w)
uniqueness
for b1, b2 being Form of V,W st ( for v being Vector of V
for w being Vector of W holds b1 . v,w = (f . v) * (g . w) ) & ( for v being Vector of V
for w being Vector of W holds b2 . v,w = (f . v) * (g . w) ) holds
b1 = b2
end;
:: deftheorem Def11 defines FormFunctional BILINEAR:def 11 :
theorem Th21: :: BILINEAR:21
theorem Th22: :: BILINEAR:22
theorem :: BILINEAR:23
theorem :: BILINEAR:24
theorem Th25: :: BILINEAR:25
theorem Th26: :: BILINEAR:26