Linear Algebra
Code  Completion  Credits  Range  Language 

BIELIN  Z,ZK  7  4P+2C  English 
 Garant předmětu:
 Lecturer:
 Tutor:
 Supervisor:
 Department of Applied Mathematics
 Synopsis:

Students understand the theoretical foundation of algebra and mathematical principles of linear models of systems around us, where the dependencies among components are only linear. They know the basic methods for operating with polynomials and linear spaces. They are able to perform matrix operations and solve systems of linear equations. They can apply these mathematical principles to solving problems in 2D or 3D analytic geometry. They understand errordetecting and errorcorrecting codes.
 Requirements:

Highschool mathematics.
 Syllabus of lectures:

1. Introduction: definition, theorem, proof. Types of proofs.
2. Set operations: Intersection, union, relative complement, Cartesian product. Maps, composite maps, inverse map, bijection, permutation.
3. Polynomials, roots of polynomials, irreducible polynomials. Polynomials in R, C, Q. Greatest common divisor and Euclidean algorithm. Binary operation, its properties. Group, ring, field. Homomorphisms (isomorphisms). Properties of a field. Finite fields.
4. Systems of linear equations. Gaussian elimination method.
5. Linear spaces, linear combination and linear independence.
6. Bases, dimensions, vector coordinates in a base. Coordinate transformations.
7. Matrices, matrix operations.
8. Determinants. Inverse matrices.
9. Linear map, linear map matrix. Rotation, projection onto a straight line (plane), symmetry with respect to a straight line (plane) in $R^2$, $R^3$.
10. Eigenvalues and eigenvectors of a matrix or a linear map.
11. Invariant subspaces. Jordan form.
12. Bilinear and quadratic forms. Scalar product, orthogonality. Orthogonal complement. Euclidean and unitary space. Linear map of Euclidean and unitary spaces. Affine space. Affine transformation. Translation.
13. Selfcorrecting codes.
 Syllabus of tutorials:

1. Operations with polynomials.
2. Roots of polynomials. Euclidean algorithm. Greatest common divisor.
3. Sets of linear equations. Gaussian elimination method.
4. Linear dependence and independence.
5. Bases, dimensions, vector coordinates in a base. Coordinate transformations.
6. Matrices, matrix operations.
7. Determinants and their calculation. Inverse matrices and their calculation.
8. Linear map, linear map matrix.
9. Eigenvalues and eigenvectors of a matrix.
10. Jordan form.
11. Bilinear and quadratic forms.
12. Scalar product, orthogonality. Affine transformation. Translation.
13. Selfcorrecting codes.
 Study Objective:

The aim of the module is to build the foundations of mathematical way of thinking and provide students with basic knowlege of linear algebra necessary to solve systems of linear equations or problems in 2D and 3D analytic geometry.
 Study materials:

1. Pták, P. ''Introduction to Linear Algebra''. ČVUT, Praha, 2005.
 Note:
 Further information:
 https://courses.fit.cvut.cz/BIELIN/
 No timetable has been prepared for this course
 The course is a part of the following study plans:

 Bachelor branch Security and Information Technology, in English, 20152020 (compulsory course in the program)
 Bachelor branch Web and Software Engineering, spec. Software Engineering, in English, 20152020 (compulsory course in the program)
 Bachelor branch Computer Science, in English, 20152020 (compulsory course in the program)
 Bachelor branch Computer Science, in English, 20152020 original version (compulsory course in the program)
During a review of study plans, the course BIELA1.21 can be substituted for the course BIELIN.