- #1
kaosAD
- 33
- 0
If A and B are nonempty convex sets. And C = A + B. How to prove int(C) = int(A) + int(B)?
Last edited:
Have you tried some concerete examples?kaosAD said:This is what I have tried a some what modified problem. But it goes nowhere.
I will use 'cl' to mean closure and 'bd' to mean boundary. Assume A = cl(A) and B = cl(B) to make life easier for me. Let [tex]\bar{x} \in \textup{bd}(A)[/tex]. Consider a sequence [tex]\{x_k\}[/tex] belonging to int(A) and converging to a limit point [tex]\bar{x}[/tex]. Pick any [tex]y \in B[/tex]. Hence the sequence [tex]\{x_k + y\}[/tex] converges to some point, say [tex]\bar{z}[/tex]. This [tex]\bar{z}[/tex] may or may not belong to int(C). I reckon if [tex]y \in \textup{bd}(B)[/tex], then the [tex]\bar{z}[/tex] does not belong to int(C).
I don't think it goes well following this line of argument. Need some help.
A set is convex if it contains all the points on the line segment connecting any two points within the set.
One example could be the set of all points within a circle and the set of all points within a square. Both of these sets are convex because any two points within the set can be connected by a line segment that is also within the set.
Set addition is defined as the set of all points that can be obtained by adding any point from one set to any point from the other set. In other words, for nonempty convex sets A and B, A + B = {a + b | a ∈ A, b ∈ B}.
The statement "C = A + B" means that the set C contains all the points that can be obtained by adding any point from set A to any point from set B. This is important because it allows us to understand the relationship between the sets A, B, and C and how they are connected through set addition.
Set addition of nonempty convex sets is closely related to the concept of convex combinations. A convex combination of points from two sets A and B is any point that can be obtained by taking a weighted average of points from A and B, where the weights are nonnegative and sum to 1. In other words, set addition can be seen as a generalization of convex combinations to sets.