Last updated: 27 September 2014
First important point: You cannot prove anything without having the definitions clearly stated.
Show that in the integers.
This problem is impossible without knowing, exactly, the definition of
Types of proofs:
(1) |
To show: If A then B Assume A To show: B |
(2) |
To show: There exists such that C Let To show: C |
(3) |
To show: such that C is unique. Assume satisfies C Assume satisfies C To show: |
(4) |
Proofs by induction To show: If then B Base Case: Assume To show: B Base Case: Assume To show: B Base Case: Assume To show: B Do enough base cases so that the pattern is clear. Induction step Assume that if and then B. To show: B This proof should be exactly the same as your last base case (say you did base cases to except with replacing 5. |
(5) |
Proofs by contradiction. To show: If A and B and C then D Assume A Assume B Assume C Proof by contradiction. Assume not D Then Proceed until you derive a contradiction to something that was assumed. Then not B This is a contradiction to B So if A and B and C then D. |
A proof is the explanation of why something is true.
Proof machine is a way of formulating this explanation in an organised way which conforms to the conventions of logical sequencing.
A remark on the definition of isometry.
Definition 2.4.6 p. 56 of Groves-Hodgson:
Let be a linear transformation on an inner product space
is an isometry if
§3.8.4 p. 118 of Groves-Hodgson:
An isometry of is a function
such that if then
Explain why these two uses of the term "isometry" are not inconsistent.
Assume
is a linear transformation.
To show: |
|
These are a typed copy of Lecture 33 from a series of handwritten lecture notes for the class Group Theory and Linear Algebra given on October 21, 2011.