:: RLVECT_3 semantic presentation

Lm1: for V being RealLinearSpace
for F, G being FinSequence of the carrier of V
for f being Function of the carrier of V, REAL holds f (#) (F ^ G) = (f (#) F) ^ (f (#) G)

proof end;

theorem Th1: :: RLVECT_3:1

for V being RealLinearSpace
for L1, L2 being Linear_Combination of V holds Sum (L1 + L2) = (Sum L1) + (Sum L2)

proof end;

theorem Th2: :: RLVECT_3:2

for a being Real
for V being RealLinearSpace
for L being Linear_Combination of V holds Sum (a * L) = a * (Sum L)

proof end;

theorem Th3: :: RLVECT_3:3

for V being RealLinearSpace
for L being Linear_Combination of V holds Sum (- L) = - (Sum L)

proof end;

theorem Th4: :: RLVECT_3:4

for V being RealLinearSpace
for L1, L2 being Linear_Combination of V holds Sum (L1 - L2) = (Sum L1) - (Sum L2)

proof end;

definition

let V be RealLinearSpace;
let A be Subset of V;
attr A is linearly-independent means :Def1: :: RLVECT_3:def 1
for l being Linear_Combination of A st Sum l = 0. V holds
Carrier l = {} ;

end;

:: deftheorem Def1 defines linearly-independent RLVECT_3:def 1 :

notation

let V be RealLinearSpace;
let A be Subset of V;
antonym linearly-dependent A for linearly-independent A;

end;

theorem :: RLVECT_3:5

canceled;

theorem :: RLVECT_3:6

for V being RealLinearSpace
for A, B being Subset of V st A c= B & B is linearly-independent holds
A is linearly-independent

proof end;

theorem Th7: :: RLVECT_3:7

for V being RealLinearSpace
for A being Subset of V st A is linearly-independent holds
not 0. V in A

proof end;

theorem Th8: :: RLVECT_3:8

for V being RealLinearSpace holds {} the carrier of V is linearly-independent

proof end;

registration

let V be RealLinearSpace;
cluster linearly-independent Element of bool the carrier of V;
existence

proof end;

end;

theorem Th9: :: RLVECT_3:9

for V being RealLinearSpace
for v being VECTOR of V holds
( {v} is linearly-independent iff v <> 0. V )

proof end;

theorem :: RLVECT_3:10

for V being RealLinearSpace holds not {(0. V)} is linearly-independent by Th9;

theorem Th11: :: RLVECT_3:11

for V being RealLinearSpace
for v1, v2 being VECTOR of V st {v1,v2} is linearly-independent holds
( v1 <> 0. V & v2 <> 0. V )

proof end;

theorem :: RLVECT_3:12

for V being RealLinearSpace
for v being VECTOR of V holds
( not {v,(0. V)} is linearly-independent & not {(0. V),v} is linearly-independent ) by Th11;

theorem Th13: :: RLVECT_3:13

for V being RealLinearSpace
for v1, v2 being VECTOR of V holds
( v1 <> v2 & {v1,v2} is linearly-independent iff ( v2 <> 0. V & ( for a being Real holds v1 <> a * v2 ) ) )

proof end;

theorem :: RLVECT_3:14

for V being RealLinearSpace
for v1, v2 being VECTOR of V holds
( ( v1 <> v2 & {v1,v2} is linearly-independent ) iff for a, b being Real st (a * v1) + (b * v2) = 0. V holds
( a = 0 & b = 0 ) )

proof end;

definition

let V be RealLinearSpace;
let A be Subset of V;
func Lin A -> strict Subspace of V means :Def2: :: RLVECT_3:def 2
the carrier of it = { (Sum l) where l is Linear_Combination of A : verum } ;
existence

proof end;

uniqueness by RLSUB_1:38;

end;

:: deftheorem Def2 defines Lin RLVECT_3:def 2 :

theorem :: RLVECT_3:15

canceled;

theorem :: RLVECT_3:16

canceled;

theorem Th17: :: RLVECT_3:17

for x being set
for V being RealLinearSpace
for A being Subset of V holds
( x in Lin A iff ex l being Linear_Combination of A st x = Sum l )

proof end;

theorem Th18: :: RLVECT_3:18

for x being set
for V being RealLinearSpace
for A being Subset of V st x in A holds
x in Lin A

proof end;

Lm2: for x being set
for V being RealLinearSpace holds
( x in (0). V iff x = 0. V )

proof end;

theorem :: RLVECT_3:19

for V being RealLinearSpace holds Lin ({} the carrier of V) = (0). V

proof end;

theorem :: RLVECT_3:20

for V being RealLinearSpace
for A being Subset of V holds
( not Lin A = (0). V or A = {} or A = {(0. V)} )

proof end;

theorem Th21: :: RLVECT_3:21

for V being RealLinearSpace
for A being Subset of V
for W being strict Subspace of V st A = the carrier of W holds
Lin A = W

proof end;

theorem :: RLVECT_3:22

for V being strict RealLinearSpace
for A being Subset of V st A = the carrier of V holds
Lin A = V

proof end;

Lm3: for V being RealLinearSpace
for W1, W3, W2 being Subspace of V st W1 is Subspace of W3 holds
W1 /\ W2 is Subspace of W3

proof end;

Lm4: for V being RealLinearSpace
for W1, W2, W3 being Subspace of V st W1 is Subspace of W2 & W1 is Subspace of W3 holds
W1 is Subspace of W2 /\ W3

proof end;

Lm5: for V being RealLinearSpace
for W1, W2, W3 being Subspace of V st W1 is Subspace of W2 holds
W1 is Subspace of W2 + W3

proof end;

Lm6: for V being RealLinearSpace
for W1, W3, W2 being Subspace of V st W1 is Subspace of W3 & W2 is Subspace of W3 holds
W1 + W2 is Subspace of W3

proof end;

theorem Th23: :: RLVECT_3:23

for V being RealLinearSpace
for A, B being Subset of V st A c= B holds
Lin A is Subspace of Lin B

proof end;

theorem :: RLVECT_3:24

for V being strict RealLinearSpace
for A, B being Subset of V st Lin A = V & A c= B holds
Lin B = V

proof end;

theorem :: RLVECT_3:25

for V being RealLinearSpace
for A, B being Subset of V holds Lin (A \/ B) = (Lin A) + (Lin B)

proof end;

theorem :: RLVECT_3:26

for V being RealLinearSpace
for A, B being Subset of V holds Lin (A /\ B) is Subspace of (Lin A) /\ (Lin B)

proof end;

Lm7: for M being non empty set
for CF being Choice_Function of M st not {} in M holds
( dom CF = M & rng CF c= union M )

proof end;

theorem Th27: :: RLVECT_3:27

for V being RealLinearSpace
for A being Subset of V st A is linearly-independent holds
ex B being Subset of V st
( A c= B & B is linearly-independent & Lin B = RLSStruct(# the carrier of V,the Zero of V,the add of V,the Mult of V #) )

proof end;

theorem Th28: :: RLVECT_3:28

for V being RealLinearSpace
for A being Subset of V st Lin A = V holds
ex B being Subset of V st
( B c= A & B is linearly-independent & Lin B = V )

proof end;

definition

let V be RealLinearSpace;
mode Basis of V -> Subset of V means :Def3: :: RLVECT_3:def 3
( it is linearly-independent & Lin it = RLSStruct(# the carrier of V,the Zero of V,the add of V,the Mult of V #) );
existence

proof end;

end;

:: deftheorem Def3 defines Basis RLVECT_3:def 3 :

theorem :: RLVECT_3:29

canceled;

theorem :: RLVECT_3:30

canceled;

theorem :: RLVECT_3:31

canceled;

theorem :: RLVECT_3:32

for V being strict RealLinearSpace
for A being Subset of V st A is linearly-independent holds
ex I being Basis of V st A c= I

proof end;

theorem :: RLVECT_3:33

for V being RealLinearSpace
for A being Subset of V st Lin A = V holds
ex I being Basis of V st I c= A

proof end;

theorem :: RLVECT_3:34

canceled;

theorem :: RLVECT_3:35

for M being non empty set
for CF being Choice_Function of M st not {} in M holds
( dom CF = M & rng CF c= union M ) by Lm7;

theorem :: RLVECT_3:36

for x being set
for V being RealLinearSpace holds
( x in (0). V iff x = 0. V ) by Lm2;

theorem :: RLVECT_3:37

for V being RealLinearSpace
for W1, W3, W2 being Subspace of V st W1 is Subspace of W3 holds
W1 /\ W2 is Subspace of W3 by Lm3;

theorem :: RLVECT_3:38

for V being RealLinearSpace
for W1, W2, W3 being Subspace of V st W1 is Subspace of W2 & W1 is Subspace of W3 holds
W1 is Subspace of W2 /\ W3 by Lm4;

theorem :: RLVECT_3:39

for V being RealLinearSpace
for W1, W3, W2 being Subspace of V st W1 is Subspace of W3 & W2 is Subspace of W3 holds
W1 + W2 is Subspace of W3 by Lm6;

theorem :: RLVECT_3:40

for V being RealLinearSpace
for W1, W2, W3 being Subspace of V st W1 is Subspace of W2 holds
W1 is Subspace of W2 + W3 by Lm5;

theorem :: RLVECT_3:41

for V being RealLinearSpace
for F, G being FinSequence of the carrier of V
for f being Function of the carrier of V, REAL holds f (#) (F ^ G) = (f (#) F) ^ (f (#) G) by Lm1;