GRÖBNER BASIS

POWER POINT PRESENTATION BY

PRIYANUJ SAIKIA
MTHM – 02/18
 CONTENTS
INTRODUCTION
PROPERTIES
Basis for a matrix & its
properties
Coordinates & change of
basis
Application
Conclusion
Reference
  INTRODUCTION
In mathematics, basis is a linearly independent spanning set.
i.e.
A set Y which is subset of a vector space V ( Y V ) over a field F
is called Basis if it satisfied the following conditions :
 Y spans V i.e. every element of V can be written in a unique way
as a (finite) linear combination of elements of Y.
For  v € V, v =∑ai yi where ai € F & yi € Y
 Y is linearly independent i.e. for  subset U of Y ( U  Y) , ∑ bi ui
= 0 if  bi = 0 ,where bi € F & ui € U
The coefficients of this linear combination are referred to
as components or coordinates on Y of the vector. The elements of a
basis are called Basis Vector & the no of Basis vector is called
Dimension of the vector space.
 SOME SPECIAL KIND OF
BASIS :---
Standard Basis :
Let S be the space of all

k-dimensional vectors. Denote by ek a vector

whose k-th entry is equal to 1 and whose
remaining k-1 entries are equal to 0.Then, the This picture illustrates the standard basis in R2.
set of k vectors{e1,e2,…ek } is called the standard The blue and orange vectors are the elements of
the basis; the green vector can be given in terms
basis of S
of the basis vectors, and so is linearly
Standard Basis for different vector dependent upon them.
space :
I. For Rn : the set { (1,0,…O),…..,(0,0,…..1)} whose cardinality is n.

II. For a Matrix space : {Eij | 1im , 1jn} and in Eij { aij =1 & other entries are are 0
III. For polynomials : for pn (x), the set {1,x,x2…..xn }
  PROPERTIES
 The linear combination representation of the basis is unique.
If Y={ y1, y2, y3…..Ym } is a basis of the finite dimensional
vector space V over F & X={x1,x2, x3,…xn } is linearly independent
set of vectors of V , then n≤m.
 Everybasis of a finite dimensional vector over a field has the
same number of elements.
 If Y={ y1, y2, y3 ….. Ym } is a basis of the vector space V over F,
then any m+1 vectors of V necessarily form a linearly dependent
set.
 BASIS FOR A MATRIX
Let A be a m×n matrix .
a) Basis for row space of a matrix A[RS(A)] : it is the set of row vectors of
A {A(1), A(2),…..A(m)} if the set is linearly independent.
b) Basis for column space of a matrix A[CS(A)] : it is the set of column
vectors of A {A(1), A(2),…..A(m)} if the set is linearly independent.
here ,
Row space of A is a subspace of Rn spanned by the row vectors of A:
RS ( A)  {1 A(1)   2 A( 2)  ...   m A(m) | 1, 2 ,..., m  R} &
Column space of A is a subspace of Rm spanned by the column vectors of
A:
CS ( A)  {1 A   2 A     n A
(1) (2) ( n)
1 , 2 ,n  R}
 PROPERTIES
a.Basis for row space of a matrix is equal to the set
of non- zero rows of row echolen form of the
matrix .
b.Basis for column space of a matrix is equal to the
set of non- zero column of column echolen form of
the matrix .
c.Dim(RS[matrix])=dim(CS[matrix])=rank(matrix)
  COORDINATES
k  & CHANGE OF BASIS
v  V , [ v ]B   1 
k 2 
 Ex: k1u1 ofk 2basis(To
v Change u2 represent the basis vectors in B’ by the coordinate matrices relative to B)
 k1 (au1  bu 2 )  k 2 (cu1  du 2 )
Consider two bases for a vector space V(B’ is the original basis and B is the target basis)
 (k1a  k 2 c)u1  (k1b  k 2 d )u 2
Consider any
 k1a  k2c  a c   k1 
B  {u1 , u2}, B  {u1 , u2 }  [ v ]B      k 
 1
k b  k 2 
d  b d  2 
a  c 
If [u1 ]B   , [u2 ]B     u1 B u2 B  v B
b  d  (v is expressed as a coordinate matrix relative to the basis B’)
(v can be expressed as a coordinate matrix relative to the basis B)

i.e., u1  au1  bu 2 , u2  cu1  du 2

 APPLICATION
Since GRÖBER BASIS algorithms may be considered as nonlinear
generalizations of Gaussian elimination for systems of linear equations, they
have very widespread applicability. Below is a random collection of applications
of GRÖBER BASIS .
 effective computation with (holonomic) special functions
 solving Diophantine equations (Pell)
 automated geometry theorem proving.
 coding theory
 signal and image processing
 robotics
 graph coloring problems e.g. Sudoku puzzles
 extrapolating "missing links" in Palaeontology, and Phylogenetic
tree construction
PROCESS

Access
needed

Select
technology
Determine
scale
 CONCLUSION
 REFERENCE
• Wikipedia
• https://math .stackexchange.com
• Abstract Algebra(2nd edition)
-- David S Dummit ,Richard M. Foote
•Theory & problems of Linear Algebra(SI [metric] edition)
--Seymour Lipschutz
THANK YOU