#Factor spaces
1 messages · Page 1 of 1 (latest)
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close - Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
<= can be achieved with double inclusion maybe
If w = v + u, then w = v + u - v' + v' = v' + u'
Where u' = u - v' + v
Same reasoning for the reverse inclusion
I would say it's required
After all, we can treat this like an equation though, no?
-v' on both sides
it's not an equation
$v - v' + U = U$
Kepe
it's a set equality
Yeah it's not but I mean
We could prove that we can treat it like an equation
No?
the claim is
In a sense yes but it isn't the most straightforward way to prove that two sets are equal
this holds if and only if v-v' in U
two sets are equal when they contain the same elements
which is exactly what double inclusion proves
Yes
this is the most straightforward way to prove that those two sets are equal
That's the claim
on the one hand, if the set equality holds, then v = v' + u for some u in U
in particular u = v-v'
while it is very tempting to do set operations here as you suggest, there is little guarantee that they are logically sound
unless you have explicitly proven said properties for set operations
Are you referring to -v'-ing both sides or what aL said
the former
no
ok
Yes
I think the OP has already proven =>
the + in "v+U" doesnt have the same meaning as within V itself
so it need not have the same properties
Suppose v-v' in U. Take v+u in v+U. Then v+u = v' + (v-v' +u) in v'+U
the other inclusion is symmetrical
@short cradle
Hmm
How
v + u = v + (v - v')
look again
Suppose that $v - v' \in U$ for $v, v' \in V$. Then also $v' - v \in U$. We need to show that $v + U = v' + U$. \begin{align*} v + U &= {w \in V \mid w = v + u \text{ for a $u \in U$}} \ &= {w \in V \mid w = v + (v' - v + u') \text{ for a $u' \in U$}} \ &= {w \in V \mid w = v' + u' \text{ for a $u' \in U$}} \ &= v' + U\end{align*}
Kepe
Does this look fine?
This would be <= now
Line 2 and line 3 are very fishy
I think line 2 contains a mistake and line 3 is not super transparent, about whether it is really the same set or not
Again, that's why a reasoning by double inclusion is much more straightforward
Line 3 is just cancelling the v
I agree line 2 is a bit fishy but maybe we can save it?
the reason why it is not easier is that you still need to prove that your "simplification" doesn't exactly say whether you still have the same set
it's very difficult to carry set equality over several lines because you always need to justify whether they really are the same set or not
or due to a certain algebraic operation, one is a subset of the other
Justification for line 2: $v' - v \in U$ is not necessarily $= u$. But we can find some $u' \in U$ so that $v' - v + u' = u$.
Kepe
here, it happens to be the same set for every line, but you never justified why it's the same set (and the effort you would spend on this justification is far more than the effort spent on just double inclusion from the very beginning)
you get what i'm trying to say?
But I'm just simplifying the condition, they're equivalent
It's not like I'm changing something
this "equivalent" part is exactly what needs to be justified every line
What's the difference to [{(x, y)^{\tr} \in \mathbb R^2 \mid x + y = 1 +1} = {(x, y)^{\tr} \in \mathbb R^2 \mid x + y = 2}?]
Kepe
There, it's just a simplification too
Do I really need to justify here why they're equivalent?
Here it is trivial, but from line 1 to line 2 it's not trivial
Oh, I thought you meant line 2 to 3
Yeah I agree line 1 to 2 is a bit fishy
But can't it be justified by this
It's not a very rigorous justification
Or would it still not be clear
Again, remember that two sets are equal WHEN they contain the same elements
this is the definition you can't really escape
so, you must prove that the set from line 1 and the set from line 2 contain the same elements, in order to justify the step
Ok, so it's better to argue with inclusions, thank you!
Yeah, I've been trying to argue in favor of that for a while 🤣
You're welcome in any case
Yeah haha I was just trying to save my proof by arguing that what I'm doing is just a simplification of the condition, the condition remains the same
But yeah, to prove that we probably need to either again do inclusions
Or do my argument over again more rigorously
It's not worth the effort. A double inclusion is very clean and straightforward
especially when the reasoning is symmetrical here
What does that mean?
when you prove that LHS is a subset of RHS
the same method is used to prove that RHS is a subset of LHS
Just in reverse
yeah in a sense
Thank you
@short cradle has given 1 rep to @slim sedge
+close