Syllabus and course information.
Please come see me if you have any questions.
Office Hours: M-W-F: 13.00 - 14.00.
If these times are not convenient just make an appointment by email or phone!
Office: E6-1 4411
Email: andreash[at]kaist.edu
Phone: 350 7300
The TAs are currently working on grading the exams and are almost finished.
The schedule will be as follows:
Problem set and Solution.
Students will be divided into 2 classrooms based on student id number.
Room 1501: Student ID numbers from 20070034 to 20110353
Room 3435: Student ID numbers from 20110365 to 20120993
Notice!
The Claim session for the midterms will take place on Monday 04/09: 8 - 10.30 pm. (If you can't make it in this period you must contact the TAs or professor as soon as possible to reschedule.)
Warning: If you make a claim the problem will be entirely regraded: You do stand the chance of getting fewer points!
Claims take place in the following roomsThe grading criteria for TEST 2 can be downloaded here.
Problem set and solution.
Students will be divided into 2 classrooms based on student id number.
Room 1501: Student ID numbers from 20070034 to 20110353
Room 3435: Student ID numbers from 20110365 to 20120993
Notice!
Problem set and solution.
Students will be divided into 2 classrooms based on student id number.
Room 1501: Student ID numbers from 20070034 to 20110353
Room 3435: Student ID numbers from 20110365 to 20120993
Notice!
There will be two recitation classes. These are not mandatory, but it is highly recommended to attend. For many students, Linear Algebra is the first proper introduction to abstract mathematics, and it contains many new notions and ideas. It can therefore be helpful to attend recitation classes: Don't be afraid to ask questions !!
The TAs areMinki Kim
min901215[at]hanmail.net
OFFICE HOURS: Monday: 1pm - 2pm and Friday 10am - 12am Room 3427 (E6-1)
Chinkang Park
pjiga06[at]kaist.ac.kr
OFFICE HOURS: Tuesdays and Wednesdays after recitation class. Room 3427 (E6-1)
Class 1 :
Room 301, bldg E11
Tuesday, 19.00 -- 20.00
Class 2 :
Room 311, bldg E11
Wednesday, 19.00 -- 20.00
Below is a list of suggested problems to be covered in recitations. It is recommended to try to solve every problem in the book.
Every week there will be suggested homework . Homework is not mandatory.
Rules about HOMEWORK. If you decide to hand in homework, you WILL hand in your own original solutions. If the TAs suspect that you have COPIED your solution from another student, you will be punished. Students found guilty of handing in copied homework will receive a FAILING grade. The grading of homework is a service that we offer to the students. If students cannot follow the rules we have set, we may choose to stop grading homework. In this case your grade will be determined by the grade on midterm and final alone. Keep this in mind before you hand in copied homework. Not only will you receive a failing grade, but you will ruin the service for everyone else.
You can hand in your homework at Room : 3430 (E6-11) (You can also pick up your graded homework in this room.)
NOTICE: No delay will be accepted!
Homework Claim and Discussion. For students who are interested there will be homework claim and discussion on Mondays 3-5pm in room 3430 led by TA Kim, Minki.
This is an interesting problem which can be solved by using concepts from Linear Algebra.
Overview of the main concepts of Linear Algebra: Fields, Vectorspaces, Linear independence, Linear transformations.
Fields, systems of linear equations, matrices, linear combinations, row equivalence.
Matrices, elementary row operations, invertible matrices. Problem: There are n students that form m student clubs, subject to the following rules: Each club must contain an odd number of members, and every pair of clubs must have an even number of members in common. How large can m be ?
Vector spaces, examples, solution to odd club problem.
Linear combinations, subspaces, linear independence. Problem: There are n students that form m student clubs. Show that if m > n then there are non-empty disjoint subsets I and J of [m] such that the union of the Si with i in I equals the union of the Sj with j in J.
Basis, dimension, the basis extension property, examples.
Inclusion-exclusion principle for subspaces, coordinates, more on row equivalence, computational questions.
Balanced union: n students, m clubs, m >
n.
Two-distance sets in Euclidean space: How many points can one have
in Rn such that only two distances are realized?
Symmetric matrices *: Let S be a symmetric matrix over the binary
field where every diagonal element is non-zero. Show that the all
1's vector is in the row space of S.
Linear transformations, null space, range, the rank theorem.
Algebraic properties of linear transformations, the space of linear transformations, linear operators.
Invertible linear operators, isomorphism of vector spaces, matrix representations of linear transformations.
The dual space V*, the dual basis.
The double dual, the transpose of a linear transformation.
Space of formal power series, subspace of polynomials.
Polynomial division, polynomial ideals, principle ideal generated by p, GCD.
Irreducible polynomials, primary decomposition of polynomials.
Introduction to canonical forms, diagonalizable operators, characteristic values.
Minimal polynomial of an operator.
Invariant subspaces and conductors.
Necessary and sufficient conditions for triangulable operators.
Necessary and sufficient conditions for diagonalizable operators.
Direct sum decompositions and projections.
Invariant direct sum decompositions.
The Primary decomposition theorem
Decomposition of an operator into Diagonalizable and Nilpotent parts.
Cyclic subspaces. The annihilator.
T-admissible subspaces, the cyclic decomposition theorem.
Cyclic decomposition theorem: proof of existence.
Cyclic decomposition theorem: proof of uniqueness.
Counting similarity classes of matrices.
The Jordan Canonical form
The Smith Normal Form: computing invariant factors.