:: Construction of Rings and Left-, Right-, and Bi-Modules over a Ring
:: by Micha{\l} Muzalewski
::
:: Received June 20, 1990
:: Copyright (c) 1990-2019 Association of Mizar Users

Lm1: for L being non empty multLoopStr st L is well-unital holds
1. L = 1_ L

by GROUP_1:def 4;

registration
existence
ex b1 being non empty doubleLoopStr st
( b1 is strict & b1 is Abelian & b1 is add-associative & b1 is right_zeroed & b1 is right_complementable & b1 is unital & b1 is distributive )
proof end;
end;

definition
let IT be non empty multLoopStr_0 ;
attr IT is domRing-like means :Def1: :: VECTSP_2:def 1
for x, y being Element of IT holds
( not x * y = 0. IT or x = 0. IT or y = 0. IT );
end;

:: deftheorem Def1 defines domRing-like VECTSP_2:def 1 :
for IT being non empty multLoopStr_0 holds
( IT is domRing-like iff for x, y being Element of IT holds
( not x * y = 0. IT or x = 0. IT or y = 0. IT ) );

registration
existence
ex b1 being Ring st
( b1 is strict & not b1 is degenerated & b1 is commutative & b1 is almost_left_invertible & b1 is domRing-like )
proof end;
end;

definition end;

definition end;

theorem :: VECTSP_2:1
for F being Field holds F is domRing
proof end;

:: 10. AXIOMS OF SKEW-FIELD
registration
coherence
for b1 being non empty multLoopStr st b1 is commutative & b1 is left_unital holds
b1 is well-unital
proof end;
coherence
for b1 being non empty multLoopStr st b1 is commutative & b1 is right_unital holds
b1 is well-unital
proof end;
end;

Lm2: for R being non empty right_complementable Abelian add-associative right_zeroed addLoopStr
for x, y, z being Scalar of R st x + y = z holds
x = z - y

proof end;

Lm3: for R being non empty right_complementable Abelian add-associative right_zeroed addLoopStr
for x, y, z being Scalar of R st x = z - y holds
x + y = z

proof end;

theorem :: VECTSP_2:2
for R being non empty right_complementable Abelian add-associative right_zeroed addLoopStr
for x, y, z being Scalar of R holds
( ( x + y = z implies x = z - y ) & ( x = z - y implies x + y = z ) & ( x + y = z implies y = z - x ) & ( y = z - x implies x + y = z ) ) by ;

theorem Th3: :: VECTSP_2:3
for R being non empty right_complementable add-associative right_zeroed addLoopStr
for x being Element of R holds
( x = 0. R iff - x = 0. R )
proof end;

theorem :: VECTSP_2:4
for R being non empty right_complementable Abelian add-associative right_zeroed addLoopStr
for x, y being Element of R ex z being Element of R st
( x = y + z & x = z + y )
proof end;

theorem :: VECTSP_2:5
for F being non empty non degenerated right_complementable distributive add-associative right_zeroed doubleLoopStr
for x, y being Element of F st x * y = 1. F holds
( x <> 0. F & y <> 0. F ) ;

theorem Th6: :: VECTSP_2:6
for SF being non empty non degenerated right_complementable almost_left_invertible well-unital distributive add-associative right_zeroed associative doubleLoopStr
for x being Element of SF st x <> 0. SF holds
ex y being Element of SF st x * y = 1. SF
proof end;

theorem Th7: :: VECTSP_2:7
for SF being non empty non degenerated right_complementable almost_left_invertible well-unital distributive add-associative right_zeroed associative doubleLoopStr
for x, y being Element of SF st y * x = 1. SF holds
x * y = 1. SF
proof end;

theorem Th8: :: VECTSP_2:8
for SF being non empty non degenerated right_complementable almost_left_invertible well-unital distributive Abelian add-associative right_zeroed associative doubleLoopStr
for x, y, z being Element of SF st x * y = x * z & x <> 0. SF holds
y = z
proof end;

notation end;

definition
let SF be non empty non degenerated right_complementable almost_left_invertible well-unital distributive add-associative right_zeroed associative doubleLoopStr ;
let x be Element of SF;
assume A1: x <> 0. SF ;
redefine func / x means :Def2: :: VECTSP_2:def 2
it * x = 1. SF;
compatibility
for b1 being Element of the carrier of SF holds
( b1 = x " iff b1 * x = 1. SF )
proof end;
end;

:: deftheorem Def2 defines " VECTSP_2:def 2 :
for SF being non empty non degenerated right_complementable almost_left_invertible well-unital distributive add-associative right_zeroed associative doubleLoopStr
for x being Element of SF st x <> 0. SF holds
for b3 being Element of the carrier of SF holds
( b3 = x " iff b3 * x = 1. SF );

canceled;

:: definition
:: let SF,x,y;
:: func x/y -> Scalar of SF equals
:: x * y";
:: correctness;
:: end;
::$CD theorem Th9: :: VECTSP_2:9 for SF being Skew-Field for x being Scalar of SF st x <> 0. SF holds ( x * (x ") = 1. SF & (x ") * x = 1. SF ) proof end; theorem Th10: :: VECTSP_2:10 for SF being Skew-Field for x, y being Scalar of SF st y * x = 1_ SF holds ( x = y " & y = x " ) proof end; theorem Th11: :: VECTSP_2:11 for SF being Skew-Field for x, y being Scalar of SF st x <> 0. SF & y <> 0. SF holds (x ") * (y ") = (y * x) " proof end; theorem :: VECTSP_2:12 for SF being Skew-Field for x, y being Scalar of SF holds ( not x * y = 0. SF or x = 0. SF or y = 0. SF ) proof end; theorem Th13: :: VECTSP_2:13 for SF being Skew-Field for x being Scalar of SF st x <> 0. SF holds x " <> 0. SF proof end; theorem Th14: :: VECTSP_2:14 for SF being Skew-Field for x being Scalar of SF st x <> 0. SF holds (x ") " = x proof end; theorem :: VECTSP_2:15 for SF being Skew-Field for x being Scalar of SF st x <> 0. SF holds ( (1_ SF) / x = x " & (1_ SF) / (x ") = x ) proof end; theorem :: VECTSP_2:16 for SF being Skew-Field for x being Scalar of SF st x <> 0. SF holds ( x * ((1_ SF) / x) = 1_ SF & ((1_ SF) / x) * x = 1_ SF ) proof end; theorem :: VECTSP_2:17 for SF being Skew-Field for x being Scalar of SF st x <> 0. SF holds x / x = 1_ SF by Th9; theorem Th18: :: VECTSP_2:18 for SF being Skew-Field for x, y, z being Scalar of SF st y <> 0. SF & z <> 0. SF holds x / y = (x * z) / (y * z) proof end; theorem Th19: :: VECTSP_2:19 for SF being Skew-Field for x, y being Scalar of SF st y <> 0. SF holds ( - (x / y) = (- x) / y & x / (- y) = - (x / y) ) proof end; theorem :: VECTSP_2:20 for SF being Skew-Field for x, y, z being Scalar of SF st z <> 0. SF holds ( (x / z) + (y / z) = (x + y) / z & (x / z) - (y / z) = (x - y) / z ) proof end; theorem :: VECTSP_2:21 for SF being Skew-Field for x, y, z being Scalar of SF st y <> 0. SF & z <> 0. SF holds x / (y / z) = (x * z) / y proof end; theorem :: VECTSP_2:22 for SF being Skew-Field for x, y being Scalar of SF st y <> 0. SF holds (x / y) * y = x proof end; :: 13. LEFT-, RIGHT-, AND BI-MODULE STRUCTURE definition let FS be 1-sorted ; attr c2 is strict ; struct RightModStr over FS -> addLoopStr ; aggr RightModStr(# carrier, addF, ZeroF, rmult #) -> RightModStr over FS; sel rmult c2 -> Function of [: the carrier of c2, the carrier of FS:], the carrier of c2; end; registration let FS be 1-sorted ; cluster non empty for RightModStr over FS; existence not for b1 being RightModStr over FS holds b1 is empty proof end; end; registration let FS be 1-sorted ; let A be non empty set ; let a be BinOp of A; let Z be Element of A; let r be Function of [:A, the carrier of FS:],A; cluster RightModStr(# A,a,Z,r #) -> non empty ; coherence not RightModStr(# A,a,Z,r #) is empty ; end; definition let FS be non empty doubleLoopStr ; let RMS be non empty RightModStr over FS; mode Scalar of RMS is Element of FS; mode Vector of RMS is Element of RMS; end; definition let FS1, FS2 be 1-sorted ; attr c3 is strict ; struct BiModStr over FS1,FS2 -> ModuleStr over FS1, RightModStr over FS2; aggr BiModStr(# carrier, addF, ZeroF, lmult, rmult #) -> BiModStr over FS1,FS2; end; registration let FS1, FS2 be 1-sorted ; cluster non empty for BiModStr over FS1,FS2; existence not for b1 being BiModStr over FS1,FS2 holds b1 is empty proof end; end; registration let FS1, FS2 be 1-sorted ; let A be non empty set ; let a be BinOp of A; let Z be Element of A; let l be Function of [: the carrier of FS1,A:],A; let r be Function of [:A, the carrier of FS2:],A; cluster BiModStr(# A,a,Z,l,r #) -> non empty ; coherence not BiModStr(# A,a,Z,l,r #) is empty ; end; definition let R be non empty right_complementable Abelian add-associative right_zeroed addLoopStr ; func AbGr R -> strict AbGroup equals :: VECTSP_2:def 3 addLoopStr(# the carrier of R, the addF of R,(0. R) #); coherence addLoopStr(# the carrier of R, the addF of R,(0. R) #) is strict AbGroup proof end; end; :: deftheorem defines AbGr VECTSP_2:def 3 : for R being non empty right_complementable Abelian add-associative right_zeroed addLoopStr holds AbGr R = addLoopStr(# the carrier of R, the addF of R,(0. R) #); deffunc H1( Ring) -> ModuleStr over$1 = ModuleStr(# the carrier of $1, the addF of$1,(0. $1), the multF of$1 #);

Lm4: for R being Ring holds
( H1(R) is Abelian & H1(R) is add-associative & H1(R) is right_zeroed & H1(R) is right_complementable )

proof end;

registration
let R be Ring;
existence
ex b1 being non empty ModuleStr over R st
( b1 is Abelian & b1 is add-associative & b1 is right_zeroed & b1 is right_complementable & b1 is strict )
proof end;
end;

definition
let R be Ring;
func LeftModule R -> non empty right_complementable strict Abelian add-associative right_zeroed ModuleStr over R equals :: VECTSP_2:def 4
ModuleStr(# the carrier of R, the addF of R,(0. R), the multF of R #);
coherence
ModuleStr(# the carrier of R, the addF of R,(0. R), the multF of R #) is non empty right_complementable strict Abelian add-associative right_zeroed ModuleStr over R
by Lm4;
end;

:: deftheorem defines LeftModule VECTSP_2:def 4 :
for R being Ring holds LeftModule R = ModuleStr(# the carrier of R, the addF of R,(0. R), the multF of R #);

deffunc H2( Ring) -> RightModStr over $1 = RightModStr(# the carrier of$1, the addF of $1,(0.$1), the multF of $1 #); Lm5: for R being Ring holds ( H2(R) is Abelian & H2(R) is add-associative & H2(R) is right_zeroed & H2(R) is right_complementable ) proof end; registration let R be Ring; existence ex b1 being non empty RightModStr over R st ( b1 is Abelian & b1 is add-associative & b1 is right_zeroed & b1 is right_complementable & b1 is strict ) proof end; end; definition let R be Ring; func RightModule R -> non empty right_complementable Abelian add-associative right_zeroed strict RightModStr over R equals :: VECTSP_2:def 5 RightModStr(# the carrier of R, the addF of R,(0. R), the multF of R #); coherence RightModStr(# the carrier of R, the addF of R,(0. R), the multF of R #) is non empty right_complementable Abelian add-associative right_zeroed strict RightModStr over R by Lm5; end; :: deftheorem defines RightModule VECTSP_2:def 5 : for R being Ring holds RightModule R = RightModStr(# the carrier of R, the addF of R,(0. R), the multF of R #); definition let R be non empty 1-sorted ; let V be non empty RightModStr over R; let x be Element of R; let v be Element of V; func v * x -> Element of V equals :: VECTSP_2:def 6 the rmult of V . (v,x); coherence the rmult of V . (v,x) is Element of V ; end; :: deftheorem defines * VECTSP_2:def 6 : for R being non empty 1-sorted for V being non empty RightModStr over R for x being Element of R for v being Element of V holds v * x = the rmult of V . (v,x); deffunc H3( Ring, Ring) -> BiModStr over$1,$2 = BiModStr(# ,op2,op0,(pr2 ( the carrier of$1,)),(pr1 (, the carrier of \$2)) #);

Lm6: for R1, R2 being Ring holds
( H3(R1,R2) is Abelian & H3(R1,R2) is add-associative & H3(R1,R2) is right_zeroed & H3(R1,R2) is right_complementable )

proof end;

registration
let R1, R2 be Ring;
existence
ex b1 being non empty BiModStr over R1,R2 st
( b1 is Abelian & b1 is add-associative & b1 is right_zeroed & b1 is right_complementable & b1 is strict )
proof end;
end;

definition
let R1, R2 be Ring;
func BiModule (R1,R2) -> non empty right_complementable Abelian add-associative right_zeroed strict BiModStr over R1,R2 equals :: VECTSP_2:def 7
BiModStr(# ,op2,op0,(pr2 ( the carrier of R1,)),(pr1 (, the carrier of R2)) #);
coherence
BiModStr(# ,op2,op0,(pr2 ( the carrier of R1,)),(pr1 (, the carrier of R2)) #) is non empty right_complementable Abelian add-associative right_zeroed strict BiModStr over R1,R2
by Lm6;
end;

:: deftheorem defines BiModule VECTSP_2:def 7 :
for R1, R2 being Ring holds BiModule (R1,R2) = BiModStr(# ,op2,op0,(pr2 ( the carrier of R1,)),(pr1 (, the carrier of R2)) #);

theorem Th23: :: VECTSP_2:23
for R being Ring
for x, y being Scalar of R
for v, w being Vector of () holds
( x * (v + w) = (x * v) + (x * w) & (x + y) * v = (x * v) + (y * v) & (x * y) * v = x * (y * v) & (1. R) * v = v )
proof end;

registration
let R be Ring;
existence
ex b1 being non empty ModuleStr over R st
( b1 is vector-distributive & b1 is scalar-distributive & b1 is scalar-associative & b1 is scalar-unital & b1 is Abelian & b1 is add-associative & b1 is right_zeroed & b1 is right_complementable & b1 is strict )
proof end;
end;

definition end;

Lm7: for R being Ring holds
( LeftModule R is vector-distributive & LeftModule R is scalar-distributive & LeftModule R is scalar-associative & LeftModule R is scalar-unital )

by Th23;

registration
let R be Ring;
coherence by Lm7;
end;

:: 18. AXIOMS OF LEFT MODULE OF RING
theorem Th24: :: VECTSP_2:24
for R being Ring
for x, y being Scalar of R
for v, w being Vector of () holds
( (v + w) * x = (v * x) + (w * x) & v * (x + y) = (v * x) + (v * y) & v * (y * x) = (v * y) * x & v * (1_ R) = v )
proof end;

definition
let R be non empty doubleLoopStr ;
let IT be non empty RightModStr over R;
attr IT is RightMod-like means :Def8: :: VECTSP_2:def 8
for x, y being Scalar of R
for v, w being Vector of IT holds
( (v + w) * x = (v * x) + (w * x) & v * (x + y) = (v * x) + (v * y) & v * (y * x) = (v * y) * x & v * (1_ R) = v );
end;

:: deftheorem Def8 defines RightMod-like VECTSP_2:def 8 :
for R being non empty doubleLoopStr
for IT being non empty RightModStr over R holds
( IT is RightMod-like iff for x, y being Scalar of R
for v, w being Vector of IT holds
( (v + w) * x = (v * x) + (w * x) & v * (x + y) = (v * x) + (v * y) & v * (y * x) = (v * y) * x & v * (1_ R) = v ) );

registration
let R be Ring;
existence
ex b1 being non empty RightModStr over R st
( b1 is Abelian & b1 is add-associative & b1 is right_zeroed & b1 is right_complementable & b1 is RightMod-like & b1 is strict )
proof end;
end;

definition end;

Lm8: for R being Ring holds RightModule R is RightMod-like
by Th24;

registration
let R be Ring;
coherence by Lm8;
end;

Lm9: for R1, R2 being Ring
for x, y being Scalar of R1
for p, q being Scalar of R2
for v, w being Vector of (BiModule (R1,R2)) holds
( x * (v + w) = (x * v) + (x * w) & (x + y) * v = (x * v) + (y * v) & (x * y) * v = x * (y * v) & (1_ R1) * v = v & (v + w) * p = (v * p) + (w * p) & v * (p + q) = (v * p) + (v * q) & v * (q * p) = (v * q) * p & v * (1_ R2) = v & x * (v * p) = (x * v) * p )

proof end;

definition
let R1, R2 be Ring;
let IT be non empty BiModStr over R1,R2;
attr IT is BiMod-like means :Def9: :: VECTSP_2:def 9
for x being Scalar of R1
for p being Scalar of R2
for v being Vector of IT holds x * (v * p) = (x * v) * p;
end;

:: deftheorem Def9 defines BiMod-like VECTSP_2:def 9 :
for R1, R2 being Ring
for IT being non empty BiModStr over R1,R2 holds
( IT is BiMod-like iff for x being Scalar of R1
for p being Scalar of R2
for v being Vector of IT holds x * (v * p) = (x * v) * p );

registration
let R1, R2 be Ring;
existence
ex b1 being non empty BiModStr over R1,R2 st
( b1 is Abelian & b1 is add-associative & b1 is right_zeroed & b1 is right_complementable & b1 is RightMod-like & b1 is vector-distributive & b1 is scalar-distributive & b1 is scalar-associative & b1 is scalar-unital & b1 is BiMod-like & b1 is strict )
proof end;
end;

definition end;

theorem :: VECTSP_2:25
for R1, R2 being Ring
for V being non empty BiModStr over R1,R2 holds
( ( for x, y being Scalar of R1
for p, q being Scalar of R2
for v, w being Vector of V holds
( x * (v + w) = (x * v) + (x * w) & (x + y) * v = (x * v) + (y * v) & (x * y) * v = x * (y * v) & (1_ R1) * v = v & (v + w) * p = (v * p) + (w * p) & v * (p + q) = (v * p) + (v * q) & v * (q * p) = (v * q) * p & v * (1_ R2) = v & x * (v * p) = (x * v) * p ) ) iff ( V is RightMod-like & V is vector-distributive & V is scalar-distributive & V is scalar-associative & V is scalar-unital & V is BiMod-like ) ) ;

theorem Th26: :: VECTSP_2:26
for R1, R2 being Ring holds BiModule (R1,R2) is BiMod of R1,R2
proof end;

registration
let R1, R2 be Ring;
coherence
( BiModule (R1,R2) is Abelian & BiModule (R1,R2) is add-associative & BiModule (R1,R2) is right_zeroed & BiModule (R1,R2) is right_complementable & BiModule (R1,R2) is RightMod-like & BiModule (R1,R2) is vector-distributive & BiModule (R1,R2) is scalar-distributive & BiModule (R1,R2) is scalar-associative & BiModule (R1,R2) is scalar-unital & BiModule (R1,R2) is BiMod-like )
by Th26;
end;

theorem :: VECTSP_2:27
for L being non empty multLoopStr st L is well-unital holds
1. L = 1_ L by Lm1;

theorem :: VECTSP_2:28
for K being non empty right_complementable right-distributive right_unital add-associative right_zeroed doubleLoopStr
for a being Element of K holds a * (- (1. K)) = - a
proof end;

theorem :: VECTSP_2:29
for K being non empty right_complementable left-distributive left_unital add-associative right_zeroed doubleLoopStr
for a being Element of K holds (- (1. K)) * a = - a
proof end;

theorem :: VECTSP_2:30
for F being non degenerated almost_left_invertible Ring
for x being Scalar of F
for V being non empty right_complementable vector-distributive scalar-distributive scalar-associative scalar-unital add-associative right_zeroed ModuleStr over F
for v being Vector of V holds
( x * v = 0. V iff ( x = 0. F or v = 0. V ) )
proof end;

theorem :: VECTSP_2:31
for F being non degenerated almost_left_invertible Ring
for x being Scalar of F
for V being non empty right_complementable vector-distributive scalar-distributive scalar-associative scalar-unital add-associative right_zeroed ModuleStr over F
for v being Vector of V st x <> 0. F holds
(x ") * (x * v) = v
proof end;

theorem Th32: :: VECTSP_2:32
for R being non empty right_complementable right_unital well-unital distributive Abelian add-associative right_zeroed associative doubleLoopStr
for V being non empty right_complementable add-associative right_zeroed RightMod-like RightModStr over R
for x being Scalar of R
for v being Vector of V holds
( v * (0. R) = 0. V & v * (- (1_ R)) = - v & (0. V) * x = 0. V )
proof end;

theorem Th33: :: VECTSP_2:33
for R being non empty right_complementable right_unital well-unital distributive Abelian add-associative right_zeroed associative doubleLoopStr
for V being non empty right_complementable add-associative right_zeroed RightMod-like RightModStr over R
for x being Scalar of R
for v, w being Vector of V holds
( - (v * x) = v * (- x) & w - (v * x) = w + (v * (- x)) )
proof end;

theorem Th34: :: VECTSP_2:34
for R being non empty right_complementable right_unital well-unital distributive Abelian add-associative right_zeroed associative doubleLoopStr
for V being non empty right_complementable add-associative right_zeroed RightMod-like RightModStr over R
for x being Scalar of R
for v being Vector of V holds (- v) * x = - (v * x)
proof end;

theorem :: VECTSP_2:35
for R being non empty right_complementable right_unital well-unital distributive Abelian add-associative right_zeroed associative doubleLoopStr
for V being non empty right_complementable add-associative right_zeroed RightMod-like RightModStr over R
for x being Scalar of R
for v, w being Vector of V holds (v - w) * x = (v * x) - (w * x)
proof end;

theorem :: VECTSP_2:36
for F being non degenerated almost_left_invertible Ring
for x being Scalar of F
for V being non empty right_complementable add-associative right_zeroed RightMod-like RightModStr over F
for v being Vector of V holds
( v * x = 0. V iff ( x = 0. F or v = 0. V ) )
proof end;

theorem :: VECTSP_2:37
for F being non degenerated almost_left_invertible Ring
for x being Scalar of F
for V being non empty right_complementable add-associative right_zeroed RightMod-like RightModStr over F
for v being Vector of V st x <> 0. F holds
(v * x) * (x ") = v
proof end;

registration
coherence
proof end;
end;