Correct reasoning about direct sums proof?

  • Thread starter Thread starter quasar_4
  • Start date Start date
  • Tags Tags
    Proof Sums
quasar_4
Messages
273
Reaction score
0
Howdy everyone. I'm not very good at writing proofs, so I am wondering if someone can tell me if I'm even on the right page with this. I am not sure if I understand the idea correctly. The theorem goes as follows: Suppose V is a finite dim. vector space with subspaces U and W such that V is the direct sum of U and W. Let Z also be a subspace of V. Then Z cannot equal the direct sums of (i) the intersection of Z and U and (ii) the intersection of Z and W unless Z is a subspace of U or W.

Here's my thoughts:

Let "C" denote the direct sum of the intersections (i) and (ii) above. Then two conditions must hold:
1) The intersection of the intersections (i) and (ii) must be the zero vector; and
2) The sum of the intersections must equal V.

The elements of C are given as {x|x is in Z and x is in U and x is in W}={0v}. Thus every x in Z that intersects U and W is in C. But we have that C={0v} since it is a direct sum. The only way that {0v}=(ZintersectU)intersect(ZintersectW) is if Z contains only the zero vector. Thus Z is the zero subspace, and it follows that Z must be a subspace of U and W.

Yeah, let me know if that's right... I'm not sure that I am correct in asserting that Z contains only the zero vector. :rolleyes:
 
Physics news on Phys.org
quasar_4 said:
The elements of C are given as {x|x is in Z and x is in U and x is in W}={0v}.
Why?
 
well it sounded reasonable to me... if C is the set of {(Z intersects U) intersects (Z intersects W)}. So for (Z intersects U) we have the set containing {x|x is in Z and x is in U} and similarly for (Z intersects W) we have the set {x|x is in Z and x is in W}.
The direct sum would have all of these x too... wouldn't it? Although looking above it seems that I mixed up an intersection and direct sum. But even so, the intersection of the two intersections has to be the zero vector.
 
quasar_4 said:
Although looking above it seems that I mixed up an intersection and direct sum. But even so, the intersection of the two intersections has to be the zero vector.
Yes, which means your second sentence is irrelevant! So what if the intersection of those two things is {0}? C (the direct sum) will certainly contain this, but it definitely does not have to equal it.
 
quasar_4 said:
Howdy everyone. I'm not very good at writing proofs, so I am wondering if someone can tell me if I'm even on the right page with this. I am not sure if I understand the idea correctly. The theorem goes as follows: Suppose V is a finite dim. vector space with subspaces U and W such that V is the direct sum of U and W. Let Z also be a subspace of V. Then Z cannot equal the direct sums of (i) the intersection of Z and U and (ii) the intersection of Z and W unless Z is a subspace of U or W.

Here's my thoughts:

Let "C" denote the direct sum of the intersections (i) and (ii) above. Then two conditions must hold:
1) The intersection of the intersections (i) and (ii) must be the zero vector; and
2) The sum of the intersections must equal V.

The elements of C are given as {x|x is in Z and x is in U and x is in W}={0v}. Thus every x in Z that intersects U and W is in C. But we have that C={0v} since it is a direct sum. The only way that {0v}=(ZintersectU)intersect(ZintersectW) is if Z contains only the zero vector. Thus Z is the zero subspace, and it follows that Z must be a subspace of U and W.

Yeah, let me know if that's right... I'm not sure that I am correct in asserting that Z contains only the zero vector. :rolleyes:

Maybe you've already proved it. If not, here's a suggestion.

Put the statement into a form that'll shed some more light on the different options you have for proving it.
The first thing I'd do is get rid of the "unless"; then you'll have a positive statement. It'll be an implication.
Move its antecedent into your list of hypotheses (giving you more stuff to work with).
Notice the antecedent's a disjunction (which suggests one proof method).
Of course, there are other options too.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top