14-240/Tutorial-October7: Difference between revisions

From Drorbn
Jump to navigationJump to search
Line 9: Line 9:
=====Proof 1=====
=====Proof 1=====


Let <math>W_1</math>, <math>W_2</math> be subspaces of a vector space <math>V</math>. We show that <math>W_1 \cup W_2</math> is a subspace
Let <math>W_1</math>, <math>W_2</math> be subspaces of a vector space <math>V</math>.


<math>\implies W_1 \subset W_2 \or W_2 \subset W_1</math>.
We show that <math>W_1 \cup W_2</math> is a subspace <math>\implies W_1 \subset W_2 \or W_2 \subset W_1</math>.


:Assume that <math>W_1 \cup W_2</math> is a subspace.
:Assume that <math>W_1 \cup W_2</math> is a subspace.

Revision as of 20:17, 15 October 2014

Boris

Subtle Errors in Proofs

Check out these proofs:

Proof 1

Let , be subspaces of a vector space .

We show that is a subspace .

Assume that is a subspace.
Let , .
Then .
Then .
Then .
Case 1: :
Since and has additive inverses, then .
Then .
Case 2: :
Since and has additive inverses, then .
Then .
Then .
Then . Q.E.D.
Proof 2

Let . Then , define

and . We show that is not a vector

space over .

We show that is not commutative.
Let .
Then .
Then is not commutative.
Then is not a vector space. Q.E.D.


Can you spot the subtle error in each?


In Proof 1, the equivalence of the "let" statement to the second last line and the last line is not obvious:

(1) Let . [Many lines] Then .

(2) Then .


Rewrite sentences (1) and (2) into a form that is easier to compare:

(1) .

(2) .


For Proof 1 to be correct, we must show that sentences (1) and (2) are equivalent. Alternatively, alter the structure of Proof 1 into a proof by contradiction or into proof in which you assume that one of the conditions in the disjunction is satisfied.


In Proof 2, the only thing that is shown is that is not the additive identity. For Proof 2 to be correct, either plug in a vector that is not or show that is the additive identity by some other means, which introduces a contradiction.

Nikita