I want to prove that given a family of vectors $(u_1,...,u_m)$ in $\mathbb{R}^n$ : $$C = \Big\{ \sum_{i=1}^{m} \alpha_i u_i,\; \alpha_i\geq 0 \; \: \forall i \in\{1,..,m\} \Big\} $$ is closed. It is easy to prove when $(u_1,...,u_m)$ are linearly independent. Next, if we take $I \subset \{1,...m\} $ s.t $(u_i)_{i\in I}$ are a linearly independent subfamily, I'd want to show that: $$\bigcup_{I} C_I = C $$ where $C_I := \Big\{ \sum_{i \in I} \alpha_i u_i,\; \alpha_i\geq 0 \; \: \forall i \in I \Big\} $. The inclusion $\bigcup_{I} C_I \subset C $ is clear but it is the reciprocal inclusion that I am having trouble with.
2026-03-27 11:49:00.1774612140
Proof the conic hull of a finite set of vectors is closed
444 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in CONVEX-ANALYSIS
- Proving that: $||x|^{s/2}-|y|^{s/2}|\le 2|x-y|^{s/2}$
- Convex open sets of $\Bbb R^m$: are they MORE than connected by polygonal paths parallel to the axis?
- Show that this function is concave?
- In resticted domain , Applying the Cauchy-Schwarz's inequality
- Area covered by convex polygon centered at vertices of the unit square
- How does positive (semi)definiteness help with showing convexity of quadratic forms?
- Why does one of the following constraints define a convex set while another defines a non-convex set?
- Concave function - proof
- Sufficient condition for strict minimality in infinite-dimensional spaces
- compact convex sets
Related Questions in CONVEX-OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- Least Absolute Deviation (LAD) Line Fitting / Regression
- Check if $\phi$ is convex
- Transform LMI problem into different SDP form
- Can a linear matrix inequality constraint transform to second-order cone constraint(s)?
- Optimality conditions - necessary vs sufficient
- Minimization of a convex quadratic form
- Prove that the objective function of K-means is non convex
- How to solve a linear program without any given data?
- Distance between a point $x \in \mathbb R^2$ and $x_1^2+x_2^2 \le 4$
Related Questions in CONVEX-GEOMETRY
- Lemma 1.8.2 - Convex Bodies: The Brunn-Minkowski Theory
- Why does one of the following constraints define a convex set while another defines a non-convex set?
- Is the logarithm of Banach-Mazur distance between convex bodies an actual distance?
- Convex set in $\mathbb{R}^2_+$
- Unit-length 2D curve segment with maximal width along all directions
- A point in a convex hull
- Geometric proof of Caratheodory's theorem
- The permutations of (1,1,0,0), (-1,1,0,0), (-1,-1,0,0) are vertices of a polytope.
- Computing the subgradient of an indicator function or the normal cone of a set
- 3 Dimensional space
Related Questions in CONVEX-HULLS
- Is every finite descending sequence in [0,1] in convex hull of certain points?
- What exactly the Ellipsoid method does?
- Why is the determinant test attractive for the Convex Hull algorithm?
- Unit-length 2D curve segment with maximal width along all directions
- A point in a convex hull
- Why is Sklansky algorithm convex hull wrong
- Proving this convex hull lemma
- Why do we check $n^2 - n$ pairs of points in SlowConvexHull algorithm?
- Convex combination of $2^n$ vectors from cartesian products of half-spaces
- There exists $\vec{w}$ such that $\vec{\beta}_j\cdot \vec{w}>0$ $\iff$ the origin is not in the convex hull of $\vec{\beta}_j$ and $\vec{e}_i$.
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Suppose $x$ is in the convex conical hull, then $x = \sum_k \alpha_k u_k$ for some $\alpha_k \ge 0$. We can presume that none of the $u_k$ are zero.
If $\sum_k \alpha_k = 0$ then we can write $x = 0 = 0 u_1$, so we can suppose that $\alpha_k > 0$ for all $k$.
If the $u_k$ are linearly dependent, there are $\beta_k$ not all zero such that $\sum_k \beta_k u_k = 0$ and so $\sum_k \alpha_ku_k = \sum_k (\alpha_k + s \beta_k) u_k$ for any $s$.
Let $k_* \in \operatorname{argmin}_k \{ | { \alpha_k \over \beta_k} | | \beta_k \neq 0 \}$ and $s_* = -{\alpha_{k_*} \over \beta_{k_*}}$. Then $\alpha_{k_*} + s \beta_{k_*} = 0$, $\alpha_k + s \beta_k \ge 0$ for all $k$ and so $x$ lies in the convex conic hull of $u_k$, $k \neq k_*$. This can be repeated as long as the remaining $u_k$ are linearly dependent.
In particular, if $x \in \operatorname{cone} \{ u_\alpha \}$, it lies in the convex conical hull of a linearly independent subset of $ \{ u_\alpha \}$.