Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

MAT 214

BINARY OPERATIONS
G*=(G,*)

1. Groupoid: A set A on which a bin op * is defined. It is closed under a given bin op which is
written as (A,*) for the groupoid A. E.g.: (Z,-), (N,*)
a∗b ∈ A a , b ∈ A−[1]
2. Semigroup: An associative groupoid. A set with BO * is a semigroup  it is
1 and a∗( b∗c )= ( a∗b )∗c , a , b , c ∈ A−[2]
3. Monoid: a semigroup with an identity element
1 , 2∧∃e ∈ A ∋ ∀ a ∈ A , a∗e=e∗a=a
4. Group: a monoid G* in which every element has an inverse.
1 , 2,∧3∀ a ∈ A , ∃ b∈ A ∋ a∗b=b∗a=e
5. Abelian group: A commutative group
1 , 2, 3∧4a∗b=b∗a , ∀ a , b ∈ A

Definitions of Terms
1) Set: collection of distinct objects, known as elements
2) Space: a set in which the list of elements are defined by a collection of axioms for how each
element relates to another within the set
3) Subspace W of vs V over field F is a non-empty subset which itself is a VS under the same op in V
W is a ss of V iff W ≠ ∅ W is closed under vector addition
W is closed under scalar multiplication
4) Field: A space of individual numbers, usually real or complex.
5) Vector Space: a nonempty set V of objects, called vectors, on which are defined two ops, + and x,
by scalars (real numbers), subject to the 10 axioms listed below.
∀ vectors u , v∧w ∈ V ∧scalars c∧d ∈ F
(a) u+ v ∈ V
(b) ∀ u ∈V ∧c ∈ F , cu ∈V
(c) u+ v=v+ u
(d) ( u+ v ) +w=u+(v +w)
(e) ∃0 ∈ V ∋ ∀ u∈ V ,u+ 0=u
(f) ∃−u ∈V ∋ ∀ u ∈V , u+ (−u )=0
(g) ∃1 ∈V ∋ ∀ u ∈V , 1 u=u
(h) ∀ u ∈V ,∧∀ ( c , d ) ∈ F , ( cd ) u=c(du)
(i) ∀ u ∈ F ,∧( u , v ) ∈V , c ( u+ v )=cu+cv
(j) ∀ u ∈V ,∧( c , d ) ∈ F , ( c +d ) x=cx +dx
Apparently when 1, 4, 6 are proven,

LINEAR INDEPDENDENCE AND DEPENDENCE


The vectors v 1 , v 2 , … v n ∈ V are LD if ∃ λ1 , … , λn ∈ F , not all=0 ,∋ λ1 v 1+ λ2 v 2 +…+ λn v n=0
¿ is LI ifit has a trivial solution
A singleton, containing a zero vector islin dep .
A set of two vectors is lindep if one is a multiple of the other

MATRIX
TERMS
T T
Symmetric → a SM A= A Skew−Sym →a SM A =− A , diagonal elements=0
Scalar → A=αI Diagonal : all non−diagonal entries are zero
UTM :Thisis an n−square ¿=( U ij ) , ∋U ij=0 , for i> j , ( numbers are upper )
LTM : L=( Lij ) , ∋ Lij =0 , for i< j , ( numbers arelower )Orthogonal= A T = A−1 → A AT =I
θ T
A =( A ) Hermitian ¿ SM A= A , skew if A=− A Unitary ¿ Aθ A=I Idempotency : A2 =A
Involuntary : A =I Proper ¿| A|=1
2

LAWS
1
A =
−1
( adj ( A ) ) Proof : A A−1=I ∧A ( adj ( A ) )=| A| I , then equatingusing I
| A| A
Rule of Saurus : diagonal D of a ( 3 ,3 ) ¿adj ( A )= ( ¿ co−factors of A )T | A T|=| A|| AB|=| A||B|
| A|=0 → singular ∨non−invertibleInterchanging 2 columns → ¿ changes

| |
x y1 1
1 1
Areaof a ∆ ABC , A ( x 1 , y 1 ) , B ( x 2 , y 2 ) , C ( x 3 , y 3 ) A= x 2 y 2 1 ,if =0 they are collinear
2
x3 y3 1
1 AB∙ AC
If there is z , A= | AB|| AC |sin θ , withcos θ=
2 |AB|| AC|

| |
x1 y1 z1
Volume of Parallelopiped= x 2 y 2 z 2 AB∃if c of A=r of B ,∧is of order r of A , c of B
x3 y3 z3

DEFINITIONS
'
Echelon ¿ If all zero rows , if any , are at the matri x s bottom
Each leading nonzero entry ∈a row is ¿ the ¿ of theleading nonzero entry∈the preceding row¿
A=[ aij ] is an echelon ¿ there exist nonzero entries a1 j , a2 j , … , a rjwhere j 1 < j 2< …< j r

with the property that a ij=0 for { i<r , j< j i


i>r
SYSTEM OF EQUATIONS

()
a
Given equations resolved into a ¿ Y b =Z A=ref ( Y ) , C=ref (Y |Z )
c
if R ( A ) < R ( C ) → inconsistent systemif R ( A ) =R (C ) → consistent system
R ( A )=R ( C )=n→ solution isunique , n=no . of unknowns ( a , b , … )
unique , no solution ,infinite , find sol for λ=4 , μ=2x + y + z=6x +2 y+5 z=102 x+3 y + λz=μ

You might also like