How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
A finitely generated cone in Euclidean space is closed
Statement
For any finite list , including the empty list, the cone
is a closed convex subset of .
Facts & Assumptions
Given: The vectors and cone in the Statement, with the Euclidean inner product of The Euclidean inner product on .
Every finite-dimensional normed subspace is closed in its ambient normed space, including the zero subspace (A finite-dimensional normed subspace is closed).
For finite real vectors , (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
Proof
Every has a representation whose positive-coefficient vectors are linearly independent. Start with any nonnegative coefficient list and discard its zero coefficients. If its remaining vectors are dependent, take a nonzero relation and change its sign so some . For the current positive coefficients , put . Replacing each by preserves the represented vector, leaves every coefficient nonnegative, and makes at least one positive coefficient zero. Repeating at most times leaves an independent positive support.
Fix an independent index set and let have columns , . Its Gram matrix is invertible: for every nonzero , by independence. Put , define on , and set . Applying [F2] to each row gives , so is Lipschitz with finite constant , hence continuous. On the closed subspace it satisfies . Hence is closed: is closed by [F1], the nonnegative orthant is closed, and is continuous. For this cone is , also closed.
By step 1.1, is the union of the cones in step 1.2 over independent subsets . There are only finitely many such subsets, so this union is closed. Each component is a convex cone, and directly taking nonnegative combinations shows is convex.
Depends on
- A finite-dimensional normed subspace is closed
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
Used by
Dependency tree · two levels
36 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Nocedal and Wright, Numerical Optimization, second edition (standard reference, not scraped)
- Boyd and Vandenberghe, Convex Optimization (standard reference, not scraped)