14-240/Tutorial-October7: Difference between revisions

From Drorbn
Jump to navigationJump to search
Line 15: Line 15:
:Assume that <math>W_1 \cup W_2</math> is a subspace.
:Assume that <math>W_1 \cup W_2</math> is a subspace.


:Let <math>x \in W_1, y \in W_2</math>.
:Let <math>x, y \in W_1 \cup W_2</math>.


:Then <math>x, y \in W_1 \cup W_2</math> and <math>x + y \in W_1 \cup W_2</math>.
:Then <math>x + y \in W_1 \cup W_2</math> and <math>x + y \in W_1 \or x + y \in W_2</math>.

:Then <math>x + y \in W_1 \or x + y \in W_2</math>.


:Case 1: <math>x + y \in W_1</math>:
:Case 1: <math>x + y \in W_1</math>:


::Since <math>x \in W_1</math> and <math>W_1</math> has additive inverses, then <math>(-x) \in W_1</math>.
::Since <math>x \in W_1 \cup W_2</math> and <math>W_1 \cup W_2</math> has additive inverses, then <math>(-x) \in W_1 \cup W_2</math>.


::Then <math>(x+y)+(-x)=y \in W_1</math>.
::Then <math>(x+y)+(-x)=y \in W_1</math>.
Line 29: Line 27:
:Case 2: <math>x + y \in W_2</math>:
:Case 2: <math>x + y \in W_2</math>:


::Since <math>y \in W_2</math> and <math>W_2</math> has additive inverses, then <math>(-y) \in W_2</math>.
::Since <math>y \in W_1 \cup W_2</math> and <math>W_1 \cup W_2</math> has additive inverses, then <math>(-y) \in W_1 \cup W_2</math>.


::Then <math>(x+y)+(-y)=x \in W_2</math>.
::Then <math>(x+y)+(-y)=x \in W_2</math>.
Line 62: Line 60:
=====Error in Proof 1=====
=====Error in Proof 1=====


The error in the proof is the equivalence of these two statements.
The error in the proof is the logical equivalence of these two statements.


(1) Let <math>x \in W_1, y \in W_2</math>. ... Then <math>x \in W_2 \or y \in W_1</math>.
(1) Let <math>x, y \in W_1 \cup W_2</math>. ... Then <math>x \in W_2 \or y \in W_1</math>.


(2) Then <math>W_1 \subset W_2 \or W_2 \subset W_1</math>.
(2) Then <math>W_1 \subset W_2 \or W_2 \subset W_1</math>.


We can rewrite (1) and (2) to see their difference from each other:

(1) <math>\forall x \in W_1, \forall y \in W_2, (x \in W_2 \or y \in W_1)</math>.

(2) <math>(\forall x \in W_1, x \in W_2) \or (\forall y \in W_2, y \in W_1)</math>.





Revision as of 15:00, 13 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 and .
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?


Error in Proof 1

The error in the proof is the logical equivalence of these two statements.

(1) Let . ... Then .

(2) Then .


Error in Proof 2

Nikita