MATH 223: Some results for 2 2 matrices.
One can preview a lot of the theory in this course by looking at the special case of 2 2
matrices. The proofs are relatively easy in this limited context and not all the complexity is seen.
In particular, the Gauss
MATH 223: Some results for 2 2 matrices.
Multiplicative Inverses
It would be nice to have a multiplicative inverse. That is given a matrix A, nd the inverse
matrix A1 so that AA1 = A1 A = I. Such an inverse can be shown to be unique, if it exists
(How?).
MATH 223 Systems of Dierential Equations including example with Complex Eigenvalues
First consider the system of DEs which we motivated in class using water passing through two
tanks ushing out salt.
1
y1 (t) = 10 y1 (t) +
1
y2 (t) = 10 y1 (t)
1
y (t)
40
MATH 223
Complex Numbers
When solving a quadratic (over R) you may nd
there are no roots but you notice that you get
expressions involving 1. Rather than interpret 1 as a number, we can proceed as follows.
We dene
C = cfw_a + bi : a, b R
and show that wit
Math 223
Symmetric and Hermitian Matrices.
An n n matrix Q is orthogonal if QT = Q1 . The columns of Q would form an orthonormal
basis for Rn . The rows would also form an orthonormal basis for Rn .
A matrix A is symmetric if AT = A.
Theorem Let A be a sy
MATH 223: Extremal Set Theory
I would like to demonstrate one proof of a result of Sauer, Perles and Shelah, Vapnik and
Chervonenkis from 1971,1972. The proof is due to Smolensky and is from 1997. There are a variety
of proofs, basic induction works ne.
T
MATH 223. Vectors and Geometry.
We have already seen that geometry shows up strongly in linear algebra in the rotation matrix
R(). There are further remarkable interactions that are important in many applications. One
typically sees some of these applicat
MATH 223 - FINAL EXAM
DECEMBER 2013
Name:
Student ID:
Exam rules:
No calculators, open books or notes are allowed.
You do not need to prove results that we proved in class or that appeared
in the homework.
There are 10 problems in this exam. Each probl
CPSC 121: Models of Computation
Module 5: Predicate Logic
Module 5: Predicate Logic
Midterm 1:
Friday October 9th, 17:00 to 18:15
A to Leung: room ESB 1013
Levy to Z: room CIRS 1250
Modules 1 to 4, plus
The pre-reading for module 5 (predicate logic).
Ever
CPSC 121: Models of Computation
Module 9: Proof Techniques (part 2)
Mathematical Induction
CPSC 121 2015W T1
1
Module 9: Mathematical Induction
Midterm #2:
Format similar to that of midterm #1.
Friday November 13th, 17:00 to 18:15
A to Leung: room ESB 101
00113
THE UNIVERSITY OF BRITISH COLUMBIA
CPSC 210: MIDTERM EXAMINATION - November 7, 2016
Last Name: ( M3, First Name: 8 Mm
Signature: :mg ( A] UBC Student #: M
Important notes about this examination
1. You should have received a separate collection of